Equilibrium points and central configurations for the Lennard-Jones 2-and 3-body problems

Abstract. In this paper we study the relative equilibria and their stability for a system of three point particles moving under the action of a Lennard{Jones potential. A central con guration is a special position of the particles where the position and acceleration vectors of each particle are proportional, and the constant of proportionality is the same for all particles. Since the Lennard{Jones potential depends only on the mutual distances among the particles, it is invariant under rotations. In a rotating frame the orbits coming from central con gurations become equilibrium points, the relative equilibria. Due to the form of the potential, the relative equilibria depend on the size of the system, that is, depend strongly of the momentum of inertia I. In this work we characterize the relative equilibria, we nd the bifurcation values of I for which the number of relative equilibria is changing, we also analyze the stability of the relative equilibria.

Symmetric periodic orbits near a heteroclinic loop in R3 formed by two singular points, a semistable periodic orbit and their invariant manifolds

In this paper we consider C1 vector fields X in R3 having a “generalized heteroclinic loop” L which is topologically homeomorphic to the union of a 2–dimensional sphere S2 and a diameter connecting the north with the south pole. The north pole is an attractor on S2 and a repeller on . The equator of the sphere is a periodic orbit unstable in the north hemisphere and stable in the south one. The full space is topologically homeomorphic to the closed ball having as boundary the sphere S2. We also assume that the flow of X is invariant under a topological straight line symmetry on the equator plane of the ball. For each n ∈ N, by means of a convenient Poincar´e map, we prove the existence of infinitely many symmetric periodic orbits of X near L that gives n turns around L in a period. We also exhibit a class of polynomial vector fields of degree 4 in R3 satisfying this dynamics.

Symmetric periodic orbits near a heteroclinic loop formed by two singular points and their invariant manifolds of dimension 1 and 2

In this paper we consider vector fields in R3 that are invariant under a suitable symmetry and that posses a “generalized heteroclinic loop” L formed by two singular points (e+ and e −) and their invariant manifolds: one of dimension 2 (a sphere minus the points e+ and e −) and one of dimension 1 (the open diameter of the sphere having endpoints e+ and e −). In particular, we analyze the dynamics of the vector field near the heteroclinic loop L by means of a convenient Poincar´e map, and we prove the existence of infinitely many symmetric periodic orbits near L. We also study two families of vector fields satisfying this dynamics. The first one is a class of quadratic polynomial vector fields in R3, and the second one is the charged rhomboidal four body problem.

The role of Cysteine 6.47 in class A GPCRs

Abstract Background: The CWxP motif of transmembrane helix 6 (x: any residue) is highly conserved in class A GPCRs. Within this motif, W6.48 is a big star in the theory of the global “toggle switch” because of its key role in the activation mechanism of GPCRs upon ligand binding. With all footlights focused on W6.48, the reason why the preceding residue, C6.47, is largely conserved is still unknown. The present study is aimed to fill up this lack of knowledge by characterizing the role of C6.47 of the CWxP motif. Results: A complete analysis of available crystal structures has been made alongside with molecular dynamics simulations of model peptides to explore a possible structural role for C6.47. Conclusions: We conclude that C6.47 does not modulate the conformation of the TM6 proline kink and propose that C6.47 participates in the rearrangement of the TM6 and TM7 interface accompanying activation.

An efficient algorithm to perform multiple testing in epistasis screening

Background: Research in epistasis or gene-gene interaction detection for human complex traits has grown over the last few years. It has been marked by promising methodological developments, improved translation efforts of statistical epistasis to biological epistasis and attempts to integrate different omics information sources into the epistasis screening to enhance power. The quest for gene-gene interactions poses severe multiple-testing problems. In this context, the maxT algorithm is one technique to control the false-positive rate. However, the memory needed by this algorithm rises linearly with the amount of hypothesis tests. Gene-gene interaction studies will require a memory proportional to the squared number of SNPs. A genome-wide epistasis search would therefore require terabytes of memory. Hence, cache problems are likely to occur, increasing the computation time. In this work we present a new version of maxT, requiring an amount of memory independent from the number of genetic effects to be investigated. This algorithm was implemented in C++ in our epistasis screening software MBMDR-3.0.3. We evaluate the new implementation in terms of memory efficiency and speed using simulated data. The software is illustrated on real-life data for Crohn’s disease. Results: In the case of a binary (affected/unaffected) trait, the parallel workflow of MBMDR-3.0.3 analyzes all gene-gene interactions with a dataset of 100,000 SNPs typed on 1000 individuals within 4 days and 9 hours, using 999 permutations of the trait to assess statistical significance, on a cluster composed of 10 blades, containing each four Quad-Core AMD Opteron(tm) Processor 2352 2.1 GHz. In the case of a continuous trait, a similar run takes 9 days. Our program found 14 SNP-SNP interactions with a multiple-testing corrected p-value of less than 0.05 on real-life Crohn’s disease (CD) data. Conclusions: Our software is the first implementation of the MB-MDR methodology able to solve large-scale SNP-SNP interactions problems within a few days, without using much memory, while adequately controlling the type I error rates. A new implementation to reach genome-wide epistasis screening is under construction. In the context of Crohn’s disease, MBMDR-3.0.3 could identify epistasis involving regions that are well known in the field and could be explained from a biological point of view. This demonstrates the power of our software to find relevant phenotype-genotype higher-order associations.

On the Selection of Non-Invasive Methods Based on Speech Analysis Oriented to Automatic Alzheimer Disease Diagnosis

The work presented here is part of a larger study to identify novel technologies and biomarkers for early Alzheimer disease (AD) detection and it focuses on evaluating the suitability of a new approach for early AD diagnosis by non-invasive methods. The purpose is to examine in a pilot study the potential of applying intelligent algorithms to speech features obtained from suspected patients in order to contribute to the improvement of diagnosis of AD and its degree of severity. In this sense, Artificial Neural Networks (ANN) have been used for the automatic classification of the two classes (AD and control subjects). Two human issues have been analyzed for feature selection: Spontaneous Speech and Emotional Response. Not only linear features but also non-linear ones, such as Fractal Dimension, have been explored. The approach is non invasive, low cost and without any side effects. Obtained experimental results were very satisfactory and promising for early diagnosis and classification of AD patients.

On Automatic Diagnosis of Alzheimer's Disease based on Spontaneous Speech Analysis and Emotional Temperature

Alzheimer's disease is the most prevalent form of progressive degenerative dementia; it has a high socio-economic impact in Western countries. Therefore it is one of the most active research areas today. Alzheimer's is sometimes diagnosed by excluding other dementias, and definitive confirmation is only obtained through a post-mortem study of the brain tissue of the patient. The work presented here is part of a larger study that aims to identify novel technologies and biomarkers for early Alzheimer's disease detection, and it focuses on evaluating the suitability of a new approach for early diagnosis of Alzheimer’s disease by non-invasive methods. The purpose is to examine, in a pilot study, the potential of applying Machine Learning algorithms to speech features obtained from suspected Alzheimer sufferers in order help diagnose this disease and determine its degree of severity. Two human capabilities relevant in communication have been analyzed for feature selection: Spontaneous Speech and Emotional Response. The experimental results obtained were very satisfactory and promising for the early diagnosis and classification of Alzheimer’s disease patients.

Rethinking study and management of agricultural systems for policy design

There is a concern that agriculture will no longer be able to meet, on a global scale, the growing demand for food. Facing such a challenge requires new patterns of thinking in the context of complexity and sustainability sciences. This paper, focused on the social dimension of the study and management of agricultural systems, suggests that rethinking the study of agricultural systems entails analyzing them as complex socio-ecological systems, as well as considering the differing thinking patterns of diverse stakeholders. The intersubjective nature of knowledge, as studied by different philosophical schools, needs to be better integrated into the study and management of agricultural systems than it is done so far, forcing us to accept that there are no simplistic solutions, and to seek a better understanding of the social dimension of agriculture. Different agriculture related problems require different policy and institutional approaches. Finally, the intersubjective nature of knowledge asks for the visualization of different framings and the power relations taking place in the decision-making process. Rethinking management of agricultural systems implies that policy making should be shaped by different principles: learning, flexibility, adaptation, scale-matching, participation, diversity enhancement and precaution hold the promise to significantly improve current standard management procedures.

A Fast Gradient Approximation for Nonlinear Blind Signal Processing

When dealing with nonlinear blind processing algorithms (deconvolution or post-nonlinear source separation), complex mathematical estimations must be done giving as a result very slow algorithms. This is the case, for example, in speech processing, spike signals deconvolution or microarray data analysis. In this paper, we propose a simple method to reduce computational time for the inversion of Wiener systems or the separation of post-nonlinear mixtures, by using a linear approximation in a minimum mutual information algorithm. Simulation results demonstrate that linear spline interpolation is fast and accurate, obtaining very good results (similar to those obtained without approximation) while computational time is dramatically decreased. On the other hand, cubic spline interpolation also obtains similar good results, but due to its intrinsic complexity, the global algorithm is much more slow and hence not useful for our purpose.

Application of Multi-SNP Approaches Bayesian LASSO and AUC-RF to Detect Main Effects of Inflammatory-Gene Variants Associated with Bladder Cancer Risk

The relationship between inflammation and cancer is well established in several tumor types, including bladder cancer. We performed an association study between 886 inflammatory-gene variants and bladder cancer risk in 1,047 cases and 988 controls from the Spanish Bladder Cancer (SBC)/EPICURO Study. A preliminary exploration with the widely used univariate logistic regression approach did not identify any significant SNP after correcting for multiple testing. We further applied two more comprehensive methods to capture the complexity of bladder cancer genetic susceptibility: Bayesian Threshold LASSO (BTL), a regularized regression method, and AUC-Random Forest, a machine-learning algorithm. Both approaches explore the joint effect of markers. BTL analysis identified a signature of 37 SNPs in 34 genes showing an association with bladder cancer. AUC-RF detected an optimal predictive subset of 56 SNPs. 13 SNPs were identified by both methods in the total population. Using resources from the Texas Bladder Cancer study we were able to replicate 30% of the SNPs assessed. The associations between inflammatory SNPs and bladder cancer were reexamined among non-smokers to eliminate the effect of tobacco, one of the strongest and most prevalent environmental risk factor for this tumor. A 9 SNP-signature was detected by BTL. Here we report, for the first time, a set of SNP in inflammatory genes jointly associated with bladder cancer risk. These results highlight the importance of the complex structure of genetic susceptibility associated with cancer risk.

Browsing a component library using Non-functional Information

This paper highlights the role of non-functional information when reusing from a component library. We describe a method for selecting appropriate implementations of Ada packages taking non-functional constraints into account; these constraints model the context of reuse. Constraints take the form of queries using an interface description language called NoFun, which is also used to state non-functional information in Ada packages; query results are trees of implementations, following the import relationships between components. We define two different situations when reusing components, depending whether we take the library being searched as closed or extendible. The resulting tree of implementations can be manipulated by the user to solve ambiguities, to state default behaviours, and by the like. As part of the proposal, we face the problem of computing from code the non-functional information that determines the selection process.

A(-infinity)-interpolation in the ball

We give a necessary and sufficient condition for a sequence [ak}k in the unit ball of C° to be interpolating for the class A~°° of holomorphic functions with polynomial growth. The condition, which goes along the lines of the ones given by Berenstein and Li for some weighted spaces of entire functions and by Amar for H°° functions in the ball, is given in terms of the derivatives of m > n functions F Fm e A~°° vanishing on {ak)k.

Integrative analysis of the Regulatory Region of the FGFR3 Oncogene

The study of transcriptional regulation often needs the integration of diverse yet independent data. In the present work, sequence conservation, predic-tion of transcription factor binding sites (TFBS) and gene expression analysis have been applied to the detection of putative transcription factor (TF) modules in the regulatory region of the FGFR3 oncogene. Several TFs with conserved binding sites in the FGFR3 regulatory region have shown high positive or negative corre-lation with FGFR3 expression both in urothelial carcinoma and in benign nevi. By means of conserved TF cluster analysis, two different TF modules have been iden-tified in the promoter and first intron of FGFR3 gene. These modules contain acti-vating AP2, E2F, E47 and SP1 binding sites plus motifs for EGR with possible repressor function.

A Robust Multiple Feature Approach To Endpoint Detection In Car Environment Based On Advanced Classifiers

In this paper we propose an endpoint detection system based on the use of several features extracted from each speech frame, followed by a robust classifier (i.e Adaboost and Bagging of decision trees, and a multilayer perceptron) and a finite state automata (FSA). We present results for four different classifiers. The FSA module consisted of a 4-state decision logic that filtered false alarms and false positives. We compare the use of four different classifiers in this task. The look ahead of the method that we propose was of 7 frames, which are the number of frames that maximized the accuracy of the system. The system was tested with real signals recorded inside a car, with signal to noise ratio that ranged from 6 dB to 30dB. Finally we present experimental results demonstrating that the system yields robust endpoint detection.

A Canonical Genetic Algorithm for Blind Inversion of Linear Channels

It is well known the relationship between source separation and blind deconvolution: If a filtered version of an unknown i.i.d. signal is observed, temporal independence between samples can be used to retrieve the original signal, in the same manner as spatial independence is used for source separation. In this paper we propose the use of a Genetic Algorithm (GA) to blindly invert linear channels. The use of GA is justified in the case of small number of samples, where other gradient-like methods fails because of poor estimation of statistics.