A spectral clustering algorithm for manufacturing cell formation

A graph clustering algorithm constructs groups of closely related parts and machines separately. After they are matched for the least intercell moves, a refining process runs on the initial cell formation to decrease the number of intercell moves. A simple modification of this main approach can deal with some practical constraints, such as the popular constraint of bounding the maximum number of machines in a cell. Our approach makes a big improvement in the computational time. More importantly, improvement is seen in the number of intercell moves when the computational results were compared with best known solutions from the literature. (C) 2009 Elsevier Ltd. All rights reserved.

Three-dimensional electrical impedance, tomography: A topology optimization approach

Electrical impedance tomography is a technique to estimate the impedance distribution within a domain, based on measurements on its boundary. In other words, given the mathematical model of the domain, its geometry and boundary conditions, a nonlinear inverse problem of estimating the electric impedance distribution can be solved. Several impedance estimation algorithms have been proposed to solve this problem. In this paper, we present a three-dimensional algorithm, based on the topology optimization method, as an alternative. A sequence of linear programming problems, allowing for constraints, is solved utilizing this method. In each iteration, the finite element method provides the electric potential field within the model of the domain. An electrode model is also proposed (thus, increasing the accuracy of the finite element results). The algorithm is tested using numerically simulated data and also experimental data, and absolute resistivity values are obtained. These results, corresponding to phantoms with two different conductive materials, exhibit relatively well-defined boundaries between them, and show that this is a practical and potentially useful technique to be applied to monitor lung aeration, including the possibility of imaging a pneumothorax.

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.

Solution structure of the sodium channel antagonist conotoxin GS: A new molecular caliper for probing sodium channel geometry

Background: The venoms of Conus snails contain small, disulfide-rich inhibitors of voltage-dependent sodium channels. Conotoxin GS is a 34-residue polypeptide isolated from Conus geographus that interacts with the extracellular entrance of skeletal muscle sodium channels to prevent sodium ion conduction. Although conotoxin GS binds competitively with mu conotoxin GIIIA to the sodium channel surface, the two toxin types have little sequence identity with one another, and conotoxin GS has a four-loop structural framework rather than the characteristic three-loop mu-conotoxin framework. The structural study of conotoxin GS will form the basis for establishing a structure-activity relationship and understanding its interaction with the pore region of sodium channels. Results: The three-dimensional structure of conotoxin GS was determined using two-dimensional NMR spectroscopy. The protein exhibits a compact fold incorporating a beta hairpin and several turns. An unusual feature of conotoxin GS is the exceptionally high proportion (100%) of cis-imide bond geometry for the three proline or hydroxyproline residues. The structure of conotoxin GS bears little resemblance to the three-loop mu conotoxins, consistent with the low sequence identity between the two toxin types and their different structural framework. However, the tertiary structure and cystine-knot motif formed by the three disulfide bonds is similar to that present in several other polypeptide ion channel inhibitors. Conclusions: This is the first three-dimensional structure of a 'four-loop' sodium channel inhibitor, and it represents a valuable new structural probe for the pore region of voltage-dependent sodium channels. The distribution of amino acid sidechains in the structure creates several polar and charged patches, and comparison with the mu conotoxins provides a basis for determining the binding surface of the conotoxin GS polypeptide.

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.

Implications of prevalent and incident diabetes mellitus on left ventricular geometry and function in the ageing heart: The MONICA/KORA Augsburg cohort study

Background and Aim: It is unclear to what extent diabetes modulates the ageing-related adaptations of cardiac geometry and function. Methods and Results: We examined 1005 adults, aged 25-74 years, from a population-based survey at baseline in 1994/5 and at follow-up in 2004/5. We compared persistently non-diabetic individuals (ND; no diabetes at baseline and at follow-up, n = 833) with incident (ID; non-diabetic at baseline and diabetic at follow-up, n = 36) and with prevalent diabetics (PD; diabetes at baseline and follow-up examination, n = 21). Left ventricular (LV) geometry and function were evaluated by echocardiography. Statistical analyses were performed with multivariate linear regression models. Over ten years the PD group displayed a significantly stronger relative increase of LV mass (+9.34% vs. +23.7%) that was mediated by a more pronounced increase of LV end-diastolic diameter (+0% vs. +6.95%) compared to the ND group. In parallel, LA diameter increased (+4.50% vs. +12.7%), whereas ejection fraction decreased (+3.02% vs. -4.92%) more significantly in the PD group. Moreover, at the follow-up examination the PD and ID groups showed a significantly worse diastolic function, indicated by a higher E/EM ratio compared with the ND group (11.6 and 11.8 vs. 9.79, respectively). Conclusions: Long-standing diabetes was associated with an acceleration of age-related changes of left ventricular geometry accumulating in an eccentric remodelling of the left ventricle. Likewise, echocardiographic measures of systolic and diastolic ventricular function deteriorated more rapidly in individuals with diabetes. (C) 2009 Elsevier B.V. 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.

Theory of a mode-locked atom laser with toroidal geometry

We consider a possible technique for mode locking an atom laser, based on the generation of a dark soliton in a ring-shaped Bose-Einstein condensate, with repulsive atomic interactions. The soliton is a kink, with angular momentum per particle equal to (h) over bar /2. It emerges naturally when the condensate is stirred at the soliton velocity and cleansed with a periodic out coupler. The result is a replicating coherent field inside the atom laser, stabilized by topology. We give a numerical demonstration of the generation and stabilization of the soliton.

Exploring through cover - the integrated interpretation of high resolution aeromagnetic, airborne electromagnetic and ground gravity data from the Grant's Patch area, Eastern Goldfields Province, Archaean Yigarn Craton Part B; Gravity inversion as a

The cost and risk associated with mineral exploration in Australia increases significantly as companies move into deeper regolith-covered terrain. The ability to map the bedrock and the depth of weathering within an area has the potential to decrease this risk and increase the effectiveness of exploration programs. This paper is the second in a trilogy concerning the Grant's Patch area of the Eastern Goldfields. The recent development of the VPmg potential field inversion program in conjunction with the acquisition of high-resolution gravity data over an area with extensive drilling provided an opportunity to evaluate three-dimensional gravity inversion as a bedrock and regolith mapping tool. An apparent density model of the study area was constructed, with the ground represented as adjoining 200 m by 200 m vertical rectangular prisms. During inversion VPmg incrementally adjusted the density of each prism until the free-air gravity response of the model replicated the observed data. For the Grant's Patch study area, this image of the apparent density values proved easier to interpret than the Bouguer gravity image. A regolith layer was introduced into the model and realistic fresh-rock densities assigned to each basement prism according to its interpreted lithology. With the basement and regolith densities fixed, the VPmg inversion algorithm adjusted the depth to fresh basement until the misfit between the calculated and observed gravity response was minimised. The resulting geometry of the bedrock/regolith contact largely replicated the base of weathering indicated by drilling with predicted depth of weathering values from gravity inversion typically within 15% of those logged during RAB and RC drilling.