The Cytotoxic Effect of α-Synuclein Aggregates

Parkinson's disease is a neurodegenerative disorder involving a functional protein, α-synuclein, whose primary function is related to vesicle trafficking. However, α-synuclein is prone to form aggregates, and these inclusions, known as Lewy bodies, are the hallmark of Parkinson's disease. α-synuclein can alter its conformation and acquire aggregating capacity, forming aggregates containing β-sheets. This protein's pathogenic importance is based on its ability to form oligomers that impair synaptic transmission and neuronal function by increasing membrane permeability and altering homeostasis, generating a deleterious effect over cells. First, we establish that oligomers interfere with the mechanical properties of 1,2-dioleoyl-sn-glycero-3-phosphocholine (DOPC) membrane, as demonstrated by nanoindentation curves. In contrast, nanoindentation revealed that the α-synuclein monomer's presence leads to a much more resistant lipid bilayer. Moreover, the oligomers’ interaction with cell membranes can promote lactate dehydrogenase (LDH) release, suggesting the activation of cytotoxic events.     

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.     

Reliability and expectation bounds for coherent systems with exchangeable components

Sharp upper and lower bounds are obtained for the reliability functions and the expectations of lifetimes of coherent systems based on dependent exchangeable absolutely continuous components with a given marginal distribution function, by use of the concept of Samaniego's signature. We first show that the distribution of any coherent system based on exchangeable components with absolutely continuous joint distribution is a convex combination of distributions of order statistics (equivalent to the k-out-of-n systems) with the weights identical with the values of the Samaniego signature of the system. This extends the Samaniego representation valid for the case of independent and identically distributed components. Combining the representation with optimal bounds on linear combinations of distribution functions of order statistics from dependent identically distributed samples, we derive the corresponding reliability and expectation bounds, dependent on the signature of the system and marginal distribution of dependent components. We also present the sequences of exchangeable absolutely continuous joint distributions of components which attain the bounds in limit. As an application, we obtain the reliability bounds for all the coherent systems with three and four exchangeable components, expressed in terms of the parent marginal reliability function and specify the respective expectation bounds for exchangeable exponential components, comparing them with the lifetime expectations of systems with independent and identically distributed exponential components.     

Dynamics on the Virasoro group, 2D gravity and hidden symmetries

We derive the action of 2D gravity from the two-cocycle of the Virasoro group by using a previously introduced method for constructing a dynamical system from a Lie group. A natural construction and explanation of the hidden SL(2, )-Kac-Moody symmetry, of general applicability, is provided. We also show how the proper quantization goes beyond the ordinary co-adjoint orbit method, and the possible connection with the Poisson-Lie groups.     

On the Cartan–Jacobson Theorem

The well-known Cartan–Jacobson theorem claims that the Lie algebra of derivations of a Cayley algebra is central simple if the characteristic is not 2 or 3. In this paper we have studied these two cases, with the following results: if the characteristic is 2, the theorem is also true, but, if the characteristic is 3, the derivation algebra is not simple. We have also proved that in this last case, there is a unique nonzero proper seven-dimensional ideal, which is a central simple Lie algebra of type A₂, and the quotient of the derivation algebra modulo this ideal turns out to be isomorphic, as a Lie algebra, to the ideal itself. The original motivation of this work was a series of computer-aided calculations which proved the simplicity of derivation algebras of Cayley algebras in the case of characteristic not 3. These computations also proved the existence of a unique nonzero proper ideal (which turns out to be seven-dimensional) in the algebra of derivations of split Cayley algebras in characteristic 3.