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

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

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

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

平行线束法的仿射研究

用 3 个仿射图的投射方向构成 1 个仿射坐标系,同时也构成 1 个三棱锥,在此仿射坐标系中用球面三角重新研究由两个仿射图求第 3 个仿射图的投影作图理论 ——平行线束法。进一步还给出了由两个仿射图得到正投影的条件、由两个正投影得到第 3 个正投影的条件、以及由 V,H 两投影得到指定方向上的正投影的条件,简化了研究过程,得到了更简单的公式。     

射频板条CO_2激光器并联谐振技术的研究

本文利用周期性网络模型计算了射频板条CO2激光器电极的纵向电压分布．探讨了并联谐振技术在板条器件中获得成功运用的原因．提出了利用并联谐振技术进一步提高电压分布均匀性的两个途径．     

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     

绝对时钟智能控制器的研制

介绍了一种日常参数智能控制器的研制及研制过程中的几个重要问题的解决方法。特别是用于城市照明及美化城市的彩灯的开、关时间智能控制方面，给出了依据当地绝对时间、经度、纬度进行昼夜时间计算的方法，使之在不接光电传感器情况下可跟踪季节的昼夜变化。控制系统采用８９Ｃ２０５１单片机，配有时钟日历芯片ＤＳ１２８８７，系统体积小、功能强、可靠性高。     

DGPSL：A DISTRIBUTED GRAPHICS LIBRARY

ＤＧＰＳＬ：ＡＤＩＳＴＲＩＢＵＴＥＤＧＲＡＰＨＩＣＳＬＩＢＲＡＲＹＳｈｉＪｉａｏｙｉｎｇ；ＰａｎＺｈｉｇｅｎｇ；ＺｈｅｎｇＷｅｎｔｉｎｇＤＧＰＳＬ：ＡＤＩＳＴＲＩＢＵＴＥＤＧＲＡＰＨＩＣＳＬＩＢＲＡＲＹ￥ＳｈｉＪｉａｏｙｉｎｇ；ＰａｎＺｈｉｇｅｎｇ；...     

银河－Ⅱ气象应用并行库

本文着重介绍“银河－Ⅱ气象应用并行库”的设计思想、技术特点和使用方法。     

Efficient Parallel Algorithms for Some Graph Theory Problems

In this paper,a sequential algorithm computing the aww vertex pair distance matrix D and the path matrix Pis given.On a PRAM EREW model with p,1≤p≤n^2,processors,a parallel version of the sequential algorithm is shown.This method can also be used to get a parallel algorithm to compute transitive closure array A^* of an undirected graph.The time complexity of the parallel algorithm is O(n^3/p).If D,P and A^* are known,it is shown that the problems to find all connected components,to compute the diameter of an undirected graph,to determine the center of a directed graph and to search for a directed cycle with the minimum(maximum)length in a directed graph can all be solved in O(n^2/p logp)time.