异构数据集成方法研究与实现

为解决异构数据集成的复杂性问题，文章提出了一种异构数据同步的新方法——半集成式中间件法。该方法成功地应用在重庆市社会保障综合信息系统中，具有易于实现、可扩展性、跨平台性和效率高等特点。     

Monitoring unit root and multiple structural changes: An information criterion approach

An information criterion-based model selection method is proposed for monitoring unit root and multiple structural changes. In this method, a battery of possible models is considered by changing the integration order (I(0) or I(1)) and the combinations of change points. Next, the best model is selected from among alternative models via a modified Bayesian information criterion (BIC). Accordingly, on the basis of the selected model, the process that generates the observed time series is determined. The BIC is modified in order to adjust the frequency count of incorrectly selecting stationary models via the conventional BIC. The simulation results of monitoring unit root and structural change suggest that the proposed method outperforms the conventional hypothesis testing method in terms of detection accuracy and detection speed. Furthermore, the empirical results suggest that the proposed method exhibits better performances with regard to detection stability and forecastability.     

基于生物启发计算的警用流动人口分析系统

目前对流动人口的管理仅停留在数据查询比对和简单统计上,缺少对数据的深层次分析,难以对决策指挥提供支持。针对流动人口的分析问题,提出了构建一个基于生物启发计算的智能分析系统,用于发现流动人口中各类人员的流动模式以及流动人口的趋势性问题,找出异常的流动信息和模式。该系统综合运用了前沿的生物启发计算技术——基于多层染色体基因表达式编程算法、重叠基因表达进化算法、基于概念相似度神经网络分类模型和层次距离计算的聚类算法搭建了一个警用流动人口的分析平台。同时根据实际需求,提出了一种新的基于智能分析结果的分级报警模型。实验表明系统具有较高的性能和实用性。     

一种面向重构的工作流活动状态语义描述方法

工作流活动行为的精确描述是实现工作流过程控制的基础。基于状态的工作流活动行为描述方法在当前的工作流管理系统中被普遍采用。然而,非形式化的活动状态描述缺乏精确的语义并且不易扩充,导致系统适应性较差。针对业务过程管理需求的多样性和动态性,提出了一种支持快速重构的工作流活动状态语义的形式化描述方法。在分析工作流活动与工作项的状态关联基础上,定义了活动状态配置、活动状态配置全集等用于活动状态语义描述的基本概念。通过把活动状态映射为具有相同特征的活动状态配置的集合,建立了形式化的活动状态语义,研究了在此语义下活动状态的重构机制和基本实现步骤,并通过实例验证了该机制的有效性。应用本方法能够提高工作流管理系统适应企业业务过程管理需求快速变化的能力。     

一种基于小波变换的非均匀量化索引调制水印算法

为了提高数字水印的稳健性与不可见性,将图像小波变换与量化索引调制算法相结合,提出了一种基于小波变换的非均匀量化索引调制数字水印算法。该算法对原始图像进行离散小波变换,将中频小波系数分成3×3的系数子块作为水印载体,对子块的系数均值采用非均匀量化索引调制,实现二值水印的嵌入。根据人类视觉特性,不同的系数子块采用不同的量化间隔并自适应于子块内相邻系数的差值。实验结果表明,该算法透明性好,安全性高,对高斯白噪声、剪切、滤波以及JPEG压缩等常见攻击具有较强的稳健性。     

Evolutionary Algorithms for Quantum Computers

In this article, we formulate and study quantum analogues of randomized search heuristics, which make use of Grover search (in Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 212–219. ACM, New York, 1996) to accelerate the search for improved offsprings. We then specialize the above formulation to two specific search heuristics: Random Local Search and the (1+1) Evolutionary Algorithm. We call the resulting quantum versions of these search heuristics Quantum Local Search and the (1+1) Quantum Evolutionary Algorithm. We conduct a rigorous runtime analysis of these quantum search heuristics in the computation model of quantum algorithms, which, besides classical computation steps, also permits those unique to quantum computing devices. To this end, we study the six elementary pseudo-Boolean optimization problems OneMax, LeadingOnes, Discrepancy, Needle, Jump, and TinyTrap. It turns out that the advantage of the respective quantum search heuristic over its classical counterpart varies with the problem structure and ranges from no speedup at all for the problem Discrepancy to exponential speedup for the problem TinyTrap. We show that these runtime behaviors are closely linked to the probabilities of performing successful mutations in the classical algorithms.     

Scalable multi-radio communication in modular robots

Decentralized control of self-reconfiguring modular robots requires reliable inter-module communication. Communication links must tolerate module misalignment and implement the neighbor-to-neighbor communication model. In this paper, we propose a wireless system based on multiple radios per module that addresses these challenges. Although the capacity of general wireless mesh networks is known to rapidly decrease with network size, we show that a multi-radio single-channel system has constant capacity in square and cubic lattices of infinite size. We validate the performance of such a system in a testbed with 15 unactuated modules using synthetic data and a benchmark decentralized algorithm. We also demonstrate automatic neighbor detection. The main benefits of radio communication in modular robots are tolerance to module misalignment and to eliminate the tight coupling between communication and mechanical design necessitated by typical existing infrared and wired systems. Our results are the first to establish the feasibility of radio as the primary means of inter-module communication in modular robots.     

基于人工免疫理论的数据保密通信研究

针对数据保密通信的现实需求,提出一种新的保密通信方法.该方法首先基于否定选择算法从明文信息本身提取加密因子,然后再以加密因子按m序列进行密钥扩展,生成伪随机密钥序列对明文进行加密.利用该方法生成的伪随机密钥序列的自相关特性较好,数据加密后具备了较好的抗攻击性能,同时接收端还可以用加密因子进行免疫鉴别,以检验数据的完整性.     

一种需求驱动的服务行为适配方法

现有服务行为适配方法通常侧重于如何消除服务之间行为上的不相容而往往没有考虑用户的需求,因而需要对基于适配器的服务组合进行需求的可满足性验证,这使得基于适配器的服务组合过程复杂且低效.针对此问题,本文在适配器生成过程中考虑用户的需求,提出一种需求驱动的服务行为适配方法,并给出用于描述用户需求的形式模型的语法及语义.证明了利用本文方法所生成的适配器不仅可以消除服务之间行为上的不相容,并且保证基于适配器的服务组合的行为满足需求给出的时序约束,避免了对基于适配器的服务组合进行验证.通过一个贯穿全文的实例分析表明了方法的可行性和有效性     

Summary queries for frequent itemsets mining

There are many advanced techniques that can efficiently mine frequent itemsets using a minimum-support. However, the question that remains unanswered is whether the minimum-support can really help decision makers to make decisions. In this paper, we study four summary queries for frequent itemsets mining, namely, (1) finding a support-average of itemsets, (2) finding a support-quantile of itemsets, (3) finding the number of itemsets that greater/less than the support-average, i.e., an approximated distribution of itemsets, and (4) finding the relative frequency of an itemset (compared its frequency with that of other itemsets in the same dataset). With these queries, a decision maker will know whether an itemset in question is greater/less than the support-quantile; the distribution of itemsets; and the frequentness of an itemset. Processing these summary queries is challenging, because the minimum-support constraint cannot be used to prune infrequent itemsets. In this paper, we propose several simple yet effective approximation solutions. We conduct extensive experiments for evaluating our strategy, and illustrate that the proposed approaches can well model and capture the statistical parameters (summary queries) of itemsets in a database.