基于三维胞元空间的MA双向并行路由算法

针对传统移动代理(MA)在监测无线传感器网络(WSNs)的感兴趣信息时产生的延迟较大和能耗较多问题,提出了基于三维胞元空间的MA双向并行(3D-BPMA)路由算法.3D-BPMA将MA与传统的客户/服务器(c/S)模式相结合,在胞元内利用C/S模式搜集信息,在单层胞元系统和路由器与路由器之间采用MA双向并行的策略进行传输.仿真结果表明:3D-BPMA与LCF,DSG-MIP算法相比减少了平均响应时间和网络平均能耗,提高了MA发送率.     

Mixed coordination mechanisms for scheduling games on hierarchical machines

In this paper, we study scheduling games under mixed coordination mechanisms on hierarchical machines. The two scheduling policies involved are ‐ and ‐, where ‐ (resp., ‐) policy sequences jobs in nondecreasing order of their hierarchies, and jobs of the same hierarchy in nonincreasing (resp., nondecreasing) order of their processing times. We first show the existence of a Nash equilibrium. Then we present the price of anarchy and the price of stability for the games with social costs of minimizing the makespan and maximizing the minimum machine load. All the bounds given in this paper are tight.     

离心泵并联运行工况点的数值求解

建立了求解多台不同型号离心泵并联运行工况点的数学模型,给出了用数值计算中的“二分法”求解该模型的方法,并附有用Exce l计算的实例。     

宽带DDS跳频源设计

直接数字合成（DDS）简单可靠、控制方便，具有很高的频率分辨率，高速转换，非常适合快速跳频的要求。在对DDS基本原理进行了简要介绍和分析后，提出宽带跳频源设计方案。     

串行及并行A/D转换器在高速数据采集中的采样差别性分析

串行和并行接口模式是A/D转换器诸多分类中的一种,但却是应用中器件选择的一个重要指标.在同样的转换分辨率及转换速度的前提下,不同的接口方式不但影响了电路结构,更重要的是将在高速数据采集的过程中对采样周期产生较大影响.本文通过12位串行ADC ADS7822和并行ADC ADS774与AT89C51的接口电路,给出二者采样时间的差异性.     

医用激光治疗机的触摸屏控制系统设计

介绍了医用红宝石激光器触摸屏控制系统的基本结构，分析了医用红宝石激光器中主要电磁干扰（EMI）的产生机制，提出了具体的电磁兼容（EMC）技术措施并得到实验验证。     

自喷井电动清蜡绞车的研制

针对目前石油钻采用清蜡绞车总体结构设计不合理以及实用性不强等技术难题,研制开发了自喷井电动清蜡绞车。该绞车的核心部件包括过载保护安全装置、牙嵌离合器轴套、自动/手动互换装置、计量装置以及密封装置。在清蜡绞车自动工作中,当清蜡刮刀遇到较大阻力时,清蜡绞车将接收到反馈信号,可实现智能停车,自动转换为手动状态,以便操作人员检查和排除故障,从而确保了操作的安全性,延长了设备的使用寿命。1000余台电动清蜡绞车的现场应用表明,该产品可以大大降低原油的开采成本,具有良好的经济效益和社会效益。     

可并联逆变器中的同步控制技术及其实现

论述了可并联逆变器中的同步控制技术及其实现方法。在分析了同步的重要性之后，提出了抢占与并发相结合的同步控制策略及其实现方法，实践证明该方法具有很高的控制精度。     

A survey of parallel execution strategies for transitive closure and logic programs

An important feature of database technology of the nineties is the use of parallelism for speeding up the execution of complex queries. This technology is being tested in several experimental database architectures and a few commercial systems for conventional select-project-join queries. In particular, hash-based fragmentation is used to distribute data to disks under the control of different processors in order to perform selections and joins in parallel. With the development of new query languages, and in particular with the definition of transitive closure queries and of more general logic programming queries, the new dimension of recursion has been added to query processing. Recursive queries are complex; at the same time, their regular structure is particularly suited for parallel execution, and parallelism may give a high efficiency gain. We survey the approaches to parallel execution of recursive queries that have been presented in the recent literature. We observe that research on parallel execution of recursive queries is separated into two distinct subareas, one focused on the transitive closure of Relational Algebra expressions, the other one focused on optimization of more general Datalog queries. Though the subareas seem radically different because of the approach and formalism used, they have many common features. This is not surprising, because most typical Datalog queries can be solved by means of the transitive closure of simple algebraic expressions. We first analyze the relationship between the transitive closure of expressions in Relational Algebra and Datalog programs. We then review sequential methods for evaluating transitive closure, distinguishing iterative and direct methods. We address the parallelization of these methods, by discussing various forms of parallelization. Data fragmentation plays an important role in obtaining parallel execution; we describe hash-based and semantic fragmentation. Finally, we consider Datalog queries, and present general methods for parallel rule execution; we recognize the similarities between these methods and the methods reviewed previously, when the former are applied to linear Datalog queries. We also provide a quantitative analysis that shows the impact of the initial data distribution on the performance of methods. Recommended by: Patrick Valduriez