量子计算与超冷离子

通过介绍量子计算的基本概念和特点，并对比目前人们使用的计算机的计算方式，对于如何利用囚禁在离子阱中的超冷离子进行量子计算作了简要的叙述．     

On Binary Computation Structures

Based on a modification of Moss' and Parikh's topological modal language [8], we study a generalization of a weakly expressive fragment of a certain propositional modal logic of time. We define a bimodal logic comprising operators for knowledge and nexttime. These operators are interpreted in binary computation structures. We present an axiomatization of the set T of theorems valid for this class of semantical domains and prove – as the main result of this paper – its completeness. Moreover, the question of decidability of T is treated.     

On the computation of scaling coefficients of Daubechies' wavelets

In the present paper, Daubechies' wavelets and the computation of their scaling coefficients are briefly reviewed. Then a new method of computation is proposed. This method is based on the work [7] concerning a new orthonormality condition and relations among scaling moments, respectively. For filter lengths up to 16, the arising system can be explicitly solved with algebraic methods like Gröbner bases. Its simple structure allows one to find quickly all possible solutions.     

The emergence of dynamical complexity: An exploration using elementary cellular automata

This work concerns the interaction between two classical problems: the forecasting of the dynamical behaviors of elementary cellular automata (ECA) from its intrinsic mathematical laws and the conditions that determine the emergence of complex dynamics. To approach these problems, and inspired by the theory of reversible logical gates, we decompose the ECA laws in a “spectrum” of dyadic Boolean gates. Emergent properties due to interactions are captured generating another spectrum of logical gates. The combined analysis of both spectra shows the existence of characteristic bias in the distribution of Boolean gates for ECA belonging to different dynamical classes. These results suggest the existence of signatures capable to indicate the propensity to develop complex dynamics. Logical gates “exclusive‐or” and “equivalence” are among these signatures of complexity. An important conclusion is that within ECA space, interactions are not capable to generate signatures of complexity in the case these signatures are absent in the intrinsic law of the automaton. © 2004 Wiley Periodicals, Inc. Complexity 9: 33–42, 2004     

Asymptotic Correction of More Sturm–Liouville Eigenvalue Estimates

The asymptotic correction technique of Paine, de Hoog and Anderssen can dramatically improve the accuracy of finite difference or finite element eigenvalues at negligible extra cost if closed form expressions are available for the errors in a simpler related problem. This paper gives closed form expressions for the errors in the eigenvalues of certain Sturm–Liouville problems obtained by various methods, thereby increasing the range of problems for which asymptotic correction can achieve maximum efficiency. It also investigates implementation of the method for more general problems.     

在线滤波技术在光纤马赫-德尔交叉复用器中的应用

为构造出与理想梯形滤波器接近的滤波形状，在单级光纤马赫-德尔交叉复用器的基础上，引入在线滤波技术；通过增加干涉级数和调整2对干涉臂的干涉长度和耦合器的耦合比，实现了逼近宽带陡沿的滤波输出。通过与梯形滤波器傅里叶展开式的比较，计算得到了器件的最佳参数，器件的滤波性能以及温度稳定性相对于单级结构得到了明显提高。根据理论计算，成功制作出通道间隔为50GHz的样品器件。其输出为-0.5dB，带宽大于0.185nm，相邻通道隔离度大于30dB，满足了DWDM系统指标要求。     

Optimal control of unsteady compressible viscous flows

The control of complex, unsteady flows is a pacing technology for advances in fluid mechanics. Recently, optimal control theory has become popular as a means of predicting best case controls that can guide the design of practical flow control systems. However, most of the prior work in this area has focused on incompressible flow which precludes many of the important physical flow phenomena that must be controlled in practice including the coupling of fluid dynamics, acoustics, and heat transfer. This paper presents the formulation and numerical solution of a class of optimal boundary control problems governed by the unsteady two‐dimensional compressible Navier–Stokes equations. Fundamental issues including the choice of the control space and the associated regularization term in the objective function, as well as issues in the gradient computation via the adjoint equation method are discussed. Numerical results are presented for a model problem consisting of two counter‐rotating viscous vortices above an infinite wall which, due to the self‐induced velocity field, propagate downward and interact with the wall. The wall boundary control is the temporal and spatial distribution of wall‐normal velocity. Optimal controls for objective functions that target kinetic energy, heat transfer, and wall shear stress are presented along with the influence of control regularization for each case. Copyright © 2002 John Wiley & Sons, Ltd.     

分析非轴对称腔的复光线数值迭代法

将像散光束的复光线表示法用于分析非轴对称腔，并对有复杂像散的折迭腔作了数值迭代计算以说明方法的应用．     

A projection method for solving incompressible viscous flows on domains with moving boundaries

In this paper, a projection method is presented for solving the flow problems in domains with moving boundaries. In order to track the movement of the domain boundaries, arbitrary‐Lagrangian–Eulerian (ALE) co‐ordinates are used. The unsteady incompressible Navier–Stokes equations on the ALE co‐ordinates are solved by using a projection method developed in this paper. This projection method is based on the Bell's Godunov‐projection method. However, substantial changes are made so that this algorithm is capable of solving the ALE form of incompressible Navier–Stokes equations. Multi‐block structured grids are used to discretize the flow domains. The grid velocity is not explicitly computed; instead the volume change is used to account for the effect of grid movement. A new method is also proposed to compute the freestream capturing metrics so that the geometric conservation law (GCL) can be satisfied exactly in this algorithm. This projection method is also parallelized so that the state of the art high performance computers can be used to match the computation cost associated with the moving grid calculations. Several test cases are solved to verify the performance of this moving‐grid projection method. Copyright © 2004 John Wiley Sons, Ltd.     

Simple Constructions of Almost k-wise Independent Random Variables

We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in the sample space is (2 + o(1)) (log log n + k/2 + log k + log 1/?), where ? is the statistical difference between the distribution induced on any k bit locations and the uniform distribution. This is asymptotically comparable to the construction recently presented by Naor and Naor (our size bound is better as long as ? < 1/(k log n)). An additional advantage of our constructions is their simplicity.