@inproceedings{39053, abstract = {{Portable devices come with different limitations in user interaction like limited display size, small keyboard, and different sorts of input and output capabilities. With the advance of speech recognition and speech synthesis technologies, their complementary use becomes attractive for mobile devices in order to implement real multimodal user interaction. However, current systems and formats do not sufficiently integrate advanced multimodal interactions. We introduce an advanced generic multimodal interaction and rendering system (MIRS) dedicated for mobile devices. MIRS incorporates efficient processing of XML specification languages for limited, mobile devices and comes with the XML-based dialog and interface specification language (DISL). DISL can be considered as an UIML subset, which is enhanced by the means of state-oriented dialog specifications. The dialog specification is based on ODSN (object oriented dialog specification notation), which has been introduced to define user interface control by means of interaction states with transition rules.}}, author = {{Müller, Wolfgang and Schäfer, Robbie and Bleul, Steffen}}, booktitle = {{Proceedings of HICCS-37}}, isbn = {{0-7695-2056-1}}, keywords = {{User interfaces, Speech recognition, Streaming media, Specification languages, Keyboards, Speech synthesis, Rendering (computer graphics), Ambient intelligence, Humans, Displays}}, location = {{Waikoloa, HI, USA}}, title = {{{Interactive Multimodal User Interfaces for Mobile Devices}}}, doi = {{10.1109/HICSS.2004.1265674}}, year = {{2004}}, } @inproceedings{39055, abstract = {{We present a rigorous but transparent semantics definition of SystemVerilog that covers processes with blocking and non-blocking statements as well as their interaction with the simulation scheduler including the management of new SystemVerilog regions. We present our definition in form of distributed Abstract State Machines (ASMs) rules reflecting the view given in the SystemVerilog Language Reference Manual [1]. Our formal semantics is a concise, unambiguous, high-level specification for SystemVerilog-based implementations and for investigation of interoperabilities of SystemVerilog with SpecC, SystemC, and VHDL.}}, author = {{Zambaldi, Martin and Ecker, Wolfgang and Kruse, Thilo and Müller, Wolfgang}}, booktitle = {{Proceedings of FDL’04}}, location = {{Lille, France}}, title = {{{The Formal Simulation Semantics of SystemVerilog}}}, year = {{2004}}, } @inproceedings{39060, author = {{Schattkowsky, Tim and Müller, Wolfgang}}, booktitle = {{Proceedings of DATE’04}}, title = {{{Model-Based Specification and Execution of Embedded Real-Time Systems}}}, year = {{2004}}, } @inproceedings{39061, abstract = {{This article presents an approach, which combines theorem proving-based refinement with model checking for state based real-time systems. Our verification flow starts from UML state diagrams, which are translated to the formal B language and are model checked for real-time properties. By means of the B language and a B theorem prover, refined state diagrams are verified against their abstract representation. The approach is presented by means of the refinement of a digital echo cancellation unit.}}, author = {{Krupp, Alexander and Müller, Wolfgang and Oliver, Ian}}, booktitle = {{Proceedings of DATE’04 Designers' Forum}}, isbn = {{0-7695-2085-5}}, keywords = {{Echo cancellers, Logic, Unified modeling language, Automata, Data structures, Boolean functions, Electronic design automation and methodology, Prototypes, Specification languages, Constraint theory}}, title = {{{Formal Refinement and Model Checking of An Echo Cancellation Unit}}}, doi = {{10.1109/DATE.2004.1269214}}, year = {{2004}}, } @inproceedings{39063, author = {{Müller, Wolfgang and Paelke, Volker}}, booktitle = {{Proceedings of the Simulation and Visualisation 2004}}, title = {{{A Formal Model of a Framework for Simulation-Based Animation}}}, year = {{2004}}, } @inproceedings{39071, abstract = {{The interconnection of software components is a key to enabling collaborative work. However, technology differences and security barriers like firewalls often hinder establishing collaborative infrastructures between enterprises or even within a single enterprise. We introduce a peer-to-peer based network infrastructure that transparently overcomes these problems using relay and routing mechanisms as well as different underlying transport protocols. We discuss the application of this technology to interconnect Web services.}}, author = {{Schattkowsky, Tim and Loeser, Chris and Müller, Wolfgang}}, booktitle = {{Proceedings of AINA2004}}, isbn = {{0-7695-2051-0}}, keywords = {{Peer to peer computing, Web services, Intelligent networks, Routing, Relays, Simple object access protocol, Collaborative work, Transport protocols, Network address translation, Java}}, location = {{Fukuoka, Japan }}, publisher = {{IEEE}}, title = {{{Peer-To-Peer Technology for Interconnecting Web Services in Heterogeneous Networks}}}, doi = {{10.1109/AINA.2004.1283977}}, year = {{2004}}, } @inproceedings{39069, abstract = {{We present the syntax and semantics of a past- and future-oriented temporal extension of the Object Constraint Language (OCL). Our extension supports designers to express time-bounded properties over a state-oriented UML model of a system under development. The semantics is formally defined over the system states of a mathematical object model. Additionally, we present a mapping to Clocked Linear Temporal Logic (Clocked LTL) formulae, which is the basis for further application in verification with model checking. We demonstrate the applicability of the approach by the example of a buffer specification in the context of a production system.}}, author = {{Flake, Stephan and Müller, Wolfgang}}, booktitle = {{Proceedings of SEFM´04}}, isbn = {{0-7695-2222-X}}, keywords = {{Unified modeling language, Logic, Clocks, Boolean functions, Application software, Time factors, Real time systems, Formal verification, Buffer storage, Software packages}}, publisher = {{IEEE}}, title = {{{Past- and Future-Oriented Time-Bound Temporal Properties with OCL}}}, doi = {{10.1109/SEFM.2004.1347516}}, year = {{2004}}, } @inproceedings{39065, author = {{Gausemeier, Jürgen and Müller, Wolfgang and Bauch, Jürgen and Radkowski, W. and Shen, T. and Paelke, Volker}}, booktitle = {{Proceedings of the Simulation and Visualisation 2004}}, title = {{{Lösungselementbasiertes Virtual Prototyping von Selbstoptimierenden Mechatronischen Systemen in Virtual Reality}}}, year = {{2004}}, } @inproceedings{39068, author = {{Schattkowsky, Tim and Müller, Wolfgang}}, booktitle = {{Proceedings of ISORC’04}}, title = {{{Model-Based Design of Embedded Systems}}}, year = {{2004}}, } @inproceedings{39078, author = {{Gausemeier, Jürgen and Müller, Wolfgang and Paelke, Volker and Bauch, Jürgen and Shen, Q. and Radkowski, R. }}, booktitle = {{Proceedings of the Design 2004}}, keywords = {{mechatronic systems, self-optimization, virtual prototyping}}, location = {{Dubrovnik}}, title = {{{Virtual Prototyping Of Self-Optimizing Mechatronic Systems}}}, year = {{2004}}, } @inproceedings{39075, author = {{Loeser, Chris and Schäfer, Robbie and Müller, Wolfgang and Borowski, Marek}}, booktitle = {{Proceedings of SCI’04}}, title = {{{RTMC - An Adaptive Fraemwork for Remote Tool Monitoring and Control}}}, year = {{2004}}, } @inproceedings{39082, abstract = {{The provision of personalized user interfaces for mobile de-vices is a challenging task since different devices with vary-ing capabilities and interaction modalities have to be sup-ported. Multiple variants of different UIs for one application almost enforces the employment of a model-based approach in order to design one interface and to adapt to or render it on those devices. This position paper presents a new dia-log modelling language named DISL (Dialog and Interface Specification Language) that is based on UIML and DSN (Dialog Specification Notation). DISL supports the mod-elling of advanced dialogs in a comprehensive way. The dialog descriptions are device-and modality-agnostic and therefore highly scalable with focus on limited devices, like mobile phones.}}, author = {{Bleul, Steffen and Müller, Wolfgang and Schäfer, Robbie}}, booktitle = {{Proceedings of AVI 2004}}, title = {{{Multimodal Dialog Description for Mobile Devices}}}, year = {{2004}}, } @inproceedings{39350, abstract = {{Variation in different mobile devices with different capabilities and interaction modalities as well as changing user context in nomadic applications, poses huge challenges to the design of user interfaces. To avoid multiple designs for each device or modality, it is almost a must to employ a model-based approach. In this short paper, we present a new dialog model for multimodal interaction together with an advanced control model, which can either be used for direct modeling by an interface designer or in conjunction with higher level models.}}, author = {{Schäfer, Robbie and Bleul, Steffen and Müller, Wolfgang}}, booktitle = {{Proceedings of EHCI-DSVIS 2005}}, keywords = {{Multimodal User Interface High Level Model Multimodal User High Level Approach Dialog Model}}, title = {{{A Novel Dialog Model for the Design of Multimodal User Interfaces}}}, year = {{2004}}, } @inproceedings{39352, abstract = {{The recently adopted OCL 2.0 specification comes with a formal semantics that is based on set theory with a notion of an object model and system states. System states keep the runtime information relevant for the evaluation of OCL expressions. However, not all new language concepts of OCL 2.0 are already addressed in that formal semantics. We show how to overcome this by introducing new components to the object model and system states defining a dynamic semantics of OCL. In order to give precise rules that determine when the current system state has to be updated according to a change in the referred UML model, we make use of adequate mathematical means, namely Abstract State Machines (ASMs). Though our ASM specification also gives a clear definition for the evaluation of OCL constraints, it leaves sufficient flexibility for application specific implementations that have to determine when constraints are to be checked.}}, author = {{Flake, Stephan and Müller, Wolfgang}}, booktitle = {{Proceedings of the UML 2004}}, keywords = {{System State Formal Semantic Object Management Group Denotational Semantic Dynamic Semantic}}, title = {{{An ASM Definition of the Dynamic OCL 2.0 Semantics}}}, doi = {{10.1007/978-3-540-30187-5_17}}, year = {{2004}}, } @techreport{2533, author = {{ Handziski, Vlado and Köpke, Andreas and Karl, Holger and Wolisz, Adam}}, title = {{{A common wireless sensor network architecture?}}}, year = {{2003}}, } @inproceedings{2535, author = {{Drytkiewicz, Witold and Sroka, Steffen and Handzisk, Vlado and Köpke, Andreas and Karl, Holger}}, booktitle = {{Proc. of 3rd International OMNeT++ Workshop at Budapest University of Technology and Economics}}, title = {{{A Mobility Frame work for OMNeT++}}}, year = {{2003}}, } @article{19726, abstract = {{The Paderborn University BSP (PUB) library is a C communication library based on the BSP model. The basic library supports buffered as well as unbuffered non-blocking communication between any pair of processors and a mechanism for synchronizing the processors in a barrier style. In addition, PUB provides non-blocking collective communication operations on arbitrary subsets of processors, the ability to partition the processors into independent groups that execute asynchronously from each other, and a zero-cost synchronization mechanism. Furthermore, some techniques used in the implementation of the PUB library deviate significantly from the techniques used in other BSP libraries.}}, author = {{Bonorden, Olaf and Juurlink, Bernhardus and von Otte, Ingo and Rieping, Ingo}}, issn = {{0167-8191}}, journal = {{Parallel Computing}}, pages = {{187--207}}, title = {{{The Paderborn University BSP (PUB) library}}}, doi = {{10.1016/s0167-8191(02)00218-1}}, year = {{2003}}, } @article{19785, author = {{Salzwedel, Kay A.}}, isbn = {{9783540008835}}, issn = {{0302-9743}}, journal = {{Algorithms for Memory Hierarchies}}, title = {{{Algorithmic Approaches for Storage Networks}}}, doi = {{10.1007/3-540-36574-5_12}}, volume = {{2625}}, year = {{2003}}, } @inproceedings{19790, abstract = {{The advances in Internet technology have led to tremendous improvements in business, education, and science and have changed the way we think, live, and communicate. Information exchange has become ubiquitous by the possibilities offered through modern technologies. We are able to offer information 24 hours a day through our web sites and can leave messages every time and from anywhere in the world. This change in communication has led to new challenges. Enterprises have to deal with an information amount that doubles every year. The technological foundation to cope with this information explosion is given by Storage Area Networks (SANs), which are able to connect a great number of storage systems over a fast interconnection network. However, to be able to use the benefits of a SAN, an easy-to-use and efficient management support has to be given to the storage administrator. In this paper, we will suggest new storage management concepts and we will introduce a new management environment that is able to significantly reduce management costs and increases the performance and resource utilization of the given SAN infrastructure.}}, author = {{Scheideler, Christian and Salzwedel, Kay and Meyer auf der Heide, Friedhelm and Brinkmann, André and Vodisek, Mario and Rückert, Ulrich}}, booktitle = {{Proceedings of SSGRR 2003}}, title = {{{Storage Management as Means to cope with Exponential Information Growth}}}, year = {{2003}}, } @inproceedings{19806, abstract = {{We try to close the gap between theoretical investigations of wireless network topologies and realistic wireless environments. For point-to-point communication, we examine theoretically well-analyzed sparse graphs, i.e. the Yao-graph, the SparsY-graph, and the SymmY-graph. We present distributed algorithms that can be used to build up these graphs in time $O(log n)$ per node without the use of any geo-graphical positioning system. Our algorithms are based only on local knowledge and local decisions and make use of power control to establish communication links with low energy-cost. We compare these algorithms with respect to congestion, dilation, and energy. For congestion we introduce different measures that allow us to investigate the difference between real-world wireless networks and models for wireless communication at a high level of abstraction. For more realistic simulations we extend our simulation environment SAHNE. We use a realistic transmission model for directed communication that uses sector subdivision. Finally, our experimental results show that our topologies and algorithms work well in a distributed environment and we give some recommendations for the topology control based on our simulations.}}, author = {{Rührup, Stefan and Schindelhauer, Christian and Volbert, Klaus and Grünewald, M.}}, booktitle = {{Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS)}}, isbn = {{0769519261}}, title = {{{Performance of distributed algorithms for topology control in wireless networks}}}, doi = {{10.1109/ipdps.2003.1213107}}, year = {{2003}}, }