Gene Expression Complex Networks: Synthesis, Identification, and Analysis

Thanks to recent advances in molecular biology, allied to an ever increasing amount of experimental data, the functional state of thousands of genes can now be extracted simultaneously by using methods such as cDNA microarrays and RNA-Seq. Particularly important related investigations are the modeling and identification of gene regulatory networks from expression data sets. Such a knowledge is fundamental for many applications, such as disease treatment, therapeutic intervention strategies and drugs design, as well as for planning high-throughput new experiments. Methods have been developed for gene networks modeling and identification from expression profiles. However, an important open problem regards how to validate such approaches and its results. This work presents an objective approach for validation of gene network modeling and identification which comprises the following three main aspects: (1) Artificial Gene Networks (AGNs) model generation through theoretical models of complex networks, which is used to simulate temporal expression data; (2) a computational method for gene network identification from the simulated data, which is founded on a feature selection approach where a target gene is fixed and the expression profile is observed for all other genes in order to identify a relevant subset of predictors; and (3) validation of the identified AGN-based network through comparison with the original network. The proposed framework allows several types of AGNs to be generated and used in order to simulate temporal expression data. The results of the network identification method can then be compared to the original network in order to estimate its properties and accuracy. Some of the most important theoretical models of complex networks have been assessed: the uniformly-random Erdos-Renyi (ER), the small-world Watts-Strogatz (WS), the scale-free Barabasi-Albert (BA), and geographical networks (GG). The experimental results indicate that the inference method was sensitive to average degree k variation, decreasing its network recovery rate with the increase of k. The signal size was important for the inference method to get better accuracy in the network identification rate, presenting very good results with small expression profiles. However, the adopted inference method was not sensible to recognize distinct structures of interaction among genes, presenting a similar behavior when applied to different network topologies. In summary, the proposed framework, though simple, was adequate for the validation of the inferred networks by identifying some properties of the evaluated method, which can be extended to other inference methods.

INFERENCE FOR EIGENVALUES AND EIGENVECTORS OF GAUSSIAN SYMMETRIC MATRICES

This article presents maximum likelihood estimators (MLEs) and log-likelihood ratio (LLR) tests for the eigenvalues and eigenvectors of Gaussian random symmetric matrices of arbitrary dimension, where the observations are independent repeated samples from one or two populations. These inference problems are relevant in the analysis of diffusion tensor imaging data and polarized cosmic background radiation data, where the observations are, respectively, 3 x 3 and 2 x 2 symmetric positive definite matrices. The parameter sets involved in the inference problems for eigenvalues and eigenvectors are subsets of Euclidean space that are either affine subspaces, embedded submanifolds that are invariant under orthogonal transformations or polyhedral convex cones. We show that for a class of sets that includes the ones considered in this paper, the MLEs of the mean parameter do not depend on the covariance parameters if and only if the covariance structure is orthogonally invariant. Closed-form expressions for the MLEs and the associated LLRs are derived for this covariance structure.

Context tree selection: A unifying view

Context tree models have been introduced by Rissanen in [25] as a parsimonious generalization of Markov models. Since then, they have been widely used in applied probability and statistics. The present paper investigates non-asymptotic properties of two popular procedures of context tree estimation: Rissanen's algorithm Context and penalized maximum likelihood. First showing how they are related, we prove finite horizon bounds for the probability of over- and under-estimation. Concerning overestimation, no boundedness or loss-of-memory conditions are required: the proof relies on new deviation inequalities for empirical probabilities of independent interest. The under-estimation properties rely on classical hypotheses for processes of infinite memory. These results improve on and generalize the bounds obtained in Duarte et al. (2006) [12], Galves et al. (2008) [18], Galves and Leonardi (2008) [17], Leonardi (2010) [22], refining asymptotic results of Buhlmann and Wyner (1999) [4] and Csiszar and Talata (2006) [9]. (C) 2011 Elsevier B.V. All rights reserved.

A PHASE TRANSITION FOR COMPETITION INTERFACES

