Efficiency of neural networks for prediction of in vitro culture conditions and inoculum properties for optimum productivity

This study represents an ANN based computational scheming of physical, chemical and biological parameters at flask level for mass multiplication of plants through micropropagation using bioreactors of larger volumes. The optimal culture environment at small scale for Glycyrrhiza plant was predicted by using neural network approach in terms of pH and volume of growth medium per culture flask, incubation room temperature and month of inoculation along with inoculum properties in terms of inoculum size, fresh weight and number of explant per flask. This kind of study could be a model system in commercial propagation of various economically important plants in bioreactors using tissue culture technique. In present course of study the ANN was trained by implementing MATLAB neural network. A feed-forward back propagation type network was created for input vector (seven input elements), with single hidden layer (seven nodes) and one output unit in output layer. The ‘tansig’ and ‘purelin’ transfer functions were adapted for hidden and output layers respectively. The four training functions viz. traingda, trainrp, traincgf, traincgb were randomly selected to train four networks which further examined with available dataset. The efficiency of neural networks was concluded by the comparison of results obtained from this study with that of empirical data obtained from the detailed tissue culture experiments and designated as Target set (mean fresh weight biomass per culture flask after 40 days of in vitro culture duration). Efficiency of networks for better training initialization was judged on the basis of comparative analysis of ‘Mean Square Error at zero epoch’ for each network trained in which the least error at initial point was observed with trainrp followed by traincgb and traincgf. A comparative assessment between experimental target data range obtained from wet lab practice and all trained network output range for the efficiency of trained networks for least deviation from target range revealed the output range of network ‘trainrp’ was closest to the empirical target range while least comparison was worked out from network ‘traincgb’ which had output range more than the target decided and ultimately showed meaningless result.     

Catalysis in Reaction Networks

We define catalytic networks as chemical reaction networks with an essentially catalytic reaction pathway: one which is “on” in the presence of certain catalysts and “off” in their absence. We show that examples of catalytic networks include synthetic DNA molecular circuits that have been shown to perform signal amplification and molecular logic. Recall that a critical siphon is a subset of the species in a chemical reaction network whose absence is forward invariant and stoichiometrically compatible with a positive point. Our main theorem is that all weakly-reversible networks with critical siphons are catalytic. Consequently, we obtain new proofs for the persistence of atomic event-systems of Adleman et al., and normal networks of Gnacadja. We define autocatalytic networks, and conjecture that a weakly-reversible reaction network has critical siphons if and only if it is autocatalytic.     

Gene Duplication and the Properties of Biological Networks

Patterns of network connection of members of multigene families were examined for two biological networks: a genetic network from the yeast Saccharomyces cerevisiae and a protein–protein interaction network from Caenorhabditis elegans. In both networks, genes belonging to gene families represented by a single member in the genome (“singletons”) were disproportionately represented among the nodes having large numbers of connections. Of 68 single-member yeast families with 25 or more network connections, 28 (44.4%) were located in duplicated genomic segments believed to have originated from an ancient polyploidization event; thus, each of these 28 loci was thus presumably duplicated along with the genomic segment to which it belongs, but one of the two duplicates has subsequently been deleted. Nodes connected to major “hubs” with a large number of connections, tended to be relatively sparsely interconnected among themselves. Furthermore, duplicated genes, even those arising from recent duplication, rarely shared many network connections, suggesting that network connections are remarkably labile over evolutionary time. These factors serve to explain well-known general properties of biological networks, including their scale-free and modular nature. [Reviewing Editor : Dr. Manyuan Long]     

The frugivory network properties of a simplified ecosystem: Birds and plants in a Neotropical periurban park

