Downhill kinetics of biomolecular interface binding: Globally connected scenario

We study the kinetics of the biomolecular binding process at the interface using energy landscape theory. The global kinetic connectivity case is considered for a downhill funneled energy landscape. By solving the kinetic master equation, the kinetic time for binding is obtained and shown to have a U-shape curve-dependence on the temperature. The kinetic minimum of the binding time monotonically decreases when the ratio of the underlying energy gap between native state and average non-native states versus the roughness or the fluctuations of the landscape increases. At intermediate temperatures,fluctuations measured by the higher moments of the binding time lead to non-Poissonian, non-exponential kinetics. At both high and very low temperatures, the kinetics is nearly Poissonian and exponential.

Quantifying the kinetic paths of flexible biomolecular recognition

Biomolecular recognition often involves large conformational changes, sometimes even local unfolding. The identification of kinetic pathways has become a central issue in understanding the nature of binding. A new approach is proposed here to study the dynamics of this binding-folding process through the establishment of a path-integral framework on the underlying energy landscape. The dominant kinetic paths of binding and folding can be determined and quantified. The significant coupling between the binding and folding of biomolecules often exists in many important cellular processes. In this case, the corresponding kinetic paths of binding are shown to be intimately correlated with those of folding and the dynamics becomes quite cooperative. This implies that binding and folding happen concurrently. When the coupling between binding and folding is weak (strong), the kinetic process usually starts with significant folding (binding) first, with the binding (folding) later proceeding to the end. The kinetic rate can be obtained through the contributions from the dominant paths. The rate is shown to have a bell-shaped dependence on temperature in the concentration-saturated regime consistent with experiment. The changes of the kinetics that occur upon changing the parameters of the underlying binding-folding energy landscape are studied.

A self-consistent field theory study on the morphologies of linear ABCBA and H-shaped (AB)(2)C(BA)(2) block copolymers

By using a combinatorial screening method based on the self-consistent field theory, we investigate the equilibrium morphologies of linear ABCBA and H-shaped (AB)(2)C(BA)(2) block copolymers in two dimensions. The triangle phase diagrams of both block copolymers are constructed by systematically varying the volume fractions of blocks A, B, and C. In this study, the interaction energies between species A, B, and C are set to be equal. Four different equilibrium morphologies are identified, i.e., the lamellar phase (LAM), the hexagonal lattice phase (HEX), the core-shell hexagonal lattice phase (CSH), and the two interpenetrating tetragonal lattice phase (TET2). For the linear ABCBA block copolymer, the reflection symmetry is observed in the phase diagram except for some special grid points, and most of grid points are occupied by LAM morphology. However, for the H-shaped (AB)(2)C(BA)(2) block copolymer, most of the grid points in the triangle phase diagram are occupied by CSH morphology, which is ascribed to the different chain architectures of the two block copolymers. These results may help in the design of block copolymers with different microstructures.

Comparing the morphology and phase diagram of H-shaped ABC block copolymers and linear ABC block copolymers

By using a combinatorial screening method based on the self-consistent field theory (SCFT) for polymers, we have investigated the morphology of H-shaped ABC block copolymers (A(2)BC(2)) and compared them with those of the linear ABC block copolymers. By changing the ratios of the volume fractions of two A arms and two C arms, one can obtain block copolymers with different architectures ranging from linear block copolymer to H-shaped block copolymer. By systematically varying the volume fractions of block A, B, and C, the triangle phase diagrams of the H-shaped ABC block copolymer with equal interactions among the three species are constructed. In this study, we find four different morphologies ( lamellar phase ( LAM), hexagonal lattice phase ( HEX), core-shell hexagonal lattice phase (CSH), and two interpenetrating tetragonal lattice (TET2)). Furthermore, the order-order transitions driven by architectural change are discussed.

Sol-gel fabrication and photoluminescence properties of SiO2@Gd2O3 : Eu3+ core-shell particles

A uniform nanolayer of europium-doped Gd2O3 was coated on the surface of preformed submicron silica spheres by a Pechini sol-gel process. The resulted SiO2@Gd2O3:Eu3+ core-shell structured phosphors were characterized by X-ray diffraction (XRD), Fourier transform infrared spectroscopy (FT-IR), field emission scanning electron microscopy (FESEM), transmission electron microscopy (TEM), photoluminescence (PL) spectra as well as kinetic decays. The XRD results show that the Gd2O3:Eu3+ layers start to crystallize on the SiO2 spheres after annealing at 400 degrees C and the crystallinity increases with raising the annealing temperature. The core-shell phosphors possess perfect spherical shape with narrow size distribution (average size: 640 nm) and non-agglomeration. The thickness of the Gd2O3:Eu3+ shells on the SiO2 cores can be adjusted by changing the deposition cycles (70 nm for three deposition cycles). Under short UV excitation, the obtained SiO2@Gd2O3:Eu3+ particles show a strong red emission with D-5(0)-F-7(2) (610 nm) of Eu3+ as the most prominent group.The PL intensity of Eu3+ increases with increasing the annealing temperature and the number of coating cycles.

