Meta-modelling and graph grammars for multi-paradigm modelling in AToM<Superscript>3</Superscript>

This paper presents the combined use of meta-modelling and graph grammars for the generation of visual modelling tools for simulation formalisms. In meta-modelling, formalisms are described at a meta-level. This information is used by a meta-model processor to generate modelling tools for the described formalisms. We combine meta-modelling with graph grammars to extend the model manipulation capabilities of the generated modelling tools: edit, simulate, transform into another formalism, optimize and generate code. We store all (meta-)models as graphs, and thus, express model manipulations as graph grammars.We present the design and implementation of these concepts in AToM³ (A_To_ol for M_ulti-formalism, M_eta-M_odelling). AToM³ supports modelling of complex systems using different formalisms, all meta-modelled in their own right. Models in different formalisms may be transformed into a single common formalism for further processing. These transformations are specified by graph grammars. Mosterman and Vangheluwe [18] introduced the term multi-paradigm modelling to denote the combination of multiple formalisms, multiple abstraction levels, and meta-modelling. As an example of multi-paradigm modelling we present a meta-model for the Object-Oriented Continuous Simulation Language OOCSMP, in which we combine ideas from UML class diagrams (to express the OOCSMP model structure), Causal Block Diagrams (CBDs), and Statecharts (to specify the methods of the OOCSMP classes). A graph grammar is able to generate OOCSMP code, and then a compiler for this language (C-OOL) generates Java applets for the simulation execution.     

Packet Video Broadcasting with General-Purpose Operating Systems in an Ethernet

Video transmission with general-purpose PCs poses a number of requirements that radically differ from those of high-end dedicated video servers. We analyze the scenario of an Ethernet local area network in which a number of PCs are transmitting video streams, while other TCP/IP applications are also running concurrently. Our findings show that since the operating system clock resolution cannot cope with the transmission timing requirements the following holds: if the video transmission is performed with exact timing accuracy to maintain a constant rate then CPU load grows to 100%, thus blocking the PC for other user applications; on the other hand, if transmission is performed in a bursty manner, i.e. with sleep system calls, then CPU load decreases dramatically but the increased burstiness of the video stream has a negative impact on network performance (for example, capture effect in the Ethernet). Furthermore, the impact of video transmission over the rest of TCP/IP applications running on the same network depends heavily on the packet size. We provide an integrated analysis of operating system and network parameters to achieve video broadcasting while preserving timing requirements and minimizing the impact on other applications.     

Compiling CSPs into Tree-Driven Automata for Interactive Solving

Constraint programming techniques are widely used to model and solve decision problems and many algorithms have been developed to solve automatically and efficiently families of CSPs; nevertheless, they do not help solve interactive decision support problems, like product configuration. In such problems, the user chooses the values of the variables, and the role of the system is not to solve the CSP, but to help the user in this task. Dynamic global consistency maintaining is one of the most useful functionalities that should be offered by such a CSP platform. Unfortunately, this task is intractable in the worst case. Since interactivity requires short response times, intractability must be circumvented some way. To this end, compilation methods have been proposed that transform the original problem into a data structure allowing a short response time. In this paper, we extend the work of Amilhastre et al. [1] and Vempaty [15] by the use of a new structure, tree-driven automata, that takes advantage of the structural characteristics of configuration problems (decomposition of the components into independent subcomponents). Tree-driven automata can be far more compact than classical automata while keeping their good properties, especially a tractable complexity for the maintenance of global consistency.     

Oscillation and convergence behaviours exhibited in an ‘unstable’ second‐order digital filter with saturation‐type non‐linearity

This letter explains the oscillatory behaviours exhibited in a second‐order digital filter with saturation‐type non‐linearity via the Hopf bifurcation theorem. It is shown that depending on the bifurcation parameter, the state variables may converge to zero even when the eigenvalues of the system matrix are outside the unit circle. Copyright © 2004 John Wiley & Sons, Ltd. abstract     

General view on current conveyors

We propose a new current conveyor terminology and explain how these terms are coined. Copyright © 2004 John Wiley & Sons, Ltd.     

Die Geschichte der Vakuumkühlung. The History of Vacuum Refrigeration

The use of the high evaporation enthalpy of water is one of the oldest technologies of refrigeration for food preservation used by the mankind. One could nearly celebrate the true 5000^th anniversary of this technology. Nowadays we call the refrigeration by evaporation from wet surfaces “adiabatic refrigeration”, it regulates, for instance, our body heat by evaporating sweat. After the introduction of some vacuum pumps into the experimental scientific works, 250 years ago, namely in Great Britan, the modern form of “artificial” refrigeration began its career, the evaporation of liquids under the absence of permanent gasses in vacuum. The vacuum refrigeration has been nearly abruptly stopped by the development of compression refrigeration processes, about 150 years ago. Only after world war 2, a reintroduction of vacuum refrigeration began again. Now, at the beginning of the 3. milennium, there are good chances for recovering terrain.