Frugivory networks exhibit a set of properties characterized by a number of network theory‐derived metrics. Their structures often form deterministic patterns that can be explained by the functional roles of interacting species. Although we know lots about how these networks are organized when ecosystems are in a complete, functional condition, we know much less about how incomplete and simplified networks (such as those found in urban and periurban parks) are organized, which features are maintained, which ones are not, and why. In this paper, we examine the properties of a network between frugivorous birds and plants in a small Neotropical periurban park. We found a frugivory network composed of 29 species of birds and 23 of plants. The main roles in this network are played by four species of generalist birds (three resident, one migratory: Myiozetetes similis, Turdus grayi, Chlorospingus flavopectus, and Dumetella carolinensis) and three species of plants (one exotic, two early successional: Phoenix canariensis, Phoradendron sp., and Witheringia stramoniifolia). When compared to reference data from other locations in the Neotropics, species richness is low, one important network‐level metric is maintained (modularity) whereas another one is not (nestedness). Nestedness, a metric associated with network specialists, is a feature this network lacks. Species‐level metrics such as degree, species strength, and module roles, are not maintained. Our work supports modularity as the most pervasive network‐level metric of altered habitats. From a successional point of view, our results suggest that properties revealed by species‐level indices may be developed at a later time, lagging the acquisition of structural elements.     

Synaptic information transfer in computer models of neocortical columns

Understanding the direction and quantity of information flowing in neuronal networks is a fundamental problem in neuroscience. Brains and neuronal networks must at the same time store information about the world and react to information in the world. We sought to measure how the activity of the network alters information flow from inputs to output patterns. Using neocortical column neuronal network simulations, we demonstrated that networks with greater internal connectivity reduced input/output correlations from excitatory synapses and decreased negative correlations from inhibitory synapses, measured by Kendall’s τ correlation. Both of these changes were associated with reduction in information flow, measured by normalized transfer entropy (nTE). Information handling by the network reflected the degree of internal connectivity. With no internal connectivity, the feedforward network transformed inputs through nonlinear summation and thresholding. With greater connectivity strength, the recurrent network translated activity and information due to contribution of activity from intrinsic network dynamics. This dynamic contribution amounts to added information drawn from that stored in the network. At still higher internal synaptic strength, the network corrupted the external information, producing a state where little external information came through. The association of increased information retrieved from the network with increased gamma power supports the notion of gamma oscillations playing a role in information processing.     

Recovering context-specific gene network modules from expression data: A brief review

With the popularization of microarray experi-ments in biomedical laboratories, how to make context-specific knowledge discovery from expression data becomes a hot topic. While the static "reference networks"for key model organisms are nearly at hand, the endeavors to recover context-specific network modules are still at the beginning. Currently, this is achieved through filtering existing edges of the ensemble reference network or constructing gene networks ab initio. In this paper, we briefly review recent progress in the field and point out some research directions awaiting improved work, includ-ing expression-data-guided revision of reference networks.     

Elements for a general memory structure: properties of recurrent neural networks used to form situation models

We study how individual memory items are stored assuming that situations given in the environment can be represented in the form of synaptic-like couplings in recurrent neural networks. Previous numerical investigations have shown that specific architectures based on suppression or max units can successfully learn static or dynamic stimuli (situations). Here we provide a theoretical basis concerning the learning process convergence and the network response to a novel stimulus. We show that, besides learning “simple” static situations, a nD network can learn and replicate a sequence of up to n different vectors or frames. We find limits on the learning rate and show coupling matrices developing during training in different cases including expansion of the network into the case of nonlinear interunit coupling. Furthermore, we show that a specific coupling matrix provides low-pass-filter properties to the units, thus connecting networks constructed by static summation units with continuous-time networks. We also show under which conditions such networks can be used to perform arithmetic calculations by means of pattern completion.     

Population sinks resulting from degraded habitats of an obligate life-history pathway

In networks of plant–animal mutualisms, different animal groups interact preferentially with different plants, thus forming distinct modules responsible for different parts of the service. However, what we currently know about seed dispersal networks is based only on birds. Therefore, we wished to fill this gap by studying bat–fruit networks and testing how they differ from bird–fruit networks. As dietary overlap of Neotropical bats and birds is low, they should form distinct mutualistic modules within local networks. Furthermore, since frugivory evolved only once among Neotropical bats, but several times independently among Neotropical birds, greater dietary overlap is expected among bats, and thus connectance and nestedness should be higher in bat–fruit networks. If bat–fruit networks have higher nestedness and connectance, they should be more robust to extinctions. We analyzed 1 mixed network of both bats and birds and 20 networks that consisted exclusively of either bats (11) or birds (9). As expected, the structure of the mixed network was both modular (M = 0.45) and nested (NODF = 0.31); one module contained only birds and two only bats. In 20 datasets with only one disperser group, bat–fruit networks (NODF = 0.53 ± 0.09, C = 0.30 ± 0.11) were more nested and had a higher connectance than bird–fruit networks (NODF = 0.42 ± 0.07, C = 0.22 ± 0.09). Unexpectedly, robustness to extinction of animal species was higher in bird–fruit networks (R = 0.60 ± 0.13) than in bat–fruit networks (R = 0.54 ± 0.09), and differences were explained mainly by species richness. These findings suggest that a modular structure also occurs in seed dispersal networks, similar to pollination networks. The higher nestedness and connectance observed in bat–fruit networks compared with bird–fruit networks may be explained by the monophyletic evolution of frugivory in Neotropical bats, among which the diets of specialists seem to have evolved from the pool of fruits consumed by generalists.     

