Search Constraints

Start Over
Filtering by: Creator Lipton, R. Remove constraint Creator: Lipton, R. Academic Affiliation Electrical Engineering and Computer Science Remove constraint Academic Affiliation: Electrical Engineering and Computer Science

Search Results

  • Structural Results and Approximation Algorithms in Minor-free Graphs

    Creator:
    Le, Hung V.
    Abstract:
    Planarity has been successfully exploited to design faster and more accurate approximation algorithms for many graph optimization problems. The celebrated theorem of Kuratowski completely characterizes planar graphs as those excluding K_5 and K_{3,3} as minors. Kuratowski's theorem allows one to generalize planar graphs to H-minor-free graphs: those that exclude a...
    Resource Type:
    Dissertation
    Full Text:
    ) simple local search PTASes for r-dominating set and feedback vertex set problems. We then present

  • Approximation Schemes in Planar Graphs

    Creator:
    Zheng, Baigong
    Abstract:
    There are growing interests in designing polynomial-time approximation schemes (PTAS) for optimization problems in planar graphs. Many NP-hard problems are shown to admit PTAS in planar graphs in the last decade, including Steiner tree, Steiner forest, two- edge-connected subgraphs and so on. We follow this research line and study several...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . . . . . . . 26 2.2.3 Properties of Minimal (Q, r)-vertex-connected Graphs . . . . . . . 27 2.2.4 Cycles Must

  • On the limits of mutation analysis

    Creator:
    Gopinath, Rahul
    Abstract:
    Mutation analysis is the gold standard for evaluating test-suite adequacy. It involves exhaustive seeding of all small faults in a program and evaluating the effectiveness of test suites in detecting these faults. Mutation analysis subsumes numerous structural coverage criteria, approximates fault detection capability of test suites, and the faults produced...
    Resource Type:
    Dissertation
    Full Text:
    faults? 2.1 Introduction Mutation analysis is a fault injection technique originally proposed by Lipton

  • An empirical comparison of mutant selection approaches

    Creator:
    Gopinath, Rahul, Alipour, Amin, Ahmed, Iftekhar, Jensen, Carlos, and Groce, Alex
    Abstract:
    Mutation analysis is a well-known method for measuring the quality of test suites. However, it is computationally intensive compared to other measures, which makes it hard to use in practice. Choosing a smaller subset of mutations to run is a simple approach that can alleviate this problem. Mutation operator selection...
    Resource Type:
    Technical Report
    Full Text:
    (5):649–678, 2011. [15] R. J. Lipton. Fault diagnosis of computer programs. Technical report

  • Mutation testing of spreadsheets

    Creator:
    Abraham, Robin, Erwig, Martin, and Oregon State University. School of Electrical Engineering and Computer Science
    Abstract:
    We present a catalog of mutation operators for spreadsheets drawn from research into mutation testing for general purpose programming languages and from spreadsheet errors that have been reported in literature. These operators are integrated into a system, called μTest, which allows users to create and maintain spreadsheet test cases. Three...
    Resource Type:
    Technical Report
    Full Text:
    region-representative formula. 12 cell index (c, r) in b to (c− cx +1, r− ry +1) where cx and ry are

  • Automatic Explanations of Computation Results with Value Decompositions and Dominating Sets

    Creator:
    Kumar, Prashant
    Abstract:
    In an increasingly computation-driven world, algorithms and mathematical models significantly impact decision making across various fields. To foster trust and understanding, it is crucial to provide users with clear and concise explanations of the reasoning behind the results produced by computational tools, especially when recommendations appear counterintuitive. Legal frameworks in...
    Resource Type:
    Dissertation
    Full Text:
    between r and p in the bridge selection example. . . . . . . . . . . . 124 6.11 AHP model for predicting

  • Image Based Crypto

    Creator:
    Basa, Gungor
    Abstract:
    The ability to create reproducible cryptographically secure keys from temporal environments (e.g., images) has the potential to be a contributor to effective cryptographic mechanisms. Due to the noisy nature of these environments, achieving this goal in a user friendly fashion is a very challenging task, especially since there exists a...
    Resource Type:
    Masters Thesis
    Full Text:
    secret respectively. q and p be primes and q, r are co prime to each other such that |q| = κ, |r| = `, p

  • Awgsome Fault Injection: In-Depth Analysis of Waveform Generation for Voltage Glitches

    Creator:
    Lyakhov, Stanislav
    Abstract:
    Voltage fault injection is a technique to disrupt power supply, such that the data or instruction flow in a microcontroller can be modified. Recently, a new class of voltage glitches was introduced termed arbitrary wave voltage glitches. Despite its demonstrated success in practical studies it comes with additional challenges, such...
    Resource Type:
    Masters Thesis

  • Improving the Quality of Software Using Mutation Testing and Fault Prediction

    Creator:
    Ahmed, Iftekhar
    Abstract:
    Our confidence in software systems depends on our confidence in the exhaustiveness of our testing. As software systems get more complex, the task of exhaustive testing becomes more complex and even infeasible in some cases. In order to build less error prone systems, we therefore need to not only focus...
    Resource Type:
    Dissertation
    Full Text:
    . 1.1.1 Mutation Analysis The idea of mutation analysis was first proposed by Lipton [137]. Mutation

  • Anomaly Detection and Probabilistic Diagnosis for Automated Data Quality Control

    Creator:
    Zemicheal, Tadesse H.
    Abstract:
    Advances in sensor technology are greatly expanding the range of quantities that can be measured while simultaneously reducing the cost. However, deployed sensors drift out of calibration and fail, so every sensor network requires quality control procedures to promptly detect these failures. To address these problems, we propose a two-level...
    Resource Type:
    Dissertation
    Full Text:
    recalibrate the sensors. Hence, we need to include a variable r(t) that is 1 if a technician has visited the