321,226 research outputs found

    Chaining Test Cases for Reactive System Testing (extended version)

    Full text link
    Testing of synchronous reactive systems is challenging because long input sequences are often needed to drive them into a state at which a desired feature can be tested. This is particularly problematic in on-target testing, where a system is tested in its real-life application environment and the time required for resetting is high. This paper presents an approach to discovering a test case chain---a single software execution that covers a group of test goals and minimises overall test execution time. Our technique targets the scenario in which test goals for the requirements are given as safety properties. We give conditions for the existence and minimality of a single test case chain and minimise the number of test chains if a single test chain is infeasible. We report experimental results with a prototype tool for C code generated from Simulink models and compare it to state-of-the-art test suite generators.Comment: extended version of paper published at ICTSS'1

    Family, learning environments, learning approaches, and student outcomes in a Malaysian private university

    Get PDF
    This paper presents the quantitative findings from a mixed methods study of students and faculty at a private medical university in Malaysia. In particular, the relationships among students’ individual characteristics, general self-efficacy, family context, university and classroom learning environments, curriculum, approaches to learning, and measures of students’ academic achievement, self-directed learning readiness and mental health at the student level. Data were collected from 392 students attending a private medical university in Malaysia. The findings from the partial least square path (PLSPATH) suggest that: (a) parental involvement continues to impact and influence student learning process, and related student outcomes, at the university level, and (b) a surface approach to learning is related to poor quality processes and outcomes and a deep approach to learning is related to high quality processes and outcomes

    Entanglement preparation using symmetric multiports

    Full text link
    We investigate the entanglement produced by a multi-path interferometer that is composed of two symmetric multiports, with phase shifts applied to the output of the first multiport. Particular attention is paid to the case when we have a single photon entering the interferometer. For this situation we derive a simple condition that characterize the types of entanglement that one can generate. We then show how one can use the results from the single photon case to determine what kinds of multi-photon entangled states one can prepare using the interferometer.Comment: 6 pages, 2 figures, accepted for publication in European Journal of Physics

    Resource utilization model for the algorithm to architecture mapping model

    Get PDF
    The analytical model for resource utilization and the variable node time and conditional node model for the enhanced ATAMM model for a real-time data flow architecture are presented in this research. The Algorithm To Architecture Mapping Model, ATAMM, is a Petri net based graph theoretic model developed at Old Dominion University, and is capable of modeling the execution of large-grained algorithms on a real-time data flow architecture. Using the resource utilization model, the resource envelope may be obtained directly from a given graph and, consequently, the maximum number of required resources may be evaluated. The node timing diagram for one iteration period may be obtained using the analytical resource envelope. The variable node time model, which describes the change in resource requirement for the execution of an algorithm under node time variation, is useful to expand the applicability of the ATAMM model to heterogeneous architectures. The model also describes a method of detecting the presence of resource limited mode and its subsequent prevention. Graphs with conditional nodes are shown to be reduced to equivalent graphs with time varying nodes and, subsequently, may be analyzed using the variable node time model to determine resource requirements. Case studies are performed on three graphs for the illustration of applicability of the analytical theories

    Dynamic Dominators and Low-High Orders in DAGs

    Get PDF
    We consider practical algorithms for maintaining the dominator tree and a low-high order in directed acyclic graphs (DAGs) subject to dynamic operations. Let G be a directed graph with a distinguished start vertex s. The dominator tree D of G is a tree rooted at s, such that a vertex v is an ancestor of a vertex w if and only if all paths from s to w in G include v. The dominator tree is a central tool in program optimization and code generation, and has many applications in other diverse areas including constraint programming, circuit testing, biology, and in algorithms for graph connectivity problems. A low-high order of G is a preorder of D that certifies the correctness of D, and has further applications in connectivity and path-determination problems. We first provide a practical and carefully engineered version of a recent algorithm [ICALP 2017] for maintaining the dominator tree of a DAG through a sequence of edge deletions. The algorithm runs in O(mn) total time and O(m) space, where n is the number of vertices and m is the number of edges before any deletion. In addition, we present a new algorithm that maintains a low-high order of a DAG under edge deletions within the same bounds. Both results extend to the case of reducible graphs (a class that includes DAGs). Furthermore, we present a fully dynamic algorithm for maintaining the dominator tree of a DAG under an intermixed sequence of edge insertions and deletions. Although it does not maintain the O(mn) worst-case bound of the decremental algorithm, our experiments highlight that the fully dynamic algorithm performs very well in practice. Finally, we study the practical efficiency of all our algorithms by conducting an extensive experimental study on real-world and synthetic graphs

    Entanglement preparation using symmetric multiports

    Full text link
    We investigate the entanglement produced by a multi-path interferometer that is composed of two symmetric multiports, with phase shifts applied to the output of the first multiport. Particular attention is paid to the case when we have a single photon entering the interferometer. For this situation we derive a simple condition that characterize the types of entanglement that one can generate. We then show how one can use the results from the single photon case to determine what kinds of multi-photon entangled states one can prepare using the interferometer.Comment: 6 pages, 2 figures, accepted for publication in European Journal of Physics

    Combined Global and Local Search for the Falsification of Hybrid Systems

    Full text link
    In this paper we solve the problem of finding a trajectory that shows that a given hybrid dynamical system with deterministic evolution leaves a given set of states considered to be safe. The algorithm combines local with global search for achieving both efficiency and global convergence. In local search, it exploits derivatives for efficient computation. Unlike other methods for falsification of hybrid systems with deterministic evolution, we do not restrict our search to trajectories of a certain bounded length but search for error trajectories of arbitrary length

    A Perfect Match for Reasoning, Explanation, and Reason Maintenance

    Get PDF
    Path query languages have been previously shown to com- plement RDF rule languages in a natural way and have been used as a means to implement the RDFS derivation rules. RPL is a novel path query language specifically designed to be incorporated with RDF rules and comes in three avors: Node-, edge- and path- avored expressions allow to express conditional regular expressions over the nodes, edges, or nodes and edges appearing on paths within RDF graphs. Providing reg- ular string expressions and negation, RPL is more expressive than other RDF path languages that have been proposed. We give a compositional semantics for RPL and show that it can be evaluated efficiently, while several possible extensions of it cannot
    corecore