@inproceedings{379, abstract = {{In the leasing variant of Set Cover presented by Anthony et al.[1], elements U arrive over time and must be covered by sets from a familyF of subsets of U. Each set can be leased for K different periods of time.Let |U| = n and |F| = m. Leasing a set S for a period k incurs a cost ckS and allows S to cover its elements for the next lk time steps. The objectiveis to minimize the total cost of the sets leased, such that elements arrivingat any time t are covered by sets which contain them and are leased duringtime t. Anthony et al. [1] gave an optimal O(log n)-approximation forthe problem in the offline setting, unless P = NP [22]. In this paper, wegive randomized algorithms for variants of Set Cover Leasing in the onlinesetting, including a generalization of Online Set Cover with Repetitionspresented by Alon et al. [2], where elements appear multiple times andmust be covered by a different set at each arrival. Our results improve theO(log2(mn)) competitive factor of Online Set Cover with Repetitions [2]to O(log d log(dn)) = O(logmlog(mn)), where d is the maximum numberof sets an element belongs to.}}, author = {{Abshoff, Sebastian and Markarian, Christine and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}}, pages = {{25--34}}, title = {{{Randomized Online Algorithms for Set Cover Leasing Problems}}}, doi = {{10.1007/978-3-319-12691-3_3}}, year = {{2014}}, } @inproceedings{380, abstract = {{Network creation games model the creation and usage costs of networks formed by n selfish nodes. Each node v can buy a set of edges, each for a fixed price α > 0. Its goal is to minimize its private costs, i.e., the sum (SUM-game, Fabrikant et al., PODC 2003) or maximum (MAX-game, Demaine et al., PODC 2007) of distances from v to all other nodes plus the prices of the bought edges. The above papers show the existence of Nash equilibria as well as upper and lower bounds for the prices of anarchy and stability. In several subsequent papers, these bounds were improved for a wide range of prices α. In this paper, we extend these models by incorporating quality-of-service aspects: Each edge cannot only be bought at a fixed quality (edge length one) for a fixed price α. Instead, we assume that quality levels (i.e., edge lengths) are varying in a fixed interval [βˇ,β^] , 0 series = {LNCS}}}, author = {{Cord-Landwehr, Andreas and Mäcker, Alexander and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}}, pages = {{423--428}}, title = {{{Quality of Service in Network Creation Games}}}, doi = {{10.1007/978-3-319-13129-0_34}}, year = {{2014}}, } @inproceedings{3805, author = {{Brüseke, Frank and Wachsmuth, Henning and Engels, Gregor and Becker, Steffen}}, booktitle = {{Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment}}, number = {{12}}, pages = {{1975--2004}}, title = {{{PBlaman: performance blame analysis based on Palladio contracts}}}, year = {{2014}}, } @inproceedings{382, abstract = {{This paper explores how cloud provider competition influences instance pricing in an IaaS (Infrastructure-as-a-Service) market. When reserved instance pricing includes an on-demand price component in addition to a reservation fee (two-part tariffs), different providers might offer different price combinations, where the client’s choice depends on its load profile. We investigate a duopoly of providers and analyze stable market prices in two-part tariffs. Further, we study offers that allow a specified amount of included usage (three-part tariffs). Neither two-part nor three-part tariffs produce an equilibrium market outcome other than a service pricing that equals production cost, i.e., complex price structures do not significantly affect the results from ordinary Bertrand competition.}}, author = {{Künsemöller, Jörn and Brangewitz, Sonja and Karl, Holger and Haake, Claus-Jochen}}, booktitle = {{Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)}}, pages = {{203--210}}, title = {{{Provider Competition in Infrastructure-as-a-Service}}}, doi = {{10.1109/SCC.2014.35}}, year = {{2014}}, } @inproceedings{383, abstract = {{Proof-carrying code approaches aim at safe execution of untrusted code by having the code producer attach a safety proof to the code which the code consumer only has to validate. Depending on the type of safety property, proofs can however become quite large and their validation - though faster than their construction - still time consuming. In this paper we introduce a new concept for safe execution of untrusted code. It keeps the idea of putting the time consuming part of proving on the side of the code producer, however, attaches no proofs to code anymore but instead uses the proof to transform the program into an equivalent but more efficiently verifiable program. Code consumers thus still do proving themselves, however, on a computationally inexpensive level only. Experimental results show that the proof effort can be reduced by several orders of magnitude, both with respect to time and space.}}, author = {{Wonisch, Daniel and Schremmer, Alexander and Wehrheim, Heike}}, booktitle = {{Proceedings of the Software Engineering Conference (SE)}}, pages = {{67--68}}, title = {{{Programs from Proofs -- Approach and Applications}}}, year = {{2014}}, } @article{387, abstract = {{This article studies the design of medium access control (MAC) protocols for wireless networks that are provably robust against arbitrary and unpredictable disruptions (e.g., due to unintentional external interference from co-existing networks or due to jamming). We consider a wireless network consisting of a set of n honest and reliable nodes within transmission (and interference) range of each other, and we model the external disruptions with a powerful adaptive adversary. This adversary may know the protocol and its entire history and can use this knowledge to jam the wireless channel at will at any time. It is allowed to jam a (1 − )-fraction of the timesteps, for an arbitrary constant > 0 unknown to the nodes. The nodes cannot distinguish between the adversarial jamming or a collision of two or more messages that are sent at the same time. We demonstrate, for the first time, that there is a local-control MAC protocol requiring only very limited knowledge about the adversary and the network that achieves a constant (asymptotically optimal) throughput for the nonjammed time periods under any of the aforementioned adversarial strategies. The derived principles are also useful to build robust applications on top of the MAC layer, and we present an exemplary study for leader election, one of the most fundamental tasks in distributed computing.}}, author = {{Awerbuch, Baruch and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}}, journal = {{Transactions on Algorithms}}, number = {{4}}, publisher = {{ACM}}, title = {{{Principles of Robust Medium Access and an Application to Leader Election}}}, doi = {{10.1145/2635818}}, year = {{2014}}, } @inproceedings{3877, author = {{Wachsmuth, Henning and Trenkmann, Martin and Stein, Benno and Engels, Gregor}}, booktitle = {{Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers}}, pages = {{553--564}}, title = {{{Modeling Review Argumentation for Robust Sentiment Analysis}}}, year = {{2014}}, } @article{3890, abstract = {{The incidenceofthin-film-guided, in-planeunguidedwavesatobliqueanglesonstraightdiscontinuities of dielectricslabwaveguides,anearlyproblemofintegratedoptics,isbeingre-considered.The3-D frequencydomainMaxwellequationsreducetoaparametrizedinhomogeneousvectorialproblemona 2-D computationaldomain,withtransparent-influx boundaryconditions.Weproposearigorousvec- torial solverbasedonsimultaneousexpansionsintopolarizedlocalslabeigenmodesalongthetwo orthogonal crosssectioncoordinates(quadridirectionaleigenmodepropagationQUEP).Thequasi-ana- lytical schemeisapplicabletoconfigurations with — in principle — arbitrary crosssectiongeometries. Examples forahigh-contrastfacetofanasymmetricslabwaveguide,forthelateralexcitationofa channel waveguide,andforastepdiscontinuitybetweenslabwaveguidesofdifferentthicknessesare discussed.}}, author = {{Hammer, Manfred}}, issn = {{0030-4018}}, journal = {{Optics Communications}}, keywords = {{tet_topic_waveguide, tet_topic_numerics}}, pages = {{447--456}}, publisher = {{Elsevier BV}}, title = {{{Oblique incidence of semi-guided waves on rectangular slab waveguide discontinuities: A vectorial QUEP solver}}}, doi = {{10.1016/j.optcom.2014.09.087}}, volume = {{338}}, year = {{2014}}, } @article{390, abstract = {{In software markets of the future, customer-specific software will be developed on demand based on distributed software and hardware services. Based on a customer-specific request, available service offers have to be discovered and composed into sophisticated IT services that fulfill the customer's request.A prerequisite of this vision are rich service descriptions, which comprise structural as well as behavioral aspects of the services, otherwise an accurate service discovery and composition is not possible. However, automatic matching of service requests and offers specified in rich service descriptions for the purpose of service discovery is a complex task, due to the multifaceted heterogeneity of the service partners. This heterogeneity includes the use of different specification languages, different underlying ontologies, or different levels of granularity in the specification itself.In this article, we present a comprehensive approach for service discovery and composition, which overcomes the underlying heterogeneity of the service partners. Based on a realistic case study of our industrial partner from the e-tourism domain, we first introduce an automatic matching mechanism for service requests and offers specified in a rich service description language. In addition, we propose an automatic service composition approach, which determines possible service compositions by composing the service protocols through a composition strategy based on labeled transition systems. }}, author = {{Huma, Zille and Gerth, Christian and Engels, Gregor}}, journal = {{Computer Science - Research and Development}}, number = {{3-4}}, pages = {{333--361}}, publisher = {{Springer}}, title = {{{On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous Domains}}}, doi = {{10.1007/s00450-014-0254-z}}, year = {{2014}}, } @article{3905, author = {{Abu Quba Rana, Chamsi and Hassas, Salima and Usama, Fayyad and Alshomary, Milad and Gertosio, Christine}}, journal = {{2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)}}, pages = {{169--175}}, title = {{{iSoNTRE: The Social Network Transformer into Recommendation Engine}}}, year = {{2014}}, } @misc{2900, author = {{Brauer, Sascha}}, title = {{{A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures}}}, year = {{2014}}, } @article{2976, author = {{Ackermann, Marcel Rudolf and Blömer, Johannes and Kuntze, Daniel and Sohler, Christian}}, issn = {{0178-4617}}, journal = {{Algorithmica}}, publisher = {{Springer US}}, title = {{{Analysis of Agglomerative Clustering}}}, doi = {{10.1007/s00453-012-9717-4}}, volume = {{69}}, year = {{2014}}, } @inproceedings{2977, author = {{Blömer, Johannes and Bujna, Kathrin and Kuntze, Daniel}}, booktitle = {{2014 22nd International Conference on Pattern Recognition}}, isbn = {{9781479952090}}, publisher = {{IEEE}}, title = {{{A Theoretical and Experimental Comparison of the EM and SEM Algorithm}}}, doi = {{10.1109/icpr.2014.253}}, year = {{2014}}, } @article{3127, author = {{Jager, Tibor}}, journal = {{Datenschutz und Datensicherheit}}, number = {{7}}, pages = {{445----451}}, title = {{{Die Zukunft der Kryptographie}}}, doi = {{10.1007/s11623-014-0204-8}}, year = {{2014}}, } @inproceedings{3128, author = {{Fleischhacker, Nils and Jager, Tibor and Schröder, Dominique}}, booktitle = {{Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, R.O.C., December 7-11, 2014. Proceedings, Part I}}, pages = {{512----531}}, title = {{{On Tight Security Proofs for Schnorr Signatures}}}, doi = {{10.1007/978-3-662-45611-8_27}}, year = {{2014}}, } @article{3167, author = {{Schneider, Steve and Treharne, Helen and Wehrheim, Heike}}, journal = {{Formal Asp. Comput.}}, number = {{2}}, pages = {{251----280}}, title = {{{The behavioural semantics of Event-B refinement}}}, doi = {{10.1007/s00165-012-0265-0}}, year = {{2014}}, } @article{3168, author = {{Tofan, Bogdan and Travkin, Oleg and Schellhorn, Gerhard and Wehrheim, Heike}}, journal = {{Sci. Comput. Program.}}, pages = {{297----314}}, title = {{{Two approaches for proving linearizability of multiset}}}, doi = {{10.1016/j.scico.2014.04.001}}, year = {{2014}}, } @article{3169, author = {{Schellhorn, Gerhard and Derrick, John and Wehrheim, Heike}}, journal = {{{ACM} Trans. Comput. Log.}}, number = {{4}}, pages = {{31:1----31:37}}, title = {{{A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures}}}, doi = {{10.1145/2629496}}, year = {{2014}}, } @inproceedings{3170, author = {{Derrick, John and Dongol, Brijesh and Schellhorn, Gerhard and Tofan, Bogdan and Travkin, Oleg and Wehrheim, Heike}}, booktitle = {{{FM} 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings}}, editor = {{B. Jones, Cliff and Pihlajasaari, Pekka and Sun, Jun}}, pages = {{200----214}}, title = {{{Quiescent Consistency: Defining and Verifying Relaxed Linearizability}}}, doi = {{10.1007/978-3-319-06410-9_15}}, year = {{2014}}, } @inproceedings{3171, author = {{Travkin, Oleg and Wehrheim, Heike}}, booktitle = {{Hardware and Software: Verification and Testing - 10th International Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014. Proceedings}}, editor = {{Yahav, Eran}}, pages = {{132----147}}, title = {{{Handling {TSO} in Mechanized Linearizability Proofs}}}, doi = {{10.1007/978-3-319-13338-6_11}}, year = {{2014}}, }