A Potent Mimetic of the Siglec-8 Ligand 6’-Sulfo-Sialyl Lewisx

Siglecs are members of the immunoglobulin gene family containing sialic acid binding N-terminal domains. Among them, Siglec-8 is expressed on various cell types of the immune system such as eosinophils, mast cells and weakly on basophils. Cross-linking of Siglec-8 with monoclonal antibodies triggers apoptosis in eosinophils and inhibits degranulation of mast cells, making Siglec-8 a promising target for the treatment of eosinophil- and mast cell-associated diseases such as asthma. The tetrasaccharide 6’-sulfo-sialyl Lewis^x has been identified as a specific Siglec-8 ligand in glycan array screening. Here, we describe an extended study enlightening the pharmacophores of 6’-sulfo-sialyl Lewis^x and the successful development of a high-affinity mimetic. Retaining the neuraminic acid core, the introduction of a carbocyclic mimetic of the Gal moiety and a sulfonamide substituent in the 9-position gave a 20-fold improved binding affinity. Finally, the residence time, which usually is the Achilles tendon of carbohydrate/lectin interactions, could be improved.     

Controllability of One Spin and Two Interacting Spins

Mathematics of Control, Signals, and Systems - ?We consider the problem of steering control for the systems of one spin ½ particle and two interacting spin ½ particles in an...     

A Neural Network Model of Caenorhabditis Elegans: The Circuit of Touch Sensitivity

The paper presents a neural network model of the touch sensitivity circuit of the nematode Caenorhabditis elegans. We describe a serie of simulations in which neural networks are trained, using a genetic algorithm, to reproduce the habituation of the nematode's touch sensitive behavior. A lesion study of the network allows to make a direct comparison between the fine functioning of the model and the data collected in real organisms. The model accords well with the known neurobiological data and it suggests some hypotheses about the functioning of the neural circuit and of single neurons.     

Convolution profiles for right inversion of multivariable non-minimum phase discrete-time systems

The problem of the non-causal inversion of linear multivariable discrete-time systems is analyzed in the geometric approach framework and is solved through the computation of convolution profiles which guarantee perfect tracking under the assumption of infinite-length preaction and postaction time intervals. It is shown how the shape of the convolution profiles is related to both the relative degree and the invariant zeros of the plant. A computational setting for the convolution profiles is derived by means of the standard geometric approach tools. Feasibility constraints are also taken into account. A possible implementation scheme, based on a finite impulse response system acting on a stabilized control loop, is provided.     

From information to probability: An axiomatic approach—Inference is information processing

We define the very rich language of composed conditionals on a three‐valued logic and use this language as the communication tool between man and machine. Communication takes place for three reasons: knowledge acquisition, query, and response. Learning, thinking, and answering questions are of a pure information theoretical nature. The pivot of this knowledge processing concept is the amount of information (bit) we receive if a conditional becomes true. We follow an axiomatic approach to information theory rather than the classical probabilistic approach of Shannon; information comes first, and then comes probability. In the light of this philosophy, query and response experience new interpretations. Both, acquisition and response are realized by maximizing entropy and minimizing relative entropy, respectively. The iterative solution of these mathematical optimization problems gives new insights into the adaptation of prior knowledge to new information. Our expert system shell SPIRIT supports this kind of knowledge processing, which will be established by suitable examples. © 2003 Wiley Periodicals, Inc.     

Fast, large-scale model predictive control by partial enumeration

Partial enumeration (PE) is presented as a method for treating large, linear model predictive control applications that are out of reach with available MPC methods. PE uses both a table storage method and online optimization to achieve this goal. Versions of PE are shown to be closed-loop stable. PE is applied to an industrial example with more than 250 states, 32 inputs, and a 25-sample control horizon. The performance is less than 0.01% suboptimal, with average speedup factors in the range of 80-220, and worst-case speedups in the range of 4.9-39.2, compared to an existing MPC method. Small tables with only 25-200 entries were used to obtain this performance, while full enumeration is intractable for this example.     

Good teaching inputs do not correspond to desired responses in ecological neural networks

In this paper we analyze how supervised learning occurs in ecological neural networks, i.e. networks that interact with an autonomous external environment and, therefore, at least partially determine with their behavior their own input. Using an evolutionary method for selecting good teaching inputs we surprisingly find that to obtain a desired outputX it is better to use a teaching input different fromX. To explain this fact we claim that teaching inputs in ecological networks have two different effects: (a) to reduce the discrepancy between the actual output of the network and the teaching input, (b) to modify the network's behavior and, as a consequence, the network's learning experiences. Evolved teaching inputs appear to represent a compromise between these two needs. We finally show that evolved teaching inputs that are allowed to change during the learning process function differently at different stages of learning, first giving more weight to (b) and, later on, to (a).