Computer simulation of random parckings for self-similar particle size distributions in soil and granular materials: porosity and pore size distribution

A 2D computer simulation method of random packings is applied to sets of particles generated by a self-similar uniparametric model for particle size distributions (PSDs) in granular media. The parameter p which controls the model is the proportion of mass of particles corresponding to the left half of the normalized size interval [0,1]. First the influence on the total porosity of the parameter p is analyzed and interpreted. It is shown that such parameter, and the fractal exponent of the associated power scaling, are efficient packing parameters, but this last one is not in the way predicted in a former published work addressing an analogous research in artificial granular materials. The total porosity reaches the minimum value for p = 0.6. Limited information on the pore size distribution is obtained from the packing simulations and by means of morphological analysis methods. Results show that the range of pore sizes increases for decreasing values of p showing also different shape in the volume pore size distribution. Further research including simulations with a greater number of particles and image resolution are required to obtain finer results on the hierarchical structure of pore space.

A simple mathematical model that describes the growth of the area and the number of total and viable cells in yeast colonies

We propose a model, based on the Gompertz equation, to describe the growth of yeasts colonies on agar medium. This model presents several advantages: (i) one equation describes the colony growth, which previously needed two separate ones (linear increase of radius and of the squared radius); (ii) a similar equation can be applied to total and viable cells, colony area or colony radius, because the number of total cells in mature colonies is proportional to their area; and (iii) its parameters estimate the cell yield, the cell concentration that triggers growth limitation and the effect of this limitation on the specific growth rate. To elaborate the model, area, total and viable cells of 600 colonies of Saccharomyces cerevisiae, Debaryomyces fabryi, Zygosaccharomyces rouxii and Rhodotorula glutinis have been measured. With low inocula, viable cells showed an initial short exponential phase when colonies were not visible. This phase was shortened with higher inocula. In visible or mature colonies, cell growth displayed Gompertz-type kinetics. It was concluded that the cells growth in colonies is similar to liquid cultures only during the first hours, the rest of the time they grow, with near-zero specific growth rates, at least for 3 weeks.

Modelo de computación conexionista inspirado en las redes de procesadores evolutivos y su aprendizaje

