--- _id: '510' author: - first_name: Chintan full_name: Jayesh Parekh, Chintan last_name: Jayesh Parekh citation: ama: Jayesh Parekh C. Meta-Data Based Search in Structured Peer-to-Peer Networks. Universität Paderborn; 2013. apa: Jayesh Parekh, C. (2013). Meta-data based Search in Structured Peer-to-Peer Networks. Universität Paderborn. bibtex: '@book{Jayesh Parekh_2013, title={Meta-data based Search in Structured Peer-to-Peer Networks}, publisher={Universität Paderborn}, author={Jayesh Parekh, Chintan}, year={2013} }' chicago: Jayesh Parekh, Chintan. Meta-Data Based Search in Structured Peer-to-Peer Networks. Universität Paderborn, 2013. ieee: C. Jayesh Parekh, Meta-data based Search in Structured Peer-to-Peer Networks. Universität Paderborn, 2013. mla: Jayesh Parekh, Chintan. Meta-Data Based Search in Structured Peer-to-Peer Networks. Universität Paderborn, 2013. short: C. Jayesh Parekh, Meta-Data Based Search in Structured Peer-to-Peer Networks, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:31Z date_updated: 2022-01-06T07:01:37Z project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: Meta-data based Search in Structured Peer-to-Peer Networks type: mastersthesis user_id: '15504' year: '2013' ... --- _id: '5108' abstract: - lang: eng text: '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. ' article_type: original author: - first_name: Daniel full_name: Kreutzmann, Daniel last_name: Kreutzmann - first_name: Sönke full_name: Sievers, Sönke id: '46447' last_name: Sievers - first_name: Christian full_name: Mueller, Christian last_name: Mueller citation: ama: Kreutzmann D, Sievers S, Mueller C. Investment distortions and the value of the government’s tax claim. Applied Financial Economics (VHB-JOURQUAL 3 Ranking C). 2013;23(11):977-989. doi:10.1080/09603107.2013.786161 apa: Kreutzmann, D., Sievers, S., & Mueller, C. (2013). Investment distortions and the value of the government’s tax claim. Applied Financial Economics (VHB-JOURQUAL 3 Ranking C), 23(11), 977–989. https://doi.org/10.1080/09603107.2013.786161 bibtex: '@article{Kreutzmann_Sievers_Mueller_2013, title={Investment distortions and the value of the government’s tax claim}, volume={23}, DOI={10.1080/09603107.2013.786161}, number={11}, journal={Applied Financial Economics (VHB-JOURQUAL 3 Ranking C)}, publisher={Taylor \& Francis}, author={Kreutzmann, Daniel and Sievers, Sönke and Mueller, Christian}, year={2013}, pages={977–989} }' chicago: 'Kreutzmann, Daniel, Sönke Sievers, and Christian Mueller. “Investment Distortions and the Value of the Government’s Tax Claim.” Applied Financial Economics (VHB-JOURQUAL 3 Ranking C) 23, no. 11 (2013): 977–89. https://doi.org/10.1080/09603107.2013.786161.' ieee: D. Kreutzmann, S. Sievers, and C. Mueller, “Investment distortions and the value of the government’s tax claim,” Applied Financial Economics (VHB-JOURQUAL 3 Ranking C), vol. 23, no. 11, pp. 977–989, 2013. mla: Kreutzmann, Daniel, et al. “Investment Distortions and the Value of the Government’s Tax Claim.” Applied Financial Economics (VHB-JOURQUAL 3 Ranking C), vol. 23, no. 11, Taylor \& Francis, 2013, pp. 977–89, doi:10.1080/09603107.2013.786161. short: D. Kreutzmann, S. Sievers, C. Mueller, Applied Financial Economics (VHB-JOURQUAL 3 Ranking C) 23 (2013) 977–989. date_created: 2018-10-31T07:50:58Z date_updated: 2022-01-06T07:01:38Z department: - _id: '275' doi: 10.1080/09603107.2013.786161 extern: '1' intvolume: ' 23' issue: '11' jel: - G31 - G32 - H21 - H25 keyword: - corporate tax claim - company valuation - optimal investment - cost of capital language: - iso: eng main_file_link: - url: https://www.tandfonline.com/doi/full/10.1080/09603107.2013.786161#.VE5YmBZwmAd page: 977-989 publication: Applied Financial Economics (VHB-JOURQUAL 3 Ranking C) publication_status: published publisher: Taylor \& Francis status: public title: Investment distortions and the value of the government's tax claim type: journal_article user_id: '46447' volume: 23 year: '2013' ... --- _id: '511' author: - first_name: Malte full_name: Splietker, Malte last_name: Splietker citation: ama: Splietker M. MapReduce in Software Defined Networks. Universität Paderborn; 2013. apa: Splietker, M. (2013). MapReduce in Software Defined Networks. Universität Paderborn. bibtex: '@book{Splietker_2013, title={MapReduce in Software Defined Networks}, publisher={Universität Paderborn}, author={Splietker, Malte}, year={2013} }' chicago: Splietker, Malte. MapReduce in Software Defined Networks. Universität Paderborn, 2013. ieee: M. Splietker, MapReduce in Software Defined Networks. Universität Paderborn, 2013. mla: Splietker, Malte. MapReduce in Software Defined Networks. Universität Paderborn, 2013. short: M. Splietker, MapReduce in Software Defined Networks, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:32Z date_updated: 2022-01-06T07:01:38Z department: - _id: '75' project: - _id: '1' name: SFB 901 - _id: '6' name: SFB 901 - Subprojekt A2 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: MapReduce in Software Defined Networks type: bachelorsthesis user_id: '15504' year: '2013' ... --- _id: '5111' author: - first_name: Bernard Michael full_name: Gilroy, Bernard Michael id: '175' last_name: Gilroy - first_name: Heike full_name: Schreckenberg, Heike last_name: Schreckenberg - first_name: Volker full_name: Seiler, Volker last_name: Seiler citation: ama: 'Gilroy BM, Schreckenberg H, Seiler V. Subsidiarity between economic freedom and harmonized regulation: is there an optimal degree of European integration? Federal Governance. 2013;10(2):3-18.' apa: 'Gilroy, B. M., Schreckenberg, H., & Seiler, V. (2013). Subsidiarity between economic freedom and harmonized regulation: is there an optimal degree of European integration? Federal Governance, 10(2), 3–18.' bibtex: '@article{Gilroy_Schreckenberg_Seiler_2013, title={Subsidiarity between economic freedom and harmonized regulation: is there an optimal degree of European integration?}, volume={10}, number={2}, journal={Federal Governance}, publisher={MISC}, author={Gilroy, Bernard Michael and Schreckenberg, Heike and Seiler, Volker}, year={2013}, pages={3–18} }' chicago: 'Gilroy, Bernard Michael, Heike Schreckenberg, and Volker Seiler. “Subsidiarity between Economic Freedom and Harmonized Regulation: Is There an Optimal Degree of European Integration?” Federal Governance 10, no. 2 (2013): 3–18.' ieee: 'B. M. Gilroy, H. Schreckenberg, and V. Seiler, “Subsidiarity between economic freedom and harmonized regulation: is there an optimal degree of European integration?,” Federal Governance, vol. 10, no. 2, pp. 3–18, 2013.' mla: 'Gilroy, Bernard Michael, et al. “Subsidiarity between Economic Freedom and Harmonized Regulation: Is There an Optimal Degree of European Integration?” Federal Governance, vol. 10, no. 2, MISC, 2013, pp. 3–18.' short: B.M. Gilroy, H. Schreckenberg, V. Seiler, Federal Governance 10 (2013) 3–18. date_created: 2018-10-31T07:56:40Z date_updated: 2022-01-06T07:01:38Z department: - _id: '203' intvolume: ' 10' issue: '2' language: - iso: eng page: 3-18 publication: Federal Governance publisher: MISC status: public title: 'Subsidiarity between economic freedom and harmonized regulation: is there an optimal degree of European integration?' type: journal_article user_id: '26589' volume: 10 year: '2013' ... --- _id: '5112' author: - first_name: Bernard Michael full_name: Gilroy, Bernard Michael id: '175' last_name: Gilroy - first_name: Elmar full_name: Lukas, Elmar last_name: Lukas - first_name: Christian full_name: Heimann, Christian last_name: Heimann citation: ama: Gilroy BM, Lukas E, Heimann C. Technologiestandort Deutschland und internationale Wissensspillover. Jahrbücher für Nationalokonomie 6 Statistik. 2013;233. apa: Gilroy, B. M., Lukas, E., & Heimann, C. (2013). Technologiestandort Deutschland und internationale Wissensspillover. Jahrbücher Für Nationalokonomie 6 Statistik, 233. bibtex: '@article{Gilroy_Lukas_Heimann_2013, title={Technologiestandort Deutschland und internationale Wissensspillover.}, volume={233}, journal={Jahrbücher für Nationalokonomie 6 Statistik}, author={Gilroy, Bernard Michael and Lukas, Elmar and Heimann, Christian}, year={2013} }' chicago: Gilroy, Bernard Michael, Elmar Lukas, and Christian Heimann. “Technologiestandort Deutschland Und Internationale Wissensspillover.” Jahrbücher Für Nationalokonomie 6 Statistik 233 (2013). ieee: B. M. Gilroy, E. Lukas, and C. Heimann, “Technologiestandort Deutschland und internationale Wissensspillover.,” Jahrbücher für Nationalokonomie 6 Statistik, vol. 233, 2013. mla: Gilroy, Bernard Michael, et al. “Technologiestandort Deutschland Und Internationale Wissensspillover.” Jahrbücher Für Nationalokonomie 6 Statistik, vol. 233, 2013. short: B.M. Gilroy, E. Lukas, C. Heimann, Jahrbücher Für Nationalokonomie 6 Statistik 233 (2013). date_created: 2018-10-31T07:58:12Z date_updated: 2022-01-06T07:01:38Z department: - _id: '203' intvolume: ' 233' language: - iso: eng publication: Jahrbücher für Nationalokonomie 6 Statistik status: public title: Technologiestandort Deutschland und internationale Wissensspillover. type: journal_article user_id: '26589' volume: 233 year: '2013' ... --- _id: '5113' abstract: - lang: eng text: '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. ' article_type: original author: - first_name: Nicolas full_name: Heinrichs, Nicolas last_name: Heinrichs - first_name: Dieter full_name: Hess, Dieter last_name: Hess - first_name: Carsten full_name: Homburg, Carsten last_name: Homburg - first_name: Michael full_name: Lorenz, Michael last_name: Lorenz - first_name: Sönke full_name: Sievers, Sönke id: '46447' last_name: Sievers citation: ama: 'Heinrichs N, Hess D, Homburg C, Lorenz M, Sievers S. Extended dividend, cash flow, and residual income valuation models: Accounting for deviations from ideal conditions. Contemporary Accounting Research (VHB-JOURQUAL 3 Ranking A). 2013;30(1):42-79. doi:10.2139/ssrn.1145201' apa: 'Heinrichs, N., Hess, D., Homburg, C., Lorenz, M., & Sievers, S. (2013). Extended dividend, cash flow, and residual income valuation models: Accounting for deviations from ideal conditions. Contemporary Accounting Research (VHB-JOURQUAL 3 Ranking A), 30(1), 42–79. https://doi.org/10.2139/ssrn.1145201' bibtex: '@article{Heinrichs_Hess_Homburg_Lorenz_Sievers_2013, title={Extended dividend, cash flow, and residual income valuation models: Accounting for deviations from ideal conditions}, volume={30}, DOI={10.2139/ssrn.1145201}, number={1}, journal={Contemporary Accounting Research (VHB-JOURQUAL 3 Ranking A)}, publisher={Wiley Online Library}, author={Heinrichs, Nicolas and Hess, Dieter and Homburg, Carsten and Lorenz, Michael and Sievers, Sönke}, year={2013}, pages={42–79} }' chicago: 'Heinrichs, Nicolas, Dieter Hess, Carsten Homburg, Michael Lorenz, and Sönke Sievers. “Extended Dividend, Cash Flow, and Residual Income Valuation Models: Accounting for Deviations from Ideal Conditions.” Contemporary Accounting Research (VHB-JOURQUAL 3 Ranking A) 30, no. 1 (2013): 42–79. https://doi.org/10.2139/ssrn.1145201.' ieee: 'N. Heinrichs, D. Hess, C. Homburg, M. Lorenz, and S. Sievers, “Extended dividend, cash flow, and residual income valuation models: Accounting for deviations from ideal conditions,” Contemporary Accounting Research (VHB-JOURQUAL 3 Ranking A), vol. 30, no. 1, pp. 42–79, 2013.' mla: 'Heinrichs, Nicolas, et al. “Extended Dividend, Cash Flow, and Residual Income Valuation Models: Accounting for Deviations from Ideal Conditions.” Contemporary Accounting Research (VHB-JOURQUAL 3 Ranking A), vol. 30, no. 1, Wiley Online Library, 2013, pp. 42–79, doi:10.2139/ssrn.1145201.' short: N. Heinrichs, D. Hess, C. Homburg, M. Lorenz, S. Sievers, Contemporary Accounting Research (VHB-JOURQUAL 3 Ranking A) 30 (2013) 42–79. date_created: 2018-10-31T07:58:17Z date_updated: 2022-01-06T07:01:38Z department: - _id: '275' doi: 10.2139/ssrn.1145201 extern: '1' intvolume: ' 30' issue: '1' jel: - G12 - G14 - M41 keyword: - Dividend Discount Model - Residual Income - Discounted Cash Flow - Dirty Surplus - Terminal Value - Valuation Error language: - iso: eng main_file_link: - url: http://onlinelibrary.wiley.com/doi/10.1111/j.1911-3846.2011.01148.x/abstract page: 42-79 publication: Contemporary Accounting Research (VHB-JOURQUAL 3 Ranking A) publication_status: published publisher: Wiley Online Library quality_controlled: '1' related_material: link: - relation: earlier_version url: http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1145201 status: public title: 'Extended dividend, cash flow, and residual income valuation models: Accounting for deviations from ideal conditions' type: journal_article user_id: '46447' volume: 30 year: '2013' ... --- _id: '5114' author: - first_name: Bernard Michael full_name: Gilroy, Bernard Michael id: '175' last_name: Gilroy - first_name: Anastasia full_name: Heimann, Anastasia last_name: Heimann - first_name: Mark full_name: Schopf, Mark last_name: Schopf citation: ama: 'Gilroy BM, Heimann A, Schopf M. Basic income and labour supply: The German case. Basic Income Studies. 2013;8(1):43-70.' apa: 'Gilroy, B. M., Heimann, A., & Schopf, M. (2013). Basic income and labour supply: The German case. Basic Income Studies, 8(1), 43–70.' bibtex: '@article{Gilroy_Heimann_Schopf_2013, title={Basic income and labour supply: The German case}, volume={8}, number={1}, journal={Basic Income Studies}, publisher={De Gruyter}, author={Gilroy, Bernard Michael and Heimann, Anastasia and Schopf, Mark}, year={2013}, pages={43–70} }' chicago: 'Gilroy, Bernard Michael, Anastasia Heimann, and Mark Schopf. “Basic Income and Labour Supply: The German Case.” Basic Income Studies 8, no. 1 (2013): 43–70.' ieee: 'B. M. Gilroy, A. Heimann, and M. Schopf, “Basic income and labour supply: The German case,” Basic Income Studies, vol. 8, no. 1, pp. 43–70, 2013.' mla: 'Gilroy, Bernard Michael, et al. “Basic Income and Labour Supply: The German Case.” Basic Income Studies, vol. 8, no. 1, De Gruyter, 2013, pp. 43–70.' short: B.M. Gilroy, A. Heimann, M. Schopf, Basic Income Studies 8 (2013) 43–70. date_created: 2018-10-31T08:00:24Z date_updated: 2022-01-06T07:01:38Z department: - _id: '203' intvolume: ' 8' issue: '1' language: - iso: eng page: 43-70 publication: Basic Income Studies publisher: De Gruyter status: public title: 'Basic income and labour supply: The German case' type: journal_article user_id: '26589' volume: 8 year: '2013' ... --- _id: '5115' author: - first_name: Bernard Michael full_name: Gilroy, Bernard Michael id: '175' last_name: Gilroy - first_name: Birke Thuy Duong full_name: Nguyen, Birke Thuy Duong last_name: Nguyen citation: ama: Gilroy BM, Nguyen BTD. Ist Fairer Handel Wirklich Fair? WiSt-Wirtschaftswissenschaftliches Studium. 2013;42(3):134-140. apa: Gilroy, B. M., & Nguyen, B. T. D. (2013). Ist Fairer Handel Wirklich Fair? WiSt-Wirtschaftswissenschaftliches Studium, 42(3), 134–140. bibtex: '@article{Gilroy_Nguyen_2013, title={Ist Fairer Handel Wirklich Fair?}, volume={42}, number={3}, journal={WiSt-Wirtschaftswissenschaftliches Studium}, publisher={Verlag Franz Vahlen GmbH}, author={Gilroy, Bernard Michael and Nguyen, Birke Thuy Duong}, year={2013}, pages={134–140} }' chicago: 'Gilroy, Bernard Michael, and Birke Thuy Duong Nguyen. “Ist Fairer Handel Wirklich Fair?” WiSt-Wirtschaftswissenschaftliches Studium 42, no. 3 (2013): 134–40.' ieee: B. M. Gilroy and B. T. D. Nguyen, “Ist Fairer Handel Wirklich Fair?,” WiSt-Wirtschaftswissenschaftliches Studium, vol. 42, no. 3, pp. 134–140, 2013. mla: Gilroy, Bernard Michael, and Birke Thuy Duong Nguyen. “Ist Fairer Handel Wirklich Fair?” WiSt-Wirtschaftswissenschaftliches Studium, vol. 42, no. 3, Verlag Franz Vahlen GmbH, 2013, pp. 134–40. short: B.M. Gilroy, B.T.D. Nguyen, WiSt-Wirtschaftswissenschaftliches Studium 42 (2013) 134–140. date_created: 2018-10-31T08:01:49Z date_updated: 2022-01-06T07:01:38Z department: - _id: '203' intvolume: ' 42' issue: '3' language: - iso: eng page: 134-140 publication: WiSt-Wirtschaftswissenschaftliches Studium publisher: Verlag Franz Vahlen GmbH status: public title: Ist Fairer Handel Wirklich Fair? type: journal_article user_id: '26589' volume: 42 year: '2013' ... --- _id: '5117' author: - first_name: Bernard Michael full_name: Gilroy, Bernard Michael id: '175' last_name: Gilroy - first_name: Heike full_name: Schreckenberg, Heike last_name: Schreckenberg - first_name: Volker full_name: Seiler, Volker last_name: Seiler citation: ama: Gilroy BM, Schreckenberg H, Seiler V. Water as an Alternative Asset.; 2013. apa: Gilroy, B. M., Schreckenberg, H., & Seiler, V. (2013). Water as an alternative asset. bibtex: '@book{Gilroy_Schreckenberg_Seiler_2013, title={Water as an alternative asset}, author={Gilroy, Bernard Michael and Schreckenberg, Heike and Seiler, Volker}, year={2013} }' chicago: Gilroy, Bernard Michael, Heike Schreckenberg, and Volker Seiler. Water as an Alternative Asset, 2013. ieee: B. M. Gilroy, H. Schreckenberg, and V. Seiler, Water as an alternative asset. 2013. mla: Gilroy, Bernard Michael, et al. Water as an Alternative Asset. 2013. short: B.M. Gilroy, H. Schreckenberg, V. Seiler, Water as an Alternative Asset, 2013. date_created: 2018-10-31T08:06:28Z date_updated: 2022-01-06T07:01:38Z department: - _id: '203' language: - iso: eng status: public title: Water as an alternative asset type: working_paper user_id: '26589' year: '2013' ... --- _id: '512' author: - first_name: Elvira full_name: Herzog, Elvira last_name: Herzog citation: ama: Herzog E. Lösungsverfahren für das many-to-one Matching Problem. Universität Paderborn; 2013. apa: Herzog, E. (2013). Lösungsverfahren für das many-to-one Matching Problem. Universität Paderborn. bibtex: '@book{Herzog_2013, title={Lösungsverfahren für das many-to-one Matching Problem}, publisher={Universität Paderborn}, author={Herzog, Elvira}, year={2013} }' chicago: Herzog, Elvira. Lösungsverfahren für das many-to-one Matching Problem. Universität Paderborn, 2013. ieee: E. Herzog, Lösungsverfahren für das many-to-one Matching Problem. Universität Paderborn, 2013. mla: Herzog, Elvira. Lösungsverfahren für das many-to-one Matching Problem. Universität Paderborn, 2013. short: E. Herzog, Lösungsverfahren für das many-to-one Matching Problem, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:32Z date_updated: 2022-01-06T07:01:38Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: Lösungsverfahren für das many-to-one Matching Problem type: bachelorsthesis user_id: '477' year: '2013' ... --- _id: '513' abstract: - lang: eng text: 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. author: - first_name: Chen full_name: Avin, Chen last_name: Avin - first_name: Bernhard full_name: Häupler, Bernhard last_name: Häupler - first_name: Zvi full_name: Lotker, Zvi last_name: Lotker - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid citation: ama: 'Avin C, Häupler B, Lotker Z, Scheideler C, Schmid S. Locally Self-Adjusting Tree Networks. In: Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS). ; 2013:395-406. doi:10.1109/IPDPS.2013.40' apa: Avin, C., Häupler, B., Lotker, Z., Scheideler, C., & Schmid, S. (2013). Locally Self-Adjusting Tree Networks. In Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 395–406). https://doi.org/10.1109/IPDPS.2013.40 bibtex: '@inproceedings{Avin_Häupler_Lotker_Scheideler_Schmid_2013, title={Locally Self-Adjusting Tree Networks}, DOI={10.1109/IPDPS.2013.40}, booktitle={Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Avin, Chen and Häupler, Bernhard and Lotker, Zvi and Scheideler, Christian and Schmid, Stefan}, year={2013}, pages={395–406} }' chicago: Avin, Chen, Bernhard Häupler, Zvi Lotker, Christian Scheideler, and Stefan Schmid. “Locally Self-Adjusting Tree Networks.” In Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 395–406, 2013. https://doi.org/10.1109/IPDPS.2013.40. ieee: C. Avin, B. Häupler, Z. Lotker, C. Scheideler, and S. Schmid, “Locally Self-Adjusting Tree Networks,” in Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013, pp. 395–406. mla: Avin, Chen, et al. “Locally Self-Adjusting Tree Networks.” Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013, pp. 395–406, doi:10.1109/IPDPS.2013.40. short: 'C. Avin, B. Häupler, Z. Lotker, C. Scheideler, S. Schmid, in: Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013, pp. 395–406.' date_created: 2017-10-17T12:42:32Z date_updated: 2022-01-06T07:01:38Z ddc: - '040' department: - _id: '79' doi: 10.1109/IPDPS.2013.40 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:45:15Z date_updated: 2018-03-15T10:45:15Z file_id: '1303' file_name: 513-ipdps13_01.pdf file_size: 518804 relation: main_file success: 1 file_date_updated: 2018-03-15T10:45:15Z has_accepted_license: '1' page: 395-406 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS) status: public title: Locally Self-Adjusting Tree Networks type: conference user_id: '15504' year: '2013' ... --- _id: '514' abstract: - lang: eng text: 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. author: - first_name: Peter full_name: Pietrzyk, Peter last_name: Pietrzyk citation: ama: Pietrzyk P. Local and Online Algorithms for Facility Location. Universität Paderborn; 2013. apa: Pietrzyk, P. (2013). Local and Online Algorithms for Facility Location. Universität Paderborn. bibtex: '@book{Pietrzyk_2013, title={Local and Online Algorithms for Facility Location}, publisher={Universität Paderborn}, author={Pietrzyk, Peter}, year={2013} }' chicago: Pietrzyk, Peter. Local and Online Algorithms for Facility Location. Universität Paderborn, 2013. ieee: P. Pietrzyk, Local and Online Algorithms for Facility Location. Universität Paderborn, 2013. mla: Pietrzyk, Peter. Local and Online Algorithms for Facility Location. Universität Paderborn, 2013. short: P. Pietrzyk, Local and Online Algorithms for Facility Location, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:32Z date_updated: 2022-01-06T07:01:38Z ddc: - '040' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:44:13Z date_updated: 2018-03-15T10:44:13Z file_id: '1302' file_name: 514-DissertationPietrzyk.pdf file_size: 790821 relation: main_file success: 1 file_date_updated: 2018-03-15T10:44:13Z has_accepted_license: '1' project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Local and Online Algorithms for Facility Location type: dissertation user_id: '477' year: '2013' ... --- _id: '5144' author: - first_name: Volker full_name: Seiler, Volker last_name: Seiler - first_name: Markus full_name: Rudolf, Markus last_name: Rudolf - first_name: Tim full_name: Krume, Tim last_name: Krume citation: ama: Seiler V, Rudolf M, Krume T. The influence of socio-demographic variables on customer satisfaction and loyalty in the private banking industry. International Journal of Bank Marketing. 2013;31(4):235-258. apa: Seiler, V., Rudolf, M., & Krume, T. (2013). The influence of socio-demographic variables on customer satisfaction and loyalty in the private banking industry. International Journal of Bank Marketing, 31(4), 235–258. bibtex: '@article{Seiler_Rudolf_Krume_2013, title={The influence of socio-demographic variables on customer satisfaction and loyalty in the private banking industry}, volume={31}, number={4}, journal={International Journal of Bank Marketing}, publisher={Emerald Group Publishing Limited}, author={Seiler, Volker and Rudolf, Markus and Krume, Tim}, year={2013}, pages={235–258} }' chicago: 'Seiler, Volker, Markus Rudolf, and Tim Krume. “The Influence of Socio-Demographic Variables on Customer Satisfaction and Loyalty in the Private Banking Industry.” International Journal of Bank Marketing 31, no. 4 (2013): 235–58.' ieee: V. Seiler, M. Rudolf, and T. Krume, “The influence of socio-demographic variables on customer satisfaction and loyalty in the private banking industry,” International Journal of Bank Marketing, vol. 31, no. 4, pp. 235–258, 2013. mla: Seiler, Volker, et al. “The Influence of Socio-Demographic Variables on Customer Satisfaction and Loyalty in the Private Banking Industry.” International Journal of Bank Marketing, vol. 31, no. 4, Emerald Group Publishing Limited, 2013, pp. 235–58. short: V. Seiler, M. Rudolf, T. Krume, International Journal of Bank Marketing 31 (2013) 235–258. date_created: 2018-10-31T09:15:20Z date_updated: 2022-01-06T07:01:38Z intvolume: ' 31' issue: '4' page: 235-258 publication: International Journal of Bank Marketing publisher: Emerald Group Publishing Limited status: public title: The influence of socio-demographic variables on customer satisfaction and loyalty in the private banking industry type: journal_article user_id: '26589' volume: 31 year: '2013' ... --- _id: '5146' abstract: - lang: eng text: 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). author: - first_name: Sonja full_name: Brangewitz, Sonja last_name: Brangewitz - first_name: Claus-Jochen full_name: Haake, Claus-Jochen id: '20801' last_name: Haake citation: ama: Brangewitz S, Haake C-J. Cooperative Transfer Price Negotiations under Incomplete Information. Vol 64. CIE Working Paper Series, Paderborn University; 2013. apa: Brangewitz, S., & Haake, C.-J. (2013). Cooperative Transfer Price Negotiations under Incomplete Information (Vol. 64). CIE Working Paper Series, Paderborn University. bibtex: '@book{Brangewitz_Haake_2013, series={Working Papers CIE}, title={Cooperative Transfer Price Negotiations under Incomplete Information}, volume={64}, publisher={CIE Working Paper Series, Paderborn University}, author={Brangewitz, Sonja and Haake, Claus-Jochen}, year={2013}, collection={Working Papers CIE} }' chicago: Brangewitz, Sonja, and Claus-Jochen Haake. Cooperative Transfer Price Negotiations under Incomplete Information. Vol. 64. Working Papers CIE. CIE Working Paper Series, Paderborn University, 2013. ieee: S. Brangewitz and C.-J. Haake, Cooperative Transfer Price Negotiations under Incomplete Information, vol. 64. CIE Working Paper Series, Paderborn University, 2013. mla: Brangewitz, Sonja, and Claus-Jochen Haake. Cooperative Transfer Price Negotiations under Incomplete Information. Vol. 64, CIE Working Paper Series, Paderborn University, 2013. short: S. Brangewitz, C.-J. Haake, Cooperative Transfer Price Negotiations under Incomplete Information, CIE Working Paper Series, Paderborn University, 2013. date_created: 2018-10-31T09:20:15Z date_updated: 2022-01-06T07:01:39Z ddc: - '040' department: - _id: '205' - _id: '475' file: - access_level: closed content_type: application/pdf creator: stela date_created: 2018-10-31T09:22:19Z date_updated: 2018-10-31T09:22:19Z file_id: '5148' file_name: WP - Cooperative Transfer Price Negotiations under Incomplete Information.pdf file_size: 430826 relation: main_file success: 1 file_date_updated: 2018-10-31T09:22:19Z has_accepted_license: '1' intvolume: ' 64' keyword: - Transfer Pricing - Negotiation - Generalized Nash Bargaining Solution - Incomplete Information language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: CIE Working Paper Series, Paderborn University series_title: Working Papers CIE status: public title: Cooperative Transfer Price Negotiations under Incomplete Information type: working_paper user_id: '477' volume: 64 year: '2013' ... --- _id: '515' abstract: - lang: eng text: 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. author: - first_name: Alexander full_name: Jungmann, Alexander last_name: Jungmann - first_name: Bernd full_name: Kleinjohann, Bernd last_name: Kleinjohann - first_name: Elisabeth full_name: Kleinjohann, Elisabeth id: '15588' last_name: Kleinjohann citation: ama: Jungmann A, Kleinjohann B, Kleinjohann E. Learning Service Recommendations. International Journal of Business Process Integration and Management. 2013;(4):284-297. doi:10.1504/IJBPIM.2013.059135 apa: Jungmann, A., Kleinjohann, B., & Kleinjohann, E. (2013). Learning Service Recommendations. International Journal of Business Process Integration and Management, (4), 284–297. https://doi.org/10.1504/IJBPIM.2013.059135 bibtex: '@article{Jungmann_Kleinjohann_Kleinjohann_2013, title={Learning Service Recommendations}, DOI={10.1504/IJBPIM.2013.059135}, number={4}, journal={International Journal of Business Process Integration and Management}, publisher={InderScience}, author={Jungmann, Alexander and Kleinjohann, Bernd and Kleinjohann, Elisabeth}, year={2013}, pages={284–297} }' chicago: 'Jungmann, Alexander, Bernd Kleinjohann, and Elisabeth Kleinjohann. “Learning Service Recommendations.” International Journal of Business Process Integration and Management, no. 4 (2013): 284–97. https://doi.org/10.1504/IJBPIM.2013.059135.' ieee: A. Jungmann, B. Kleinjohann, and E. Kleinjohann, “Learning Service Recommendations,” International Journal of Business Process Integration and Management, no. 4, pp. 284–297, 2013. mla: Jungmann, Alexander, et al. “Learning Service Recommendations.” International Journal of Business Process Integration and Management, no. 4, InderScience, 2013, pp. 284–97, doi:10.1504/IJBPIM.2013.059135. short: A. Jungmann, B. Kleinjohann, E. Kleinjohann, International Journal of Business Process Integration and Management (2013) 284–297. date_created: 2017-10-17T12:42:32Z date_updated: 2022-01-06T07:01:39Z ddc: - '040' doi: 10.1504/IJBPIM.2013.059135 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:43:38Z date_updated: 2018-03-15T10:43:38Z file_id: '1301' file_name: 515-IJBPIM060402_JUNGMANN.pdf file_size: 5301831 relation: main_file success: 1 file_date_updated: 2018-03-15T10:43:38Z has_accepted_license: '1' issue: '4' main_file_link: - url: http://www.inderscience.com/offer.php?id=59135 page: 284-297 project: - _id: '1' name: SFB 901 - _id: '10' name: SFB 901 - Subprojekt B2 - _id: '3' name: SFB 901 - Project Area B publication: International Journal of Business Process Integration and Management publisher: InderScience status: public title: Learning Service Recommendations type: journal_article user_id: '477' year: '2013' ... --- _id: '516' abstract: - lang: eng text: '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. ' author: - first_name: Alexander full_name: Jungmann, Alexander last_name: Jungmann - first_name: Bernd full_name: Kleinjohann, Bernd last_name: Kleinjohann citation: ama: 'Jungmann A, Kleinjohann B. Learning Recommendation System for Automated Service Composition. In: Proceedings of the 10th IEEE International Conference on Services Computing (SCC). ; 2013:97-104. doi:10.1109/SCC.2013.66' apa: Jungmann, A., & Kleinjohann, B. (2013). Learning Recommendation System for Automated Service Composition. In Proceedings of the 10th IEEE International Conference on Services Computing (SCC) (pp. 97–104). https://doi.org/10.1109/SCC.2013.66 bibtex: '@inproceedings{Jungmann_Kleinjohann_2013, title={Learning Recommendation System for Automated Service Composition}, DOI={10.1109/SCC.2013.66}, booktitle={Proceedings of the 10th IEEE International Conference on Services Computing (SCC)}, author={Jungmann, Alexander and Kleinjohann, Bernd}, year={2013}, pages={97–104} }' chicago: Jungmann, Alexander, and Bernd Kleinjohann. “Learning Recommendation System for Automated Service Composition.” In Proceedings of the 10th IEEE International Conference on Services Computing (SCC), 97–104, 2013. https://doi.org/10.1109/SCC.2013.66. ieee: A. Jungmann and B. Kleinjohann, “Learning Recommendation System for Automated Service Composition,” in Proceedings of the 10th IEEE International Conference on Services Computing (SCC), 2013, pp. 97–104. mla: Jungmann, Alexander, and Bernd Kleinjohann. “Learning Recommendation System for Automated Service Composition.” Proceedings of the 10th IEEE International Conference on Services Computing (SCC), 2013, pp. 97–104, doi:10.1109/SCC.2013.66. short: 'A. Jungmann, B. Kleinjohann, in: Proceedings of the 10th IEEE International Conference on Services Computing (SCC), 2013, pp. 97–104.' date_created: 2017-10-17T12:42:33Z date_updated: 2022-01-06T07:01:40Z ddc: - '040' doi: 10.1109/SCC.2013.66 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:43:03Z date_updated: 2018-03-15T10:43:03Z file_id: '1300' file_name: 516-manuscript.pdf file_size: 1762714 relation: main_file success: 1 file_date_updated: 2018-03-15T10:43:03Z has_accepted_license: '1' page: 97-104 project: - _id: '1' name: SFB 901 - _id: '10' name: SFB 901 - Subprojekt B2 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 10th IEEE International Conference on Services Computing (SCC) status: public title: Learning Recommendation System for Automated Service Composition type: conference user_id: '15504' year: '2013' ... --- _id: '517' abstract: - lang: eng text: 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. author: - first_name: Sven full_name: Walther, Sven last_name: Walther - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Walther S, Wehrheim H. Knowledge-Based Verification of Service Compositions - An SMT approach. In: Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS). ; 2013:24-32. doi:10.1109/ICECCS.2013.14' apa: Walther, S., & Wehrheim, H. (2013). Knowledge-Based Verification of Service Compositions - An SMT approach. In Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS) (pp. 24–32). https://doi.org/10.1109/ICECCS.2013.14 bibtex: '@inproceedings{Walther_Wehrheim_2013, title={Knowledge-Based Verification of Service Compositions - An SMT approach}, DOI={10.1109/ICECCS.2013.14}, booktitle={Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS)}, author={Walther, Sven and Wehrheim, Heike}, year={2013}, pages={24–32} }' chicago: Walther, Sven, and Heike Wehrheim. “Knowledge-Based Verification of Service Compositions - An SMT Approach.” In Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS), 24–32, 2013. https://doi.org/10.1109/ICECCS.2013.14. ieee: S. Walther and H. Wehrheim, “Knowledge-Based Verification of Service Compositions - An SMT approach,” in Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS), 2013, pp. 24–32. mla: Walther, Sven, and Heike Wehrheim. “Knowledge-Based Verification of Service Compositions - An SMT Approach.” Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS), 2013, pp. 24–32, doi:10.1109/ICECCS.2013.14. short: 'S. Walther, H. Wehrheim, in: Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS), 2013, pp. 24–32.' date_created: 2017-10-17T12:42:33Z date_updated: 2022-01-06T07:01:41Z ddc: - '000' department: - _id: '77' doi: 10.1109/ICECCS.2013.14 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T13:26:08Z date_updated: 2018-11-02T13:26:08Z file_id: '5248' file_name: 06601801.pdf file_size: 217085 relation: main_file file_date_updated: 2018-11-02T13:26:08Z has_accepted_license: '1' language: - iso: eng page: '24 - 32 ' project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS) status: public title: Knowledge-Based Verification of Service Compositions - An SMT approach type: conference user_id: '477' year: '2013' ... --- _id: '5172' author: - first_name: Sönke full_name: Sievers, Sönke id: '46447' last_name: Sievers citation: ama: 'Sievers S. Company Valuation and Growth: Theory, Empirical Evidence and Practical Implementation Issues. Verlag-Haus Monsenstein und Vannerdat; 2013.' apa: 'Sievers, S. (2013). Company Valuation and Growth: Theory, Empirical Evidence and Practical Implementation Issues. Verlag-Haus Monsenstein und Vannerdat.' bibtex: '@book{Sievers_2013, title={Company Valuation and Growth: Theory, Empirical Evidence and Practical Implementation Issues}, publisher={Verlag-Haus Monsenstein und Vannerdat}, author={Sievers, Sönke}, year={2013} }' chicago: 'Sievers, Sönke. Company Valuation and Growth: Theory, Empirical Evidence and Practical Implementation Issues. Verlag-Haus Monsenstein und Vannerdat, 2013.' ieee: 'S. Sievers, Company Valuation and Growth: Theory, Empirical Evidence and Practical Implementation Issues. Verlag-Haus Monsenstein und Vannerdat, 2013.' mla: 'Sievers, Sönke. Company Valuation and Growth: Theory, Empirical Evidence and Practical Implementation Issues. Verlag-Haus Monsenstein und Vannerdat, 2013.' short: 'S. Sievers, Company Valuation and Growth: Theory, Empirical Evidence and Practical Implementation Issues, Verlag-Haus Monsenstein und Vannerdat, 2013.' date_created: 2018-10-31T10:10:35Z date_updated: 2022-01-06T07:01:41Z department: - _id: '275' keyword: - Unternehmensbewertung - Unternehmenswachstum - Return on Investment Unternehmensbewertung - Investition - Steuervergünstigung language: - iso: eng publication_identifier: isbn: - 978-3-86582-925-2 publication_status: published publisher: Verlag-Haus Monsenstein und Vannerdat status: public title: 'Company Valuation and Growth: Theory, Empirical Evidence and Practical Implementation Issues' type: book user_id: '64756' year: '2013' ... --- _id: '518' author: - first_name: Vanessa full_name: Petrausch, Vanessa last_name: Petrausch citation: ama: Petrausch V. Klassifizierung unterschiedlicher Ansätze zum Matching von Services. Universität Paderborn; 2013. apa: Petrausch, V. (2013). Klassifizierung unterschiedlicher Ansätze zum Matching von Services. Universität Paderborn. bibtex: '@book{Petrausch_2013, title={Klassifizierung unterschiedlicher Ansätze zum Matching von Services}, publisher={Universität Paderborn}, author={Petrausch, Vanessa}, year={2013} }' chicago: Petrausch, Vanessa. Klassifizierung unterschiedlicher Ansätze zum Matching von Services. Universität Paderborn, 2013. ieee: V. Petrausch, Klassifizierung unterschiedlicher Ansätze zum Matching von Services. Universität Paderborn, 2013. mla: Petrausch, Vanessa. Klassifizierung unterschiedlicher Ansätze zum Matching von Services. Universität Paderborn, 2013. short: V. Petrausch, Klassifizierung unterschiedlicher Ansätze zum Matching von Services, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:33Z date_updated: 2022-01-06T07:01:41Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '9' name: SFB 901 - Subprojekt B1 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public title: Klassifizierung unterschiedlicher Ansätze zum Matching von Services type: bachelorsthesis user_id: '477' year: '2013' ... --- _id: '519' abstract: - lang: eng text: 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. author: - first_name: Martina full_name: Eikel, Martina last_name: Eikel - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Eikel M, Scheideler C. IRIS: A Robust Information System Against Insider DoS-Attacks. In: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ; 2013:119-129. doi:10.1145/2486159.2486186' apa: 'Eikel, M., & Scheideler, C. (2013). IRIS: A Robust Information System Against Insider DoS-Attacks. In Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 119–129). https://doi.org/10.1145/2486159.2486186' bibtex: '@inproceedings{Eikel_Scheideler_2013, title={IRIS: A Robust Information System Against Insider DoS-Attacks}, DOI={10.1145/2486159.2486186}, booktitle={Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Eikel, Martina and Scheideler, Christian}, year={2013}, pages={119–129} }' chicago: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS-Attacks.” In Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 119–29, 2013. https://doi.org/10.1145/2486159.2486186.' ieee: 'M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider DoS-Attacks,” in Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013, pp. 119–129.' mla: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS-Attacks.” Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013, pp. 119–29, doi:10.1145/2486159.2486186.' short: 'M. Eikel, C. Scheideler, in: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013, pp. 119–129.' date_created: 2017-10-17T12:42:33Z date_updated: 2022-01-06T07:01:42Z ddc: - '040' department: - _id: '79' doi: 10.1145/2486159.2486186 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:38:34Z date_updated: 2018-03-15T10:38:34Z file_id: '1299' file_name: 519-iris-spaa2013_01.pdf file_size: 554618 relation: main_file success: 1 file_date_updated: 2018-03-15T10:38:34Z has_accepted_license: '1' page: 119-129 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) status: public title: 'IRIS: A Robust Information System Against Insider DoS-Attacks' type: conference user_id: '15504' year: '2013' ...