Synchrony and Asynchrony for Neuronal Dynamics Defined on Complex Networks

We describe and analyze a model for a stochastic pulse-coupled neuronal network with many sources of randomness: random external input, potential synaptic failure, and random connectivity topologies. We show that different classes of network topologies give rise to qualitatively different types of synchrony: uniform (Erdős–Rényi) and “small-world” networks give rise to synchronization phenomena similar to that in “all-to-all” networks (in which there is a sharp onset of synchrony as coupling is increased); in contrast, in “scale-free” networks the dependence of synchrony on coupling strength is smoother. Moreover, we show that in the uniform and small-world cases, the fine details of the network are not important in determining the synchronization properties; this depends only on the mean connectivity. In contrast, for scale-free networks, the dynamics are significantly affected by the fine details of the network; in particular, they are significantly affected by the local neighborhoods of the “hubs” in the network.     

Persistence in metabolic nets

In an attempt to improve the understanding of complex metabolic dynamic phenomena, we have analysed several ‘metabolic networks’, dynamical systems which, under a single formulation, take into account the activity of several catalytic dissipative structures, interconnected by substrate fluxes and regulatory signals. These metabolic networks exhibit a rich variety of self-organized dynamic patterns, with e.g., phase transitions emerging in the whole activity of each network. We apply Hurst’s R/S analysis to several time series generated by these metabolic networks, and measure Hurst exponents H < 0.5 in most cases. This value of H, indicative of antipersistent processes, is detected at very high significance levels, estimated with detailed Monte Carlo simulations. These results show clearly the considered type of metabolic networks exhibit long-term memory phenomena.     

Changing excitation and inhibition in simulated neural networks: effects on induced bursting behavior

 The development of synchronous bursting in neuronal ensembles represents an important change in network behavior. To determine the influences on development of such synchronous bursting behavior we study the dynamics of small networks of sparsely connected excitatory and inhibitory neurons using numerical simulations. The synchronized bursting activities in networks evoked by background spikes are investigated. Specifically, patterns of bursting activity are examined when the balance between excitation and inhibition on neuronal inputs is varied and the fraction of inhibitory neurons in the network is changed. For quantitative comparison of bursting activities in networks, measures of the degree of synchrony are used. We demonstrate how changes in the strength of excitation on inputs of neurons can be compensated by changes in the strength of inhibition without changing the degree of synchrony in the network. The effects of changing several network parameters on the network activity are analyzed and discussed. These changes may underlie the transition of network activity from normal to potentially pathologic (e.g., epileptic) states. Received: 21 May 2002 / Accepted in revised form: 3 December 2002 / Published online: 7 March 2003 Correspondence to: P. Kudela (e-mail: pkudela@jhmi.edu) Acknowledgements. This research was supported by NIH grant NS 38958.     

Generic properties of combinatory maps: Neutral networks of RNA secondary structures