La informática teórica es una disciplina básica ya que la mayoría de los avances en informática se sustentan en un sólido resultado de esa materia. En los últimos a~nos debido tanto al incremento de la potencia de los ordenadores, como a la cercanía del límite físico en la miniaturización de los componentes electrónicos, resurge el interés por modelos formales de computación alternativos a la arquitectura clásica de von Neumann. Muchos de estos modelos se inspiran en la forma en la que la naturaleza resuelve eficientemente problemas muy complejos. La mayoría son computacionalmente completos e intrínsecamente paralelos. Por este motivo se les está llegando a considerar como nuevos paradigmas de computación (computación natural). Se dispone, por tanto, de un abanico de arquitecturas abstractas tan potentes como los computadores convencionales y, a veces, más eficientes: alguna de ellas mejora el rendimiento, al menos temporal, de problemas NPcompletos proporcionando costes no exponenciales. La representación formal de las redes de procesadores evolutivos requiere de construcciones, tanto independientes, como dependientes del contexto, dicho de otro modo, en general una representación formal completa de un NEP implica restricciones, tanto sintácticas, como semánticas, es decir, que muchas representaciones aparentemente (sintácticamente) correctas de casos particulares de estos dispositivos no tendrían sentido porque podrían no cumplir otras restricciones semánticas. La aplicación de evolución gramatical semántica a los NEPs pasa por la elección de un subconjunto de ellos entre los que buscar los que solucionen un problema concreto. En este trabajo se ha realizado un estudio sobre un modelo inspirado en la biología celular denominado redes de procesadores evolutivos [55, 53], esto es, redes cuyos nodos son procesadores muy simples capaces de realizar únicamente un tipo de mutación puntual (inserción, borrado o sustitución de un símbolo). Estos nodos están asociados con un filtro que está definido por alguna condición de contexto aleatorio o de pertenencia. Las redes están formadas a lo sumo de seis nodos y, teniendo los filtros definidos por una pertenencia a lenguajes regulares, son capaces de generar todos los lenguajes enumerables recursivos independientemente del grafo subyacente. Este resultado no es sorprendente ya que semejantes resultados han sido documentados en la literatura. Si se consideran redes con nodos y filtros definidos por contextos aleatorios {que parecen estar más cerca a las implementaciones biológicas{ entonces se pueden generar lenguajes más complejos como los lenguajes no independientes del contexto. Sin embargo, estos mecanismos tan simples son capaces de resolver problemas complejos en tiempo polinomial. Se ha presentado una solución lineal para un problema NP-completo, el problema de los 3-colores. Como primer aporte significativo se ha propuesto una nueva dinámica de las redes de procesadores evolutivos con un comportamiento no determinista y masivamente paralelo [55], y por tanto todo el trabajo de investigación en el área de la redes de procesadores se puede trasladar a las redes masivamente paralelas. Por ejemplo, las redes masivamente paralelas se pueden modificar de acuerdo a determinadas reglas para mover los filtros hacia las conexiones. Cada conexión se ve como un canal bidireccional de manera que los filtros de entrada y salida coinciden. A pesar de esto, estas redes son computacionalmente completas. Se pueden también implementar otro tipo de reglas para extender este modelo computacional. Se reemplazan las mutaciones puntuales asociadas a cada nodo por la operación de splicing. Este nuevo tipo de procesador se denomina procesador splicing. Este modelo computacional de Red de procesadores con splicing ANSP es semejante en cierto modo a los sistemas distribuidos en tubos de ensayo basados en splicing. Además, se ha definido un nuevo modelo [56] {Redes de procesadores evolutivos con filtros en las conexiones{ , en el cual los procesadores tan solo tienen reglas y los filtros se han trasladado a las conexiones. Dicho modelo es equivalente, bajo determinadas circunstancias, a las redes de procesadores evolutivos clásicas. Sin dichas restricciones el modelo propuesto es un superconjunto de los NEPs clásicos. La principal ventaja de mover los filtros a las conexiones radica en la simplicidad de la modelización. Otras aportaciones de este trabajo ha sido el dise~no de un simulador en Java [54, 52] para las redes de procesadores evolutivos propuestas en esta Tesis. Sobre el término "procesador evolutivo" empleado en esta Tesis, el proceso computacional descrito aquí no es exactamente un proceso evolutivo en el sentido Darwiniano. Pero las operaciones de reescritura que se han considerado pueden interpretarse como mutaciones y los procesos de filtrado se podrían ver como procesos de selección. Además, este trabajo no abarca la posible implementación biológica de estas redes, a pesar de ser de gran importancia. A lo largo de esta tesis se ha tomado como definición de la medida de complejidad para los ANSP, una que denotaremos como tama~no (considerando tama~no como el número de nodos del grafo subyacente). Se ha mostrado que cualquier lenguaje enumerable recursivo L puede ser aceptado por un ANSP en el cual el número de procesadores está linealmente acotado por la cardinalidad del alfabeto de la cinta de una máquina de Turing que reconoce dicho lenguaje L. Siguiendo el concepto de ANSP universales introducido por Manea [65], se ha demostrado que un ANSP con una estructura de grafo fija puede aceptar cualquier lenguaje enumerable recursivo. Un ANSP se puede considerar como un ente capaz de resolver problemas, además de tener otra propiedad relevante desde el punto de vista práctico: Se puede definir un ANSP universal como una subred, donde solo una cantidad limitada de parámetros es dependiente del lenguaje. La anterior característica se puede interpretar como un método para resolver cualquier problema NP en tiempo polinomial empleando un ANSP de tama~no constante, concretamente treinta y uno. Esto significa que la solución de cualquier problema NP es uniforme en el sentido de que la red, exceptuando la subred universal, se puede ver como un programa; adaptándolo a la instancia del problema a resolver, se escogerín los filtros y las reglas que no pertenecen a la subred universal. Un problema interesante desde nuestro punto de vista es el que hace referencia a como elegir el tama~no optimo de esta red.---ABSTRACT---This thesis deals with the recent research works in the area of Natural Computing {bio-inspired models{, more precisely Networks of Evolutionary Processors first developed by Victor Mitrana and they are based on P Systems whose father is Georghe Paun. In these models, they are a set of processors connected in an underlying undirected graph, such processors have an object multiset (strings) and a set of rules, named evolution rules, that transform objects inside processors[55, 53],. These objects can be sent/received using graph connections provided they accomplish constraints defined at input and output filters processors have. This symbolic model, non deterministic one (processors are not synchronized) and massive parallel one[55] (all rules can be applied in one computational step) has some important properties regarding solution of NP-problems in lineal time and of course, lineal resources. There are a great number of variants such as hybrid networks, splicing processors, etc. that provide the model a computational power equivalent to Turing machines. The origin of networks of evolutionary processors (NEP for short) is a basic architecture for parallel and distributed symbolic processing, related to the Connection Machine as well as the Logic Flow paradigm, which consists of several processors, each of them being placed in a node of a virtual complete graph, which are able to handle data associated with the respective node. All the nodes send simultaneously their data and the receiving nodes handle also simultaneously all the arriving messages, according to some strategies. In a series of papers one considers that each node may be viewed as a cell having genetic information encoded in DNA sequences which may evolve by local evolutionary events, that is point mutations. Each node is specialized just for one of these evolutionary operations. Furthermore, the data in each node is organized in the form of multisets of words (each word appears in an arbitrarily large number of copies), and all the copies are processed in parallel such that all the possible events that can take place do actually take place. Obviously, the computational process just described is not exactly an evolutionary process in the Darwinian sense. But the rewriting operations we have considered might be interpreted as mutations and the filtering process might be viewed as a selection process. Recombination is missing but it was asserted that evolutionary and functional relationships between genes can be captured by taking only local mutations into consideration. It is clear that filters associated with each node allow a strong control of the computation. Indeed, every node has an input and output filter; two nodes can exchange data if it passes the output filter of the sender and the input filter of the receiver. Moreover, if some data is sent out by some node and not able to enter any node, then it is lost. In this paper we simplify the ANSP model considered in by moving the filters from the nodes to the edges. Each edge is viewed as a two-way channel such that the input and output filters coincide. Clearly, the possibility of controlling the computation in such networks seems to be diminished. For instance, there is no possibility to loose data during the communication steps. In spite of this and of the fact that splicing is not a powerful operation (remember that splicing systems generates only regular languages) we prove here that these devices are computationally complete. As a consequence, we propose characterizations of two complexity classes, namely NP and PSPACE, in terms of accepting networks of restricted splicing processors with filtered connections. We proposed a uniform linear time solution to SAT based on ANSPFCs with linearly bounded resources. This solution should be understood correctly: we do not solve SAT in linear time and space. Since any word and auxiliary word appears in an arbitrarily large number of copies, one can generate in linear time, by parallelism and communication, an exponential number of words each of them having an exponential number of copies. However, this does not seem to be a major drawback since by PCR (Polymerase Chain Reaction) one can generate an exponential number of identical DNA molecules in a linear number of reactions. It is worth mentioning that the ANSPFC constructed above remains unchanged for any instance with the same number of variables. Therefore, the solution is uniform in the sense that the network, excepting the input and output nodes, may be viewed as a program according to the number of variables, we choose the filters, the splicing words and the rules, then we assign all possible values to the variables, and compute the formula.We proved that ANSP are computationally complete. Do the ANSPFC remain still computationally complete? If this is not the case, what other problems can be eficiently solved by these ANSPFCs? Moreover, the complexity class NP is exactly the class of all languages decided by ANSP in polynomial time. Can NP be characterized in a similar way with ANSPFCs?

Método para la Construcción Automática de Ontologías Basado en Patrones Lingüísticos

La tesis que se presenta tiene como propósito la construcción automática de ontologías a partir de textos, enmarcándose en el área denominada Ontology Learning. Esta disciplina tiene como objetivo automatizar la elaboración de modelos de dominio a partir de fuentes información estructurada o no estructurada, y tuvo su origen con el comienzo del milenio, a raíz del crecimiento exponencial del volumen de información accesible en Internet. Debido a que la mayoría de información se presenta en la web en forma de texto, el aprendizaje automático de ontologías se ha centrado en el análisis de este tipo de fuente, nutriéndose a lo largo de los años de técnicas muy diversas provenientes de áreas como la Recuperación de Información, Extracción de Información, Sumarización y, en general, de áreas relacionadas con el procesamiento del lenguaje natural. La principal contribución de esta tesis consiste en que, a diferencia de la mayoría de las técnicas actuales, el método que se propone no analiza la estructura sintáctica superficial del lenguaje, sino que estudia su nivel semántico profundo. Su objetivo, por tanto, es tratar de deducir el modelo del dominio a partir de la forma con la que se articulan los significados de las oraciones en lenguaje natural. Debido a que el nivel semántico profundo es independiente de la lengua, el método permitirá operar en escenarios multilingües, en los que es necesario combinar información proveniente de textos en diferentes idiomas. Para acceder a este nivel del lenguaje, el método utiliza el modelo de las interlinguas. Estos formalismos, provenientes del área de la traducción automática, permiten representar el significado de las oraciones de forma independiente de la lengua. Se utilizará en concreto UNL (Universal Networking Language), considerado como la única interlingua de propósito general que está normalizada. La aproximación utilizada en esta tesis supone la continuación de trabajos previos realizados tanto por su autor como por el equipo de investigación del que forma parte, en los que se estudió cómo utilizar el modelo de las interlinguas en las áreas de extracción y recuperación de información multilingüe. Básicamente, el procedimiento definido en el método trata de identificar, en la representación UNL de los textos, ciertas regularidades que permiten deducir las piezas de la ontología del dominio. Debido a que UNL es un formalismo basado en redes semánticas, estas regularidades se presentan en forma de grafos, generalizándose en estructuras denominadas patrones lingüísticos. Por otra parte, UNL aún conserva ciertos mecanismos de cohesión del discurso procedentes de los lenguajes naturales, como el fenómeno de la anáfora. Con el fin de aumentar la efectividad en la comprensión de las expresiones, el método provee, como otra contribución relevante, la definición de un algoritmo para la resolución de la anáfora pronominal circunscrita al modelo de la interlingua, limitada al caso de pronombres personales de tercera persona cuando su antecedente es un nombre propio. El método propuesto se sustenta en la definición de un marco formal, que ha debido elaborarse adaptando ciertas definiciones provenientes de la teoría de grafos e incorporando otras nuevas, con el objetivo de ubicar las nociones de expresión UNL, patrón lingüístico y las operaciones de encaje de patrones, que son la base de los procesos del método. Tanto el marco formal como todos los procesos que define el método se han implementado con el fin de realizar la experimentación, aplicándose sobre un artículo de la colección EOLSS “Encyclopedia of Life Support Systems” de la UNESCO. ABSTRACT The purpose of this thesis is the automatic construction of ontologies from texts. This thesis is set within the area of Ontology Learning. This discipline aims to automatize domain models from structured or unstructured information sources, and had its origin with the beginning of the millennium, as a result of the exponential growth in the volume of information accessible on the Internet. Since most information is presented on the web in the form of text, the automatic ontology learning is focused on the analysis of this type of source, nourished over the years by very different techniques from areas such as Information Retrieval, Information Extraction, Summarization and, in general, by areas related to natural language processing. The main contribution of this thesis consists of, in contrast with the majority of current techniques, the fact that the method proposed does not analyze the syntactic surface structure of the language, but explores his deep semantic level. Its objective, therefore, is trying to infer the domain model from the way the meanings of the sentences are articulated in natural language. Since the deep semantic level does not depend on the language, the method will allow to operate in multilingual scenarios, where it is necessary to combine information from texts in different languages. To access to this level of the language, the method uses the interlingua model. These formalisms, coming from the area of machine translation, allow to represent the meaning of the sentences independently of the language. In this particular case, UNL (Universal Networking Language) will be used, which considered to be the only interlingua of general purpose that is standardized. The approach used in this thesis corresponds to the continuation of previous works carried out both by the author of this thesis and by the research group of which he is part, in which it is studied how to use the interlingua model in the areas of multilingual information extraction and retrieval. Basically, the procedure defined in the method tries to identify certain regularities at the UNL representation of texts that allow the deduction of the parts of the ontology of the domain. Since UNL is a formalism based on semantic networks, these regularities are presented in the form of graphs, generalizing in structures called linguistic patterns. On the other hand, UNL still preserves certain mechanisms of discourse cohesion from natural languages, such as the phenomenon of the anaphora. In order to increase the effectiveness in the understanding of expressions, the method provides, as another significant contribution, the definition of an algorithm for the resolution of pronominal anaphora limited to the model of the interlingua, in the case of third person personal pronouns when its antecedent is a proper noun. The proposed method is based on the definition of a formal framework, adapting some definitions from Graph Theory and incorporating new ones, in order to locate the notions of UNL expression and linguistic pattern, as well as the operations of pattern matching, which are the basis of the method processes. Both the formal framework and all the processes that define the method have been implemented in order to carry out the experimentation, applying on an article of the "Encyclopedia of Life Support Systems" of the UNESCO-EOLSS collection.

Exploring the origins of topological frustration: Design of a minimally frustrated model of fragment B of protein A

Topological frustration in an energetically unfrustrated off-lattice model of the helical protein fragment B of protein A from Staphylococcus aureus was investigated. This Gō-type model exhibited thermodynamic and kinetic signatures of a well-designed two-state folder with concurrent collapse and folding transitions and single exponential kinetics at the transition temperature. Topological frustration is determined in the absence of energetic frustration by the distribution of Fersht φ values. Topologically unfrustrated systems present a unimodal distribution sharply peaked at intermediate φ, whereas highly frustrated systems display a bimodal distribution peaked at low and high φ values. The distribution of φ values in protein A was determined both thermodynamically and kinetically. Both methods yielded a unimodal distribution centered at φ = 0.3 with tails extending to low and high φ values, indicating the presence of a small amount of topological frustration. The contacts with high φ values were located in the turn regions between helices I and II and II and III, intimating that these hairpins are in large part required in the transition state. Our results are in good agreement with all-atom simulations of protein A, as well as lattice simulations of a three- letter code 27-mer (which can be compared with a 60-residue helical protein). The relatively broad unimodal distribution of φ values obtained from the all-atom simulations and that from the minimalist model for the same native fold suggest that the structure of the transition state ensemble is determined mostly by the protein topology and not energetic frustration.

Broken symmetry and critical transport properties of random metals

Recent experimental data on the conductivity σ+(T), T → 0, on the metallic side of the metal–insulator transition in ideally random (neutron transmutation-doped) 70Ge:Ga have shown that σ+(0) ∝ (N − Nc)μ with μ = ½, confirming earlier ultra-low-temperature results for Si:P. This value is inconsistent with theoretical predictions based on diffusive classical scaling models, but it can be understood by a quantum-directed percolative filamentary amplitude model in which electronic basis states exist which have a well-defined momentum parallel but not normal to the applied electric field. The model, which is based on a new kind of broken symmetry, also explains the anomalous sign reversal of the derivative of the temperature dependence in the critical regime.

Conformational influences of glycosylation of a peptide: A possible model for the effect of glycosylation on the rate of protein folding

Improved strategies for synthesis make it possible to expand the range of glycopeptides available for detailed conformational studies. The glycopeptide 1 was synthesized using a new solid phase synthesis of carbohydrates and a convergent coupling to peptide followed by deprotection. Its conformational properties were subjected to NMR analysis and compared with a control peptide 2 prepared by conventional solid phase methods. Whereas peptide 2 fails to manifest any appreciable secondary structure, the glycopeptide 1 does show considerable conformational bias suggestive of an equilibrium between an ordered and a random state. The implications of this ordering effect for the larger issue of protein folding are considered.

Estimating the probability for a protein to have a new fold: A statistical computational model

Structural genomics aims to solve a large number of protein structures that represent the protein space. Currently an exhaustive solution for all structures seems prohibitively expensive, so the challenge is to define a relatively small set of proteins with new, currently unknown folds. This paper presents a method that assigns each protein with a probability of having an unsolved fold. The method makes extensive use of protomap, a sequence-based classification, and scop, a structure-based classification. According to protomap, the protein space encodes the relationship among proteins as a graph whose vertices correspond to 13,354 clusters of proteins. A representative fold for a cluster with at least one solved protein is determined after superposition of all scop (release 1.37) folds onto protomap clusters. Distances within the protomap graph are computed from each representative fold to the neighboring folds. The distribution of these distances is used to create a statistical model for distances among those folds that are already known and those that have yet to be discovered. The distribution of distances for solved/unsolved proteins is significantly different. This difference makes it possible to use Bayes' rule to derive a statistical estimate that any protein has a yet undetermined fold. Proteins that score the highest probability to represent a new fold constitute the target list for structural determination. Our predicted probabilities for unsolved proteins correlate very well with the proportion of new folds among recently solved structures (new scop 1.39 records) that are disjoint from our original training set.

Identification of fission yeast nuclear markers using random polypeptide fusions with green fluorescent protein

We describe a method for identifying genes encoding proteins with stereospecific intracellular localizations in the fission yeast Schizosaccharomyces pombe. Yeast are transformed with a gene library in which S. pombe genomic sequences are fused to the gene encoding the Aequorea victoria green fluorescent protein (GFP), and intracellular localizations are subsequently identified by rapid fluorescence screening in vivo. In a model application of these methods to the fission yeast nucleus, we have identified several novel genes whose products are found in specific nuclear regions, including chromatin, the nucleolus, and the mitotic spindle, and sequence similarities between some of these genes and previously identified genes encoding nuclear proteins have validated the approach. These methods will be useful in identifying additional components of the S. pombe nucleus, and further extensions of this approach should also be applicable to a more comprehensive identification of the elements of intracellular architecture in fission yeast.

An equilibrium statistical model for the spreading phase of open-ocean convection

A “most probable state” equilibrium statistical theory for random distributions of hetons in a closed basin is developed here in the context of two-layer quasigeostrophic models for the spreading phase of open-ocean convection. The theory depends only on bulk conserved quantities such as energy, circulation, and the range of values of potential vorticity in each layer. The simplest theory is formulated for a uniform cooling event over the entire basin that triggers a homogeneous random distribution of convective towers. For a small Rossby deformation radius typical for open-ocean convection sites, the most probable states that arise from this theory strongly resemble the saturated baroclinic states of the spreading phase of convection, with a stabilizing barotropic rim current and localized temperature anomaly.

Direct conversion of an oligopeptide from a β-sheet to an α-helix: A model for amyloid formation

A 16-amino acid oligopeptide forms a stable β-sheet structure in water. In physiological solutions it is able to self-assemble to form a macroscopic matrix that stains with Congo red. On raising the temperature of the aqueous solution above 70°C, an abrupt structural transition occurs in the CD spectra from a β-sheet to a stable α-helix without a detectable random-coil intermediate. With cooling, it retained the α-helical form and took several weeks at room temperature to partially return to the β-sheet form. Slow formation of the stable β-sheet structure thus shows kinetic irreversibility. Such a formation of very stable β-sheet structures is found in the amyloid of a number of neurological diseases. This oligopeptide could be a model system for studying the protein conformational changes that occurs in scrapie or Alzheimer disease. The abrupt and direct conversion from a β-sheet to an α-helix may also be found in other processes, such as protein folding and protein–protein interaction. Furthermore, such drastic structure changes may also be exploited in biomaterials designed as sensors to detect environmental changes.

A Model for Signal Transduction during Gamete Release in the Fucoid Alga Pelvetia compressa1

Fucoid algae release gametes into seawater following an inductive light period (potentiation), and gamete expulsion from potentiated receptacles of Pelvetia compressa began about 2 min after a light-to-dark transition. Agitation of the medium reversed potentiation, with an exponential time course completed in about 3 h. Light regulated two signaling pathways during potentiation and gamete expulsion: a photosynthetic pathway and a photosynthesis-independent pathway in which red light was active but blue light was not. Uptake of K+ appears to have an important role in potentiation, because a 50% inhibition of potentiation occurred in the presence of the tetraethylammonium ion, a K+-channel blocker. A central role of anion channels in the maintenance of potentiation is suggested by the premature release of gametes in the light when receptacles were incubated with inhibitors of slow-type anion channels. An inhibitor of tyrosine kinases, tyrphostin A63, also inhibited potentiation. A model for gamete release from P. compressa is presented that proposes that illumination results in the accumulation of ions (e.g. K+) throughout the cells of the receptacle during potentiation, which then move into the extracellular matrix during gamete expulsion to generate osmomechanical force, resulting in gamete release.

A modified gambler's ruin model of polyethylene chains in the amorphous region.

Polyethylene chains in the amorphous region between two crystalline lamellae M unit apart are modeled as random walks with one-step memory on a cubic lattice between two absorbing boundaries. These walks avoid the two preceding steps, though they are not true self-avoiding walks. Systems of difference equations are introduced to calculate the statistics of the restricted random walks. They yield that the fraction of loops is (2M - 2)/(2M + 1), the fraction of ties 3/(2M + 1), the average length of loops 2M - 0.5, the average length of ties 2/3M2 + 2/3M - 4/3, the average length of walks equals 3M - 3, the variance of the loop length 16/15M3 + O(M2), the variance of the tie length 28/45M4 + O(M3), and the variance of the walk length 2M3 + O(M2).

A synthetic random basic copolymer with promiscuous binding to class II major histocompatibility complex molecules inhibits T-cell proliferative responses to major and minor histocompatibility antigens in vitro and confers the capacity to prevent murine graft-versus-host disease in vivo.

Graft-versus-host disease (GVHD) is a T-cell-mediated disease of transplanted donor T cells recognizing host alloantigens. Data presented in this report show, to our knowledge, for the first time that a synthetic copolymer of the amino acids L-Glu, L-Lys, L-Ala, and L-Tyr (molecular ratio, 1.9:6.0:4.7:1.0; Mr, 6000-8500) [corrected], termed GLAT, with promiscuous binding to multiple major histocompatibility complex class II alleles is capable of preventing lethal GVHD in the B10.D2 --> BALB/c model (both H-2d) across minor histocompatibility barriers. Administration of GLAT over a limited time after transplant significantly reduced the incidence, onset, and severity of disease. GLAT also improved long-term survival from lethal GVHD: 14/25 (56%) of experimental mice survived > 140 days after transplant compared to 2/26 of saline-treated or to 1/10 of hen egg lysozyme-treated control mice (P < 0.01). Long-term survivors were documented to be fully chimeric by PCR analysis of a polymorphic microsatellite region in the interleukin 1beta gene. In vitro, GLAT inhibited the mixed lymphocyte culture in a dose-dependent fashion across a variety of major barriers tested. Furthermore, GLAT inhibited the response of nylon wool-enriched T cells to syngeneic antigen-presenting cells presenting minor histocompatibility antigens. Prepulsing of the antigen-presenting cells with GLAT reduced the proliferative response, suggesting that GLAT inhibits antigen presentation.

Cellular aging, destabilization, and cancer.

Three major characteristics of aging in animals are a slowdown of cell proliferation, an increase in residual bodies associated with age pigments, and a marked increase in the likelihood of neoplastic transformation. The 28 L subline of the NIH 3T3 line of mouse embryo fibroblasts exhibits all these characteristics when held at confluence for extended periods. The impairment of proliferation is the first behavioral characteristic detected in low density subcultures from the confluent cultures, and it persists through many cell generations of exponential multiplication. There is an equal degree of growth impairment among replicate cultures (lineages) recovered after each of 2 successive rounds of confluence, although heterogeneity appears after the third round. The growth impairment pervades the entire cell population of each lineage. The degree and duration of impairment increase with repeated rounds of confluence. A marked increase of residual bodies characteristic of age pigments occurs in the cytoplasm of all the cells kept under prolonged confluence. Neoplastic transformation first appears as foci of multilayered cells on a monolayered background of nontransformed cells. The transformed cells arise at different times in the lineages and originate from a very small fraction of the population. The transformed cells selectively overgrow the entire population in successive rounds of confluence leading to an increase in saturation density of each lineage at different times. Under cloning conditions, isolated colonies of transformed cells develop more slowly than colonies of nontransformed cells but eventually reach a higher population density. The regularity of persistent growth impairment among the lineages and the appearance of large numbers of residual bodies in all the cells of each population are more characteristic of an epigenetic process than of specific local mutations. although random chromosomal lesions cannot be ruled out. By contrast, the low frequency and stochastic character of neoplastic transformation are consistent with a conventional genetic origin. The advent in long-term confluent NIH 3T3 cultures of three cardinal characteristics of cellular aging in vivo recommends it as a model for aging cells.