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.

Modelling of species in hood fires by conditional moment closure

Carbon monoxide, the chief killer in fires, and other species are modelled for a series of enclosure fires. The conditions emulate building fires where CO is formed in the rich, turbulent, nonpremixed flame and is transported frozen to lean mixtures by the ceiling jet which is cooled by radiation and dilution. Conditional moment closure modelling is used and computational domain minimisation criteria are developed which reduce the computational cost of this method. The predictions give good agreement for CO and other species in the lean, quenched-gas stream, holding promise that this method may provide a practical means of modelling real, three-dimensional fire situations. (c) 2005 The Combustion Institute. Published by Elsevier Inc. All rights reserved.

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.

Conditional variance reduction by measurements on correlated field modes

We consider the case of two cavity modes of the electromagnetic field, which are coupled via the action of a parametric amplifier. The fields are allowed to leak from the cavity and homodyne measurement is performed on one of the modes. Because of the correlations between the modes, this leads to a reduction of the variance in a quadrature of the other mode, although no measurement is performed on it directly. We discuss how this relates to the Einstein-Podolky-Rosen Gedankenexperiment.

Limiting conditional distributions for birth-death processes

In a recent paper [16], one of us identified all of the quasi-stationary distributions for a non-explosive, evanescent birth-death process for which absorption is certain, and established conditions for the existence of the corresponding limiting conditional distributions. Our purpose is to extend these results in a number of directions. We shall consider separately two cases depending on whether or not the process is evanescent. In the former case we shall relax the condition that absorption is certain. Furthermore, we shall allow for the possibility that the minimal process might be explosive, so that the transition rates alone will not necessarily determine the birth-death process uniquely. Although we shall be concerned mainly with the minimal process, our most general results hold for any birth-death process whose transition probabilities satisfy both the backward and the forward Kolmogorov differential equations.

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.

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.

Serial conditional discrimination and temporal bisection in rats selectively lesioned in the dentate gyrus

In positive serial conditional discrimination, animals respond during a target stimulus when it is preceded by a feature stimulus, but they do not respond when the same target stimulus is presented alone. Moreover, the feature and target stimuli are separated from each other by an empty interval. The present work aimed to investigate if two durations (4 or 16s) of the same feature stimulus (light) could modulate the operant responses of rats to different levers (A and B) during a 5-s target stimulus (tone). In the present study, lever A was associated with the 4-s light, and lever B was associated with the 16-s light. A 5-s empty interval was included between the light and the tone. In the same training procedure, the rats were also presented with the 5-s tone without the preceding light stimuli. In these trials, the responses were not reinforced. We evaluated the hippocampal involvement of these behavioral processes by selectively lesioning the dentate gyrus with colchicine. Once trained, the rats were submitted to a test using probe trials without reinforcement. They were presented with intermediate durations of the feature stimulus (light) to obtain a temporal bisection curve recorded during the exposure to the target stimuli. The rats from both groups learned to respond with high rates during tones preceded by light and with low rates during tones presented alone, which indicated acquisition of the serial conditional discrimination. The rats were able to discriminate between the 4- and 16-s lights by correctly choosing lever A or B. In the test, the temporal bisection curves from both experimental groups showed a bisection point at the arithmetic mean between 4 and 16s. Such processes were not impaired by the dentate gyrus lesion. Thus, our results showed that different durations of a feature stimulus could result in conditional properties. However, this processing did not appear to depend on the dentate gyrus alone. (C) 2011 Published by Elsevier B.V.

On the relation between the conditional moment closure and unsteady flamelets

We consider the relation between the conditional moment closure (CMC) and the unsteady flamelet model (FM). The CMC equations were originally constructed as global equations, while FM was derived asymptotically for a thin reaction zone. The recent tendency is to use FM-type equations as global equations. We investigate the possible consequences and suggest a new version of FM: coordinate-invariant FM (CIFM). Unlike FM, CIFM complies with conditional properties of the exact transport equations which are used effectively in CMC. We analyse the assumptions needed to obtain another global version of FM: representative interactive flamelets (RIF), from original FM and demonstrate that, in homogeneous turbulence, one of these assumptions is equivalent to the main CMC hypothesis.

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.