Boolean Differential Calculus (BDC) extends Boolean *** Boolean algebra is focused on values of logic functions,BDC allows the evaluation of changes of the function values. Such changes can be investigated between cer...
详细信息
ISBN:
(纸本)9781608451821
Boolean Differential Calculus (BDC) extends Boolean *** Boolean algebra is focused on values of logic functions,BDC allows the evaluation of changes of the function values. Such changes can be investigated between certain pairs of function values as well as regarding whole subspaces. Due to the same basic data structures, BDC can be applied to any task described by logic functions and equations together with the Boolean *** used is BDC in analysis, synthesis, and testing of digital circuits. In this chapter, we introduce basic definitions of BDC together with some typical applications.
For a generic loop: while (constraints) {updates} it is well known that the termination problem is undecidable in general, even for a simple class of polynomial programs. If the constraints or the updating function in...
详细信息
ModelicaML is a UML profile for the creation of executable models. ModelicaML supports the Model-Based Systems Engineering (MBSE) paradigm and combines the power of the OMG UML standardized graphical notation for syst...
详细信息
ModelicaML is a UML profile for the creation of executable models. ModelicaML supports the Model-Based Systems Engineering (MBSE) paradigm and combines the power of the OMG UML standardized graphical notation for systems and software modeling, and the simulation power of Modelica. This addresses the increasing need for precise integrated modeling of products containing both software and hardware. This paper focuses on the implementation of executable UML state machines in ModelicaML and demonstrates that using Modelica as an action language enables the integrated modeling and simulation of continuous-time and reactive or event-based system dynamics. More specifically, this paper highlights issues that are identified in the UML specification and that are experienced with typical executable implementations of UML state machines. The issues identified are resolved and rationales for design decisions taken are discussed.
This paper presents a new tuning method based on model parameters identified in closed-loop. For classical controllers such as PI(D) controllers a large number of simple tuning methods for various application areas ex...
This paper presents a new tuning method based on model parameters identified in closed-loop. For classical controllers such as PI(D) controllers a large number of simple tuning methods for various application areas exist. However, when it comes to designing a generalised predictive controller (GPC) four parameters have to be specified. To choose those parameters is not a trivial task since they are not directly related to control or regulation performance. The presented tuning method exploits model-parameters to select suitable controller parameters. Additionally, a Rhinehart filter is incorporated in the design to decrease the impact of noise, therefore, a fifth parameter has to be optimised. The proposed method has been tested in simulation and on a real system.
Let G = ( V , E ) be a simple connected undirected graph. Each vertex v ∈ V has a cost c ( v ) and provides a positive coverage radius R ( v ). A distance d uv is associated with each edge { u , v } ∈ E, and d ( u ,...
Let G = ( V , E ) be a simple connected undirected graph. Each vertex v ∈ V has a cost c ( v ) and provides a positive coverage radius R ( v ). A distance d uv is associated with each edge { u , v } ∈ E, and d ( u , v ) is the shortest distance between every pair of vertices u , v ∈ V . A vertex v can cover all vertices that lie within the distance R ( v ), except the vertex itself. The conditional covering problem is to minimize the sum of the costs required to cover all the vertices in G . This problem is NP-complete for general graphs, even it remains NP-complete for chordal graphs. In this paper, an O ( n 2 ) time algorithm to solve a special case of the problem in a trapezoid graph is proposed, where n is the number of vertices of the graph. In this special
case, d uv = 1 for every edge { u , v } ∈ E , c ( v ) = c for every v ∈ V ( G ), and R ( v ) = R , an integer >1, for every v ∈ V ( G ). A new data structure on trapezoid graphs is used to solve the problem.
For a generic loop: while (constraints) {updates} it is well known that the termination problem is undecidable in general, even for a simple class of polynomial programs. If the constraints or the updating function in...
详细信息
For a generic loop: while (constraints) {updates} it is well known that the termination problem is undecidable in general, even for a simple class of polynomial programs. If the constraints or the updating function in the above loop is not linear, the loop is called nonlinear. In this paper, we investigate how to solve the termination of the above loop by deciding whether a fixed point exists, when the constraints are the union of intervals and the updating functions are polynomials. Furthermore, when all fixed points are on the boundaries of the union of intervals, we also establish a corresponding necessary and sufficient condition of nontermination.
DRAM row buffer conflicts can increase memory access latency significantly. This paper presents a new pageallocation-based optimization that works seamlessly together with some existing hardware and software optimizat...
详细信息
DRAM row buffer conflicts can increase memory access latency significantly. This paper presents a new pageallocation-based optimization that works seamlessly together with some existing hardware and software optimizations to eliminate significantly more row buffer conflicts. Validation in simulation using a set of selected scientific and engineering benchmarks against a few representative memory controller optimizations shows that our method can reduce row buffer miss rates by up to 76% （with an average of 37.4%）. This reduction in row buffer miss rates will be translated into performance speedups by up to 15% （with an average of 5%）.
This paper presents a novel method on coloring the grayscale images. For this purpose, a combination of artificial neural networks and some image processing algorithms was developed to transfer colors from a user-sele...
详细信息
Multithreaded Object-Oriented programming in concurrency environment using object-oriented technology is a complex activity. Programmers need to be aware of issues unrelated to their domain of problem, and are often u...
详细信息
Multithreaded Object-Oriented programming in concurrency environment using object-oriented technology is a complex activity. Programmers need to be aware of issues unrelated to their domain of problem, and are often unprepared for the challenges of the concurrent object-oriented programming brings. The interaction of their components becomes more complex, and makes it difficult to validate the design and correctness of the implemented program. Supporting separation of concerns in the design and implementation of the multithreaded object-oriented programming can provide a number of benefits such as comprehension, reusability, extensibility and adaptability in both design and implementation. We have tackled this problem by adopting the technique of separation of concerns in multithreaded object-oriented programming. In this paper we demonstrate an aspect-oriented approach that can be used for multithreaded object-oriented programming. We also show how better the separation of concerns in components. Readers/Writers problem is demonstrated using an aspect-oriented approach. Our methodology, which is based on aspect-oriented techniques as well as language and architecture independence, is an aspect-oriented framework.
Maintainability, extendibility and reusability of components in the design of robot control architectures is a major challenge. Parallel kinematic robots feature a wide variety of structures and applications. They are...
详细信息
暂无评论