Small angle neutron scattering from oxygen precipitates in silicon

The formation of silicon oxide precipitates from Czochralski grown silicon depends on the time and temperature of the heat treatment as well as on the initial content of interstitially dissolved oxygen. Samples containing between 5×10¹⁷ O_i/cm³ and 13×10¹⁷ O_i/cm³ have been heated at 750° C for 96 h. SiO₂ precipitates of various shape and size have been obtained and investigated by means of small angle neutron scattering (SANS) in the Q-range 0.05 Å^–1<Q<0.2 Å^–1. The obtained SANS patterns reveal a typical anisotropy of their intensity distribution, which splits into a central peak at Q<0.1 Å^–1 due to the shape of the individual particles and a number of weak intensities for large Q-values, originating from a correlation between defects, possibly between the precipitates. While these correlation peaks in the SANS patterns are seen best for rather low values of about (5–7)×10¹⁷ O_i/cm³ oxygen content, the central peak anisotropy is most pronounced for higher values of ca 10×10¹⁷ O_i/cm³. The integrated intensity of the central peak increases with increasing initial oxygen content. For comparison, untreated samples of the same initial oxygen content do not reveal any anisotropic SAN scattering or a broadened central peak beam.     

Projective-type axioms for the hyperbolic plane

It is shown that the Laws of Pappus and Desargues may replace the Axiom of Projectivities in Menger's development of hyperbolic geometry from axioms of alignment.     

A correspondence principle connecting IBVPs of wave propagation and heat conduction

A wave-heat correspondence principle is established by utilizing previous operational relations of van der Pol and Bremmer. By the suggested procedure, heat conduction problems can be solved by using an auxiliary wave-propagation problem in conjunction with the correspondence principle. A check on this procedure was provided by solving a mixed BVP of transient heat flow. The present correspondence principle is particularly useful in dealing with IBVPs involving wedge-shaped domains, and characteristic lengths.     

Systematics of flux jumps and the stabilizing effect of flux creep in a La1.86Sr0.14CuO4 single crystal

Flux jumps have been observed in a large (138 mg) single crystal of La_1.86Sr_0.14CuO₄. Both complete and incomplete flux jumps are observed with the energy dissipated by complete flux jumps consistent with temperature rises to nearly T_c. The systematics of these flux jumps with respect to field history, temperature and the time duration of the hysteresis measurements are reported. The field at which flux jumps first occur and their subsequent spacing are not consistent with a simple adiabatic theory of flux jumps for our experimental conditions. Instead, the crystal is observed to be stabilized against flux jumps by flux creep which occurs during the time interval over which field steps are accomplished as well as during imposed time intervals between field steps.     

Optical switching between bistable soliton states: a theoretical review

In this paper we summarize what is currently known about optical switching between bright bistable soliton states in one and higher dimensions. A guideline to selecting media with appropriate intensity-dependent refractive indices to support bistable solitary waves is presented. The stability criterion for robustness of the solitary waves is discussed. Finally, some methods and numerical examples of optical switching are presented.     

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.     

A Primitive Non-symmetric 3-Class Association Scheme on 36 Elements with p11 = 0 Exists and is Unique

In this paper we construct a primitive, non-symmetric 3-class association scheme with parameters v = 36, v₁ = 7, p¹₁₁ = 0 and p²₁₁ = 4 and show that such a scheme is determined by its parameters.     

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.