有色金属冶炼厂回转干燥窑分布式控制系统

对于锌湿法冶炼过程中的回转干燥窑控制问题,本文提出一种温度场控制方案,它由负压控制、温度和煤气流量串级控制以及含氧量控制来实现。基于这个控制方案,一个回转干燥窑分布式控制系统已经建立在某有色金属冶炼厂。本文介绍控制系统设计中使用的理论和技术。     

190区超形变核中转动带的组态结构

通过系统研究A～190区超形变核中转动带的转动惯量、角动量顺排、旋称分裂随转动频率的变化规律, 结合我们用处理对力的粒子数守恒方法的计算结果, 对A～190区所有转动带的组态结构给出了一个整体的描述. 绝大多数超形变带都建立在强耦合轨道上, 例如中子[512]5/2, [624]9/2. 少数超形变带则建立在高j闯入轨道上, 即中子[761]3/2, [752]5/2. 根据我们提出的组态结构所进行的理论计算结果表明, A～190区所有转动带的一般行为、反常变化和带交叉都得到了满意的解释.     

Collaborative distributed decision making for large scale disaster relief operations: Drawing analogies from robust natural systems

One of the most ignored, but urgent and vital challenges confronting society today is the vulnerability of urban areas to extreme events. Current organization of response systems, predominantly based on a command and control model, limits their effectiveness and efficiency. Particularly, in decision‐making processes where a large number of actors may be involved. In this article, a new distributed collaborative decision‐making model is proposed to overcome command and control limitations encountered in stressful, hostile, chaotic, and large‐scale settings. This model was derived by borrowing concepts from the collective decision making of honeybees foraging, a successful process in solving complex tasks within complex settings. The model introduced in this article was evaluated through differential equations, i.e., continuous analysis, and difference equations, i.e., discrete analysis. The most important result found is that the best available option in any large‐scale decision‐making problem can be configured as an attractor, in a distributed and timely manner. We suggest that the proposed model has the potential to facilitate decision‐making processes in large‐scale settings. © 2005 Wiley Periodicals, Inc. Complexity 11:28–38, 2005     

清华物理系量子信息研究的新进展

在清华大学物理系成立60周年之际,我们对近年来清华大学物理系量子信息研究的主要进展情况作一介绍,包括量子搜索算法研究,核磁共振量子计算的实验研究,量子通讯的理论与实验研究.在量子搜索算法研究方面,我们提出了量子搜索算法的相位匹配,纠正了当时的一种错误观点,并且提出了一种成功率为100%的量子搜索算法,改进了Grover算法;在核磁共振量子计算实验方面,我们实现了2到7个量子比特的多种量子算法的实验演示;在量子通讯方面,我们提出了分布式传输的量子通讯的思想,应用于量子密钥分配、量子秘密共享、量子直接安全通讯等方面,构造了多个量子通讯的理论方案.在实验室,我们实现了2米距离的空间量子密码通讯的演示实验.     

辽宁男排跳发球技术分析

跳发球是现代排球比赛中一项攻击力很强的发球技术,为当今世界强队所广泛采用.采用高速摄影法和影片解析法,对在1997~1998年和1998~1999年全国排球联赛中两次获得最佳发球奖的李铁鸣的跳发球技术进行运动学分析,旨在揭示其技术的运动学特征,探讨影响动作效果的有关因素,为今后的教学和训练提供参考.     

Randomization helps to perform independent tasks reliably

This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

RATTI“R362/S”倍捻机导丝机构往复动程的分析

本文对“R362/S”倍捻机卷绕头往复导丝机构行程缩短原理进行了分析和数值计算,得出了导丝动程缩短规律。通过分析指出了一些在设计上值得我们借鉴的优点,并提出了某些改进的设想。     

On the properties of solutions to the Goursat-Darboux problem with boundary and distributed controls

We consider a control system described by the Goursat-Darboux equation. The system is controlled by distributed and boundary controls. The controls are subject to the constraints given as multivalued mappings with closed, possibly nonconvex, values depending on the phase variable. Alongside the initial constraints, we consider the convexified constraints and the constraints whose values are the extreme points of the convexified constraints. We study the questions of existence of solutions and establish connections between the solutions under various constraints.     

Asymptotics in the Baum—Katz formula for random fields

In 1996, D. Deng established an analog of the Baum—Katz theorem on the convergence rate in the law of large numbers for multi-indexed random variables. The series describing the convergence rate depends, in a natural way, on the parameter characterizing the excess of the normalized sums over some level. In this paper, we find the precise asymptotics of the sum of this series with respect to the above-mentioned parameter. Thus, a generalization of a recent result due to A. Gut and A. Spataru is obtained.