@article{4600, author = {{Guo, Zhichao and Feng, Yuanhua}}, issn = {{0264-9993}}, journal = {{Economic Modelling}}, pages = {{474--483}}, publisher = {{Elsevier BV}}, title = {{{Modeling of the impact of the financial crisis and China's accession to WTO on China's exports to Germany}}}, doi = {{10.1016/j.econmod.2012.12.015}}, volume = {{31}}, year = {{2013}}, } @book{4628, author = {{Beran, Jan and Feng, Yuanhua and Ghosh, Sucharita and Kulik, Rafal}}, isbn = {{9783642355110}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Long-Memory Processes}}}, doi = {{10.1007/978-3-642-35512-7}}, year = {{2013}}, } @techreport{4657, author = {{Feng, Yuanhua and Sun, Lixin}}, title = {{{A Semi-APARCH approach for comparing long-term and short-term risk in Chinese financial market and in mature financial markets}}}, year = {{2013}}, } @techreport{4658, author = {{Feng, Yuanhua}}, title = {{{Double-conditional smoothing of high-frequency volatility surface in a spatial multiplicative component GARCH with random effects}}}, year = {{2013}}, } @inproceedings{469, abstract = {{Runtime monitoring aims at ensuring program safety by monitoring the program's behaviour during execution and taking appropriate action before a program violates some property.Runtime monitoring is in particular important when an exhaustive formal verification fails. While the approach allows for a safe execution of programs, it may impose a significant runtime overhead.In this paper, we propose a novel technique combining verification and monitoring which incurs no overhead during runtime at all. The technique proceeds by using the inconclusive result of a verification run as the basis for transforming the program into one where all potential points of failure are replaced by HALT statements. The new program is safe by construction, behaviourally equivalent to the original program (except for unsafe behaviour),and has the same performance characteristics.}}, author = {{Wonisch, Daniel and Schremmer, Alexander and Wehrheim, Heike}}, booktitle = {{Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM)}}, pages = {{244--258}}, title = {{{Zero Overhead Runtime Monitoring}}}, doi = {{10.1007/978-3-642-40561-7_17}}, year = {{2013}}, } @inproceedings{4698, author = {{Gregor, Shirley and Müller, Oliver and Seidel, Stefan}}, booktitle = {{European Conference on Information Systems}}, keywords = {{Abstraction, Affordances, Design Science Research, Design Theory, Information Systems Development, Reflection, Theorizing}}, title = {{{Reflection, abstraction and theorizing in design and development research}}}, year = {{2013}}, } @article{4699, author = {{Becker, Jörg and Beverungen, Daniel and Knackstedt, Ralf and Matzner, Martin and Müller, Oliver and Pöppelbuss, Jens}}, issn = {{09050167}}, journal = {{Scandinavian Journal of Information Systems}}, keywords = {{Business process management, Conceptual modeling, Interaction routines, Modular design, Service networks, Social construction}}, number = {{1}}, pages = {{17----47}}, title = {{{Designing interaction routines in service networks: A modularity and social construction-based approach}}}, year = {{2013}}, } @inproceedings{470, abstract = {{In OpenFlow [1], multiple switches share the same control plane which is centralized atwhat is called the OpenFlow controller. A switch only consists of a forwarding plane. Rules for forwarding individual packets (called ow entries in OpenFlow) are pushed from the controller to the switches. In a network with a high arrival rate of new ows, such as in a data center, the control trac between the switch and controller can become very high. As a consequence, routing of new ows will be slow. One way to reduce control trac is to use wildcarded ow entries. Wildcard ow entries can be used to create default routes in the network. However, since switches do not keep track of ows covered by a wildcard ow entry, the controller no longer has knowledge about individual ows. To nd out about these individual ows we propose an extension to the current OpenFlow standard to enable packet sampling of wildcard ow entries.}}, author = {{Wette, Philip and Karl, Holger}}, booktitle = {{Proceedings of the ACM SIGCOMM '13}}, pages = {{541--542}}, title = {{{Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow}}}, doi = {{10.1145/2486001.2491710}}, year = {{2013}}, } @article{4700, author = {{Becker, Jorg and Beverungen, Daniel and Knackstedt, Ralf and Matzner, Martin and Müller, Oliver and Pöppelbuss, Jens}}, isbn = {{0018-9391}}, issn = {{00189391}}, journal = {{IEEE Transactions on Engineering Management}}, keywords = {{Action research, boundary spanning, business process management (BPM), service blueprinting, service networks}}, number = {{3}}, pages = {{468----482}}, title = {{{Bridging the gap between manufacturing and service through IT-based boundary objects}}}, doi = {{10.1109/TEM.2012.2214770}}, year = {{2013}}, } @misc{471, author = {{Tezer, Alina}}, publisher = {{Universität Paderborn}}, title = {{{Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen}}}, year = {{2013}}, } @misc{472, author = {{Engelbrecht, Marco}}, publisher = {{Universität Paderborn}}, title = {{{Vergleichsstudie zur Ausdrucksstärke von SMT-Solvern}}}, year = {{2013}}, } @inproceedings{473, abstract = {{We present a solution to the problem of privacy invasion in a multiparty digital rights management scheme. (Roaming) users buy content licenses from a content provider and execute it at any nearby content distributor. Our approach, which does not need any trusted third party - in contrast to most related work on privacy-preserving DRM - is based on a re-encryption scheme that runs on any mobile Android device. Only a minor security-critical part needs to be performed on the device's smartcard which could, for instance, be a SIM card.}}, author = {{Petrlic, Ronald and Sekula, Stephan}}, booktitle = {{Data and Applications Security and Privacy XXVII}}, editor = {{Wang, Lingyu and Shafiq, Basit}}, pages = {{289--296}}, title = {{{Unlinkable content playbacks in a multiparty DRM system}}}, doi = {{10.1007/978-3-642-39256-6_21}}, year = {{2013}}, } @techreport{474, abstract = {{Suppose some individuals are allowed to engage in different groups at the same time and they generate a certain welfare by cooperation. Finding appropriate ways for distributing this welfare is a non-trivial issue. The purpose of this work is to analyze two-stage allocation procedures where first each group receives a share of the welfare which is then, subsequently, distributed among the corresponding members. To study these procedures in a structured way, cooperative games and network games are combined in a general framework by using mathematical hypergraphs. Moreover, several convincing requirements on allocation procedures are discussed and formalized. Thereby it will be shown, for example, that the Position Value and iteratively applying the Myerson Value can be characterized by similar axiomatizations.}}, author = {{Röhl, Nils}}, publisher = {{Universität Paderborn}}, title = {{{Two-Stage Allocation Procedures}}}, year = {{2013}}, } @inproceedings{475, abstract = {{We propose a privacy-preserving digital rights management scheme for (future) cloud computing. Users buy software from software providers and execute it at computing centers. Our solution allows software providers to provide different license models, like execute at most n-times models. Users’ anonymity and unlinkability of actions are preserved and thus, profile building is not even possible under (a) pseudonym. Privacy protection in the honest-but-curious model is achieved by combining ring signatures with an anonymous recipient scheme.We employ secret sharing in a unique manner that allows the software provider to expose the user’s identity if the user commits fraud, e.g. by exceeding the execution limit n.}}, author = {{Joshi, Nakul and Petrlic, Ronald}}, booktitle = {{Proceedings of the 10th Annual IEEE Consumer Communications & Networking Conference (CCNC)}}, pages = {{259--264}}, title = {{{Towards practical privacy-preserving Digital Rights Management for Cloud Computing}}}, doi = {{10.1109/CCNC.2013.6488456}}, year = {{2013}}, } @article{476, abstract = {{An elementary h-route ow, for an integer h 1, is a set of h edge- disjoint paths between a source and a sink, each path carrying a unit of ow, and an h-route ow is a non-negative linear combination of elementary h-routeows. An h-route cut is a set of edges whose removal decreases the maximum h-route ow between a given source-sink pair (or between every source-sink pair in the multicommodity setting) to zero. The main result of this paper is an approximate duality theorem for multicommodity h-route cuts and ows, for h 3: The size of a minimum h-route cut is at least f=h and at most O(log4 k f) where f is the size of the maximum h-routeow and k is the number of commodities. The main step towards the proof of this duality is the design and analysis of a polynomial-time approximation algorithm for the minimum h-route cut problem for h = 3 that has an approximation ratio of O(log4 k). Previously, polylogarithmic approximation was known only for h-route cuts for h 2. A key ingredient of our algorithm is a novel rounding technique that we call multilevel ball-growing. Though the proof of the duality relies on this algorithm, it is not a straightforward corollary of it as in the case of classical multicommodity ows and cuts. Similar results are shown also for the sparsest multiroute cut problem.}}, author = {{Kolman, Petr and Scheideler, Christian}}, journal = {{Theory of Computing Systems}}, number = {{2}}, pages = {{341--363}}, publisher = {{Springer}}, title = {{{Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing}}}, doi = {{10.1007/s00224-013-9454-3}}, year = {{2013}}, } @inproceedings{477, abstract = {{We consider the k-token dissemination problem, where k initially arbitrarily distributed tokens have to be disseminated to all nodes in a dynamic network (as introduced by Kuhn et al., STOC 2010). In contrast to general dynamic networks, our dynamic networks are unit disk graphs, i.e., nodes are embedded into the Euclidean plane and two nodes are connected if and only if their distance is at most R. Our worst-case adversary is allowed to move the nodes on the plane, but the maximum velocity v_max of each node is limited and the graph must be connected in each round. For this model, we provide almost tight lower and upper bounds for k-token dissemination if nodes are restricted to send only one token per round. It turns out that the maximum velocity v_max is a meaningful parameter to characterize dynamics in our model.}}, author = {{Abshoff, Sebastian and Benter, Markus and Cord-Landwehr, Andreas and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}}, booktitle = {{Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers}}, pages = {{22--34}}, title = {{{Token Dissemination in Geometric Dynamic Networks}}}, doi = {{10.1007/978-3-642-45346-5_3}}, year = {{2013}}, } @phdthesis{478, abstract = {{Software systems are playing an increasing role in our everyday life, and as the amount of software applications grows, so does their complexity and the relevance of their computations. Software components can be found in many systems that are charged with safety-critical tasks, such as control systems for aviation or power plants. Hence, software verification techniques that are capable of proving the absence of critical errors are becoming more and more important in the field software engineering. A well-established approach to software verification is model checking. Applying this technique involves an exhaustive exploration of a state space model corresponding to the system under consideration. The major challenge in model checking is the so-called state explosion problem: The state space of a software system grows exponentially with its size. Thus, the straightforward modelling of real-life systems practically impossible. A common approach to this problem is the application of abstraction techniques, which reduce the original state space by mapping it on a significantly smaller abstract one. Abstraction inherently involves a loss of information, and thus, the resulting abstract model may be too imprecise for a definite result in verification. Therefore, abstraction is typically combined with abstraction refinement: An initially very coarse abstract model is iteratively refined, i.e. enriched with new details about the original system, until a level of abstraction is reached that is precise enough for a definite outcome. Abstraction refinement-based model checking is fully automatable and it is considered as one of the most promising approaches to the state explosion problem in verification. However, it is still faced with a number of challenges. There exist several types of abstraction techniques and not every type is equally well-suited for all kinds of systems and verification tasks. Moreover, the selection of adequate refinement steps is nontrivial and typically the most crucial part of the overall approach: Unfavourable refinement decisions can compromise the state space-reducing effect of abstraction, and as a consequence, can easily lead to the failure of verification. It is, however, hard to predict which refinement steps will eventually be expedient for verification – and which not.}}, author = {{Timm, Nils}}, publisher = {{Universität Paderborn}}, title = {{{Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems}}}, year = {{2013}}, } @article{480, abstract = {{Although of considerable practical importance, the separate impact of individual and collective reputation on firm performance (e.g. product prices) has not yet been convincingly demonstrated. We use a sample of some 70 different wineries offering more than 1,300 different Riesling wines from the Mosel valley to isolate the returns to individual reputation (measured by expert ratings in a highly respected wine guide) from the returns to collective reputation (measured by membership in two different professional associations where members are assumed to monitor each other very closely). We find that both effects are statistically significant and economically relevant with the latter being more important in quantitative terms than the former.}}, author = {{Frick, Bernd and Simmons, Robert}}, journal = {{Journal of Business Economics}}, number = {{2}}, pages = {{101--119}}, publisher = {{Springer}}, title = {{{The Impact of Individual and Collective Reputation on Wine Prices: Empirical Evidence from the Mosel Valley}}}, doi = {{10.1007/s11573-013-0652-x}}, volume = {{83}}, year = {{2013}}, } @inproceedings{481, abstract = {{Cloud computing offers high availability, dynamic scalability, and elasticity requiring only very little administration. However, this service comes with financial costs. Peer-to-peer systems, in contrast, operate at very low costs but cannot match the quality of service of the cloud. This paper focuses on the case study of Wikipedia and presents an approach to reduce the operational costs of hosting similar websites in the cloud by using a practical peer-to-peer approach. The visitors of the site are joining a Chord overlay, which acts as first cache for article lookups. Simulation results show, that up to 72% of the article lookups in Wikipedia could be answered by other visitors instead of using the cloud.}}, author = {{Graffi, Kalman and Bremer, Lars}}, booktitle = {{Proceedings of the International Conference on Communications (ICC'13)}}, pages = {{3444 -- 3449 }}, title = {{{Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case}}}, doi = {{10.1109/ICC.2013.6655082}}, year = {{2013}}, } @misc{482, author = {{Bieshaar, Maarten}}, publisher = {{Universität Paderborn}}, title = {{{Statistisches Planen von Aktionen für autonome mobile Roboter in realen Umgebungen}}}, year = {{2013}}, }