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.

Granulocyte-Colony Stimulating Factor (G-CSF) induces mechanical hyperalgesia via spinal activation of MAP kinases and PI(3)K in mice

Granulocyte-colony stimulating factor (G-CSF) is a current pharmacological approach to increase peripheral neutrophil counts after anti-tumor therapies. Pain is most relevant side effect of G-CSF in healthy volunteers and cancer patients. Therefore, the mechanisms of G-CSF-induced hyperalgesia were investigated focusing on the role of spinal mitogen-activated protein (MAP) kinases ERK (extracellular signal-regulated kinase). JNK (Jun N-terminal Kinase) and p38, and PI(3)K (phosphatidylinositol 3-kinase). G-CSF induced dose (30-300 ng/paw)-dependent mechanical hyperalgesia, which was inhibited by local post-treatment with morphine. This effect of morphine was reversed by naloxone (opioid receptor antagonist). Furthermore, G-CSF-induced hyperalgesia was inhibited in a dose-dependent manner by intrathecal pre-treatment with ERK (PD98059), JNK (SB600125), p38 (SB202190) or PI(3)K (wortmanin) inhibitors. The co-treatment with MAP kinase and PI(3)K inhibitors, at doses that were ineffective as single treatment, significantly inhibited G-CSF-induced hyperalgesia. Concluding, in addition to systemic opioids, peripheral opioids as well as spinal treatment with MAP kinases and PI(3)K inhibitors also reduce G-CSF-induced pain. (C) 2011 Elsevier Inc. All rights reserved.

Generation of eigenstates using the phase-estimation algorithm

The phase estimation algorithm is so named because it allows an estimation of the eigenvalues associated with an operator. However, it has been proposed that the algorithm can also be used to generate eigenstates. Here we extend this proposal for small quantum systems, identifying the conditions under which the phase-estimation algorithm can successfully generate eigenstates. We then propose an implementation scheme based on an ion trap quantum computer. This scheme allows us to illustrate two simple examples, one in which the algorithm effectively generates eigenstates, and one in which it does not.

Granulocyte-colony-stimulating factor (G-CSF)-primed allogeneic bone marrow: significantly less graft-versus-host disease and comparable engraftment to G-CSF-mobilized peripheral blood stem cells

Prospective studies have shown rapid engraftment using granulocyte-colony-stimulating factor-mobilized peripheral blood stem cells (G-PBSCs) for allogeneic transplantation, though the risks for graft-versus-host disease (GVHD) may be increased. It was hypothesized that the use of G-CSF to prime bone marrow (GBM) would allow rapid engraftment without increased risk for GVHD compared with G-PBSC. Patients were randomized to receive G-BM or G-PBSCs for allogeneic stem cell transplantation. The study was designed (beta < .8) to detect a difference in the incidence of chronic GVHD of 33% ( < .05). The plan was to recruit 100 patients and to conduct an interim analysis when the 6-month follow-up point was reached for the first 50 patients. Fifty-seven consecutive patients were recruited (G-BM, n = 28; G-PBSC, n = 29). Patients in the G-PBSC group received 3-fold more CD34(+) and 9-fold more CD3(+) cells. Median times to neutrophil (G-BM, 16 days; G-PBSC, 14 days; P < .1) and platelet engraftment (G-BM, 14 days; G-PBSC, 12 days; P < .1) were similar. The use of G-PBSC was associated with steroid refractory acute GVHD (G-BM, 0%; G-PBSC, 32%; P < .001), chronic GVHD (G-BM, 22%; G-PBSC, 80%; P < .02), and prolonged requirement for immunosuppressive therapy (G-BM, 173 days; G-PBSC, 680 days; P < .009). Survival was similar for the 2 groups. Compared with G-PBSC the use of G-BM resulted in comparable engraftment, reduced severity of acute GVHD, and less subsequent chronic GVHD. (Blood. 2001;98:3186-3191) (C) 2001 by The American Society of Hematology.

An algorithm to predict 3 ' intron splice sites in Plasmodium falciparum genomic sequences

A new algorithm, PfAGSS, for predicting 3' splice sites in Plasmodium falciparum genomic sequences is described. Application of this program to the published P. falciparum chromosome 2 and 3 data suggests that existing programs result in a high error rate in assigning 3' intron boundaries. (C) 2001 Elsevier Science B.V. All rights reserved.

A simulated annealing algorithm for finding consensus sequences

Motivation: A consensus sequence for a family of related sequences is, as the name suggests, a sequence that captures the features common to most members of the family. Consensus sequences are important in various DNA sequencing applications and are a convenient way to characterize a family of molecules. Results: This paper describes a new algorithm for finding a consensus sequence, using the popular optimization method known as simulated annealing. Unlike the conventional approach of finding a consensus sequence by first forming a multiple sequence alignment, this algorithm searches for a sequence that minimises the sum of pairwise distances to each of the input sequences. The resulting consensus sequence can then be used to induce a multiple sequence alignment. The time required by the algorithm scales linearly with the number of input sequences and quadratically with the length of the consensus sequence. We present results demonstrating the high quality of the consensus sequences and alignments produced by the new algorithm. For comparison, we also present similar results obtained using ClustalW. The new algorithm outperforms ClustalW in many cases.

A monolithic smoothing-gap algorithm for contact-impact based on the signed distance function

A new algorithm has been developed for smoothing the surfaces in finite element formulations of contact-impact. A key feature of this method is that the smoothing is done implicitly by constructing smooth signed distance functions for the bodies. These functions are then employed for the computation of the gap and other variables needed for implementation of contact-impact. The smoothed signed distance functions are constructed by a moving least-squares approximation with a polynomial basis. Results show that when nodes are placed on a surface, the surface can be reproduced with an error of about one per cent or less with either a quadratic or a linear basis. With a quadratic basis, the method exactly reproduces a circle or a sphere even for coarse meshes. Results are presented for contact problems involving the contact of circular bodies. Copyright (C) 2002 John Wiley Sons, Ltd.