On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes

It is well known that the complexity, i.e. the number of vertices, edges and faces, of the 3-dimensional Voronoi diagram of n points can be as bad as Θ(n²). It is also known that if the points are chosen Independently Identically Distributed uniformly from a 3-dimensional region such as a cube or sphere, then the expected complexity falls to O(n). In this paper we introduce the problem of analyzing what occurs if the points are chosen from a 2-dimensional region in 3-dimensional space. As an example, we examine the situation when the points are drawn from a Poisson distribution with rate n on the surface of a convex polytope. We prove that, in this case, the expected complexity of the resulting Voronoi diagram is O(n).     

Cauchy problems for linear thermoelastic systems of type III in one space variable

The goal of the paper is to analyse properties of solutions for linear thermoelastic systems of type III in one space variable. Our approach does not use energy methods, it bases on a special diagonalization procedure which is different in different parts of the phase space. This procedure allows to derive explicit representations of solutions. These representations help to prove results for well‐posedness of the Cauchy problem, L^P–L^q decay estimates on the conjugate line and results for propagation of singularities. Copyright © 2005 John Wiley & Sons, Ltd.     

Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem

We consider the problem of maintaining a dynamic ordered set of n integers in a universe U under the operations of insertion, deletion and predecessor queries. The computation model used is a unit-cost RAM, with a word length of w bits, and the universe size is |U|=2^w. We present a data structure that uses O(|U|/log|U|+n) space, performs all the operations in O(loglog|U|) time and needs O(loglog|U|/logloglog|U|) structural changes per update operation. The data structure is a simplified version of the van Emde Boas' tree introducing, in its construction and functioning, new concepts, which help to keep the important information for searching along the path of the tree, in a more compact and organized way.     

Learning to See: Making Sense of the Mathematics of Change in Middle School

In this article, we will describe the results of a study of 6th grade students learning about the mathematics of change. The students in this study worked with software environments for the computer and the graphing calculator that included a simulation of a moving elevator, linked to a graph of its velocity vs. time. We will describe how the students and their teacher negotiated the mathematical meanings of these representations, in interaction with the software and other representational tools available in the classroom. The class developed ways of selectively attending to specific features of stacks of centimeter cubes, hand-drawn graphs, and graphs (labeled velocity vs. time) on the computer screen. In addition, the class became adept at imagining the motions that corresponded to various velocity vs. time graphs. In this article, we describe this development as a process of learning to see mathematical representations of motion. The main question this article addresses is: How do students learn to see mathematical representations in ways that are consistent with the discipline of mathematics? This revised version was published online in July 2006 with corrections to the Cover Date.     

Transmission of a Gaussian beam after incidenting nonnormally on a Fabry–Perot etalon: a nonresonant case

Under the nonresonant case where the carrier frequency of a Gaussian beam deviates from the resonant frequency of a Fabry–Perot etalon, the transmission of a Gaussian beam after incidenting nonnormally on a Fabry–Perot etalon has been investigated. The results show that under the nonresonant case, variations of the peak intensity, the position of the peak intensity and the spot size of the transmitted beam with the input angle behave differently and even with a reversed tendency compared with those obtained under the resonant case.     

On the convergence rate and optimization of a numerical method with splitting of boundary conditions for the stokes system in a spherical layer in the axisymmetric case: Modification for thick layers

The convergence rate of a fast-converging second-order accurate iterative method with splitting of boundary conditions constructed by the authors for solving an axisymmetric Dirichlet boundary value problem for the Stokes system in a spherical gap is studied numerically. For R/r exceeding about 30, where r and R are the radii of the inner and outer boundary spheres, it is established that the convergence rate of the method is lower (and considerably lower for large R/r) than the convergence rate of its differential version. For this reason, a really simpler, more slowly converging modification of the original method is constructed on the differential level and a finite-element implementation of this modification is built. Numerical experiments have revealed that this modification has the same convergence rate as its differential counterpart for R/r of up to 5 × 10³. When the multigrid method is used to solve the split and auxiliary boundary value problems arising at iterations, the modification is more efficient than the original method starting from R/r ～ 30 and is considerably more efficient for large values of R/r. It is also established that the convergence rates of both methods depend little on the stretching coefficient η of circularly rectangular mesh cells in a range of η that is well sufficient for effective use of the multigrid method for arbitrary values of R/r smaller than ～ 5 × 10³.     

用随机模糊方法研究合理确定工程项目工期

站在兼顾业主与建造商的公正立场,基于网络优化技术基础上并以系统的观点,采用随机模糊数学方法研究合理确定项目工期,进而用实际项目进行分析验证,是一种科学合理确定工期的方法.     

Strong limit-point classification of singular Hamiltonian expressions

Strong limit-point criteria for singular Hamiltonian differential expressions with complex coefficients are obtained. The main results are extensions of the previous results due to Everitt, Giertz, and Weidmann for scalar differential expressions.

     

New numerical methods and some applied aspects of the p-regularity theory

The theory of p-regularity is applied to optimization problems and to singular ordinary differential equations (ODE). The special variant of the method of the modified Lagrangian function proposed by Yu.G. Evtushenko for constrained optimization problems with inequality constraints is justified on the basis of the 2-factor transformation. An implicit function theorem is given for the singular case. This theorem is used to show the existence of solutions to a boundary value problem for a nonlinear differential equation in the resonance case. New numerical methods are proposed including the p-factor method for solving ODEs with a small parameter.