Possible Loss and Recovery of Gibbsianness¶During the Stochastic Evolution of Gibbs Measures

We consider Ising-spin systems starting from an initial Gibbs measure ν and evolving under a spin-flip dynamics towards a reversible Gibbs measure μ≠ν. Both ν and μ are assumed to have a translation-invariant finite-range interaction. We study the Gibbsian character of the measure νS(t) at time t and show the following: (1) For all ν and μ, νS(t) is Gibbs for small t. (2) If both ν and μ have a high or infinite temperature, then νS(t) is Gibbs for all t > 0. (3) If ν has a low non-zero temperature and a zero magnetic field and μ has a high or infinite temperature, then νS(t) is Gibbs for small t and non-Gibbs for large t. (4) If ν has a low non-zero temperature and a non-zero magnetic field and μ has a high or infinite temperature, then νS(t) is Gibbs for small t, non-Gibbs for intermediate t, and Gibbs for large t. The regime where μ has a low or zero temperature and t is not small remains open. This regime presumably allows for many different scenarios. Received: 26 April 2001 / Accepted: 10 October 2001     

On a bifurcation governed by hysteresis nonlinearity

We consider autonomous systems with a nonlinear part depending on a parameter and study Hopf bifurcations at infinity. The nonlinear part consists of the nonlinear functional term and the Prandtl--Ishlinskii hysteresis term. The linear part of the system has a special form such that the close-loop system can be considered as a hysteresis perturbation of a quasilinear Hamiltonian system. The Hamiltonian system has a continuum of arbitrarily large cycles for each value of the parameter. We present sufficient conditions for the existence of bifurcation points for the non-Hamiltonian system with hysteresis. These bifurcation points are determined by simple characteristics of the hysteresis nonlinearity.     

CMS physics overview

The principal physics goals of the Compact Muon Solenoid experiment under construction at the Large Hadron Collider at CERN in Geneva are reviewed. Procedures to search for the Standard Model Higgs boson, supersymmetric Higgses and other supersymmetric particles are described.     

The Implications of Cognitive-style Findings for Operational Research

Cognitive style refers to differences that can be perceived in individuals due to differing cognitive structures. There has been a large amount of research on how cognitive style affects managerial decision-making, particularly in the context of management information systems, but little or no attempt to relate these findings to operational research. This paper reviews the findings of cognitive-style research from the perspective of operational research, and draws a number of useful inferences concerning the matching of OR aids to managers, the presentation of information and recommendations, the use and acceptance of OR, and the structure of OR groups. Further, it is argued that cognitive-style findings help to give a justification to the move towards ‘soft’ approaches to analysis.     

Evaluating the Efficiency of US Air Force Real-Property Maintenance Activities

The objective of this research is to evaluate a new methodology, data envelopment analysis (DEA), as a tool for measuring and evaluating the operational efficiency of US Air Force organizations. This study involves the application of DEA to locate possible inefficiencies in the performance of US Air Force real-property maintenance activities. Dynamic behaviour, as exhibited via window analyses, is reviewed along with static counterparts. The testing was done in close coordination with Air Force officials, who reviewed the results for accuracy, validity and relevance. We conclude that this type of efficiency analysis does have value for the Air Force, where it can serve as a guide to auditors, budget programmers, managers and others in measuring, evaluating and enhancing operational efficiency.     

Two modifications of the least cost per period heuristic for dynamic lot-sizing

This paper proposes two constructive heuristics for the well-known single-level uncapacitated dynamic lot-sizing problem. The proposed heuristics, called net least period cost (nLPC) and nLPC(i), are developed by modifying the average period cost concept from Silver and Meal's heuristic, commonly known as least period cost (LPC). An improved tie-breaking stopping rule and a locally optimal decision rule are proposed in the second heuristic to enhance performance. We test the effectiveness of the proposed heuristics by using 20 benchmarking test problems frequently used in the literature. Furthermore, we perform a large-scale simulation study involving three factors, 50 experimental conditions, and 100?000 randomly generated problems to evaluate the proposed heuristics against LPC and six other well-known constructive heuristics in the literature. The simulation results show that both nLPC and nLPC(i) produce average holding and setup costs lower than or equal to those of LPC in every one of the 50 experimental conditions. The proposed heuristics also outperform each of the six other heuristics evaluated in all experimental conditions, without an increase in computational requirements. Lastly, considering that both nLPC and nLPC(i) are fairly simple for practitioners to understand and that lot-sizing heuristics have been commonly used in practice, there should be a very good chance for practical applications of the proposed heuristics.     

Negative molecular ions of azafullerenes and their hydrogenated derivatives

The formation and decay of negative molecular ions of azafullerenes and their hydrogenated derivatives are investigated by mass spectrometry. The mechanisms of resonant electron capture and the lifetimes of negative molecular ions with respect to the electron autodetachment in azafullerene molecules are discussed. A comparative analysis of the data obtained for azafullerenes and hydrogenated fullerene derivatives is carried out.     

Applying Stochastic Algorithms to a Locomotive Scheduling Problem

This paper addresses a problem common to all railway networks. Given a fixed train timetable and locomotives (or other forms of traction) of various types, each train must be allocated a locomotive. This paper examines the use of stochastic algorithms for such a problem. Two types of algorithm are used—a simple ‘local improvement’ method, performed successively from randomly chosen starting points, and a ‘simulated annealing’ approach. Both are found to give considerably better results than a deterministic method in current use, and the annealing approach is probably the better stochastic method.     

The application of a vehicle routing model to a waste-collection problem: two case studies

In this paper we suggest a unique model for estimating the operating cost of each of three waste-collection systems. Under the traditional system, which is widely used, waste is typically collected in plastic bags and a three-man crew is needed on each vehicle. The other two systems require a one-man crew for vehicle collecting street containers. The side-loader system with fixed body automatically empties street containers into the vehicle body and empties the load at the disposal site. The side-loader system with demountable body allows the separation of the waste collection phase from transport to the disposal site, since the vehicle body can be demounted. We also present two case studies and show how the estimation of operating costs is a critical issue in decisions regarding the type of system to be used for waste collection.     

On the Density-Density Critical Indices¶in Interacting Fermi Systems

The behaviour of correlation functions of d=1$ interacting fermionic systems is determined by a small number of critical indices. We prove that one of them is exactly zero. As a consequence, the behavior of the Fourier transform of the density-density correlation at zero momentum is qualitatively unaffected by the interaction, contrary to what happens at , if is the Fermi momentum. The result is obtained by implementing Ward identities in a Renormalization Group approach. Received: 12 November 2001 / Accepted: 25 February 2002?Published online: 2 October 2002