In no science or engineering discipline does it make sense to speak of isolated experiments. the results of a single experiment cannot be viewed as representative of the underlying reality. the concept of experiment i...
详细信息
In no science or engineering discipline does it make sense to speak of isolated experiments. the results of a single experiment cannot be viewed as representative of the underlying reality. the concept of experiment is closely related to replication. Experiment replication is the repetition of an experiment to double-check its results. Multiple replications of an experiment increase the credibility of its results. Software engineering has tried its hand at the identical repetition of experiments in the way of the natural sciences (physics, chemistry, etc.). After numerous attempts over the years, excepting experiments repeated by the same researchers at the same site, no exact replications have yet been achieved. One key reason for this is the complexity of the software development setting. this complexity prevents the many experimental conditions from being reproduced identically. this paper reports research into whether non-exact replications can be of any use. We propose a process that allows researchers to generate new knowledge when running non-exact replications. To illustrate the advantages of the proposed process, two different replications of an experiment are shown.
Build systems are responsible for transforming static source code artifacts into executable software. While build systems play such a crucial role in software development and maintenance, they have been largely ignore...
详细信息
Build systems are responsible for transforming static source code artifacts into executable software. While build systems play such a crucial role in software development and maintenance, they have been largely ignored by software evolution researchers. With a firm understanding of build system aging processes, project managers could allocate personnel and resources to build system maintenance tasks more effectively, reducing the build maintenance overhead on regular development activities. In this paper, we study the evolution of ANT build systems from two perspectives: (1) a static perspective, where we examine the build system specifications using software metrics adopted from the source code domain; and (2) a dynamic perspective where representative sample build runs are conducted and their output logs are analyzed. Case studies of four open source ANT build systems with a combined history of 152 releases show that not only do ANT build systems evolve, but also that they need to react in an agile manner to changes in the source code.
Design patterns are codified solutions to common object-oriented design (OOD) problems in software development. One of the proclaimed benefits of the use of design patterns is that they decouple functionality and enab...
详细信息
Design patterns are codified solutions to common object-oriented design (OOD) problems in software development. One of the proclaimed benefits of the use of design patterns is that they decouple functionality and enable different parts of a system to change frequently without undue disruption throughout the system. these OOD patterns have received a wealth of attention in the research community since their introduction; however, identifying them in source code is a difficult problem. In contrast, metapatterns have similar effects on software design by enabling portions of the system to be extended or modified easily, but are purely structural in nature, and thus easier to detect. Our long-term goal is to evaluate the effects of different OOD patterns on coordination in software teams as well as outcomes such as developer productivity and software quality. we present thEX, a metapattern detector that scales to large codebases and works on any Java bytecode. We evaluate thEX by examining its performance on codebases with known design patterns (and therefore metapatterns) and find that it performs quite well, with recall of over 90%.
the proceedings contain 17 papers. the topics discussed include: emerging challenges for large scale systems integration;code generation to support static and dynamic composition of software product lines;efficient co...
ISBN:
(纸本)9781605582672
the proceedings contain 17 papers. the topics discussed include: emerging challenges for large scale systems integration;code generation to support static and dynamic composition of software product lines;efficient compilation techniques for large scale feature models;on the modularity of feature interactions;using modern mathematics as an FOSD modeling language;generating incremental implementations of object-set queries;integrating semantics and compilation;generating customized verifiers for automatically generated code;property models: from incidental algorithms to reusable components;fundamentalist functionalprogramming;feature featherweight Java: a calculus for feature-oriented programming and stepwise refinement;typing communicating component assemblages;and program refactoring using functional aspects.
We analyze various approaches to construct exchange-correlation functionals which are able to describe states of definite spin multiplicity in the density functionaltheory (DFT) realm and outline the characteristics ...
详细信息
We analyze various approaches to construct exchange-correlation functionals which are able to describe states of definite spin multiplicity in the density functionaltheory (DFT) realm and outline the characteristics of possible functionals consistent withthe Kohn-Sham theory. To achieve this goal the unitary group technique is applied to label many-electron states of definite total spin and to calculate the corresponding analogs of the Roothaan coupling coefficients. the possibility of using range separated Coulomb potential of electron-electron interaction for constructing functionals discriminating multiplet states in the d-shells is explored and a tentative system of state-specific functionals, covering nontrivial correlations in d-shells of transition metal ions, is proposed for the Fe2+ ions. (C) 2009 Wiley Periodicals, Inc. Int J Quantum Chem 110: 454-475, 2010
this paper presents a canonical dual approach for solving nonconvex quadratic programming problems subjected to both linear inequality constraints and box constrains. It is proved that the constrained nonconvex primal...
详细信息
this paper presents a canonical dual approach for solving nonconvex quadratic programming problems subjected to both linear inequality constraints and box constrains. It is proved that the constrained nonconvex primal problem can be reformulated as a concave maximization dual problem with zero duality gap, which can be solved under certain conditions. Both global and local extremimality conditions are presented by the triality theory. Several applications are illustrated.
the Perceptron Problem (PP) appeared for the first time in the Learning Machines and is very useful for zero-knowledge identification schemes in cryptology. the problem is NP-complete and no deterministic algorithm is...
详细信息
ISBN:
(纸本)9781424437597
the Perceptron Problem (PP) appeared for the first time in the Learning Machines and is very useful for zero-knowledge identification schemes in cryptology. the problem is NP-complete and no deterministic algorithm is known to date. In this paper we develop a deterministic method based on DC (Difference of Convex functions) programming and DCA (DC optimization Algorithms), an innovative approach in nonconvex programming framework. We first formulate the PP as a concave minimization programming problem. then, we show how to apply DC programming and DCA for the resulting problem. Numerical results demonstrate that the proposed algorithm is promising: its is very fast and can efficiently solve the Perceptron Problem with large sizes.
the nonlinear complementarity problem (NCP) has been served as a general framework for linear, quadratic, and nonlinear programming, linear complementarity problem, and some equilibrium problems. Applications of the N...
详细信息
ISBN:
(纸本)9781424437597
the nonlinear complementarity problem (NCP) has been served as a general framework for linear, quadratic, and nonlinear programming, linear complementarity problem, and some equilibrium problems. Applications of the NCP can be found in many important fields such as economics, mathematical programming, operations research, engineering and mechanics. In this article, we consider smooth NCP on the basis of the square Penalized Fiscber-Burmeister function. We show under certain assumptions, any stationary point of the unconstrained minimization problem is already a solution of smooth NCP. Furthermore, a derivative-free descent algorithm is suggested and conditions for its convergence are given. Finally, some preliminary numerical results are presented.
Web service evaluation is a phase in Web service selection where discovered Web services are evaluated with respect to user requests, which means that the non functional properties (NFPs) offered by Web services are c...
详细信息
ISBN:
(纸本)9780769538549
Web service evaluation is a phase in Web service selection where discovered Web services are evaluated with respect to user requests, which means that the non functional properties (NFPs) offered by Web services are compared withthe non functional properties requested by users. NFPs cover Quality of Service (QoS) aspects, but also other business-related properties, such as pricing, and properties not directly related to the service functionalities. the fact that users and providers can express their NFPs in very flexible ways makes the management of NFP a very complex task. the Policy Centered Meta-model (PCM) is a semantic-oriented model for sophisticated NFP descriptions that can be exploited to support Web service evaluation. In this paper, we propose a novel approach based on Hierarchical Constraint Logic programming to handle PCM-based NFP descriptions along the Web service evaluation phase.
Although linear programming problems can be solved in polynomial time by the ellipsoid method and interior-point algorithms, there still remains a long-standing open problem of devising a strongly polynomial algorithm...
详细信息
Although linear programming problems can be solved in polynomial time by the ellipsoid method and interior-point algorithms, there still remains a long-standing open problem of devising a strongly polynomial algorithm for linear programming (or of disproving the existence of such an algorithm). the present work is motivated by an attempt toward solving this problem. Linear programming problems can be formulated in terms of a zonotope, a kind of greedy polyhedron, on which linear optimization is made easily. We propose a method, called the LP-Newton method, for linear programmingthat is based on the zonotope formulation and the minimum-norm-point algorithm of Philip Wolfe. the LP-Newton method is a finite algorithm even for real-number input data with exact arithmetic computations. We show some preliminary computational results to examine the behavior of the LP-Newton method.
暂无评论