@article{18963, author = {{Seng, Eva- Maria}}, journal = {{Die Welt und ihr Double. Abriss und Rekonstruktion, Bauhaus Lectures (im Druck)}}, publisher = {{Bauhaus Lectures (im Druck)}}, title = {{{Rekonstruktion des religiösen Ortes}}}, year = {{2013}}, } @inbook{18979, author = {{Seng, Eva- Maria}}, booktitle = {{Kultbild und Andachtsbild}}, editor = {{Körner, Hans and Wiener, Jürgen}}, pages = {{173--186}}, title = {{{Die Vereine für christliche Kunst und die Bildausstattung der Kirchen nach dem 2. Weltkrieg in Westfalen und Württemberg im Vergleich}}}, year = {{2013}}, } @inbook{18984, author = {{Seng, Eva- Maria}}, booktitle = {{Europäisches Kulturerbe. Bilder, Traditionen, Konfigurationen}}, editor = {{Speitkamp, Winfried}}, pages = {{69--82}}, title = {{{"Kulturerbe zwischen Globalisierung und Lokalisierung“}}}, year = {{2013}}, } @inproceedings{23135, author = {{Schmuedderich, Tanja and Lochbichler, Matthias and Trächtler, Ansgar}}, booktitle = {{Tagungsband Mechatronik 2013 (ISBN 3-86130-958-0)}}, pages = {{43--48}}, title = {{{Methodik zur anforderungsgerechten Wahl der Modellierungstiefe von Verhaltensmodellen fuer die virtuelle Inbetriebnahme}}}, year = {{2013}}, } @inproceedings{23136, author = {{Schmuedderich, Tanja and Trächtler, Ansgar and Brökelmann, Jan and Gausemeier, Jürgen}}, booktitle = {{Smart Product Engineering - Proceedings of the 23rd CIRP Design Conference (ISBN 978-3-642-30816, Springer-Verlag)}}, pages = {{23--32}}, title = {{{Procedural Model for the Virtual Commissioining on the Basis of Model-based Design}}}, year = {{2013}}, } @inproceedings{470, abstract = {{In OpenFlow [1], multiple switches share the same control plane which is centralized atwhat is called the OpenFlow controller. A switch only consists of a forwarding plane. Rules for forwarding individual packets (called ow entries in OpenFlow) are pushed from the controller to the switches. In a network with a high arrival rate of new ows, such as in a data center, the control trac between the switch and controller can become very high. As a consequence, routing of new ows will be slow. One way to reduce control trac is to use wildcarded ow entries. Wildcard ow entries can be used to create default routes in the network. However, since switches do not keep track of ows covered by a wildcard ow entry, the controller no longer has knowledge about individual ows. To nd out about these individual ows we propose an extension to the current OpenFlow standard to enable packet sampling of wildcard ow entries.}}, author = {{Wette, Philip and Karl, Holger}}, booktitle = {{Proceedings of the ACM SIGCOMM '13}}, pages = {{541--542}}, title = {{{Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow}}}, doi = {{10.1145/2486001.2491710}}, year = {{2013}}, } @inproceedings{477, abstract = {{We consider the k-token dissemination problem, where k initially arbitrarily distributed tokens have to be disseminated to all nodes in a dynamic network (as introduced by Kuhn et al., STOC 2010). In contrast to general dynamic networks, our dynamic networks are unit disk graphs, i.e., nodes are embedded into the Euclidean plane and two nodes are connected if and only if their distance is at most R. Our worst-case adversary is allowed to move the nodes on the plane, but the maximum velocity v_max of each node is limited and the graph must be connected in each round. For this model, we provide almost tight lower and upper bounds for k-token dissemination if nodes are restricted to send only one token per round. It turns out that the maximum velocity v_max is a meaningful parameter to characterize dynamics in our model.}}, author = {{Abshoff, Sebastian and Benter, Markus and Cord-Landwehr, Andreas and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}}, booktitle = {{Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers}}, pages = {{22--34}}, title = {{{Token Dissemination in Geometric Dynamic Networks}}}, doi = {{10.1007/978-3-642-45346-5_3}}, year = {{2013}}, } @misc{490, author = {{Wallaschek, Felix}}, publisher = {{Universität Paderborn}}, title = {{{Routing in heterogenen OpenFlow Netzwerken}}}, year = {{2013}}, } @misc{492, author = {{Robbert, Christoph}}, publisher = {{Universität Paderborn}}, title = {{{Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case}}}, year = {{2013}}, } @inproceedings{496, abstract = {{Within reactive topology control, a node determines its adjacent edges of a network subgraph without prior knowledge of its neighborhood. The goal is to construct a local view on a topology which provides certain desired properties such as planarity. During algorithm execution, a node, in general, is not allowed to determine all its neighbors of the network graph. There are well-known reactive algorithms for computing planar subgraphs. However, the subgraphs obtained do not have constant Euclidean spanning ratio. This means that routing along these subgraphs may result in potentially long detours. So far, it has been unknown if planar spanners can be constructed reactively. In this work, we show that at least under the unit disk network model, this is indeed possible, by proposing an algorithm for reactive construction of the partial Delaunay triangulation, which recently turned out to be a spanner. Furthermore, we show that our algorithm is message-optimal as a node will only exchange messages with nodes that are also neighbors in the spanner. The algorithm’s presentation is complemented by a rigorous proof of correctness.}}, author = {{Benter, Markus and Neumann, Florentin and Frey, Hannes}}, booktitle = {{Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)}}, pages = {{2193--2201}}, title = {{{Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks}}}, doi = {{10.1109/INFCOM.2013.6567022}}, year = {{2013}}, } @article{9866, abstract = {{The hydrothermal method utilizes a solution-based chemical reaction to synthesize piezoelectric thin films and powders. This method has a number of advantages, such as low-temperature synthesis, and high purity and high quality of the product. In order to promote hydrothermal reactions, we developed an ultrasonic assisted hydrothermal method and confirmed that it produces dense and thick lead--zirconate--titanate (PZT) films. In the hydrothermal method, a crystal growth process follows the nucleation process. In this study, we verified that ultrasonic irradiation is effective for the nucleation process, and there is an optimum irradiation period to obtain thicker PZT films. With this optimization, a 9.2-$\mu$ m-thick PZT polycrystalline film was obtained in a single deposition process. For this film, ultrasonic irradiation was carried out from the beginning of the reaction for 18 h, followed by a 6 h deposition without ultrasonic irradiation. These results indicate that the ultrasonic irradiation mainly promotes the nucleation process.}}, author = {{Ohta, Kanako and Isobe, Gaku and Bornmann, Peter and Hemsel, Tobias and Morita, Takeshi}}, issn = {{0041-624X}}, journal = {{Ultrasonics}}, keywords = {{Piezoelectric material}}, number = {{4}}, pages = {{837 -- 841}}, title = {{{Study on optimizing ultrasonic irradiation period for thick polycrystalline PZT film by hydrothermal method}}}, doi = {{10.1016/j.ultras.2012.12.003}}, volume = {{53}}, year = {{2013}}, } @book{5042, author = {{König, Rolf and Sureth-Sloane, Caren}}, publisher = {{Verlag Neue Wirtschafts-Briefe}}, title = {{{Besteuerung und Rechtsformwahl}}}, year = {{2013}}, } @inproceedings{508, abstract = {{The process of planning a virtual topology for a Wavelength Devision Multiplexing (WDM) network is called Virtual Topology Design (VTD). The goal of VTD is to find a virtual topology that supports forwarding the expected traffic without congestion. In networks with fluctuating, high traffic demands, it can happen that no single topology fits all changing traffic demands occurring over a longer time. Thus, during operation, the virtual topology has to be reconfigured. Since modern networks tend to be large, VTD algorithms have to scale well with increasing network size, requiring distributed algorithms. Existing distributed VTD algorithms, however, react too slowly on congestion for the real-time reconfiguration of large networks. We propose Selfish Virtual Topology Reconfiguration (SVTR) as a new algorithm for distributed VTD. It combines reconfiguring the virtual topology and routing through a Software Defined Network (SDN). SVTR is used for online, on-the-fly network reconfiguration. Its integrated routing and WDM reconfiguration keeps connection disruption due to network reconfiguration to a minimum and is able to react very quickly to traffic pattern changes. SVTR works by iteratively adapting the virtual topology to the observed traffic patterns without global traffic information and without future traffic estimations. We evaluated SVTR by simulation and found that it significantly lowers congestion in realistic networks and high load scenarios.}}, author = {{Wette, Philip and Karl, Holger}}, booktitle = {{Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)}}, pages = {{1 -- 6 }}, title = {{{On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks}}}, doi = {{10.1109/LANMAN.2013.6528271}}, year = {{2013}}, } @inproceedings{509, abstract = {{In this paper we will introduce a new d-dimensional graph for constructing geometric application layer overlay net-works. Our approach will use internet coordinates, embedded using the L∞ -metric. After describing the graph structure, we will show how it limits maintenance overhead by bounding each node’s out-degree and how it supports greedy routing using one-hop neighbourhood information in each routing step. We will further show that greedy routing can always compute a path in our graph and we will also prove that in each forwarding step the next hop is closer to the destination than the current node.}}, author = {{Autenrieth, Marcus and Frey, Hannes}}, booktitle = {{Proceedings of the Conference on Networked Systems (NetSys)}}, pages = {{126--131}}, title = {{{On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings}}}, doi = {{10.1109/NetSys.2013.10}}, year = {{2013}}, } @misc{511, author = {{Splietker, Malte}}, publisher = {{Universität Paderborn}}, title = {{{MapReduce in Software Defined Networks}}}, year = {{2013}}, } @article{5112, author = {{Gilroy, Bernard Michael and Lukas, Elmar and Heimann, Christian}}, journal = {{Jahrbücher für Nationalokonomie 6 Statistik}}, title = {{{Technologiestandort Deutschland und internationale Wissensspillover.}}}, volume = {{233}}, year = {{2013}}, } @inproceedings{520, abstract = {{Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case not enough resources are available to set up a new lightpath in a Wavelength Division Multiplexing (WDM) network. The selection of lightpaths to be preempted relies on internal decisions of the RWA algorithm. Thus, if dedicated properties of the network topology are required by the applications running on the network, these requirements have to be known to the RWA algorithm.Otherwise it might happen that by preempting a particular lightpath these requirements are violated. If, however, these requirements include parametersknown only at the nodes running the application, the RWA algorithm cannot evaluate the requirements. For this reason an RWA algorithm is needed which incorporates feedback from the application layer in the preemption decisions.This work proposes a simple interface along with an algorithm for computing and selecting preemption candidates in case a lightpath cannot be established. We reason about the necessity of using information from the application layer in the RWA and present two example applications which benefit from this idea.}}, author = {{Wette, Philip and Karl, Holger}}, booktitle = {{Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)}}, pages = {{51--52}}, title = {{{Incorporating feedback from application layer into routing and wavelength assignment algorithms}}}, doi = {{10.1109/INFCOMW.2013.6970733}}, year = {{2013}}, } @misc{525, author = {{Niklas Vinkemeier, Tim}}, publisher = {{Universität Paderborn}}, title = {{{Haptics - Hadoop performance testing in concurrent job scenarios}}}, year = {{2013}}, } @misc{534, author = {{Satya, Suhas}}, publisher = {{Universität Paderborn}}, title = {{{Emulating Wavelength Division Multiplexing using Openflow}}}, year = {{2013}}, } @phdthesis{547, abstract = {{In recent years, the role of process models in the development of enterprise software systems has increased continuously. Today, process models are used at different levels in the development process. For instance, in Service-Oriented Architectures (SOA), high-level business process models become input for the development of IT systems, and in running IT systems executable process models describe choreographies of Web Services. A key driver behind this development is the necessity for a closer alignment of business and IT requirements, to reduce the reaction times in software development to frequent changes in competitive markets.Typically in these scenarios, process models are developed, maintained, and transformed in a team environment by several stakeholders that are often from different business units, resulting in different versions. To obtain integrated process models comprising the changes applied to different versions, the versions need to be consolidated by means of model change management. Change management for process models can be compared to widely used concurrent versioning systems (CVS) and consists of the following major activities: matching of process models, detection of differences, computation of dependencies and conflicts between differences, and merging of process models.Although in general model-driven development (MDD) is accepted as a well-established development approach, there are still some shortcomings that let developers decide against MDD and for more traditional development paradigms. These shortcomings comprise a lack of fully integrated and fully featured development environments for MDD, such as a comprehensive support for model change management.In this thesis, we present a framework for process model change management. The framework is based on an intermediate representation for process models that serves as an abstraction of specific process modeling languages and focuses on common syntactic and semantic core concepts for the modeling of workflow in process models. Based on the intermediate representation, we match process models in versioning scenarios and compute differences between process models generically. Further, we consider the analysis of dependencies between differences and show how conflicts between differences can be computed by taking into account the semantics of the modeling language.As proof-of concept, we have implemented major parts of this framework in terms of a prototype. The detection of differences and dependencies contributed also to the Compare & Merge framework for the IBM WebSphere Business Modeler V 7.0 [1] (WBM), which was released as a product in fall 2009.}}, author = {{Gerth, Christian}}, publisher = {{Universität Paderborn}}, title = {{{Business Process Models - Change Management}}}, doi = {{10.1007/978-3-642-38604-6}}, year = {{2013}}, }