Withthe development of automotive industry and transportation, the safety of transportation is huge invisible trouble by bringing great convenience to human being for many years. As result, the reappearance for the s...
详细信息
this paper quantitatively studies the trace effects to the performance and accuracy of the BigSim Emulator, a scalable parallel emulator for large-scale computers. To assess the accuracy effect we modify the emulator ...
详细信息
Exploiting solution counting information from individual constraints has led to some of the most efficient search heuristics in constraint programming. However, evaluating the number of solutions for the alldifferent ...
详细信息
ISBN:
(纸本)9783642135194
Exploiting solution counting information from individual constraints has led to some of the most efficient search heuristics in constraint programming. However, evaluating the number of solutions for the alldifferent constraint still presents a challenge: even though previous approaches based on sampling were extremely effective on hard instances, they are not competitive on easy to medium difficulty instances due to their significant computational overhead. In this paper we explore a new approach based on upper bounds, trading counting accuracy for a significant speedup of the procedure. Experimental results show a marked improvement on easy instances and even some improvement on hard instances. We believe that the proposed method is a crucial step to broaden the applicability of solution counting-based search heuristics.
State-of-the-art solvers for mixed integer programming (MIP) problems are highly parameterized, and finding parameter settings that achieve high performance for specific types of MIP instances is challenging. We study...
详细信息
ISBN:
(纸本)9783642135194
State-of-the-art solvers for mixed integer programming (MIP) problems are highly parameterized, and finding parameter settings that achieve high performance for specific types of MIP instances is challenging. We study the application of an automated algorithm configuration procedure to different MIP solvers, instance types and optimization objectives. We show that this fully-automated process yields substantial improvements to the performance of three MIP solvers: CPLEX, GUROBI, and LPSOLVE. Although our method can be used "out of the box" without any domain knowledge specific to MIP, we show that it outperforms the CPLEX special-purpose automated tuning tool.
Because of their self-x properties Organic Computing systems are hard to verify. Nevertheless in safety critical domains one may want to give behavioral guarantees. One technique to reduce complexity of the overall ve...
详细信息
ISBN:
(纸本)9783642165757
Because of their self-x properties Organic Computing systems are hard to verify. Nevertheless in safety critical domains one may want to give behavioral guarantees. One technique to reduce complexity of the overall verification task is applying composition theorem. In this paper we present a technique for formal specification and compositional verification of Organic Computing systems. Separation of self-x and functional behavior has amongst others, advantages for the formal specification. We present how the specification of self-x behavior can be integrated into an approach for compositional verification of concurrent systems, based on Interval Temporal Logic. the presented approach has full tool support withthe KIV interactive theorem prover.
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for a redundant knapsack constraint whic...
详细信息
ISBN:
(纸本)9783642135194
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for a redundant knapsack constraint which is obtained by surrogate relaxation. We then consider a Lagrangian relaxation of the original problem to obtain an initial weight bound on the knapsack. this bound is then refined through subgradient optimization. the latter provides a variety of Lagrange multipliers which allow us to filter infeasible edges in the DP table. the number of paths in the final table then provides an upper bound on the number of solutions. Numerical results show the effectiveness of our counting framework on automatic recording and market split problems.
the paper describes an algorithm that constructs approximate decision trees (alpha-decision trees), which are optimal relatively to one of the following complexity measures: depth, total path length or number of nodes...
详细信息
ISBN:
(纸本)9783642135286
the paper describes an algorithm that constructs approximate decision trees (alpha-decision trees), which are optimal relatively to one of the following complexity measures: depth, total path length or number of nodes. the algorithm uses dynamic programming and extends methods described in [4] to constructing approximate decision trees. Adjustable approximation rate allows controlling algorithm complexity. the algorithm is applied to build optimal alpha-decision trees for two data sets from UCI Machine Learning Repository [1].
Nowadays one key question for most organizations is which of the agile practices should be implemented to improve product quality. this systematic literature review surveys studies published up to and including 2009 a...
详细信息
ISBN:
(纸本)9780769542416
Nowadays one key question for most organizations is which of the agile practices should be implemented to improve product quality. this systematic literature review surveys studies published up to and including 2009 and attempts to present and evaluate the empirical findings regarding quality in agile practices. the studies were classified into three groups: test driven or test first development, pair programming, and miscellaneous agile practices and methods. the findings of most studies suggest that agile practices can improve quality if they are implemented correctly. the significant findings of this study, in conjunction with previous research, could be used as guidelines for practitioners on their own settings and situations.
Problems of signal analysis may be practically always considered as those of recovering some hidden dependences, which are time-varying in the general case. In many situations, the nostationarity mode of the dependenc...
详细信息
ISBN:
(纸本)9780889868236
Problems of signal analysis may be practically always considered as those of recovering some hidden dependences, which are time-varying in the general case. In many situations, the nostationarity mode of the dependence should be expected to change in the observation interval, maybe with some jumps or spikes. In this work, we consider a statistical framework and a family of respective algorithm for time-varying linear regression estimation which preserve essential peculiarities in basically smoothly changing regression coefficients. the method being proposed is simple in tuning and has linear computational complexity with respect to the signal length. In particular, we show how this technique allows to watch the dynamics of the hidden asset composition of an investment portfolio from publicly available data withthe purpose of detecting sharp changes in its investment strategy.
Software metrics provide essential means for software practitioners to assess its quality. However, to assess software quality, it is important to assess its UML models because of UML wide and recent usage as an objec...
详细信息
ISBN:
(纸本)9789774033964
Software metrics provide essential means for software practitioners to assess its quality. However, to assess software quality, it is important to assess its UML models because of UML wide and recent usage as an object-oriented modeling language. But the issue is which type of software metrics can be utilized on UML models. One of the most important software metrics suite is Chidamber and Kemerer metrics suite, known by CK suite [1]. In the current work, an automated tool is developed to compute the six CK metrics by gathering the required information from class diagrams, activity diagrams, and sequence diagrams. In addition, extra information is collected from system designer, such as the relation between methods and their corresponding activity diagrams and which attributes they use. the proposed automated tool operates on XMI standard file format [10] to provide independence from a specific UML tool. To evaluate the applicability and quality of this tool, it has been applied to two examples: an online registration system and one of the bioinformatics Microarray tools (MIDAS).
暂无评论