The Western Alps from the Jurassic to Oligocene: spatio-temporal constraints and evolutionary reconstructions

Despite extensive research in the last 150 years, the regional tectonic reconstruction of the Western Alps has remained controversial. The curved orogenic belt consists of several ribbon-like continental terranes (Sesia/Austroalpine, Internal Crystalline Massifs, Brianconnais), which are separated by two or more ophiolitic sutures (Piemonte, Valais, Antrona?, Lanzo/ Canavese?). High-pressure (HP) metamorphism of each terrane occurred during distinct orogenic episodes: at similar to65 Ma in the Sesia/Austroalpine, at similar to45 Ma in the Piemonte zone and at similar to35 Ma in the Internal Crystalline Massifs. It is suggested that these events reflect individual accretionary episodes, which together with kinematic indicators and the speed and direction of plate motions, provide constraints for the discussed reconstruction model. The model involves a prolonged orogenic history that took place during relative convergence of Europe and Adria (here considered as a promontory of the African plate). The first accretionary event involved the Sesia/Austroalpine terrane. Final closure of the Piemonte Ocean occurred during the Eocene (similar to45 Ma) and involved ultra-high-pressure (UHP) metamorphism of the Piemonte oceanic crust. Incorporation of the Brianconnais terrane in the accretionary wedge occurred thereafter, possibly during or after subduction of the Valais Ocean in the late Eocene (45-35 Ma). This subduction was terminated at ca. 35 Ma, when the Internal Crystalline Massifs (i.e. the assumed internal parts of the Brianconnais terrane) were buried into great depths and underwent HP and UHP metamorphism. (C) 2004 Elsevier B.V. All rights reserved.

Evolutionary History of Arabidopsis thaliana Aminoacyl-tRNA Synthetase Dual-Targeted Proteins

Aminoacyl-transfer RNA (tRNA) synthetases (aaRS) are key players in translation and act early in protein synthesis by mediating the attachment of amino acids to their cognate tRNA molecules. In plants, protein synthesis may occur in three subcellular compartments (cytosol, mitochondria, and chloroplasts), which requires multiple versions of the protein to be correctly delivered to its proper destination. The organellar aaRS are nuclear encoded and equipped with targeting information at the N-terminal sequence, which enables them to be specifically translocated to their final location. Most of the aaRS families present organellar proteins that are dual targeted to mitochondria and chloroplasts. Here, we examine the dual targeting behavior of aaRS from an evolutionary perspective. Our results show that Arabidopsis thaliana aaRS sequences are a result of a horizontal gene transfer event from bacteria. However, there is no evident bias indicating one single ancestor (Cyanobacteria or Proteobacteria). The dual-targeted aaRS phylogenetic relationship was characterized into two different categories (paralogs and homologs) depending on the state recovered for both dual-targeted and cytosolic proteins. Taken together, our results suggest that the dual-targeted condition is a gain-of-function derived from gene duplication. Selection may have maintained the original function in at least one of the copies as the additional copies diverged.

Use of the q-Gaussian mutation in evolutionary algorithms

This paper proposes the use of the q-Gaussian mutation with self-adaptation of the shape of the mutation distribution in evolutionary algorithms. The shape of the q-Gaussian mutation distribution is controlled by a real parameter q. In the proposed method, the real parameter q of the q-Gaussian mutation is encoded in the chromosome of individuals and hence is allowed to evolve during the evolutionary process. In order to test the new mutation operator, evolution strategy and evolutionary programming algorithms with self-adapted q-Gaussian mutation generated from anisotropic and isotropic distributions are presented. The theoretical analysis of the q-Gaussian mutation is also provided. In the experimental study, the q-Gaussian mutation is compared to Gaussian and Cauchy mutations in the optimization of a set of test functions. Experimental results show the efficiency of the proposed method of self-adapting the mutation distribution in evolutionary algorithms.

A new algorithm and refined bounds for extended gcd computation

Extended gcd computation is interesting itself. It also plays a fundamental role in other calculations. We present a new algorithm for solving the extended gcd problem. This algorithm has a particularly simple description and is practical. It also provides refined bounds on the size of the multipliers obtained.

The Qu-Prolog unification algorithm: Formalisation and correctness

