TY - JOUR AB - The relevance of our definition for sensitivity in refractometric sensing, being the relative change in the transmittance of a certain output channel of an optical device over the change in the refractive index of the probed material, is discussed. It is compared to one based on spectral shift per refractive index unit change. Further, there is discussion on how group delay and sensitivity are interrelated and can be converted into each other and which physical quantities are relevant for high sensitivity. As a by-product of the theory presented, a general expression relating group delay and the ratio of the time-averaged optical energy and the input power is presented. AU - Hoekstra, Hugo J. W. M. AU - Hammer, Manfred ID - 3937 IS - 7 JF - Journal of the Optical Society of America B KW - tet_topic_waveguide SN - 0740-3224 TI - General relation for group delay and the relevance of group delay for refractometric sensing VL - 31 ER - TY - CONF AB - Service Oriented Architectures (SOAs) enable the reuse and substitution of software services to develop highly flexible software systems. To benefit from the growing plethora of available services, sophisticated service discovery approaches are needed that bring service requests and offers together. Such approaches rely on rich service descriptions, which specify also the behavior of provided/requested services, e.g., by pre- and postconditions of operations. As a base for the specification a data schema is used, which specifies the used data types and their relations. However, data schemas are typically heterogeneous wrt. their structure and terminology, since they are created individually in their diverse application contexts. As a consequence the behavioral models that are typed over the heterogeneous data schemas, cannot be compared directly. In this paper, we present an holistic approach to normalize rich service description models to enable behavior-aware service discovery. The approach consists of a matching algorithm that helps to resolve structural and terminological heterogeneity in data schemas by exploiting domain-specific background ontologies. The resulting data schema mappings are represented in terms of Query View Transformation (QVT) relations that even reflect complex n:m correspondences. By executing the transformation, behavioral models are automatically normalized, which is a prerequisite for a behavior-aware operation matching. AU - Schwichtenberg, Simon AU - Gerth, Christian AU - Huma, Zille AU - Engels, Gregor ID - 394 T2 - Proceedings of the 10th European Conference on Modelling Foundations and Applications (ECMFA) TI - Normalizing Heterogeneous Service Description Models with Generated QVT Transformations ER - TY - CHAP AU - Declair, Stefan AU - Förstner, Jens ED - Choi, Anthony H.W. ID - 3941 KW - tet_topic_phc T2 - Handbook of Optical Microcavities TI - Simulation of Planar Photonic Resonators VL - Kapitel 2 ER - TY - CONF AB - 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. AU - Abshoff, Sebastian AU - Cord-Landwehr, Andreas AU - Jung, Daniel AU - Skopalik, Alexander ID - 395 T2 - Proceedings of the 10th International Conference on Web and Internet Economics (WINE) TI - Multilevel Network Games ER - TY - GEN AU - Bano, Dorina ID - 396 TI - Modeling and Matching of Reputation of Services in On-The-Fly Computing ER - TY - CONF AB - 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. AU - Scheideler, Christian AU - Eikel, Martina AU - Setzer, Alexander ID - 397 T2 - Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA) TI - Minimum Linear Arrangement of Series-Parallel Graphs ER - TY - CONF AB - 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. AU - Wiersema, Tobias AU - Drzevitzky, Stephanie AU - Platzner, Marco ID - 399 T2 - Proceedings of the International Conference on Field-Programmable Technology (FPT) TI - Memory Security in Reconfigurable Computers: Combining Formal Verification with Monitoring ER - TY - GEN AU - Bunse, Mirko ID - 400 TI - Measuring Transformation-induced Uncertainty in Service Matching: A Feasibility Study ER - TY - CONF AB - 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. AU - Platenius, Marie Christin AU - Arifulina, Svetlana AU - Petrlic, Ronald AU - Schäfer, Wilhelm ID - 401 T2 - Proceedings of the 4th International Workshop on Adaptive Services for the Future Internet TI - Matching of Incomplete Service Specifications Exemplified by Privacy Policy Matching ER - TY - CONF AB - 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. AU - Arifulina, Svetlana AU - Platenius, Marie Christin AU - Gerth, Christian AU - Becker, Steffen AU - Engels, Gregor AU - Schäfer, Wilhelm ED - Franch, Xavier ED - Ghose, AdityaK. ED - Lewis, GraceA. ED - Bhiri, Sami ID - 402 T2 - Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC 2014) TI - Market-optimized Service Specification and Matching ER - TY - GEN AU - Martin Lohre, Tobias ID - 403 TI - Machtverteilungen von Koalitionen im Fokus der politischen Realität ER - TY - GEN AU - van Straaten, Dirk ID - 404 TI - Kooperative Verhandlungen im duopolistischen Wettbewerb - eine spieltheoretische Analyse ER - TY - GEN AU - Degraf, Olga ID - 405 TI - Koalitionsbildung bei mehrdimensionalen Verhandlungsproblemen ER - TY - JOUR AB - 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. AU - As, D.J. AU - Kemper, R. AU - Mietze, C. AU - Wecker, T. AU - Lindner, Jörg AU - Veit, P. AU - Dempewolf, A. AU - Bertram, F. AU - Christen, J. ID - 4052 JF - MRS Proceedings SN - 1946-4274 TI - Spatially resolved optical emission of cubic GaN/AlN multi-quantum well structures VL - 1736 ER - TY - JOUR AB - 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. AU - Brassat, Katharina AU - Lindner, Jörg ID - 4053 JF - MRS Proceedings SN - 1946-4274 TI - A template-assisted self-organization process for the formation of a linear arrangement of pairs of metallic tips VL - 1663 ER - TY - CONF AU - Brassat, Katharina AU - Wahle, M. AU - Lindner, Jörg ID - 4054 TI - Template-assisted self-assembly process for the formation of nanogap electrodes ER - TY - CONF AU - Brassat, Katharina AU - Brodehl, Christoph AU - Lindner, Jörg ID - 4055 TI - Tuning the distance between opposing metallic nanotips formed by a template assisted self-assembly process ER - TY - CONF AU - Brassat, Katharina AU - Brodehl, Christoph AU - Pauly, Johannes AU - Drude, Dennis AU - Achtelik, Jörn AU - Riedl, Thomas AU - Lindner, Jörg ID - 4056 TI - Surface Patterning with Nanosphere Lithography ER - TY - CONF AU - Brassat, Katharina AU - Brodehl, Christoph AU - Wahle, M. AU - Lindner, Jörg ID - 4057 TI - Self-assembly for the directed self-assembly of smaller objects in a microfluidic channel ER - TY - CONF AU - Brodehl, Christoph AU - Greulich-Weber, Siegmund AU - Lindner, Jörg ID - 4058 TI - Double-Angle-Resolved Nanosphere Lithography ER -