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.

Collision free region determination by modified polygonal Boolean operations

Cutting and packing problems are found in numerous industries such as garment, wood and shipbuilding. The collision free region concept is presented, as it represents all the translations possible for an item to be inserted into a container with already placed items. The often adopted nofit polygon concept and its analogous concept inner fit polygon are used to determine the collision free region. Boolean operations involving nofit polygons and inner fit polygons are used to determine the collision free region. New robust non-regularized Boolean operations algorithm is proposed to determine the collision free region. The algorithm is capable of dealing with degenerated boundaries. This capability is important because degenerated boundaries often represent local optimal placements. A parallelized version of the algorithm is also proposed and tests are performed in order to determine the execution times of both the serial and parallel versions of the algorithm.

Archeointensity in Northeast Brazil over the past five centuries

This study presents the first archeointensity results from Northeast Brazil obtained from 14 groups of architectural brick fragments sampled in the city of Salvador, Bahia State (13 degrees S, 38.5 degrees W) and dated between the middle of the XVIth century and the beginning of the XIXth century. The dating is ascertained by historical documents complemented by archeological constraints, yielding in all cases age uncertainties of less than 50 years. Analyses were carried out using two experimental protocols: 1 the ""zero field-in field"" version of the classical Thellier and Thellier method as proposed by Coe (TT-ZI), including partial thermoremanent magnetization (pTRM) and pTRM-tail checks, and 2 the Triaxe procedure involving continuous high temperature magnetization measurements. Both TRM anisotropy and cooling rate effects were taken into account for the intensity determinations. The cooling rate effect was further explored for the TT-ZI protocol using three increasing slow cooling times (5 h, 10 h and 25 h) between 450 C and room temperature. Following archeological constraints, the slowest cooling time was retained in our study, yielding decreases of the raw intensity values by 4% to 14%. For each fragment, a mean intensity was computed and retained only when the data obtained from all specimens (between 2 and 6) satisfied a coherence test at similar to 5%. A total of 57 fragments (183 specimens) was considered for the computations of site-mean intensity values, with derived standard deviations of less than 8% of the corresponding means. When separately computed using the two experimental techniques, the site-mean intensity values always agree to within 5%. A good consistency is observed between intensity values of similar or close ages, which strengthen their reliability. Our data principally show a significant and continuous decrease in geomagnetic field intensity in Northeast Brazil between the first half of the XVIIth century and the XXth century. One result dated to the second half of the XVIth century further suggests that the geomagnetic field intensity reached a maximum around 1600 AD. This evolution is in good agreement with that expected in the city of Salvador from the available global geomagnetic field models. However, the accuracy of these models appears less well constrained between similar to 1550 AD and similar to 1650 AD. (C) 2010 Elsevier B.V. All rights reserved.

Malcev dialgebras

We apply Kolesnikov's algorithm to obtain a variety of nonassociative algebras defined by right anticommutativity and a "noncommutative" version of the Malcev identity. We use computer algebra to verify that these identities are equivalent to the identities of degree up to 4 satisfied by the dicommutator in every alternative dialgebra. We extend these computations to show that any special identity for Malcev dialgebras must have degree at least 7. Finally, we introduce a trilinear operation which makes any Malcev dialgebra into a Leibniz triple system.

Application of the log-conformation tensor to three-dimensional time-dependent free surface flows

The numerical simulation of flows of highly elastic fluids has been the subject of intense research over the past decades with important industrial applications. Therefore, many efforts have been made to improve the convergence capabilities of the numerical methods employed to simulate viscoelastic fluid flows. An important contribution for the solution of the High-Weissenberg Number Problem has been presented by Fattal and Kupferman [J. Non-Newton. Fluid. Mech. 123 (2004) 281-285] who developed the matrix-logarithm of the conformation tensor technique, henceforth called log-conformation tensor. Its advantage is a better approximation of the large growth of the stress tensor that occur in some regions of the flow and it is doubly beneficial in that it ensures physically correct stress fields, allowing converged computations at high Weissenberg number flows. In this work we investigate the application of the log-conformation tensor to three-dimensional unsteady free surface flows. The log-conformation tensor formulation was applied to solve the Upper-Convected Maxwell (UCM) constitutive equation while the momentum equation was solved using a finite difference Marker-and-Cell type method. The resulting developed code is validated by comparing the log-conformation results with the analytic solution for fully developed pipe flows. To illustrate the stability of the log-conformation tensor approach in solving three-dimensional free surface flows, results from the simulation of the extrudate swell and jet buckling phenomena of UCM fluids at high Weissenberg numbers are presented. (C) 2012 Elsevier B.V. All rights reserved.

Double point curves for corank 2 map germs from C-2 to C-3

We characterize finite determinacy of map germs f : (C-2, 0) -> (C-3, 0) in terms of the Milnor number mu(D(f)) of the double point curve D(f) in (C-2, 0) and we provide an explicit description of the double point scheme in terms of elementary symmetric functions. Also we prove that the Whitney equisingularity of 1-parameter families of map germs f(t) : (C-2, 0) -> (C-3, 0) is equivalent to the constancy of both mu(D(f(t))) and mu(f(t)(C-2)boolean AND H) with respect to t, where H subset of C-3 is a generic plane. (C) 2011 Elsevier B.V. All rights reserved.

Signal propagation in Bayesian networks and its relationship with intrinsically multivariate predictive variables

