智能机理与软计算

随着计算机科学技术,特别是人工智能及其它相关学科的发展,关于人脑智能机理的研究引起越来越多的注意。与此同时、出现了关于软计算的研究.旨在研制出高机器智商系统(High Maehine Intelli-gene。Qt,,:sen:、产tom)[,〕。本文将初步探索智能机理与软计算两者间的关系以及把它们结合起来解决问题的可能性和途径。     

适于复杂信息融合系统的近似联合概率数据关联算法

文中在B.Zhou提出的直接概率计算(DC)和近似概率计算(AC)算法基础上提出了一种新的近似多传感器多目标联合概率数据关联算法。近似概率法是以一个目标为中心的近似聚为构造互联事件的起点，并在计算中将DC和AC结合得到的一种全邻的点迹—航迹关联算法，它能有效地提高目标点迹—航迹的关联正确率，在计算时耗上较完全联合概率法快得多，能满足工程中实时性的要求。将其在杂波下目标密集、航迹复杂的数据融合系统中进行实验，对关联正确率，关联耗时等与最近邻法进行了比较，效果较好。     

Fast algorithms for computing the diameter of a finite planar set

Three algorithms for computing the diameter of a finite planar set are proposed. Although all three algorithms have (O(n ²) worst-case running time, an expected-complexity analysis shows that, under reasonable probabilistic assumptions, all three algorithms have linear expected running time. Experimental results indicate that two of these algorithms perform very well for some distributions, and are competitive with an existing method. Finally, we exhibit situations where these exact algorithms out-perform a published approximate algorithm.Research of the first author was supported by grant NSERC A 2422. Research of the second author was supported by grants NSERC A 9293, FCAC EQ-1678 and a Killam Senior Research Fellowship awarded by the Canada Council     

Lyapunov analysis of the approximate motion equations of flexible structures

In this paper, the effectiveness of the approximate motion equations of a flexible structure, obtained by the RitzKantorovich method, is analysed by using Lyapunov functions. The analysis, which is restricted to the case of a single flexible beam for the sake of simplicity, is carried out under the assumption that a partial dissipation is present, affecting only the first degrees of freedom of the system. By means of suitable Lyapunov functions, an overbounding estimate of the quadratic approximation error is determined as a decreasing function of the approximation order. The analysis is completed by considering the two ‘extreme’ cases: the theoretical absence of dissipation and the presence of structural dissipation, affecting all the infinite degrees of freedom.     

基于模拟退火算法的旅行商问题的实现

旅行商问题TSP是一类典型的NP完全问题．围绕着这个问题有各种不同的求解方法,已有的算法例如动态规划法、分支限界法、回溯法等,这些精确式方法都是指数级的,根本无法解决目前的实际问题．贪心法是近似方法．无法达到比较满意的近似比。常用的遗传算法也是求解这类问题的常用方法之一。由于该问题的解是一种特殊的序列．所以遗传算法在求解该问题时的性能也并不理想。模拟退火算法具有描述简单、使用灵活、运用广泛、运行效率高和较少受到初始条件约束等优点．是解决旅行商问题的一种很好的算法。     

字符串近似匹配查询技术综述

字符串匹配是计算机科学中最经典、研究最广泛的问题之一,并且已经被应用到了众多领域当中。然而随着计算机和网络技术的飞速发展以及新问题的不断提出,人们逐渐发现在实际应用中有时更需要进行近似字符串匹配。因此,研究高效的近似字符串匹配算法具有重要的理论价值和实际意义。     

一种基于尾匹配q-gram的近似串匹配算法

近似串匹配是生物信息学、文本检索、信号处理等领域的一个基础问题,如何提高近似串匹配的速度一直都是研究的关键问题。提出一种新的在大文本库中快速查找近似匹配的无损过滤算法。为保证在大文本库中的匹配速度,本算法使用了查询速度较快的q-gram索引。为通过提高过滤算法的过滤效率达到提升算法整体性能的目的,详细分析了含有匹配串的文本区域,提取了一些基于尾匹配q-gram特征的新过滤条件,然后用这些特征优化了过滤算法的过滤标准。实验数据表明,新过滤条件有效地提高了算法的过滤效率,提升了算法的整体性能。结果显示新算法适合各种匹配错误率下的近似匹配,算法的通用性较强。     

近似动态规划在双容水箱预测控制中的应用

在双容水箱液位优化控制的研究中,由于双容水箱液位控制系统是一个典型的具有大滞后、非线性特征的难控系统,造成系统液位控制不稳定.为解决上述问题,提出一种近似动态规划的预测控制算法,建立反映系统预测时域内参考轨迹与预测输出偏差的性能指标函数J.将函数J的优化问题看作动态规划问题,为了避免“维数灾”,采用近似动态规划求解J的近似值,获得最(次)优控制策略.算法包括评价网络、模型网络和执行网络三部分.评价网络近似性能指标函数,模型网络近似系统输入输出关系,执行网络给出相应控制策略.通过不断在线调整各网络参数,使系统输出逼近参考液位.仿真结果表明,与经典PID算法相比,改进算法表现出更好的控制效果.     

Evolutionary digital twin: A new approach for intelligent industrial product development

To fulfill increasingly difficult and demanding tasks in the ever-changing complex world, intelligent industrial products are to be developed with higher flexibility and adaptability. Digital twin (DT) brings about a possible means, due to its ability to provide candidate behavior adjustments based on received “feedbacks” from its physical part. However, such candidate adjustments are deterministic, and thus lack of flexibility and adaptability. To address such problem, in this paper an extended concept – evolutionary digital twin (EDT) and an EDT-based new mode for intelligent industrial product development has been proposed. With our proposed EDT, a more precise approximated model of the physical world could be established through supervised learning, based on which the collaborative exploration for optimal policies via parallel simulation in multiple cyberspaces could be performed through reinforcement learning. Hence, more flexibility and adaptability could be brought to industrial products through machine learning (such as supervised learning and reinforcement learning) based self-evolution. As a primary verification of the effectiveness of our proposed approach, a case study has been carried out. The experimental results have well confirmed the effectiveness of our EDT based development mode.     

Infra-chromatic bound for exact maximum clique search

Many efficient exact branch and bound maximum clique solvers use approximate coloring to compute an upper bound on the clique number for every subproblem. This technique reasonably promises tight bounds on average, but never tighter than the chromatic number of the graph.Li and Quan, 2010, AAAI Conference, p. 128–133 describe a way to compute even tighter bounds by reducing each colored subproblem to maximum satisfiability problem (MaxSAT). Moreover they show empirically that the new bounds obtained may be lower than the chromatic number.Based on this idea this paper shows an efficient way to compute related “infra-chromatic” upper bounds without an explicit MaxSAT encoding. The reported results show some of the best times for a stand-alone computer over a number of instances from standard benchmarks.