Aberrations theory of a time dependent magnetic field lens

We analyze new forms of aberrations affecting a time dependent magnetic field lens recently proposed. The lens consist of an axially symmetric ellipsoidal solenoid producing a spatially uniform but time pulsating homogeneous field. The dynamics of electrons emitted by some object and injected into this coil shows that this system is capable of focusing a parallel beam or produce images free of geometrical aberrations. The cardinal elements of this lens change periodically in positions and therefore to obtain a stationary image it is necessary to employ a chopped electron beam. Two forms of aberrations originate from the finite duration of the electron pulse and the energy dispersion of the incoming beam (chromatic aberration). Their image degradation effects are quite similar and result from recording different axially displaced images at some fixed stationary plane. We show how, by adjusting the parameters characterizing the magnetic pulse and introducing small apertures that increase the depth of focus, their effects can be reduced or in some cases eliminated. Other forms of instrumental aberrations characteristic of this time dependent magnetic field lens are briefly discussed.     

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.     

Evidences of phase separation in moisture‐cured poly(urethane urea)s by means of temperature modulated differential scanning calorimetry

The degree of phase separation in several moisture‐cured poly(urethane urea)s (PUUs) was studied by FTIR spectroscopy, wide angle X‐ray diffraction (WAXD), and temperature‐modulated differential scanning calorimetry (TMDSC). This latter technique was shown to be particularly useful in analysing the degree of phase separation in PUU polymers. Both phase mixing and phase segregation coexisted in the PUUs and the degree of phase separation increased as the urea hard segment (HS) content in the PUU increased. The maximum solubility of urea HSs into the polyol soft segments (SSs) was achieved for 50 wt % urea HS content in diol‐based PUUs, whereas for triol‐based PUUs the highest solubility between HS and SS was reached for lower urea HS amount. Finally, the higher the urea HS content the higher the extent of phase separation in the PUU. © 2007 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 45: 3034–3045, 2007     

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.     

Left, right, and inner socles of associative systems

We investigate the basic properties of the different socles that can be considered in not necessarily semiprime associative systems. Among other things, we show that the socle defined as the sum of minimal (or minimal and trivial) inner ideals is always an ideal. When trivial inner ideals are included, this inner socle contains the socles defined in terms of minimal left or right ideals. This revised version was published online in June 2006 with corrections to the Cover Date.