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.     

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.     

Determination of trace levels of diosmin in a pharmaceutical preparation by adsorptive stripping voltammetry at a glassy carbon electrode.

A systematic study on the electrochemical behavior of diosmin in Britton-Robinson buffer (pH 2.0-10.0) at a glassy carbon electrode (GCE) was made. The oxidation process of the drug was found to be quasi-reversible with an adsorption-controlled step. The adsorption stripping response was evaluated with respect to various experimental conditions, such as the pH of the supporting electrolyte, the accumulation potential and the accumulation time. The observed anodic peak current at +0.73 V vs. Ag/AgCl reference electrode increased linearly over two orders of magnitude from 5.0x10(-8) M to 9.0x10(-6) M. A limit of detection down to 3.5x10(-8) M of diosmin at the GCE was achieved with a mean recovery of 97+/-2.1%. Based on the electrochemical data, an open-circuit accumulation step in a stirred sample solution of BR at pH 3.0 was developed. The proposed method was successfully applied to the determination of the drug in pharmaceutical formulations. The results compared favorably with the data obtained via spectrophotometric and HPLC methods.     

Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.     

Adaptive Algorithm for Constrained Least-Squares Problems

This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for solving general constrained optimization problems. At each iteration, our local quadratic subproblem includes the use of the Gauss–Newton approximation but also encompasses a structured secant approximation along with tests of when to use this approximation. This method has been tested on a selection of standard problems. The results indicate that, for least-squares problems, the approach taken here is a viable alternative to standard general optimization methods such as the Byrd–Omojokun trust-region method and the Powell damped BFGS line search method.     

Rank-perfect and" weakly rank-perfect graphs

An edge e of a perfect graph G is critical if G−e is imperfect. We would like to decide whether G−e is still “almost perfect” or already “very imperfect”. Via relaxations of the stable set polytope of a graph, we define two superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph of a bipartite graph or from the complement of such a graph.