Simulation of the oregonator model by using deterministic ARMS

We propose a deterministic method for simulating chemical reactions, deterministic abstract rewriting system on multisets (DARMS), which is based on the concept of mass action low. The feasibility and utility of DARMS are demonstrated by applying it to the oregonator, which is a well-known model of the Belousov-Zhabotinskii (BZ) reaction. This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January 31–February 2, 2008     

“景”与“观”——审美主体视角下的城市景观特色“形态”偏好

通过从人类的自我保护意识、人类审美创造的需要、心理旋转理论等相关心理学角度分析,揭示了审美主体对抽象形态的城市景观和城市景观特色的偏好—在对城市景观,尤其是建筑类和园林小品类景观进行审美活动时,具有抽象简洁形态的景观较易受到审美主体的青睐。     

师造化 得心源——关于仿生家具设计中形态仿生的探讨

家具仿生设计原理与中国画中师法自然的观念有着异曲同工之妙。天工造物产生了形形色色的自然物,它们是设计师创作灵感的来源,通过对它们形态的具象或抽象的处理,设计出优秀的家具作品。     

甲烷在活性炭上吸脱附行为的研究

用标准容积法测得中压（０～５．０ＭＰａ）下不同活性炭对甲烷的吸脱附等温线，得到了吸附容量和有效吸附容量。结果表明，活性炭对甲烷的吸脱附存在着滞后现象。研究了温度对吸附等温线的影响。通过对吸附法和压缩法甲烷储存密度的比较，得出了吸附法定容储存甲烷的最佳压力范围是３．０～４．０ＭＰａ。利用Ｃｌａｕｓｉｕｓ－Ｃｌａｐｅｙｒｏｎ方程解析了甲烷在活性炭上等量吸附热。结果表明，随着吸附量的增加，等量吸附热降低     

基于文本理解的自动文摘系统研究与实现

本系统模拟人的理解、知识获取认知过程，利用全信息词典有效地组织语言学知识。背景知识和领域知识，利用部分分析器算法，实现语法语义语用分析一体化，从文本中提取重要信息，将任一篇文章转换为计算机内的一个信息提取框架实体．根据填充情况，由文摘生成器产生合适的文摘．目前已实现计算机病毒领域文章的自动文摘，验证了文摘模型的可行性和有效性．文摘系统模型与领域无关．     

三维数字摄影图中注记点高程值的自动检查

针对三维数字摄影图中注记点高程值出现的某些问题，进行了探索、研究，编写了对三维数字摄影图中注记点高程值进行自动检查与提取的程序，该程序的应用使三维数字摄影图中注记点高程值的数据质量有了保证。     

基于扩展CHAM的SA级路径覆盖方法

化学抽象机形式化语言（CHAM）通过把化学反应和抽象机的概念有机地结合来描述系统状态的变化,以此来指导分析和测试.针对软件体系结构（SA）中构件的概念,采用CHAM对SA中的构件进行建模,并据此导出该构件的标号迁移系统（LTS）,以表示该构件与其它构件之间的行为交互,并根据选取的测试覆盖准则,生成基于此构件的LTS中的所有测试路径.最后以B/S体系结构为例,通过实验验证了该方法在生成DB构件的测试路径上是可行的.     

Abstraction and resolution modulo AC: How to verify Diffie–Hellman-like protocols automatically

We show how cryptographic protocols using Diffie–Hellman primitives, i.e., modular exponentiation on a fixed generator, can be encoded in Horn clauses modulo associativity and commutativity. In order to obtain a sufficient criterion of security, we design a complete (but not sound in general) resolution procedure for a class of flattened clauses modulo simple equational theories, including associativity–commutativity. We report on a practical implementation of this algorithm in the MOP modular platform for automated proving; in particular, we obtain the first fully automated proof of security of the IKA.1 initial key agreement protocol in the so-called pure eavesdropper model.     

Algorithm-oriented generic libraries

We outline an approach to construction of software libraries in which generic algorithms (algorithmic abstractions) play a more central role than in conventional software library technology or in the object-oriented programming paradigm. Our approach is to consider algorithms first, decide what types and access operations they need for efficient execution, and regard the types and operations as formal parameters that can be instantiated in many different ways, as long as the actual parameters satisfy the assumptions on which the correctness and efficiency of the algorithms are based. The means by which instantiation is carried out is language dependent; in the C + + examples in this paper, we instantiate generic algorithms by constructing classes that define the needed types and access operations. By use of such compile-time techniques and careful attention to algorithmic issues, it is possible to construct software components of broad utility with no sacrifice of efficiency.