On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences

We give a surprisingly short proof that in any planar arrangement of n curves where each pair intersects at most a fixed number (s) of times, the k-level has subquadratic (O(n^2-1/2s) complexity. This answers one of the main open problems from the author’s previous paper [DCG 29, 375-393 (2003)], which provided a weaker upper bound for a restricted class of curves only (graphs of degree-s polynomials). When combined with existing tools (cutting curves, sampling, etc.), the new idea generates a slew of improved k-level results for most of the curve families studied earlier, including a near-O(n^3/2 bound for parabolas.     

A variant of the pure quaternionic representation of the Navier-Stokes equation

It is shown that the three-dimensional Navier-Stokes equation for incompressible fluid can be represented as an equation including only quaternions as co-ordinate operators and variables. Only the quaternion operations such as a quaternion product and a quaternion conjugation over these variables are used.     

Structuring Multi-attribute Value Hierarchies

The first stage in a multi-attribute value analysis is the development of a hierarchical structure of the attributes of the problem. This paper reports the process of developing such a structure for the problem of choosing a suitable mode of transport for radioactive waste. The initial hierarchy of attributes went through several stages of development as new insights emerged about the nature of the problem. Some of the reasons behind this restructuring are discussed, and several important questions about the structuring process are formulated.     

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.     

Mathematics achievement and interest in mathematics from a differential perspective

In this article, we present results of an empirical study with 500 German students of grades 7 and 8. The study focussed on students' mathematics achievement and their interest in mathematics as well as on the relation between these two constructs. In particular, the results show that the development of an individual student's achievement between grade 7 and grade 8 depends on the achievement level of the specific classroom and therefore on the specific mathematics instruction Interest in mathematics could be regarded a predictor for mathematics achievement Moreover, our findings suggest that the students show hardly any fear of mathematics independent of their achievement level.     

Magnetic-Zenith Effect

We develop a theory of the magnetic-zenith effect (MZE) observed upon the ionosphere modification by powerful radio waves. The dependences of MZE on main parameters, such as the magnetic-field inclination angle, pump-wave frequency and power, and angular width of HF beam are obtained. The optimal elevation angle of pump-wave beam is predicted. __________ Translated from Izvestiya Vysshikh Uchebnykh Zavedenii, Radiofizika, Vol. 48, No. 9, pp. 772–787, September 2005.     

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.     

An Application of Branch and Cut to Open Pit Mine Scheduling

The economic viability of the modern day mine is highly dependent upon careful planning and management. Declining trends in average ore grades, increasing mining costs and environmental considerations will ensure that this situation will remain in the foreseeable future. The operation and management of a large open pit mine having a life of several years is an enormous and complex task. Though a number of optimization techniques have been successfully applied to resolve some important problems, the problem of determining an optimal production schedule over the life of the deposit is still very much unresolved. In this paper we will critically examine the techniques that are being used in the mining industry for production scheduling indicating their limitations. In addition, we present a mixed integer linear programming model for the scheduling problems along with a Branch and Cut solution strategy. Computational results for practical sized problems are discussed.     

Nuclear superstructure {1/2, 0, 1/2} of an La<Subscript>0.93</Subscript>Sr<Subscript>0.07</Subscript>MnO<Subscript>3</Subscript> manganite orthorhombic crystal

The {1/2, 0, 1/2} nuclear superstructure in an La_0.93Sr_0.07MnO₃ manganite orthorhombic crystal is revealed using thermal-neutron diffraction. It is demonstrated that this superlattice belongs to the class of distortion-type structures and is directly associated with a 1/16-type ordering of Mn⁴⁺ and Mn³⁺ ions in a collinear ferromagnetic phase of the La_0.93Sr_0.07MnO₃ manganite.