Bank-office Process Management in the Financial Services: a Simulation Approach Using a Model Generator

For the last ten years or so, developments in simulation software and methodology have been focused in two areas: (1) automating the model-building process; and (2) interfacing with other techniques and systems. That both academic and commercial research continues to be carried out in these areas is evidence of the continued popularity of the simulation technique. The most popular application areas where simulation modelling is used include manufacturing (engineering and process), warehousing and communications; not surprisingly, research and developments have therefore been concentrated in these areas. This paper describes the development of a simulation model generator for a different application area, that of clerical office processing of paper and documents for financial service companies. It outlines the reasons why there is a need for such a model generator and discusses the initial design requirements. The paper goes on to detail the developments and re-defined criteria required as the model generator brief changes as a result of practical applications.     

Dynamic Point Location in General Subdivisions

The dynamic planar point location problem is the task of maintaining a dynamic set S of n nonintersecting (except possibly at endpoints) line segments in the plane under the following operations:

• Locate (: point): Report the segment immediately above , i.e., the first segment intersected by an upward vertical ray starting at ;

• Insert (: segment): Add segment to the collection of segments;

• Delete (: segment): Remove segment from the collection of segments.

We present a solution which requires space O(n) and has query and insertion time O(log n log log n) and deletion time O(log²n). The bounds for insertions and deletions are amortized. A query time below O(log²n) was previously only known for monotone subdivisions and subdivisions consisting of horizontal segments and required nonlinear space.     

Minimizing Maximum Weighted Error for Imprecise Computation Tasks

We consider the problem of preemptively scheduling a set of imprecise computation tasks on m ≥ 1 identical processors, with each task T_i having two weights, w_i and w′_i. Two performance metrics are considered: (1) the maximum w′-weighted error; (2) the total w-weighted error subject to the constraint that the maximum w′-weighted error is minimized. For the problem of minimizing the maximum w′-weighted error, we give an algorithm which runs in O(n³ log²n) time for multiprocessors and O(n²) time for a single processor. For the problem of minimizing the total w-weighted error subject to the constraint that the maximum w′-weighted error is minimized, we give an algorithm which also has the same time complexity.     

On formal integration in composition rings of polynomials

This author wants to express his thanks to the School of Information Engineering at Teesside Polytechnic, Middlesbrough, England, for its support and hospitality during a visiting appointment of 3 months in 1989, when this paper was written.     

Properties of neodymium-doped aluminophosphate laser glasses

Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 56, No. 1, pp. 90–95, January, 1992.     

On the existence of <Emphasis Type="Bold">1, 3</Emphasis>P <Emphasis Type="Bold">o</Emphasis> resonances in H<Superscript>-</Superscript> between n = 2 and 3 H thresholds

We examine the influence of relativistic and QED effects on the existence of the ^1,3P ^o H^- resonances between n = 2 and 3 hydrogen thresholds, the relativistic and QED corrections and the coupling effects between the high singlet and triplet states are considered as first-order perturbations. We firstly obtain accurate non-relativistic resonant energies and widths of fifteen ¹P ^o resonances, and fifteen ³P ^o resonances. The fifteen ¹P ^o resonances are classified to be ₃ (2, 0) ^- _n ( 4 ? n ? 12) and ₃ (1, 1) ⁺ _n ( 3 ? n ? 8). The fifteen ³P ^o resonances are classified to be ₃ (2, 0) ⁺ _n ( 3 ? n ? 12) and ₃ (1, 1) ^- _n ( 4 ? n ? 8). We found there exist six Feshbach resonances for ₃ (2, 0) ^- _n (¹P ^o ) series, four Feshbach resonances for ₃ (1, 1) ⁺ _n (¹P ^o ) series, seven Feshbach resonances for ₃ (2, 0) ⁺ _n (³P ^o ) series, and three Feshbach resonances for ₃ (1, 1) ^- _n (¹P ^o ) series. Received 22 February 2002 Published online 24 September 2002     

Variational aspects of Faddeev calculations

We examine differences between³H binding energies obtained by solving the Faddeev equations using standard partial-wave expansion procedures and results from solving the Schrödinger equation by means of the coupled-rearrangement-channel variational method. Variational bounds generated from Faddeev solutions for several contemporary, realistic potential models are presented as a function of the number of partial waves retained in the potential expansion. We demonstrate that the Faddeev wave function yields an optimal variational bound for the partial-wave truncated potential from which it is generated, but it does not yield optimal bounds for the full Hamiltonian or when the potential is partial-wave truncated at a different level. Finally, qualitative differences between³H solutions for static models such as the AV14 and RSC potentials and for momentum-dependent models such as the Nijmegen soft-core and Paris potentials are explored, and comparison is made with solutions for the RSC/TM two-body-force plus three-body-force model.