Enhancing Traffic Flow Using Computer Vision Based - Dynamic Traffic Light Control and Lane Management

Traffic congestion is a persistent problem in many metropolises worldwide. Despite the existence of traffic control systems, they are not always efficient enough to manage the ever-changing traffic density environment. The traditional approach of allocating specific times to each lane with the green light, regardless of the traffic situation, has not been very effective. In fact, it often can make the traffic congestion worse. Thus, the need for a more sophisticated system has emerged to simulate and optimize traffic control. This paper proposes the use of computer vision technology to develop a traffic control system that is based on periodic still photo feeds and compares different object detection models to find the best model for vehicle detection in our system . The system aims to enhance traffic flow by dynamically adjusting the traffic light cycles based on real-time traffic conditions

Towards the definition of a pattern sequence for real-time applications using a model-driven engineering approach

Real-Time (RT) systems exhibit specific characteristics that make them particularly sensitive to architectural decissions. Design patterns help integrating the desired timing behaviour with the rest of the elements of the application architecture. This paper reports a pattern story that shows how a component-based design has been implemented using periodic concurrent tasks with RT requirements. This work has been done in the context of the development of robotic applications using a Model-Driven Software Development (MDSD) approach. In this context the model-to-code transformations are designed taking into account both the system requirements and the patterns that satisfy them. MDSD provides the conceptual technology for implementing a pattern-guided transition from component-based models to object-oriented implementations. The results of applying the described story of patterns are shown by an application that initializes, configures and schedules the execution of platform-specific components.This work has been partially supported by the Spanish CICYT Project EXPLORE (ref. TIN2009-08572), and the Fundación Séneca Regional Project COMPAS-R (ref. 11994/PI/09)

MCFlow: Middleware for Mixed-Criticality Distributed Real-Time Systems

Traditional fixed-priority scheduling analysis for periodic/sporadic task sets is based on the assumption that all tasks are equally critical to the correct operation of the system. Therefore, every task has to be schedulable under the scheduling policy, and estimates of tasks\u27 worst case execution times must be conservative in case a task runs longer than is usual. To address the significant under-utilization of a system\u27s resources under normal operating conditions that can arise from these assumptions, several \emph{mixed-criticality scheduling} approaches have been proposed. However, to date there has been no quantitative comparison of system schedulability or run-time overhead for the different approaches. In this dissertation, we present what is to our knowledge the first side-by-side implementation and evaluation of those approaches, for periodic and sporadic mixed-criticality tasks on uniprocessor or distributed systems, under a mixed-criticality scheduling model that is common to all these approaches. To make a fair evaluation of mixed-criticality scheduling, we also address some previously open issues and propose modifications to improve schedulability and correctness of particular approaches. To facilitate the development and evaluation of mixed-criticality applications, we have designed and developed a distributed real-time middleware, called MCFlow, for mixed-criticality end-to-end tasks running on multi-core platforms. The research presented in this dissertation provides the following contributions to the state of the art in real-time middleware: (1) an efficient component model through which dependent subtask graphs can be configured flexibly for execution within a single core, across cores of a common host, or spanning multiple hosts; (2) support for optimizations to inter-component communication to reduce data copying without sacrificing the ability to execute subtasks in parallel; (3) a strict separation of timing and functional concerns so that they can be configured independently; (4) an event dispatching architecture that uses lock free algorithms where possible to reduce memory contention, CPU context switching, and priority inversion; and (5) empirical evaluations of MCFlow itself and of different mixed criticality scheduling approaches both with a single host and end-to-end across multiple hosts. The results of our evaluation show that in terms of basic distributed real-time behavior MCFlow performs comparably to the state of the art TAO real-time object request broker when only one core is used and outperforms TAO when multiple cores are involved. We also identify and categorize different use cases under which different mixed criticality scheduling approaches are preferable

Towards an HLA Run-time Infrastructure with Hard Real-time Capabilities

Our work takes place in the context of the HLA standard and its application in real-time systems context. The HLA standard is inadequate for taking into consideration the different constraints involved in real-time computer systems. Many works have been invested in order to providing real-time capabilities to Run Time Infrastructures (RTI) to run real time simulation. Most of these initiatives focus on major issues including QoS guarantee, Worst Case Transit Time (WCTT) knowledge and scheduling services provided by the underlying operating systems. Even if our ultimate objective is to achieve real-time capabilities for distributed HLA federations executions, this paper describes a preliminary work focusing on achieving hard real-time properties for HLA federations running on a single computer under Linux operating systems. Our paper proposes a novel global bottom up approach for designing real-time Run time Infrastructures and a formal model for validation of uni processor to (then) distributed real-time simulation with CERTI

