Tree models of aggregation: multiple particle and bond-types

This paper considers aggregation processes where particles bond pairwise to form tree-structures. The tree-structures may model chemical polymerization, the precipitin reaction or cell-surface aggregates in immunology, or rouleaux formation in haematology, among other applications. We allow multiple particle and bond-types. Bonding may be directed or undirected. Branching processes specify the aggregate distribution. A theorem for multi-type branching processes gives complete criteria for the existence of an infinite aggregate (a gel). The distribution of bonding in the gel gives the elastic properties of a chemical gel. We use the binomial theorem to extend Good’s (1960) multivariable generalization of Lagrange’s expansion. The extension gives the distribution of finite aggregates (the sol) whether or not a gel is present. Generating-function relations give the mole- and weight-average relative molecular masses of the sol. When certain equireactivity conditions hold, the sol distribution is determined by a combinatorial recursion. Tree models of aggregation require enumeration of labelled trees by partition. Branching processes provide an efficient solution to the problem. Models that incorporate rings into the trees require enumeration by partition of other graphical structures. Whittle’s (1980) enumeration of pseudomultigraphs by partition is not an appropriate model of ringformation for polymer chemistry but Gordon et al . (1971) suggest another model. The model is equivalent to enumerating graphs by partition, and is still an open problem.

Author(s):  
I. F. Povkhan ◽  

We propose an upper estimate of the complexity of the binary logical tree synthesis procedure for classifying an arbitrary case (for conditions of weak and strong separation of classes in the training sample). The solution to this question is of a fundamental nature, regarding the assessment of the structural complexity of classification models (in the form of tree structures) of discrete objects for a wide range of applied classification and recognition problems in terms of developing promising schemes and methods for their final optimization (minimization) of the structure. This research is relevant not only for the constructions of logical classification trees, but also allows us to extend the complexity estimation scheme itself to the general case of algorithmic structures of classification trees (concepts of algorithm trees and generalized feature trees). The current issue of complexity of the general procedure for constructing a logical classification tree based on the concept of step-by-step selection of sets of elementary features (their possible heterogeneous sets and combinations), which for a given initial training sample (an array of discrete information) builds a tree structure (classification model), from a set of elementary features (basic attributes) evaluated at each stage of the model construction scheme for this sample. Thus, modern information technologies based on mathematical models of pattern recognition (logical and algorithmic classification trees) are widely used in socio-economic, environmental and other systems of primary analysis and processing of large amounts of information. This is due to the fact that this approach allows you to eliminate a set of existing disadvantages of well-known classical methods and schemes and achieve a fundamentally new result. The work is devoted to the problems of classification tree models (decision trees), and offers an assessment of the complexity of logical tree structures (classification tree models), which consist of selected and ranked sets of elementary features built on the basis of the General concept of branched feature selection. This method, when forming the current vertex of the logical tree (node), provides the selection of the most informative (qualitative) elementary features from the source set. This approach allows you to significantly reduce the size and complexity of the tree (the total number of branches and tiers of the structure) and improve the quality of its subsequent analysis.


2007 ◽  
Vol 44 (02) ◽  
pp. 492-505
Author(s):  
M. Molina ◽  
M. Mota ◽  
A. Ramos

We investigate the probabilistic evolution of a near-critical bisexual branching process with mating depending on the number of couples in the population. We determine sufficient conditions which guarantee either the almost sure extinction of such a process or its survival with positive probability. We also establish some limiting results concerning the sequences of couples, females, and males, suitably normalized. In particular, gamma, normal, and degenerate distributions are proved to be limit laws. The results also hold for bisexual Bienaymé–Galton–Watson processes, and can be adapted to other classes of near-critical bisexual branching processes.


Author(s):  
C. N. Sun

