Nonlinear relaxation time and the detection of weak signals

Laser systems can be used to detect very weak optical signals. The physical mechanism is the dynamical process of the relaxation of a laser from an unstable state to a steady stable state. We present an analysis of this process based on the study of the nonlinear relaxation time. Our analytical results are compared with numerical integration of the stochastic differential equations that model this process.

Comparative performance of supertree algorithms in large data sets using the soapberry family (Sapindaceae) as a case study.

For the last 2 decades, supertree reconstruction has been an active field of research and has seen the development of a large number of major algorithms. Because of the growing popularity of the supertree methods, it has become necessary to evaluate the performance of these algorithms to determine which are the best options (especially with regard to the supermatrix approach that is widely used). In this study, seven of the most commonly used supertree methods are investigated by using a large empirical data set (in terms of number of taxa and molecular markers) from the worldwide flowering plant family Sapindaceae. Supertree methods were evaluated using several criteria: similarity of the supertrees with the input trees, similarity between the supertrees and the total evidence tree, level of resolution of the supertree and computational time required by the algorithm. Additional analyses were also conducted on a reduced data set to test if the performance levels were affected by the heuristic searches rather than the algorithms themselves. Based on our results, two main groups of supertree methods were identified: on one hand, the matrix representation with parsimony (MRP), MinFlip, and MinCut methods performed well according to our criteria, whereas the average consensus, split fit, and most similar supertree methods showed a poorer performance or at least did not behave the same way as the total evidence tree. Results for the super distance matrix, that is, the most recent approach tested here, were promising with at least one derived method performing as well as MRP, MinFlip, and MinCut. The output of each method was only slightly improved when applied to the reduced data set, suggesting a correct behavior of the heuristic searches and a relatively low sensitivity of the algorithms to data set sizes and missing data. Results also showed that the MRP analyses could reach a high level of quality even when using a simple heuristic search strategy, with the exception of MRP with Purvis coding scheme and reversible parsimony. The future of supertrees lies in the implementation of a standardized heuristic search for all methods and the increase in computing power to handle large data sets. The latter would prove to be particularly useful for promising approaches such as the maximum quartet fit method that yet requires substantial computing power.

Stable alpha-synuclein oligomers strongly inhibit chaperone activity of the Hsp70 system by weak interactions with J-domain co-chaperones.

α-Synuclein aggregation and accumulation in Lewy bodies are implicated in progressive loss of dopaminergic neurons in Parkinson disease and related disorders. In neurons, the Hsp70s and their Hsp40-like J-domain co-chaperones are the only known components of chaperone network that can use ATP to convert cytotoxic protein aggregates into harmless natively refolded polypeptides. Here we developed a protocol for preparing a homogeneous population of highly stable β-sheet enriched toroid-shaped α-Syn oligomers with a diameter typical of toxic pore-forming oligomers. These oligomers were partially resistant to in vitro unfolding by the bacterial Hsp70 chaperone system (DnaK, DnaJ, GrpE). Moreover, both bacterial and human Hsp70/Hsp40 unfolding/refolding activities of model chaperone substrates were strongly inhibited by the oligomers but, remarkably, not by unstructured α-Syn monomers even in large excess. The oligomers acted as a specific competitive inhibitor of the J-domain co-chaperones, indicating that J-domain co-chaperones may preferably bind to exposed bulky misfolded structures in misfolded proteins and, thus, complement Hsp70s that bind to extended segments. Together, our findings suggest that inhibition of the Hsp70/Hsp40 chaperone system by α-Syn oligomers may contribute to the disruption of protein homeostasis in dopaminergic neurons, leading to apoptosis and tissue loss in Parkinson disease and related neurodegenerative diseases.

Stochastic models and numerical algorithms for a class of regulatory gene networks.

Regulatory gene networks contain generic modules, like those involving feedback loops, which are essential for the regulation of many biological functions (Guido et al. in Nature 439:856-860, 2006). We consider a class of self-regulated genes which are the building blocks of many regulatory gene networks, and study the steady-state distribution of the associated Gillespie algorithm by providing efficient numerical algorithms. We also study a regulatory gene network of interest in gene therapy, using mean-field models with time delays. Convergence of the related time-nonhomogeneous Markov chain is established for a class of linear catalytic networks with feedback loops.

Reinforced Earth and Stone Columns for Weak Subsoil Conditions, HR-510, 1980

Reinforced Earth is a French development that has been used in the United States for approximately ten years. Virbro-Replacement, more commonly referred to as stone columns, is an outgrowth of deep densification of cohesionless soils originally developed in Germany. Reinforced Earth has applicability when wall height is greater than about twelve feet and deep seated foundation failure is not a concern. Stone columns are applicable when soft, cohesive subsoil conditions are encountered and bearing capacity and shearing resistance must be increased. The conditions in Sioux City on Wesley Way can be summarized as: (1) restricted right of way, (2) fill height in excess of 25 feet creating unstable conditions, (3) adjacent structures that could not be removed. After analyzing alternatives, it was decided that Reinforced Earth walls constructed on top of stone columns were the most practical approach.

mGPT: a probabilistic planner based on heuristic search

We describe the version of the GPT planner to be used in the planning competition. This version, called mGPT, solves mdps specified in the ppddllanguage by extracting and using different classes of lower bounds, along with various heuristic-search algorithms. The lower bounds are extracted from deterministic relaxations of the mdp where alternativeprobabilistic effects of an action are mapped into different, independent, deterministic actions. The heuristic-search algorithms, on the other hand, use these lower bounds for focusing the updates and delivering a consistent value function over all states reachable from the initial state with the greedy policy.

Fast Approximation of Nonlinearities for improving inversion algorithms of PNL mixtures and Wiener systems

This paper proposes a very fast method for blindly approximating a nonlinear mapping which transforms a sum of random variables. The estimation is surprisingly good even when the basic assumption is not satisfied.We use the method for providing a good initialization for inverting post-nonlinear mixtures and Wiener systems. Experiments show that the algorithm speed is strongly improved and the asymptotic performance is preserved with a very low extra computational cost.