A Stochastic Analysis of a Staffing Problem

Consider an organization with several categories of staff, each having a specified number of members. The age of entry into service and the age of retirement are both specified. Withdrawals occur at time-independent rates. Under this set-up, the authors have computed the maximum ages at which promotions should take place, assuming that the staff members continuing at various ages are random. Some illustrative calculations have been carried out.     

Simulated annealing with noisy or imprecise energy measurements

The annealing algorithm (Ref. 1) is modified to allow for noisy or imprecise measurements of the energy cost function. This is important when the energy cannot be measured exactly or when it is computationally expensive to do so. Under suitable conditions on the noise/imprecision, it is shown that the modified algorithm exhibits the same convergence in probability to the globally minimum energy states as the annealing algorithm (Ref. 2). Since the annealing algorithm will typically enter and exit the minimum energy states infinitely often with probability one, the minimum energy state visited by the annealing algorithm is usually tracked. The effect of using noisy or imprecise energy measurements on tracking the minimum energy state visited by the modified algorithms is examined.The research reported here has been supported under Contracts AFOSR-85-0227, DAAG-29-84-K-0005, and DAAL-03-86-K-0171 and a Purdue Research Initiation Grant.     

Sonogashira alkynylation of unprotected 8-brominated adenosines and guanosines: fluorescence properties of compact conjugated acetylenes containing a purine ring

A practical Sonogashira alkynylation protocol for the preparation of 8-alkynylated adenosines and guanosines has been developed. Protection of the sugar hydroxyl substituents is not required; protection hinders the purification of these products. A preliminary fluorescent study is reported, which shows that the presence of a substituent on the phenylene ring influences the fluorescent properties considerably, an outcome that could be utilized in biological applications.     

Molecular dynamics simulation of processing using AFM pin tool

A three-dimensional molecular dynamics (MD) model is utilized to investigate the effect of tool geometry on the deformation process of the workpiece and the nature of deformation process at the atomic-scale. Results show that different states exist between the atomic force microscope (AFM) pin tool and the workpiece surface, i.e. the non-wear state, the ploughing state, the state in which ploughing is dominant and the state in which cutting plays a key role. A relationship between the deformation process of the workpiece and the potential energy variation is presented. The potential energy variation of atoms in different deformed regions in the workpiece such as plastically deformed region, elastically deformed region and the mixed deformation region is different. The features of variations of potential energy are discussed.     

Three Electrons in a Two-Dimensional Parabolic Trap: The Relative Motion Solution

In agreement with the Kohn theorem the relative motion (rel) of three electrons in a two-dimensional parabolic trap separates from the centre-of-mass (CM) motion. By introducing new coordinates the Hamiltonian for relative motion in the approximation of non-interacting electrons can be taken to the normal form. The eigenstates of the normalized Hamiltonian are products of the Fock-Darwin states for normal modes. The energy levels for relative motion are obtained by diagonalizing the exact Hamiltonian in the eigenbasis for the non-interacting case. In this basis the interaction matrix elements can be obtained in the analytical form. Since the rank of the Hamiltonian matrix is significantly reduced, the calculations are faster and more accurate than those for the full (CM + rel) motion. This advantage is especially important for the calculations of excited states and the analysis of energy spectra.     

Products of mixed covering arrays of strength two

A covering array CA(N;t,k, v is an N × k array such that every N × t subarray contains all t‐tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t‐sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple “cut‐and‐paste” construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t = 2 is derived. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 124–138, 2006     

On Quantum Team Games

Recently Liu and Simaan (2004) convex static multi-team classical games have been introduced. Here they are generalized to both nonconvex, dynamic and quantum games. Puu's incomplete information dynamical systems are modified and applied to Cournot team game. The replicator dynamics of the quantum prisoner's dilemma game is also studied.