Efficient linear programming algorithm for the transmission network expansion planning problem

The transmission network planning problem is a non-linear integer mixed programming problem (NLIMP). Most of the algorithms used to solve this problem use a linear programming subroutine (LP) to solve LP problems resulting from planning algorithms. Sometimes the resolution of these LPs represents a major computational effort. The particularity of these LPs in the optimal solution is that only some inequality constraints are binding. This task transforms the LP into an equivalent problem with only one equality constraint (the power flow equation) and many inequality constraints, and uses a dual simplex algorithm and a relaxation strategy to solve the LPs. The optimisation process is started with only one equality constraint and, in each step, the most unfeasible constraint is added. The logic used is similar to a proposal for electric systems operation planning. The results show a higher performance of the algorithm when compared to primal simplex methods.

Peircean semiotics and subject indexing: Contributions of speculative grammar and pure logic

The semiotics of C S. Peirce presents fundamental concepts to discover aspects of the indexing process, including representation and classes of signs. However, we still know little of its theoretical potential for subject indexing. We believe that the main difficulty in the proposals to understand the process of subject indexing based on Peircean semiotics stems from an incomplete interpretation of his semiotic system. This paper attempts to describe the contributions of Peircean semiotics to subject indexing. First, we analyze some of the concepts of the branches of semiotics, after which, we discuss strategies for conceptual approximation. Secondly, and aiming to raise the level of interlocution between the areas, we intend to argue that subject indexing is an inferential process, as explained by the second branch of semiotics. Thus, we seek to go beyond the level of speculative grammar, the first branch of semiotics, to forge a closer link with pure or critical logic, the second branch. We conclude that the indexer's work does not produce a mere reflection of what already exists in documents, but involves an instigating action to discover, through the inferential matrix, the meaning of a text in order to find the subject and the most appropriate subject added entry to the information system.

Automatic Indexing and Information Visualization: A Study Based on Paraconsistent Logic

This paper reports a research to evaluate the potential and the effects of use of annotated Paraconsistent logic in automatic indexing. This logic attempts to deal with contradictions, concerned with studying and developing inconsistency-tolerant systems of logic. This logic, being flexible and containing logical states that go beyond the dichotomies yes and no, permits to advance the hypothesis that the results of indexing could be better than those obtained by traditional methods. Interactions between different disciplines, as information retrieval, automatic indexing, information visualization, and nonclassical logics were considered in this research. From the methodological point of view, an algorithm for treatment of uncertainty and imprecision, developed under the Paraconsistent logic, was used to modify the values of the weights assigned to indexing terms of the text collections. The tests were performed on an information visualization system named Projection Explorer (PEx), created at Institute of Mathematics and Computer Science (ICMC - USP Sao Carlos), with available source code. PEx uses traditional vector space model to represent documents of a collection. The results were evaluated by criteria built in the information visualization system itself, and demonstrated measurable gains in the quality of the displays, confirming the hypothesis that the use of the para-analyser under the conditions of the experiment has the ability to generate more effective clusters of similar documents. This is a point that draws attention, since the constitution of more significant clusters can be used to enhance information indexing and retrieval. It can be argued that the adoption of non-dichotomous (non-exclusive) parameters provides new possibilities to relate similar information.