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.     

InfoSigs:一种面向Web对象的细粒度聚类算法

面向Web对象的细粒度聚类已经成为学术界研究的热点.然而现有大多数聚类模型只关注如何对文本内容或文章主题进行聚类,聚类结果粒度较粗,无法满足大规模网络信息检索的质量要求.针对上述挑战,充分挖掘Web文档中词汇间的树状概率层次关系,提出一种以词汇信息分布作为特征标志的聚类算法InfoSigs,实现对Web对象的细粒度聚类.算法构建一个信息传递有向无环图,根据词汇在图中信息分布的集中度赋予其合理的权重,产生更具代表性的特征向量;同时算法提出了一个自适应的记录合并模型,有效提高记录簇中记录间的相似度,减少噪音对合并过程的影响.实验结果表明,InfoSigs算法比传统聚类算法—I-Match和Shingling—在F-Measure值上平均约有21.3%的提高,可以有效地运用到多领域Web对象的聚类问题.     

New Generations: Sequencing Machines and Their Computational Challenges

New generation sequencing systems are changing how molecular biology is practiced. The widely promoted ＄1000 genome will be a reality with attendant changes for healthcare, including personalized medicine. More broadly the genomes of many new organisms with large samplings from populations will be commonplace. What is less appreciated is the explosive demands on computation, both for CPU cycles and storage as well as the need for new computational methods. In this article we will survey some of these develo...     

基于图像识别的虚拟翻书系统

设计了一种基于图像识别的虚拟翻书系统,采用普通摄像头作为传感器捕获人的手势动作,并利用图像识别技术和计算机视觉技术实现虚拟翻书效果.该系统具有虚拟触摸功能,可以点击播放页面中的视频、语音等.     

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.     

非抽样Contourlet变换的盲数字水印

根据非抽样Contourlet变换的特性,提出一种非抽样Contourlet变换域的盲水印算法,算法选择在具有最大能量的中高频子带中嵌入水印,在对水印进行加密后,利用密钥生成PN序列,根据水印值的不同PN序列嵌入宿主图像的方式也不同。提取水印不需要原始图像,利用NSCT变换系数与PN序列的相关性系数提取水印,实现盲提取。实验证明算法具有一定的不可见性和鲁棒性,具有很强的抗JPEG压缩的鲁棒性。     

网络心跳包序列的数据流分簇检测方法

在对网络会话进行时序分析的基础上,提出基于数据流分簇处理的心跳包序列检测方法。对数据流进行时序分簇处理,按周期性特征扩充簇集合,筛除不符合特征的簇对象,根据稳定的簇集合检测心跳包序列。实验结果表明,该方法检测率较高、误检率较低,能够实现实时检测和处理。     

基于奇偶量化的彩色图像盲水印算法

提出一种基于奇偶量化的彩色图像小波域的数字水印算法。首先对水印图像进行置乱处理,然后对图像进行翻转,最后利用混沌系统产生的混沌序列对水印进行加密。水印嵌入时,采用小波变换并利用奇偶量化规则将加密后的水印嵌入到载体图像蓝色分量最深层的四个子带中。水印提取时,不需要原始图像的参与,实现了盲提取。仿真实验和性能分析表明,该算法有很好的不可见性和鲁棒性,可以有效地抵抗JPEG压缩、噪声、剪切等攻击。     

Modelling concurrency with comtraces and generalized comtraces

Comtraces (combined traces) are extensions of Mazurkiewicz traces that can model the “not later than” relationship. In this paper, we first introduce the novel notion of generalized comtraces, extensions of comtraces that can additionally model the “non-simultaneously” relationship. Then we study some basic algebraic properties and canonical representations of comtraces and generalized comtraces. Finally we analyze the relationship between generalized comtraces and generalized stratified order structures. The major technical contribution of this paper is a proof showing that generalized comtraces can be represented by generalized stratified order structures.     

Almost sure limit theorems for the maxima of some strongly dependent Gaussian sequences

We proved some almost sure limit theorems for standard strongly dependent Gaussian sequences in nonstationary cases under some mild conditions.