Random graph theory is used to model and analyse the relationship between sequences and secondary structures of RNA molecules, which are understood as mappings from sequence space into shape space. These maps are non-invertible since there are always many orders of magnitude more sequences than structures. Sequences folding into identical structures formneutral networks. A neutral network is embedded in the set of sequences that arecompatible with the given structure. Networks are modeled as graphs and constructed by random choice of vertices from the space of compatible sequences. The theory characterizes neutral networks by the mean fraction of neutral neighbors (λ). The networks are connected and percolate sequence space if the fraction of neutral nearest neighbors exceeds a threshold value (λ>λ*). Below threshold (λ<λ*), the networks are partitioned into a largest “giant” component and several smaller components. Structure are classified as “common” or “rare” according to the sizes of their pre-images, i.e. according to the fractions of sequences folding into them. The neutral networks of any pair of two different common structures almost touch each other, and, as expressed by the conjecture ofshape space covering sequences folding into almost all common structures, can be found in a small ball of an arbitrary location in sequence space. The results from random graph theory are compared to data obtained by folding large samples of RNA sequences. Differences are explained in terms of specific features of RNA molecular structures. Deicated to professor Manfred Eigen     

Structural parameters of communication networks

Certain parameters are defined which roughly characterize the internal structure of networks. A given network structure uniquely determines the values of the parameters, but the reverse is not true. The parameters therefore define certain classes of networks. One of the parameters, thedispersion D(S) gives an indication of the “compactness” of the internal structure. Addition theorems and inequalities are derived relating the dispersions of sub-systems to the dispersion of the complete structure.     

Contact networks and transmission of an intestinal pathogen in bumble bee (Bombus impatiens) colonies

In socially living animals, individuals interact through complex networks of contact that may influence the spread of disease. Whereas traditional epidemiological models typically assume no social structure, network theory suggests that an individual’s location in the network determines its risk of infection. Empirical, especially experimental, studies of disease spread on networks are lacking, however, largely due to a shortage of amenable study systems. We used automated video-tracking to quantify networks of physical contact among individuals within colonies of the social bumble bee Bombus impatiens. We explored the effects of network structure on pathogen transmission in naturally and artificially infected hives. We show for the first time that contact network structure determines the spread of a contagious pathogen (Crithidia bombi) in social insect colonies. Differences in rates of infection among colonies resulted largely from differences in network density among hives. Within colonies, a bee’s rate of contact with infected nestmates emerged as the only significant predictor of infection risk. The activity of bees, in terms of their movement rates and division of labour (e.g., brood care, nest care, foraging), did not influence risk of infection. Our results suggest that contact networks may have an important influence on the transmission of pathogens in social insects and, possibly, other social animals.     

Analysis of the exponential decay model of the neuron showing frequency threshold effects

The exponential decay model of a neuron has been analyzed using the “random walk” approach of stochastic processes and an “absorbing barrier” solution is obtained forg ^T (s)—the Laplace transform of the output pulse interval density function. An expression for the mean output frequency is derived from this and a variety of input-output curves plotted which show frequency threshold effects in single neurons. Our results are compared with those of other authors obtained by computer simulation techniques, and the significance of these results discussed with reference to the possible behavior of networks constructed of such neuron units.     

Shaping bursting by electrical coupling and noise

Gap-junctional coupling is an important way of communication between neurons and other excitable cells. Strong electrical coupling synchronizes activity across cell ensembles. Surprisingly, in the presence of noise synchronous oscillations generated by an electrically coupled network may differ qualitatively from the oscillations produced by uncoupled individual cells forming the network. A prominent example of such behavior is the synchronized bursting in islets of Langerhans formed by pancreatic β-cells, which in isolation are known to exhibit irregular spiking (Sherman and Rinzel, Biophys J 54:411–425, 1988; Sherman and Rinzel, Biophys J 59:547–559, 1991). At the heart of this intriguing phenomenon lies denoising, a remarkable ability of electrical coupling to diminish the effects of noise acting on individual cells. In this paper, building on an earlier analysis of denoising in networks of integrate-and-fire neurons (Medvedev, Neural Comput 21 (11):3057–3078, 2009) and our recent study of spontaneous activity in a closely related model of the Locus Coeruleus network (Medvedev and Zhuravytska, The geometry of spontaneous spiking in neuronal networks, submitted, 2012), we derive quantitative estimates characterizing denoising in electrically coupled networks of conductance-based models of square wave bursting cells. Our analysis reveals the interplay of the intrinsic properties of the individual cells and network topology and their respective contributions to this important effect. In particular, we show that networks on graphs with large algebraic connectivity (Fiedler, Czech Math J 23(98):298–305, 1973) or small total effective resistance (Bollobas, Modern graph theory, Graduate Texts in Mathematics, vol. 184, Springer, New York, 1998) are better equipped for implementing denoising. As a by-product of the analysis of denoising, we analytically estimate the rate with which trajectories converge to the synchronization subspace and the stability of the latter to random perturbations. These estimates reveal the role of the network topology in synchronization. The analysis is complemented by numerical simulations of electrically coupled conductance-based networks. Taken together, these results explain the mechanisms underlying synchronization and denoising in an important class of biological models.     

