7,782 research outputs found

    Background removal from global auroral images: Data-driven dayglow modeling

    Get PDF
    Global images of auroras obtained by cameras on spacecraft are a key tool for studying the near-Earth environment. However, the cameras are sensitive not only to auroral emissions produced by precipitating particles, but also to dayglow emissions produced by photoelectrons induced by sunlight. Nightglow emissions and scattered sunlight can contribute to the background signal. To fully utilize such images in space science, background contamination must be removed to isolate the auroral signal. Here we outline a data-driven approach to modeling the background intensity in multiple images by formulating linear inverse problems based on B-splines and spherical harmonics. The approach is robust, flexible, and iteratively deselects outliers, such as auroral emissions. The final model is smooth across the terminator and accounts for slow temporal variations and large-scale asymmetries in the dayglow. We demonstrate the model by using the three far ultraviolet cameras on the Imager for Magnetopause-to-Aurora Global Exploration (IMAGE) mission. The method can be applied to historical missions and is relevant for upcoming missions, such as the Solar wind Magnetosphere Ionosphere Link Explorer (SMILE) mission

    Configuration Management of Distributed Systems over Unreliable and Hostile Networks

    Get PDF
    Economic incentives of large criminal profits and the threat of legal consequences have pushed criminals to continuously improve their malware, especially command and control channels. This thesis applied concepts from successful malware command and control to explore the survivability and resilience of benign configuration management systems. This work expands on existing stage models of malware life cycle to contribute a new model for identifying malware concepts applicable to benign configuration management. The Hidden Master architecture is a contribution to master-agent network communication. In the Hidden Master architecture, communication between master and agent is asynchronous and can operate trough intermediate nodes. This protects the master secret key, which gives full control of all computers participating in configuration management. Multiple improvements to idempotent configuration were proposed, including the definition of the minimal base resource dependency model, simplified resource revalidation and the use of imperative general purpose language for defining idempotent configuration. Following the constructive research approach, the improvements to configuration management were designed into two prototypes. This allowed validation in laboratory testing, in two case studies and in expert interviews. In laboratory testing, the Hidden Master prototype was more resilient than leading configuration management tools in high load and low memory conditions, and against packet loss and corruption. Only the research prototype was adaptable to a network without stable topology due to the asynchronous nature of the Hidden Master architecture. The main case study used the research prototype in a complex environment to deploy a multi-room, authenticated audiovisual system for a client of an organization deploying the configuration. The case studies indicated that imperative general purpose language can be used for idempotent configuration in real life, for defining new configurations in unexpected situations using the base resources, and abstracting those using standard language features; and that such a system seems easy to learn. Potential business benefits were identified and evaluated using individual semistructured expert interviews. Respondents agreed that the models and the Hidden Master architecture could reduce costs and risks, improve developer productivity and allow faster time-to-market. Protection of master secret keys and the reduced need for incident response were seen as key drivers for improved security. Low-cost geographic scaling and leveraging file serving capabilities of commodity servers were seen to improve scaling and resiliency. Respondents identified jurisdictional legal limitations to encryption and requirements for cloud operator auditing as factors potentially limiting the full use of some concepts

    UMSL Bulletin 2023-2024

    Get PDF
    The 2023-2024 Bulletin and Course Catalog for the University of Missouri St. Louis.https://irl.umsl.edu/bulletin/1088/thumbnail.jp

    Language integrated relational lenses

    Get PDF
    Relational databases are ubiquitous. Such monolithic databases accumulate large amounts of data, yet applications typically only work on small portions of the data at a time. A subset of the database defined as a computation on the underlying tables is called a view. Querying views is helpful, but it is also desirable to update them and have these changes be applied to the underlying database. This view update problem has been the subject of much previous work before, but support by database servers is limited and only rarely available. Lenses are a popular approach to bidirectional transformations, a generalization of the view update problem in databases to arbitrary data. However, perhaps surprisingly, lenses have seldom actually been used to implement updatable views in databases. Bohannon, Pierce and Vaughan propose an approach to updatable views called relational lenses. However, to the best of our knowledge this proposal has not been implemented or evaluated prior to the work reported in this thesis. This thesis proposes programming language support for relational lenses. Language integrated relational lenses support expressive and efficient view updates, without relying on updatable view support from the database server. By integrating relational lenses into the programming language, application development becomes easier and less error-prone, avoiding the impedance mismatch of having two programming languages. Integrating relational lenses into the language poses additional challenges. As defined by Bohannon et al. relational lenses completely recompute the database, making them inefficient as the database scales. The other challenge is that some parts of the well-formedness conditions are too general for implementation. Bohannon et al. specify predicates using possibly infinite abstract sets and define the type checking rules using relational algebra. Incremental relational lenses equip relational lenses with change-propagating semantics that map small changes to the view into (potentially) small changes to the source tables. We prove that our incremental semantics are functionally equivalent to the non-incremental semantics, and our experimental results show orders of magnitude improvement over the non-incremental approach. This thesis introduces a concrete predicate syntax and shows how the required checks are performed on these predicates and show that they satisfy the abstract predicate specifications. We discuss trade-offs between static predicates that are fully known at compile time vs dynamic predicates that are only known during execution and introduce hybrid predicates taking inspiration from both approaches. This thesis adapts the typing rules for relational lenses from sequential composition to a functional style of sub-expressions. We prove that any well-typed functional relational lens expression can derive a well-typed sequential lens. We use these additions to relational lenses as the foundation for two practical implementations: an extension of the Links functional language and a library written in Haskell. The second implementation demonstrates how type-level computation can be used to implement relational lenses without changes to the compiler. These two implementations attest to the possibility of turning relational lenses into a practical language feature

    LIPIcs, Volume 251, ITCS 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 251, ITCS 2023, Complete Volum

    UMSL Bulletin 2022-2023

    Get PDF
    The 2022-2023 Bulletin and Course Catalog for the University of Missouri St. Louis.https://irl.umsl.edu/bulletin/1087/thumbnail.jp

    Barrier-Based Test Synthesis for Safety-Critical Systems Subject to Timed Reach-Avoid Specifications

    Full text link
    We propose an adversarial, time-varying test-synthesis procedure for safety-critical systems without requiring specific knowledge of the underlying controller steering the system. From a broader test and evaluation context, determination of difficult tests of system behavior is important as these tests would elucidate problematic system phenomena before these mistakes can engender problematic outcomes, e.g. loss of human life in autonomous cars, costly failures for airplane systems, etc. Our approach builds on existing, simulation-based work in the test and evaluation literature by offering a controller-agnostic test-synthesis procedure that provides a series of benchmark tests with which to determine controller reliability. To achieve this, our approach codifies the system objective as a timed reach-avoid specification. Then, by coupling control barrier functions with this class of specifications, we construct an instantaneous difficulty metric whose minimizer corresponds to the most difficult test at that system state. We use this instantaneous difficulty metric in a game-theoretic fashion, to produce an adversarial, time-varying test-synthesis procedure that does not require specific knowledge of the system's controller, but can still provably identify realizable and maximally difficult tests of system behavior. Finally, we develop this test-synthesis procedure for both continuous and discrete-time systems and showcase our test-synthesis procedure on simulated and hardware examples

    An End, Once and for All: Mass Effect 3, Video Game Controversies, and the Fight for Player Agency

    Get PDF
    Since the success of the player-led Mass Effect 3 ending controversy, player-led video game controversies have become mainstream sites of industrial and ideological contention between developers, players, and the culture itself. This dissertation focuses on the history of the Mass Effect 3 ending controversy, the game’s specific textual qualities that encouraged player protest, and the negotiations between players and developers in online spaces that persuaded developers to alter the game’s ending based on player demands. Using the Mass Effect 3 as its primary object, this dissertation argues this controversy—as well as subsequent player-led video game controversies—was not simply the result of dissatisfaction with a single plot point or representation in the text or video game community, but the complex negotiation of creative differences between players and developers over the production and control of video game texts and culture. Video games and their controversies are rooted in the medium\u27s intrinsic qualities of interactivity, choice, labor and the need for shared production between developers and players to progress and produce a video game text, which encourages the development of a sense of agency and ownership over the text for both groups. This dissertation argues that video games are not just texts that developers create and that players play, but rather texts produced through the co-creative production practice that Axel Bruns has defined as “produsage”—texts where producers act in dual roles as users while users to also act as producers—that allow players a creative stake in the outcome of a video game text, encourages a sense of agency and ownership, and collapses traditional boundaries between developers and players. Video game controversies naturally arise when players perceive a loss of agency and control over the video game text and attempt to reclaim control over ownership of the text through controversy

    Introduction to Psychology

    Get PDF
    Introduction to Psychology is a modified version of Psychology 2e - OpenStax

    A stochastic hybrid control law for a localization task based on active sensing

    Get PDF
    openA localization task by a mobile agent is considered, where the sensing and the motion actions are performed exclusively with respect to each other, meaning that sensing the target is not available during the agent movement. To formalize this scenario the system is modeled on the 1D line and a control law with a timer and a logic variable, to allow switching between the operating modes of sensing the target and moving towards it, is designed. A Stochastic Hybrid System in standard form is obtained, satisfying the Stochastic Hybrid Basic conditions, and the overall closed-loop system behavior is then studied. An extension to the 2D plane is also proposed and its behavior is analyzed. Finally, the 2D control law is tested for a simulated Search & Rescue task in an unknown indoor environment under some simplifying hypotheses
    corecore