单片机双机并行通信中所遇问题及解决方法

本文主要介绍由单片机组成双机系统在并行通信中所遇到的问题以及采用ATF1504AS的原因及实现的方法。详细介绍系统的设计目的、结构、采取的抗干扰性措施、软硬件实现的方法等。     

A bandwidth latency tradeoff for broadcast and reduction

The “fractional tree” algorithm for broadcasting and reduction is introduced. Its communication pattern interpolates between two well known patterns—sequential pipeline and pipelined binary tree. The speedup over the best of these simple methods can approach two for large systems and messages of intermediate size. For networks which are not very densely connected the new algorithm seems to be the best known method for the important case that each processor has only a single (possibly bidirectional) channel into the communication network.     

智能型超声波钢轨探伤仪

文中介绍采用三片单片机设计的新型智能STG-2000型超声波钢轨探伤仪。它具有全数字式控制、便携性好、低功耗、高速动态检测、实时报警、整体操作简便等特点。由于内核采用三片兼容MCS-5l单片机构造的多机并行系统，这个产品使超声波钢轨探伤工作提高到了一个新的水平。     

Parallel processing circuit of line image using neuristor

A simultaneous detecting circuit system of centers and lengths of some lines in one dimension is presented applying an electronic circuit model of the nervous axon with respect to signal transmission. This model consists of series of one basic section, and has functions of Neuristor. The circuit system has a paralell processing function. It is constructed by three layers. In the first layer each visual signal of lines is changed to electric pulse signal. In the second layer edges of each line are detected, and in the third layer these detected signals are converted into voltages which correspond to lengths of the lines. These functions were confirmed experimentally using its hardware.     

Y3系列电机计算机辅助工艺设计系统

研究开发用于Y3系列异步电机的计算机辅助工艺设计系统,生成主要零部件的工艺规程(机械加工工艺过程卡),工艺文件目录,检验规范等.     

Parallelization of a multi-blocked CFD code via three strategies for fluid flow and heat transfer analysis

This paper reports on a parallel implementation of a general 3D multi-block CFD code. The parallelization is achieved by using three strategies. Firstly, it is done on dual-processor PC-clusters where Windows NT systems are running. A multi-thread programming model is adopted for the multi-block code, where one thread corresponds to a block. Shared-memory is used for the exchange of inner-boundaries between neighboring blocks (threads) on the same node, while WinSockets are employed for those on different nodes. Secondly, the parallelization is extended to UNIX operating system. MPI is applied for all the message passing between different processors, including those on the same node. Thirdly, Pthreads (POSIX threads), a standardized application interface for threads, are adopted to take the advantage of the shared-memory feature of the SMP nodes, while MPI is only applied for the message passing between processors on different nodes. In all the strategies, a static load-balancing method is employed for equitable distribution of computational work to specified nodes. The parameters of the present code is studied in detail to facilitate the explanation of the speedup results. Two examples are provided to show the speedup and load balancing of the parallel calculation. Detailed comparison is made to evaluate the efficiency of different strategies.     

A functional correspondence between call-by-need evaluators and lazy abstract machines

We bridge the gap between compositional evaluators and abstract machines for the lambda-calculus, using closure conversion, transformation into continuation-passing style, and defunctionalization of continuations. This article is a followup of our article at PPDP 2003, where we consider call by name and call by value. Here, however, we consider call by need.We derive a lazy abstract machine from an ordinary call-by-need evaluator that threads a heap of updatable cells. In this resulting abstract machine, the continuation fragment for updating a heap cell naturally appears as an ‘update marker’, an implementation technique that was invented for the Three Instruction Machine and subsequently used to construct lazy variants of Krivine's abstract machine. Tuning the evaluator leads to other implementation techniques such as unboxed values. The correctness of the resulting abstract machines is a corollary of the correctness of the original evaluators and of the program transformations used in the derivation.     

A simulated annealing algorithm for multi-agent systems: a job-shop scheduling application

In this paper, a parallel implementation of the modular simulated annealing algorithm for classical job-shop scheduling is presented. The implementation is for a multi agent system running on the distributed resource machine, which is a novel, scalable, distributed virtual machine based on Java technology. The problems tackled are well known, difficult benchmarks, widely used to measure the efficiency of metaheuristics with respect to both the quality of the solutions and the central processing unit time. The empirical results obtained show that the method proposed is successful in comparison with a sequential version of modular simulated annealing algorithm and other methods described in the literature.     

基于极端学习机的MANET移动性预测模型

针对移动自组织网络移动性在管理无线网络带宽资源可用性方面的重要性,为了更好地规划连续服务可用性和有效能源管理以提升网络的整体服务质量,提出了一种基于极端学习机的MANET移动性预测模型。利用ELM对MANET中的任意节点进行建模;假设已知每个移动节点当前的移动性信息（位置、速度和运动方向角度）,以这种方式预测节点未来的位置和相邻节点之间未来的距离;基于几个标准移动性模型,产生更加真实、精确的移动性预测,从而更好地捕捉任意节点直角坐标系之间现有交互/相关性。使用标准移动性模型的仿真结果验证了所提模型的有效性,实验结果表明,提出的预测模型明显改进了传统基于多层感知器的模型,此外,当预测相邻节点之间未来距离时,避免了当前算法对预测精度的限制。     

企业海量数据库的优化

当前大多数企业应用软件都需要数据库支持, 而且数据库的规模在不断扩大, 尤其用到数据仓库技术的商业智能化支持系统。面对大数据量, 企业级应用的性能愈来愈依赖数据库的性能。对数据库性能要素进行全面的描述和分析, 以便对数据库的选择、应用和基于数据库的二次开发提供工程参考。