基于移动Agent技术的医学图像检索方法

针对现有医学图像检索方法中，检索算法速度较慢、准确性较低以及远程检索时占用大量带宽等问题，设计并实现了一种基于移动Agent技术的医学图像检索方法，重点讨论了该方法实现的关键技术，包括提升框架下的M带整数小波变换和提取多通道纹理特征的检索算法．模拟实验结果表明，该方法实时性较强，占用网络带宽较少，采用的算法运算速度提高近10倍、运算复杂度降低约50％，提取的纹理特征能充分表达图像内容，较好地满足了医学图像的检索要求，实现了对医学图像库快速较准确的检索．     

基于多Agent的宏观经济智能预测决策支持系统研究

在分析智能决策支持系统的发展基础上，将人工智能思想，特别是Agent应用于构建智能宏观经济预测决策支持系统。提出面向任务的Agent设计思想，以任务为核心设计多种类型Agent共同完成预测决策任务，给出基于多Agent的系统组成结构，并给出系统中不同类型Agent的具体实现结构，同时探讨了整个系统的运行机制以及系统中多Agent之间的合作。整个系统的构建过程也是面向Agent的程序设计的过程。     

Linearization of nonlinear filter generators and its application to cryptanalysis of stream ciphers

Nonlinear filter generators are commonly used as keystream generators in stream ciphers. A nonlinear filter generator utilizes a nonlinear filtering function to combine the outputs of a linear feedback shift register (LFSR) to improve the linear complexity of keystream sequences. However, the LFSR-based stream ciphers are still potentially vulnerable to algebraic attacks that recover the key from some keystream bits. Although the known algebraic attacks only require polynomial time complexity of computations, all have their own constraints. This paper uses the linearization of nonlinear filter generators to cryptanalyze LFSR-based stream ciphers. Such a method works for any nonlinear filter generators. Viewing a nonlinear filter generator as a Boolean network that evolves as an automaton through Boolean functions, we first give its linearization representation. Compared to the linearization representation in Limniotis et al. (2008), this representation requires lower spatial complexity of computations in most cases. Based on the representation, the key recoverability is analyzed via the observability of Boolean networks. An algorithm for key recovery is given as well. Compared to the exhaustive search to recover the key, using this linearization representation requires lower time complexity of computations, though it leads to exponential time complexity.     

Characterization of the Charge Transfer Complex from Furan and Maleic Anhydride and the Alternating Copolymer

A previously unreported copolymer between furan and maleic anhydride was readily obtained by free radical initiation of benzene solutions of the comonomers. The product copolymers exhibit remarkably uniform composition regardless of monomer feed ratios. A donor-acceptor complex was suspected to account for the 1:1 alternating sequence of the monomers in the product. The complex was easily detected and partially characterized, although its exact role in the mechanism is uncertain.     

基于多区域代理的分布式故障诊断方法

军用大型复杂装备组成涉及多个子系统或多个装备,故障诊断涉及上百个分散测试点数据采集和分离模块的诊断推理。传统装备采用集中测试和诊断方法,配套测试系统结构设计复杂、系统故障诊断算法效率低。本文基于D-矩阵故障诊断原理,提出基于多区域Agent的分布式故障诊断结构模型和区域Agent数据协同、区域Agent测试结果仲裁等问题的解决办法,并以某型舰船装备为例,验证了基于多区域代理的分布式故障诊断技术的有效性。     

一种时序逻辑网络的快速设计方法

引用1984年尹克震提出的“开关函数的反演公式”,采用伪随机序列技术的思想,提出移位寄存器型时序逻辑网络的一种快速设计方法。     

木薯淀粉改性絮凝剂的光谱研究

采用氧化还原引发体系引发木薯淀粉与丙烯酰胺接枝共聚制备出天然木薯淀粉改性絮凝剂,用紫外-可见吸收光谱(UV-Vis)、红外光谱(FTIR)和拉曼光谱(RS)详细对比研究了木薯淀粉、丙烯酰胺和接枝共聚物三者的光谱特征,并据此讨论了接枝共聚机理.     

CS-800红外碳硫分析仪测定合金钢中的碳和硫

研究了碳硫分析在不同钨助熔剂加入量及不同分析时间的条件下所得碳、硫元素含量,首次结合分析曲线验证最佳条件,并对碳、硫分析可能存在的误差进行浅析.     

The Peter principle revisited: A computational study

In the late sixties the Canadian psychologist Laurence J. Peter advanced an apparently paradoxical principle, named since then after him, which can be summarized as follows: ‘Every new member in a hierarchical organization climbs the hierarchy until he/she reaches his/her level of maximum incompetence’. Despite its apparent unreasonableness, such a principle would realistically act in any organization where the mechanism of promotion rewards the best members and where the competence at their new level in the hierarchical structure does not depend on the competence they had at the previous level, usually because the tasks of the levels are very different to each other. Here we show, by means of agent based simulations, that if the latter two features actually hold in a given model of an organization with a hierarchical structure, then not only is the Peter principle unavoidable, but also it yields in turn a significant reduction of the global efficiency of the organization. Within a game theory-like approach, we explore different promotion strategies and we find, counterintuitively, that in order to avoid such an effect the best ways for improving the efficiency of a given organization are either to promote each time an agent at random or to promote randomly the best and the worst members in terms of competence.