Thermodynamical study on pressure-induced compatibility in UCST polymer-containing mixtures

The present calculations were performed on the basis of the Sanchez-Lacombe lattice fluid theory and the new combinatorial rules for block copolymer according to the experimental results on the pressure-induced compatibility in poly(ethylene oxide) (PEO) and poly(ethylene oxide-b-dimethylsiloxane) (P(EO-b-DMS)) mixtures with UCST behavior. The study on enthalpy, combinatorial entropy, vacancy entropy and Gibbs energy upon mixture shows that Sanchez-Lacombe fluid theory and the new combinatorial rules could describe the pressure-induced compatibility (PIC) of polymer mixtures with UCST behavior well.

Thermodynamics of PMMA/SAN blends: Application of the Sanchez-Lacombe lattice fluid theory

Polymer blends of poly(methyl methacrylate) (PMMA) and poly(styrene-co-acrylonitrile) (SAN) with an acrylonitrile content of about 30 wt % were prepared by means of solution-casting and characterized by virtue of pressure-volume-temperature (PVT) dilatometry. The Sanchez-Lacombe (SL) lattice fluid theory was used to calculate the spinodals, the binodals, the Flory-Huggins (FH) interaction parameter, the enthalpy of the mixing, the volume change of the mixing, and the combinatorial and vacancy entropies of the mixing for the PMMA/SAN system. A new volume-combining rule was used to evaluate the close-packed volume per mer, upsilon*, of the PMMA/SAN blends. The calculated results showed that the new and the original volume-combining rules had a slight influence on the FH interaction parameter, the enthalpy of the mixing, and the combinatorial entropy of the mixing. Moreover, the spinodals and the binodals calculated with the SL theory by means of the new volume-combining rule could coincide with the measured data for the PMMA/SAN system with a lower critical solution temperature, whereas those obtained by means of the original one could not.

儿童汉字意识及精细辨认能力的发展研究

The important basis for the children to study chinese character is the Chinese character awareness, which means the understanding and extracting of the Chinese character combinatorial rule. The perceptual learning intrinsically is the direct perceive to the invariant rules. As the important mechanism to extract the abstract rule, the perceptual learning is the important mechanism of the development of the Chinese character awareness also. 4-6-year-old children's Chinese character awareness are tested by the degree of acceptance to the graphic words, inlaying words and pseudowords. The perceptual disintegration are tested by the perceptual learning experiment. Moreover, the development of the ability to finely-identify the Chinese character under the different level of attention condition is explored. The result suggests the quality to the development of the children's Chinese character awareness: The Chinese character awareness to 4-year-old children is in the rudiment stage, and it have different qualities as the change of the age. As the mechanism of the Chinese character awareness, the perceptual learning have an complex correlation to the awareness. The result indicates the following effects of the children perceptual disintegration: the level of the perceptual disintegration is transitive from three-dimension confusion to one-dimension falsity. It have correlation with the ability to finely-identify the Chinese character to a certain degree. The result also shows: the developmental specialties of the ability to finely-identify the Chinese character are different in the different age. The ability to finely-identify the Chinese character under the different level of attention condition have very similar processes.

Coherent Behavior from Incoherent Knowledge Sources in the Automatic Synthesis of Numerical Computer Programs

A fundamental problem in artificial intelligence is obtaining coherent behavior in rule-based problem solving systems. A good quantitative measure of coherence is time behavior; a system that never, in retrospect, applied a rule needlessly is certainly coherent; a system suffering from combinatorial blowup is certainly behaving incoherently. This report describes a rule-based problem solving system for automatically writing and improving numerical computer programs from specifications. The specifications are in terms of "constraints" among inputs and outputs. The system has solved program synthesis problems involving systems of equations, determining that methods of successive approximation converge, transforming recursion to iteration, and manipulating power series (using differing organizations, control structures, and argument-passing techniques).

Hypothesis Formation and Evaluation in Medical Diagnosis

This thesis describes some aspects of a computer system for doing medical diagnosis in the specialized field of kidney disease. Because such a system faces the spectre of combinatorial explosion, this discussion concentrates on heuristics which control the number of concurrent hypotheses and efficient "compiled" representations of medical knowledge. In particular, the differential diagnosis of hematuria (blood in the urine) is discussed in detail. A protocol of a simulated doctor/patient interaction is presented and analyzed to determine the crucial structures and processes involved in the diagnosis procedure. The data structure proposed for representing medical information revolves around elementary hypotheses which are activated when certain disposing of findings, activating hypotheses, evaluating hypotheses locally and combining hypotheses globally is examined for its heuristic implications. The thesis attempts to fit the problem of medical diagnosis into the framework of other Artifcial Intelligence problems and paradigms and in particular explores the notions of pure search vs. heuristic methods, linearity and interaction, local vs. global knowledge and the structure of hypotheses within the world of kidney disease.

