Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 20 for “"Constraint Systems"”.

  1. Analyzing Satisfiability and Refutability in Selected Constraint Systems

    … and refutability problems for several constraint systems. We examine both Boolean constraint systems, in which each variable is limited to the values true and false, and polyhedral constraint systems, in which each variable is limited to the set of real numbers R in the case of linear …

    wvu Repository record for Analyzing Satisfiability and Refutability in Selected Constraint Systems (opens in a new tab)

  2. Effective Static Debugging via Compential Set-Based Analysis

    Sophisticated software systems are inherently complex. Understanding, debugging and maintaining such systems requires inferring high-level characteristics of the system's behavior from a myriad of low-level details. For large systems, this quickly becomes an extremely difficult task. MrSpidey is a …

    rice Repository record for Effective Static Debugging via Compential Set-Based Analysis (opens in a new tab)

  3. Constraint microKanren in the CLP Scheme

    Programmers in related constraint-logic languages should have language semantics that span different implementations and enable reasoning generally about the shared parts of languages’ behaviors while reflecting their differences. A wide class of miniKanren languages are syntactic extensions over a …

    iu Repository record for Constraint microKanren in the CLP Scheme (opens in a new tab)

  4. Combining over- and under-approximating program analyses for automatic software testing

    … analysis by solving the produced constraint systems and generating and executing concrete test-cases that satisfy the given constraint systems. Only test-cases that confirm the results of the over-approximating static analysis are presented to the user. This technique has the …

    gatech Repository record for Combining over- and under-approximating program analyses for automatic software testing (opens in a new tab)

  5. Observables and dynamics in quantum gravity

    The treatment of quantum constraint theories in physics is considered. These systems exist in many different branches of physics. One noticeable case is the quantum theory of gravity (which is a completely constraint system). We contrast two modern methods of solving such quantum constraint …

    ubc Repository record for Observables and dynamics in quantum gravity (opens in a new tab) Download PDF for Observables and dynamics in quantum gravity (opens in a new tab)

  6. ΜΕΛΕΤΗ ΤΟΥ ΤΕΤΡΑΔΙΑΣΤΑΤΟΥ ΠΡΟΤΥΠΟΥ WESS-ZUMINO-WITTEN ΩΣ ΣΥΣΤΗΜΑΤΟΣ ΜΕ ΔΕΣΜΟΥΣ

    … WE APPLIED THE FJ FORMALISM FOR CONSTRAINED SYSTEMS TO THETWO AND THREE FLAVOUR WZW MODEL COUPLED TO THE ELECTROMAGNETIC FIELD. WE TREATED THESE CONSTRAINED LAGRANGIAN DENSITIES USING THE FJ FORMALISM, AND WE OBTAINED UNCONSTRAINED COU LOMB-GAUGO EXPRESSION FOR THEM, WHICH INCLUDE NONLOCAL …

    greece Repository record for ΜΕΛΕΤΗ ΤΟΥ ΤΕΤΡΑΔΙΑΣΤΑΤΟΥ ΠΡΟΤΥΠΟΥ WESS-ZUMINO-WITTEN ΩΣ ΣΥΣΤΗΜΑΤΟΣ ΜΕ ΔΕΣΜΟΥΣ (opens in a new tab)

  7. Reducing the storage requirements of dataflow constraints using model dependencies

    <p>Dataflow constraints allow programmers to specify relationships among application objects in a natural,declarative manner. Most constraint solvers represent these dataflow relationships as directed edges in a dependency graph. Unfortunately, dependency graphs require a great deal of storage. …

    utk-theses Repository record for Reducing the storage requirements of dataflow constraints using model dependencies (opens in a new tab)

  8. LOW-RANK AUGMENTED LAGRANGIAN METHODS FOR SDP RELAXATIONS

    … structure and reformulates factorized quadratic constraints as manageable affine constraints. For problems with additional inequalities, RiNNAL+ combines a low-rank Riemannian phase with a convex lifting phase that adjusts the rank and escapes spurious local minima. The thesis further presents …

    nus Repository record for LOW-RANK AUGMENTED LAGRANGIAN METHODS FOR SDP RELAXATIONS (opens in a new tab) Download file for LOW-RANK AUGMENTED LAGRANGIAN METHODS FOR SDP RELAXATIONS (opens in a new tab)

  9. Optimization Enabled Kalman Smoothing

    … the presence of auto-correlated noise, bias, and constraint systems. We also consider simultaneous parameter estimation and provide second-order methods for these problems, even when covariance matrices are singular. This captures ARMA and many physics based models. We also develop second-order …

    washington Repository record for Optimization Enabled Kalman Smoothing (opens in a new tab)

  10. CONC++ : a constraint extension to the C++ programming language

    … toolkits currently in use provide some type of constraint system. Constraint systems automatically maintain relationships between variables in an application without explicit instructions from the programmer. CONC++ provides a constraint system independent of a GUI toolkit. Specifically, it …

    ut-knoxville Repository record for CONC++ : a constraint extension to the C++ programming language (opens in a new tab)

  11. Classical simulations of quantum systems using stabilizer decompositions

    … simulations of quantum circuits. Linear constraint systems (LCSs) are a generalization of the well-known Peres-Mermin magic square, which has been recently used to prove a separation between the power of constant depth classical and quantum circuits. While binary LCSs have been studied in …

    waterloo Repository record for Classical simulations of quantum systems using stabilizer decompositions (opens in a new tab)

  12. Reusable User Interface Behaviors

    … formalism for user interfaces based on ordered constraint systems. Using explicit models for the values and relationships in a user interface, several reusable algorithms are defined for rich user interface behaviors, including value propagation, dataflow visualization, pinning, scripting, …

    tamu Repository record for Reusable User Interface Behaviors (opens in a new tab)

  13. Variational Analysis In Second-Order Cone Programming And Applications

    … vital second-order information of functions/constraint systems under investigation. Our main contribution is threefold: - proving the twice epi-differentiability of the indicator function of the second-order cone and of the augmented Lagrangian associated with SOCPs, and deriving explicit …

    wayne-thes Repository record for Variational Analysis In Second-Order Cone Programming And Applications (opens in a new tab)

  14. Optimal certifying algorithms for linear and lattice point feasibility in a system of UTVPI constraints

    … and lattice point feasibility of a class of constraints called Unit Two Variable Per Inequality (UTVPI) constraints. In a UTVPI constraint, there are at most two non-zero variables per constraint, and the coefficients of the non-zero variables belong to the set {lcub}+1, --1{rcub}. These …

    wvu Repository record for Optimal certifying algorithms for linear and lattice point feasibility in a system of UTVPI constraints (opens in a new tab)

  15. Building a Typed Scripting Language

    … for it. Our type theory is based on subtype constraint systems but is also closely related to abstract interpretation; we use this connection to guide development of the type system and to employ a novel type soundness proof strategy based on simulation. At the heart of our approach is a type …

    jhu Repository record for Building a Typed Scripting Language (opens in a new tab)

  16. Towards Low-cost Feature-rich Web User Interfaces

    Web-based user interfaces are used widely. They are replacing conventional desktop-based user interfaces in many domains and are emerging as front-ends for online businesses. The technologies for web user interfaces have advanced considerably to support high-quality user interfaces. However, the …

    tamu Repository record for Towards Low-cost Feature-rich Web User Interfaces (opens in a new tab)

  17. Near-optimal quantum strategies for nonlocal games, approximate representations, and BCS algebras

    … states on the tensor product of operator systems which model quantum measurement scenarios. In the paradigm of nonlocal games, this perspective illustrates a connection between optimal strategies and certain representations of a finitely presented $*$-algebra affiliated with the nonlocal …

    waterloo Repository record for Near-optimal quantum strategies for nonlocal games, approximate representations, and BCS algebras (opens in a new tab)

  18. Guaranteeing Responsiveness and Consistency in Dynamic, Asynchronous Graphical User Interfaces

    This dissertation proposes a programming model for Graphical User Interfaces (GUIs) that relieves the programmer of a difficult and error-prone task: orchestrating concurrent responses to events to ensure data dependencies are always enforced correctly. In this programming model, rather than …

    tamu Repository record for Guaranteeing Responsiveness and Consistency in Dynamic, Asynchronous Graphical User Interfaces (opens in a new tab)

  19. Conditioning-guided constraint design for reliable learning under weak supervision

    … and a collection of \emph{consistency constraints} (e.g., cycle consistency, path consistency, temporal consistency, or rendering-based constraints). A recurring failure mode in such systems is not merely model capacity, but \emph{ill-conditioned optimization and inversion}: different …

    texas Repository record for Conditioning-guided constraint design for reliable learning under weak supervision (opens in a new tab)

  20. The complexity of constraint system games with entanglement

    Constraint satisfaction problems (CSPs) are a natural class of decision problems where one must decide whether there is an assignment to variables that satisfies a given formula. Schaefer's dichotomy theorem and its extension to all alphabets due to Bulatov and Zhuk, shows that CSP languages are …

    waterloo Repository record for The complexity of constraint system games with entanglement (opens in a new tab)