Distributed match-making

In many distributed computing environments, processes are concurrently executed by nodes in a store- and-forward communication network. Distributed control issues as diverse as name server, mutual exclusion, and replicated data management involve making matches between such processes. We propose a formal problem called distributed match-making as the generic paradigm. Algorithms for distributed match-making are developed and the complexity is investigated in terms of messages and in terms of storage needed. Lower bounds on the complexity of distributed match-making are established. Optimal algorithms, or nearly optimal algorithms, are given for particular network topologies.The work of the second author was supported in part by the Office of Naval Research under Contract N00014-85-K-0168, by the Office of Army Research under Contract DAAG29-84-K-0058, by the National Science Foundation under Grant DCR-83-02391, and by the Defence Advanced Research Projects Agency (DARPA) under Contract N00014-83-K-0125. Current address of both authors: CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands.     

Majority gates vs. general weighted threshold gates

In this paper we study small depth circuits that contain threshold gates (with or without weights) and parity gates. All circuits we consider are of polynomial size. We prove several results which complete the work on characterizing possible inclusions between many classes defined by small depth circuits. These results are the following:

The quantifier structure of sentences that characterize nondeterministic time complexity

For every nondeterministic Turing machineM of time complexityT(n), there is a second-order sentence of a very restricted form, whose set of finite models encodes the set of strings recognized byM. Specifically, has a relational symbol which is interpreted as addition restricted to finite segments of the natural numbers, and a prefix consisting of existentially quantified unary second-order variables followed by a universal-existential first-order part. Here, every input stringx is encoded by a model of sizeT(|x|). Using a closely related encoding of strings as models where the size of the model is the length of the string, a consequence is that ifT(n)=n ^d, then there is a sentence with a similar prefix but whose second-order variables ared-ary and whose finite models encode the strings accepted byM. Potential applications to low-level complexity are discussed.     

A faster divide-and-conquer algorithm for constructing delaunay triangulations

An easily implemented modification to the divide-and-conquer algorithm for computing the Delaunay triangulation ofn sites in the plane is presented. The change reduces its (n logn) expected running time toO(n log logn) for a large class of distributions that includes the uniform distribution in the unit square. Experimental evidence presented demonstrates that the modified algorithm performs very well forn2¹⁶, the range of the experiments. It is conjectured that the average number of edges it creates—a good measure of its efficiency—is no more than twice optimal forn less than seven trillion. The improvement is shown to extend to the computation of the Delaunay triangulation in theL _p metric for 1<p.This research was supported by National Science Foundation Grants DCR-8352081 and DCR-8416190.     

An improved algorithm for finding the median distributively

Given two processes, each having a total-ordered set ofn elements, we present a distributed algorithm for finding median of these 2n elements using no more than logn +O(logn) messages, but if the elements are distinct, only logn +O(1) messages will be required. The communication complexity of our algorithm is better than the previously known result which takes 2 logn messages.     

岛上原油贮罐罐底边缘板腐蚀机理分析及防护措施

对马鞭洲岛广石化码头原油罐罐底边缘板腐蚀机理进行分析，并采取相应的防护措施。实践表明，对提高码头原油贮罐的安全使用寿命是有效的。     

基于l1范数相干度的量子态区分

为探究区分量子态的最优策略,以相干作为资源,利用附加辅助系统的方法来区分非正交量子态,并给出了l₁范数相干度与区分量子态的成功概率之间的数值关系,同时量化了某些特定情况下不出错的量子态区分(UQSD)的最优协议所需的l₁范数相干均值.本文的研究结果表明,通过调整生成的相干度可以提高区分量子态的成功几率.     

基于样本熵与时频分析的手部抓握运动意图预测

针对上肢外骨骼控制信号产生与外部设备响应存在时间滞后导致脑机接口(BCI)系统实时性差的问题,采集被试手部自主抓握前运动相关皮质电位(MRCP) ,提出基于非线性复杂度特征样本熵 (SampEn)与线性幅值特征融合算法的手部运动意图预测方法. 从时频、神经复杂度分析不同大脑状态之间存在的差异,通过特征融合实现对手部抓握运动意图的预测. 基于特征融合意图离线预测准确率最高可达88.46%,可以在人体手部自主运动发生时刻?1 400 ms实现对手部运动预测. 与平静时期手部静止状态相比,被试产生手部抓握运动意图时脑电信号的功率谱与复杂度均产生明显变化,为基于手部运动意图预测提前驱动机器人实现人机协同提供控制策略.     

两坐标数控立式铣削欠切现象及其防止

在两坐标数控立铣削加工中,欠切是常见的异常加工现象,严重的影响了加工质量及加工效率。文中将欠切现象归纳为工艺系统引起的欠切、数控系统功能引起的欠切、工艺安排及编程引起的欠切三个大类,分析了十五种主要欠切形成的原因,并提出了控制欠切的措施。     

水泥企业PLC控制系统的常见故障与处理

可编程序控制器(PLC)其性能可靠、性价比高、维护简便,在水泥生产控制中得到了广泛的应用。但使用中,因设计、使用或维护等方面原因,其电源模块、存储模块、输入输出模块及其外围线路会产生各类故障。结合故障实例,详细介绍和分析总结了PLC常见故障——电源故障、异常故障、通信故障、输入/输出回路故障、接线端子故障等等的现象、产生原因和处理措施。同时,总结了PLC系统的维护和保护的相关要求及技术措施。