[{"department":[{"_id":"275"}],"publication_status":"published","title":"The relevance of financial versus non-financial information for the valuation of venture capital-backed firms","related_material":{"link":[{"relation":"earlier_version","url":"http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1449740"}]},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:43Z","doi":"10.1080/09638180.2012.741051","author":[{"full_name":"Sievers, Sönke","first_name":"Sönke","id":"46447","last_name":"Sievers"},{"last_name":"Mokwa","first_name":"Christopher F","full_name":"Mokwa, Christopher F"},{"first_name":"Georg","full_name":"Keienburg, Georg","last_name":"Keienburg"}],"quality_controlled":"1","publisher":"Taylor \\& Francis","keyword":["value relevance","equity valuation","venture capital","human capital","start-ups"],"publication":"European Accounting Review (VHB-JOURQUAL 3 Ranking A)","jel":["G24","G32","M41"],"volume":22,"status":"public","date_created":"2018-10-31T11:27:42Z","extern":"1","article_type":"original","abstract":[{"lang":"eng","text":"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."}],"user_id":"46447","main_file_link":[{"url":"http://www.tandfonline.com/doi/full/10.1080/09638180.2012.741051"}],"year":"2013","citation":{"ieee":"S. Sievers, C. F. Mokwa, and G. Keienburg, “The relevance of financial versus non-financial information for the valuation of venture capital-backed firms,” European Accounting Review (VHB-JOURQUAL 3 Ranking A), vol. 22, no. 3, pp. 467–511, 2013.","short":"S. Sievers, C.F. Mokwa, G. Keienburg, European Accounting Review (VHB-JOURQUAL 3 Ranking A) 22 (2013) 467–511.","bibtex":"@article{Sievers_Mokwa_Keienburg_2013, title={The relevance of financial versus non-financial information for the valuation of venture capital-backed firms}, volume={22}, DOI={10.1080/09638180.2012.741051}, number={3}, journal={European Accounting Review (VHB-JOURQUAL 3 Ranking A)}, publisher={Taylor \\& Francis}, author={Sievers, Sönke and Mokwa, Christopher F and Keienburg, Georg}, year={2013}, pages={467–511} }","mla":"Sievers, Sönke, et al. “The Relevance of Financial versus Non-Financial Information for the Valuation of Venture Capital-Backed Firms.” European Accounting Review (VHB-JOURQUAL 3 Ranking A), vol. 22, no. 3, Taylor \\& Francis, 2013, pp. 467–511, doi:10.1080/09638180.2012.741051.","ama":"Sievers S, Mokwa CF, Keienburg G. The relevance of financial versus non-financial information for the valuation of venture capital-backed firms. European Accounting Review (VHB-JOURQUAL 3 Ranking A). 2013;22(3):467-511. doi:10.1080/09638180.2012.741051","apa":"Sievers, S., Mokwa, C. F., & Keienburg, G. (2013). The relevance of financial versus non-financial information for the valuation of venture capital-backed firms. European Accounting Review (VHB-JOURQUAL 3 Ranking A), 22(3), 467–511. https://doi.org/10.1080/09638180.2012.741051","chicago":"Sievers, Sönke, Christopher F Mokwa, and Georg Keienburg. “The Relevance of Financial versus Non-Financial Information for the Valuation of Venture Capital-Backed Firms.” European Accounting Review (VHB-JOURQUAL 3 Ranking A) 22, no. 3 (2013): 467–511. https://doi.org/10.1080/09638180.2012.741051."},"type":"journal_article","page":"467-511","_id":"5191","intvolume":" 22","issue":"3"},{"jel":["G11","G12","G17","G33"],"volume":83,"status":"public","date_created":"2018-10-31T11:31:56Z","author":[{"last_name":"Klobucnik","first_name":"Jan","full_name":"Klobucnik, Jan"},{"last_name":"Sievers","id":"46447","first_name":"Sönke","full_name":"Sievers, Sönke"}],"publisher":"Springer","quality_controlled":"1","keyword":["Schwartz-Moon model","Market mispricing","Empirical test","Company valuation","Trading strategy"],"publication":"Journal of Business Economics (VHB-JOURQUAL 3 Ranking B)","user_id":"46447","extern":"1","article_type":"original","abstract":[{"text":"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.","lang":"eng"}],"type":"journal_article","citation":{"mla":"Klobucnik, Jan, and Sönke Sievers. “Valuing High Technology Growth Firms.” Journal of Business Economics (VHB-JOURQUAL 3 Ranking B), vol. 83, no. 9, Springer, 2013, pp. 947–84, doi:https://doi.org/10.1007/s11573-013-0684-2.","bibtex":"@article{Klobucnik_Sievers_2013, title={Valuing high technology growth firms}, volume={83}, DOI={https://doi.org/10.1007/s11573-013-0684-2}, number={9}, journal={Journal of Business Economics (VHB-JOURQUAL 3 Ranking B)}, publisher={Springer}, author={Klobucnik, Jan and Sievers, Sönke}, year={2013}, pages={947–984} }","chicago":"Klobucnik, Jan, and Sönke Sievers. “Valuing High Technology Growth Firms.” Journal of Business Economics (VHB-JOURQUAL 3 Ranking B) 83, no. 9 (2013): 947–84. https://doi.org/10.1007/s11573-013-0684-2.","ama":"Klobucnik J, Sievers S. Valuing high technology growth firms. Journal of Business Economics (VHB-JOURQUAL 3 Ranking B). 2013;83(9):947-984. doi:https://doi.org/10.1007/s11573-013-0684-2","apa":"Klobucnik, J., & Sievers, S. (2013). Valuing high technology growth firms. Journal of Business Economics (VHB-JOURQUAL 3 Ranking B), 83(9), 947–984. https://doi.org/10.1007/s11573-013-0684-2","ieee":"J. Klobucnik and S. Sievers, “Valuing high technology growth firms,” Journal of Business Economics (VHB-JOURQUAL 3 Ranking B), vol. 83, no. 9, pp. 947–984, 2013.","short":"J. Klobucnik, S. Sievers, Journal of Business Economics (VHB-JOURQUAL 3 Ranking B) 83 (2013) 947–984."},"year":"2013","page":"947-984","main_file_link":[{"url":"https://link.springer.com/article/10.1007/s11573-013-0684-2"}],"issue":"9","_id":"5192","intvolume":" 83","publication_status":"published","department":[{"_id":"275"}],"title":"Valuing high technology growth firms","language":[{"iso":"eng"}],"doi":"https://doi.org/10.1007/s11573-013-0684-2","date_updated":"2022-01-06T07:01:43Z"},{"date_updated":"2022-01-06T07:01:43Z","doi":"10.1109/INFCOMW.2013.6970733","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"title":"Incorporating feedback from application layer into routing and wavelength assignment algorithms","main_file_link":[{"url":"http://ieeexplore.ieee.org/document/6970733/"}],"type":"conference","citation":{"ieee":"P. Wette and H. Karl, “Incorporating feedback from application layer into routing and wavelength assignment algorithms,” in Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 51–52.","short":"P. Wette, H. Karl, in: Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 51–52.","mla":"Wette, Philip, and Holger Karl. “Incorporating Feedback from Application Layer into Routing and Wavelength Assignment Algorithms.” Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 51–52, doi:10.1109/INFCOMW.2013.6970733.","bibtex":"@inproceedings{Wette_Karl_2013, title={Incorporating feedback from application layer into routing and wavelength assignment algorithms}, DOI={10.1109/INFCOMW.2013.6970733}, booktitle={Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)}, author={Wette, Philip and Karl, Holger}, year={2013}, pages={51–52} }","ama":"Wette P, Karl H. Incorporating feedback from application layer into routing and wavelength assignment algorithms. In: Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM). ; 2013:51-52. doi:10.1109/INFCOMW.2013.6970733","apa":"Wette, P., & Karl, H. (2013). Incorporating feedback from application layer into routing and wavelength assignment algorithms. In Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM) (pp. 51–52). https://doi.org/10.1109/INFCOMW.2013.6970733","chicago":"Wette, Philip, and Holger Karl. “Incorporating Feedback from Application Layer into Routing and Wavelength Assignment Algorithms.” In Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 51–52, 2013. https://doi.org/10.1109/INFCOMW.2013.6970733."},"year":"2013","page":"51-52","_id":"520","author":[{"last_name":"Wette","first_name":"Philip","full_name":"Wette, Philip"},{"full_name":"Karl, Holger","first_name":"Holger","id":"126","last_name":"Karl"}],"file_date_updated":"2018-03-15T10:38:04Z","publication":"Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)","file":[{"file_size":131502,"creator":"florida","file_id":"1298","content_type":"application/pdf","date_updated":"2018-03-15T10:38:04Z","relation":"main_file","success":1,"date_created":"2018-03-15T10:38:04Z","file_name":"520-wetteinfocom2013.pdf","access_level":"closed"}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:33Z","abstract":[{"text":"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.","lang":"eng"}],"ddc":["040"],"user_id":"15504"},{"author":[{"first_name":"Sönke","full_name":"Sievers, Sönke","last_name":"Sievers","id":"46447"},{"full_name":"Schlüter, Tobias","first_name":"Tobias","last_name":"Schlüter"},{"first_name":"Thomas","full_name":"Hartmann-Wendels, Thomas","last_name":"Hartmann-Wendels"}],"publication":"Börsen-Zeitung","department":[{"_id":"275"}],"publication_status":"published","status":"public","date_created":"2018-10-31T12:29:38Z","title":"Die erfolgreiche Bindung des Sparers an die Bank","user_id":"46447","main_file_link":[{"url":"https://www.boersen-zeitung.de/index.php?li=1&artid=2013018054&titel=Die-erfolgreiche-Bindung-des-Sparers-an-die-Bank"}],"citation":{"bibtex":"@article{Sievers_Schlüter_Hartmann-Wendels_2013, title={Die erfolgreiche Bindung des Sparers an die Bank}, journal={Börsen-Zeitung}, author={Sievers, Sönke and Schlüter, Tobias and Hartmann-Wendels, Thomas}, year={2013} }","mla":"Sievers, Sönke, et al. “Die erfolgreiche Bindung des Sparers an die Bank.” Börsen-Zeitung, 2013.","chicago":"Sievers, Sönke, Tobias Schlüter, and Thomas Hartmann-Wendels. “Die erfolgreiche Bindung des Sparers an die Bank.” Börsen-Zeitung, 2013.","apa":"Sievers, S., Schlüter, T., & Hartmann-Wendels, T. (2013). Die erfolgreiche Bindung des Sparers an die Bank. Börsen-Zeitung.","ama":"Sievers S, Schlüter T, Hartmann-Wendels T. Die erfolgreiche Bindung des Sparers an die Bank. Börsen-Zeitung. 2013.","ieee":"S. Sievers, T. Schlüter, and T. Hartmann-Wendels, “Die erfolgreiche Bindung des Sparers an die Bank,” Börsen-Zeitung, 2013.","short":"S. Sievers, T. Schlüter, T. Hartmann-Wendels, Börsen-Zeitung (2013)."},"year":"2013","type":"newspaper_article","language":[{"iso":"ger"}],"date_updated":"2022-01-06T07:01:43Z","_id":"5201","publication_date":"2013-01-10"},{"user_id":"46447","title":"Wie Banken Kostenvorteile weitergeben","department":[{"_id":"275"}],"publication":"Börsen-Zeitung","author":[{"full_name":"Sievers, Sönke","first_name":"Sönke","id":"46447","last_name":"Sievers"},{"last_name":"Hartmann-Wendels","first_name":"Thomas","full_name":"Hartmann-Wendels, Thomas"},{"last_name":"Busch","full_name":"Busch, Ramona","first_name":"Ramona"},{"full_name":"Schlüter, Tobias","first_name":"Tobias","last_name":"Schlüter"}],"date_created":"2018-10-31T12:32:09Z","status":"public","volume":6,"publication_status":"published","_id":"5202","intvolume":" 6","date_updated":"2022-01-06T07:01:43Z","publication_date":"2013-01-10","main_file_link":[{"url":"https://www.boersen-zeitung.de/index.php?li=1&artid=2013006066"}],"language":[{"iso":"ger"}],"page":"6","type":"newspaper_article","year":"2013","citation":{"short":"S. Sievers, T. Hartmann-Wendels, R. Busch, T. Schlüter, Börsen-Zeitung 6 (2013).","ieee":"S. Sievers, T. Hartmann-Wendels, R. Busch, and T. Schlüter, “Wie Banken Kostenvorteile weitergeben,” Börsen-Zeitung, vol. 6, 2013.","apa":"Sievers, S., Hartmann-Wendels, T., Busch, R., & Schlüter, T. (2013). Wie Banken Kostenvorteile weitergeben. Börsen-Zeitung.","ama":"Sievers S, Hartmann-Wendels T, Busch R, Schlüter T. Wie Banken Kostenvorteile weitergeben. Börsen-Zeitung. 2013.","chicago":"Sievers, Sönke, Thomas Hartmann-Wendels, Ramona Busch, and Tobias Schlüter. “Wie Banken Kostenvorteile weitergeben.” Börsen-Zeitung, 2013.","mla":"Sievers, Sönke, et al. “Wie Banken Kostenvorteile weitergeben.” Börsen-Zeitung, vol. 6, 2013.","bibtex":"@article{Sievers_Hartmann-Wendels_Busch_Schlüter_2013, title={Wie Banken Kostenvorteile weitergeben}, volume={6}, journal={Börsen-Zeitung}, author={Sievers, Sönke and Hartmann-Wendels, Thomas and Busch, Ramona and Schlüter, Tobias}, year={2013} }"}},{"citation":{"bibtex":"@book{Riebler_2013, title={Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs}, publisher={Universität Paderborn}, author={Riebler, Heinrich}, year={2013} }","mla":"Riebler, Heinrich. Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs. Universität Paderborn, 2013.","apa":"Riebler, H. (2013). Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs. Universität Paderborn.","ama":"Riebler H. Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs. Universität Paderborn; 2013.","chicago":"Riebler, Heinrich. Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs. Universität Paderborn, 2013.","ieee":"H. Riebler, Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs. Universität Paderborn, 2013.","short":"H. Riebler, Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs, Universität Paderborn, 2013."},"type":"mastersthesis","year":"2013","language":[{"iso":"ger"}],"date_updated":"2022-01-06T07:01:46Z","_id":"521","author":[{"full_name":"Riebler, Heinrich","first_name":"Heinrich","id":"8961","last_name":"Riebler"}],"publisher":"Universität Paderborn","department":[{"_id":"27"},{"_id":"518"}],"keyword":["coldboot"],"status":"public","date_created":"2017-10-17T12:42:34Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"}],"title":"Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs","user_id":"477"},{"date_updated":"2022-01-06T07:01:47Z","_id":"522","supervisor":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"year":"2013","citation":{"bibtex":"@book{Feldotto_2013, title={HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths}, publisher={Universität Paderborn}, author={Feldotto, Matthias}, year={2013} }","mla":"Feldotto, Matthias. HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. Universität Paderborn, 2013.","chicago":"Feldotto, Matthias. HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. Universität Paderborn, 2013.","ama":"Feldotto M. HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. Universität Paderborn; 2013.","apa":"Feldotto, M. (2013). HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. Universität Paderborn.","ieee":"M. Feldotto, HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. Universität Paderborn, 2013.","short":"M. Feldotto, HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths, Universität Paderborn, 2013."},"type":"mastersthesis","user_id":"14052","title":"HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths","date_created":"2017-10-17T12:42:34Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Teilprojekt A"},{"_id":"5","name":"SFB 901 - Subprojekt A1"}],"status":"public","department":[{"_id":"79"}],"author":[{"first_name":"Matthias","full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","last_name":"Feldotto","id":"14052"}],"publisher":"Universität Paderborn"},{"page":"2563-2586","type":"journal_article","year":"2013","citation":{"bibtex":"@article{Mavronicolas_Monien_Papadopoulou Lesta_2013, title={How many attackers can selfish defenders catch?}, volume={161}, DOI={10.1016/j.dam.2013.05.022}, number={16–17}, journal={Discrete Applied Mathematics}, publisher={Elsevier}, author={Mavronicolas, Marios and Monien, Burkhard and Papadopoulou Lesta, Vicky}, year={2013}, pages={2563–2586} }","mla":"Mavronicolas, Marios, et al. “How Many Attackers Can Selfish Defenders Catch?” Discrete Applied Mathematics, vol. 161, no. 16–17, Elsevier, 2013, pp. 2563–86, doi:10.1016/j.dam.2013.05.022.","apa":"Mavronicolas, M., Monien, B., & Papadopoulou Lesta, V. (2013). How many attackers can selfish defenders catch? Discrete Applied Mathematics, 161(16–17), 2563–2586. https://doi.org/10.1016/j.dam.2013.05.022","ama":"Mavronicolas M, Monien B, Papadopoulou Lesta V. How many attackers can selfish defenders catch? Discrete Applied Mathematics. 2013;161(16-17):2563-2586. doi:10.1016/j.dam.2013.05.022","chicago":"Mavronicolas, Marios, Burkhard Monien, and Vicky Papadopoulou Lesta. “How Many Attackers Can Selfish Defenders Catch?” Discrete Applied Mathematics 161, no. 16–17 (2013): 2563–86. https://doi.org/10.1016/j.dam.2013.05.022.","ieee":"M. Mavronicolas, B. Monien, and V. Papadopoulou Lesta, “How many attackers can selfish defenders catch?,” Discrete Applied Mathematics, vol. 161, no. 16–17, pp. 2563–2586, 2013.","short":"M. Mavronicolas, B. Monien, V. Papadopoulou Lesta, Discrete Applied Mathematics 161 (2013) 2563–2586."},"issue":"16-17","_id":"523","intvolume":" 161","date_created":"2017-10-17T12:42:34Z","has_accepted_license":"1","status":"public","volume":161,"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-03-15T10:37:35Z","creator":"florida","file_id":"1297","file_size":1127543,"access_level":"closed","date_created":"2018-03-15T10:37:35Z","file_name":"523-MMP13.pdf"}],"file_date_updated":"2018-03-15T10:37:35Z","publication":"Discrete Applied Mathematics","publisher":"Elsevier","author":[{"full_name":"Mavronicolas, Marios","first_name":"Marios","last_name":"Mavronicolas"},{"last_name":"Monien","full_name":"Monien, Burkhard","first_name":"Burkhard"},{"first_name":"Vicky","full_name":"Papadopoulou Lesta, Vicky","last_name":"Papadopoulou Lesta"}],"user_id":"42447","ddc":["040"],"abstract":[{"lang":"eng","text":"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."}],"language":[{"iso":"eng"}],"doi":"10.1016/j.dam.2013.05.022","date_updated":"2022-01-06T07:01:47Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"title":"How many attackers can selfish defenders catch?"},{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:48Z","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"external_id":{"arxiv":["1311.7229"]},"title":"Hierarchies in Local Distributed Decision","type":"preprint","year":"2013","citation":{"ieee":"F. Meyer auf der Heide and K. Swirkot, “Hierarchies in Local Distributed Decision.” arXiv, 2013.","short":"F. Meyer auf der Heide, K. Swirkot, (2013).","mla":"Meyer auf der Heide, Friedhelm, and Kamil Swirkot. Hierarchies in Local Distributed Decision. arXiv, 2013.","bibtex":"@article{Meyer auf der Heide_Swirkot_2013, title={Hierarchies in Local Distributed Decision}, publisher={arXiv}, author={Meyer auf der Heide, Friedhelm and Swirkot, Kamil}, year={2013} }","ama":"Meyer auf der Heide F, Swirkot K. Hierarchies in Local Distributed Decision. 2013.","apa":"Meyer auf der Heide, F., & Swirkot, K. (2013). Hierarchies in Local Distributed Decision. arXiv.","chicago":"Meyer auf der Heide, Friedhelm, and Kamil Swirkot. “Hierarchies in Local Distributed Decision.” arXiv, 2013."},"_id":"524","file":[{"date_updated":"2018-03-15T10:37:07Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":534906,"file_id":"1296","creator":"florida","access_level":"closed","date_created":"2018-03-15T10:37:07Z","file_name":"524-paper_01.pdf"}],"file_date_updated":"2018-03-15T10:37:07Z","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"first_name":"Kamil","full_name":"Swirkot, Kamil","last_name":"Swirkot"}],"publisher":"arXiv","date_created":"2017-10-17T12:42:34Z","status":"public","has_accepted_license":"1","abstract":[{"lang":"eng","text":"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."}],"user_id":"15415","ddc":["040"]},{"status":"public","date_created":"2017-10-17T12:42:34Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"author":[{"first_name":"Tim","full_name":"Niklas Vinkemeier, Tim","last_name":"Niklas Vinkemeier"}],"publisher":"Universität Paderborn","department":[{"_id":"75"}],"title":"Haptics - Hadoop performance testing in concurrent job scenarios","user_id":"15504","type":"bachelorsthesis","citation":{"bibtex":"@book{Niklas Vinkemeier_2013, title={Haptics - Hadoop performance testing in concurrent job scenarios}, publisher={Universität Paderborn}, author={Niklas Vinkemeier, Tim}, year={2013} }","mla":"Niklas Vinkemeier, Tim. Haptics - Hadoop Performance Testing in Concurrent Job Scenarios. Universität Paderborn, 2013.","apa":"Niklas Vinkemeier, T. (2013). Haptics - Hadoop performance testing in concurrent job scenarios. Universität Paderborn.","ama":"Niklas Vinkemeier T. Haptics - Hadoop Performance Testing in Concurrent Job Scenarios. Universität Paderborn; 2013.","chicago":"Niklas Vinkemeier, Tim. Haptics - Hadoop Performance Testing in Concurrent Job Scenarios. Universität Paderborn, 2013.","ieee":"T. Niklas Vinkemeier, Haptics - Hadoop performance testing in concurrent job scenarios. Universität Paderborn, 2013.","short":"T. Niklas Vinkemeier, Haptics - Hadoop Performance Testing in Concurrent Job Scenarios, Universität Paderborn, 2013."},"year":"2013","_id":"525","date_updated":"2022-01-06T07:01:48Z"},{"year":"2013","type":"mastersthesis","citation":{"apa":"Mäcker, A. (2013). Greedy Network Creation With Heavy And Light Edges. Universität Paderborn.","ama":"Mäcker A. Greedy Network Creation With Heavy And Light Edges. Universität Paderborn; 2013.","chicago":"Mäcker, Alexander. Greedy Network Creation With Heavy And Light Edges. Universität Paderborn, 2013.","bibtex":"@book{Mäcker_2013, title={Greedy Network Creation With Heavy And Light Edges}, publisher={Universität Paderborn}, author={Mäcker, Alexander}, year={2013} }","mla":"Mäcker, Alexander. Greedy Network Creation With Heavy And Light Edges. Universität Paderborn, 2013.","short":"A. Mäcker, Greedy Network Creation With Heavy And Light Edges, Universität Paderborn, 2013.","ieee":"A. Mäcker, Greedy Network Creation With Heavy And Light Edges. Universität Paderborn, 2013."},"_id":"526","date_updated":"2022-01-06T07:01:48Z","publisher":"Universität Paderborn","author":[{"first_name":"Alexander","full_name":"Mäcker, Alexander","last_name":"Mäcker","id":"13536"}],"status":"public","date_created":"2017-10-17T12:42:35Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"title":"Greedy Network Creation With Heavy And Light Edges","user_id":"15504"},{"doi":"10.1145/2491411.2492405","date_updated":"2022-01-06T07:01:48Z","language":[{"iso":"eng"}],"title":"Fuzzy Service Matching in On-The-Fly Computing","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"name":"SFB 901 - Project Area B","_id":"3"}],"department":[{"_id":"76"}],"_id":"527","type":"conference","year":"2013","citation":{"ieee":"M. Christin Platenius, “Fuzzy Service Matching in On-The-Fly Computing,” in 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), 2013, pp. 715–718.","short":"M. Christin Platenius, in: 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), 2013, pp. 715–718.","mla":"Christin Platenius, Marie. “Fuzzy Service Matching in On-The-Fly Computing.” 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), 2013, pp. 715–18, doi:10.1145/2491411.2492405.","bibtex":"@inproceedings{Christin Platenius_2013, title={Fuzzy Service Matching in On-The-Fly Computing}, DOI={10.1145/2491411.2492405}, booktitle={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)}, author={Christin Platenius, Marie}, year={2013}, pages={715–718} }","apa":"Christin Platenius, M. (2013). Fuzzy Service Matching in On-The-Fly Computing. In 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) (pp. 715–718). https://doi.org/10.1145/2491411.2492405","ama":"Christin Platenius M. Fuzzy Service Matching in On-The-Fly Computing. In: 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). ; 2013:715-718. doi:10.1145/2491411.2492405","chicago":"Christin Platenius, Marie. “Fuzzy Service Matching in On-The-Fly Computing.” In 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), 715–18, 2013. https://doi.org/10.1145/2491411.2492405."},"page":" 715-718 ","ddc":["040"],"user_id":"477","abstract":[{"text":"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. ","lang":"eng"}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:35Z","author":[{"first_name":"Marie","full_name":"Christin Platenius, Marie","last_name":"Christin Platenius"}],"file_date_updated":"2018-03-15T10:36:38Z","publication":"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)","file":[{"file_id":"1295","creator":"florida","file_size":730490,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-03-15T10:36:38Z","date_created":"2018-03-15T10:36:38Z","file_name":"527-p715-platenius.pdf","access_level":"closed"}]},{"_id":"529","date_updated":"2022-01-06T07:01:49Z","doi":"10.1145/2465449.2465452","type":"conference","year":"2013","citation":{"apa":"Heinzemann, C., & Becker, S. (2013). Executing Reconfigurations in Hierarchical Component Architectures. In Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE) (pp. 3–12). https://doi.org/10.1145/2465449.2465452","ama":"Heinzemann C, Becker S. Executing Reconfigurations in Hierarchical Component Architectures. In: Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE). ; 2013:3-12. doi:10.1145/2465449.2465452","chicago":"Heinzemann, Christian, and Steffen Becker. “Executing Reconfigurations in Hierarchical Component Architectures.” In Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE), 3–12, 2013. https://doi.org/10.1145/2465449.2465452.","mla":"Heinzemann, Christian, and Steffen Becker. “Executing Reconfigurations in Hierarchical Component Architectures.” Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE), 2013, pp. 3–12, doi:10.1145/2465449.2465452.","bibtex":"@inproceedings{Heinzemann_Becker_2013, title={Executing Reconfigurations in Hierarchical Component Architectures}, DOI={10.1145/2465449.2465452}, booktitle={Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE)}, author={Heinzemann, Christian and Becker, Steffen}, year={2013}, pages={3–12} }","short":"C. Heinzemann, S. Becker, in: Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE), 2013, pp. 3–12.","ieee":"C. Heinzemann and S. Becker, “Executing Reconfigurations in Hierarchical Component Architectures,” in Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE), 2013, pp. 3–12."},"page":"3-12","abstract":[{"lang":"eng","text":"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."}],"user_id":"15504","title":"Executing Reconfigurations in Hierarchical Component Architectures","ddc":["040"],"file":[{"access_level":"closed","date_created":"2018-03-15T10:35:39Z","file_name":"529-p3-heinzemann.pdf","content_type":"application/pdf","date_updated":"2018-03-15T10:35:39Z","success":1,"relation":"main_file","file_size":541849,"file_id":"1293","creator":"florida"}],"author":[{"last_name":"Heinzemann","first_name":"Christian","full_name":"Heinzemann, Christian"},{"full_name":"Becker, Steffen","first_name":"Steffen","last_name":"Becker"}],"publication":"Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE)","file_date_updated":"2018-03-15T10:35:39Z","has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:35Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"_id":"3","name":"SFB 901 - Project Area B"}]},{"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B2","_id":"10"},{"name":"SFB 901 - Project Area B","_id":"3"}],"date_created":"2017-10-17T12:42:35Z","author":[{"full_name":"Buse, Dominik","first_name":"Dominik","last_name":"Buse"}],"publisher":"Universität Paderborn","user_id":"15504","title":"Entwurf kooperativer Verhaltensweisen heterogener Roboter","type":"bachelorsthesis","year":"2013","citation":{"short":"D. Buse, Entwurf Kooperativer Verhaltensweisen Heterogener Roboter, Universität Paderborn, 2013.","ieee":"D. Buse, Entwurf kooperativer Verhaltensweisen heterogener Roboter. Universität Paderborn, 2013.","apa":"Buse, D. (2013). Entwurf kooperativer Verhaltensweisen heterogener Roboter. Universität Paderborn.","ama":"Buse D. Entwurf Kooperativer Verhaltensweisen Heterogener Roboter. Universität Paderborn; 2013.","chicago":"Buse, Dominik. Entwurf Kooperativer Verhaltensweisen Heterogener Roboter. Universität Paderborn, 2013.","bibtex":"@book{Buse_2013, title={Entwurf kooperativer Verhaltensweisen heterogener Roboter}, publisher={Universität Paderborn}, author={Buse, Dominik}, year={2013} }","mla":"Buse, Dominik. Entwurf Kooperativer Verhaltensweisen Heterogener Roboter. Universität Paderborn, 2013."},"date_updated":"2022-01-06T07:01:49Z","_id":"530"},{"_id":"531","date_updated":"2022-01-06T07:01:49Z","type":"mastersthesis","year":"2013","citation":{"ieee":"S. Lutters, Entwurf eines datenschutzgerechten Reputationssystems. Universität Paderborn, 2013.","short":"S. Lutters, Entwurf eines datenschutzgerechten Reputationssystems, Universität Paderborn, 2013.","bibtex":"@book{Lutters_2013, title={Entwurf eines datenschutzgerechten Reputationssystems}, publisher={Universität Paderborn}, author={Lutters, Sascha}, year={2013} }","mla":"Lutters, Sascha. Entwurf eines datenschutzgerechten Reputationssystems. Universität Paderborn, 2013.","apa":"Lutters, S. (2013). Entwurf eines datenschutzgerechten Reputationssystems. Universität Paderborn.","ama":"Lutters S. Entwurf eines datenschutzgerechten Reputationssystems. Universität Paderborn; 2013.","chicago":"Lutters, Sascha. Entwurf eines datenschutzgerechten Reputationssystems. Universität Paderborn, 2013."},"language":[{"iso":"ger"}],"title":"Entwurf eines datenschutzgerechten Reputationssystems","user_id":"477","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"date_created":"2017-10-17T12:42:35Z","author":[{"last_name":"Lutters","full_name":"Lutters, Sascha","first_name":"Sascha"}],"publisher":"Universität Paderborn"},{"status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"date_created":"2017-10-17T12:42:36Z","author":[{"full_name":"Hilleckes, Hendrik","first_name":"Hendrik","last_name":"Hilleckes"}],"publisher":"Universität Paderborn","title":"Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme","user_id":"477","year":"2013","citation":{"mla":"Hilleckes, Hendrik. Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme. Universität Paderborn, 2013.","bibtex":"@book{Hilleckes_2013, title={Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme}, publisher={Universität Paderborn}, author={Hilleckes, Hendrik}, year={2013} }","chicago":"Hilleckes, Hendrik. Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme. Universität Paderborn, 2013.","ama":"Hilleckes H. Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme. Universität Paderborn; 2013.","apa":"Hilleckes, H. (2013). Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme. Universität Paderborn.","ieee":"H. Hilleckes, Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme. Universität Paderborn, 2013.","short":"H. Hilleckes, Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme, Universität Paderborn, 2013."},"type":"bachelorsthesis","language":[{"iso":"ger"}],"_id":"532","date_updated":"2022-01-06T07:01:49Z"},{"language":[{"iso":"ger"}],"year":"2013","citation":{"ieee":"R. Borkowski, Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung. Universität Paderborn, 2013.","short":"R. Borkowski, Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung, Universität Paderborn, 2013.","mla":"Borkowski, Richard. Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung. Universität Paderborn, 2013.","bibtex":"@book{Borkowski_2013, title={Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung}, publisher={Universität Paderborn}, author={Borkowski, Richard}, year={2013} }","apa":"Borkowski, R. (2013). Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung. Universität Paderborn.","ama":"Borkowski R. Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung. Universität Paderborn; 2013.","chicago":"Borkowski, Richard. Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung. Universität Paderborn, 2013."},"type":"bachelorsthesis","date_updated":"2022-01-06T07:01:49Z","_id":"533","date_created":"2017-10-17T12:42:36Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B2","_id":"10"},{"_id":"3","name":"SFB 901 - Project Area B"}],"status":"public","author":[{"full_name":"Borkowski, Richard","first_name":"Richard","last_name":"Borkowski"}],"publisher":"Universität Paderborn","user_id":"477","title":"Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung"},{"author":[{"full_name":"Satya, Suhas","first_name":"Suhas","last_name":"Satya"}],"publisher":"Universität Paderborn","department":[{"_id":"75"}],"status":"public","date_created":"2017-10-17T12:42:36Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"title":"Emulating Wavelength Division Multiplexing using Openflow","user_id":"15504","citation":{"apa":"Satya, S. (2013). Emulating Wavelength Division Multiplexing using Openflow. Universität Paderborn.","ama":"Satya S. Emulating Wavelength Division Multiplexing Using Openflow. Universität Paderborn; 2013.","chicago":"Satya, Suhas. Emulating Wavelength Division Multiplexing Using Openflow. Universität Paderborn, 2013.","mla":"Satya, Suhas. Emulating Wavelength Division Multiplexing Using Openflow. Universität Paderborn, 2013.","bibtex":"@book{Satya_2013, title={Emulating Wavelength Division Multiplexing using Openflow}, publisher={Universität Paderborn}, author={Satya, Suhas}, year={2013} }","short":"S. Satya, Emulating Wavelength Division Multiplexing Using Openflow, Universität Paderborn, 2013.","ieee":"S. Satya, Emulating Wavelength Division Multiplexing using Openflow. Universität Paderborn, 2013."},"type":"mastersthesis","year":"2013","date_updated":"2022-01-06T07:01:50Z","_id":"534"},{"publisher":"Universität Paderborn","author":[{"first_name":"Max","full_name":"Reineke, Max","last_name":"Reineke"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2017-10-17T12:42:36Z","status":"public","title":"Effizienzsteigerung durch gewichtete Produktbewertungen","user_id":"477","citation":{"short":"M. Reineke, Effizienzsteigerung durch gewichtete Produktbewertungen, Universität Paderborn, 2013.","ieee":"M. Reineke, Effizienzsteigerung durch gewichtete Produktbewertungen. Universität Paderborn, 2013.","chicago":"Reineke, Max. Effizienzsteigerung durch gewichtete Produktbewertungen. Universität Paderborn, 2013.","apa":"Reineke, M. (2013). Effizienzsteigerung durch gewichtete Produktbewertungen. Universität Paderborn.","ama":"Reineke M. Effizienzsteigerung durch gewichtete Produktbewertungen. Universität Paderborn; 2013.","mla":"Reineke, Max. Effizienzsteigerung durch gewichtete Produktbewertungen. Universität Paderborn, 2013.","bibtex":"@book{Reineke_2013, title={Effizienzsteigerung durch gewichtete Produktbewertungen}, publisher={Universität Paderborn}, author={Reineke, Max}, year={2013} }"},"type":"mastersthesis","year":"2013","language":[{"iso":"ger"}],"_id":"535","date_updated":"2022-01-06T07:01:50Z"},{"date_updated":"2022-01-06T07:01:50Z","_id":"536","type":"mastersthesis","citation":{"short":"N. Stroh-Maraun, Dynamic One-to-One Matching: Theory and a Job Market Application, Universität Paderborn, 2013.","ieee":"N. Stroh-Maraun, Dynamic One-to-One Matching: Theory and a Job Market Application. Universität Paderborn, 2013.","apa":"Stroh-Maraun, N. (2013). Dynamic One-to-One Matching: Theory and a Job Market Application. Universität Paderborn.","ama":"Stroh-Maraun N. Dynamic One-to-One Matching: Theory and a Job Market Application. Universität Paderborn; 2013.","chicago":"Stroh-Maraun, Nadja. Dynamic One-to-One Matching: Theory and a Job Market Application. Universität Paderborn, 2013.","mla":"Stroh-Maraun, Nadja. Dynamic One-to-One Matching: Theory and a Job Market Application. Universität Paderborn, 2013.","bibtex":"@book{Stroh-Maraun_2013, title={Dynamic One-to-One Matching: Theory and a Job Market Application}, publisher={Universität Paderborn}, author={Stroh-Maraun, Nadja}, year={2013} }"},"year":"2013","user_id":"13264","title":"Dynamic One-to-One Matching: Theory and a Job Market Application","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2017-10-17T12:42:36Z","status":"public","department":[{"_id":"205"}],"publisher":"Universität Paderborn","author":[{"first_name":"Nadja","full_name":"Stroh-Maraun, Nadja","last_name":"Stroh-Maraun","id":"13264"}]},{"year":"2013","citation":{"mla":"Heindorf, Stefan. Dispersion of Multi-Robot Teams. Universität Paderborn, 2013.","bibtex":"@book{Heindorf_2013, title={Dispersion of Multi-Robot Teams}, publisher={Universität Paderborn}, author={Heindorf, Stefan}, year={2013} }","apa":"Heindorf, S. (2013). Dispersion of Multi-Robot Teams. Universität Paderborn.","ama":"Heindorf S. Dispersion of Multi-Robot Teams. Universität Paderborn; 2013.","chicago":"Heindorf, Stefan. Dispersion of Multi-Robot Teams. Universität Paderborn, 2013.","ieee":"S. Heindorf, Dispersion of Multi-Robot Teams. Universität Paderborn, 2013.","short":"S. Heindorf, Dispersion of Multi-Robot Teams, Universität Paderborn, 2013."},"type":"mastersthesis","_id":"537","date_updated":"2022-01-06T07:01:50Z","date_created":"2017-10-17T12:42:37Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","publisher":"Universität Paderborn","author":[{"first_name":"Stefan","full_name":"Heindorf, Stefan","last_name":"Heindorf"}],"user_id":"15504","title":"Dispersion of Multi-Robot Teams"},{"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:37Z","author":[{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"},{"first_name":"Gennadij","full_name":"Liske, Gennadij","last_name":"Liske"}],"publisher":"Universität Paderborn","file_date_updated":"2018-03-15T10:35:04Z","file":[{"content_type":"application/pdf","date_updated":"2018-03-15T10:35:04Z","success":1,"relation":"main_file","file_size":389797,"creator":"florida","file_id":"1292","access_level":"closed","file_name":"538-AB-KEM_01.pdf","date_created":"2018-03-15T10:35:04Z"}],"ddc":["040"],"user_id":"25078","abstract":[{"lang":"eng","text":"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."}],"year":"2013","type":"preprint","citation":{"ieee":"J. Blömer and G. Liske, “Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn, 2013.","short":"J. Blömer, G. Liske, (2013).","bibtex":"@article{Blömer_Liske_2013, title={Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles}, publisher={Universität Paderborn}, author={Blömer, Johannes and Liske, Gennadij}, year={2013} }","mla":"Blömer, Johannes, and Gennadij Liske. Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. Universität Paderborn, 2013.","chicago":"Blömer, Johannes, and Gennadij Liske. “Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn, 2013.","ama":"Blömer J, Liske G. Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. 2013.","apa":"Blömer, J., & Liske, G. (2013). Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. Universität Paderborn."},"main_file_link":[{"url":"https://eprint.iacr.org/2013/646","open_access":"1"}],"_id":"538","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"43","name":"Securing the Financial Cloud"}],"department":[{"_id":"64"}],"title":"Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles","oa":"1","date_updated":"2022-01-06T07:01:51Z"},{"user_id":"477","title":"Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen","publisher":"Universität Paderborn","author":[{"last_name":"Kornhoff","first_name":"Tobias","full_name":"Kornhoff, Tobias"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2017-10-17T12:42:37Z","status":"public","_id":"539","date_updated":"2022-01-06T07:01:51Z","language":[{"iso":"ger"}],"type":"bachelorsthesis","citation":{"short":"T. Kornhoff, Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen, Universität Paderborn, 2013.","ieee":"T. Kornhoff, Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen. Universität Paderborn, 2013.","ama":"Kornhoff T. Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen. Universität Paderborn; 2013.","apa":"Kornhoff, T. (2013). Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen. Universität Paderborn.","chicago":"Kornhoff, Tobias. Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen. Universität Paderborn, 2013.","mla":"Kornhoff, Tobias. Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen. Universität Paderborn, 2013.","bibtex":"@book{Kornhoff_2013, title={Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen}, publisher={Universität Paderborn}, author={Kornhoff, Tobias}, year={2013} }"},"year":"2013"},{"date_updated":"2022-01-06T07:01:52Z","doi":"10.1109/ICCCN.2013.6614118","language":[{"iso":"eng"}],"title":"Continuous Gossip-based Aggregation through Dynamic Information Aging","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"541","type":"conference","citation":{"ieee":"K. Graffi and V. Rapp, “Continuous Gossip-based Aggregation through Dynamic Information Aging,” in Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13), 2013, pp. 1–7.","short":"K. Graffi, V. Rapp, in: Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13), 2013, pp. 1–7.","bibtex":"@inproceedings{Graffi_Rapp_2013, title={Continuous Gossip-based Aggregation through Dynamic Information Aging}, DOI={10.1109/ICCCN.2013.6614118}, booktitle={Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13)}, author={Graffi, Kalman and Rapp, Vitaly}, year={2013}, pages={1–7} }","mla":"Graffi, Kalman, and Vitaly Rapp. “Continuous Gossip-Based Aggregation through Dynamic Information Aging.” Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13), 2013, pp. 1–7, doi:10.1109/ICCCN.2013.6614118.","apa":"Graffi, K., & Rapp, V. (2013). Continuous Gossip-based Aggregation through Dynamic Information Aging. In Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13) (pp. 1–7). https://doi.org/10.1109/ICCCN.2013.6614118","ama":"Graffi K, Rapp V. Continuous Gossip-based Aggregation through Dynamic Information Aging. In: Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13). ; 2013:1-7. doi:10.1109/ICCCN.2013.6614118","chicago":"Graffi, Kalman, and Vitaly Rapp. “Continuous Gossip-Based Aggregation through Dynamic Information Aging.” In Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13), 1–7, 2013. https://doi.org/10.1109/ICCCN.2013.6614118."},"year":"2013","page":"1-7","abstract":[{"text":"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.","lang":"eng"}],"ddc":["040"],"user_id":"477","author":[{"last_name":"Graffi","full_name":"Graffi, Kalman","first_name":"Kalman"},{"first_name":"Vitaly","full_name":"Rapp, Vitaly","last_name":"Rapp"}],"publication":"Proceedings of the International Conference on Computer Communications and Networks (ICCCN'13)","file_date_updated":"2018-03-15T10:33:20Z","file":[{"file_size":272960,"file_id":"1290","creator":"florida","date_updated":"2018-03-15T10:33:20Z","content_type":"application/pdf","success":1,"relation":"main_file","file_name":"541-Continuous.Gossip.based.Aggregation.Through.Dynamic.Information.Aging.pdf","date_created":"2018-03-15T10:33:20Z","access_level":"closed"}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:37Z"},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"79"}],"title":"CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system","series_title":"LNCS","doi":"10.1007/978-3-642-41527-2_37","date_updated":"2022-01-06T07:01:53Z","date_created":"2017-10-17T12:42:38Z","status":"public","has_accepted_license":"1","publication":"Proceedings of the 27th International Symposium on Distributed Computing (DISC)","file_date_updated":"2018-03-15T10:32:48Z","author":[{"last_name":"Kniesburges","first_name":"Sebastian","full_name":"Kniesburges, Sebastian"},{"last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas","first_name":"Andreas"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file":[{"file_name":"542-CONE-DHT_A_distributed_self-stabilizing_algorithm_for_a_heterogeneous_storage_system.pdf","date_created":"2018-03-15T10:32:48Z","access_level":"closed","file_size":262302,"creator":"florida","file_id":"1289","content_type":"application/pdf","date_updated":"2018-03-15T10:32:48Z","success":1,"relation":"main_file"}],"ddc":["040"],"user_id":"15504","abstract":[{"text":"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.","lang":"eng"}],"page":"537-549","citation":{"apa":"Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2013). CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system. In Proceedings of the 27th International Symposium on Distributed Computing (DISC) (pp. 537–549). https://doi.org/10.1007/978-3-642-41527-2_37","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system. In: Proceedings of the 27th International Symposium on Distributed Computing (DISC). LNCS. ; 2013:537-549. doi:10.1007/978-3-642-41527-2_37","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System.” In Proceedings of the 27th International Symposium on Distributed Computing (DISC), 537–49. LNCS, 2013. https://doi.org/10.1007/978-3-642-41527-2_37.","bibtex":"@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2013, series={LNCS}, title={CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system}, DOI={10.1007/978-3-642-41527-2_37}, booktitle={Proceedings of the 27th International Symposium on Distributed Computing (DISC)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2013}, pages={537–549}, collection={LNCS} }","mla":"Kniesburges, Sebastian, et al. “CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System.” Proceedings of the 27th International Symposium on Distributed Computing (DISC), 2013, pp. 537–49, doi:10.1007/978-3-642-41527-2_37.","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 27th International Symposium on Distributed Computing (DISC), 2013, pp. 537–549.","ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system,” in Proceedings of the 27th International Symposium on Distributed Computing (DISC), 2013, pp. 537–549."},"type":"conference","year":"2013","_id":"542"},{"citation":{"ieee":"K. Jagannath, Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services. Universität Paderborn, 2013.","short":"K. Jagannath, Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services, Universität Paderborn, 2013.","mla":"Jagannath, Kavitha. Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services. Universität Paderborn, 2013.","bibtex":"@book{Jagannath_2013, title={Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services}, publisher={Universität Paderborn}, author={Jagannath, Kavitha}, year={2013} }","ama":"Jagannath K. Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services. Universität Paderborn; 2013.","apa":"Jagannath, K. (2013). Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services. Universität Paderborn.","chicago":"Jagannath, Kavitha. Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services. Universität Paderborn, 2013."},"type":"mastersthesis","year":"2013","date_updated":"2022-01-06T07:01:53Z","_id":"543","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"name":"SFB 901 - Project Area B","_id":"3"}],"date_created":"2017-10-17T12:42:38Z","publisher":"Universität Paderborn","author":[{"full_name":"Jagannath, Kavitha","first_name":"Kavitha","last_name":"Jagannath"}],"user_id":"15504","title":"Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services"},{"_id":"544","page":"99-106","citation":{"mla":"Feldotto, Matthias, and Kalman Graffi. “Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13), 2013, pp. 99–106, doi:10.1109/HPCSim.2013.6641399.","bibtex":"@inproceedings{Feldotto_Graffi_2013, title={Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM}, DOI={10.1109/HPCSim.2013.6641399}, booktitle={Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13)}, author={Feldotto, Matthias and Graffi, Kalman}, year={2013}, pages={99–106} }","chicago":"Feldotto, Matthias, and Kalman Graffi. “Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” In Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13), 99–106, 2013. https://doi.org/10.1109/HPCSim.2013.6641399.","apa":"Feldotto, M., & Graffi, K. (2013). Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM. In Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13) (pp. 99–106). https://doi.org/10.1109/HPCSim.2013.6641399","ama":"Feldotto M, Graffi K. Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM. In: Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13). ; 2013:99-106. doi:10.1109/HPCSim.2013.6641399","ieee":"M. Feldotto and K. Graffi, “Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM,” in Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13), 2013, pp. 99–106.","short":"M. Feldotto, K. Graffi, in: Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13), 2013, pp. 99–106."},"type":"conference","year":"2013","user_id":"14052","ddc":["040"],"abstract":[{"text":"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.","lang":"eng"}],"date_created":"2017-10-17T12:42:38Z","has_accepted_license":"1","status":"public","file":[{"creator":"florida","file_id":"1288","file_size":899441,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-03-15T10:32:17Z","date_created":"2018-03-15T10:32:17Z","file_name":"544-FeldGraffi13.pdf","access_level":"closed"}],"publication":"Proceedings of the International Conference on High Performance Computing and Simulation (HPCS'13)","file_date_updated":"2018-03-15T10:32:17Z","author":[{"orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","first_name":"Matthias","id":"14052","last_name":"Feldotto"},{"last_name":"Graffi","full_name":"Graffi, Kalman","first_name":"Kalman"}],"doi":"10.1109/HPCSim.2013.6641399","date_updated":"2022-01-06T07:01:53Z","language":[{"iso":"eng"}],"title":"Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}]},{"user_id":"477","title":"Cliquenbildung in verteilten Systemen","author":[{"first_name":"Fritz","full_name":"Blumentritt, Fritz","last_name":"Blumentritt"}],"publisher":"Universität Paderborn","status":"public","date_created":"2017-10-17T12:42:38Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"545","date_updated":"2022-01-06T07:01:54Z","language":[{"iso":"ger"}],"year":"2013","citation":{"short":"F. Blumentritt, Cliquenbildung in verteilten Systemen, Universität Paderborn, 2013.","ieee":"F. Blumentritt, Cliquenbildung in verteilten Systemen. Universität Paderborn, 2013.","chicago":"Blumentritt, Fritz. Cliquenbildung in verteilten Systemen. Universität Paderborn, 2013.","ama":"Blumentritt F. Cliquenbildung in verteilten Systemen. Universität Paderborn; 2013.","apa":"Blumentritt, F. (2013). Cliquenbildung in verteilten Systemen. Universität Paderborn.","mla":"Blumentritt, Fritz. Cliquenbildung in verteilten Systemen. Universität Paderborn, 2013.","bibtex":"@book{Blumentritt_2013, title={Cliquenbildung in verteilten Systemen}, publisher={Universität Paderborn}, author={Blumentritt, Fritz}, year={2013} }"},"type":"bachelorsthesis"},{"has_accepted_license":"1","status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"4","name":"SFB 901 - Project Area C"}],"date_created":"2017-10-17T12:42:38Z","file":[{"file_id":"1286","creator":"florida","file_size":244841,"relation":"main_file","success":1,"date_updated":"2018-03-15T10:30:42Z","content_type":"application/pdf","file_name":"546-Kalman.Graffi_CaReChord.A.Churn.Resistant.Selfstabilizing.Chord.Overlay.Network_02.pdf","date_created":"2018-03-15T10:30:42Z","access_level":"closed"}],"author":[{"full_name":"Graffi, Kalman","first_name":"Kalman","last_name":"Graffi"},{"full_name":"Benter, Markus","first_name":"Markus","last_name":"Benter"},{"full_name":"Divband, Mohammad","first_name":"Mohammad","last_name":"Divband"},{"first_name":"Sebastian","full_name":"Kniesburges, Sebastian","last_name":"Kniesburges"},{"full_name":"Koutsopoulos, Andreas","first_name":"Andreas","last_name":"Koutsopoulos"}],"file_date_updated":"2018-03-15T10:30:42Z","department":[{"_id":"79"}],"publication":"Proceedings of the Conference on Networked Systems (NetSys)","user_id":"15504","title":"Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network","ddc":["040"],"abstract":[{"text":"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.","lang":"eng"}],"citation":{"mla":"Graffi, Kalman, et al. “Ca-Re-Chord: A Churn Resistant Self-Stabilizing Chord Overlay Network.” Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 27–34, doi:10.1109/NetSys.2013.11.","bibtex":"@inproceedings{Graffi_Benter_Divband_Kniesburges_Koutsopoulos_2013, title={Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network}, DOI={10.1109/NetSys.2013.11}, booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Graffi, Kalman and Benter, Markus and Divband, Mohammad and Kniesburges, Sebastian and Koutsopoulos, Andreas}, year={2013}, pages={27–34} }","ama":"Graffi K, Benter M, Divband M, Kniesburges S, Koutsopoulos A. Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network. In: Proceedings of the Conference on Networked Systems (NetSys). ; 2013:27-34. doi:10.1109/NetSys.2013.11","apa":"Graffi, K., Benter, M., Divband, M., Kniesburges, S., & Koutsopoulos, A. (2013). Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network. In Proceedings of the Conference on Networked Systems (NetSys) (pp. 27–34). https://doi.org/10.1109/NetSys.2013.11","chicago":"Graffi, Kalman, Markus Benter, Mohammad Divband, Sebastian Kniesburges, and Andreas Koutsopoulos. “Ca-Re-Chord: A Churn Resistant Self-Stabilizing Chord Overlay Network.” In Proceedings of the Conference on Networked Systems (NetSys), 27–34, 2013. https://doi.org/10.1109/NetSys.2013.11.","ieee":"K. Graffi, M. Benter, M. Divband, S. Kniesburges, and A. Koutsopoulos, “Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network,” in Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 27–34.","short":"K. Graffi, M. Benter, M. Divband, S. Kniesburges, A. Koutsopoulos, in: Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 27–34."},"year":"2013","type":"conference","page":"27-34","doi":"10.1109/NetSys.2013.11","_id":"546","date_updated":"2022-01-06T07:01:55Z"},{"volume":31,"date_created":"2018-11-08T14:22:26Z","status":"public","department":[{"_id":"274"}],"publication":"International Small Business Journal (ISBJ).","author":[{"full_name":"Baum, M","first_name":"M","last_name":"Baum"},{"last_name":"Schwens","first_name":"C","full_name":"Schwens, C"},{"last_name":"Kabst","id":"42362","first_name":"Rüdiger","full_name":"Kabst, Rüdiger"}],"title":"International as Opposed to Domestic New Venturing: The Moderating Role of Perceived Barriers to Internationalization.","user_id":"46632","page":"534-560","citation":{"bibtex":"@article{Baum_Schwens_Kabst_2013, title={International as Opposed to Domestic New Venturing: The Moderating Role of Perceived Barriers to Internationalization.}, volume={31}, number={5}, journal={International Small Business Journal (ISBJ).}, author={Baum, M and Schwens, C and Kabst, Rüdiger}, year={2013}, pages={534–560} }","mla":"Baum, M., et al. “International as Opposed to Domestic New Venturing: The Moderating Role of Perceived Barriers to Internationalization.” International Small Business Journal (ISBJ)., vol. 31, no. 5, 2013, pp. 534–60.","chicago":"Baum, M, C Schwens, and Rüdiger Kabst. “International as Opposed to Domestic New Venturing: The Moderating Role of Perceived Barriers to Internationalization.” International Small Business Journal (ISBJ). 31, no. 5 (2013): 534–60.","apa":"Baum, M., Schwens, C., & Kabst, R. (2013). International as Opposed to Domestic New Venturing: The Moderating Role of Perceived Barriers to Internationalization. International Small Business Journal (ISBJ)., 31(5), 534–560.","ama":"Baum M, Schwens C, Kabst R. International as Opposed to Domestic New Venturing: The Moderating Role of Perceived Barriers to Internationalization. International Small Business Journal (ISBJ). 2013;31(5):534-560.","ieee":"M. Baum, C. Schwens, and R. Kabst, “International as Opposed to Domestic New Venturing: The Moderating Role of Perceived Barriers to Internationalization.,” International Small Business Journal (ISBJ)., vol. 31, no. 5, pp. 534–560, 2013.","short":"M. Baum, C. Schwens, R. Kabst, International Small Business Journal (ISBJ). 31 (2013) 534–560."},"year":"2013","type":"journal_article","language":[{"iso":"eng"}],"issue":"5","_id":"5464","intvolume":" 31","date_updated":"2022-01-06T07:01:55Z"},{"issue":"7","_id":"5465","intvolume":" 24","date_updated":"2022-01-06T07:01:55Z","page":"1393-1417","type":"journal_article","citation":{"chicago":"Baum, M, and Rüdiger Kabst. “Conjoint Implications on Job Preferences: The Moderating Role of Involvement.” International Journal of Human Resource Management (IJHRM). 24, no. 7 (2013): 1393–1417.","ama":"Baum M, Kabst R. Conjoint implications on job preferences: The moderating role of involvement. International Journal of Human Resource Management (IJHRM). 2013;24(7):1393-1417.","apa":"Baum, M., & Kabst, R. (2013). Conjoint implications on job preferences: The moderating role of involvement. International Journal of Human Resource Management (IJHRM)., 24(7), 1393–1417.","mla":"Baum, M., and Rüdiger Kabst. “Conjoint Implications on Job Preferences: The Moderating Role of Involvement.” International Journal of Human Resource Management (IJHRM)., vol. 24, no. 7, 2013, pp. 1393–417.","bibtex":"@article{Baum_Kabst_2013, title={Conjoint implications on job preferences: The moderating role of involvement.}, volume={24}, number={7}, journal={International Journal of Human Resource Management (IJHRM).}, author={Baum, M and Kabst, Rüdiger}, year={2013}, pages={1393–1417} }","short":"M. Baum, R. Kabst, International Journal of Human Resource Management (IJHRM). 24 (2013) 1393–1417.","ieee":"M. Baum and R. Kabst, “Conjoint implications on job preferences: The moderating role of involvement.,” International Journal of Human Resource Management (IJHRM)., vol. 24, no. 7, pp. 1393–1417, 2013."},"year":"2013","language":[{"iso":"eng"}],"title":"Conjoint implications on job preferences: The moderating role of involvement.","user_id":"46632","volume":24,"date_created":"2018-11-08T14:28:07Z","status":"public","publication":"International Journal of Human Resource Management (IJHRM).","department":[{"_id":"274"}],"author":[{"full_name":"Baum, M","first_name":"M","last_name":"Baum"},{"first_name":"Rüdiger","full_name":"Kabst, Rüdiger","last_name":"Kabst","id":"42362"}]},{"department":[{"_id":"66"}],"publisher":"Universität Paderborn","author":[{"last_name":"Gerth","full_name":"Gerth, Christian","first_name":"Christian"}],"date_created":"2017-10-17T12:42:39Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"3","name":"SFB 901 - Project Area B"}],"status":"public","abstract":[{"lang":"eng","text":"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."}],"title":"Business Process Models - Change Management","user_id":"477","year":"2013","citation":{"chicago":"Gerth, Christian. Business Process Models - Change Management. Universität Paderborn, 2013. https://doi.org/10.1007/978-3-642-38604-6.","apa":"Gerth, C. (2013). Business Process Models - Change Management. Universität Paderborn. https://doi.org/10.1007/978-3-642-38604-6","ama":"Gerth C. Business Process Models - Change Management. Universität Paderborn; 2013. doi:10.1007/978-3-642-38604-6","bibtex":"@book{Gerth_2013, title={Business Process Models - Change Management}, DOI={10.1007/978-3-642-38604-6}, publisher={Universität Paderborn}, author={Gerth, Christian}, year={2013} }","mla":"Gerth, Christian. Business Process Models - Change Management. Universität Paderborn, 2013, doi:10.1007/978-3-642-38604-6.","short":"C. Gerth, Business Process Models - Change Management, Universität Paderborn, 2013.","ieee":"C. Gerth, Business Process Models - Change Management. Universität Paderborn, 2013."},"type":"dissertation","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Engels","id":"107","first_name":"Gregor","full_name":"Engels, Gregor"}],"_id":"547","date_updated":"2022-01-06T07:01:55Z","doi":"10.1007/978-3-642-38604-6"},{"author":[{"first_name":"M","full_name":"Baum, M","last_name":"Baum"},{"full_name":"Kabst, Rüdiger","first_name":"Rüdiger","id":"42362","last_name":"Kabst"}],"department":[{"_id":"274"}],"publication":"Journal of World Business (JWB).","volume":48,"status":"public","date_created":"2018-11-12T10:14:53Z","title":"How to attract applicants in the atlantic versus the asia-pacific region? A cross-national analysis on China, India, Germany, and Hungary.","user_id":"46632","citation":{"mla":"Baum, M., and Rüdiger Kabst. “How to Attract Applicants in the Atlantic versus the Asia-Pacific Region? A Cross-National Analysis on China, India, Germany, and Hungary.” Journal of World Business (JWB)., vol. 48, no. 2, 2013, pp. 175–85.","bibtex":"@article{Baum_Kabst_2013, title={How to attract applicants in the atlantic versus the asia-pacific region? A cross-national analysis on China, India, Germany, and Hungary.}, volume={48}, number={2}, journal={Journal of World Business (JWB).}, author={Baum, M and Kabst, Rüdiger}, year={2013}, pages={175–185} }","apa":"Baum, M., & Kabst, R. (2013). How to attract applicants in the atlantic versus the asia-pacific region? A cross-national analysis on China, India, Germany, and Hungary. Journal of World Business (JWB)., 48(2), 175–185.","ama":"Baum M, Kabst R. How to attract applicants in the atlantic versus the asia-pacific region? A cross-national analysis on China, India, Germany, and Hungary. Journal of World Business (JWB). 2013;48(2):175-185.","chicago":"Baum, M, and Rüdiger Kabst. “How to Attract Applicants in the Atlantic versus the Asia-Pacific Region? A Cross-National Analysis on China, India, Germany, and Hungary.” Journal of World Business (JWB). 48, no. 2 (2013): 175–85.","ieee":"M. Baum and R. Kabst, “How to attract applicants in the atlantic versus the asia-pacific region? A cross-national analysis on China, India, Germany, and Hungary.,” Journal of World Business (JWB)., vol. 48, no. 2, pp. 175–185, 2013.","short":"M. Baum, R. Kabst, Journal of World Business (JWB). 48 (2013) 175–185."},"year":"2013","type":"journal_article","page":"175-185","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:55Z","_id":"5478","intvolume":" 48","issue":"2"},{"file":[{"file_name":"548-Bootstrapping.Skynet.Calibration.and.Autonomic.Self-Control.of.Structured.P2P.Networks_01.pdf","date_created":"2018-03-15T10:30:09Z","access_level":"closed","file_size":629234,"creator":"florida","file_id":"1285","date_updated":"2018-03-15T10:30:09Z","content_type":"application/pdf","relation":"main_file","success":1}],"author":[{"last_name":"Graffi","full_name":"Graffi, Kalman","first_name":"Kalman"},{"first_name":"Timo","full_name":"Klerx, Timo","last_name":"Klerx"}],"file_date_updated":"2018-03-15T10:30:09Z","publication":"Proceedings of the International Conference on Peer-to-Peer Computing (P2P'13)","has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:39Z","abstract":[{"lang":"eng","text":"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."}],"user_id":"477","ddc":["040"],"year":"2013","citation":{"ieee":"K. Graffi and T. Klerx, “Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks,” in Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13), 2013, pp. 1–5.","short":"K. Graffi, T. Klerx, in: Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13), 2013, pp. 1–5.","bibtex":"@inproceedings{Graffi_Klerx_2013, title={Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks}, DOI={10.1109/P2P.2013.6688720}, booktitle={Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13)}, author={Graffi, Kalman and Klerx, Timo}, year={2013}, pages={1–5} }","mla":"Graffi, Kalman, and Timo Klerx. “Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks.” Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13), 2013, pp. 1–5, doi:10.1109/P2P.2013.6688720.","chicago":"Graffi, Kalman, and Timo Klerx. “Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks.” In Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13), 1–5, 2013. https://doi.org/10.1109/P2P.2013.6688720.","ama":"Graffi K, Klerx T. Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks. In: Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13). ; 2013:1-5. doi:10.1109/P2P.2013.6688720","apa":"Graffi, K., & Klerx, T. (2013). Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks. In Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13) (pp. 1–5). https://doi.org/10.1109/P2P.2013.6688720"},"type":"conference","page":"1-5","_id":"548","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"title":"Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:56Z","doi":"10.1109/P2P.2013.6688720"},{"author":[{"last_name":"Haus","full_name":"Haus, I","first_name":"I"},{"last_name":"Steinmetz","id":"43261","first_name":"Holger","full_name":"Steinmetz, Holger"},{"last_name":"Isidor","first_name":"R","full_name":"Isidor, R"},{"first_name":"Rüdiger","full_name":"Kabst, Rüdiger","last_name":"Kabst","id":"42362"}],"department":[{"_id":"274"}],"publication":"International Journal of Gender and Entrepreneurship (IJGE)","volume":5,"status":"public","date_created":"2018-11-12T10:31:29Z","title":"Gender Effects on Entrepreneurial Intention: A Meta-Analytical Structural Equation Model.","user_id":"46632","citation":{"ieee":"I. Haus, H. Steinmetz, R. Isidor, and R. Kabst, “Gender Effects on Entrepreneurial Intention: A Meta-Analytical Structural Equation Model.,” International Journal of Gender and Entrepreneurship (IJGE), vol. 5, no. 2, pp. 130–156, 2013.","short":"I. Haus, H. Steinmetz, R. Isidor, R. Kabst, International Journal of Gender and Entrepreneurship (IJGE) 5 (2013) 130–156.","bibtex":"@article{Haus_Steinmetz_Isidor_Kabst_2013, title={Gender Effects on Entrepreneurial Intention: A Meta-Analytical Structural Equation Model.}, volume={5}, number={2}, journal={International Journal of Gender and Entrepreneurship (IJGE)}, author={Haus, I and Steinmetz, Holger and Isidor, R and Kabst, Rüdiger}, year={2013}, pages={130–156} }","mla":"Haus, I., et al. “Gender Effects on Entrepreneurial Intention: A Meta-Analytical Structural Equation Model.” International Journal of Gender and Entrepreneurship (IJGE), vol. 5, no. 2, 2013, pp. 130–56.","chicago":"Haus, I, Holger Steinmetz, R Isidor, and Rüdiger Kabst. “Gender Effects on Entrepreneurial Intention: A Meta-Analytical Structural Equation Model.” International Journal of Gender and Entrepreneurship (IJGE) 5, no. 2 (2013): 130–56.","apa":"Haus, I., Steinmetz, H., Isidor, R., & Kabst, R. (2013). Gender Effects on Entrepreneurial Intention: A Meta-Analytical Structural Equation Model. International Journal of Gender and Entrepreneurship (IJGE), 5(2), 130–156.","ama":"Haus I, Steinmetz H, Isidor R, Kabst R. Gender Effects on Entrepreneurial Intention: A Meta-Analytical Structural Equation Model. International Journal of Gender and Entrepreneurship (IJGE). 2013;5(2):130-156."},"year":"2013","type":"journal_article","page":"130-156","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:56Z","_id":"5484","intvolume":" 5","issue":"2"},{"date_created":"2018-11-12T10:38:26Z","status":"public","volume":9,"publication":"European Journal of Research Methods for the Behavioral and Social Sciences.","department":[{"_id":"274"}],"author":[{"last_name":"Steinmetz","id":"43261","first_name":"Holger","full_name":"Steinmetz, Holger"}],"user_id":"46632","title":"Analyzing observed composite differences across groups: Is partial measurement invariance enough?","language":[{"iso":"eng"}],"page":"1-12","citation":{"ieee":"H. Steinmetz, “Analyzing observed composite differences across groups: Is partial measurement invariance enough?,” European Journal of Research Methods for the Behavioral and Social Sciences., vol. 9, no. 1, pp. 1–12, 2013.","short":"H. Steinmetz, European Journal of Research Methods for the Behavioral and Social Sciences. 9 (2013) 1–12.","bibtex":"@article{Steinmetz_2013, title={Analyzing observed composite differences across groups: Is partial measurement invariance enough?}, volume={9}, number={1}, journal={European Journal of Research Methods for the Behavioral and Social Sciences.}, author={Steinmetz, Holger}, year={2013}, pages={1–12} }","mla":"Steinmetz, Holger. “Analyzing Observed Composite Differences across Groups: Is Partial Measurement Invariance Enough?” European Journal of Research Methods for the Behavioral and Social Sciences., vol. 9, no. 1, 2013, pp. 1–12.","chicago":"Steinmetz, Holger. “Analyzing Observed Composite Differences across Groups: Is Partial Measurement Invariance Enough?” European Journal of Research Methods for the Behavioral and Social Sciences. 9, no. 1 (2013): 1–12.","ama":"Steinmetz H. Analyzing observed composite differences across groups: Is partial measurement invariance enough? European Journal of Research Methods for the Behavioral and Social Sciences. 2013;9(1):1-12.","apa":"Steinmetz, H. (2013). Analyzing observed composite differences across groups: Is partial measurement invariance enough? European Journal of Research Methods for the Behavioral and Social Sciences., 9(1), 1–12."},"year":"2013","type":"journal_article","issue":"1","_id":"5489","date_updated":"2022-01-06T07:01:56Z","intvolume":" 9"},{"_id":"549","date_updated":"2022-01-06T07:01:56Z","language":[{"iso":"ger"}],"type":"bachelorsthesis","citation":{"short":"C. Bick, Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner, Universität Paderborn, 2013.","ieee":"C. Bick, Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner. Universität Paderborn, 2013.","ama":"Bick C. Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner. Universität Paderborn; 2013.","apa":"Bick, C. (2013). Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner. Universität Paderborn.","chicago":"Bick, Christian. Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner. Universität Paderborn, 2013.","bibtex":"@book{Bick_2013, title={Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner}, publisher={Universität Paderborn}, author={Bick, Christian}, year={2013} }","mla":"Bick, Christian. Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner. Universität Paderborn, 2013."},"year":"2013","user_id":"477","title":"Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner","publisher":"Universität Paderborn","author":[{"last_name":"Bick","first_name":"Christian","full_name":"Bick, Christian"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"}],"date_created":"2017-10-17T12:42:39Z"},{"_id":"550","date_updated":"2022-01-06T07:01:56Z","citation":{"mla":"Meschede, Julian. Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen. Universität Paderborn, 2013.","bibtex":"@book{Meschede_2013, title={Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen}, publisher={Universität Paderborn}, author={Meschede, Julian}, year={2013} }","ama":"Meschede J. Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen. Universität Paderborn; 2013.","apa":"Meschede, J. (2013). Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen. Universität Paderborn.","chicago":"Meschede, Julian. Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen. Universität Paderborn, 2013.","ieee":"J. Meschede, Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen. Universität Paderborn, 2013.","short":"J. Meschede, Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen, Universität Paderborn, 2013."},"type":"bachelorsthesis","year":"2013","language":[{"iso":"ger"}],"title":"Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen","user_id":"477","project":[{"_id":"1","name":"SFB 901"},{"_id":"14","name":"SFB 901 - Subprojekt C2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"date_created":"2017-10-17T12:42:39Z","status":"public","publisher":"Universität Paderborn","author":[{"full_name":"Meschede, Julian","first_name":"Julian","last_name":"Meschede"}]},{"title":"Automated Service Composition for On-the-Fly SOAs","project":[{"_id":"1","name":"SFB 901"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"66"}],"doi":"10.1007/978-3-642-45005-1_42","date_updated":"2022-01-06T07:01:57Z","language":[{"iso":"eng"}],"series_title":"LNCS","user_id":"477","ddc":["040"],"abstract":[{"text":"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.","lang":"eng"}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:39Z","file":[{"relation":"main_file","success":1,"date_updated":"2018-03-15T10:31:20Z","content_type":"application/pdf","file_id":"1287","creator":"florida","file_size":384397,"access_level":"closed","date_created":"2018-03-15T10:31:20Z","file_name":"551-978-3-642-45005-1_42.pdf"}],"author":[{"first_name":"Zille","full_name":"Huma, Zille","last_name":"Huma"},{"last_name":"Gerth","first_name":"Christian","full_name":"Gerth, Christian"},{"full_name":"Engels, Gregor","first_name":"Gregor","id":"107","last_name":"Engels"},{"first_name":"Oliver","full_name":"Juwig, Oliver","last_name":"Juwig"}],"file_date_updated":"2018-03-15T10:31:20Z","publication":"Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC'13)","_id":"551","citation":{"ieee":"Z. Huma, C. Gerth, G. Engels, and O. Juwig, “Automated Service Composition for On-the-Fly SOAs,” in Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13), 2013, pp. 524--532.","short":"Z. Huma, C. Gerth, G. Engels, O. Juwig, in: Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13), 2013, pp. 524--532.","bibtex":"@inproceedings{Huma_Gerth_Engels_Juwig_2013, series={LNCS}, title={Automated Service Composition for On-the-Fly SOAs}, DOI={10.1007/978-3-642-45005-1_42}, booktitle={Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13)}, author={Huma, Zille and Gerth, Christian and Engels, Gregor and Juwig, Oliver}, year={2013}, pages={524--532}, collection={LNCS} }","mla":"Huma, Zille, et al. “Automated Service Composition for On-the-Fly SOAs.” Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13), 2013, pp. 524--532, doi:10.1007/978-3-642-45005-1_42.","apa":"Huma, Z., Gerth, C., Engels, G., & Juwig, O. (2013). Automated Service Composition for On-the-Fly SOAs. In Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13) (pp. 524--532). https://doi.org/10.1007/978-3-642-45005-1_42","ama":"Huma Z, Gerth C, Engels G, Juwig O. Automated Service Composition for On-the-Fly SOAs. In: Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13). LNCS. ; 2013:524--532. doi:10.1007/978-3-642-45005-1_42","chicago":"Huma, Zille, Christian Gerth, Gregor Engels, and Oliver Juwig. “Automated Service Composition for On-the-Fly SOAs.” In Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13), 524--532. LNCS, 2013. https://doi.org/10.1007/978-3-642-45005-1_42."},"type":"conference","year":"2013","page":"524--532"},{"year":"2013","type":"bachelorsthesis","citation":{"short":"K. Meckenstock, Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse, Universität Paderborn, 2013.","ieee":"K. Meckenstock, Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse. Universität Paderborn, 2013.","apa":"Meckenstock, K. (2013). Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse. Universität Paderborn.","ama":"Meckenstock K. Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse. Universität Paderborn; 2013.","chicago":"Meckenstock, Kevin. Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse. Universität Paderborn, 2013.","bibtex":"@book{Meckenstock_2013, title={Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse}, publisher={Universität Paderborn}, author={Meckenstock, Kevin}, year={2013} }","mla":"Meckenstock, Kevin. Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse. Universität Paderborn, 2013."},"language":[{"iso":"ger"}],"date_updated":"2022-01-06T07:01:57Z","_id":"552","status":"public","date_created":"2017-10-17T12:42:39Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"publisher":"Universität Paderborn","author":[{"full_name":"Meckenstock, Kevin","first_name":"Kevin","last_name":"Meckenstock"}],"title":"Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse","user_id":"477"},{"department":[{"_id":"64"}],"publisher":"Universität Paderborn","author":[{"full_name":"Kohn, Kathlén","first_name":"Kathlén","last_name":"Kohn"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"43","name":"Securing the Financial Cloud"}],"date_created":"2017-10-17T12:42:40Z","status":"public","title":"Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise","user_id":"477","citation":{"bibtex":"@book{Kohn_2013, title={Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise}, publisher={Universität Paderborn}, author={Kohn, Kathlén}, year={2013} }","mla":"Kohn, Kathlén. Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn, 2013.","chicago":"Kohn, Kathlén. Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn, 2013.","apa":"Kohn, K. (2013). Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn.","ama":"Kohn K. Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn; 2013.","ieee":"K. Kohn, Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn, 2013.","short":"K. Kohn, Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise, Universität Paderborn, 2013."},"type":"bachelorsthesis","year":"2013","supervisor":[{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"}],"language":[{"iso":"ger"}],"date_updated":"2022-01-06T07:01:57Z","_id":"553"},{"department":[{"_id":"205"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"title":"Asymmetric Nash bargaining solutions and competitive payoffs","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:58Z","doi":"10.1016/j.econlet.2013.08.013","file":[{"content_type":"application/pdf","date_updated":"2018-03-15T10:29:34Z","success":1,"relation":"main_file","file_size":374965,"creator":"florida","file_id":"1284","access_level":"closed","file_name":"554-Asymmetric_Nash_bargaining_solutions_and_competitive_payoffs.pdf","date_created":"2018-03-15T10:29:34Z"}],"author":[{"full_name":"Brangewitz, Sonja","first_name":"Sonja","last_name":"Brangewitz"},{"last_name":"Gamp","full_name":"Gamp, Jan-Philip","first_name":"Jan-Philip"}],"publisher":"Elsevier","file_date_updated":"2018-03-15T10:29:34Z","publication":"Economics Letters","status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:40Z","abstract":[{"lang":"eng","text":"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."}],"user_id":"477","ddc":["040"],"year":"2013","citation":{"mla":"Brangewitz, Sonja, and Jan-Philip Gamp. “Asymmetric Nash Bargaining Solutions and Competitive Payoffs.” Economics Letters, no. 2, Elsevier, 2013, pp. 224–27, doi:10.1016/j.econlet.2013.08.013.","bibtex":"@article{Brangewitz_Gamp_2013, title={Asymmetric Nash bargaining solutions and competitive payoffs}, DOI={10.1016/j.econlet.2013.08.013}, number={2}, journal={Economics Letters}, publisher={Elsevier}, author={Brangewitz, Sonja and Gamp, Jan-Philip}, year={2013}, pages={224–227} }","ama":"Brangewitz S, Gamp J-P. Asymmetric Nash bargaining solutions and competitive payoffs. Economics Letters. 2013;(2):224-227. doi:10.1016/j.econlet.2013.08.013","apa":"Brangewitz, S., & Gamp, J.-P. (2013). Asymmetric Nash bargaining solutions and competitive payoffs. Economics Letters, (2), 224–227. https://doi.org/10.1016/j.econlet.2013.08.013","chicago":"Brangewitz, Sonja, and Jan-Philip Gamp. “Asymmetric Nash Bargaining Solutions and Competitive Payoffs.” Economics Letters, no. 2 (2013): 224–27. https://doi.org/10.1016/j.econlet.2013.08.013.","ieee":"S. Brangewitz and J.-P. Gamp, “Asymmetric Nash bargaining solutions and competitive payoffs,” Economics Letters, no. 2, pp. 224–227, 2013.","short":"S. Brangewitz, J.-P. Gamp, Economics Letters (2013) 224–227."},"type":"journal_article","page":"224 - 227","_id":"554","issue":"2"},{"type":"mastersthesis","citation":{"bibtex":"@book{Setzer_2013, title={Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs}, publisher={Universität Paderborn}, author={Setzer, Alexander}, year={2013} }","mla":"Setzer, Alexander. Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs. Universität Paderborn, 2013.","chicago":"Setzer, Alexander. Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs. Universität Paderborn, 2013.","apa":"Setzer, A. (2013). Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs. Universität Paderborn.","ama":"Setzer A. Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs. Universität Paderborn; 2013.","ieee":"A. Setzer, Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs. Universität Paderborn, 2013.","short":"A. Setzer, Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs, Universität Paderborn, 2013."},"year":"2013","date_updated":"2022-01-06T07:01:59Z","_id":"555","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_created":"2017-10-17T12:42:40Z","status":"public","department":[{"_id":"79"}],"publisher":"Universität Paderborn","author":[{"full_name":"Setzer, Alexander","first_name":"Alexander","id":"11108","last_name":"Setzer"}],"user_id":"477","title":"Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs"},{"_id":"556","date_updated":"2022-01-06T07:01:59Z","language":[{"iso":"ger"}],"citation":{"short":"T. Nickel, Analyse von Benutzeranforderungen von Service-Kompositionen mittels Modelchecking, Universität Paderborn, 2013.","ieee":"T. Nickel, Analyse von Benutzeranforderungen von Service-Kompositionen mittels Modelchecking. Universität Paderborn, 2013.","chicago":"Nickel, Tobias. Analyse von Benutzeranforderungen von Service-Kompositionen mittels Modelchecking. Universität Paderborn, 2013.","ama":"Nickel T. Analyse von Benutzeranforderungen von Service-Kompositionen mittels Modelchecking. Universität Paderborn; 2013.","apa":"Nickel, T. (2013). Analyse von Benutzeranforderungen von Service-Kompositionen mittels Modelchecking. Universität Paderborn.","mla":"Nickel, Tobias. Analyse von Benutzeranforderungen von Service-Kompositionen mittels Modelchecking. Universität Paderborn, 2013.","bibtex":"@book{Nickel_2013, title={Analyse von Benutzeranforderungen von Service-Kompositionen mittels Modelchecking}, publisher={Universität Paderborn}, author={Nickel, Tobias}, year={2013} }"},"year":"2013","type":"bachelorsthesis","user_id":"477","title":"Analyse von Benutzeranforderungen von Service-Kompositionen mittels Modelchecking","author":[{"last_name":"Nickel","first_name":"Tobias","full_name":"Nickel, Tobias"}],"publisher":"Universität Paderborn","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"date_created":"2017-10-17T12:42:40Z","status":"public"},{"abstract":[{"text":"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.","lang":"eng"}],"title":"An Approach for a Decision Support Systems to optimize Water Tanks in Water Supply Systems by combining Network Reduction, Optimization and Simulation","ddc":["040"],"user_id":"15504","publisher":"Universität Paderborn","author":[{"last_name":"Hallmann","full_name":"Hallmann, Corinna","first_name":"Corinna"}],"file_date_updated":"2018-03-15T10:27:58Z","file":[{"file_id":"1283","creator":"florida","file_size":271038,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-03-15T10:27:58Z","date_created":"2018-03-15T10:27:58Z","file_name":"557-Hal13.pdf","access_level":"closed"}],"status":"public","has_accepted_license":"1","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C3","_id":"15"},{"name":"SFB 901 - Project Area C","_id":"4"}],"date_created":"2017-10-17T12:42:40Z","_id":"557","date_updated":"2022-01-06T07:01:59Z","type":"report","citation":{"mla":"Hallmann, Corinna. An Approach for a Decision Support Systems to Optimize Water Tanks in Water Supply Systems by Combining Network Reduction, Optimization and Simulation. Universität Paderborn, 2013.","bibtex":"@book{Hallmann_2013, title={An Approach for a Decision Support Systems to optimize Water Tanks in Water Supply Systems by combining Network Reduction, Optimization and Simulation}, publisher={Universität Paderborn}, author={Hallmann, Corinna}, year={2013} }","chicago":"Hallmann, Corinna. An Approach for a Decision Support Systems to Optimize Water Tanks in Water Supply Systems by Combining Network Reduction, Optimization and Simulation. Universität Paderborn, 2013.","ama":"Hallmann C. An Approach for a Decision Support Systems to Optimize Water Tanks in Water Supply Systems by Combining Network Reduction, Optimization and Simulation. Universität Paderborn; 2013.","apa":"Hallmann, C. (2013). An Approach for a Decision Support Systems to optimize Water Tanks in Water Supply Systems by combining Network Reduction, Optimization and Simulation. Universität Paderborn.","ieee":"C. Hallmann, An Approach for a Decision Support Systems to optimize Water Tanks in Water Supply Systems by combining Network Reduction, Optimization and Simulation. Universität Paderborn, 2013.","short":"C. Hallmann, An Approach for a Decision Support Systems to Optimize Water Tanks in Water Supply Systems by Combining Network Reduction, Optimization and Simulation, Universität Paderborn, 2013."},"year":"2013"},{"date_updated":"2022-01-06T07:02:00Z","oa":"1","language":[{"iso":"eng"}],"title":"Assignments of Collaborative Rescue Units during Emergency Response","department":[{"_id":"277"}],"_id":"5575","intvolume":" 5","issue":"4","type":"journal_article","citation":{"short":"F. Wex, G. Schryen, D. Neumann, International Journal of Information Systems for Crisis Response and Management 5 (2013) 63–80.","ieee":"F. Wex, G. Schryen, and D. Neumann, “Assignments of Collaborative Rescue Units during Emergency Response,” International Journal of Information Systems for Crisis Response and Management, vol. 5, no. 4, pp. 63–80, 2013.","chicago":"Wex, Felix, Guido Schryen, and Dirk Neumann. “Assignments of Collaborative Rescue Units during Emergency Response.” International Journal of Information Systems for Crisis Response and Management 5, no. 4 (2013): 63–80.","apa":"Wex, F., Schryen, G., & Neumann, D. (2013). Assignments of Collaborative Rescue Units during Emergency Response. International Journal of Information Systems for Crisis Response and Management, 5(4), 63–80.","ama":"Wex F, Schryen G, Neumann D. Assignments of Collaborative Rescue Units during Emergency Response. International Journal of Information Systems for Crisis Response and Management. 2013;5(4):63-80.","bibtex":"@article{Wex_Schryen_Neumann_2013, title={Assignments of Collaborative Rescue Units during Emergency Response}, volume={5}, number={4}, journal={International Journal of Information Systems for Crisis Response and Management}, publisher={IGI Publ.}, author={Wex, Felix and Schryen, Guido and Neumann, Dirk}, year={2013}, pages={63–80} }","mla":"Wex, Felix, et al. “Assignments of Collaborative Rescue Units during Emergency Response.” International Journal of Information Systems for Crisis Response and Management, vol. 5, no. 4, IGI Publ., 2013, pp. 63–80."},"year":"2013","page":"63-80","extern":"1","ddc":["000"],"user_id":"61579","author":[{"first_name":"Felix","full_name":"Wex, Felix","last_name":"Wex"},{"last_name":"Schryen","id":"72850","first_name":"Guido","full_name":"Schryen, Guido"},{"last_name":"Neumann","first_name":"Dirk","full_name":"Neumann, Dirk"}],"publisher":"IGI Publ.","publication":"International Journal of Information Systems for Crisis Response and Management","file_date_updated":"2018-12-13T15:13:02Z","file":[{"relation":"main_file","date_updated":"2018-12-13T15:13:02Z","content_type":"application/pdf","creator":"hsiemes","file_id":"6168","file_size":493113,"access_level":"open_access","date_created":"2018-12-11T14:25:51Z","file_name":"ERS_IJISCRAM2013_Revision 1.pdf"}],"volume":5,"has_accepted_license":"1","status":"public","date_created":"2018-11-14T11:14:07Z"},{"language":[{"iso":"eng"}],"citation":{"ama":"Wex F, Schryen G, Neumann D. Decision Modeling for Assignments of Collaborative Rescue Units during Emergency Response. In: Proceedings of the 46th Hawaii International Conference on System Science. ; 2013.","apa":"Wex, F., Schryen, G., & Neumann, D. (2013). Decision Modeling for Assignments of Collaborative Rescue Units during Emergency Response. In Proceedings of the 46th Hawaii International Conference on System Science.","chicago":"Wex, Felix, Guido Schryen, and Dirk Neumann. “Decision Modeling for Assignments of Collaborative Rescue Units during Emergency Response.” In Proceedings of the 46th Hawaii International Conference on System Science, 2013.","mla":"Wex, Felix, et al. “Decision Modeling for Assignments of Collaborative Rescue Units during Emergency Response.” Proceedings of the 46th Hawaii International Conference on System Science, 2013.","bibtex":"@inproceedings{Wex_Schryen_Neumann_2013, title={Decision Modeling for Assignments of Collaborative Rescue Units during Emergency Response}, booktitle={Proceedings of the 46th Hawaii International Conference on System Science}, author={Wex, Felix and Schryen, Guido and Neumann, Dirk}, year={2013} }","short":"F. Wex, G. Schryen, D. Neumann, in: Proceedings of the 46th Hawaii International Conference on System Science, 2013.","ieee":"F. Wex, G. Schryen, and D. Neumann, “Decision Modeling for Assignments of Collaborative Rescue Units during Emergency Response,” in Proceedings of the 46th Hawaii International Conference on System Science, 2013."},"year":"2013","type":"conference","oa":"1","_id":"5576","date_updated":"2022-01-06T07:02:00Z","date_created":"2018-11-14T11:14:56Z","status":"public","has_accepted_license":"1","file":[{"access_level":"open_access","date_created":"2018-12-07T12:00:30Z","file_name":"ERS_HICSS2013_revised_v11-ACM [number].pdf","content_type":"application/pdf","date_updated":"2018-12-13T15:12:05Z","relation":"main_file","file_size":394101,"file_id":"6049","creator":"hsiemes"}],"publication":"Proceedings of the 46th Hawaii International Conference on System Science","file_date_updated":"2018-12-13T15:12:05Z","department":[{"_id":"277"}],"author":[{"last_name":"Wex","full_name":"Wex, Felix","first_name":"Felix"},{"id":"72850","last_name":"Schryen","full_name":"Schryen, Guido","first_name":"Guido"},{"last_name":"Neumann","full_name":"Neumann, Dirk","first_name":"Dirk"}],"user_id":"61579","title":"Decision Modeling for Assignments of Collaborative Rescue Units during Emergency Response","ddc":["000"],"extern":"1"},{"doi":"10.1007/978-3-642-45346-5","date_updated":"2022-01-06T07:02:02Z","language":[{"iso":"eng"}],"series_title":"LNCS","title":"Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics","editor":[{"last_name":"Flocchini","first_name":"Paola","full_name":"Flocchini, Paola"},{"first_name":"Jie","full_name":"Gao, Jie","last_name":"Gao"},{"last_name":"Kranakis","full_name":"Kranakis, Evangelos","first_name":"Evangelos"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"}],"conference":{"end_date":"2013-09-06","location":"Sophia Antipolis, France","start_date":"2013-09-05","name":"ALGOSENSORS 2013"},"intvolume":" 8243","_id":"558","year":"2013","citation":{"short":"P. Flocchini, J. Gao, E. Kranakis, F. Meyer auf der Heide, eds., Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, Springer, 2013.","ieee":"P. Flocchini, J. Gao, E. Kranakis, and F. Meyer auf der Heide, Eds., Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, vol. 8243. Springer, 2013.","chicago":"Flocchini, Paola, Jie Gao, Evangelos Kranakis, and Friedhelm Meyer auf der Heide, eds. Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics. Vol. 8243. LNCS. Springer, 2013. https://doi.org/10.1007/978-3-642-45346-5.","ama":"Flocchini P, Gao J, Kranakis E, Meyer auf der Heide F, eds. Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics. Vol 8243. Springer; 2013. doi:10.1007/978-3-642-45346-5","apa":"Flocchini, P., Gao, J., Kranakis, E., & Meyer auf der Heide, F. (Eds.). (2013). Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (Vol. 8243). Presented at the ALGOSENSORS 2013, Sophia Antipolis, France: Springer. https://doi.org/10.1007/978-3-642-45346-5","mla":"Flocchini, Paola, et al., editors. Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics. Vol. 8243, Springer, 2013, doi:10.1007/978-3-642-45346-5.","bibtex":"@book{Flocchini_Gao_Kranakis_Meyer auf der Heide_2013, series={LNCS}, title={Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics}, volume={8243}, DOI={10.1007/978-3-642-45346-5}, publisher={Springer}, year={2013}, collection={LNCS} }"},"type":"conference_editor","ddc":["000"],"user_id":"477","volume":8243,"date_created":"2017-10-17T12:42:41Z","status":"public","has_accepted_license":"1","file_date_updated":"2018-11-02T16:29:07Z","publisher":"Springer","file":[{"file_name":"2014_Book_AlgorithmsForSensorSystems-1.pdf","date_created":"2018-11-02T16:29:07Z","access_level":"closed","file_size":9186107,"creator":"ups","file_id":"5327","date_updated":"2018-11-02T16:29:07Z","content_type":"application/pdf","relation":"main_file","success":1}]},{"page":"35-42","year":"2013","type":"conference","citation":{"short":"P. Wette, K. Graffi, in: Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 35–42.","ieee":"P. Wette and K. Graffi, “Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables,” in Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 35–42.","chicago":"Wette, Philip, and Kalman Graffi. “Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables.” In Proceedings of the Conference on Networked Systems (NetSys), 35–42, 2013. https://doi.org/10.1109/NetSys.2013.9.","apa":"Wette, P., & Graffi, K. (2013). Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables. In Proceedings of the Conference on Networked Systems (NetSys) (pp. 35–42). https://doi.org/10.1109/NetSys.2013.9","ama":"Wette P, Graffi K. Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables. In: Proceedings of the Conference on Networked Systems (NetSys). ; 2013:35-42. doi:10.1109/NetSys.2013.9","bibtex":"@inproceedings{Wette_Graffi_2013, title={Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables}, DOI={10.1109/NetSys.2013.9}, booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Wette, Philip and Graffi, Kalman}, year={2013}, pages={35–42} }","mla":"Wette, Philip, and Kalman Graffi. “Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables.” Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 35–42, doi:10.1109/NetSys.2013.9."},"_id":"559","date_created":"2017-10-17T12:42:41Z","status":"public","has_accepted_license":"1","file_date_updated":"2018-03-15T10:27:21Z","publication":"Proceedings of the Conference on Networked Systems (NetSys)","author":[{"last_name":"Wette","full_name":"Wette, Philip","first_name":"Philip"},{"full_name":"Graffi, Kalman","first_name":"Kalman","last_name":"Graffi"}],"file":[{"relation":"main_file","success":1,"date_updated":"2018-03-15T10:27:21Z","content_type":"application/pdf","file_id":"1282","creator":"florida","file_size":734618,"access_level":"closed","date_created":"2018-03-15T10:27:21Z","file_name":"559-Adding.Capacity.Aware.Storage.Indirection.to.Homogeneous.Distributed.Hash.Tables.pdf"}],"ddc":["040"],"user_id":"477","abstract":[{"text":"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.","lang":"eng"}],"language":[{"iso":"eng"}],"doi":"10.1109/NetSys.2013.9","date_updated":"2022-01-06T07:02:04Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}],"title":"Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables"},{"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:41Z","author":[{"last_name":"Platenius","first_name":"Marie","full_name":"Platenius, Marie"},{"last_name":"von Detten","full_name":"von Detten, Markus","first_name":"Markus"},{"last_name":"Becker","first_name":"Steffen","full_name":"Becker, Steffen"},{"last_name":"Schäfer","first_name":"Wilhelm","full_name":"Schäfer, Wilhelm"},{"full_name":"Engels, Gregor","first_name":"Gregor","id":"107","last_name":"Engels"}],"file_date_updated":"2018-03-15T10:26:49Z","publication":"Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based Software Engineering","file":[{"content_type":"application/pdf","date_updated":"2018-03-15T10:26:49Z","success":1,"relation":"main_file","file_size":570580,"creator":"florida","file_id":"1281","access_level":"closed","date_created":"2018-03-15T10:26:49Z","file_name":"560-Platenius_et_al_CBSE2013.pdf"}],"ddc":["040"],"user_id":"477","abstract":[{"lang":"eng","text":"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."}],"type":"conference","year":"2013","citation":{"bibtex":"@inproceedings{Platenius_von Detten_Becker_Schäfer_Engels_2013, title={A Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing}, DOI={10.1145/2465449.2465454}, booktitle={Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based Software Engineering}, author={Platenius, Marie and von Detten, Markus and Becker, Steffen and Schäfer, Wilhelm and Engels, Gregor}, year={2013}, pages={143–152} }","mla":"Platenius, Marie, et al. “A Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing.” Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based Software Engineering, 2013, pp. 143–52, doi:10.1145/2465449.2465454.","ama":"Platenius M, von Detten M, Becker S, Schäfer W, Engels G. A Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing. In: Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based Software Engineering. ; 2013:143-152. doi:10.1145/2465449.2465454","apa":"Platenius, M., von Detten, M., Becker, S., Schäfer, W., & Engels, G. (2013). A Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing. In Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based Software Engineering (pp. 143–152). https://doi.org/10.1145/2465449.2465454","chicago":"Platenius, Marie, Markus von Detten, Steffen Becker, Wilhelm Schäfer, and Gregor Engels. “A Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing.” In Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based Software Engineering, 143–52, 2013. https://doi.org/10.1145/2465449.2465454.","ieee":"M. Platenius, M. von Detten, S. Becker, W. Schäfer, and G. Engels, “A Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing,” in Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based Software Engineering, 2013, pp. 143–152.","short":"M. Platenius, M. von Detten, S. Becker, W. Schäfer, G. Engels, in: Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based Software Engineering, 2013, pp. 143–152."},"page":"143-152","_id":"560","project":[{"_id":"1","name":"SFB 901"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"department":[{"_id":"66"},{"_id":"76"}],"title":"A Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing","language":[{"iso":"eng"}],"doi":"10.1145/2465449.2465454","date_updated":"2022-01-06T07:02:06Z"}]