The structure of CeAlO3 by Rietveld refinement of X-ray powder diffraction data

The room temperature structure of perovskite CeAlO₃ has been reinvestigated by X-ray powder diffraction. The Rietveld refinement has confirmed the tetragonal symmetry; but revealed a super cell, a=5.32489(6) Å and c=7.58976(10) Å, with the space group I4/mcm. In CeAlO₃, the distortion from the ideal cubic perovskite is caused by the cooperative tilting of the AlO₆ octahedra around the primitive cubic [001]_p-axis.     

Pattern formation on a nonlinear periodic electrical network

It is observed experimentally that a periodic array of resistively coupled LC-oscillators with ans-shaped nonlinearity exhibits stable non-uniform voltage and current distributions. The dependence of the resulting structure on the coupling resistance and the boundary conditions is investigated. The structure is rather insensitive to variations of the boundary values. The experiments are well described by a two-variable reaction-diffusion equation.     

Inhomogeneous Voter Models in One Dimension

We establish conditions for survival and extinction of types of one-dimensional voter models, and show that increasing the flip rates at a finite number of sites typically does not affect survival, unless the flipping mechanism is altered. We provide an example of a modified voter model that does not survive but can be made to survive simply by altering the flip mechanism at one site. We also show that a rather general class of such models have clustering behavior.     

The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study

The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 2¹⁶⁹⁴ scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time.     

Decay of neutron-rich Ga isotopes near N = 50 at PARRNe

The PARRNe facility has been used to produce neutron-rich isotopes ^83,84Gaby the ISOL method. Their decay has been studied, and β-γ coincidence and γ-γ coincidence data were collected as a function of time. The first two excited levels in ⁸³Ge and the first excited level in ⁸⁴Ge have been measured for the first time.     

Vanadium(III) chloride catalyzed Biginelli condensation: solution phase library generation of dihydropyrimidin-(2H)-ones

The three component condensation of an aldehyde, a β-keto ester and urea (thiourea) in the presence of a catalytic amount of VCl₃ is disclosed for the solution phase synthesis of dihydropyrimidinones. The ease of synthesis and work-up allowed the parallel synthesis of a 48-membered library of dihydropyrimidinones quickly and efficiently in good yields.