958 research outputs found

    Ouput-feedback control of combined sewer networks through receding horizon control with moving horizon estimation

    Get PDF
    An output-feedback control strategy for pollution mitigation in combined sewer networks is presented. The proposed strategy provides means to apply model-based predictive control to large-scale sewer networks, in-spite of the lack of measurements at most of the network sewers. In previous works, the authors presented a hybrid linear control-oriented model for sewer networks together with the formulation of Optimal Control Problems (OCP) and State Estimation Problems (SEP). By iteratively solving these problems, preliminary Receding Horizon Control with Moving Horizon Estimation (RHC/MHE) results, based on flow measurements, were also obtained. In this work, the RHC/MHE algorithm has been extended to take into account both flow and water level measurements and the resulting control loop has been extensively simulated to assess the system performance according to different measurement availability scenarios and rain events. All simulations have been carried out using a detailed physically-based model of a real case-study network as virtual reality.Peer ReviewedPostprint (author's final draft

    Heuristic Evaluation for Novice Programming Systems

    Get PDF
    The past few years has seen a proliferation of novice programming tools. The availability of a large number of systems has made it difficult for many users to choose among them. Even for education researchers, comparing the relative quality of these tools, or judging their respective suitability for a given context, is hard in many instances. For designers of such systems, assessing the respective quality of competing design decisions can be equally difficult. Heuristic evaluation provides a practical method of assessing the quality of alternatives in these situations and of identifying potential problems with existing systems for a given target group or context. Existing sets of heuristics, however, are not specific to the domain of novice programming and thus do not evaluate all aspects of interest to us in this specialised application domain. In this article, we propose a set of heuristics to be used in heuristic evaluations of novice programming systems. These heuristics have the potential to allow a useful assessment of the quality of a given system with lower cost than full formal user studies and greater precision than the use of existing sets of heuristics. The heuristics are described and discussed in detail. We present an evaluation of the effectiveness of the heuristics that suggests that the new set of heuristics provides additional useful information to designers not obtained with existing heuristics sets

    Precision measurements of the top quark mass from the Tevatron in the pre-LHC era

    Full text link
    The top quark is the heaviest of the six quarks of the Standard Model. Precise knowledge of its mass is important for imposing constraints on a number of physics processes, including interactions of the as yet unobserved Higgs boson. The Higgs boson is the only missing particle of the Standard Model, central to the electroweak symmetry breaking mechanism and generation of particle masses. In this Review, experimental measurements of the top quark mass accomplished at the Tevatron, a proton-antiproton collider located at the Fermi National Accelerator Laboratory, are described. Topologies of top quark events and methods used to separate signal events from background sources are discussed. Data analysis techniques used to extract information about the top mass value are reviewed. The combination of several most precise measurements performed with the two Tevatron particle detectors, CDF and \D0, yields a value of \Mt = 173.2 \pm 0.9 GeV/c2c^2.Comment: This version contains the most up-to-date top quark mass averag

    Pushouts in software architecture design

    Get PDF
    A classical approach to program derivation is to progressively extend a simple specification and then incrementally refine it to an implementation. We claim this approach is hard or impractical when reverse engineering legacy software architectures. We present a case study that shows optimizations and pushouts--in addition to refinements and extensions--are essential for practical stepwise development of complex software architectures.NSF CCF 0724979NSF CNS 0509338NSF CCF 0917167NSF DGE-1110007FCT SFRH/BD/47800/2008FCT UTAustin/CA/0056/200

    A Toy Model for Testing Finite Element Methods to Simulate Extreme-Mass-Ratio Binary Systems

    Full text link
    Extreme mass ratio binary systems, binaries involving stellar mass objects orbiting massive black holes, are considered to be a primary source of gravitational radiation to be detected by the space-based interferometer LISA. The numerical modelling of these binary systems is extremely challenging because the scales involved expand over several orders of magnitude. One needs to handle large wavelength scales comparable to the size of the massive black hole and, at the same time, to resolve the scales in the vicinity of the small companion where radiation reaction effects play a crucial role. Adaptive finite element methods, in which quantitative control of errors is achieved automatically by finite element mesh adaptivity based on posteriori error estimation, are a natural choice that has great potential for achieving the high level of adaptivity required in these simulations. To demonstrate this, we present the results of simulations of a toy model, consisting of a point-like source orbiting a black hole under the action of a scalar gravitational field.Comment: 29 pages, 37 figures. RevTeX 4.0. Minor changes to match the published versio

    Enhancing Interdisciplinary Instruction in General and Special Education: Thematic Units and Technology

    Get PDF
    This article discusses interdisciplinary thematic units in the context of special and general education curricula and focuses on ways technology can be used to enhance interdisciplinary thematic units. Examples of curriculum integration activities enhanced by technology are provided in the context of productivity tools, presentation and multimedia tools, contextual themed software, and Web-based activities.Yeshttps://us.sagepub.com/en-us/nam/manuscript-submission-guideline

    Polynomial super-gl(n) algebras

    Get PDF
    We introduce a class of finite dimensional nonlinear superalgebras L=L0ˉ+L1ˉL = L_{\bar{0}} + L_{\bar{1}} providing gradings of L0ˉ=gl(n)sl(n)+gl(1)L_{\bar{0}} = gl(n) \simeq sl(n) + gl(1). Odd generators close by anticommutation on polynomials (of degree >1>1) in the gl(n)gl(n) generators. Specifically, we investigate `type I' super-gl(n)gl(n) algebras, having odd generators transforming in a single irreducible representation of gl(n)gl(n) together with its contragredient. Admissible structure constants are discussed in terms of available gl(n)gl(n) couplings, and various special cases and candidate superalgebras are identified and exemplified via concrete oscillator constructions. For the case of the nn-dimensional defining representation, with odd generators Qa,QˉbQ_{a}, \bar{Q}{}^{b}, and even generators Eab{E^{a}}_{b}, a,b=1,...,na,b = 1,...,n, a three parameter family of quadratic super-gl(n)gl(n) algebras (deformations of sl(n/1)sl(n/1)) is defined. In general, additional covariant Serre-type conditions are imposed, in order that the Jacobi identities be fulfilled. For these quadratic super-gl(n)gl(n) algebras, the construction of Kac modules, and conditions for atypicality, are briefly considered. Applications in quantum field theory, including Hamiltonian lattice QCD and space-time supersymmetry, are discussed.Comment: 31 pages, LaTeX, including minor corrections to equation (3) and reference [60
    corecore