Estimating a reduced rank regression model for non-normal variables

A method using third order moments for estimating the regression coefficients as well as the latent state scores of the reduced-rank regression model when the latent variable(s) are non-normally distributed is presented in this paper. It is shown that the factor analysis type indeterminacy of the regression coefficient matrices is eliminated. A real life example of the proposed method is presented. Differences of this solution with the reduced-rank regression eigen solution are discussed.     

Stationary turbulent closure via the Hopf functional equation

Exact closed-form solutions are exhibited for the Hopf equation for stationary incompressible 3D Navier-Stokes flow, for the cases of homogeneous forced flow (including a solution with depleted nonlinearity) and inhomogeneous flow with arbitrary boundary conditions. This provides an exact method for computing two- and higher-point moments, given the mean flow.     

A Recursive Algorithm for Order Cycle-time that Minimizes Logistics Cost

A firm's logistics cost, including shipping and inventory-carrying, is a substantial percentage of its sales. Nevertheless, typical inventory-control methods ignore or insufficiently represent the shipping cost. This paper describes a recursive algorithm that determines the reorder cycle-time that minimizes total logistics cost. It allows for a realistic accounting of shipping cost, which is modelled here as a function of shipping distance and weight. The algorithm uses a relaxation procedure to identify a suitable initial approximation to the optimal order cycle-time and then, through a series of recursive steps, moves to the optimal result. We demonstrate the algorithm with a single item, with a group of items that share a common order cycle, and with multi-items when item demands are random variables. Experience with this algorithm indicates that it converges to the optimal result in a very few steps.     

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.     

Study of the reaction238U (α, α′f) atE α=480 MeV

The excitation function of the fission probability P _E E _x) for²³⁸U has been measured in the reaction²³⁸U(α, α′ f) at 480 MeV bombarding energy. The reaction mechanism of this reaction is discussed for excitation energies belowB _nf , the threshold for second chance fission, and aboveB _nf up toE _x =37 MeV. In comparing with results from fission induced by photons and by particle transfer reactions the (α, α′f) reaction gives too low values for the fission probabilityP _f at excitation energies well aboveB _nE . The role of the quasi-elastic knock-out process in this reaction is discussed.     

τ-CHEBYSHEV AND τ-COCHEBYSHEV SUBPSACES OF BANACH SPACES

The concepts of quasi-Chebyshev and weakly-Chebyshev and σ-Chebyshev were defined [3 - 7], andas a counterpart to best approximation in normed linear spaces, best coapprozimation was introduced by Franchetti and Furi^[1]. In this research, we shall define τ-Chebyshev subspaces and τ-cochebyshev subspaces of a Banach space, in which the property τ is compact or weakly-compact, respectively. A set of necessary and sufficient theorems under which a subspace is τ-Chebyshev is defined.     

Schmidt analysis of pure-state entanglement

We examine the application of Schmidt mode analysis to pure-state entanglement. Several examples permitting exact analytic calculation of Schmidt eigenvalues and eigenfunctions are included, as well as evaluation of the associated degree of entanglement.     

The square lattice shuffle

We show that the operations of permuting columns and rows separately and independently mix a square matrix in constant time. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2006