@inbook{3941, author = {{Declair, Stefan and Förstner, Jens}}, booktitle = {{Handbook of Optical Microcavities}}, editor = {{Choi, Anthony H.W.}}, keywords = {{tet_topic_phc}}, publisher = {{Pan Stanford Publishing Pte. Ltd.}}, title = {{{Simulation of Planar Photonic Resonators}}}, volume = {{Kapitel 2}}, year = {{2014}}, } @inproceedings{395, abstract = {{We consider a multilevel network game, where nodes can improvetheir communication costs by connecting to a high-speed network.The n nodes are connected by a static network and each node can decideindividually to become a gateway to the high-speed network. The goalof a node v is to minimize its private costs, i.e., the sum (SUM-game) ormaximum (MAX-game) of communication distances from v to all othernodes plus a fixed price α > 0 if it decides to be a gateway. Between gatewaysthe communication distance is 0, and gateways also improve othernodes’ distances by behaving as shortcuts. For the SUM-game, we showthat for α ≤ n − 1, the price of anarchy is Θ (n/√α) and in this rangeequilibria always exist. In range α ∈ (n−1, n(n−1)) the price of anarchyis Θ(√α), and for α ≥ n(n − 1) it is constant. For the MAX-game, weshow that the price of anarchy is either Θ (1 + n/√α), for α ≥ 1, orelse 1. Given a graph with girth of at least 4α, equilibria always exist.Concerning the dynamics, both games are not potential games. For theSUM-game, we even show that it is not weakly acyclic.}}, author = {{Abshoff, Sebastian and Cord-Landwehr, Andreas and Jung, Daniel and Skopalik, Alexander}}, booktitle = {{Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}}, pages = {{435--440}}, title = {{{Multilevel Network Games}}}, doi = {{10.1007/978-3-319-13129-0_36}}, year = {{2014}}, } @misc{396, author = {{Bano, Dorina}}, publisher = {{Universität Paderborn}}, title = {{{Modeling and Matching of Reputation of Services in On-The-Fly Computing}}}, year = {{2014}}, } @inproceedings{397, abstract = {{We present a factor $14D^2$ approximation algorithm for the minimum linear arrangement problem on series-parallel graphs, where $D$ is the maximum degree in the graph. Given a suitable decomposition of the graph, our algorithm runs in time $O(|E|)$ and is very easy to implement. Its divide-and-conquer approach allows for an effective parallelization. Note that a suitable decomposition can also be computed in time $O(|E|\log{|E|})$ (or even $O(\log{|E|}\log^*{|E|})$ on an EREW PRAM using $O(|E|)$ processors). For the proof of the approximation ratio, we use a sophisticated charging method that uses techniques similar to amortized analysis in advanced data structures. On general graphs, the minimum linear arrangement problem is known to be NP-hard. To the best of our knowledge, the minimum linear arrangement problem on series-parallel graphs has not been studied before.}}, author = {{Scheideler, Christian and Eikel, Martina and Setzer, Alexander}}, booktitle = {{Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)}}, pages = {{168----180}}, title = {{{Minimum Linear Arrangement of Series-Parallel Graphs}}}, year = {{2014}}, } @inproceedings{399, abstract = {{Ensuring memory access security is a challenge for reconfigurable systems with multiple cores. Previous work introduced access monitors attached to the memory subsystem to ensure that the cores adhere to pre-defined protocols when accessing memory. In this paper, we combine access monitors with a formal runtime verification technique known as proof-carrying hardware to guarantee memory security. We extend previous work on proof-carrying hardware by covering sequential circuits and demonstrate our approach with a prototype leveraging ReconOS/Zynq with an embedded ZUMA virtual FPGA overlay. Experiments show the feasibility of the approach and the capabilities of the prototype, which constitutes the first realization of proof-carrying hardware on real FPGAs. The area overheads for the virtual FPGA are measured as 2x-10x, depending on the resource type. The delay overhead is substantial with almost 100x, but this is an extremely pessimistic estimate that will be lowered once accurate timing analysis for FPGA overlays become available. Finally, reconfiguration time for the virtual FPGA is about one order of magnitude lower than for the native Zynq fabric.}}, author = {{Wiersema, Tobias and Drzevitzky, Stephanie and Platzner, Marco}}, booktitle = {{Proceedings of the International Conference on Field-Programmable Technology (FPT)}}, pages = {{167--174}}, title = {{{Memory Security in Reconfigurable Computers: Combining Formal Verification with Monitoring}}}, doi = {{10.1109/FPT.2014.7082771}}, year = {{2014}}, } @misc{400, author = {{Bunse, Mirko}}, publisher = {{Universität Paderborn}}, title = {{{Measuring Transformation-induced Uncertainty in Service Matching: A Feasibility Study}}}, year = {{2014}}, } @inproceedings{401, abstract = {{Service matching approaches determine to what extent a provided service matches a requester's requirements. This process is based on service specifications describing functional (e.g., signatures) as well as non-functional properties (e.g., privacy policies). However, we cannot expect service specifications to be complete as providers do not want to share all details of their services' implementation. Moreover, creating complete specifications requires much effort. In this paper, we propose a novel service matching approach taking into account a service's signatures and privacy policies. In particular, our approach applies fuzzy matching techniques that are able to deal with incomplete service specifications. As a benefit, decision-making based on matching results is improved and service matching becomes better applicable in practice.}}, author = {{Platenius, Marie Christin and Arifulina, Svetlana and Petrlic, Ronald and Schäfer, Wilhelm}}, booktitle = {{Proceedings of the 4th International Workshop on Adaptive Services for the Future Internet}}, pages = {{6--17}}, title = {{{Matching of Incomplete Service Specifications Exemplified by Privacy Policy Matching}}}, doi = {{10.1007/978-3-319-14886-1_2}}, year = {{2014}}, } @inproceedings{402, abstract = {{Various approaches in service engineering are based on servicemarkets where brokers use service matching in order to performservice discovery. For matching, a broker translates the specifications ofproviders' services and requesters' requirements into her own specificationlanguage, in order to check their compliance using a matcher. Thebroker's success depends on the configuration of her language and itsmatcher because they in uence important properties like the effort forproviders and requesters to create suitable specifications as well as accuracyand runtime of matching. However, neither existing service specification languages, nor existing matching approaches are optimized insuch way. Our approach automatically provides brokers with an optimalconfiguration of a language and its matcher to improve her success ina given market with respect to her strategy. The approach is based onformalized configuration properties and a predefined set of configurationrules.}}, author = {{Arifulina, Svetlana and Platenius, Marie Christin and Gerth, Christian and Becker, Steffen and Engels, Gregor and Schäfer, Wilhelm}}, booktitle = {{Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC 2014)}}, editor = {{Franch, Xavier and Ghose, AdityaK. and Lewis, GraceA. and Bhiri, Sami}}, pages = {{543--550}}, title = {{{Market-optimized Service Specification and Matching}}}, doi = {{10.1007/978-3-662-45391-9_47}}, year = {{2014}}, } @misc{403, author = {{Martin Lohre, Tobias}}, publisher = {{Universität Paderborn}}, title = {{{Machtverteilungen von Koalitionen im Fokus der politischen Realität}}}, year = {{2014}}, } @misc{404, author = {{van Straaten, Dirk}}, publisher = {{Universität Paderborn}}, title = {{{Kooperative Verhandlungen im duopolistischen Wettbewerb - eine spieltheoretische Analyse}}}, year = {{2014}}, } @misc{405, author = {{Degraf, Olga}}, publisher = {{Universität Paderborn}}, title = {{{Koalitionsbildung bei mehrdimensionalen Verhandlungsproblemen}}}, year = {{2014}}, } @article{4052, abstract = {{In this contribution we report on the optical properties of cubic AlN/GaN asymmetric multi quantum wells (MQW) structures on 3C-SiC/Si (001) substrates grown by radio-frequency plasma-assisted molecular beam epitaxy (MBE). Scanning transmission electron microscopy (STEM) and spatially resolved cathodoluminescence (CL) at room temperature and at low temperature are used to characterize the optical properties of the cubic AlN/GaN MQW structures. An increasing CL emission intensity with increasing film thickness due to the improved crystal quality was observed. This correlation can be directly connected to the reduction of the linewidth of x-ray rocking curves with increasing film thickness of the c-GaN films. Defects like stacking faults (SFs) on the {111} planes, which also can be considered as hexagonal inclusions in the cubic crystal matrix, lead to a decrease of the CL emission intensity. With low temperature CL line scans also monolayer fluctuations of the QWs have been detected and the observed transition energies agree well with solutions calculated using a one-dimensional (1D) Schrödinger-Poisson simulator.}}, author = {{As, D.J. and Kemper, R. and Mietze, C. and Wecker, T. and Lindner, Jörg and Veit, P. and Dempewolf, A. and Bertram, F. and Christen, J.}}, issn = {{1946-4274}}, journal = {{MRS Proceedings}}, publisher = {{Cambridge University Press (CUP)}}, title = {{{Spatially resolved optical emission of cubic GaN/AlN multi-quantum well structures}}}, doi = {{10.1557/opl.2014.944}}, volume = {{1736}}, year = {{2014}}, } @article{4053, abstract = {{A novel process for the formation of pairs of opposing metallic nanotips within linear trenches on a silicon wafer is investigated in detail. The process is based on a spreading knife technique typically used in nanosphere lithography to generate monolayers of colloidal polystyrene beads. Here it is applied to initiate self-assembly of spheres in long linear trenches acting as a template for the sphere arrangement. The optimum blade velocity to deposit the spheres selectively and densely packed in the trench depends on the trench surface fraction and can be described by a modified Dimitrov model. It is demonstrated that the spheres can be used as a shadow mask to deposit metallic nanotips in a channel, which are electrically interconnected on each side of the trench, possibly enabling the control and manipulation of nanoobjects in the channel.}}, author = {{Brassat, Katharina and Lindner, Jörg}}, issn = {{1946-4274}}, journal = {{MRS Proceedings}}, location = {{Bosten (MA)}}, publisher = {{Cambridge University Press (CUP)}}, title = {{{A template-assisted self-organization process for the formation of a linear arrangement of pairs of metallic tips}}}, doi = {{10.1557/opl.2014.265}}, volume = {{1663}}, year = {{2014}}, } @inproceedings{4054, author = {{Brassat, Katharina and Wahle, M. and Lindner, Jörg}}, location = {{Porquerolles (France)}}, title = {{{Template-assisted self-assembly process for the formation of nanogap electrodes}}}, year = {{2014}}, } @inproceedings{4055, author = {{Brassat, Katharina and Brodehl, Christoph and Lindner, Jörg}}, location = {{San Francisco (USA)}}, title = {{{Tuning the distance between opposing metallic nanotips formed by a template assisted self-assembly process}}}, year = {{2014}}, } @inproceedings{4056, author = {{Brassat, Katharina and Brodehl, Christoph and Pauly, Johannes and Drude, Dennis and Achtelik, Jörn and Riedl, Thomas and Lindner, Jörg}}, location = {{Paderborn (Germany)}}, title = {{{Surface Patterning with Nanosphere Lithography}}}, year = {{2014}}, } @inproceedings{4057, author = {{Brassat, Katharina and Brodehl, Christoph and Wahle, M. and Lindner, Jörg}}, location = {{Boston (USA)}}, title = {{{Self-assembly for the directed self-assembly of smaller objects in a microfluidic channel}}}, year = {{2014}}, } @inproceedings{4058, author = {{Brodehl, Christoph and Greulich-Weber, Siegmund and Lindner, Jörg}}, location = {{Porquerolles (France)}}, title = {{{Double-Angle-Resolved Nanosphere Lithography}}}, year = {{2014}}, } @inproceedings{4059, author = {{Brodehl, Christoph and Greulich-Weber, Siegmund and Lindner, Jörg}}, location = {{Warsaw (Poland)}}, title = {{{Nanosphere lithography for the creation of nanoparticle arrays with tailored shape}}}, year = {{2014}}, } @inproceedings{4060, author = {{Brodehl, Christoph and Greulich-Weber, Siegmund and Lindner, Jörg}}, location = {{Boston (USA)}}, title = {{{Fabrication of Arrays of Nanoparticles with Arbitrarily Designed Shape}}}, year = {{2014}}, }