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.

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.

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.

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.

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.

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.