Model‐based code generation for HLA federates

This paper addresses the problem of automated code generation for a High Level Architecture compliant federate application given its behavior model. The behavior model is a part of the architectural model of a federation that the federate can participate in. The federate behavior model is based on Live Sequence Charts, adopted as the behavioral specification formalism in the Federation Architecture Metamodel (FAMM). FAMM serves as a formal language for describing federation architectures. An objective is to help the testing of federation architecture by means of its prototype implementation early in the development lifecycle. A further objective is to help developers construct complete federate applications that are well modularized. The approach to achieve these objectives is aspect‐oriented in that the generated code, which handles the federate's interactions with a federation execution, serves as the base code, where the computation logic is to be weaved as an aspect. Copyright © 2009 John Wiley & Sons, Ltd.     

远距离人体步态识别算法的研究

步态识别是一种新的生物特征识别技术，它旨在根据人们走路的姿势进行身份识别本文就远距离人体识别算法以及步态识别所涉及到的运动分割．特征提取，模式识别进行了研究，给出了实验图像。特别对基于模型的步态特征识别和基于人体行走的步态序列特征进行识别两种方法进行了比较和分析。     

基于UML的学生食堂自动收费系统研究

简要介绍了统一建模语言UML(UnifiedModelingLanguage),给出了学生食堂自动收费系统问题描述,根据问题描述对该系统建立了类模型,用例模型,活动图和顺序图,这些图为此系统的形成奠定了基础。     

Sequence of linear programming for transmission of fine-scalable coded content in bandwidth-limited environments

In this paper, we propose an optimal peer assignment algorithm on peer-to-peer networks. This algorithm is designed to maximize the quality of transmitting fine-scalable coded content by exploiting the embedding property of scalable coding. To be more realistic, we assume that the requesting peer has a delay constraint to display the content within a certain delay bound, and it also has limited incoming bandwidth. We first use a simple example to illustrate the peer assignment problem, and then formulate this problem as a linear programming problem, followed by a nonlinear programming problem. To efficiently solve the second nonlinear problem, we transform it into a sequence of linear programming problems. Finally, we apply our proposed algorithm to both image and video transmissions in bandwidth-limited environments. Extensive experiments have been carried out to evaluate the complexity and performance of our approach by comparing it with both nonlinear formulation and two heuristic schemes. The results have verified the superior performance of our proposed algorithm.     

改进的LCS方法在测试脚本序列比对中的应用

在自动化测试中,需要对录制和回放过程中的请求序列进行解析和比对,帮助用户进行脚本的修正和完善。为了实现请求序列的比对,采用最长公共子序列(LCS)算法对录制和回放的序列进行比较,其核心思想是把序列对比转化成图论问题,通过二维矩阵寻路来找到最优的匹配方式。文中对算法的原理和实现做了详细描述,并对算法的性能进行测试和分析,最后将算法应用到软件脚本修改器中,验证算法在自动化测试实际应用中的效果。结果表明,LCS算法可以高效地对序列进行解析和比对,提高了自动化测试的效率。     

Algorithms for a realistic variant of flowshop scheduling

This paper deals with a realistic variant of flowshop scheduling, namely the hybrid flexible flowshop. A hybrid flowshop mixes the characteristics of regular flowshops and parallel machine problems by considering stages with parallel machines instead of having one single machine per stage. We also investigate the flexible version where stage skipping might occur, i.e., not all stages must be visited by all jobs. Lastly, we also consider job sequence dependent setup times per stage. The optimization criterion considered is makespan minimization. While many approaches for hybrid flowshops have been proposed, hybrid flexible flowshops have been rarely studied. The situation is even worse with the addition of sequence dependent setups. In this study, we propose two advanced algorithms that specifically deal with the flexible and setup characteristics of this problem. The first algorithm is a dynamic dispatching rule heuristic, and the second is an iterated local search metaheuristic. The proposed algorithms are evaluated by comparison against seven other high performing existing algorithms. The statistically sound results support the idea that the proposed algorithms are very competitive for the studied problem.     

基于数据挖掘的网络入侵检测系统模型

本文论述了数据挖掘技术用于入侵检测的优势，针对知识库更新的智能化处理，在分析关联规则算法的基础上，提出了一个基于数据挖掘的入侵检测模型。该模型可以有效地检测新的攻击类型，实现知识库的自动更新，从而提高了入侵检测的高效性。     

使用混沌扩频序列增强DS/SS系统性能

基于Logistic映射,利用交织器设计扩频序列发生器,其产生的混沌序列具有良好的相关特性和旁瓣特性,并且是不必寻优而自身平衡的。将这种序列作为扩频序列应用于直接序列扩频系统中,能够有效地减少多址干扰,提高系统的容量,增强系统性能,信息也能够被加密。将这种序列和传统的扩频序列以及普通的混沌序列应用于扩频系统,仿真结果表明,设计的混沌序列性能优于其他的扩频序列。     

一种调和序列生成及其在故障定位中的应用

为了提高软件的可靠性,在软件运行发生故障时,快速、准确地定位故障点成为非常有意义的研究课题。与以往方法不同,在将故障运行序列和最部近运行序列进行差异对比前,为了避免选取第一条最近成功路径时引起的“盲区”使得后期搜索空间加大,引入了生物学基因序列比对原理,对最部近运行序列不是通过编辑距离比较进行选取,而是通过一条调和序列进行处理。实验表明,方法的故障定位效果较好。     

UML时间顺序图的可达性分析

对于实时系统来说,UML顺序图描述了对象之间的交互。对象之间的交互展现了系统行为的场景。本文中,我们针对描述多场景的UML顺序图组合中的可达性问题进行研究。尽管这个问题可以转换为相应的时间自动机,然后进行处理,但其转化为之后,状态空间巨大,解决的开销比较大,效率不高。针对部分可达性问题,本文采用更为高效的基于线性规划的解决方案,其思想如下:首先遍历所有到达给定节点的简单路径片断来验证可达性,随后遍历到达给定节点的并且包含所有循环至多一次的路径片断来验证可达性。由于我们并没有遍历所有路径片断,因此用本文的方法判定给定节点的可达性的时候,结果会有三种:可达,不可达和不确定。由于有些循环与可达性是无关的,我们进一步通过识别哪些循环与可达性无关,对算法进行改进。