HPOTP low-speed flexible rotor balancing, phase 1

A method was developed that shows promise in overcoming many balancing limitations. This method establishes one or more windows for low speed, out-of-housing balancing of flexible rotors. These windows are regions of speed and support flexibility where two conditions are simultaneously fulfilled. First, the rotor system behaves flexibly; therefore, there is separation among balance planes. Second, the response due to balance weights is large enough to reliably measure. The analytic formulation of the low-speed flexible rotor balancing method is described. The results of proof-of-principle tests conducted under the program are presented. Based on this effort, it is concluded that low speed flexible rotor balancing is a viable technology. In particular, the method can be used to balance a rotor bearing system at low speed which results in smooth operation above more than one bending critical speed. Furthermore, this balancing methodology is applicable to SSME turbopump rotors

A Benchmark for Image Retrieval using Distributed Systems over the Internet: BIRDS-I

The performance of CBIR algorithms is usually measured on an isolated workstation. In a real-world environment the algorithms would only constitute a minor component among the many interacting components. The Internet dramati-cally changes many of the usual assumptions about measuring CBIR performance. Any CBIR benchmark should be designed from a networked systems standpoint. These benchmarks typically introduce communication overhead because the real systems they model are distributed applications. We present our implementation of a client/server benchmark called BIRDS-I to measure image retrieval performance over the Internet. It has been designed with the trend toward the use of small personalized wireless systems in mind. Web-based CBIR implies the use of heteroge-neous image sets, imposing certain constraints on how the images are organized and the type of performance metrics applicable. BIRDS-I only requires controlled human intervention for the compilation of the image collection and none for the generation of ground truth in the measurement of retrieval accuracy. Benchmark image collections need to be evolved incrementally toward the storage of millions of images and that scaleup can only be achieved through the use of computer-aided compilation. Finally, our scoring metric introduces a tightly optimized image-ranking window.Comment: 24 pages, To appear in the Proc. SPIE Internet Imaging Conference 200

Energy-stable linear schemes for polymer-solvent phase field models

We present new linear energy-stable numerical schemes for numerical simulation of complex polymer-solvent mixtures. The mathematical model proposed by Zhou, Zhang and E (Physical Review E 73, 2006) consists of the Cahn-Hilliard equation which describes dynamics of the interface that separates polymer and solvent and the Oldroyd-B equations for the hydrodynamics of polymeric mixtures. The model is thermodynamically consistent and dissipates free energy. Our main goal in this paper is to derive numerical schemes for the polymer-solvent mixture model that are energy dissipative and efficient in time. To this end we will propose several problem-suited time discretizations yielding linear schemes and discuss their properties

Isospin emission and flows at high baryon density: a test of the symmetry potential

High energy Heavy Ion Collisions (HIC) are studied in order to access nuclear matter properties at high density. Particular attention is paid to the selection of observables sensitive to the poorly known symmetry energy at high baryon density, of large fundamental interest, even for the astrophysics implications. Using fully consistent transport simulations built on effective theories we test isospin observables ranging from nucleon/cluster emissions to collective flows (in particular the elliptic, squeeze out, part). The effects of the competition between stiffness and momentum dependence of the Symmetry Potential on the reaction dynamics are thoroughly analyzed. In this way we try to shed light on the controversial neutron/proton effective mass splitting at high baryon and isospin densities. New, more exclusive, experiments are suggested.Comment: 10 pages, 16 figures, new figure added, accepted for publication in Phys.Rev.

Thermodynamics of the classical spin-ice model with nearest neighbour interactions using the Wang-Landau algorithm

In this article we study the classical nearest-neighbour spin-ice model (nnSI) by means of Monte Carlo simulations, using the Wang-Landau algorithm. The nnSI describes several of the salient features of the spin-ice materials. Despite its simplicity it exhibits a remarkably rich behaviour. The model has been studied using a variety of techniques, thus it serves as an ideal benchmark to test the capabilities of the Wang Landau algorithm in magnetically frustrated systems. We study in detail the residual entropy of the nnSI and, by introducing an applied magnetic field in two different crystallographic directions ([111] and [100],) we explore the physics of the kagome-ice phase, the transition to full polarisation, and the three dimensional Kasteleyn transition. In the latter case, we discuss how additional constraints can be added to the Hamiltonian, by taking into account a selective choice of states in the partition function and, then, show how this choice leads to the realization of the ideal Kasteleyn transition in the system.Comment: 9 pages, 9 figure

Development and application of a unified balancing approach with multiple constraints

The development of a general analytic approach to constrained balancing that is consistent with past influence coefficient methods is described. The approach uses Lagrange multipliers to impose orbit and/or weight constraints; these constraints are combined with the least squares minimization process to provide a set of coupled equations that result in a single solution form for determining correction weights. Proper selection of constraints results in the capability to: (1) balance higher speeds without disturbing previously balanced modes, thru the use of modal trial weight sets; (2) balance off-critical speeds; and (3) balance decoupled modes by use of a single balance plane. If no constraints are imposed, this solution form reduces to the general weighted least squares influence coefficient method. A test facility used to examine the use of the general constrained balancing procedure and application of modal trial weight ratios is also described

Book Review

Vital Nourishment: Departing from HappinessFrançois JullienTranslated by Arthur GoldhammerNew York: Zone Books, 2007Reviewed by J. T. Giordan

What Can Your Computer Recognize: Chemical and Facial Pattern Recognition Through the Use of the Eigen Analysis Method

Seeing patterns in the world is part of the human condition. If the numbers 2, 4, 6, 8,... are put before someone they will readily recognize the pattern of counting by two and be able to continue the sequence with the number 10, 12, . . . . Similarly, someone who is moderately acquainted with mathematics would recognize the numbers 0, 1, 1, 2, 3, 5, 8,... as the Fibonacci sequence. Yet, patterns are not simply limited to what can be observed within mathematical relationships. Yet, while humans can identify the pattern found within the frieze, a computer could not perform the same recognition with the ease or sophistication inherent to the human mind. Even the seemingly simple act of reading and comprehending the sentences on a page is an example of pattern recognition that can be performed with a sense of effortlessness by a human, but with only moderate success by a computer