一种新的变异测试数据自动生成方法

变异测试是一种行之有效的软件测试方法,通过使用变异算子产生变异体系统地模拟软件中的各种缺陷,然后构造能够杀死这些变异体的测试数据集.自动生成能够杀死变异体的测试数据将提高变异测试的效率和有效性.当前的研究工作只考虑生成杀死单个变异体的测试数据.文中根据杀死同一位置的多个变异体的条件相近的特点,提出一种对杀死这些变异体的条件进行组合,然后生成同时杀死该位置多个变异体的测试数据的方法;给出相应的支持工具,并且通过实验验证方法的有效性.     

A UML-Based Approach to System Testing

System testing is concerned with testing an entire system based on its specifications. In the context of object-oriented, UML development, this means that system test requirements are derived from UML analysis artifacts such as use cases, their corresponding sequence and collaboration diagrams, class diagrams, and possibly Object Constraint Language (OCL) expressions across all these artifacts. Our goal here is to support the derivation of functional system test requirements, which will be transformed into test cases, test oracles, and test drivers once we have detailed design information. In this paper, we describe a methodology in a practical way and illustrate it with an example. In this context, we address testability and automation issues, as the ultimate goal is to fully support system testing activities with high-capability tools.     

A Recursion Theoretic Approach to Program Testing

Inductive inference, the automatic synthesis of programs, bears certain ostensible relationships with program testing. For inductive inference, one must take a finite sample of the desired input/output behavior of some program and produce (synthesize) an equivalent program. In the testing paradigm, one seeks a finite sample for a function such that any program (in a given set) which computes something other than the object function differs from the object function on the finite sample. In both cases, the finite sample embodies sufficient knowledge to isolate the desired program from all other possibilities. These relationships are investigated and general recursion theoretic properties of testable sets of functions are exposed.     

研究生软件测试课程实施案例交叉教学法新探

从目前国内研究生"软件测试理论与技术"课程教学实际出发,在分析目前国内研究生学习基础、学习需求及学习能力的基础上,提出一种紧密结合测试案例、测试理论与实践交叉进行的教学新方法。     

A Hypothesis Testing Approach to Semifragile Watermark-Based Authentication

This paper studies the problem of achieving watermark semifragility in watermark-based authentication systems through a composite hypothesis testing approach. Embedding a semifragile watermark serves to distinguish legitimate distortions caused by signal-processing manipulations from illegitimate ones caused by malicious tampering. This leads us to consider authentication verification as a composite hypothesis testing problem with the watermark as side information. Based on the hypothesis testing model, we investigate effective embedding strategies to assist the watermark verifier to make correct decisions. Our results demonstrate that quantization-based watermarking is more appropriate than spread-spectrum-based methods to achieve the semifragility tradeoff between two error probabilities. This observation is confirmed by a case study of an additive Gaussian white noise channel with a Gaussian source using two figures of merit: 1) relative entropy of the two hypothesis distributions and 2) the receiver operating characteristic. Finally, we focus on common signal-processing distortions, such as JPEG compression and image filtering, and investigate the discrimination statistic and optimal decision regions to distinguish legitimate and illegitimate distortions. The results of this paper show that our approach provides insights for authentication watermarking and allows for better control of semifragility in specific applications.      

A Formal Logic Approach to Constrained Combinatorial Testing

Combinatorial testing is as an effective testing technique to reveal failures in a given system, based on input combinations coverage and combinatorial optimization. Combinatorial testing of strength t (t ≥ 2) requires that each t-wise tuple of values of the different system input parameters is covered by at least one test case. Combinatorial test suite generation algorithms aim at producing a test suite covering all the required tuples in a small (possibly minimal) number of test cases, in order to reduce the cost of testing. The most used combinatorial technique is the pairwise testing (t = 2) which requires coverage of all pairs of input values. Constrained combinatorial testing takes also into account constraints over the system parameters, for instance forbidden tuples of inputs, modeling invalid or not realizable input values combinations. In this paper a new approach to combinatorial testing, tightly integrated with formal logic, is presented. In this approach, test predicates are used to formalize combinatorial testing as a logical problem, and an external formal logic tool is applied to solve it. Constraints over the input domain are expressed as logical predicates too, and effectively handled by the same tool. Moreover, inclusion or exclusion of select tuples is supported, allowing the user to customize the test suite layout. The proposed approach is supported by a prototype tool implementation and results of experimental assessment are also presented.     

试验场三维GIS实现的新方法

本文对试验场中三维GIS实现方法进行探讨,从试验场对三维GIS的实际需求出发,设计了一种新的基于Unity3D平台的三维GIS系统体系结构,并实现了三维数据的组织、查询和显示,解决了属性数据和空间数据的有效连接、多媒体信息组织与管理、海量数据的存储、虚拟现实技术的实现等技术难题。     

