Montgomery Multiplication in GF(2k)

We show that the multiplication operation c=a · b · r^-1 in the field GF(2^k can be implemented significantly faster in software than the standard multiplication, where r is a special fixed element of the field. This operation is the finite field analogue of the Montgomery multiplication for modular multiplication of integers. We give the bit-level and word-level algorithms for computing the product, perform a thorough performance analysis, and compare the algorithm to the standard multiplication algorithm in GF(2^k. The Montgomery multiplication can be used to obtain fast software implementations of the discrete exponentiation operation, and is particularly suitable for cryptographic applications where k is large.     

The Assessment of Reservation Prices of an Intermediate R&D Result and Patent Reward Under Oligopolistic Competitive Behaviour

One of the shortcomings of R&D evaluation is a lack of emphasis on analytical assessment of the value of an on-going R&D project. This paper addresses the problem concerning the distributive aspect of access to superior knowledge. Decision tree analysis and probability models appear to be appropriate tools for assessing the values of an intermediate result and patent reward of a firm's R&D decision in an environment of perfect information and oligopolistic competition. The assessed values are used as minimum prices acceptable to the firm when the knowledge is disseminated to the public. This paper will attempt to resolve this problem through the determination of the appropriate values of the reservation price of the first-stage invention in terms of the final reward and of a patent reward for which the inventor is willing to apply.     

A branching process model for sand avalanches

An analytically solvable model for sand avalanches of noninteracting grains of sand, based on the Chapman-Kolmogorov equations, is presented. For a single avalanche, distributions of lifetimes, sizes of overflows and avalanches, and correlation functions are calculated. Some of these are exponentials, some are power laws. Spatially homogeneous distributions of avalanches are also studied. Computer simulations of avalanches of interacting grains of sand are compared to the solutions to the Chapman-Kolmogorov equations. We find that within the range of parameters explored in the simulation, the approximation of noninteracting grains of sand is a good one.     

Direct SCF structure optimization of large molecules on networks of workstations

A program to optimize the structure of large molecules at the Hartree–Fock level of theory running concurrently on a network of workstations is presented. Problems encountered in obtaining nearly optimal speedup and their solutions are discussed. A simple scheduling algorithm is presented that enables up to 99.5% of the code to run in parallel. © 1993 John Wiley & Sons, Inc.     

Enhancement of the backscattered intensity from fractal aggregates

Comparative measurements were conducted for the backscattered intensities of light from uniform random and fractal aggregated media. Different features are found for the backscattered intensity peak shapes. A crossover between the θ^1-D and θ^-2 dependences of the backscattered intensity occurs in the case of fractal aggregated medium, where D indicates the fractal dimension.     

On the optimum set of polarization measurements for the scattering of two indentical fermions to determine the helicity amplitudes

The polarization asymmetries related to usual polarizations combine at least 4 different helicity amplitudes. The introduction of ±45° inclined transverse polarizations allows us to obtain the complete set of new polarization asymmetries combining only up to 3 helicity amplitudes. There are no further polarization asymmetries depending on a smaller number of helicity amplitudes. These expressions are most economical to determine the helicity amplitudes from observed data. Some of them are suitable to study especially the spin-flip effects. We give a complete Table of all such polarization asymmetries.     

Sputtering yield of chromium by argon and xenon ions with energies from 50 to 500 eV

A radioactive tracer technique is described for the quantitative measurement of the sputtering yield of a target material electroplated on a copper substrate. Sputtering yields of chromium by argon and xenon ions with energies from 50 to 500 eV are reported. The ion beams, having a current density ranging from 0.01 to 0.1 mA/cm² at an operating pressure of 2×10^–5 Torr, were produced by a low-energy ion gun. The sputtered atoms were collected on an aluminum foil surrounding the target. ⁵¹Cr was used as the tracer isotope. The results indicate that the radioactive tracer technique is sensitive enough in measuring the extremely small amount of sputtered material at low ion currents and low ion energies.     

Magnetic resonance imaging: a new window into industrial processing.

Although the most important use of nuclear magnetic resonance imaging (MRI) continues to be for diagnostic medicine, recognition is being gained for many nonmedical applications. Examples include the following areas: petrogeology, food, agriculture, polymers and polymer-composites, and pharmaceuticals. These areas all involve studies of species that have short spin-spin relaxation times, and consequently need far fast gradient switching. These technical details are discussed and typical applications given.     

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.