18,081 research outputs found

    Toward the automated assessment of entity-relationship diagrams

    Get PDF
    The need to interpret imprecise diagrams (those with malformed, missing or extraneous features) occurs in the automated assessment of diagrams. We outline our proposal for an architecture to enable the interpretation of imprecise diagrams. We discuss our preliminary work on an assessment tool, developed within this architecture, for automatically grading answers to a computer architecture examination question. Early indications are that performance is similar to that of human markers. We will be using Entity-Relationship Diagrams (ERDs) as the primary application area for our investigation of automated assessment. This paper will detail our reasons for choosing this area and outline the work ahead

    On the Quantum Resolution of Cosmological Singularities using AdS/CFT

    Full text link
    The AdS/CFT correspondence allows us to map a dynamical cosmology to a dual quantum field theory living on the boundary of spacetime. Specifically, we study a five-dimensional model cosmology in type IIB supergravity, where the dual theory is an unstable deformation of N=4\N=4 supersymmetric SU(N) gauge theory on \Rbar\times S^3. A one-loop computation shows that the coupling governing the instability is asymptotically free, so quantum corrections cannot turn the potential around. The big crunch singularity in the bulk occurs when a boundary scalar field runs to infinity, in finite time. Consistent quantum evolution requires that we impose boundary conditions at infinite scalar field, i.e. a self-adjoint extension of the system. We find that quantum spreading of the homogeneous mode of the boundary scalar leads to a natural UV cutoff in particle production as the wavefunction for the homogeneous mode bounces back from infinity. However a perturbative calculation indicates that despite this, the logarithmic running of the boundary coupling governing the instability generally leads to significant particle production across the bounce. This prevents the wave packet of the homogeneous boundary scalar to return close to its initial form. Translating back to the bulk theory, we conclude that a quantum transition from a big crunch to a big bang is an improbable outcome of cosmological evolution in this class of five-dimensional models.Comment: 91 pages, 24 figures; v2: minor reorganization of introduction, clarifying comments throughout; 77 pages, 22 figures;v5: error corrected which significantly changes conclusio

    Automatic assessment of sequence diagrams

    Get PDF
    In previous work we showed how student-produced entity-relationship diagrams (ERDs) could be automatically marked with good accuracy when compared with human markers. In this paper we report how effective the same techniques are when applied to syntactically similar UML sequence diagrams and discuss some issues that arise which did not occur with ERDs. We have found that, on a corpus of 100 student-drawn sequence diagrams, the automatic marking technique is more reliable that human markers. In addition, an analysis of this corpus revealed significant syntax errors in student-drawn sequence diagrams. We used the information obtained from the analysis to build a tool that not only detects syntax errors but also provides feedback in diagrammatic form. The tool has been extended to incorporate the automatic marker to provide a revision tool for learning how to model with sequence diagrams

    Permanents, Pfaffian orientations, and even directed circuits

    Full text link
    Given a 0-1 square matrix A, when can some of the 1's be changed to -1's in such a way that the permanent of A equals the determinant of the modified matrix? When does a real square matrix have the property that every real matrix with the same sign pattern (that is, the corresponding entries either have the same sign or are both zero) is nonsingular? When is a hypergraph with n vertices and n hyperedges minimally nonbipartite? When does a bipartite graph have a "Pfaffian orientation"? Given a digraph, does it have no directed circuit of even length? Given a digraph, does it have a subdivision with no even directed circuit? It is known that all of the above problems are equivalent. We prove a structural characterization of the feasible instances, which implies a polynomial-time algorithm to solve all of the above problems. The structural characterization says, roughly speaking, that a bipartite graph has a Pfaffian orientation if and only if it can be obtained by piecing together (in a specified way) planar bipartite graphs and one sporadic nonplanar bipartite graph.Comment: 47 pages, published versio
    corecore