We study the competition interface between two growing clusters in a growth model associated to last-passage percolation. When the initial unoccupied set is approximately a cone, we show that this interface has an asymptotic direction with probability 1. The behavior of this direction depends on the angle theta of the cone: for theta >= 180 degrees, the direction is deterministic, while for theta < 180 degrees, it is random, and its distribution can be given explicitly in certain cases. We also obtain partial results on the fluctuations of the interface around its asymptotic direction. The evolution of the competition interface in the growth model can be mapped onto the path of a second-class particle in the totally asymmetric simple exclusion process; from the existence of the limiting direction for the interface, we obtain a new and rather natural proof of the strong law of large numbers (with perhaps a random limit) for the position of the second-class particle at large times.

POLLING SYSTEMS WITH PARAMETER REGENERATION, THE GENERAL CASE

We consider a polling model with multiple stations, each with Poisson arrivals and a queue of infinite capacity. The service regime is exhaustive and there is Jacksonian feedback of served customers. What is new here is that when the server comes to a station it chooses the service rate and the feedback parameters at random; these remain valid during the whole stay of the server at that station. We give criteria for recurrence, transience and existence of the sth moment of the return time to the empty state for this model. This paper generalizes the model, when only two stations accept arriving jobs, which was considered in [Ann. Appl. Probab. 17 (2007) 1447-1473]. Our results are stated in terms of Lyapunov exponents for random matrices. From the recurrence criteria it can be seen that the polling model with parameter regeneration can exhibit the unusual phenomenon of null recurrence over a thick region of parameter space.

Screening of Microorganisms Producing Cold-Active Oxidoreductases to Be Applied in Enantioselective Alcohol Oxidation. An Antarctic Survey

Several microorganisms were isolated from soil/sediment samples of Antarctic Peninsula. The enrichment technique using (RS)-.1-(phenyl) ethanol as a carbon source allowed us to isolate 232 psychrophile/psychrotroph microorganisms. We also evaluated the enzyme activity (oxidoreductases) for enantioselective oxidation reactions, by using derivatives of (RS)-.1-(phenyl) ethanol as substrates. Among the studied microorganisms, 15 psychrophile/psychrotroph strains contain oxidoreductases that catalyze the (S)-.enantiomer oxidation from racemic alcohols to their corresponding ketones. Among the identified microorganisms, Flavobacterium sp. and Arthrobacter sp. showed excellent enzymatic activity. These new bacteria strains were selected for optimization study, in which the (RS)-.1-(4-.methyl-.phenyl) ethanol oxidation was evaluated in several reaction conditions. From these studies, it was observed that Flavobacterium sp. has an excellent enzymatic activity at 10 degrees C and Arthrobacter sp. at 15 and 25 degrees C. We have also determined the growth curves of these bacteria, and both strains showed optimum growth at 25 degrees C, indicating that these bacteria are psychrotroph.

Fertilizers applied to certified organic tomato culture

The tomato culture demands large quantities of mineral nutrients, which are supplied by synthetic fertilizers in the conventional cultivation system. In the organic cultivation system only alternative fertilizers are allowed by the certifiers and accepted as safe for humans and environment. The chemical composition of rice bran, oyster flour, cattle manure and ground charcoal, as well as soils and tomato fruits were evaluated by instrumental neutron activation analysis (INAA). The potential contribution of organic fertilizers to the enrichment of chemical elements in soil and their transfer to fruits was investigated using concentration ratios for fertilizer and soil samples, and also for soil and tomato. Results evidenced that these alternative fertilizers could be taken as important sources of Br, Ca, Ce, K, Na and Zn for the organic tomato culture.

Chemical characterization of agricultural supplies applied to organic tomato cultivation

