工业及通讯领域微分方程组在线求解器的设计

针对工业现场控制以及仿真研究中普遍存在的微分方程组在线求解这一难题,从微分方程的反函数出发,结合工控软件运行特点,设计出有效的求解模型。在组态软件PineCAD上实现模型的搭建,实验证明可靠性与准确性。该求解器适用于对实时性要求较高的各类环境,具有简便高效的特点。     

基于正交试验设计的克隆选择函数优化

将正交试验设计引入到克隆选择操作中,设计出基于正交试验的克隆选择操作(clonal selection operation based on orthogonal experiment design,简称CSO-OED),并将其加入到典型的克隆选择算法中,设计出并联式的CSO+CSO-OED(I)算法和串联式的CSO+CSO-OED(II)算法.将新设计的算法用于9个经典的测试函数和6个复杂的测试函数进行对比测试,实验结果表明,CSO-OED能够有效地保持种群的多样性,避免算法不成熟收敛.CSO+CSO-OED(I)和CSO+CSO-OED(II)将全局搜索和局部搜索分开进行优化,对比实验表明,这种搜索策略不但能够保证算法的收敛性,还能有效地提高搜索解的精度,增强算法的鲁棒性.     

理想条件下混合态量子系统的Lyapunov稳定化策略

在假定被控系统满足非退化、没有退化跃迁和完全连通的理想条件下,借助于带有附加自由度的Lyapunov函数研究了混合态量子系统的稳定化问题.基于LaSalle原理推导了闭环系统的最大不变集和任一初始态下的收敛状态集,给出了系统对最大不变集中任一平衡态渐近稳定化的自由度的构造原则.最后通过一个两能级系统的数值仿真,验证了所得理论结果的正确性.     

离散系统最速控制综合函数

针对自抗扰控制技术中的fhan()函数,指出其只是离散系统最速控制综合函数的一种简化.详细推导了离散系统真正的最速控制综合函数——fsun(),完善了自抗扰控制技术的理论框架.理论分析和数值仿真表明,采用fsun()函数后的二阶离散系统,状态变量达到稳态时位置和速度曲线均不会出现超调,且达到稳态时所用的步数少于函数fhan().     

基于语义的单文档自动摘要算法

单文档自动摘要的目的是在原始的文本中通过摘取、提炼主要信息,提供一篇简洁全面的摘要。自动摘要的主流方法是通过统计和机器学习的技术从文本中直接提取出句子,而单文档由于篇章有限,统计的方法无效。针对此问题,提出了基于语义的单文本自动摘要方法。该方法首先将文档划分为句子,然后计算每一对句子的语义相似度,通过运用改进型K-Medoids聚类算法将相似的句子归类,在每一类中选出最具代表性的句子,最后将句子组成文档摘要。实验结果表明,通过融合语义信息,该方法提高了摘要的质量。     

The relation between EA effectiveness and stakeholder satisfaction

Enterprise Architecture (EA) is increasingly being used by large organizations to get a grip on the complexity of their business processes, information systems and technical infrastructure. Although seen as an important instrument to help solve major organizational problems, effectively applying EA seems no easy task. Active participation of EA stakeholders is one of the main critical success factors for EA. This participation depends on the degree in which EA helps stakeholders achieve their individual goals. A highly related topic is effectiveness of EA, the degree in which EA helps to achieve the collective goals of the organization. In this article we present our work regarding EA stakeholder satisfaction and EA effectiveness, and compare these two topics. We found that, regarding EA, the individual goals of stakeholders map quite well onto the collective goals of the organization. In a case study we conducted, we found that the organization is primarily concerned with the final results of EA, while individual stakeholders also worry about the way the architects operate.     

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.     

基于数据场的大规模本体映射

针对已有的本体映射方法在处理大规模本体映射任务时效率和有效性较低的问题,文中提出了一个基于数据场的本体映射算法.该算法首先使用高效的相似度算法,建立本体中元素对另一本体的初始相关度;然后,利用数据场势函数引入周围本体元素对当前元素的影响,修正初始相关度,并最终确定本体间的相关子本体;最后,利用针对性的方法对上述相关子本体进行更有效的映射.实验结果表明,该算法可以在提高映射结果质量的同时保证较高的映射效率.     

Theory of one-tape linear-time Turing machines

A theory of one-tape two-way one-head off-line linear-time Turing machines is essentially different from its polynomial-time counterpart since these machines are closely related to finite state automata. This paper discusses structural-complexity issues of one-tape Turing machines of various types (deterministic, nondeterministic, reversible, alternating, probabilistic, counting, and quantum Turing machines) that halt in linear time, where the running time of a machine is defined as the length of any longest computation path. We explore structural properties of one-tape linear-time Turing machines and clarify how the machines’ resources affect their computational patterns and power.