Virus coevolution partheno-genetic algorithms for optimal sensor placement

A virus coevolutionary partheno-genetic algorithm (VEPGA), which combined a partheno-genetic algorithm (PGA) with virus evolutionary theory, is proposed to place sensors optimally on a large space structure for the purpose of modal identification. The VEPGA is composed of a host population of candidate solutions and a virus population of substrings of host individuals. The traditional crossover and mutation operators in genetic algorithm are repealed and their functions are implemented by particular partheno-genetic operators which are suitable to combinatorial optimization problems. Three different optimal sensor placement performance index, one aim on the maximization of linear independence, one aim on the maximization of modal energy and the last is a combination of the front two indices, have been investigated. The algorithm is applied to two examples: sensor placement for a portal frame and a concrete arc dam. Results show that the proposed VEPGA outperforms the sequential reduction procedure (SRP) and PGA. The combined performance index makes an excellent compromise between the linear independence aimed index and the modal energy aimed index.     

Patterns: from system design to software testing

Design patterns are used extensively in the design of software systems. Patterns codify effective solutions for recurring design problems and allow software engineers to reuse these solutions, tailoring them appropriately to their particular applications, rather than reinventing them from scratch. In this paper, we consider the following question: How can system designers and implementers test whether their systems, as implemented, are faithful to the requirements of the patterns used in their design? A key consideration underlying our work is that the testing approach should enable us, in testing whether a particular pattern P has been correctly implemented in different systems designed using P, to reuse the common parts of this effort rather than having to do it from scratch for each system. Thus in the approach we present, corresponding to each pattern P, there is a set of pattern test case templates (PTCTs). A PTCT codifies a reusable test case structure designed to identify defects associated with applications of P in all systems designed using P. Next we present a process using which, given a system designed using P, the system tester can generate a test suite from the PTCTs for P that can be used to test the particular system for bugs in the implementation of P in that system. This allows the tester to tailor the PTCTs for P to the needs of the particular system by specifying a set of specialization rules that are designed to reflect the scenarios in which the defects codified in this set of PTCTs are likely to manifest themselves in the particular system. We illustrate the approach using the Observer pattern.     

Separation of synchronous and asynchronous communication via testing

One of the early results concerning the asynchronous π$\pi$-calculus which significantly contributed to its popularity is the capability of encoding the output prefix of the (choiceless) π$\pi$-calculus in a natural and elegant way. Encodings of this kind were proposed by Honda and Tokoro, by Nestmann and (independently) by Boudol. We investigate whether the above encodings preserve De Nicola and Hennessy’s testing semantics. In this sense, it turns out that, under some general conditions, no encoding of the output prefix is able to preserve the must testing. This negative result is due to (a) the non-atomicity of the sequences of steps which are necessary in the asynchronous π$\pi$-calculus to mimic synchronous communication, and (b) testing semantics’ sensitivity to divergence.     

Bluetooth协议栈一致性测试

Bluetooth协议栈实现的一致性测试是保证不同厂商产品之间互连与互操作的基础。文章基于OSI协议一致性测试标准进行了Bluetooth协议一致性测试研究和实际测试,并以L2CAP层协议为例介绍了一致性测试的方法、结构、测试集的设计生成与完备性分析。     

The Dynamics of Syntactic Knowledge

The syntactic approach to epistemic logic avoids the logicalomniscience problem by taking knowledge as primary rather thanas defined in terms of possible worlds. In this study, we combinethe syntactic approach with modal logic, using transition systemsto model reasoning. We use two syntactic epistemic modalities:‘knowing at least’ a set of formulae and ‘knowingat most’ a set of formulae. We are particularly interestedin models restricting the set of formulae known by an agentat a point in time to be finite. The resulting systems are investigatedfrom the point of view of axiomatization and complexity. Weshow how these logics can be used to formalise non-omniscientagents who know some inference rules, and study their relationshipto other systems of syntactic epistemic logics, such as Ågotnesand Walicki (2004, Proc. 2nd EUMAS, pp. 1–10), Alechinaet al. (2004, Proc. 3rd AAMAS, pp. 601–613), Duc (1997,J. Logic Comput., 7, 633–648).     

基于工作流技术的软件测试流程定义与监控*

阐述了软件测试流程的相关概念,论述了基于工作流技术实现软件测试流程定义与监控的概念模型,详细探讨了软件测试流程定义与实例化和软件测试流程的执行与监控所涉及的主要内容及其具体实现方案.     

Testing Planning Domains (without Model Checkers)

We address the problem of verifying planning domains as used in model-based planning, for example in space missions. We propose a methodology for testing flight rules of planning domains which is self-contained, in the sense that flight rules are verified using a planner and no external tools are required. We review and analyse coverage conditions for requirements-based testing, and we reason in detail on "Unique First Cause" (UFC) coverage for test suites. We characterise flight rules using patterns, encoded using LTL, and we provide UFC coverage for them. We then present a translation of LTL formulae into planning goals, and illustrate our approach on a case study.     

自动化回归测试的技术和实现

提出了两种提高回归测试自动化程度的技术。其中一种技术采用数据驱动的方式,使得测试脚本成为可以驱动所有类似测试用例组的通用脚本,同时,实现了测试执行和测试逻辑的分离,使得测试用例的修改和维护更加容易。介绍的另一种技术使用附加的动态链接库来恢复被测软件的图形界面状态,使得软件图形界面的自动测试不易受到被测软件状态改变的影响,提高了整个自动测试系统的健壮性。     

一种基于DCT系数特性的盲检水印算法*

利用分块DCT系数的周期特性,结合Z字形编码置乱技术和JPEG量化系数,提出了一种在分块DCT中频交流系数中嵌入有含义二值水印图像,以实现盲检测的水印方案。实验结果表明,该算法对图像剪切、JPEG有损压缩、中值滤波等攻击有很强的鲁棒性。     

一种用于测试编译优化的程序控制结构生成算法*

代码优化是编译器的重要阶段,是编译技术的研究重点。优化算法复杂度高,需要有效地测试用例生成方法对其进行充分的测试。提出了一种测试用例自动生成方法,能直观简单地生成具有可优化成分的程序,有针对性地对编译优化进行有效测试。重点介绍了该方法的基础、程序控制结构生成算法,并介绍了基于本方法实现的一个编译器自动测试工具。