Myoepithelial cells have been observed in the prostate, harderian, apocrine, exocrine sweat and mammary glands. Such cells and their numerous branching processes form basket-like structures around the glandular acini. Their shapes are quite different from structures seen either in spindleshaped smooth muscle cells or skeletal muscle cells. These myoepithelial cells lie on the epithelial side of the basement membrane in the glands. This presentation describes the ultrastructure of such myoepithelial cells which have been found also in the parotid gland carcinoma from a 45-year old patient.Specimens were cut into small pieces about 1 mm3 and immediately fixed in 4 percent glutaraldehyde in phosphate buffer for two hours, then post-fixed in 1 percent buffered osmium tetroxide for 1 hour. After dehydration, tissues were embedded in Epon 812. Thin sections were stained with uranyl acetate and lead citrate. Ultrastructurally, the pattern of each individual cell showed wide variations.


Methodology ◽  
2005 ◽  
Vol 1 (1) ◽  
pp. 2-17 ◽  
Author(s):  
Thorsten Meiser

Abstract. Several models have been proposed for the measurement of cognitive processes in source monitoring. They are specified within the statistical framework of multinomial processing tree models and differ in their assumptions on the storage and retrieval of multidimensional source information. In the present article, a hierarchical relationship is demonstrated between multinomial models for crossed source information ( Meiser & Bröder, 2002 ), for partial source memory ( Dodson, Holland, & Shimamura, 1998 ) and for several sources ( Batchelder, Hu, & Riefer, 1994 ). The hierarchical relationship allows model comparisons and facilitates the specification of identifiability conditions. Conditions for global identifiability are discussed, and model comparisons are illustrated by reanalyses and by a new experiment on the storage and retrieval of multidimensional source information.


Author(s):  
Thorsten Meiser

Stochastic dependence among cognitive processes can be modeled in different ways, and the family of multinomial processing tree models provides a flexible framework for analyzing stochastic dependence among discrete cognitive states. This article presents a multinomial model of multidimensional source recognition that specifies stochastic dependence by a parameter for the joint retrieval of multiple source attributes together with parameters for stochastically independent retrieval. The new model is equivalent to a previous multinomial model of multidimensional source memory for a subset of the parameter space. An empirical application illustrates the advantages of the new multinomial model of joint source recognition. The new model allows for a direct comparison of joint source retrieval across conditions, it avoids statistical problems due to inflated confidence intervals and does not imply a conceptual imbalance between source dimensions. Model selection criteria that take model complexity into account corroborate the new model of joint source recognition.


INEOS OPEN ◽  
2020 ◽  
Vol 3 ◽  
Author(s):  
S. A. Sorokina ◽  
◽  
Yu. Yu. Stroilova ◽  
V. I. Muronets ◽  
Z. B. Shifrina ◽  
...  

Among the compounds able to efficiently inhibit the amyloid aggregation of proteins and decompose the amyloid aggregates that cause neurodegenerative diseases, of particular interest are dendrimers, which represent individual macromolecules with the hypercrosslinked architectures and given molecular parameters. This short review outlines the peculiarities of the antiamyloid activity of dendrimers and discusses the effect of dendrimer structures and external factors on their antiamyloid properties. The potential of application of dendrimers in further investigations on the aggregation processes of amyloid proteins as the compounds that exhibit the remarkable antiamyloid activity is evaluated.


TAPPI Journal ◽  
2013 ◽  
Vol 12 (1) ◽  
pp. 37-43 ◽  
Author(s):  
HANNU PAKKANEN ◽  
TEEMU PALOHEIMO ◽  
RAIMO ALÉN

The influence of various cooking parameters, such as effective alkali, cooking temperature, and cooking time on the formation of high molecular mass lignin-derived and low molecular mass carbohydrates-derived (aliphatic carboxylic acids) degradation products, mainly during the initial phase of softwood kraft pulping was studied. In addition, the mass transfer of all of these degradation products was clarified based on their concentrations in the cooking liquor inside and outside of the chips. The results indicated that the degradation of the major hemicellulose component, galactoglucomannan, typically was dependent on temperature, and the maximum degradation amount was about 60%. In addition, about 60 min at 284°F (140°C) was needed for leveling off the concentrations of the characteristic reaction products (3,4-dideoxy-pentonic and glucoisosaccharinic acids) between these cooking liquors. Compared with low molecular mass aliphatic acids, the mass transfer of soluble lignin fragments with much higher molecular masses was clearly slower.


Sign in / Sign up

Export Citation Format

Share Document