@misc{458, author = {{Dreimann, Philipp}}, publisher = {{Universität Paderborn}}, title = {{{Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic}}}, year = {{2014}}, } @inproceedings{459, abstract = {{In this survey article, we discuss two algorithmic research areas that emerge from problems that arise when resources are offered in the cloud. The first area, online leasing, captures problems arising from the fact that resources in the cloud are not bought, but leased by cloud vendors. The second area, Distributed Storage Systems, deals with problems arising from so-called cloud federations, i.e., when several cloud providers are needed to fulfill a given task.}}, author = {{Kniesburges, Sebastian and Markarian, Christine and Meyer auf der Heide, Friedhelm and Scheideler, Christian}}, booktitle = {{Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)}}, pages = {{1--13}}, title = {{{Algorithmic Aspects of Resource Management in the Cloud}}}, doi = {{10.1007/978-3-319-09620-9_1}}, year = {{2014}}, } @article{4599, author = {{Beran, Jan and Feng, Yuanhua and Ghosh, Sucharita}}, issn = {{0932-5026}}, journal = {{Statistical Papers}}, number = {{2}}, pages = {{431--451}}, publisher = {{Springer Nature}}, title = {{{Modelling long-range dependence and trends in duration series: an approach based on EFARIMA and ESEMIFAR models}}}, doi = {{10.1007/s00362-014-0590-x}}, volume = {{56}}, year = {{2014}}, } @misc{460, author = {{Mittendorf, Robert}}, publisher = {{Universität Paderborn}}, title = {{{Advanced AES-key recovery from decayed RAM-dumps using multi-threading and FPGAs}}}, year = {{2014}}, } @inbook{4602, author = {{Beran, Jan and Feng, Yuanhua and Ghosh, Sucharita}}, booktitle = {{Empirical Economic and Financial Research}}, isbn = {{9783319031217}}, issn = {{1570-5811}}, pages = {{239--253}}, publisher = {{Springer International Publishing}}, title = {{{On EFARIMA and ESEMIFAR Models}}}, doi = {{10.1007/978-3-319-03122-4_15}}, year = {{2014}}, } @inbook{4603, author = {{Peitz, Christian and Feng, Yuanhua}}, booktitle = {{Empirical Economic and Financial Research}}, isbn = {{9783319031217}}, issn = {{1570-5811}}, pages = {{341--356}}, publisher = {{Springer International Publishing}}, title = {{{Double Conditional Smoothing of High-Frequency Volatility Surface Under a Spatial Model}}}, doi = {{10.1007/978-3-319-03122-4_21}}, year = {{2014}}, } @article{4605, author = {{Feng, Yuanhua}}, issn = {{0167-7152}}, journal = {{Statistics & Probability Letters}}, pages = {{109--113}}, publisher = {{Elsevier BV}}, title = {{{Data-driven estimation of diurnal patterns of durations between trades on financial markets}}}, doi = {{10.1016/j.spl.2014.05.011}}, volume = {{92}}, year = {{2014}}, } @misc{461, author = {{Dräxler, Sevil}}, publisher = {{Universität Paderborn}}, title = {{{Adaptive Placement of Programmable Virtual Network Function Chains}}}, year = {{2014}}, } @inproceedings{462, abstract = {{We discuss a technique to analyze complex infinitely repeated games using techniques from the fields of game theory and simulations. Our research is motivated by the analysis of electronic markets with thousands of participants and possibly complex strategic behavior. We consider an example of a global market of composed IT services to demonstrate the use of our simulation technique. We present our current work in this area and we want to discuss further approaches for the future.}}, author = {{Feldotto, Matthias and Skopalik, Alexander}}, booktitle = {{Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)}}, pages = {{625--630}}, title = {{{A Simulation Framework for Analyzing Complex Infinitely Repeated Games}}}, doi = {{10.5220/0005110406250630}}, year = {{2014}}, } @inproceedings{463, abstract = {{Several fault attacks against pairing-based cryptography have been described theoretically in recent years. Interestingly, none of these have been practically evaluated. We accomplished this task and prove that fault attacks against pairing-based cryptography are indeed possible and are even practical — thus posing a serious threat. Moreover, we successfully conducted a second-order fault attack against an open source implementation of the eta pairing on an AVR XMEGA A1. We injected the first fault into the computation of the Miller Algorithm and applied the second fault to skip the final exponentiation completely. We introduce a low-cost setup that allowed us to generate multiple independent faults in one computation. The setup implements these faults by clock glitches which induce instruction skips. With this setup we conducted the first practical fault attack against a complete pairing computation.}}, author = {{Blömer, Johannes and Gomes da Silva, Ricardo and Günther, Peter and Krämer, Juliane and Seifert, Jean-Pierre}}, booktitle = {{Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)}}, pages = {{123----136}}, title = {{{A Practical Second-Order Fault Attack against a Real-World Pairing Implementation}}}, doi = {{10.1109/FDTC.2014.22}}, year = {{2014}}, } @article{464, abstract = {{Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful network topologies. The goal is to devise distributed algorithms where nodes forward, insert, and delete links to neighboring nodes, and that converge quickly to such a desirable topology, independently of the initial network configuration. This article proposes a new model to study the parallel convergence time. Our model sheds light on the achievable parallelism by avoiding bottlenecks of existing models that can yield a distorted picture. As a case study, we consider local graph linearization—i.e., how to build a sorted list of the nodes of a connected graph in a distributed and self-stabilizing manner. In order to study the main structure and properties of our model, we propose two variants of a most simple local linearization algorithm. For each of these variants, we present analyses of the worst-case and bestcase parallel time complexities, as well as the performance under a greedy selection of the actions to be executed. It turns out that the analysis is non-trivial despite the simple setting, and to complement our formal insights we report on our experiments which indicate that the runtimes may be better in the average case.}}, author = {{Gall, Dominik and Jacob, Riko and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo }}, journal = {{Theory of Computing Systems}}, number = {{1}}, pages = {{110--135}}, publisher = {{Springer}}, title = {{{A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization}}}, doi = {{10.1007/s00224-013-9504-x}}, year = {{2014}}, } @techreport{465, abstract = {{This article presents a novel Mixed Integer Nonlinear Programming (MINLP) approach for finding a renewal plan of pipes in a water distribution system. We formulate a MINLP model for finding the times of renewal and suited measurements of pipe dimensions in a multi-year planning horizon. The model includes a multi-period hydraulic simulation of the distribution systems behaviour thereby respecting the friction caused headloss as a nonlinear constraint. We apply the MINLP solver Bonmin to a test network and present first numerical results. The models embedding into a general solution framework for water network problems consisting of network reduction and simulation steps in an interated way, is beign discussed. This latter discussion corresponds well to the recent results by C. Hallmann for the problem of tank planning within the mentioned solution framework that has been presented there for the first time.}}, author = {{Stapel, Florian and Suhl, Leena}}, publisher = {{Universität Paderborn}}, title = {{{A MINLP Approach for Planning the Renewal of Pipes in Drinking Water Networks}}}, year = {{2014}}, } @misc{466, author = {{Brand, Marcel}}, publisher = {{Universität Paderborn}}, title = {{{A generalized loop accelerator implemented as a coarse grained array}}}, year = {{2014}}, } @inproceedings{4664, author = {{Zhou, Chen and Feng, Yuanhua}}, location = {{University of Pisa, Italy}}, title = {{{Data-driven estimation of realized kernels under dependent microstructure noise and further analysis using the Semi-FI-Log-ACD}}}, year = {{2014}}, } @article{467, abstract = {{Financial benefits are an important factor when cloud infrastructure is considered to meet processing demand. The dynamics of on-demand pricing and service usage are investigated in a two-stage game model for a monopoly Infrastructure-as-a-Service (IaaS) market. The possibility of hybrid clouds (public clouds plus own infrastructure) turns out to be essential in order that not only the provider but also the clients have significant benefits from on-demand services. Even if the client meets all demand in the public cloud, the threat of building a hybrid cloud keeps the instance price low. This is not the case when reserved instances are offered as well. Parameters like load profiles and economies of scale have a huge effect on likely future pricing and on a cost-optimal split-up of client demand between either a client’s own data center and a public cloud service or between reserved and on-demand cloud instances.}}, author = {{Künsemöller, Jörn and Karl, Holger}}, journal = {{Future Generation Computer Systems}}, pages = {{44----52}}, publisher = {{Elsevier}}, title = {{{A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service}}}, doi = {{10.1016/j.future.2014.03.005}}, year = {{2014}}, } @article{4694, author = {{Kohlborn, T and Müller, Oliver and Pöppelbuss, J and Röglinger, M}}, issn = {{1463-7154}}, journal = {{Business Process Management Journal}}, number = {{4}}, pages = {{3----6}}, title = {{{New frontiers in business process management}}}, doi = {{10.1108/BPMJ-02-2014-0015}}, year = {{2014}}, } @article{4695, author = {{Debortoli, Stefan and Müller, Oliver and vom Brocke, Jan}}, isbn = {{0910-8327 (Print)$\backslash$n0910-8327 (Linking)}}, issn = {{18670202}}, journal = {{Business and Information Systems Engineering}}, keywords = {{Big data, Business intelligence, Competencies, Latent semantic analysis, Text mining}}, number = {{5}}, pages = {{289----300}}, title = {{{Comparing business intelligence and big data skills: A text mining study using job advertisements}}}, doi = {{10.1007/s12599-014-0344-2}}, year = {{2014}}, } @article{4696, author = {{vom Brocke, Jan and Debortoli, Stefan and Reuter, Nadine and Müller, Oliver}}, issn = {{15293181}}, journal = {{Communications of the Association for Information Systems}}, keywords = {{Advanced business analytics, Big Data, Business intelligence, IT business value, In-memory technology, OLAP, OLTP, Realtime analytics, Sentiment analysis}}, pages = {{151----167}}, title = {{{How In-Memory Technology Can Create Business Value: Lessons Learned from Hilti}}}, doi = {{10.17705/1CAIS.03407}}, year = {{2014}}, } @article{4697, author = {{Sommerauer, Peter and Müller, Oliver}}, isbn = {{0360-1315}}, issn = {{03601315}}, journal = {{Computers and Education}}, keywords = {{Augmented reality, Cognitive theory of multimedia learning, Field experiment, Informal learning, Museum}}, pages = {{59----68}}, title = {{{Augmented reality in informal learning environments: A field experiment in a mathematics exhibition}}}, doi = {{10.1016/j.compedu.2014.07.013}}, year = {{2014}}, } @techreport{4750, author = {{Ortmann, Regina and Sureth-Sloane, Caren}}, title = {{{Can the CCCTB Alleviate Tax Discrimination against Loss-Making European Multinational Groups?}}}, volume = {{165}}, year = {{2014}}, }