<Emphasis Type="Italic">FCC/BCC</Emphasis> competition and enhancement of saturation magnetization in nanocrystalline Co-Ni-Fe films

The structure, chemical composition, and magnetic properties of electrochemically deposited nanocrystalline Co-Ni-Fe films were investigated using a number of techniques. A high saturation magnetic induction up to B _s = 21 kG was attained. An enhancement of the saturation magnetization compared to the ideal anticipated one was revealed, which correlated with the nonlinear behavior of the structural phase composition and lattice parameters with the change of the composition. The text was submitted by the authors in English.     

3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects

We present a new data structure for a set of n convex simply-shaped fat objects in the plane, and use it to obtain efficient and rather simple solutions to several problems including (i) vertical ray shooting—preprocess a set of n non-intersecting convex simply-shaped flat objects in 3-space, whose xy-projections are fat, for efficient vertical ray shooting queries, (ii) point enclosure—preprocess a set C of n convex simply-shaped fat objects in the plane, so that the k objects containing a query point p can be reported efficiently, (iii) bounded-size range searching— preprocess a set C of n convex fat polygons, so that the k objects intersecting a “not-too-large” query polygon can be reported efficiently, and (iv) bounded-size segment shooting—preprocess a set C as in (iii), so that the first object (if exists) hit by a “not-too-long” oriented query segment can be found efficiently. For the first three problems we construct data structures of size O(λ_s(n)log³n), where s is the maximum number of intersections between the boundaries of the (xy-projections) of any pair of objects, and λ_s(n) is the maximum length of (n, s) Davenport-Schinzel sequences. The data structure for the fourth problem is of size O(λ_s(n)log²n). The query time in the first problem is O(log⁴n), the query time in the second and third problems is O(log³n + klog²n), and the query time in the fourth problem is O(log³n).

We also present a simple algorithm for computing a depth order for a set as in (i), that is based on the solution to the vertical ray shooting problem. (A depth order for , if exists, is a linear order of , such that, if K₁, K₂ and K₁ lies vertically above K₂, then K₁ precedes K₂.) Unlike the algorithm of Agarwal et al. (1995) that might output a false order when a depth order does not exist, the new algorithm is able to determine whether such an order exists, and it is often more efficient in practical situations than the former algorithm.     

Forecasting call frequency at a financial services call centre

A forecasting model is developed for the number of daily applications for loans at a financial services telephone call centre. The purpose of the forecasts and the associated prediction intervals is to provide effective staffing policies within the call centre. The model building process is constrained by the availability of only 2 years and 7 months of data. The distinctive feature of the data is that demand is driven in the main by advertising. The analysis given focuses on applications stimulated by press advertising. Unlike previous analyses of broadly similar data, where ARIMA models were used, a model with a dynamic level, multiplicative calendar effects and a multiplicative advertising response is developed and shown to be effective.     

Issues in Managing Information Technology

This paper describes three case studies which investigated issues relating to the implementation and management of advanced information technology. The benefits derived from information technology were found to vary from one organization to another. These studies provide further evidence to support earlier research findings that senior management has an important role to play in the effective exploitation of information technology, and that the investment approach taken by an organization has a significant effect on the development of computer-based information systems. The effectiveness of a system depends not only on applying the appropriate technology, but also on how successfully technical and behavioural issues are resolved.     

A warehouse-based design model for reverse logistics

In this paper, an MILP formulation is proposed for the design of a reverse logistics network based on a warehouse location–allocation model, which optimizes, simultaneously, the forward and reverse networks. A single product model with unlimited capacity is first defined. Subsequently, the model is extended to a multi-product capacitated recovery network model, where capacity limitations and a multi-product system can be considered. The proposed model is compared to published work in the field, where different model assumptions have been proposed. Two cases are described so as to gain a better insight into the model and allow a comparative analysis.     

Quadratic data envelopment analysis

Data Envelopment Analysis (DEA) offers a piece-wise linear approximation of the production frontier. The approximation tends to be poor if the true frontier is not concave, eg in case of economies of scale or of specialisation. To improve the flexibility of the DEA frontier and to gain in empirical fit, we propose to extend DEA towards a more general piece-wise quadratic approximation, called Quadratic Data Envelopment Analysis (QDEA). We show that QDEA gives statistically consistent estimates for all production frontiers with bounded Hessian eigenvalues. Our Monte-Carlo simulations suggest that QDEA can substantially improve efficiency estimation in finite samples relative to standard DEA models.     

Effective dimensionality approach to the RKKY interaction in multilayer systems

We consider RKKY interaction in a quasi 2D system with nonparabolic dispersion. In our paper we calculate the RKKY range function assuming the in-layer confinement via effective dimensionality approach. We show, that indirect magnetic exchange in our system can be modelled by the effective spectral dimension which equals one.     

A Language for Teaching Discrete-event Simulation

Courses which teach discrete-event simulation are based on many different simulation languages. The requirements for a language to support teaching simulation are discussed. In particular, it is recommended that such languages separate into distinct modules those aspects of simulation which are taught as separate topics. Implementation of the separation is discussed. The SEESIM language, developed as a teaching aid, is described, and examples of its use are given. Straightforward use of SEESIM can be learned quickly, yet the language provides facilities for a staged introduction to advanced concepts of simulation.