A Genetic Search for Exploiting a Fuzzy Preference Model of Portfolio Problems with Public Projects

When an organization solves a portfolio problem with public projects evaluated by multiple criteria, in which the economic dimension is not essential or not well characterized, the classical methods are not useful. We propose a non-linear preference model developed from normative Value Theory and using fuzzy sets to model some sources of imprecision. This model can be considered as a generalization of the classical approaches. However, the optimization problem is very complex in order to be solved with non-linear programming techniques. Therefore, the model is exploited by an evolutionary algorithm, able to achieve a strong improvement of the quality of solution.     

On a Definitizable Analog of the Trigonometric Moment Problem Generating an Indefinite Toeplitz Form

We prove the existence of an integro-polynomial representation for a sequence of numbers such that there exists a difference operator mapping this sequence to a sequence that generates the solvable trigonometric moment problem. A similar result related to the power moment problem was given in [12].     

Observation of ionic thermocurrents in zirconia-based solid electrolytes

In ionic conductors, long range-migrating charges are a main cause of polarization processes. This has complicated, up to date, the study of ionic thermocurrents (ITC) in solid electrolytes. However, the method is appealing, as it probes directly charge-formation phenomena that are important both from a scientific point of view and for applications. This work reports on the observation of ITC in solid electrolytes. Under appropriate experimental conditions, the ITC response of a zirconia sample electroded with platinum is a reproducible one, thus opening the way to a new characterization method that may complement other well established methods, such as Impedance Spectroscopy and a number of electrochemical techniques. The general trends of the response, which is composed of two well resolved ITC peaks, is discussed. One of them, taking place at higher temperatures, conforms to the standard shape of a first order kinetics depolarization process. Paper presented at the 2nd Euroconference on Solid State Ionics, Funchal, Madeira, Portugal, Sept. 10–16, 1995     

Indexing text using the Ziv–Lempel trie

Let a text of u characters over an alphabet of size σ be compressible to n phrases by the LZ78 algorithm. We show how to build a data structure based on the Ziv–Lempel trie, called the LZ-index, that takes 4nlog₂n(1+o(1)) bits of space (that is, 4 times the entropy of the text for ergodic sources) and reports the R occurrences of a pattern of length m in worst case time O(m³logσ+(m+R)logn). We present a practical implementation of the LZ-index, which is faster than current alternatives when we take into consideration the time to report the positions or text contexts of the occurrences found.     

Practical algorithms for transposition-invariant string-matching

We consider the problems of (1) longest common subsequence (LCS) of two given strings in the case where the first may be shifted by some constant (that is, transposed) to match the second, and (2) transposition-invariant text searching using indel distance. These problems have applications in music comparison and retrieval. We introduce two novel techniques to solve these problems efficiently. The first is based on the branch and bound method, the second on bit-parallelism. Our branch and bound algorithm computes the longest common transposition-invariant subsequence (LCTS) in time O((m²+loglogσ)logσ) in the best case and O((m²+logσ)σ) in the worst case, where m and σ, respectively, are the length of the strings and the size of the alphabet. On the other hand, we show that the same problem can be solved by using bit-parallelism and thus obtain a speedup of O(w/logm) over the classical algorithms, where the computer word has w bits. The advantage of this latter algorithm over the present bit-parallel ones is that it allows the use of more complex distances, including general integer weights. Since our branch and bound method is very flexible, it can be further improved by combining it with other efficient algorithms such as our novel bit-parallel algorithm. We experiment on several combination possibilities and discuss which are the best settings for each of those combinations. Our algorithms are easily extended to other musically relevant cases, such as δ-matching and polyphony (where there are several parallel texts to be considered). We also show how our bit-parallel algorithm is adapted to text searching and illustrate its effectiveness in complex cases where the only known competing method is the use of brute force.     

Asymptotic stability of semigroups associated with linear weak dissipative systems with memory

We study the asymptotic behavior of the solutions of a class of linear dissipative integral differential equations. We show in the abstract setting a necessary and sufficient condition to get an exponential decay of the solution. In the case of the lack of exponential decay, we find the polynomial rate of decay of the solution. Some examples are given.