The agricultural supplies used in the organic system to control pests and diseases as well as to fertilize soil are claimed to be beneficial to plants and innocuous to human health and to the environment. The chemical composition of six agricultural supplies commonly used in the organic tomato culture, was evaluated by instrumental neutron activation analysis (INAA). Results were compared to the maximum limits established by the Environment Control Agency of the Sao Paulo State (CETESB) and the Guidelines for Organic Quality Standard of Instituto Biodinamico (IBD). Concentrations above reference values were found for Co, Cr and Zn in compost, Cr and Zn in cattle manure and Zn in rice bran.

Support vector machines for detecting age-related changes in running kinematics

Age-related changes in running kinematics have been reported in the literature using classical inferential statistics. However, this approach has been hampered by the increased number of biomechanical gait variables reported and subsequently the lack of differences presented in these studies. Data mining techniques have been applied in recent biomedical studies to solve this problem using a more general approach. In the present work, we re-analyzed lower extremity running kinematic data of 17 young and 17 elderly male runners using the Support Vector Machine (SVM) classification approach. In total, 31 kinematic variables were extracted to train the classification algorithm and test the generalized performance. The results revealed different accuracy rates across three different kernel methods adopted in the classifier, with the linear kernel performing the best. A subsequent forward feature selection algorithm demonstrated that with only six features, the linear kernel SVM achieved 100% classification performance rate, showing that these features provided powerful combined information to distinguish age groups. The results of the present work demonstrate potential in applying this approach to improve knowledge about the age-related differences in running gait biomechanics and encourages the use of the SVM in other clinical contexts. (C) 2010 Elsevier Ltd. All rights reserved.

Academic papers about fight, martial arts and combat sports

The present study had as objective to verify the production of fight, martial arts and combat sports in articles published in the main Physical Education academic journals available in Brazil after the establishment of the CONFEF, as well as analyze the subjects studied in these articles. The subject classification followed Tani (1996)`s proposition concerning an academic structure to Kinesiology, Physical Education and Sport. When considering the 2561 articles published on these journals only 75 (2.93%) were related to Fight/Martial Arts/Combat Sports. It was verified a predominance of studies conducted in the Biodynamic area (40%), followed by Human Movement Socio-cultural Studies (32%) and Motor Behavior (8%). The applied studies were divided as: Human Movement Pedagogy (10.7%), Sports Training (8%), Sports Administration (1.3%) and Adapted Human Movement (none study published). These data indicate: (1) a reduced number of publications concerning these activities, especially those of applied nature; (2) a need to promote inter and multidisciplinary research about this subject.

Optimization of Heat Treatment Profiles Applied to Nanometric-Scale Nb(3)Sn Wires With Cu-Sn Artificial Pinning Centers

Nb(3)Sn is one of the most used superconducting materials for applications in high magnetic fields. The improvement of the critical current densities (J(c)) is important, and must be analyzed together with the optimization of the flux pinning acting in the material. For Nb(3)Sn, it is known that the grain boundaries are the most effective pinning centers. However, the introduction of artificial pinning centers (APCs) with different superconducting properties has been proved to be beneficial for J(c). As these APCs are normally in the nanometric-scale, the conventional heat treatment profiles used for Nb(3)Sn wires cannot be directly applied, leading to excessive grain growth and/or increase of the APCs cross sections. In this work, the heat treatment profiles for Nb(3)Sn superconductor wires with Cu(Sn) artificial pinning centers in nanometric-scale were analyzed in an attempt to improve J(c) . It is described a methodology to optimize the heat treatment profiles in respect to diffusion, reaction and formation of the superconducting phases. Microstructural, transport and magnetic characterization were performed in an attempt to find the pinning mechanisms acting in the samples. It was concluded that the maximum current densities were found when normal phases (due to the introduction of the APCs) are acting as main pinning centers in the global behavior of the Nb(3)Sn superconducting wire.

Modeling associations between genetic markers using Bayesian networks

Motivation: Understanding the patterns of association between polymorphisms at different loci in a population ( linkage disequilibrium, LD) is of fundamental importance in various genetic studies. Many coefficients were proposed for measuring the degree of LD, but they provide only a static view of the current LD structure. Generative models (GMs) were proposed to go beyond these measures, giving not only a description of the actual LD structure but also a tool to help understanding the process that generated such structure. GMs based in coalescent theory have been the most appealing because they link LD to evolutionary factors. Nevertheless, the inference and parameter estimation of such models is still computationally challenging. Results: We present a more practical method to build GM that describe LD. The method is based on learning weighted Bayesian network structures from haplotype data, extracting equivalence structure classes and using them to model LD. The results obtained in public data from the HapMap database showed that the method is a promising tool for modeling LD. The associations represented by the learned models are correlated with the traditional measure of LD D`. The method was able to represent LD blocks found by standard tools. The granularity of the association blocks and the readability of the models can be controlled in the method. The results suggest that the causality information gained by our method can be useful to tell about the conservability of the genetic markers and to guide the selection of subset of representative markers.

