TY - GEN AU - Jayesh Parekh, Chintan ID - 510 TI - Meta-data based Search in Structured Peer-to-Peer Networks ER - TY - JOUR AB - This study integrates the government in the context of company valuation. Our framework allows to analyze and to quantify the risk-sharing effects and conflicts of interest between the government and the shareholders when firms follow different financial policies. We provide novel evidence that firms with fixed future levels of debt might invest more than socially desirable. Economically, this happens if the gain in tax-shields is big enough to outweigh the loss in the unlevered firm value. Our findings have implications for the practice of investment subsidy programs provided by the government to avoid fostering investments beyond the socially optimal level. AU - Kreutzmann, Daniel AU - Sievers, Sönke AU - Mueller, Christian ID - 5108 IS - 11 JF - Applied Financial Economics (VHB-JOURQUAL 3 Ranking C) KW - corporate tax claim KW - company valuation KW - optimal investment KW - cost of capital TI - Investment distortions and the value of the government's tax claim VL - 23 ER - TY - GEN AU - Splietker, Malte ID - 511 TI - MapReduce in Software Defined Networks ER - TY - JOUR AU - Gilroy, Bernard Michael AU - Schreckenberg, Heike AU - Seiler, Volker ID - 5111 IS - 2 JF - Federal Governance TI - Subsidiarity between economic freedom and harmonized regulation: is there an optimal degree of European integration? VL - 10 ER - TY - JOUR AU - Gilroy, Bernard Michael AU - Lukas, Elmar AU - Heimann, Christian ID - 5112 JF - Jahrbücher für Nationalokonomie 6 Statistik TI - Technologiestandort Deutschland und internationale Wissensspillover. VL - 233 ER - TY - JOUR AB - Standard equity valuation approaches (i.e., DDM, RIM, and DCF model) are derived under the assumption of ideal conditions, such as infinite payoffs and clean surplus accounting. Because these conditions are hardly ever met, we extend the standard approaches, based on the fundamental principle of financial statement articulation. The extended models are then tested empirically by employing two sets of forecasts: (1) analyst forecasts provided by Value Line and (2) forecasts generated by cross-sectional regression models. The main result is that our extended models yield considerably smaller valuation errors. Moreover, by construction, identical value estimates are obtained across the extended models. By reestablishing empirical equivalence under non-ideal conditions, our approach provides a benchmark that enables us to quantify the errors resulting from individual deviations from ideal conditions, and thus, to analyze the robustness of the standard approaches. Finally, by providing a level playing field for the different valuation approaches, our findings have implications for other empirical settings, for example, estimating the implied cost of capital. AU - Heinrichs, Nicolas AU - Hess, Dieter AU - Homburg, Carsten AU - Lorenz, Michael AU - Sievers, Sönke ID - 5113 IS - 1 JF - Contemporary Accounting Research (VHB-JOURQUAL 3 Ranking A) KW - Dividend Discount Model KW - Residual Income KW - Discounted Cash Flow KW - Dirty Surplus KW - Terminal Value KW - Valuation Error TI - Extended dividend, cash flow, and residual income valuation models: Accounting for deviations from ideal conditions VL - 30 ER - TY - JOUR AU - Gilroy, Bernard Michael AU - Heimann, Anastasia AU - Schopf, Mark ID - 5114 IS - 1 JF - Basic Income Studies TI - Basic income and labour supply: The German case VL - 8 ER - TY - JOUR AU - Gilroy, Bernard Michael AU - Nguyen, Birke Thuy Duong ID - 5115 IS - 3 JF - WiSt-Wirtschaftswissenschaftliches Studium TI - Ist Fairer Handel Wirklich Fair? VL - 42 ER - TY - GEN AU - Gilroy, Bernard Michael AU - Schreckenberg, Heike AU - Seiler, Volker ID - 5117 TI - Water as an alternative asset ER - TY - GEN AU - Herzog, Elvira ID - 512 TI - Lösungsverfahren für das many-to-one Matching Problem ER - TY - CONF AB - This paper initiates the study of self-adjusting networks (or distributed data structures) whose topologies dynamically adapt to a communication pattern $\sigma$. We present a fully decentralized self-adjusting solution called SplayNet. A SplayNet is a distributed generalization of the classic splay tree concept. It ensures short paths (which can be found using local-greedy routing) between communication partners while minimizing topological rearrangements. We derive an upper bound for the amortized communication cost of a SplayNet based on empirical entropies of $\sigma$, and show that SplayNets have several interesting convergence properties. For instance, SplayNets features a provable online optimality under special requests scenarios. We also investigate the optimal static network and prove different lower bounds for the average communication cost based on graph cuts and on the empirical entropy of the communication pattern $\sigma$. From these lower bounds it follows, e.g., that SplayNets are optimal in scenarios where the requests follow a product distribution as well. Finally, this paper shows that in contrast to the Minimum Linear Arrangement problem which is generally NP-hard, the optimal static tree network can be computed in polynomial time for any guest graph, despite the exponentially large graph family. We complement our formal analysis with a small simulation study on a Facebook graph. AU - Avin, Chen AU - Häupler, Bernhard AU - Lotker, Zvi AU - Scheideler, Christian AU - Schmid, Stefan ID - 513 T2 - Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS) TI - Locally Self-Adjusting Tree Networks ER - TY - THES AB - Diese Arbeit besch{\"a}ftigt sich mit dem Facility Location Problem. Dies ist ein Optimierungsproblem, bei dem festgelegt werden muss an welchen Positionen Ressourcen zur Verf{\"u}gung gestellt werden, so dass diese von Nutzern gut erreicht werden k{\"o}nnen. Es sollen dabei Kosten minimiert werden, die zum einen durch Bereitstellung von Ressourcen und zum anderen durch Verbindungskosten zwischen Nutzern und Ressourcen entstehen. Die Schwierigkeit des Problems liegt darin, dass man einerseits m{\"o}glichst wenige Ressourcen zur Verf{\"u}gung stellen m{\"o}chte, andererseits daf{\"u}r sorgen muss, dass sich Nutzer nicht all zu weit weg von Ressourcen befinden. Dies w{\"u}rde n{\"a}mlich hohe Verbindungskosten nach sich ziehen. Das Facility Location Problem wurde bereits sehr intensiv in vielen unterschiedlichen Varianten untersucht. In dieser Arbeit werden drei Varianten des Problems modelliert und neue Algorithmen f{\"u}r sie entwickelt und bez{\"u}glich ihres Approximationsfaktors und ihrer Laufzeit analysiert. Jede dieser drei untersuchten Varianten hat einen besonderen Schwerpunkt. Bei der ersten Varianten handelt es sich um ein Online Problem, da hier die Eingabe nicht von Anfang an bekannt ist, sondern Schritt f{\"u}r Schritt enth{\"u}llt wird. Die Schwierigkeit hierbei besteht darin unwiderrufliche Entscheidungen treffen zu m{\"u}ssen ohne dabei die Zukunft zu kennen und trotzdem eine zu jeder Zeit gute L{\"o}sung angeben zu k{\"o}nnen. Der Schwerpunkt der zweiten Variante liegt auf Lokalit{\"a}t, die z.B. in Sensornetzwerken von großer Bedeutung ist. Hier soll eine L{\"o}sung verteilt und nur mit Hilfe von lokalen Information berechnet werden. Schließlich besch{\"a}ftigt sich die dritte Variante mit einer verteilten Berechnung, bei welcher nur eine stark beschr{\"a}nkte Datenmenge verschickt werden darf und dabei trotzdem ein sehr guter Approximationsfaktor erreicht werden muss. Die bei der Analyse der Approximationsfaktoren bzw. der Kompetitivit{\"a}t verwendeten Techniken basieren zum großen Teil auf Absch{\"a}tzung der primalen L{\"o}sung mit Hilfe einer L{\"o}sung des zugeh{\"o}rigen dualen Problems. F{\"u}r die Modellierung von Lokalit{\"a}t wird das weitverbreitete LOCAL Modell verwendet. In diesem Modell werden f{\"u}r die Algorithmen subpolynomielle obere Laufzeitschranken gezeigt. AU - Pietrzyk, Peter ID - 514 TI - Local and Online Algorithms for Facility Location ER - TY - JOUR AU - Seiler, Volker AU - Rudolf, Markus AU - Krume, Tim ID - 5144 IS - 4 JF - International Journal of Bank Marketing TI - The influence of socio-demographic variables on customer satisfaction and loyalty in the private banking industry VL - 31 ER - TY - GEN AB - In this paper, we analyze a model in which two divisions negotiate over an intrafirm transfer price for an intermediate product. Formally, we consider bargaining problems under incomplete information, since the upstream division’s (seller's) costs and downstream division's (buyer's) revenues are supposed to be private information. Assuming two possible types for buyer and seller each, we first establish that the bargaining problem is regular, regardless whether incentive and/or efficiency constraints are imposed. This allows us to apply the generalized Nash bargaining solution to determine transfer payments and transfer probabilities. Furthermore, we derive general properties of this solution for the transfer pricing problem and compare the model developed here with the existing literature for negotiated transfer pricing under incomplete information. In particular, we focus on the models presented in Wagenhofer (1994). AU - Brangewitz, Sonja AU - Haake, Claus-Jochen ID - 5146 KW - Transfer Pricing KW - Negotiation KW - Generalized Nash Bargaining Solution KW - Incomplete Information TI - Cooperative Transfer Price Negotiations under Incomplete Information VL - 64 ER - TY - JOUR AB - The as a service paradigm reflects the fundamental idea of providing basic coherent functionality in terms of components that can be utilised on demand. These so-called services may also be interconnected in order to provide more complex functionality. Automation of this service composition process is indeed a formidable challenge. In our work, we are addressing this challenge by decomposing service composition into sequential decision making steps. Each step is supported by a recommendation mechanism. If composition requests recur over time and if evaluations of composition results are fed back, a proper recommendation strategy can evolve over time through learning from experience. In this paper, we describe our approach of modelling this service composition and recommendation process as Markov decision process and of solving it by means of reinforcement learning. A case study serves as proof of concept. AU - Jungmann, Alexander AU - Kleinjohann, Bernd AU - Kleinjohann, Elisabeth ID - 515 IS - 4 JF - International Journal of Business Process Integration and Management TI - Learning Service Recommendations ER - TY - CONF AB - The as a Service paradigm reflects the fundamental idea of providing basic coherent functionality in terms of components that can be utilized on demand. These so-called services may also be interconnected in order to provide more complex functionality. Automation of this service composition process is indeed a formidable challenge. In our work, we are addressing this challenge by decomposing service composition into sequential decision making steps. Each step is supported by a recommendation mechanism. If composition requests recur over time and if evaluations of composition results are fed back, a proper recommendation strategy can evolve over time through learning from experience. In this paper, we describe our general idea of modeling this service composition and recommendation process as Markov Decision Process and of solving it by means of Reinforcement Learning. A case study serves as proof of concept. AU - Jungmann, Alexander AU - Kleinjohann, Bernd ID - 516 T2 - Proceedings of the 10th IEEE International Conference on Services Computing (SCC) TI - Learning Recommendation System for Automated Service Composition ER - TY - CONF AB - In the Semantic (Web) Services area, services are considered black boxes with a semantic description of their interfaces as to allow for precise service selection and configuration. The semantic description is usually grounded on domain-specific concepts as modeled in ontologies. This accounts for types used in service signatures, but also predicates occurring in preconditions and effects of services. Ontologies, in particular those enhanced with rules, capture the knowledge of domain experts on properties of and relations between domain concepts. In this paper, we present a verification technique for service compositions which makes use of this domain knowledge. We consider a service composition to be an assembly of services of which we just know signatures, preconditions, and effects. We aim at proving that a composition satisfies a (user-defined) requirement, specified in terms of guaranteed preconditions and required postconditions. As an underlying verification engine we use an SMT solver. To take advantage of the domain knowledge (and often, to enable verification at all), the knowledge is fed into the solver in the form of sorts, uninterpreted functions and in particular assertions as to enhance the solver’s reasoning capabilities. Thereby, we allow for deductions within a domain previously unknown to the solver. We exemplify our technique on a case study from the area of water network optimization software. AU - Walther, Sven AU - Wehrheim, Heike ID - 517 T2 - Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS) TI - Knowledge-Based Verification of Service Compositions - An SMT approach ER - TY - BOOK AU - Sievers, Sönke ID - 5172 KW - Unternehmensbewertung KW - Unternehmenswachstum KW - Return on Investment Unternehmensbewertung KW - Investition KW - Steuervergünstigung SN - 978-3-86582-925-2 TI - Company Valuation and Growth: Theory, Empirical Evidence and Practical Implementation Issues ER - TY - GEN AU - Petrausch, Vanessa ID - 518 TI - Klassifizierung unterschiedlicher Ansätze zum Matching von Services ER - TY - CONF AB - In this work we present the first scalable distributed information system,i.e., a system with low storage overhead, that is provably robust againstDenial-of-Service (DoS) attacks by a current insider. We allow acurrent insider to have complete knowledge about the information systemand to have the power to block any \epsilon-fraction of its serversby a DoS-attack, where \epsilon can be chosen up to a constant. The taskof the system is to serve any collection of lookup requests with at most oneper non-blocked server in an efficient way despite this attack. Previously,scalable solutions were only known for DoS-attacks of past insiders, where apast insider only has complete knowledge about some past time pointt_0 of the information system. Scheideler et al. (DISC 2007, SPAA 2009) showedthat in this case it is possible to design an information system so that anyinformation that was inserted or last updated after t_0 is safe against a DoS-attack. But their constructions would not work at all for a current insider. The key idea behindour IRIS system is to make extensive use of coding. More precisely, we presenttwo alternative distributed coding strategies with an at most logarithmicstorage overhead that can handle up to a constant fraction of blocked servers. AU - Eikel, Martina AU - Scheideler, Christian ID - 519 T2 - Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) TI - IRIS: A Robust Information System Against Insider DoS-Attacks ER - TY - JOUR AB - This study examines the relevance of financial and non-financial information for the valuation of venture capital (VC) investments. Based on a hand-collected data set on venture-backed start-ups in Germany, we investigate the internal due diligence documents of over 200 investment rounds. We document that balance sheet and income statement items capture as much economic content as verifiable non-financial information (e.g. team experience or the number of patents) while controlling for several deal characteristics (e.g. industry, investment round, or yearly VC fund inflows). In addition, we show that valuations based on accounting and non-accounting information yield a level of valuation accuracy that is comparable to that of publicly traded firms. Further analyses show that the industry-specific total asset multiples outperform the popular revenue multiples but lead to significantly less accurate results than those obtained from the more comprehensive valuation models. Overall, our findings might inform researchers and standard-setters of the usefulness of accounting information for investment companies and provide additional evidence to gauge the overall valuation accuracy in VC settings. AU - Sievers, Sönke AU - Mokwa, Christopher F AU - Keienburg, Georg ID - 5191 IS - 3 JF - European Accounting Review (VHB-JOURQUAL 3 Ranking A) KW - value relevance KW - equity valuation KW - venture capital KW - human capital KW - start-ups TI - The relevance of financial versus non-financial information for the valuation of venture capital-backed firms VL - 22 ER - TY - JOUR AB - For the valuation of fast growing innovative firms Schwartz and Moon (Financ Anal J 56:62–75, 2000), (Financ Rev 36:7–26, 2001) develop a fundamental valuation model where key parameters follow stochastic processes. While prior research shows promising potential for this model, it has never been tested on a large scale dataset. Thus, guided by economic theory, this paper is the first to design a large-scale applicable implementation on around 30,000 technology firm quarter observations from 1992 to 2009 for the US to assess this model. Evaluating the feasibility and performance of the Schwartz-Moon model reveals that it is comparably accurate to the traditional sales multiple with key advantages in valuing small and non-listed firms. Most importantly, however, the model is able to indicate severe market over- or undervaluation from a fundamental perspective. We demonstrate that a trading strategy based on our implementation has significant investment value. Consequently, the model seems suitable for detecting misvaluations as the dot-com bubble. AU - Klobucnik, Jan AU - Sievers, Sönke ID - 5192 IS - 9 JF - Journal of Business Economics (VHB-JOURQUAL 3 Ranking B) KW - Schwartz-Moon model KW - Market mispricing KW - Empirical test KW - Company valuation KW - Trading strategy TI - Valuing high technology growth firms VL - 83 ER - TY - CONF AB - 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. AU - Wette, Philip AU - Karl, Holger ID - 520 T2 - Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM) TI - Incorporating feedback from application layer into routing and wavelength assignment algorithms ER - TY - GEN AU - Sievers, Sönke AU - Schlüter, Tobias AU - Hartmann-Wendels, Thomas ID - 5201 T2 - Börsen-Zeitung TI - Die erfolgreiche Bindung des Sparers an die Bank ER - TY - GEN AU - Sievers, Sönke AU - Hartmann-Wendels, Thomas AU - Busch, Ramona AU - Schlüter, Tobias ID - 5202 T2 - Börsen-Zeitung TI - Wie Banken Kostenvorteile weitergeben VL - 6 ER - TY - GEN AU - Riebler, Heinrich ID - 521 KW - coldboot TI - Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs ER - TY - GEN AU - Feldotto, Matthias ID - 522 TI - HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths ER - TY - JOUR AB - In a distributed system with attacks and defenses, both attackers and defenders are self-interested entities. We assume a reward-sharing scheme among interdependent defenders; each defender wishes to (locally) maximize her own total fair share to the attackers extinguished due to her involvement (and possibly due to those of others). What is the maximum amount of protection achievable by a number of such defenders against a number of attackers while the system is in a Nash equilibrium? As a measure of system protection, we adopt the Defense-Ratio (Mavronicolas et al., 2008)[20], which provides the expected (inverse) proportion of attackers caught by the defenders. In a Defense-Optimal Nash equilibrium, the Defense-Ratio matches a simple lower bound.We discover that the existence of Defense-Optimal Nash equilibria depends in a subtle way on how the number of defenders compares to two natural graph-theoretic thresholds we identify. In this vein, we obtain, through a combinatorial analysis of Nash equilibria, a collection of trade-off results:• When the number of defenders is either sufficiently small or sufficiently large, Defense-Optimal Nash equilibria may exist. The corresponding decision problem is computationally tractable for a large number of defenders; the problem becomes NPNP-complete for a small number of defenders and the intractability is inherited from a previously unconsidered combinatorial problem in Fractional Graph Theory.• Perhaps paradoxically, there is a middle range of values for the number of defenders where Defense-Optimal Nash equilibria do not exist. AU - Mavronicolas, Marios AU - Monien, Burkhard AU - Papadopoulou Lesta, Vicky ID - 523 IS - 16-17 JF - Discrete Applied Mathematics TI - How many attackers can selfish defenders catch? VL - 161 ER - TY - GEN AB - We study the complexity theory for the local distributed setting introduced by Korman, Peleg and Fraigniaud. They have defined three complexity classes LD (Local Decision), NLD (Nondeterministic Local Decision) and NLD^#n. The class LD consists of all languages which can be decided with a constant number of communication rounds. The class NLD consists of all languages which can be verified by a nondeterministic algorithm with a constant number of communication rounds. In order to define the nondeterministic classes, they have transferred the notation of nondeterminism into the distributed setting by the use of certificates and verifiers. The class NLD^#n consists of all languages which can be verified by a nondeterministic algorithm where each node has access to an oracle for the number of nodes. They have shown the hierarchy LD subset NLD subset NLD^#n. Our main contributions are strict hierarchies within the classes defined by Korman, Peleg and Fraigniaud. We define additional complexity classes: the class LD(t) consists of all languages which can be decided with at most t communication rounds. The class NLD-O(f) consists of all languages which can be verified by a local verifier such that the size of the certificates that are needed to verify the language are bounded by a function from O(f). Our main results are refined strict hierarchies within these nondeterministic classes. AU - Meyer auf der Heide, Friedhelm AU - Swirkot, Kamil ID - 524 TI - Hierarchies in Local Distributed Decision ER - TY - GEN AU - Niklas Vinkemeier, Tim ID - 525 TI - Haptics - Hadoop performance testing in concurrent job scenarios ER - TY - GEN AU - Mäcker, Alexander ID - 526 TI - Greedy Network Creation With Heavy And Light Edges ER - TY - CONF AB - In the future vision of software engineering, services from world-wide markets are composed automated in order to build custom-made systems.Supporting such scenarios requires an adequate service matching approach.Many existing approaches do not fulfill two key requirements of emerging concepts like On-The-Fly-Computing, namely (1) comprehensiveness, i.e., the consideration of different service aspects that cover not only functional properties, but also non-functional properties and (2) fuzzy matching, i.e., the ability to deliver gradual results in order to cope with a certain extent of uncertainty, incompleteness, and tolerance ranges.In this paper, I present a fuzzy matching process that distinguishes between different fuzziness sources and leverages fuzziness in different matching steps which consider different service aspects, e.g., behavior and quality properties. AU - Christin Platenius, Marie ID - 527 T2 - Proceedings of the Doctoral Symposium of the 9th joint meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE) TI - Fuzzy Service Matching in On-The-Fly Computing ER - TY - CONF AB - Mechatronic systems reconfigure the structure of their software architecture, e.g., to avoid hazardous situations or to optimize operational conditions like minimizing their energy consumption. As software architectures are typically build on components, reconfiguration actions need to respect the component structure. This structure should be hierarchical to enable encapsulated components. While many reconfiguration approaches for embedded real-time systems allow the use of hierarchically embedded components, i.e., horizontal composition, none of them offers a modeling and verification solution to take hierarchical composition, i.e., encapsulation, into account. In this paper, we present an extension to our existing modeling language, MechatronicUML, to enable safe hierarchical reconfigurations. The two main extensions are (a) an adapted variant of the two-phase commit protocol to initiate reconfigurations which maintain component encapsulation and (b) a timed model checking verification approach for instances of our model. We illustrate our approach on a case study in the area of smart railway systems by showing two different use cases of our approach and the verification of their safety properties. AU - Heinzemann, Christian AU - Becker, Steffen ID - 529 T2 - Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE) TI - Executing Reconfigurations in Hierarchical Component Architectures ER - TY - GEN AU - Buse, Dominik ID - 530 TI - Entwurf kooperativer Verhaltensweisen heterogener Roboter ER - TY - GEN AU - Lutters, Sascha ID - 531 TI - Entwurf eines datenschutzgerechten Reputationssystems ER - TY - GEN AU - Hilleckes, Hendrik ID - 532 TI - Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme ER - TY - GEN AU - Borkowski, Richard ID - 533 TI - Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung ER - TY - GEN AU - Satya, Suhas ID - 534 TI - Emulating Wavelength Division Multiplexing using Openflow ER - TY - GEN AU - Reineke, Max ID - 535 TI - Effizienzsteigerung durch gewichtete Produktbewertungen ER - TY - GEN AU - Stroh-Maraun, Nadja ID - 536 TI - Dynamic One-to-One Matching: Theory and a Job Market Application ER - TY - GEN AU - Heindorf, Stefan ID - 537 TI - Dispersion of Multi-Robot Teams ER - TY - GEN AB - We present a new technique to realize attribute-based encryption (ABE) schemes secure in the standard model against chosen-ciphertext attacks (CCA-secure). Our approach is to extend certain concrete chosen-plaintext secure (CPA-secure) ABE schemes to achieve more efficient constructions than the known generic constructions of CCA-secure ABE schemes. We restrict ourselves to the construction of attribute-based key encapsulation mechanisms (KEMs) and present two concrete CCA-secure schemes: a key-policy attribute-based KEM that is based on Goyal's key-policy ABE and a ciphertext-policy attribute-based KEM that is based on Waters' ciphertext-policy ABE. To achieve our goals, we use an appropriate hash function and need to extend the public parameters and the ciphertexts of the underlying CPA-secure encryption schemes only by a single group element. Moreover, we use the same hardness assumptions as the underlying CPA-secure encryption schemes. AU - Blömer, Johannes AU - Liske, Gennadij ID - 538 TI - Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles ER - TY - GEN AU - Kornhoff, Tobias ID - 539 TI - Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen ER - TY - CONF AB - Existing solutions for gossip-based aggregation in peer-to-peer networks use epochs to calculate a global estimation from an initial static set of local values. Once the estimation converges system-wide, a new epoch is started with fresh initial values. Long epochs result in precise estimations based on old measurements and short epochs result in imprecise aggregated estimations. In contrast to this approach, we present in this paper a continuous, epoch-less approach which considers fresh local values in every round of the gossip-based aggregation. By using an approach for dynamic information aging, inaccurate values and values from left peers fade from the aggregation memory. Evaluation shows that the presented approach for continuous information aggregation in peer-to-peer systems monitors the system performance precisely, adapts to changes and is lightweight to operate. AU - Graffi, Kalman AU - Rapp, Vitaly ID - 541 T2 - Proceedings of the International Conference on Computer Communications and Networks (ICCCN'13) TI - Continuous Gossip-based Aggregation through Dynamic Information Aging ER - TY - CONF AB - We consider the problem of managing a dynamic heterogeneous storagesystem in a distributed way so that the amount of data assigned to a hostin that system is related to its capacity. Two central problems have to be solvedfor this: (1) organizing the hosts in an overlay network with low degree and diameterso that one can efficiently check the correct distribution of the data androute between any two hosts, and (2) distributing the data among the hosts so thatthe distribution respects the capacities of the hosts and can easily be adapted asthe set of hosts or their capacities change. We present distributed protocols forthese problems that are self-stabilizing and that do not need any global knowledgeabout the system such as the number of nodes or the overall capacity of thesystem. Prior to this work no solution was known satisfying these properties. AU - Kniesburges, Sebastian AU - Koutsopoulos, Andreas AU - Scheideler, Christian ID - 542 T2 - Proceedings of the 27th International Symposium on Distributed Computing (DISC) TI - CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system ER - TY - GEN AU - Jagannath, Kavitha ID - 543 TI - Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services ER - TY - CONF AB - Comparative evaluations of peer-to-peer protocols through simulations are a viable approach to judge the performance and costs of the individual protocols in large-scale networks. In order to support this work, we enhanced the peer-to-peer systems simulator PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive automated measurements and gnuplot generators as well as a coordination control to evaluate a set of experiment setups in parallel. Thus, by configuring all experiments and protocols only once and starting the simulator, all desired measurements are performed, analyzed, evaluated and combined, resulting in a holistic environment for the comparative evaluation of peer-to-peer systems. AU - Feldotto, Matthias AU - Graffi, Kalman ID - 544 T2 - Proceedings of the International Conference on High Performance Computing and Simulation (HPCS'13) TI - Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM ER - TY - GEN AU - Blumentritt, Fritz ID - 545 TI - Cliquenbildung in verteilten Systemen ER - TY - CONF AB - Self-stabilization is the property of a system to transfer itself regardless of the initial state into a legitimate state. Chord as a simple, decentralized and scalable distributed hash table is an ideal showcase to introduce self-stabilization for p2p overlays. In this paper, we present Re-Chord, a self-stabilizing version of Chord. We show, that the stabilization process is functional, but prone to strong churn. For that, we present Ca-Re-Chord, a churn resistant version of Re-Chord, that allows the creation of a useful DHT in any kind of graph regardless of the initial state. Simulation results attest the churn resistance and good performance of Ca-Re-Chord. AU - Graffi, Kalman AU - Benter, Markus AU - Divband, Mohammad AU - Kniesburges, Sebastian AU - Koutsopoulos, Andreas ID - 546 T2 - Proceedings of the Conference on Networked Systems (NetSys) TI - Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network ER - TY - JOUR AU - Baum, M AU - Schwens, C AU - Kabst, Rüdiger ID - 5464 IS - 5 JF - International Small Business Journal (ISBJ). TI - International as Opposed to Domestic New Venturing: The Moderating Role of Perceived Barriers to Internationalization. VL - 31 ER - TY - JOUR AU - Baum, M AU - Kabst, Rüdiger ID - 5465 IS - 7 JF - International Journal of Human Resource Management (IJHRM). TI - Conjoint implications on job preferences: The moderating role of involvement. VL - 24 ER - TY - THES AB - 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. AU - Gerth, Christian ID - 547 TI - Business Process Models - Change Management ER - TY - JOUR AU - Baum, M AU - Kabst, Rüdiger ID - 5478 IS - 2 JF - Journal of World Business (JWB). TI - How to attract applicants in the atlantic versus the asia-pacific region? A cross-national analysis on China, India, Germany, and Hungary. VL - 48 ER - TY - CONF AB - Peer-to-peer systems scale to millions of nodes and provide routing and storage functions with best effort quality. In order to provide a guaranteed quality of the overlay functions, even under strong dynamics in the network with regard to peer capacities, online participation and usage patterns, we propose to calibrate the peer-to-peer overlay and to autonomously learn which qualities can be reached. For that, we simulate the peer-to-peer overlay systematically under a wide range of parameter configurations and use neural networks to learn the effects of the configurations on the quality metrics. Thus, by choosing a specific quality setting by the overlay operator, the network can tune itself to the learned parameter configurations that lead to the desired quality. Evaluation shows that the presented self-calibration succeeds in learning the configuration-quality interdependencies and that peer-to-peer systems can learn and adapt their behavior according to desired quality goals. AU - Graffi, Kalman AU - Klerx, Timo ID - 548 T2 - Proceedings of the International Conference on Peer-to-Peer Computing (P2P'13) TI - Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks ER - TY - JOUR AU - Haus, I AU - Steinmetz, Holger AU - Isidor, R AU - Kabst, Rüdiger ID - 5484 IS - 2 JF - International Journal of Gender and Entrepreneurship (IJGE) TI - Gender Effects on Entrepreneurial Intention: A Meta-Analytical Structural Equation Model. VL - 5 ER - TY - JOUR AU - Steinmetz, Holger ID - 5489 IS - 1 JF - European Journal of Research Methods for the Behavioral and Social Sciences. TI - Analyzing observed composite differences across groups: Is partial measurement invariance enough? VL - 9 ER - TY - GEN AU - Bick, Christian ID - 549 TI - Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner ER - TY - GEN AU - Meschede, Julian ID - 550 TI - Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen ER - TY - CONF AB - In the service-oriented computing domain, the number of available software services steadily increased in recent years, favored by the rise of cloud computing with its attached delivery models like Software-as-a-Service (SaaS). To fully leverage the opportunities provided by these services for developing highly flexible and aligned SOA, integration of new services as well as the substitution of existing services must be simplified. As a consequence, approaches for automated and accurate service discovery and composition are needed. In this paper, we propose an automatic service composition approach as an extension to our earlier work on automatic service discovery. To ensure accurate results, it matches service requests and available offers based on their structural as well as behavioral aspects. Afterwards, possible service compositions are determined by composing service protocols through a composition strategy based on labeled transition systems. AU - Huma, Zille AU - Gerth, Christian AU - Engels, Gregor AU - Juwig, Oliver ID - 551 T2 - Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC'13) TI - Automated Service Composition for On-the-Fly SOAs ER - TY - GEN AU - Meckenstock, Kevin ID - 552 TI - Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse ER - TY - GEN AU - Kohn, Kathlén ID - 553 TI - Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise ER - TY - JOUR AB - We establish a link between cooperative and competitive behavior. For every possible vector of weights of an asymmetric Nash bargaining solution there exists a market that has this asymmetric Nash bargaining solution as its unique competitive payoff vector. AU - Brangewitz, Sonja AU - Gamp, Jan-Philip ID - 554 IS - 2 JF - Economics Letters TI - Asymmetric Nash bargaining solutions and competitive payoffs ER - TY - GEN AU - Setzer, Alexander ID - 555 TI - Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs ER - TY - GEN AU - Nickel, Tobias ID - 556 TI - Analyse von Benutzeranforderungen von Service-Kompositionen mittels Modelchecking ER - TY - GEN AB - Since the last two decades, the water consumption in Germany is decreasing, which causes the water tanks and pipes in a water supply system to work inefficiently. This paper proposes an approach for a decision support system, which helps to decide how to plan new water tanks and resize existing tanks in water supply systems. The approach uses a combination of network reduction, mathematical optimization and hydraulic simulation. The mathematical optimization model is a nonconvex Mixed Integer Quadratically Constrained Program (MIQCP), which is solved by a piecewise linearization. As this may lead to many binary variables and therefore high computational times, the size of the water supply system model is reduced before building the optimization model. By applying several network reduction techniques there may occur some hydraulic differences between the original network model and the reduced network model. To make sure that the solution obtained in the optimization process is feasible in the original water supply system, the solution is verified by a hydraulic simulation tool. AU - Hallmann, Corinna ID - 557 TI - An Approach for a Decision Support Systems to optimize Water Tanks in Water Supply Systems by combining Network Reduction, Optimization and Simulation ER - TY - JOUR AU - Wex, Felix AU - Schryen, Guido AU - Neumann, Dirk ID - 5575 IS - 4 JF - International Journal of Information Systems for Crisis Response and Management TI - Assignments of Collaborative Rescue Units during Emergency Response VL - 5 ER - TY - CONF AU - Wex, Felix AU - Schryen, Guido AU - Neumann, Dirk ID - 5576 T2 - Proceedings of the 46th Hawaii International Conference on System Science TI - Decision Modeling for Assignments of Collaborative Rescue Units during Emergency Response ER - TY - GEN ED - Flocchini, Paola ED - Gao, Jie ED - Kranakis, Evangelos ED - Meyer auf der Heide, Friedhelm ID - 558 TI - Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics VL - 8243 ER - TY - CONF AB - Distributed hash tables are very versatile to use, as distributed storage is a desirable feature for various applications. Typical structured overlays like Chord, Pastry or Kademlia consider only homogeneous nodes with equal capacities, which does not resemble reality. In a practical use case, nodes might get overloaded by storing popular data. In this paper, we present a general approach to enable capacity awareness and load-balancing capability of homogeneous structured overlays. We introduce a hierarchical second structured overlay aside, which allows efficient capacity-based access on the nodes in the system as hosting mirrors. Simulation results show that the structured overlay is able to store various contents, such as of a social network, with only a negligible number of overloaded peers. Content, even if very popular, is hosted by easily findable capable peers. Thus, long-existing and well-evaluated overlays like Chord or Pastry can be used to create attractive DHT-based applications. AU - Wette, Philip AU - Graffi, Kalman ID - 559 T2 - Proceedings of the Conference on Networked Systems (NetSys) TI - Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables ER - TY - CONF AB - In the last decades, development turned from monolithic software products towards more flexible software components that can be provided on world-wide markets in form of services. Customers request such services or compositions of several services. However, in many cases, discovering the best services to address a given request is a tough challenge and requires expressive, gradual matching results, considering different aspects of a service description, e.g., inputs/ouputs, protocols, or quality properties. Furthermore,in situations in which no service exactly satifies the request, approximate matching which can deal with a certain amount of fuzziness becomes necessary. There is a wealth of service matching approaches, but it is not clear whether there is a comprehensive, fuzzy matching approach which addresses all these challenges. Although there are a few service matchingsurveys, none of them is able to answer this question. In this paper, we perform a systematic literature survey of 35 (outof 504) service matching approaches which consider fuzzy matching. Based on this survey, we propose a classication,discuss how different matching approaches can be combined into a comprehensive matching method, and identify future research challenges. AU - Platenius, Marie AU - von Detten, Markus AU - Becker, Steffen AU - Schäfer, Wilhelm AU - Engels, Gregor ID - 560 T2 - Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based Software Engineering TI - A Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing ER - TY - JOUR AB - We present a privacy-friendly architecture for a future cloud computing scenario where software licensing and software payment plays a major role. We show how digital rights management as a technical solution for software licensing can be achieved in a privacy-friendly manner. In our scenario, users who buy software from software providers and execute it at computing centres stay anonymous. At the same time, our approach guarantees that software licenses are bound to users and that their validity is checked before execution. Thus, DRM constitutes an incentive for software providers to take part in such a future cloud computing scenario. We employ a software re-encryption scheme so that computing centres are not able to build profiles of their users – not even under a pseudonym. We make sure that malicious users are unable to relay software to others. AU - Petrlic, Ronald AU - Sekula, Stephan AU - Sorge, Christoph ID - 561 IS - 4 JF - International Journal of Grid and Utility Computing TI - A privacy-friendly Architecture for future Cloud Computing ER - TY - CONF AB - In Distributed Cloud Computing, applications are deployed across many data centres at topologically diverse locations to improved network-related quality of service (QoS). As we focus on interactive applications, we minimize the latency between users and an application by allocating Cloud resources nearby the customers. Allocating resources at all locations will result in the best latency but also in the highest expenses. So we need to find an optimal subset of locations which reduces the latency but also the expenses – the facility location problem (FLP). In addition, we consider resource capacity restrictions, as a resource can only serve a limited amount of users. An FLP can be globally solved. Additionally, we propose a local, distributed heuristic. This heuristic is running within the network and does not depend on a global component. No distributed, local approximations for the capacitated FLP have been proposed so far due to the complexity of the problem. We compared the heuristic with an optimal solution obtained from a mixed integer program for different network topologies. We investigated the influence of different parameters like overall resource utilization or different latency weights. AU - Keller, Matthias AU - Pawlik, Stefan AU - Pietrzyk, Peter AU - Karl, Holger ID - 562 T2 - Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing TI - A Local Heuristic for Latency-Optimized Distributed Cloud Deployment ER - TY - CONF AB - Dominating set based virtual backbones are used for rou-ting in wireless ad-hoc networks. Such backbones receive and transmit messages from/to every node in the network. Existing distributed algorithms only consider undirected graphs, which model symmetric networks with uniform transmission ranges. We are particularly interested in the well-established disk graphs, which model asymmetric networks with non-uniform transmission ranges. The corresponding graph theoretic problem seeks a strongly connected dominating-absorbent set of minimum cardinality in a digraph. A subset of nodes in a digraph is a strongly connected dominating-absorbent set if the subgraph induced by these nodes is strongly connected and each node in the graph is either in the set or has both an in-neighbor and an out-neighbor in it. We introduce the first distributed algorithm for this problem in disk graphs. The algorithm gives an O(k^4) -approximation ratio and has a runtime bound of O(Diam) where Diam is the diameter of the graph and k denotes the transmission ratio r_{max}/r_{min} with r_{max} and r_{min} being the maximum and minimum transmission range, respectively. Moreover, we apply our algorithm on the subgraph of disk graphs consisting of only bidirectional edges. Our algorithm gives an O(ln k) -approximation and a runtime bound of O(k^8 log^∗ n) , which, for bounded k , is an optimal approximation for the problem, following Lenzen and Wattenhofer’s Ω(log^∗ n) runtime lower bound for distributed constant approximation in disk graphs. AU - Markarian, Christine AU - Meyer auf der Heide, Friedhelm AU - Schubert, Michael ID - 563 T2 - Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS) TI - A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks ER - TY - JOUR AU - Schryen, Guido ID - 5637 IS - 2 JF - European Journal of Information Systems (EJIS) TI - Revisiting IS Business Value Research: What we already know, what we still need to know, and how we can get there VL - 22 ER - TY - CONF AB - We consider the problem of resource discovery in distributed systems. In particular we give an algorithm, such that each node in a network discovers the add ress of any other node in the network. We model the knowledge of the nodes as a virtual overlay network given by a directed graph such that complete knowledge of all nodes corresponds to a complete graph in the overlay network. Although there are several solutions for resource discovery, our solution is the first that achieves worst-case optimal work for each node, i.e. the number of addresses (O(n)) or bits (O(nlogn)) a node receives or sendscoincides with the lower bound, while ensuring only a linearruntime (O(n)) on the number of rounds. AU - Kniesburges, Sebastian AU - Koutsopoulos, Andreas AU - Scheideler, Christian ID - 564 T2 - Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO) TI - A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery ER - TY - CHAP AU - Higham, J. J. S. AU - Kremer, H.-Hugo AU - Yeomans, D. ED - Deitmer, L. ED - Hauschildt, U. ED - Rauner, F. ED - Zelloth, H. ID - 6456 T2 - The Architecture of Innovative Apprenticeship TI - Exploring Intermediate Vocational Education and Training for 16-19 Year-olds in Germany and England ER - TY - CHAP AU - Kremer, H.-Hugo AU - Beutner, Marc AU - Wirth, W. ED - Kremer, H.-H. ED - Beutner, M. ED - Wirth, W. ID - 6457 T2 - Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug TI - Lernen im Justizvollzug. Vorstellung und Grundidee des Modellprojektes TANDEM ER - TY - CHAP AU - Kremer, H.-Hugo AU - Beutner, Marc ID - 6458 T2 - Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug TI - Berufsorientierung im Jungtätervollzug - Rahmenkonzept und übergreifenden Prinzipien ER - TY - CHAP AU - Gebbe, M. AU - Kremer, H.-Hugo ED - Kremer, H.-H. ED - Beutner, M. ED - Wirth, W. ID - 6459 T2 - Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug TI - myflux.eu - Ein Instrument zur Förderung von Zielorientierung, Reflexion und Verantwortung im Berufsorientierungsprozess von Jungtätern ER - TY - CHAP AU - Kremer, H.-Hugo AU - Knust, S. ED - Kremer, H.-H. ED - Beutner, M. ED - Wirth, W. ID - 6461 T2 - Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug TI - Stärkenbasierte Berufsorientierung im Jungtätervollzug ER - TY - CHAP AU - Kremer, H.-Hugo AU - Beutner, Marc ED - Kremer, H.-H. ED - Beutner, M. ED - Wirth, W. ID - 6462 T2 - Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug TI - Mit dem Tandem in die Zukunft - Eine Einschätzung aus berufs- und wirtschaftspädagogischer Perspektive ER - TY - CONF AU - Olfert, Sergei AU - Claes, Leander AU - Henning, Bernd ID - 6573 T2 - Proceedings of the International Conference on Acoustics TI - Influence of angular radiated ultrasound waves on the Schlieren tomogram ER - TY - JOUR AU - Coumans, Dion AU - Gehrke, Mai AU - van Rooijen, Lorijn ID - 6729 IS - 1 JF - Journal of Applied Logic SN - 1570-8683 TI - Relational semantics for full linear logic VL - 12 ER - TY - CONF AU - Place, Thomas AU - van Rooijen, Lorijn AU - Zeitoun, Marc ID - 6730 T2 - Annual Conference on Foundations of Software Technology and Theoretical Computer Science, (FSTTCS) 2013, December 12-14, 2013, Guwahati, India TI - Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages VL - 24 ER - TY - CONF AU - Place, Thomas AU - van Rooijen, Lorijn AU - Zeitoun, Marc ID - 6732 SN - 0302-9743 T2 - Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013 TI - Separating Regular Languages by Piecewise Testable and Unambiguous Languages ER - TY - JOUR AU - Tönnies, Merle ID - 6782 IS - 2 JF - Journal for the Study of British Cultures TI - Northern Landscapes and Anti-Thatcherite Positioning VL - 20 ER - TY - JOUR AU - Tönnies, Merle ID - 6783 IS - 1 JF - International Journal of English Studies TI - Feminising a Classical Male Plot Model? Black British Women Writers and the 'Bildungsroman' VL - 24 ER - TY - CONF AU - Weber, T. AU - Berghold, J. AU - Heilmann, F. AU - Roericht, M. AU - Krauter, Stefan AU - Grunow, Paul ID - 6913 T2 - Proceedings of the 28th European Photovoltaic Solar Energy Conference and Exhibition, Paris (Frankreich TI - Test Sequence Development for Evaluation of Potential Induced Degradation on Thin-Film Modules ER - TY - JOUR AU - Krauter, Stefan ID - 6915 JF - Forschungsforum Paderborn, 16-2013, Februar 2013 TI - Energiewende mit Sonnenstrom ER - TY - CONF AU - Japs, Ewald AU - Sonnenrein, Gerrit AU - Steube, Julia AU - Vrabec, Jadran AU - Kenig, E. AU - Krauter, Stefan ID - 6916 T2 - Proceedings of the 28th European Photovoltaic Solar Energy Conference and Exhibition, Paris (Frankreich) TI - Technical investigation of a photovoltaic module with integrated improved phase change material ER - TY - CONF AU - Bendfeld, Jörg AU - Krieger, Jens ID - 6917 T2 - WINDFORCE 2013 Bremerhaven, 9. WAB Offshore-Windenergie Konferenz, Juni 2013 TI - Foundation Monitoring – An Overview of Methods and Measurement Solutions ER - TY - GEN AU - Bouyraaman, Yassin ID - 6918 TI - Power to Gas – Eine andere Möglichkeit, Windstrom zu nutzen? ER - TY - GEN AU - Krauter, Stefan ID - 6919 TI - Erstellung Klimaschutzkonzept der Stadt Paderborn unter Nutzung Erneuerbarer Energien, ER - TY - CONF AU - Bendfeld, Jörg AU - Krieger, Jens ID - 6920 T2 - Europe’s Premier Wind Energy Event – EWEA 2013 Annual Event, Vienna, Austria, February 2013 TI - 7 YEARS METEOMAST AMRUMBANK WEST ER - TY - CONF AU - Bendfeld, Jörg AU - Balluff, Stefan AU - Bouyraaman, Yassin AU - Krieger, jens ID - 6921 T2 - Europe’s Premier Wind Energy Event – EWEA 2013 Annual Event, Vienna, Austria, February 2013 TI - FOG MEASURING AND SELECTED OFFSHORE FOG OCCURRENCES FOR THE OFFSHORE WIND ENERGY ER - TY - CONF AU - Krieger, Jens AU - Bendfeld, Jörg ID - 6922 T2 - Europe’s Premier Wind Energy Event – EWEA 2013 Annual Event, Vienna, Austria, February 2013 TI - FOUNDATION MONITORING FOR OFFSHORE WINDFARMS ER - TY - CONF AU - Bouyraaman, Yassin AU - Bendfeld, Jörg ID - 6923 T2 - Europe’s Premier Wind Energy Event – EWEA 2013 Annual Event, Vienna, Austria, February 2013 TI - Optimisation of Offshore Wind farm Feed-in fluctuations via Power to Gas Storage Systems ER - TY - CONF AU - Bendfeld, Jörg ID - 6924 T2 - Wissenschaftliche Verhandlungen 2013 der Deutschen Physikalischen Gesellschaft TI - Measurements for PV-Module outdoor performance ER - TY - CONF AU - Krieger, Jens AU - Bendfeld, Jörg ID - 6925 T2 - Wissenschaftliche Verhandlungen 2013 der Deutschen Physikalischen Gesellschaft TI - Foundation monitoring for offshore windfarms ER - TY - GEN AU - Krauter, Stefan ID - 6926 TI - Photovoltaics: Basics, Applications, Recent Developments ER -