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).     

平行机半在线排序问题研究(Ⅰ)

对半在线平行机排序问题的研究进展作了详细综述和进一步探讨。文章给出半在线排序问题的背景、定义、分类和求解。介绍它们定义和在不同机器环境和目标函数下半在线排序问题分类，以及第一类半在线模型的近似算法的设计及其竞争比分析。     

Tribute to Endre Csáki and Pál Révész

Summary This article provides a glimpse of some of the highlights of the joint work of Endre Csáki and Pál Révész since 1979. The topics of this short exploration of the rich stochastic milieu of this inspiring collaboration revolve around Brownian motion, random walks and their long excursions, local times and additive functionals, iterated processes, almost sure local and global central limit theorems, integral functionals of geometric stochastic processes, favourite sites--favourite values and jump sizes for random walk and Brownian motion, random walking in a random scenery, and large void zones and occupation times for coalescing random walks.     

A remark on divisibility of definable groups

We show that if G is a definably compact, definably connected definable group defined in an arbitrary o‐minimal structure, then G is divisible. Furthermore, if G is defined in an o‐minimal expansion of a field, k ∈ ? and p_k : G → G is the definable map given by p_k (x ) = x^k for all x ∈ G , then we have |(p_k )^–1(x )| ≥ k^r for all x ∈ G , where r > 0 is the maximal dimension of abelian definable subgroups of G . (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the spectral norm of algebraic numbers

In this paper we continue to study the spectral norms and their completions ([4]) in the case of the algebraic closure $ \overline {\mathbb Q} $ of ? in ?. Let $ \widetilde{\overline{\mathbb{Q}}} $ be the completion of $ \overline {\mathbb Q} $ relative to the spectral norm. We prove that $ \widetilde{\overline{\mathbb{Q}}} $ can be identified with the R‐subalgebra of all symmetric functions of C(G), where C(G) denotes the ?‐Banach algebra of all continuous functions defined on the absolute Galois group G = Gal$ {\overline {\mathbb Q}} / {\mathbb Q} $. We prove that any compact, closed to conjugation subset of ? is the pseudo‐orbit of a suitable element of $ \widetilde{\overline{\mathbb{Q}}} $. We also prove that the topological closure of any algebraic number field in $ \widetilde{\overline{\mathbb{Q}}} $ is of the form $\widetilde{\mathbb{Q}[x]}$ with x in $ \widetilde{\overline{\mathbb{Q}}} $.     

Optimal entropic uncertainty relation for successive measurements in quantum information theory

We derive an optimal bound on the sum of entropic uncertainties of two or more observables when they are sequentially measured on the same ensemble of systems. This optimal bound is shown to be greater than or equal to the bounds derived in the literature on the sum of entropie uncertainties of two observables which are measured on distinct but identically prepared ensembles of systems. In the case of a two-dimensional Hilbert space, the optimum bound for successive measurements of two-spin components, is seen to be strictly greater than the optimal bound for the case when they are measured on distinct ensembles, except when the spin components are mutually parallel or perpendicular     

Synthesis of molecular imprinted organic-inorganic hybrid polymer binding caffeine

Random copolymers of poly{(methacrylamide)-co-(vinyl trimethoxysilane)} and poly{(methacrylic acid)-co-(vinyl trimethoxysilane)} were synthesized via a free radical polymerization reaction. Acid catalyzed sol-gel process of tetraethylorthosilicate (TEOS) with aforementioned polymers in the presence of methyl xanthine class of alkaloid like caffeine resulted in the formation of highly transparent monoliths. Solvent extraction of the template leaves behind the recognition sites intact with high selectivity towards the print molecule. The ionic and non-specific adsorptions, which are considered to be the main disadvantages of the molecularly imprinted polymers (MIP), are prevented to a considerable extent by the end capping of surface silanol groups. The template binding efficiencies of MIP were determined by HPLC analysis.     

Stationary entanglement between macroscopic mechanical oscillators

We show that the optomechanical coupling between an optical cavity mode and two movable cavity mirrors is able to entangle two different macroscopic oscillation modes of the mirrors. This continuous variable entanglement is maintained by the light bouncing between the mirrors and is robust against thermal noise. In fact, it could be experimentally demonstrated using present technology. Received 2 September 2002 / Received in final form 10 October 2002 Published online 7 January 2003     

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.