Discrete quantum phase spaces and the mod N invariance

An extended Weyl-Wigner transformation which maps operators onto periodic discrete quantum phase space representatives is discussed in which a mod N invariance is explicitly implemented. The relevance of this invariance for the mapped expression of products of operators is discussed. © 1992.

Strong-weak Stackelberg Problems in Finite Dimensional Spaces

We are concerned with two-level optimization problems called strongweak Stackelberg problems, generalizing the class of Stackelberg problems in the strong and weak sense. In order to handle the fact that the considered two-level optimization problems may fail to have a solution under mild assumptions, we consider a regularization involving ε-approximate optimal solutions in the lower level problems. We prove the existence of optimal solutions for such regularized problems and present some approximation results when the parameter ǫ goes to zero. Finally, as an example, we consider an optimization problem associated to a best bound given in [2] for a system of nondifferentiable convex inequalities.

Embedded cell model of three-dimensional two-phase composites

An embedded cell model is presented to obtain the effective elastic moduli and the elastic-plastic stress-strain relations of three-dimensional two-phase particulate composites. Each cell consists of an ellipsoidal inclusion surrounded by a finite ellipsoidal matrix that embedded in an infinite matrix. When both matrix and particle are elastic, the effective elastic moduli are derived which is an exact analytic formula without any simplified approximation that can be expressed in an explicit form. Further, the elastic-plastic stress-strain relations are obtained for spherical cells and oblate spheroid cells, in which the matrix is elastic and the particle is elastic-plastic. In addition, the macroscopic elastic-plastic constitutive relation of particle reinforced composites (PRC) is investigated by a systematic approach [1] in which the matrix is elastic-plastic and the particle is elastic.

Discrete phase-locked loop systems and spreadsheets

This paper demonstrates the use of a spreadsheet in exploring non-linear difference equations that describe digital control systems used in radio engineering, communication and computer architecture. These systems, being the focus of intensive studies of mathematicians and engineers over the last 40 years, may exhibit extremely complicated behaviour interpreted in contemporary terms as transition from global asymptotic stability to chaos through period-doubling bifurcations. The authors argue that embedding advanced mathematical ideas in the technological tool enables one to introduce fundamentals of discrete control systems in tertiary curricula without learners having to deal with complex machinery that rigorous mathematical methods of investigation require. In particular, in the appropriately designed spreadsheet environment, one can effectively visualize a qualitative difference in the behviour of systems with different types of non-linear characteristic.

Application of Three-Dimensional Discrete Element Face-to-Face Contact Model with Fissure Water Pressure to Stability Analysis of Landslide in Panluo Iron Mine

Three-dimensional discrete element face-to-face contact model with fissure water pressure is established in this paper and the model is used to simulate three-stage process of landslide under fissure water pressure in the opencast mine, according to the actual state of landslide in Panluo iron mine where landslide happened in 1990 and was fathered in 1999. The calculation results show that fissure water pressure on the sliding surface is the main reason causing landslide and the local soft interlayer weakens the stability of slope. If the discrete element method adopts the same assumption as the limit equilibrium method, the results of two methods are in good agreement; while if the assumption is not adopted in the discrete element method, the critical phi numerically calculated is less than the one calculated by use of the limit equilibrium method for the same C. Thus, from an engineering point of view, the result from the discrete element model simulation is safer and has more widely application since the discrete element model takes into account the effect of rock mass structures.

High-power laser beam shaping by inseparable two-dimensional binary-phase gratings for surface modification of stamping dies

For surface modification of stamping dies, an inseparable two-dimensional binary-phase gratings is introduced to implement the wavefront transformation of high-power laser beams. The design and fabrication of the gratings are described in detail. Two-dimensional even sampling encoding scheme is adopted to overcome the limitations of conventional Dammann grating in the design of two-dimensional output patterns. High diffractive efficiency (>70%) can be achieved through the transformation of the Gaussian laser beam into several kinds of two-dimensional arrays in focal plan. The application of the binary-phase gratings in the laser surface modification of ductile iron is investigated, and the results show that the hardness and the wear resistance of the sample surface were improved significantly by using the binary-phase gratings. (C) 2008 Elsevier Ltd. All rights reserved.

