A generalized finite element method with global-local enrichment functions for confined plasticity problems

The main feature of partition of unity methods such as the generalized or extended finite element method is their ability of utilizing a priori knowledge about the solution of a problem in the form of enrichment functions. However, analytical derivation of enrichment functions with good approximation properties is mostly limited to two-dimensional linear problems. This paper presents a procedure to numerically generate proper enrichment functions for three-dimensional problems with confined plasticity where plastic evolution is gradual. This procedure involves the solution of boundary value problems around local regions exhibiting nonlinear behavior and the enrichment of the global solution space with the local solutions through the partition of unity method framework. This approach can produce accurate nonlinear solutions with a reduced computational cost compared to standard finite element methods since computationally intensive nonlinear iterations can be performed on coarse global meshes after the creation of enrichment functions properly describing localized nonlinear behavior. Several three-dimensional nonlinear problems based on the rate-independent J (2) plasticity theory with isotropic hardening are solved using the proposed procedure to demonstrate its robustness, accuracy and computational efficiency.

Transiting exoplanets from the CoRoT space mission XXII. CoRoT-16b: a hot Jupiter with a hint of eccentricity around a faint solar-like star

Aims. We report the discovery of CoRoT-16b, a low density hot jupiter that orbits a faint G5V star (mV = 15.63) in 5.3523 +/- 0.0002 days with slight eccentricity. A fit of the data with no a priori assumptions on the orbit leads to an eccentricity of 0.33 +/- 0.1. We discuss this value and also derive the mass and radius of the planet. Methods. We analyse the photometric transit curve of CoRoT-16 given by the CoRoT satellite, and radial velocity data from the HARPS and HIRES spectrometers. A combined analysis using a Markov chain Monte Carlo algorithm is used to get the system parameters. Results. CoRoT-16b is a 0.535 -0.083/+0.085 M-J, 1.17 -0.14/+0.16 R-J hot Jupiter with a density of 0.44 -0.14/+0.21 g cm(-3). Despite its short orbital distance (0.0618 +/- 0.0015 AU) and the age of the parent star (6.73 +/- 2.8 Gyr), the planet orbit exhibits significantly non-zero eccentricity. This is very uncommon for this type of objects as tidal effects tend to circularise the orbit. This value is discussed taking into account the characteristics of the star and the observation accuracy.

Hypoellipticity in spaces of ultradistributions-Study of a model case

In this work we study C (a)-hypoellipticity in spaces of ultradistributions for analytic linear partial differential operators. Our main tool is a new a-priori inequality, which is stated in terms of the behaviour of holomorphic functions on appropriate wedges. In particular, for sum of squares operators satisfying Hormander's condition, we thus obtain a new method for studying analytic hypoellipticity for such a class. We also show how this method can be explicitly applied by studying a model operator, which is constructed as a perturbation of the so-called Baouendi-Goulaouic operator.

Modeling gene expression regulatory networks with the sparse vector autoregressive model

Abstract Background To understand the molecular mechanisms underlying important biological processes, a detailed description of the gene products networks involved is required. In order to define and understand such molecular networks, some statistical methods are proposed in the literature to estimate gene regulatory networks from time-series microarray data. However, several problems still need to be overcome. Firstly, information flow need to be inferred, in addition to the correlation between genes. Secondly, we usually try to identify large networks from a large number of genes (parameters) originating from a smaller number of microarray experiments (samples). Due to this situation, which is rather frequent in Bioinformatics, it is difficult to perform statistical tests using methods that model large gene-gene networks. In addition, most of the models are based on dimension reduction using clustering techniques, therefore, the resulting network is not a gene-gene network but a module-module network. Here, we present the Sparse Vector Autoregressive model as a solution to these problems. Results We have applied the Sparse Vector Autoregressive model to estimate gene regulatory networks based on gene expression profiles obtained from time-series microarray experiments. Through extensive simulations, by applying the SVAR method to artificial regulatory networks, we show that SVAR can infer true positive edges even under conditions in which the number of samples is smaller than the number of genes. Moreover, it is possible to control for false positives, a significant advantage when compared to other methods described in the literature, which are based on ranks or score functions. By applying SVAR to actual HeLa cell cycle gene expression data, we were able to identify well known transcription factor targets. Conclusion The proposed SVAR method is able to model gene regulatory networks in frequent situations in which the number of samples is lower than the number of genes, making it possible to naturally infer partial Granger causalities without any a priori information. In addition, we present a statistical test to control the false discovery rate, which was not previously possible using other gene regulatory network models.

Constraint-based analysis of gene interactions using restricted boolean networks and time-series data

Abstract Background A popular model for gene regulatory networks is the Boolean network model. In this paper, we propose an algorithm to perform an analysis of gene regulatory interactions using the Boolean network model and time-series data. Actually, the Boolean network is restricted in the sense that only a subset of all possible Boolean functions are considered. We explore some mathematical properties of the restricted Boolean networks in order to avoid the full search approach. The problem is modeled as a Constraint Satisfaction Problem (CSP) and CSP techniques are used to solve it. Results We applied the proposed algorithm in two data sets. First, we used an artificial dataset obtained from a model for the budding yeast cell cycle. The second data set is derived from experiments performed using HeLa cells. The results show that some interactions can be fully or, at least, partially determined under the Boolean model considered. Conclusions The algorithm proposed can be used as a first step for detection of gene/protein interactions. It is able to infer gene relationships from time-series data of gene expression, and this inference process can be aided by a priori knowledge available.