6,482 research outputs found

    Reusable model transformation components with bentƍ

    Full text link
    The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-21155-8_5Building high-quality transformations that can be used in real projects is complex and time-consuming. For this reason, the ability to reuse existing transformations in different, unforeseen scenarios is very valuable. However, there is scarce tool support for this task. This paper presents bentƍ, a tool which supports the development and execution of reusable transformation components. In bentƍ, a reusable transformation is written as a regular ATL transformation, but it uses concepts as meta-models. Reuse is achieved by binding such concepts to meta-models, which induces the transformation adaptation. Moreover, composite components enable chaining transformations, and it is possible to convert an existing transformation into a reusable component. Bentƍ is implemented as an Eclipse plug-in, available as free software.This work was supported by the Spanish Ministry of Economy and Competitivity with project Go-Lite (TIN2011-24139), the R&D programme of the Madrid Region with project (SICOMORO S2013/ICE-3006), and the EU commission with project MONDO (FP7-ICT 2013-10, #611125)

    CSP channels for CAN-bus connected embedded control systems

    Get PDF
    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

    Error matrices in quantum process tomography

    Full text link
    We discuss characterization of experimental quantum gates by the error matrix, which is similar to the standard process matrix χ\chi in the Pauli basis, except the desired unitary operation is factored out, by formally placing it either before or after the error process. The error matrix has only one large element, which is equal to the process fidelity, while other elements are small and indicate imperfections. The imaginary parts of the elements along the left column and/or top row directly indicate the unitary imperfection and can be used to find the needed correction. We discuss a relatively simple way to calculate the error matrix for a composition of quantum gates. Similarly, it is rather straightforward to find the first-order contribution to the error matrix due to the Lindblad-form decoherence. We also discuss a way to identify and subtract the tomography procedure errors due to imperfect state preparation and measurement. In appendices we consider several simple examples of the process tomography and also discuss an intuitive physical interpretation of the Lindblad-form decoherence.Comment: 21 pages (slightly revised version

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

    Get PDF
    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

    "The Paradox of Migration: Reconciling Economic Competition and 'Common Values' in Britain"

    Get PDF
    [From the introduction] This paper looks at Great Britain as an important case for explaining the inherent paradox of migration policy in Western Europe. Where immigration is an opportunity to jump-start latent industrial or struggling service economies, it is also a dominant political challenge in maintaining national identity and cohesion. This is particularly the case for Britain, where national identity is an inchoate, regularly re-defined concept (see Cesarani 1997; Hampshire 2006). Britain has seen positive economic growth and production in opening up their labor market to over half a million A-8 Accession workers, mainly from Poland and Lithuania. And under the banner of “controlled migration,” the Labor government has introduced a five-tiered, point-based entry system to bring highly skilled and need-based non-European migrants to Britain. However, where there is a desire to meet economic needs through migration, immigration has never been more of a contested, salient political issue. The promotion of citizenship requirements emphasizing integration (in English language and UK knowledge assessment) for non-EEA migrants, is an important innovation for defining British national identity, articulating for the first time a set of ‘common values’ to underscore the British national community. Britain’s migration calculus, maximizing the economic and social benefits of immigration against the efforts to isolate potential costs of immigration through the first, real definition of “Britishness” exemplifies the inherent paradox of migration for Western European states where more formed or consolidation visions of nation-state pre-dated large-scale migration. Following a review of context in which migration and citizenship laws were changed, discussing Britain’s strategic use of European Enlargement as being able to maintain selective admission alongside economic openness, the second part looks at British policy in detail by examining the most recent development of immigration and citizenship policy, beginning with the 2002 White Paper “Secure Borders, Safe Haven,” and manifesting in the 2005 Five-year strategy, “Controlling Our Borders.” Finally, I conclude with preliminary comparisons between Britain and other Western European countries, who are only now coming to terms with the realization that they are ‘countries of immigration,’ taking on all the benefits and responsibilities that come with it

    Constraining Attacker Capabilities Through Actuator Saturation

    Full text link
    For LTI control systems, we provide mathematical tools - in terms of Linear Matrix Inequalities - for computing outer ellipsoidal bounds on the reachable sets that attacks can induce in the system when they are subject to the physical limits of the actuators. Next, for a given set of dangerous states, states that (if reached) compromise the integrity or safe operation of the system, we provide tools for designing new artificial limits on the actuators (smaller than their physical bounds) such that the new ellipsoidal bounds (and thus the new reachable sets) are as large as possible (in terms of volume) while guaranteeing that the dangerous states are not reachable. This guarantees that the new bounds cut as little as possible from the original reachable set to minimize the loss of system performance. Computer simulations using a platoon of vehicles are presented to illustrate the performance of our tools
    • 

    corecore