Increasing testing productivity and software quality: A comparison of software testing methodologies within NASA

Pressure to compress the development life cycle and reduce the duration and resources committed to testing lead to experimentation in testing at the NASA Goddard Space Flight Centerís Software Engineering Laboratory. This study investigates the trend to reduce developer testing and increasingly rely upon inspection techniques and independent functional testing to shorten the development life cycle, improve testing productivity, and improve software quality.An approach is developed to conduct this comparison. In particular, the problem faced by software researchers, having a comprehensive characterization of software projects so similar types may be identified for comparative studies, is addressed using expert opinion.     

Stability of impulsive stochastic functional differential systems in terms of two measures via comparison approach

Comparison principles for general impulsive stochastic functional differential systems are established.Employing the comparison principles and the theory of differential inequalities,stability and instability,involving two measures,of impulsive stochastic functional differential systems are investigated.Several stability and instability criteria are obtained,and two examples are also given to illustrate our results.     

处理器验证激励在线筛选技术

如何生成高质量的验证激励是功能验证中的核心问题之一.随着功能验证的不断进行,验证激励的有效性也随之降低.为了提高验证激励的质量,提出一种在线筛选技术来处理验证激励.该技术采用单分类支持向量机来在线地构建分类器,以对新生成的验证激励是否冗余进行预测,如果是冗余的,则不进入仿真阶段进行仿真.在此基础上,进一步提出指令序列核函数来衡量不同指令序列的相似程度.实验结果表明,与约束随机生成技术相比,文中技术可以减少约83%的验证激励及79%的验证时间.     

城市水土保持区划及功能性评价研究——以宜昌市为例

目前全国地级市水土保持区划工作滞后,宜昌市作为湖北省域副中心城市,城市水土流失严重。为突出地方特色、因地制宜地指导地方水土保持区划工作的落地实施,以宜昌市为例,在国家、省级水土保持区划成果的基础上,紧密结合宜昌市地方特点,逐步进行细化,形成宜昌市水土保持四级区划,并对区划成果进行基本功能分析评价。 宜昌市水土保持区划使用四级分区体系,前三级区划沿用国家水土保持区划中一级、二级、三级分区范围;四级区被分为6个水土保持片区:沿江平原丘陵农田防护区、香溪河山地生态维护区、三峡库区山地丘陵保土区、沮漳河山地丘陵保土区、清江山地水源涵养保土区以及中心城区人居环境维护区。全市共涉及5个水土保持基本功能,分别为农田防护、生态维护、土壤保持、水源涵养和人居环境维护。地级市水土保持区划分区既要在国家、省级水土保持区划基础上进行,同时还需突出地方特点,因地制宜。宜昌市水土流失治理应坚持预防为主,保护水源,并加强水土保持重点监管。     

Robust pole assignment for incomplete nonlinear decoupling applied to robots

A robustness analysis and synthesis for incomplete nonlinear decoupling for a class of nonlinear systems is discussed. Rigid and elastic-joint robot models belong to this class. For the elastic case, a transformation facilitates the robustness analysis under a weak assumption. Charts with H ₁- and H - norms of closed-loop disturbance transfer functions of the nonlinear-decoupled system are presented for a robust pole assignment.     

基于功能磁共振成像的人脑效应连接网络识别方法综述

人脑效应连接网络刻画了脑区间神经活动的因果效应. 对不同人群的脑效应连接网络进行研究不仅能为神经精神疾病病理机制的理解提供新视角, 而且能为疾病的早期诊断和治疗评价提供新的脑网络影像学标记, 具有十分重要的理论意义和应用价值. 利用计算方法从功能磁共振成像(Functional magnetic resonance imaging, fMRI)数据中识别脑效应连接网络是目前人脑连接组学中一项重要的研究课题. 本文首先概括了从fMRI数据中进行脑效应连接网络识别的主要流程, 说明了其中的主要步骤和方法; 然后, 给出了一种脑效应连接网络识别方法的分类体系, 并对其中一些代表性的识别算法进行了阐述; 最后, 通过对该领域挑战性问题的分析, 预测了脑效应连接网络识别未来的研究方向, 以期对相关研究提供一定的参考.     

Discretized LKF method for stability of coupled differential‐difference equations with multiple discrete and distributed delays

Time‐delay systems described by coupled differential‐functional equations include as special cases many types of time‐delay systems and coupled differential‐difference systems with time delays. This article discusses the discretized Lyapunov–Krasovskii functional (LKF) method for the stability problem of coupled differential‐difference equations with multiple discrete and distributed delays. Through independently dividing every delay region that the plane regions consists in two delays to discretize LKF, the exponential stability conditions for coupled systems with multiple discrete and distributed delays are established based on a linear matrix inequality (LMI). The numerical examples show that the analysis limit of delay bound in which the systems are stable may be approached by our result. Copyright © 2011 John Wiley & Sons, Ltd.     

Globally asymptotic stabilization for nonlinear time-delay systems with ISS inverse dynamics

The output feedback stabilization is considered for a class of nonlinear time-delay systems with inverse dynamics in this paper.An appropriate state observer is constructed for the unmeasurable system states in order to realize the control objective.By adopting the backstepping and Lyapunov-Krasovskii functional methods,a systematic design procedure for a memoryless output feedback control law is presented.It is shown that the designed controller can make the closed-loop system globally asymptotically stable while keeping all signals bounded.An illustrative example is discussed to show the effectiveness of the proposed control strategy.     

Augmented Lyapunov functional approach for stability of neutral systems with mixed delays

This paper is concerned with the neutral‐delay‐dependent and discrete‐delay‐dependent stability for uncertain neutral systems with mixed delays and norm‐bounded uncertainties. Through constructing a new augmented Lyapunov‐Krasovskii functional and proving its positive definiteness, introducing some slack matrices and using integral inequality, the improved delay‐dependent stability criteria are derived in terms of linear matrix inequalities. Numerical examples are given to illustrate the significant improvement on the conservatism of the delay bound over some existing results. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Modal logic as metalogic

The goal of this paper is to show how modal logic may be conceived as recording the derived rules of a logical system in the system itself. This conception of modal logic was propounded by Dana Scott in the early seventies. Here, similar ideas are pursued in a context less classical than Scott's.First a family of propositional logical systems is considered, which is obtained by gradually adding structural rules to a variant of the nonassociative Lambek calculus. In this family one finds systems that correspond to the associative Lambek calculus, linear logic, relevant logics, BCK logic and intuitionistic logic. Above these basic systems, sequent systems parallel to the basic systems are constructed, which formalize various notions of derived rules for the basic systems. The deduction theorem is provable for the basic systems if, and only if, they are at least as strong as systems corresponding to linear logic, or BCK logic, depending on the language, and their deductive metalogic is not stronger than they are.However, though we do not always have the deduction theorem, we may always obtain a modal analogue of the deduction theorem for conservative modal extensions of the basic systems. Modal postulates which are necessary and sufficient for that are postulates of S4 plus modal postulates which mimic structural rules. For example, the modal postulates which Girard has recently considered in linear logic are necessary and sufficient for the modal analogue of the deduction theorem.All this may lead towards results about functional completeness in categories. When functional completeness, which is analogous to the deduction theorem, fails, we may perhaps envisage a modal analogue of functional completeness in a modal category, of which our original category is a full subcategory.