Chemical bonding in representative astrophysically relevant neutral,cation, and anion HCnH chains

Most existing studies assign a polyynic and cumulenic character of chemical bonding in carbon-based chains relying on values of the bond lengths. Building on our recent work, in this paper we add further evidence on the limitations of such an analysis and demonstrate the significant insight gained via natural bond analysis. Presently reported results include atomic charges, natural bond order and valence indices obtained from ab initio computations for representative members of the astrophysically relevant neutral and charged HC_2k/2k+1H chain family. They unravel a series of counter-intuitive aspects and/or help naive intuition in properly understanding microscopic processes, e.g., electron removal from or electron attachment to a neutral chain. Demonstrating that the Wiberg indices adequately quantify the chemical bonding structure of the HC_2k/2k+1H chains—while the often heavily advertised Mayer indices do not—represents an important message conveyed by the present study.     

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.     

Modelling recruitment training in mathematical human resource planning

This paper deals with mathematical human resource planning; more specifically, it suggests a new model for a manpower‐planning system. In general, we study a k‐classed hierarchical system where the workforce demand at each time period is satisfied through internal mobility and recruitment. The motivation for this work is based on various European Union incentives, which promote regional or local government assistance programs that could be exploited by firms not only for hiring and training newcomers, but also to improve the skills and knowledge of their existing personnel. In this respect, in our augmented mobility model we establish a new ‘training/standby’ class, which serves as a manpower inventory position for potential recruits. This class, which may very well be internal or external to the system, is incorporated into the framework of a non‐homogeneous Markov chain model. Furthermore, cost objectives are employed using the goal‐programming approach, under different operating assumptions, in order to minimize the operational cost in the presence of system's constraints and regulations. Copyright © 2002 John Wiley & Sons, Ltd.     

Scale Invariance Properties in the Simulated Annealing Algorithm

The Boltzmann distribution used in the steady-state analysis of the simulated annealing algorithm gives rise to several scale invariant properties. Scale invariance is first presented in the context of parallel independent processors and then extended to an abstract form based on lumping states together to form new aggregate states. These lumped or aggregate states possess all of the mathematical characteristics, forms and relationships of states (solutions) in the original problem in both first and second moments. These scale invariance properties therefore permit new ways of relating objective function values, conditional expectation values, stationary probabilities, rates of change of stationary probabilities and conditional variances. Such properties therefore provide potential applications in analysis, statistical inference and optimization. Directions for future research that take advantage of scale invariance are also discussed.     

Projection of Markov Measures May Be Gibbsian

We study the induced measure obtained from a 1-step Markov measure, supported by a topological Markov chain, after the mapping of the original alphabet onto another one. We give sufficient conditions for the induced measure to be a Gibbs measure (in the sense of Bowen) when the factor system is again a topological Markov chain. This amounts to constructing, when it does exist, the induced potential and proving its Hölder continuity. This is achieved through a matrix method. We provide examples and counterexamples to illustrate our results.     

期货经纪公司保证金的一种确定方法

本文基于马尔可夫链在存储论中的应用，结合Ergodic定理，得到确定期货经纪公司保证金的Ergodic模型，即一个双目标规划问题，然后应用乘积最大化准则，将该模型转化为单目标规划问题来求解。该方法考虑期货经纪公司承担的风险和对投资者的吸引程度，为保证金的确定提供新的思路。     

Single chain force spectroscopy - Reading the sequence of HP protein models

We study the elastic properties of single A/B random copolymer chains, with a specific sequence and use them as theoretical model for so called HP proteins. HP proteins carry hydrophilic (P) and hydrophobic (H) monomers. We predict a rich structure in the force-extension relations which can be attributed to the information in the sequence. The variational method is used to probe local minima on the path of stretching and releasing for the chain molecules. At a given force, we find multiple configurations which are separated by energy barriers. A collapsed globular configuration consists of several domains which unravel cooperatively. Upon stretching, the unfolding path shows a stepwise pattern corresponding to the unfolding of each domain. While releasing, several cores can be created simultaneously in the middle of the chain, resulting in a different path of collapse. The long-range interactions and stiffness of the chain simplify the potential landscape given by the disorder in sequence. Received 5 March 2002 / Received in final form 16 May 2002 Published online 13 August 2002     

Toda Chains in the Jacobi Method

We use the Jacobi method to construct various integrable systems, such as the Stäckel systems and Toda chains, related to various root systems. We find canonical transformations that relate integrals of motion for the generalized open Toda chains of types B _n, C _n, and D _n.