@inproceedings{13626, author = {{Danne, Klaus and Platzner, Marco}}, booktitle = {{Proceedings of the 13th Reconfigurable Architectures Workshop (RAW)}}, publisher = {{IEEE CS Press}}, title = {{{Partitioned Scheduling of Periodic Real-time Tasks onto Reconfigurable Hardware}}}, year = {{2006}}, } @misc{47649, author = {{Funke, Rafael}}, title = {{{Implementierung und Simulation von Cache-Angriffen auf AES}}}, year = {{2006}}, } @misc{47648, author = {{Schrieb, Jonas}}, title = {{{Von identitätsbasierten Kryptosystemen zu CCA-Sicherheit}}}, year = {{2006}}, } @misc{47691, author = {{Gorski, Michael}}, keywords = {{Diplomarbeit}}, title = {{{Boomerang- und Rechteckangriff auf AES}}}, year = {{2006}}, } @inproceedings{46422, author = {{Mehnen, J and Trautmann, Heike}}, booktitle = {{CIRP ICME ’06) — Proceedings of the 5$^th$ CIRP International Seminar on Intelligent Computation in Manufacturing Engineering}}, editor = {{Teti, R}}, pages = {{293–298}}, publisher = {{C.O.C. Com. org. Conv. CIRP ICME ’06}}, title = {{{Integration of Expert’s Preferences in Pareto Optimization by Desirability Function Techniques}}}, year = {{2006}}, } @misc{47692, author = {{ Naewe, Stefanie}}, keywords = {{Diplomarbeit}}, title = {{{Samplemethoden in der algorithmischen Geometrie der Zahlen, Diplomarbeit}}}, year = {{2006}}, } @inproceedings{38533, abstract = {{UML (Unified Modeling Language™) as an OMG standard has received wide acceptance in software engineering over the last years. As electronic systems design moved towards software engineering, there is emerging interest for UML within the hardware community and different UML diagrams and their variations found their application in requirements specification, testbenches, architectural descriptions, and behavioral modeling.In most cases, UML is just applied as a graphical capture, though UML 2.0 meanwhile comes as a computationally complete language based on a generic metamodeling mechanism. Though it introduces considerable complexity, it is one of the key strengths of UML 2.0, providing a flexible foundation for its customization towards different application domains through so-called UML profiles, which currently receives increasing tool support and gives UML great potential to complement current C++-oriented languages for ESL design. In this context, SysML and the UML for SoC extension are already available as OMG profiles for Systems Engineering and SoC application and several proprietary profiles are under development. In that context, the concepts of the Model Driven Architecture (MDA) are of emerging interest. However, since MDA was mainly introduced for CASE tool support, its full application for hardware design still needs some investigations and certainly comes with some pitfalls.For industrial applications, the availability of appropriate tool support is crucial for deployment of UML in SoC design. UML tools currently come in different variations based on different UML versions and subsets with the support of specific flows, so that the selection of the appropriate tools becomes a key decision for the successful introduction of UML. Recently, several groups have reported positive outcomes regarding the customization of UML and tool support towards SoC design. These efforts result from collaborations between industrial users, researchers, and tool vendors, and constitute steps in the right direction. Regarding model exchange between tools, the UML-related XMI (XML Metadata Interchange) format and its relationship to SPIRIT, the emerging IEEE standard, are of additional particular interest. Partial overlaps can be identified and are currently under investigations by some projects, like SPRINT.}}, author = {{Müller, Wolfgang and Vanderperren, Yves}}, booktitle = {{Proceedings of CODES/ISSS}}, title = {{{UML and Model-Driven Development for SoC Design}}}, year = {{2006}}, } @inproceedings{38537, abstract = {{Ubiquitous systems use context information to select and adapt multimodal user interfaces and appliances for individual users in certain situations. However, in order to enable true reactive environments, context information has to be adequately collected, filtered, and processed and combined with user, device and other profiles. In this article, we present how an XML-based transcoding system can be applied for advanced profile processing and evolution. We demonstrate how to encode domain knowledge into sets of rules, which perform adaptations of user, device and context profiles for smart environments.}}, author = {{Schäfer, Robbie and Müller, Wolfgang and Groppe, Jinghua}}, booktitle = {{Proceedings of the 3rd International Conference on Ubiquitous Intelligence and Computing (UIC-06)}}, keywords = {{Resource Description Framework User Preference Smart Home Prefer Temperature Preference Profile}}, title = {{{Profile Processing and Evolution for Smart Environments}}}, year = {{2006}}, } @inproceedings{38538, abstract = {{Neither UML 2.0 nor the upcoming SysML 1.0 currently provides suffi- cient means for applications in the context of heterogeneous electronic systems de- scription and simulation. In this article, we demonstrate how general concepts of the simulation framework Ptolemy II seamlessly complement SysML to serve as a uni- versal description language covering discrete event as well as continuous behaviors.}}, author = {{Müller, Wolfgang and Zabel, Henning}}, booktitle = {{Proceedings of the UML-SoC Workshop at DAC 2006}}, title = {{{Towards a Unified Behavioural Modelling Language}}}, year = {{2006}}, } @inproceedings{38536, author = {{Müller, Wolfgang}}, booktitle = {{Proc. of FDL'06}}, title = {{{UML - The Emerging Hardware Description Language?}}}, year = {{2006}}, } @inproceedings{38540, author = {{Lavagno, Luciano and Müller, Wolfgang}}, title = {{{UML: A Next Generation Language for SoC Design}}}, year = {{2006}}, } @inproceedings{38543, abstract = {{Today a large variety of mobile interaction devices such as PDAs and mobile phones enforce the development of a wide range of user interfaces for each platform. The complexity even grows, when multiple interaction devices are used to perform the same task and when different modalities have to be supported. We introduce a new dialog model for the abstraction of concrete user interfaces with a separate advanced control layer for the integration of different modalities. In this context, we present the Dialog and Interface Specification Language (DISL), which comes with a proof-of-concept implementation.}}, author = {{Schäfer, Robbie and Bleul, Steffen and Müller, Wolfgang}}, booktitle = {{Proceedings of the 5th International Workshop on Task Models and Diagrams for User Interface Design (TAMODIA'2006)}}, isbn = {{978-3-540-70815-5}}, keywords = {{User Interface Interaction Manager Output Device Multimodal Interface Interaction Object}}, title = {{{Dialog Modelling for Multiple Devices and Multiple Interaction Modalities}}}, doi = {{10.1007/978-3-540-70816-2_4}}, year = {{2006}}, } @inproceedings{38784, abstract = {{This article presents the classification tree method for functional verification to close the gap from the specification of a test plan to SystemVerilog (Chandra and Chakrabarty, 2001) test bench generation. Our method supports the systematic development of test configurations and is based on the classification tree method for embedded systems (CTM/ES) (Chakrabarty et al., 2000) extending CTM/ES for random test generation as well as for functional coverage and property specification}}, author = {{Krupp, Alexander and Müller, Wolfgang}}, booktitle = {{Proceedings of the Design Automation & Test in Europe Conference}}, isbn = {{3-9810801-1-4}}, keywords = {{Classification tree analysis, System testing, Embedded system, Safety, Automatic testing, Automation}}, publisher = {{IEEE}}, title = {{{Classification Trees for Functional Coverage and Random Test Generation}}}, doi = {{10.1109/DATE.2006.243902}}, year = {{2006}}, } @inproceedings{39028, abstract = {{User adaptive systems, as envisioned with Ambient Intel- ligence (AmI), can only unveil their power, if rich informa- tion of users – including private data as their preferences and abilities as well as their usage context – can be retrieved and evaluated. However, collecting and storing this data poses severe privacy problems both legally and from a trust per- spective. Therefore we propose a home automation middle- ware for secure management of personal profiles that allows access to profiles only for the relevant stakeholders in a spe- cific situation.}}, author = {{Schäfer, Robbie and Ziegler, Max and Müller, Wolfgang}}, booktitle = {{Proceedings of the Workshop on Privacy Enhanced Personalization (CHI 2006)}}, title = {{{Securing Personal Data in Smart Home Environments}}}, year = {{2006}}, } @inproceedings{38107, abstract = {{TestML is an XML-based language for the exchange of test descriptions in automotive systems design and mainly introduced through the structural definition of an XML schema as an independent exchange format for existing tools and methods covering a wide range of different test technologies. In this paper, we present a rigorous formal behavioral semantics for TestML by means of Abstract State Machines (ASMs). Our semantics is a concise, unambiguous, high-level specification for TestML-based implementations and serves as a basis to define exact and well-defined mappings between existing test languages and TestML.}}, author = {{Großmann, Jürgen and Müller, Wolfgang}}, booktitle = {{Proc. of ISOLA 06}}, isbn = {{978-0-7695-3071-0}}, keywords = {{System testing, Software testing, Automotive engineering, Automatic testing, Machinery production industries, Protocols, Hardware design languages, Samarium, XML, Computer industry}}, location = {{Paphos, Cyprus}}, title = {{{A Formal Behavioral Semantics for TestML}}}, doi = {{10.1109/ISoLA.2006.37}}, year = {{2006}}, } @inproceedings{38109, author = {{Müller, Wolfgang and Rosti, Alberto and Bocchio, Sara and Riccobene, Elvinia and Dehaene, Wim and Vanderperren, Yves}}, booktitle = {{Proc. of ICCAD'06}}, title = {{{UML for ESL Design - Basic Principles, Tools, and Applications}}}, year = {{2006}}, } @phdthesis{19611, author = {{Volbert, Klaus}}, isbn = {{3-935433-77-8}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Geometric Spanners for Topology Control in Wireless Networks}}}, volume = {{168}}, year = {{2005}}, } @inproceedings{19827, abstract = {{We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k+2 edges it interchanges the end vertices of the path. By definition this operation preserves regularity and connectivity. We show that every regular connected graph can be reached by a series of these operations for all k ¡Ý 1. We use a randomized version, called Random k-Flipper, in order to create random regular connected undirected graphs that may serve as a backbone for peer-to-peer networks. We prove for degree d¡Ê ¦¸(log n) that a series of O(dn) Random k-Flipper operations with k ∈ ¦¨(d2n2 log 1/¦Å) transforms any graph into an expander graph with high probability, i.e. 1-n-¦¨(1). The Random 1-Flipper is symmetric, i.e. the transformation probability from any labeled d-regular graph G to G' is equal to those from G' to G. From this and the reachability property we conclude that in the limit a series of Random 1-Flipper operations converges against an uniform probability distribution over all connected labeled d-regular graphs. For degree d ∈ ω(1) growing with the graph size this implies that iteratively applying Random 1-Flipper transforms any given graph into an expander asymptotically almost surely. We use these operations as a maintenance operation for a peer-to-peer network based on random regular connected graphs that provides high robustness and recovers from degenerate network structures by continuously applying these random graph transformations. For this, we describe how network operations for joining and leaving the network can be designed and how the concurrency of the graph transformations can be handled.}}, author = {{Mahlmann, Peter and Schindelhauer, Christian}}, booktitle = {{Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures - SPAA'05}}, isbn = {{1581139861}}, title = {{{Peer-to-peer networks based on random transformations of connected regular undirected graphs}}}, doi = {{10.1145/1073970.1073992}}, year = {{2005}}, } @inproceedings{19834, abstract = {{We present a strategy for organizing the communication in wireless ad hoc networks based on a cell structure. We use the unit disk graph model and assume positioning capabilities for all nodes. The cell structure is an abstract view on the network and represents regions where nodes reside (node cells), regions that can be used for the communication flow (link cells) and regions that cannot be bridged due to the restricted transmission range (barrier cells). Each node can establish a cell classification of its neighborhood based on the position data which is announced by all nodes.
The cell structure has two advantages for applying position-based routing: It helps to determine local minima for greedy forwarding and improves recovery from such minima, because for recovery all edges can be used in contrast to other topology-based rules that can be appliedonly on a planar subgraph.
For the analysis of position-based routing algorithms the measures time and traffic are based on the cell structure. The difficulty of exploring the network is expressed by the size of the barriers (i.e. the number of cells in the perimeters). Exploration can be done in parallel, but with increasing traffic. We propose a comparative measure to assess both time and traffic, the combined comparative ratio, which is the maximum of the ratio of routing time and optimal time and the ratio of the traffic and the minimum exploration costs.
While flooding and common single-path strategies have a linear ratio, we present a simple algorithm that has a sub-linear
combined comparative ratio of O(sqrt(h)), where h is the minimal hop distance between source and target.}}, author = {{Rührup, Stefan and Schindelhauer, Christian}}, booktitle = {{19th IEEE International Parallel and Distributed Processing Symposium}}, isbn = {{0769523129}}, pages = {{248}}, title = {{{Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure}}}, doi = {{10.1109/ipdps.2005.147}}, year = {{2005}}, } @inproceedings{19835, abstract = {{The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with
variable transmission ranges. It was introduced and analyzed by Meyer auf der Heide et al. 2004.
In this paper we present a distributed, localized and resource-efficient algorithm for constructing this graph. The qualtiy of the HL graph depends on the domination radius and the publication radius, which affect the amount of interference in the network. These parameters also determine whether the HL graph is a c-spanner, which implies an energy-efficient topology. We investigate the performance on randomly distributed node sets and show that the restrictions on these parameters derived from a worst case analysis are not so tight using realistic settings.

Here, we present the results of our extensive experimental evaluation, measuring congestion, dilation and energy. Congestion includes the load that is induced by interfering edges. We distinguish between congestion and realistic congestion where we also take the signal-to-interference ratio into account.
Our experiments show that the HL graph contains energy-efficient paths as well as paths with a few number of hops while preserving a low congestion.}}, author = {{Rührup, Stefan and Schindelhauer, Christian and Volbert, Klaus}}, booktitle = {{Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005)}}, isbn = {{9783540291329}}, issn = {{0302-9743}}, pages = {{244--257}}, title = {{{Performance Analysis of the Hierarchical Layer Graph for Wireless Networks}}}, doi = {{10.1007/11561354_21}}, volume = {{3738}}, year = {{2005}}, }