混合仿人智能图式的无人艇自主驾控系统设计

针对高度动态、不可预测的海洋环境,开展了无人艇智能运动控制系统的设计研究.首先本文利用认知学科的"图式"概念来分析人体运动控制系统的结构,提出一种混合式分层递阶结构,把人类的先验知识、专家经验融入到该结构中,并在实践中不断学习和完善,则形成了一种混合仿人智能图式;然后根据该图式的思想,设计了自主驾控系统的体系结构,并编制成简单实用、逻辑性强、能实时运行的控制流程;最后进行了无人艇的航线跟踪和安全自主航行的半实物仿真试验,仿真结果表明该无人艇可以安全的避开其他船舶并尽量跟踪航线.     

基于模糊AHP的室内WSNs健康评估方法

无线传感器网络(WSNs)健康状况评估是保证WSNs正常运行、延长网络寿命的一种重要技术措施.基于模糊AHP提出一种室内WSNs健康状态评估方法,在构建评估层次结构模型和模糊互补判断矩阵的基础上求出各项评估指标的单项和综合权重,并给出WSNs健康评估综合指标--健康度.实验结果表明:该方法能够对WSNs健康状况进行定量、合理的综合评估.     

基于OpenTCP的单片机网络系统设计

提出了一种基于OpenTCP协议栈和单片机的嵌入式网络系统方案。分析了硬件设计方案,协议栈的移植方法以及设计上层应用程序的基本思路。     

10 kV真空开关智能控制器的研制

提出一种新型的10 kV真空开关智能控制器的设计方法,利用无线收发模块,通过比较各条线路"零序电流的相对量"来准确判断单相接地故障的具体发生位置,提高了智能控制器的智能化运行和控制水平,提高了单相接地故障判断的准确性.     

基于DSP和FPGA的实时图像压缩系统设计

提出了一种基于高频帧摄像头的高频帧实时图像压缩技术,以此技术为基础,使用TMS320CDM642和EP2C35 FPGA相结合,设计了一种高频帧实时图像处理器硬件系统.该系统采用2片SRAM乒乓结构,以及基于TI公司DSP/BIOS和支持XDAIS的JPEG2000压缩算法,实现了100帧/s的压缩速度,系统同时解决了图像压缩中容量和速度的问题,实验了采集和压缩过程的同步进行,大大提高了图像压缩速度.     

羧甲基纤维素交联缩合反应的动力学研究

本文研究了羧甲基纤维素和水溶性酚醛树脂的交联缩合动力学的测试方法并得到了该反应的动力学方程。因为水溶性酚醛树脂是多种活性中间体的混合物,羧甲基纤维素是受羧甲基取代度和聚合度影响的大分子,两者的交联缩合反应可以同时发生在多点、多分子之间,动力学研究较为复杂,所以本文分别采用Borchardt-Daniels模型和Kissinger模型方法,根据差示扫描量热仪(DSC)测定不同升温速率下的羧甲基纤维素和水溶性酚醛树脂交联缩合反应的热流曲线数据,计算得到反应动力学方程。利用非等温单一扫瞄速率法的Borchardt-Daniels模型得到的动力学参数为:反应级数n 1.05,反应活化能E 93.86kJ/mol,指前因子InA16.23。采用非等温多加热扫描速率法的Kissinger模型计算得到的动力学参数为:反应级数n 1.04,反应活化能E 94.37 kJ/mol,指前因子InA15.96。3个热力学参数值分别相差0.55%、1.71%和1.14%,证明2种模型计算结果较一致。水溶性酚醛树脂与羧甲基纤维素缩合交联缩合反应的动力学方程为(dα)/(dt)=e~(-16.24E/(RT))(1-α)~(1.05)。     

反浮选-冷结晶氯化钾生产过程中硫酸钙旋流分离数值模拟

为了研究用于氯化钾旋流分离的旋流芯管内部的流场,模拟粗光卤石矿中小颗粒硫酸钙的分离性能,采用Fluent软件,K-ε模型及雷诺应力模型(RSM),数值模拟旋流芯管内颗粒的流动,得其内部流场的轴向速度、切向速度、径向速度和压力分布规律,分析压力场和速度场的分离特征。通过与实验结果的比较,结果表明,上下出口物料中固体颗粒的粒度分布及物料流量与实验结果非常接近,且当进口物料浓度较高时,上出口物料对大颗粒的夹带明显,降低了分离效率。因此,设备放大时溢流口与底流口的直径设计对分离性能影响较大。     

PK301故障原因分析及改进措施

聚丙烯装置的关键设备PK301频繁故障停车,通过分析各类故障发生原因,着重解决气相带粉问题和分液罐除沫器结构,通过运行考核,机组实现了长周期运转实现长周期运行14个月不大修.     

Defining the meaning of tabular mathematical expressions

Mathematical expressions in tabular form (also called “tabular expressions” or “tables”) have been shown to be useful for documenting and analysing software systems. They are usually easier to read than conventional mathematical expressions but are no less precise. They can be used wherever mathematical expressions are used. To avoid misunderstandings, and to support users with trustworthy tools, the meaning of these expressions must be fully defined.This paper presents a new method for defining the meaning of tabular expressions. Each definition of an expression type names the expression’s constituents, and provides a restriction schema and one or more evaluation schemas. The restriction schema defines the class of well-formed expressions of the type. An evaluation schema maps a well-formed tabular expression of the type to a mathematical expression of a previously defined type. Since the meaning of conventional mathematical expressions is well known, describing an equivalent expression fully defines the meaning of a tabular expression.In this approach, indexation is used to decouple the appearance of a tabular expression from its semantics. A tabular expression is an indexed set of grids; a grid is an indexed set of expressions. The expressions in a grid can be either conventional expressions or tabular expressions of a previously defined type.Defining the meaning of a tabular expression in this way facilitates the building of tools that faithfully implement the semantics. The decoupling of syntax and semantics by means of indices overcomes some limitations of older approaches.The method presented in the paper is illustrated by defining several previously known types of tabular expressions and some new ones. The use of the new model to build a suite of tools for the input, presentation, validation, evaluation, simplification, conversion and composition of tabular expressions is discussed.     

Fusion of disconnected mesh components with branching shapes

Branching structure is a common feature of many natural objects. Given some mesh components with a branching shape missing, this paper presents a novel approach to fuse the mesh components: connectivity graph of the branching shape is constructed to seamlessly connect the boundaries of given components; then, natural geometry is imposed on the connectivity graph exploiting the information of given boundaries. We present a method to construct a branching connectivity graph to connect arbitrary number of given boundaries. Also, a method to generate natural geometry of the connectivity graph that smoothly fuses the boundaries of mesh components is exploited. Some examples are given to demonstrate that our new scheme can be used in a couple of applications, such as fast tree trunk modeling, mesh composition and shell generation.