scholarly journals MODEL-BASED DESIGN FOR SYSTEM INTEGRATION

2011 ◽  
Author(s):  
Pieter J. Mostermanm ◽  
Jason Ghidella ◽  
Jon Friedman
Keyword(s):  
Complex Systems ◽  
Programming Languages ◽  
System Integration ◽  
Feature Integration ◽  
Shared Resources ◽  
Model Based ◽  
Level Of Abstraction ◽  
Design Perspective ◽  
High Level ◽  
System Partitioning

System partitioning is essential to the design of complex systems such as automobiles. Complexity can be because of compounded phenomena or because of intricate behavior. This paper focuses on the compounding effect of integrating the different subsystems that result from the partitioning. In particular, it concentrates on subsystems, or features, that have an embedded computation part to them. Three types of feature integration are classified: (i) shared resources, (ii) communicating features, and (iii) interacting control. The integration is addressed from a Model-Based Design perspective. It is discussed how this allows managing the complexity of integrating computations because it is operative at a higher level of abstraction than even high-level programming languages.

“Farewell to Unjustified Enrichment?” – A Common Law Response

2016 ◽  
Vol 20 (3) ◽  
pp. 326-337
Author(s):  
Steve Hedley
Keyword(s):  
Common Law ◽  
German Law ◽  
Unjust Enrichment ◽  
Level Of Abstraction ◽  
The Law ◽  
Unjustified Enrichment ◽  
High Level ◽  
Logical Process

In this article, Professor Steve Hedley offers a Common Law response to he recently published arguments of Professor Nils Jansen on the German law of unjustified enrichment (as to which, see Jansen, “Farewell to Unjustified Enrichment” (2016) 20 EdinLR 123). The author takes the view that Jansen's paper provided a welcome opportunity to reconsider not merely what unjust enrichment can logically be, but what it is for. He argues that unjust enrichment talk contributes little of value, and that the supposedly logical process of stating it at a high level of abstraction, and then seeking to deduce the law from that abstraction, merely distracts lawyers from the equities of the cases they consider.

A Tight Connection Among Wealth, Income, Sustainability, and Accounting in an Ultra-Simplified Setting

2017 ◽  
Author(s):  
Martin L. Weitzman
Keyword(s):  
Economic Theory ◽  
Quantitative Relationship ◽  
Theoretical Relationship ◽  
Level Of Abstraction ◽  
Tight Connection ◽  
Basic Concepts ◽  
High Level ◽  
Very High

In theory, and under some very strong assumptions, there exists a tight quantitative relationship among the following four fundamental economic concepts: (1) ‘wealth’; (2) ‘income’; (3) ‘sustainability’; (4) ‘accounting’. These four basic concepts are placed in quotation marks here because a necessary first step will be to carefully and rigorously define what exactly is meant by each. This chapter reviews what is known about this important fourfold quantitative relationship in an ultra-simplified setting. It identifies some basic applications of this simplified economic theory of wealth and income (and sustainability and accounting). While the contents of this chapter are expressed at a very high level of abstraction and require many restrictive assumptions, the fundamental fourfold relationship it sharply highlights should be useful for conceptualizing, at least in principle, what is ‘wealth’ and what is its theoretical relationship to ‘income’, ‘sustainability’, and ‘accounting’.

CSim 2

2021 ◽  
Vol 43 (1) ◽  
pp. 1-46
Author(s):  
David Sanan ◽  
Yongwang Zhao ◽  
Shang-Wei Lin ◽  
Liu Yang
Keyword(s):  
Programming Languages ◽  
Concurrent Systems ◽  
Theorem Prover ◽  
Compositional Techniques ◽  
Machine Code ◽  
Top Down ◽  
Hol Theorem Prover ◽  
High Level ◽  
High Degree