Convex Relaxation for Low-Dimensional Representation: Phase Transitions and Limitations

There is a growing interest in taking advantage of possible patterns and structures in data so as to extract the desired information and overcome the curse of dimensionality. In a wide range of applications, including computer vision, machine learning, medical imaging, and social networks, the signal that gives rise to the observations can be modeled to be approximately sparse and exploiting this fact can be very beneficial. This has led to an immense interest in the problem of efficiently reconstructing a sparse signal from limited linear observations. More recently, low-rank approximation techniques have become prominent tools to approach problems arising in machine learning, system identification and quantum tomography.

In sparse and low-rank estimation problems, the challenge is the inherent intractability of the objective function, and one needs efficient methods to capture the low-dimensionality of these models. Convex optimization is often a promising tool to attack such problems. An intractable problem with a combinatorial objective can often be "relaxed" to obtain a tractable but almost as powerful convex optimization problem. This dissertation studies convex optimization techniques that can take advantage of low-dimensional representations of the underlying high-dimensional data. We provide provable guarantees that ensure that the proposed algorithms will succeed under reasonable conditions, and answer questions of the following flavor:

More specifically, i) Focusing on linear inverse problems, we generalize the classical error bounds known for the least-squares technique to the lasso formulation, which incorporates the signal model. ii) We show that intuitive convex approaches do not perform as well as expected when it comes to signals that have multiple low-dimensional structures simultaneously. iii) Finally, we propose convex relaxations for the graph clustering problem and give sharp performance guarantees for a family of graphs arising from the so-called stochastic block model. We pay particular attention to the following aspects. For i) and ii), we aim to provide a general geometric framework, in which the results on sparse and low-rank estimation can be obtained as special cases. For i) and iii), we investigate the precise performance characterization, which yields the right constants in our bounds and the true dependence between the problem parameters.

Some generalizations of commutativity for linear transformations on a finite dimensional vector space

Let L be the algebra of all linear transformations on an n-dimensional vector space V over a field F and let A, B, ƐL. Let A_i+1 = A_iB - BA_i, i = 0, 1, 2,…, with A = A_o. Let f_k (A, B; σ) = A_2K+1 - ^σ1^A2K-1 ^{+ σ}2^A2K-3 -… +(-1)^Kσ_KA₁ where σ = (σ₁, σ₂,…, σ_K), σ_i belong to F and K = k(k-1)/2. Taussky and Wielandt [Proc. Amer. Math. Soc., 13(1962), 732-735] showed that f_n(A, B; σ) = 0 if σ_i is the i^th elementary symmetric function of (β₄- β_s)², 1 ≤ r ˂ s ≤ n, i = 1, 2, …, N, with N = n(n-1)/2, where β₄ are the characteristic roots of B. In this thesis we discuss relations involving f_k(X, Y; σ) where X, Y Ɛ L and 1 ≤ k ˂ n. We show: 1. If F is infinite and if for each X Ɛ L there exists σ so that f_k(A, X; σ) = 0 where 1 ≤ k ˂ n, then A is a scalar transformation. 2. If F is algebraically closed, a necessary and sufficient condition that there exists a basis of V with respect to which the matrices of A and B are both in block upper triangular form, where the blocks on the diagonals are either one- or two-dimensional, is that certain products X₁, X₂…X_r belong to the radical of the algebra generated by A and B over F, where X_i has the form f₂(A, P(A,B); σ), for all polynomials P(x, y). We partially generalize this to the case where the blocks have dimensions ≤ k. 3. If A and B generate L, if the characteristic of F does not divide n and if there exists σ so that f_k(A, B; σ) = 0, for some k with 1 ≤ k ˂ n, then the characteristic roots of B belong to the splitting field of g_k(w; σ) = w^2K+1 - σ₁w^2K-1 + σ₂w^2K-3 - …. +(-1)^K σ_Kw over F. We use this result to prove a theorem involving a generalized form of property L [cf. Motzkin and Taussky, Trans. Amer. Math. Soc., 73(1952), 108-114]. 4. Also we give mild generalizations of results of McCoy [Amer. Math. Soc. Bull., 42(1936), 592-600] and Drazin [Proc. London Math. Soc., 1(1951), 222-231].