CSP channels for CAN-bus connected embedded control systems

Closed loop control system typically contains multitude of sensors and actuators operated simultaneously. So they are parallel and distributed in its essence. But when mapping this parallelism to software, lot of obstacles concerning multithreading communication and synchronization issues arise. To overcome this problem, the CT kernel/library based on CSP algebra has been developed. This project (TES.5410) is about developing communication extension to the CT library to make it applicable in distributed systems. Since the library is tailored for control systems, properties and requirements of control systems are taken into special consideration. Applicability of existing middleware solutions is examined. A comparison of applicable fieldbus protocols is done in order to determine most suitable ones and CAN fieldbus is chosen to be first fieldbus used. Brief overview of CSP and existing CSP based libraries is given. Middleware architecture is proposed along with few novel ideas

Discrete Breathers

Nonlinear classical Hamiltonian lattices exhibit generic solutions in the form of discrete breathers. These solutions are time-periodic and (typically exponentially) localized in space. The lattices exhibit discrete translational symmetry. Discrete breathers are not confined to certain lattice dimensions. Necessary ingredients for their occurence are the existence of upper bounds on the phonon spectrum (of small fluctuations around the groundstate) of the system as well as the nonlinearity in the differential equations. We will present existence proofs, formulate necessary existence conditions, and discuss structural stability of discrete breathers. The following results will be also discussed: the creation of breathers through tangent bifurcation of band edge plane waves; dynamical stability; details of the spatial decay; numerical methods of obtaining breathers; interaction of breathers with phonons and electrons; movability; influence of the lattice dimension on discrete breather properties; quantum lattices - quantum breathers. Finally we will formulate a new conceptual aproach capable of predicting whether discrete breather exist for a given system or not, without actually solving for the breather. We discuss potential applications in lattice dynamics of solids (especially molecular crystals), selective bond excitations in large molecules, dynamical properties of coupled arrays of Josephson junctions, and localization of electromagnetic waves in photonic crystals with nonlinear response.Comment: 62 pages, LaTeX, 14 ps figures. Physics Reports, to be published; see also at http://www.mpipks-dresden.mpg.de/~flach/html/preprints.htm

Modelling and Simulation of Asynchronous Real-Time Systems using Timed Rebeca

In this paper we propose an extension of the Rebeca language that can be used to model distributed and asynchronous systems with timing constraints. We provide the formal semantics of the language using Structural Operational Semantics, and show its expressiveness by means of examples. We developed a tool for automated translation from timed Rebeca to the Erlang language, which provides a first implementation of timed Rebeca. We can use the tool to set the parameters of timed Rebeca models, which represent the environment and component variables, and use McErlang to run multiple simulations for different settings. Timed Rebeca restricts the modeller to a pure asynchronous actor-based paradigm, where the structure of the model represents the service oriented architecture, while the computational model matches the network infrastructure. Simulation is shown to be an effective analysis support, specially where model checking faces almost immediate state explosion in an asynchronous setting.Comment: In Proceedings FOCLASA 2011, arXiv:1107.584

A systematic search for close supermassive black hole binaries in the Catalina Real-Time Transient Survey

Hierarchical assembly models predict a population of supermassive black hole (SMBH) binaries. These are not resolvable by direct imaging but may be detectable via periodic variability (or nanohertz frequency gravitational waves). Following our detection of a 5.2 year periodic signal in the quasar PG 1302-102 (Graham et al. 2015), we present a novel analysis of the optical variability of 243,500 known spectroscopically confirmed quasars using data from the Catalina Real-time Transient Survey (CRTS) to look for close (< 0.1 pc) SMBH systems. Looking for a strong Keplerian periodic signal with at least 1.5 cycles over a baseline of nine years, we find a sample of 111 candidate objects. This is in conservative agreement with theoretical predictions from models of binary SMBH populations. Simulated data sets, assuming stochastic variability, also produce no equivalent candidates implying a low likelihood of spurious detections. The periodicity seen is likely attributable to either jet precession, warped accretion disks or periodic accretion associated with a close SMBH binary system. We also consider how other SMBH binary candidates in the literature appear in CRTS data and show that none of these are equivalent to the identified objects. Finally, the distribution of objects found is consistent with that expected from a gravitational wave-driven population. This implies that circumbinary gas is present at small orbital radii and is being perturbed by the black holes. None of the sources is expected to merge within at least the next century. This study opens a new unique window to study a population of close SMBH binaries that must exist according to our current understanding of galaxy and SMBH evolution.Comment: 29 pages, 10 figures, accepted for publication in MNRAS - this version contains extended table and figur