4,674 research outputs found

    Revisiting the Core Ontology and Problem in Requirements Engineering

    Full text link
    In their seminal paper in the ACM Transactions on Software Engineering and Methodology, Zave and Jackson established a core ontology for Requirements Engineering (RE) and used it to formulate the "requirements problem", thereby defining what it means to successfully complete RE. Given that stakeholders of the system-to-be communicate the information needed to perform RE, we show that Zave and Jackson's ontology is incomplete. It does not cover all types of basic concerns that the stakeholders communicate. These include beliefs, desires, intentions, and attitudes. In response, we propose a core ontology that covers these concerns and is grounded in sound conceptual foundations resting on a foundational ontology. The new core ontology for RE leads to a new formulation of the requirements problem that extends Zave and Jackson's formulation. We thereby establish new standards for what minimum information should be represented in RE languages and new criteria for determining whether RE has been successfully completed.Comment: Appears in the proceedings of the 16th IEEE International Requirements Engineering Conference, 2008 (RE'08). Best paper awar

    Convergence Conditions for Random Quantum Circuits

    Full text link
    Efficient methods for generating pseudo-randomly distributed unitary operators are needed for the practical application of Haar distributed random operators in quantum communication and noise estimation protocols. We develop a theoretical framework for analyzing pseudo-random ensembles generated through a random circuit composition. We prove that the measure over random circuits converges exponentially (with increasing circuit length) to the uniform (Haar) measure on the unitary group and describe how the rate of convergence may be calculated for specific applications.Comment: 4 pages (revtex), comments welcome. v2: reference added, title changed; v3: published version, minor changes, references update

    Polynomial Cointegration among Stationary Processes with Long Memory

    Get PDF
    n this paper we consider polynomial cointegrating relationships among stationary processes with long range dependence. We express the regression functions in terms of Hermite polynomials and we consider a form of spectral regression around frequency zero. For these estimates, we establish consistency by means of a more general result on continuously averaged estimates of the spectral density matrix at frequency zeroComment: 25 pages, 7 figures. Submitted in August 200

    Conditional Allocation of Control Rights in Venture Capital Finance

    Get PDF
    When a young entrepreneurial firm matures, it is often necessary to replace the founding entrepreneur by a professional manager. This replacement decision can be affected by the private benefits of control enjoyed by the entrepreneur which gives rise to a conflict of interest between the entrepreneur and the venture capitalist. We show that a combination of convertible securities and contingent control rights can be used to resolve this conflict efficiently. This contractual arrangement is frequently observed in venture capital finance

    Mission Design for the Lunar Pallet Lander

    Get PDF
    Marshall Space Flight Center is developing a small lunar lander capable of delivering up to 300 kg of payload to the lunar surface near the North or South Pole. Originally designed as a lander for a small rover, the Lunar Pallet Lander, has seen several design iterations over the last couple of years. This paper will cover how the vehicle and mission design changed from being a co-manifested payload candidate in NASAs Space Launch System to its current design, which could be launched with an Evolved Expendable Launch Vehicle (EELV), and reach a wide range of polar landing sites

    Nominal Logic Programming

    Full text link
    Nominal logic is an extension of first-order logic which provides a simple foundation for formalizing and reasoning about abstract syntax modulo consistent renaming of bound names (that is, alpha-equivalence). This article investigates logic programming based on nominal logic. We describe some typical nominal logic programs, and develop the model-theoretic, proof-theoretic, and operational semantics of such programs. Besides being of interest for ensuring the correct behavior of implementations, these results provide a rigorous foundation for techniques for analysis and reasoning about nominal logic programs, as we illustrate via examples.Comment: 46 pages; 19 page appendix; 13 figures. Revised journal submission as of July 23, 200
    • …
    corecore