Qu-Prolog is an extension of Prolog which performs meta-level computations over object languages, such as predicate calculi and lambda-calculi, which have object-level variables, and quantifier or binding symbols creating local scopes for those variables. As in Prolog, the instantiable (meta-level) variables of Qu-Prolog range over object-level terms, and in addition other Qu-Prolog syntax denotes the various components of the object-level syntax, including object-level variables. Further, the meta-level operation of substitution into object-level terms is directly represented by appropriate Qu-Prolog syntax. Again as in Prolog, the driving mechanism in Qu-Prolog computation is a form of unification, but this is substantially more complex than for Prolog because of Qu-Prolog's greater generality, and especially because substitution operations are evaluated during unification. In this paper, the Qu-Prolog unification algorithm is specified, formalised and proved correct. Further, the analysis of the algorithm is carried out in a frame-work which straightforwardly allows the 'completeness' of the algorithm to be proved: though fully explicit answers to unification problems are not always provided, no information is lost in the unification process.

Analysis and implementation of a new constant acceleration subcycling algorithm

An algorithm for explicit integration of structural dynamics problems with multiple time steps is proposed that averages accelerations to obtain subcycle states at a nodal interface between regions integrated with different time steps. With integer time step ratios, the resulting subcycle updates at the interface sum to give the same effect as a central difference update over a major cycle. The algorithm is shown to have good accuracy, and stability properties in linear elastic analysis similar to those of constant velocity subcycling algorithms. The implementation of a generalised form of the algorithm with non-integer time step ratios is presented. (C) 1997 by John Wiley & Sons, Ltd.

The subcycled Newmark algorithm

The popular Newmark algorithm, used for implicit direct integration of structural dynamics, is extended by means of a nodal partition to permit use of different timesteps in different regions of a structural model. The algorithm developed has as a special case an explicit-explicit subcycling algorithm previously reported by Belytschko, Yen and Mullen. That algorithm has been shown, in the absence of damping or other energy dissipation, to exhibit instability over narrow timestep ranges that become narrower as the number of degrees of freedom increases, making them unlikely to be encountered in practice. The present algorithm avoids such instabilities in the case of a one to two timestep ratio (two subcycles), achieving unconditional stability in an exponential sense for a linear problem. However, with three or more subcycles, the trapezoidal rule exhibits stability that becomes conditional, falling towards that of the central difference method as the number of subcycles increases. Instabilities over narrow timestep ranges, that become narrower as the model size increases, also appear with three or more subcycles. However by moving the partition between timesteps one row of elements into the region suitable for integration with the larger timestep these the unstable timestep ranges become extremely narrow, even in simple systems with a few degrees of freedom. As well, accuracy is improved. Use of a version of the Newmark algorithm that dissipates high frequencies minimises or eliminates these narrow bands of instability. Viscous damping is also shown to remove these instabilities, at the expense of having more effect on the low frequency response.

Simulated-annealing-based genetic algorithm for modeling the optical constants of solids

We propose a simulated-annealing-based genetic algorithm for solving model parameter estimation problems. The algorithm incorporates advantages of both genetic algorithms and simulated annealing. Tests on computer-generated synthetic data that closely resemble optical constants of a metal were performed to compare the efficiency of plain genetic algorithms against the simulated-annealing-based genetic algorithms. These tests assess the ability of the algorithms to and the global minimum and the accuracy of values obtained for model parameters. Finally, the algorithm with the best performance is used to fit the model dielectric function to data for platinum and aluminum. (C) 1997 Optical Society of America.

Assessment of immediate conservative breast surgery reconstruction: A classification system of defects revisited and an algorithm for selecting the appropriate technique

Background: Although various techniques have been used for breast conservation surgery reconstruction, there are few studies describing a logical approach to reconstruction of these defects. The objectives of this study were to establish a classification system for partial breast defects and to develop a reconstructive algorithm. Methods: The authors reviewed a 7-year experience with 209 immediate breast conservation surgery reconstructions. Mean follow-up was 31 months. Type I defects include tissue resection in smaller breasts (bra size A/B), including type IA, which involves minimal defects that do not cause distortion; type III, which involves moderate defects that cause moderate distortion; and type IC, which involves large defects that cause significant deformities. Type II includes tissue resection in medium-sized breasts with or without ptosis (bra size C), and type III includes tissue resection in large breasts with ptosis (bra size D). Results: Eighteen percent of patients presented type I, where a lateral thoracodorsal flap and a latissimus dorsi flap were performed in 68 percent. Forty-five percent presented type II defects, where bilateral mastopexy was performed in 52 percent. Thirty-seven percent of patients presented type III distortion, where bilateral reduction mammaplasty was performed in 67 percent. Thirty-five percent of patients presented complications, and most were minor. Conclusions: An algorithm based on breast size in relation to tumor location and extension of resection can be followed to determine the best approach to reconstruction. The authors` results have demonstrated that the complications were similar to those in other clinical series. Success depends on patient selection, coordinated planning with the oncologic surgeon, and careful intraoperative management.