A New Approach to Primary Decomposition

The first purpose of this paper is to describe a new mathematical approach for the computation of an irredundant primary decomposition of a given polynomial ideal I. This presentation will be formed of three parts: a decomposition of the associated radical ideal I to an intersection of prime ideals P_i, then the determination of ideals I_iwhose radical is prime (equal to P_i), and finally, the extraction of the possible embedded components included in I_i. The second is to give an implementation of this algorithm via a new software component, called The Central Control², in which we implemented distributed algorithms performing the basic operations of algebraic geometry.     

A New Approach to Humanitarian Demining

Humanitarian demining is an application in which the use of tele-operated machines and mechanisms has been gaining acceptance recently. Actually, demining is just one among many other field applications that require a high degree of mobility, manipulation of loads, robustness and, above all, high efficiency in terms of energy consumption. This paper will present the development and analysis of Field Arm, a pantographic manipulator especially designed for field works, focusing on its kinematic, static and dynamic properties. The novel features of Field Arm will be presented and discussed with results of simulations and experiments.     

一种新的珍珠层厚度测量方法

珍珠层厚度是珍珠价值最主要的衡量指标之一,目前珍珠层厚度的无损测量方法主要采用光学相干层析成像技术和X射线技术;光学相干层析成像技术在实际测量时精度较低;在研究X射线测量原理的基础上,提出了一种新的珠层厚度测量方法;首先介绍了灰度图像的边缘识别算法和珍珠核、珍珠外圆度拟合算法,其次提出了一种引入对照机制的珍珠层测量算法,最后还对算法的误差进行了分析,算法的误差可以控制在0.02％以内;实际的测量也验证了该测量方法具有很高的精度.     

A New Approach to Humanitarian Demining

Landmines can deprive whole areas of valuable resources, and continue to kill and cause injuries years after the end of armed conflicts. Armored vehicles are used for mine clearance, but with limited reliability. The final inspection of minefields is still performed by human deminers exposed to potentially fatal accidents. The aim of this research is to introduce automation as a way to improve the final level of humanitarian demining. This paper addresses mobility and manipulation, while sensing, communication and visualization shall be discussed in detail in a subsequent paper. After analyzing the merits and limitations of previous works, a new approach to tele-operated demining is considered, using off-road buggies equipped with combustion engines, and taking into account actual field requirements. Control of the automated buggies on rough terrain is also discussed, as well as the development of a new weight-balanced manipulator for landmine clearance operations.Paulo Debenest received the B. Eng. degree in mechanical engineering (major in automation and systems) from Polytechnic School of the University of São Paulo (EPUSP), Brazil, in 1998, and the M. Eng. degree in mechanical and aerospace engineering from Tokyo Institute of Technology (Tokyo Tech), Japan, in 2002. He is currently working toward the Ph.D. degree in mechanical science engineering at Tokyo Tech and member of IEEE. His current research activities include development of demining robots and mechanical design of machines for field applications.Edwardo F. Fukushima is an assistant professor in the Department of Mechanical and Aerospace Engineering at Tokyo Institute of Technology (Tokyo Tech). He received the B. Eng. degree in electric engineering (major in electronics and telecommunications) from Federal Center of Technological Education of Paraná (CEFET-PR), Brazil, in 1989, and M. Eng. degree in mechanical science engineering from Tokyo Tech in 1993. In 1994 he became a research associate in the same institute. During Sept.–Dec. 2001 he has been a Visiting Researcher at Stanford University, and during Aug.–Sept. 2004 Visiting Scientist at University of Zurich. He is also member of RSJ. His current research activities include development of demining robots, design of controllers for intelligent robots, and development of new brushless motors and drives.Yuki Tojo is a masters course student in the Department of Mechanical and Aerospace Engineering at Tokyo Institute of Technology (Tokyo Tech). He received the B. Eng. degree in mechanical and aerospace engineering from Tokyo Tech in 2003. His research interests include design and control of weight-compensated manipulator on mobile platform. He is also member of RSJ.Shigeo Hirose was born in Tokyo in 1947. He received his B.Eng. Degree with First Class Honors in Mechanical Engineering from Yokohama National University in 1971, and his M. Eng. and Ph.D. Eng. Degrees in Control Engineering from Tokyo Institute of Technology in 1973 and 1976, respectively. From 1976 to 1979 he was a Research Associate, and from 1979 to 1992 an Associate Professor. Since 1992 he has been a Professor in the Department of Mechanical and Aerospace Engineering at the Tokyo Institute of Technology. Since 2002, he has been Honorary Professor in Shengyang Institute of Technology, the Chinese Academy of Sciences. Fellow of JSME and IEEE. He is engaged in creative design of robotic systems. Prof. Hirose has been awarded more than twenty prizes.     