Ectomycorrhizal Networks of Pseudotsuga menziesii var. glauca Trees Facilitate Establishment of Conspecific Seedlings Under Drought

Ectomycorrhizal (EM) networks are hypothesized to facilitate regeneration under abiotic stress. We tested the role of networks in interactions between P. menziesii var. glauca trees and conspecific seedlings along a climatic moisture gradient to: (1) determine the effects of climatic factors on network facilitation of Pseudotsuga menziesii (Mirb.) Franco var. glauca (Mayr) seedling establishment, (2) infer the changing importance of P. menziesii var. glauca parent trees in conspecific regeneration with climate, and (3) parse the competitive from facilitative effects of P. menziesii var. glauca trees on seedlings. When drought conditions were greatest, seedling growth increased when seedlings could form a network with trees in the absence of root competition, but was reduced when unable to form a network. Survival was maximized when seedlings were able to form a network in the absence of root competition. Seedling stem natural abundance δ¹³C increased with drought due to increasing water use efficiency, but was unaffected by distance from tree or network potential. We conclude that P. menziesii seedlings may benefit from the presence of established P. menziesii trees when growing under climatic drought, but that this benefit is contingent upon the establishment of an EM network prior to the onset of summer drought. These results suggest that networks are an important mechanism for EM plants establishing in a pattern consistent with the stress-gradient hypothesis, and therefore the importance of EM networks to facilitation in regeneration of EM trees is expected to increase with drought.     

A versatile ODE approximation to a network model for the spread of sexually transmitted diseases

 We develop a moment closure approximation (MCA) to a network model of sexually transmitted disease (STD) spread through a steady/casual partnership network. MCA has been used previously to approximate static, regular lattices, whereas application to dynamic, irregular networks is a new endeavour, and application to sociologically-motivated network models has not been attempted. Our goals are 1) to investigate issues relating to the application of moment closure approximations to dynamic and irregular networks, and 2) to understand the impact of concurrent casual partnerships on STD transmission through a population of predominantly steady monogamous partnerships. We are able to derive a moment closure approximation for a dynamic irregular network representing sexual partnership dynamics, however, we are forced to use a triple approximation due to the large error of the standard pair approximation. This example underscores the importance of doing error analysis for moment closure approximations. We also find that a small number of casual partnerships drastically increases the prevalence and rate of spread of the epidemic. Finally, although the approximation is derived for a specific network model, we can recover approximations to a broad range of network models simply by varying model parameters which control the structure of the dynamic network. Thus our moment closure approximation is very flexible in the kinds of network models it can approximate. Received: 26 August 2001 / Revised version: 15 March 2002 / Published online: 23 August 2002 C.T.B. was supported by the NSF. Key words or phrases: Moment closure approximation – Network model – Pair approximation – Sexually transmitted diseases – Steady/casual partnership network     

A comparative tunnelling network approach to assess interspecific competition effects in termites

We study the tunnelling network dynamics of two morphologically and ecologically very similar native termite species from the Brazilian Cerrado, Cornitermes cumulans and Procornitermes araujoi, both when they are digging alone or when their tunnel networks can meet. Their network topologies have the same geometrical properties with only slight differences in digging speed and branching rates. Petri dish laboratory assays show that the two species have a strong potential for interference competition. However, encounters between the two tunnelling networks produce no measurable effect on the level of the total network growth dynamics. A brief fighting erupts in the meeting zone with some increased mortality and territorial gains or losses on both sides. This aggressive encounter is quickly ended by walling off the gap between the two networks. Tunnel speed analysis of the last 5 mm before an encounter shows some evidence that at least one species, P. araujoi, detects the presence of the competitor even before actually breaking into their tunnels. We compare these results to those found in invasive termite species and discuss them in the species’ ecological context: their strategies might be linked to the well-known r- and K-strategy concept.