Maximal contractions in Boolean algebras

In the present paper,the concepts of deductive element and maximal contraction are introduced in Boolean algebras,and corresponding theories of consistency and maximal contractions are studied.An algorithm principle is proposed to compute all maximal contractions for a consistent set with respect to its refutation in Boolean algebras.It is pointed out that the quotient algebra of the first-order language with respect to its provable equivalence relation constitutes a Boolean algebra,and hence the computation of R-contractions for closed formulas in first-order languages can be converted into the one in Boolean algebras proposed in this paper.Furthermore,the concept of basic element is introduced in Boolean algebras,which contributes to the definitions of clause and Horn clause transplanted from logic to a special type of Boolean algebras generated by basic elements.It is also pointed out that the computation of R-contractions for clauses in the classical propositional logic can be converted into the one in Boolean algebras generated by basic elements proposed in this paper.     

基于ARM处理器的现场总线协议转换网关的研究与开发

对Profibus-DP总线和CAN总线的协议帧结构以及数据传输方式进行了研究,提出现场总线协议转换的方法,并在此基础上进行协议转换网关的硬件和软件开发。为降低设计难度,提高系统性能,该网关采用基于ARM9内核的高性能处理器AT91RM9200作为主控芯片,并使用了专用的总线协议芯片SPC3与控制芯片SJA1000。实验结果表明,CAN总线设备可以成功接入到Profibus-DP总线中,各项性能指标都能达到设计要求,具有较高的实时性和可靠性。     

Complexity of synthesis of composite service with correctness guarantee

How to compose existing web services automatically and to guarantee the correctness of the design (e.g. temporal constraints specified by temporal logic LTL, CTL or CTL*) is an important and challenging problem in web services. Most existing approaches use the process in conventional software development of design, verification, analysis and correction to guarantee the correctness of composite services, which makes the composition process both complex and time-consuming. In this paper, we focus on the synthesis problem of composite service; that is, for a given set of services and correctness constraint specified by CTL or CTL* formula, a composite service is automatically constructed which guarantees that the correctness is ensured. We prove that the synthesis problem for CTL and CTL* are complete for EXPTIME and 2EXPTIME, respectively. Moreover, for the case of synthesis failure, we discuss the problem of how to disable outputs of environment (i.e. users or services) reasonably to make synthesis successful, which are also proved complete for EXPTIME and 2EXPTIME for CTL and CTL*, respectively.     

6LoWPAN在物联网中的应用仿真

提出了一种基于6LoWPAN的物联网总体方案,同时对协议中的Mesh字段进行了改进,然后在网络模拟环境下对本协议平均传输成功率、平均延迟时间的性能进行了比较分析,并在仿真环境中进行了实验验证工作。实验数据表明,改进后的协议具有更好的性能。     

协议宏功能在PLC串行通信中的应用

越来越多的自动化设备自身配置有串行通信接口（如自动化仪表、变频器、伺服驱动器等）,在工业控制现场与可编程逻辑控制（PLC）之间需要进行大量的数据传输,包括现场数据采集、设备的远程控制等。本文以欧姆龙中型CJ2系列PLC协议宏功能为例,比较以往串行通信功能,在可靠性、程序繁琐程度、调试方便性等几方面的优越性。     

基于模型设计的数字集群分组数据业务的实现

为解决数字集群通信系统中图像、视频等大数据业务的传输问题,深入分析数字集群空中接口协议栈的结构,重点研究分组数据业务提供者子网相关汇聚协议的结构和原理。基于模型设计方法设计该协议的相关功能模块,并进行编码实现。开发中使用IBM Rational Rhapsody这一基于UML建模的开发工具,使整个开发过程简洁而清晰。最后,通过对协议进行一致性测试,证明协议参数及流程符合数字集群通信系统协议标准。     

Kaman协议的形式化验证

Kaman协议是移动Ad Hoc网络安全认证机制,然而,协议设计者未对该协议的安全性作严格的形式化分析。协议复合逻辑PCL是验证协议安全属性的形式化方法,PCL逻辑能够简化协议安全分析过程。本文在协议复合逻辑PCL中描述Kaman协议并分析Kaman协议的安全属性,证明Kaman协议能够实现其安全目标。     

基于NS2的Ad-Hoc网络典型路由协议的研究与仿真

无线自组织网络是一种完全由无线节点或终端自主构成的通信网络,常用于需要紧急或临时搭建网络环境下应用,具有独立于固定基础设施、带宽有限和拓扑结构易变等特点.本文以Ad-HOC网络为研究内容,重点介绍了Ad-HOC网络的组网关键技术——路由协议,以网络仿真器NS2作为仿真平台,对比在不同移动节点数目和节点不同停留时间两种情...     

IPv6在矿井工业以太网中的应用研究

介绍了IPv6产生的背景和发展现状,阐述了IPv6应用于矿井工业以太网的发展趋势和研究方向,指出对于所有基于矿井工业以太网的硬件和软件的开发都应带有双协议栈,随着IPv6技术的成熟和普及再研发出只有IPv6协议栈的适用于煤矿的网络设备,如支持IPv6的防爆网络设备、组态软件以及相应的数据采集驱动设备、控制硬件等。     

主从式矿用组合开关通信系统的研究

介绍了3.3kV智能型矿用组合开关控制系统的拓扑结构和各模块工作原理;针对该控制系统对于通信可靠性和实时性的需求,提出了一种基于C8051F040单片机和RS485总线的主从式矿用组合开关通信系统设计方案,详细介绍了该通信系统的硬件设计、通信协议及上下位机之间通信的实现过程。测试结果表明,该通信系统数据传输准确可靠,实时性高。