The Comparison of Power and Optimization Algorithms on Unit Root Testing with Smooth Transition

The aim of this study is to search for a better optimization algorithm in applying unit root tests that inherit nonlinear models in the testing process. The algorithms analyzed include Broyden, Fletcher, Goldfarb and Shanno (BFGS), Gauss–Jordan, Simplex, Genetic, sequential quadratic programming and extensive grid-search. The simulation results indicate that the derivative free methods, such as Genetic and Simplex, have advantages over hill climbing methods, such as BFGS and Gauss–Jordan, in obtaining accurate critical values for the Leybourne et al. (J Time Ser Anal 19:83–97, 1998) (LNV) and Sollis (J Time Ser Anal 25:409–417, 2004) unit root tests. Besides, we extend our analysis by including exponential smooth transition type of trend function in to unit root testing which is not used in the previous literature. The same result also holds true for our newly proposed unit root test with exponential smooth transition function type of trend model. Furthermore, we realize that there is a gap in the unit root studies that the newly proposed tests are not analyzed between each other’s data generating process (DGP). Hence, we investigate the power comparison of different nonlinear unit root test under various DGP including nonlinear unit root tests and find interesting results such as LNV type unit root test can manage to capture state dependent nonlinearity when the transition speed is high. Finally, we have used the Australian real interest rate parity hypothesis to empirically verify the results that we have obtained in the simulation studies.     

An Efficient Stochastic Simulation Algorithm for Bayesian Unit Root Testing in Stochastic Volatility Models

In financial times series analysis, unit root test is one of the most important research issues. This paper is aimed to propose a new simple and efficient stochastic simulation algorithm for computing Bayes factor to detect the unit root of stochastic volatility models. The proposed algorithm is based on a classical thermodynamic integration technique named path sampling. Simulation studies show that the test procedure is efficient under moderate sample size. In the end, the performance of the proposed approach is investigated with a Monte Carlo simulation study and illustrated with a time series of S&P500 return data.     

A General Model of Unit Testing Efficacy

Much of software engineering is targeted towards identifying and removing existing defects while preventing the injection of new ones. Defect management is therefore one important software development process whose principal aim is to ensure that the software produced reaches the required quality standard before it is shipped into the market place. In this paper, we report on the results of research conducted to develop a predictive model of the efficacy of one important defect management technique, that of unit testing. We have taken an empirical approach. We commence with a number of assumptions that led to a theoretical model which describes the relationship between effort expended and the number of defects remaining in a software code module tested (the latter measure being termed correctness). This model is general enough to capture the possibility that debugging of a software defect is not perfect and could lead to new defects being injected. The Model is examined empirically against actual data and validated as a good predictive model under specific conditions. The work has been done in such a way that models are derived not only for the case of overall correctness but also for specific types of correctness such as correctness arising from the removal of defects contributing to shortcoming in reliability (R-type), functionality (F-type), usability (U-type) and maintainability (M-type) aspects of the program subject to defect management.     

单元测试中非公有类型方法的测试

软件的开发总是离不开测试,在测试越来越受到重视的今天,对单元测试也提出了越来越高的要求,在软件测试中对非公有类型方法进行测试也一直倍受关注。使用派生,反射机制可以实现对非公有类型方法的测试。通过巧妙的设计,使用这些技术,可以通过代码演示如何测试非公有方法。     

混合FLN－Lagrange松驰法用于机组最优投入

本文提出用混合函数链网络与Ｌａｇｒａｎｇｅ松驰法解机组最优投入问题．基于神经网络的监督学习和自适应模式识别概念，ＦＬＮ被用来预测负荷需求与Ｌａｇｒａｎｇｅ乘子之间的关系．为了证实这一方法的有效性，一个具有１６台电机组的实际系统被测试．数值计算结果表明系统发电总成本可获得最少，大大减少了计算时间．     

一种获得应用软件规格说明的新途径

在4GL开发环境下,应用系统的开发都是以界面的设计为导向的。该文介绍了一种在4GL环境下获得应用软件规格说明的新途径,即通过确定界面模型来确定应用软件的规格说明,并详细介绍了确定界面模型的方法———OVID(ObjectViewInteractionDesign,对象视图交互设计)。     

A New Approach to Solving Equivalence Problem

An application of a new method for the equivalence recognition in a computation model whose objects are labeled directed graphs is illustrated by the example of multitape automata. The paper is focused on general ideas of the method discussed. An algorithm that recognizes equivalence of multitape automata with disjoint loops is described in detail.