The Definition and Implementation of a Computer Programming Language Based on Constraints

The constraint paradigm is a model of computation in which values are deduced whenever possible, under the limitation that deductions be local in a certain sense. One may visualize a constraint 'program' as a network of devices connected by wires. Data values may flow along the wires, and computation is performed by the devices. A device computes using only locally available information (with a few exceptions), and places newly derived values on other, locally attached wires. In this way computed values are propagated. An advantage of the constraint paradigm (not unique to it) is that a single relationship can be used in more than one direction. The connections to a device are not labelled as inputs and outputs; a device will compute with whatever values are available, and produce as many new values as it can. General theorem provers are capable of such behavior, but tend to suffer from combinatorial explosion; it is not usually useful to derive all the possible consequences of a set of hypotheses. The constraint paradigm places a certain kind of limitation on the deduction process. The limitations imposed by the constraint paradigm are not the only one possible. It is argued, however, that they are restrictive enough to forestall combinatorial explosion in many interesting computational situations, yet permissive enough to allow useful computations in practical situations. Moreover, the paradigm is intuitive: It is easy to visualize the computational effects of these particular limitations, and the paradigm is a natural way of expressing programs for certain applications, in particular relationships arising in computer-aided design. A number of implementations of constraint-based programming languages are presented. A progression of ever more powerful languages is described, complete implementations are presented and design difficulties and alternatives are discussed. The goal approached, though not quite reached, is a complete programming system which will implicitly support the constraint paradigm to the same extent that LISP, say, supports automatic storage management.

The Geometry of Frequency Squares

Mavron, Vassili; Jungnickel, D.; McDonough, T.P., (2001) 'The Geometry of Frequency Squares', Journal of Combinatorial Theory, Series A 96, pp.376-387 RAE2008

A Lower-Bound Result on the Power of a Genetic Algorithm

This paper presents a lower-bound result on the computational power of a genetic algorithm in the context of combinatorial optimization. We describe a new genetic algorithm, the merged genetic algorithm, and prove that for the class of monotonic functions, the algorithm finds the optimal solution, and does so with an exponential convergence rate. The analysis pertains to the ideal behavior of the algorithm where the main task reduces to showing convergence of probability distributions over the search space of combinatorial structures to the optimal one. We take exponential convergence to be indicative of efficient solvability for the sample-bounded algorithm, although a sampling theory is needed to better relate the limit behavior to actual behavior. The paper concludes with a discussion of some immediate problems that lie ahead.

Cryptographic Tamper Evidence

We propose a new notion of cryptographic tamper evidence. A tamper-evident signature scheme provides an additional procedure Div which detects tampering: given two signatures, Div can determine whether one of them was generated by the forger. Surprisingly, this is possible even after the adversary has inconspicuously learned (exposed) some-or even all-the secrets in the system. In this case, it might be impossible to tell which signature is generated by the legitimate signer and which by the forger. But at least the fact of the tampering will be made evident. We define several variants of tamper-evidence, differing in their power to detect tampering. In all of these, we assume an equally powerful adversary: she adaptively controls all the inputs to the legitimate signer (i.e., all messages to be signed and their timing), and observes all his outputs; she can also adaptively expose all the secrets at arbitrary times. We provide tamper-evident schemes for all the variants and prove their optimality. Achieving the strongest tamper evidence turns out to be provably expensive. However, we define a somewhat weaker, but still practical, variant: α-synchronous tamper-evidence (α-te) and provide α-te schemes with logarithmic cost. Our α-te schemes use a combinatorial construction of α-separating sets, which might be of independent interest. We stress that our mechanisms are purely cryptographic: the tamper-detection algorithm Div is stateless and takes no inputs except the two signatures (in particular, it keeps no logs), we use no infrastructure (or other ways to conceal additional secrets), and we use no hardware properties (except those implied by the standard cryptographic assumptions, such as random number generators). Our constructions are based on arbitrary ordinary signature schemes and do not require random oracles.

Orientational Harmonic Model for Rotation, Translation, and Scale Invariant Pattern Representation in Biological Vision

The proposed model, called the combinatorial and competitive spatio-temporal memory or CCSTM, provides an elegant solution to the general problem of having to store and recall spatio-temporal patterns in which states or sequences of states can recur in various contexts. For example, fig. 1 shows two state sequences that have a common subsequence, C and D. The CCSTM assumes that any state has a distributed representation as a collection of features. Each feature has an associated competitive module (CM) containing K cells. On any given occurrence of a particular feature, A, exactly one of the cells in CMA will be chosen to represent it. It is the particular set of cells active on the previous time step that determines which cells are chosen to represent instances of their associated features on the current time step. If we assume that typically S features are active in any state then any state has K^S different neural representations. This huge space of possible neural representations of any state is what underlies the model's ability to store and recall numerous context-sensitive state sequences. The purpose of this paper is simply to describe this mechanism.