On the complexity of simulating space-bounded quantum computations

This paper studies the space-complexity of predicting the long-term behavior of a class of stochastic processes based on evolutions and measurements of quantum mechanical systems. These processes generalize a wide range of both quantum and classical space-bounded computations, including unbounded error computations given by machines having algebraic number transition amplitudes or probabilities. It is proved that any space s quantum stochastic process from this class can be simulated probabilistically with unbounded error in space O(s), and therefore deterministically in space O(s²).     

数学专业方向设置的问题初探——基于广东工业大学数学专业优化与调整的七年实践

通过在广东工业大学数学专业7年的专业调整实践，探索了广东工业大学应用数学学院以信息科学、统计科学为数学专业方向的社会时代背景，说明了各个专业方向培养的侧重点和就业前景，阐明了传统学科专业与新增专业方向的联系与区别。     

Spectral multidomain approximation of elliptic problems with mixed conditions on the interfaces

The multidomain technique for elliptic problems, that allows the fulfillment of the interface conditions by means of a suitable combination of the continuity of the solution and of its normal derivative, is considered. Some choices of this combination are investigated and, in particular, a choice that allows the solution of the multidomain problem through two solutions for each subproblem, is proposed. The scheme has been discretized with a collocation method and some numerical tests are reported. Moreover the method is compared with the more classical Dirichlet/Neumann one as well as with the capacitance matrix method.This research has been supported by a grant from M.P.I. (40%).     

Power Dissipation in Spintronic Devices Out of Thermodynamic Equilibrium

Quantum limits of power dissipation in spintronic computing are estimated. A computing element composed of a single electron in a quantum dot is considered. Dynamics of its spin due to external magnetic field and interaction with adjacent dots are described via the Bloch equations. Spin relaxation due to magnetic noise from various sources is described as coupling to a reservoir. Resulting dissipation of energy is calculated and is shown to be much less than the thermal limit, ∼kT per bit, if the rate of spin relaxation is much slower than the switching rate. Clues on how to engineer an energy efficient spintronic device are provided.     

Axisymmetric extrusion through adaptable dies—Part 1: Flexible velocity fields and power terms

An adaptable die is one that not only produces the correct geometrical shape, but also is designed through an adaptable method to impart other desirable properties to the product or process. In this first part of a series of papers, six kinematically admissible velocity fields are developed for use in upper bound models for axisymmetric extrusion through various dies, including extrusion through adaptable dies. Three base velocity fields are presented:

(1) assuming proportional angles in the deformation zone,

(2) assuming proportional areas in the deformation zone, or

(3) assuming proportional distances from the centerline in the deformation zone.

The base velocity is modified by an additional term comprised of two functions. One function allows extra flexibility in the radial direction, and the second function allows extra flexibility in the angular direction. There are two forms of the second function, which meet the required boundary conditions. The flexibility function in the radial direction is represented by a series of Legendre polynomials, which are orthogonal over the deformation region. The power terms derived for these velocity fields for use in upper bound models are also presented.Part 2 of this series compares the results obtained in upper bound models for the six velocity fields for a spherical extrusion die. In Part 3, the use of the best velocity field for extrusion through streamlined dies is developed to determine the adaptable die shape, which minimizes the required extrusion pressure. Additionally, the adaptable die shape is compared with results from Yang and Han for arbitrarily curved and streamlined dies.     

壳体理论在水压爆破中的应用

在壳体理论的基础上,考虑到薄壳型结构水压爆破的特点,提出了一种新的药量计算公式,并得到了初步实际工程验证.     

Tight upper bound on the number of edges in a bipartite K3,3-free or K5-free graph with an application

We show that an n-vertex bipartite K_3,3-free graph with n?3 has at most 2n−4 edges and that an n-vertex bipartite K₅-free graph with n?5 has at most 3n−9 edges. These bounds are also tight. We then use the bound on the number of edges in a K_3,3-free graph to extend two known NC algorithms for planar graphs to K_3,3-free graphs.     

Cryptography and cryptographic protocols

We survey the paradigms, approaches and techniques used to conceptualize, define and provide solutions to natural cryptographic problems. We start by presenting some of the central tools (e.g., computational difficulty, pseudorandomness, and zero-knowledge proofs), and next turn to the treatment of encryption and signature schemes. We conclude with an extensive treatment of secure cryptographic protocols both when executed in a stand-alone manner and when many sessions of various protocols are concurrently executed and controlled by an adversary. The survey is intended for researchers in distributed computing, and assumes no prior familiarity with cryptography.Received: June 2001, Accepted: July 2002,     

一种新的基于极大似然估计的系统辨识方法

进化计算是一种基于自然选择和自然变异机制的并行随机优化算法。由于递推极大似然估计法难以实现性能指标函数的全局寻优，所以本文提出了将改进的进化计算用于系统参数辨识的方法。计算机仿真结果表明，该算法能够实现似然函数的全局寻优。     

Software tools for micro-analysis of programs

The paper proposes and describes several tools enabling their user to estimate the efficiency of Pascal or C-like programs. The approach consists of generating symbolic formulas expressing the efficiency of the programs being analyzed. The formulas are applicable to a variety of compiler-machine configurations. The actual numeric values of the variables in the symbolic formula are determined using linear programming techniques. The proposed approach reduces considerably the amount of benchmarking needed to analyze programs. Several examples are presented showing the applicability of the tools. The effort necessary to implement them is considerably reduced by the combined usage of Prolog and a symbolic formula manipulation package (Maple).