A set of predictor variables is said to be intrinsically multivariate predictive (IMP) for a target variable if all properly contained subsets of the predictor set are poor predictors of the. target but the full set predicts the target with great accuracy. In a previous article, the main properties of IMP Boolean variables have been analytically described, including the introduction of the IMP score, a metric based on the coefficient of determination (CoD) as a measure of predictiveness with respect to the target variable. It was shown that the IMP score depends on four main properties: logic of connection, predictive power, covariance between predictors and marginal predictor probabilities (biases). This paper extends that work to a broader context, in an attempt to characterize properties of discrete Bayesian networks that contribute to the presence of variables (network nodes) with high IMP scores. We have found that there is a relationship between the IMP score of a node and its territory size, i.e., its position along a pathway with one source: nodes far from the source display larger IMP scores than those closer to the source, and longer pathways display larger maximum IMP scores. This appears to be a consequence of the fact that nodes with small territory have larger probability of having highly covariate predictors, which leads to smaller IMP scores. In addition, a larger number of XOR and NXOR predictive logic relationships has positive influence over the maximum IMP score found in the pathway. This work presents analytical results based on a simple structure network and an analysis involving random networks constructed by computational simulations. Finally, results from a real Bayesian network application are provided. (C) 2012 Elsevier Inc. All rights reserved.

ON THE RADICAL OF A FREE MALCEV ALGEBRA

We prove that the prime radical rad M of the free Malcev algebra M of rank more than two over a field of characteristic not equal 2 coincides with the set of all universally Engelian elements of M. Moreover, let T(M) be the ideal of M consisting of all stable identities of the split simple 7-dimensional Malcev algebra M over F. It is proved that rad M = J(M) boolean AND T(M), where J(M) is the Jacobian ideal of M. Similar results were proved by I. Shestakov and E. Zelmanov for free alternative and free Jordan algebras.

LALP: a language to program custom FPGA-based acceleration engines

Field-Programmable Gate Arrays (FPGAs) are becoming increasingly important in embedded and high-performance computing systems. They allow performance levels close to the ones obtained with Application-Specific Integrated Circuits, while still keeping design and implementation flexibility. However, to efficiently program FPGAs, one needs the expertise of hardware developers in order to master hardware description languages (HDLs) such as VHDL or Verilog. Attempts to furnish a high-level compilation flow (e.g., from C programs) still have to address open issues before broader efficient results can be obtained. Bearing in mind an FPGA available resources, it has been developed LALP (Language for Aggressive Loop Pipelining), a novel language to program FPGA-based accelerators, and its compilation framework, including mapping capabilities. The main ideas behind LALP are to provide a higher abstraction level than HDLs, to exploit the intrinsic parallelism of hardware resources, and to allow the programmer to control execution stages whenever the compiler techniques are unable to generate efficient implementations. Those features are particularly useful to implement loop pipelining, a well regarded technique used to accelerate computations in several application domains. This paper describes LALP, and shows how it can be used to achieve high-performance computing solutions.

A theoretical model for estimating the margination constant of leukocytes

Abstract Background Blood leukocytes constitute two interchangeable sub-populations, the marginated and circulating pools. These two sub-compartments are found in normal conditions and are potentially affected by non-normal situations, either pathological or physiological. The dynamics between the compartments is governed by rate constants of margination (M) and return to circulation (R). Therefore, estimates of M and R may prove of great importance to a deeper understanding of many conditions. However, there has been a lack of formalism in order to approach such estimates. The few attempts to furnish an estimation of M and R neither rely on clearly stated models that precisely say which rate constant is under estimation nor recognize which factors may influence the estimation. Results The returning of the blood pools to a steady-state value after a perturbation (e.g., epinephrine injection) was modeled by a second-order differential equation. This equation has two eigenvalues, related to a fast- and to a slow-component of the dynamics. The model makes it possible to identify that these components are partitioned into three constants: R, M and SB; where SB is a time-invariant exit to tissues rate constant. Three examples of the computations are worked and a tentative estimation of R for mouse monocytes is presented. Conclusions This study establishes a firm theoretical basis for the estimation of the rate constants of the dynamics between the blood sub-compartments of white cells. It shows, for the first time, that the estimation must also take into account the exit to tissues rate constant, SB.

Anxiety and joint hypermobility association: a systematic review

BACKGROUND: Anxiety disorders are often associated with several non-psychiatric medical conditions. Among the clinical conditions found in association with anxiety stands out the joint hypermobility (JH). OBJECTIVES: To carry out a systematic review of the clinical association between anxiety disorders and JH. METHOD: A survey was conducted in MEDLINE, PsychINFO, LILACS e SciELO databases up to December 2011. We searched for articles using the keywords 'anxiety', 'joint' and 'hypermobility' and Boolean operators. The review included articles describing empirical studies on the association between JH and anxiety. The reference lists of selected articles were systematically hand-searched for other publications relevant to the review. RESULTS: Seventeen articles were included in the analysis and classified to better extract data. We found heterogeneity between the studies relate to the methodology used. Most of the studies found an association between anxiety features and JH. Panic disorder/agoraphobia was the anxiety disorder associated with JH in several studies. Etiological explanation of the relationship between anxiety and JH is still controversial. CONCLUSION: Future research in large samples from the community and clinical setting and longitudinal studies of the association between anxiety and HA and the underlying biological mechanisms involved in this association are welcome.

Parallel Layout Construction Algorithm for Irregular Shape Packing Problems

Cutting and packing problems arise in a variety of industries, including garment, wood and shipbuilding. Irregular shape packing is a special case which admits irregular items and is much more complex due to the geometry of items. In order to ensure that items do not overlap and no item from the layout protrudes from the container, the collision free region concept was adopted. It represents all possible translations for a new item to be inserted into a container with already placed items. To construct a feasible layout, collision free region for each item is determined through a sequence of Boolean operations over polygons. In order to improve the speed of the algorithm, a parallel version of the layout construction was proposed and it was applied to a simulated annealing algorithm used to solve bin packing problems. Tests were performed in order to determine the speed improvement of the parallel version over the serial algorithm