基于UML活动图的测试用例生成

本文首先给出了形式化的UML活动图生成测试场景的覆盖准则,然后依据覆盖准则提出UML活动图转化测试场景的算法(ATOS)将活动图转化为测试场景,最后使用算法(STOT)将测试场景转化为测试用例,有效地解决了UML活动图到测试用例的自动生成,减少了编写测试用例的时间。     

一种基于混合覆盖矩阵的pairwise测试用例生成方法

测试用例集的生成是组合测试的一个关键问题,但是使用完全组合覆盖生成测试用例集是NP完全问题.对偶覆盖要求测试用例集至少覆盖输入参数的每一个取值对.该类方法在测试代价和效率方面进行了很好的折中,一直受到广泛关注.基于混合覆盖矩阵,提出了一种pairwise覆盖的测试用例生成方法.实例分析表明,该方法具有生成的测试用例较少、时间消耗小等特点.     

从测试规格说明到测试用例的自动生成方法

讨论了使用域测试策略生成测试用例的过程 :将测试规格说明 ,即经过预处理的形式规格说明所得到的以析取范式形式表示的线性谓词 ,变换成不等式组 ,然后对每一个不等式组利用 1× 1域测试策略生成域测试矩阵 ,最终得到测试用例包 .提出了一种应用 1× 1域测试策略和线性不等式值转换器来构成一个从测试规格说明生成测试用例的方法 .最后通过一个实例说明如何使用 1× 1域测试策略来实现从测试规格说明到测试用例的自动生成 .     

应用UML2.0模型的测试用例生成方法

针对软件开发过程中测试自动化程度低的问题,在研究基于模型的测试用例生成技术的基础上,提出了一种基于UML2.0序列图与用例描述的测试用例生成方法.采用事件确定有限自动机来描述系统序列图,通过命题投影时序逻辑的模型检测技术,验证了自动机模型的正确性.使用自动机模型与用例描述来生成测试用例,该用例满足事件与全路径覆盖准则.通过对图书管理系统的分析表明,该方法不仅能够提高软件的测试效率,而且还确保了针对管理员的执行动作所产生的测试用例的正确性.     

基于成对测试的GUI测试用例生成方案及实现

在软件开发过程中软件测试的成本很高.其中,测试用例是软件测试的主要组成部分,因此产生合适有效的测试用例是减少软件测试成本的一个主要手段.文章对一个基于成对测试GUI测试用例生成方案及实现展开研究;给出了GUI对象描述、GUI测试用例生成、自动执行以及结果比较的过程;以项目CQMIS为例,使用自动化测试工具QTP,依据所提出的方案实施测试用例生成,效果良好.     

面向城轨列车智能视觉定位的安全测试方法

为了解决基于深度学习的列车智能视觉定位系统难以测试问题，提出一种面向列车智能视觉定位的安全测试方法。基于风格迁移思想，通过构建生成式对抗网络（GAN）实现测试用例的生成；基于深度变异测试方法，实现对测试用例错误检测能力的量化评价；针对城轨运营组织特点，提出一种“虚拟-半实-真实”平行测试平台架构，用于支持测试用例生成模型的构建和测试执行。实验结果表明，本方法生成的测试用例场景种类分布更为均匀多样，能够较为全面地测试模型在不同场景下的安全性，有效提升列车智能视觉定位的测试效率。     

一个基于FSM测试自动化方案与实现

测试自动化是软件测试追求的目标.文章对一个基于FSM测试自动化方案及实现开展研究,给出了基于FSM的测试用例自动生成、测试用例自动执行以及结果自动比较的过程,并提出实现方法;以项目CQMIS为例,使用自动化测试工具RFT,依据提出的基于FSM测试方案实施自动化测试,效果良好.     

基于爬虫的Web测试生成系统的设计与实现

介绍了当前的几种常用Web测试生成技术,提出了基于爬虫的Web测试生成技术,设计并实现了Web测试生成系统,该系统可以自动化完成爬取目标Web应用、处理分析爬取结果、生成测试用例、执行测试用例的功能,并且系统执行过程中输出的分析结果和测试用例可以被其他相关系统如测试覆盖分析系统利用。     

基于程序规则说明的自动测试用例生成

自动测试过程中,在特定测试标准下生成的测试用例的质量优劣,将极大地影响测试的性能和结果.作者结合基于程序规则说明的两种测试方法———随机测试技术和决策表技术,利用决策表形成完备的测试标准,保证随机生成的测试用例的充分性,完成测试用例的自动生成过程.研究内容分为如下4个部分:(1)基于软件规则说明的自动测试技术分析;(2)对程序规则说明生成决策表方法的测试标准;(3)结合随机测试数据生成和决策表技术对自动生成测试用例进行分析,比随机生成测试用例方法有更好的效果.     

基于UML状态图的测试用例自动生成方法

随着UML建模在软件开发中的广泛应用,基于状态图的测试用例自动生成方法逐渐成为规格说明测试中的重要研究方向.在研究了现有测试用例生成方法的基础上,提出了采用函数最小化思想,依据边界测试准则生成测试数据,采用深度优先策略及记忆化搜索高效地生成测试用例.实验结果显示该方法能以较少的测试用例达到较高的路径覆盖率.     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.