基于RS485总线的监控系统研究与设计

PID调节仪表与传感器配合使用,可以实现对钢制品生产线上罩式炉温度的测量与显示。通过相应的执行器,可以实现对相关罩式炉设备的PID调节和控制、报警控制、数据采集和记录。然而对于具备多条生产线,而每条生产线使用多个PID调节仪表的现场环境而言,依次对每个仪表进行操作并不方便。采用Borland C++Builder 6设计了PID调节仪表的在线集中监控系统。,利用Borland C++Builder 6功能强大的图形化控制界面,及SPComm控件在串行口下编程,通过USB转RS485协议转换器,很好地实现了对生产线上各个分区仪表的实时监测与远程控制。     

固态数字语音记录仪的设计与实现

介绍一种固态数字语音记录仪的实现方案。它主要由ＤＳＰ最小系统、液晶显示模块、串行通信接口、键盘电路和片外闪烁存储器电路构成。实现语音信息的采集与播放,并且能够和笔记本电脑通过ＲＳ２３２串行口进行通信。     

基于单片机的轴承温度传感器设计

采用数字温度传感器LM75A配合单片机测温,通信接口使用了RS485芯片,E2PROM 24C02保存传感器的地址和波特率.电路结构紧凑,能够放到普通测温元件的外壳中,构成智能化RS485接口的轴承温度传感器.     

Tomcat应用系统乱码问题研究

由于Tomcat和Java对字符集的处理机制和中文编码有冲突,乱码是Tomcat应用系统开发人员经常遇到的问题。该文在论述字符集和字符编码以及java对字符编码的处理机制的基础上,探究了出现的乱码的原因并提出相应解决办法。     

手机短信模块在.NET平台下实现与应用

首先介绍了用于手机短信的串口通信、AT指令以及发送模式等相关知识,然后重点解析了手机短信的编码方法,包括7-bit编码和UCS2编码等,并给出了在.NET平台下用C#实现的主要代码。文章最后还描述了手机短信模块在某一个实际的监视系统中的集成与应用场景。     

Solving shortest path problem using particle swarm optimization

This paper presents the investigations on the application of particle swarm optimization (PSO) to solve shortest path (SP) routing problems. A modified priority-based encoding incorporating a heuristic operator for reducing the possibility of loop-formation in the path construction process is proposed for particle representation in PSO. Simulation experiments have been carried out on different network topologies for networks consisting of 15–70 nodes. It is noted that the proposed PSO-based approach can find the optimal path with good success rates and also can find closer sub-optimal paths with high certainty for all the tested networks. It is observed that the performance of the proposed algorithm surpasses those of recently reported genetic algorithm based approaches for this problem.     

Efficient Compositing Methods for the Sort-Last-Sparse Parallel Volume Rendering System on Distributed Memory Multicomputers

In the sort-last-sparse parallel volume rendering system on distributed memory multicomputers, one can achieve a very good performance improvement in the rendering phase by increasing the number of processors. This is because each processor can render images locally without communicating with other processors. However, in the compositing phase, a processor has to exchange local images with other processors. When the number of processors exceeds a threshold, the image compositing time becomes a bottleneck. In this paper, we propose three compositing methods to efficiently reduce the compositing time in parallel volume rendering. They are the binary-swap with bounding rectangle (BSBR) method, the binary-swap with run-length encoding and static load-balancing (BSLC) method, and the binary-swap with bounding rectangle and run-length encoding (BSBRC) method. The proposed methods were implemented on an SP2 parallel machine along with the binary-swap compositing method. The experimental results show that the BSBRC method has the best performance among these four methods.     

Local Encoding Transformations for Optimizing OBDD-Representations of Finite State Machines

Ordered binary decision diagrams are the state-of-the-art representation of switching functions. In order to keep the sizes of OBDDs tractable, heuristics and dynamic reordering algorithms are applied to optimize the underlying variable order. When finite state machines are represented by OBDDs the state encoding can be used as an additional optimization parameter. In this paper, we analyze local encoding transformations which can be applied dynamically. First, we investigate the potential of re-encoding techniques. We then propose the use of an XOR-transformation and show why this transformation is most suitable among the set of all encoding transformations. The presented theoretical framework establishes a new optimization technique for OBDDs.     

基于RS理论的过程企业生产工艺数据挖掘

在简要回顾了模糊控制、人工神经网络控制和粗糙控制的基本原理与特点之后,提出了运用RS理论对过程企业生产工艺数据进行挖掘以得到有关生产工艺过程控制规则的方法,用以辅助操作人员不断总结经验,提高操作水平,是上述智能控制方法的极好补充。     

Compositional pattern producing networks: A novel abstraction of development

Natural DNA can encode complexity on an enormous scale. Researchers are attempting to achieve the same representational efficiency in computers by implementing developmental encodings, i.e. encodings that map the genotype to the phenotype through a process of growth from a small starting point to a mature form. A major challenge in in this effort is to find the right level of abstraction of biological development to capture its essential properties without introducing unnecessary inefficiencies. In this paper, a novel abstraction of natural development, called Compositional Pattern Producing Networks (CPPNs), is proposed. Unlike currently accepted abstractions such as iterative rewrite systems and cellular growth simulations, CPPNs map to the phenotype without local interaction, that is, each individual component of the phenotype is determined independently of every other component. Results produced with CPPNs through interactive evolution of two-dimensional images show that such an encoding can nevertheless produce structural motifs often attributed to more conventional developmental abstractions, suggesting that local interaction may not be essential to the desirable properties of natural encoding in the way that is usually assumed.