To make feasible and scalable the verification of large and complex concurrent systems, it is necessary the use of compositional techniques even at the highest abstraction layers. When focusing on the lowest software abstraction layers, such as the implementation or the machine code, the high level of detail of those layers makes the direct verification of properties very difficult and expensive. It is therefore essential to use techniques allowing to simplify the verification on these layers. One technique to tackle this challenge is top-down verification where by means of simulation properties verified on top layers (representing abstract specifications of a system) are propagated down to the lowest layers (that are an implementation of the top layers). There is no need to say that simulation of concurrent systems implies a greater level of complexity, and having compositional techniques to check simulation between layers is also desirable when seeking for both feasibility and scalability of the refinement verification. In this article, we present CSim 2 a (compositional) rely-guarantee-based framework for the top-down verification of complex concurrent systems in the Isabelle/HOL theorem prover. CSim 2 uses CSimpl, a language with a high degree of expressiveness designed for the specification of concurrent programs. Thanks to its expressibility, CSimpl is able to model many of the features found in real world programming languages like exceptions, assertions, and procedures. CSim 2 provides a framework for the verification of rely-guarantee properties to compositionally reason on CSimpl specifications. Focusing on top-down verification, CSim 2 provides a simulation-based framework for the preservation of CSimpl rely-guarantee properties from specifications to implementations. By using the simulation framework, properties proven on the top layers (abstract specifications) are compositionally propagated down to the lowest layers (source or machine code) in each concurrent component of the system. Finally, we show the usability of CSim 2 by running a case study over two CSimpl specifications of an Arinc-653 communication service. In this case study, we prove a complex property on a specification, and we use CSim 2 to preserve the property on lower abstraction layers.

scholarly journals Evaluation of Static Mapping for Dynamic Space-Shared Multi-task Processing on FPGAs

2021 ◽  
Author(s):  
Umar Ibrahim Minhas ◽  
Roger Woods ◽  
Georgios Karakonstantis
Keyword(s):  
High Performance ◽  
Design Space Exploration ◽  
Design Space ◽  
System Throughput ◽  
Design Parameters ◽  
Temporal Constraints ◽  
Shared Resources ◽  
Task Processing ◽  
High Level ◽  
Performance Computing

AbstractWhilst FPGAs have been used in cloud ecosystems, it is still extremely challenging to achieve high compute density when mapping heterogeneous multi-tasks on shared resources at runtime. This work addresses this by treating the FPGA resource as a service and employing multi-task processing at the high level, design space exploration and static off-line partitioning in order to allow more efficient mapping of heterogeneous tasks onto the FPGA. In addition, a new, comprehensive runtime functional simulator is used to evaluate the effect of various spatial and temporal constraints on both the existing and new approaches when varying system design parameters. A comprehensive suite of real high performance computing tasks was implemented on a Nallatech 385 FPGA card and show that our approach can provide on average 2.9 × and 2.3 × higher system throughput for compute and mixed intensity tasks, while 0.2 × lower for memory intensive tasks due to external memory access latency and bandwidth limitations. The work has been extended by introducing a novel scheduling scheme to enhance temporal utilization of resources when using the proposed approach. Additional results for large queues of mixed intensity tasks (compute and memory) show that the proposed partitioning and scheduling approach can provide higher than 3 × system speedup over previous schemes.

scholarly journals Affective-Model Based High-Level Controller for Human-Robot Applications

2012 ◽  
Vol 41 ◽  
pp. 812-818
Author(s):  
Shahrul Nairn Sidek ◽  
Elliana Ismaif ◽  
Nor Anija Jalaludin
Keyword(s):  
Model Based ◽  
High Level

Application of C Sharp and MATLAB Mixed Programming Based on .Net Assembly in Blind Source Separation

2014 ◽  
Vol 599-601 ◽  
pp. 1407-1410
Author(s):  
Xu Liang ◽  
Ke Ming Wang ◽  
Gui Yu Xin
Keyword(s):  
Numerical Calculation ◽  
Programming Languages ◽  
Blind Source Separation ◽  
Source Separation ◽  
Processing System ◽  
Signal Processing System ◽  
Blind Signal Processing ◽  
Blind Signal ◽  
Mixed Programming ◽  
High Level

Comparing with other High-level programming languages, C Sharp (C#) is more efficient in software development. While MATLAB language provides a series of powerful functions of numerical calculation that facilitate adoption of algorithms, which are widely applied in blind source separation (BSS). Combining the advantages of the two languages, this paper presents an implementation of mixed programming and the development of a simplified blind signal processing system. Application results show the system developed by mixed programming is successful.

Sign in / Sign up

Export Citation Format

Share Document