Node-Depth Encoding and Multiobjective Evolutionary Algorithm Applied to Large-Scale Distribution System Reconfiguration

The power loss reduction in distribution systems (DSs) is a nonlinear and multiobjective problem. Service restoration in DSs is even computationally hard since it additionally requires a solution in real-time. Both DS problems are computationally complex. For large-scale networks, the usual problem formulation has thousands of constraint equations. The node-depth encoding (NDE) enables a modeling of DSs problems that eliminates several constraint equations from the usual formulation, making the problem solution simpler. On the other hand, a multiobjective evolutionary algorithm (EA) based on subpopulation tables adequately models several objectives and constraints, enabling a better exploration of the search space. The combination of the multiobjective EA with NDE (MEAN) results in the proposed approach for solving DSs problems for large-scale networks. Simulation results have shown the MEAN is able to find adequate restoration plans for a real DS with 3860 buses and 632 switches in a running time of 0.68 s. Moreover, the MEAN has shown a sublinear running time in function of the system size. Tests with networks ranging from 632 to 5166 switches indicate that the MEAN can find network configurations corresponding to a power loss reduction of 27.64% for very large networks requiring relatively low running time.

An approach of optimal sensitivity applied in the tertiary loop of the automatic generation control

This paper proposes an approach of optimal sensitivity applied in the tertiary loop of the automatic generation control. The approach is based on the theorem of non-linear perturbation. From an optimal operation point obtained by an optimal power flow a new optimal operation point is directly determined after a perturbation, i.e., without the necessity of an iterative process. This new optimal operation point satisfies the constraints of the problem for small perturbation in the loads. The participation factors and the voltage set point of the automatic voltage regulators (AVR) of the generators are determined by the technique of optimal sensitivity, considering the effects of the active power losses minimization and the network constraints. The participation factors and voltage set point of the generators are supplied directly to a computational program of dynamic simulation of the automatic generation control, named by power sensitivity mode. Test results are presented to show the good performance of this approach. (C) 2008 Elsevier B.V. All rights reserved.

Data Mining Applied to Harmonic Current Sources Identification in Residential Consumers

This work proposes a method based on both preprocessing and data mining with the objective of identify harmonic current sources in residential consumers. In addition, this methodology can also be applied to identify linear and nonlinear loads. It should be emphasized that the entire database was obtained through laboratory essays, i.e., real data were acquired from residential loads. Thus, the residential system created in laboratory was fed by a configurable power source and in its output were placed the loads and the power quality analyzers (all measurements were stored in a microcomputer). So, the data were submitted to pre-processing, which was based on attribute selection techniques in order to minimize the complexity in identifying the loads. A newer database was generated maintaining only the attributes selected, thus, Artificial Neural Networks were trained to realized the identification of loads. In order to validate the methodology proposed, the loads were fed both under ideal conditions (without harmonics), but also by harmonic voltages within limits pre-established. These limits are in accordance with IEEE Std. 519-1992 and PRODIST (procedures to delivery energy employed by Brazilian`s utilities). The results obtained seek to validate the methodology proposed and furnish a method that can serve as alternative to conventional methods.