[{"department":[{"_id":"66"}],"user_id":"8447","_id":"5741","language":[{"iso":"eng"}],"publication":"Ubiquitous Computing and Ambient Intelligence - 11th International Conference, UCAmI 2017, Philadelphia, PA, USA, November 7-10, 2017, Proceedings","type":"conference","status":"public","author":[{"first_name":"Enes","orcid":"0000-0002-5967-833X","last_name":"Yigitbas","full_name":"Yigitbas, Enes","id":"8447"},{"first_name":"Silas","full_name":"Grün, Silas","last_name":"Grün"},{"id":"447","full_name":"Sauer, Stefan","last_name":"Sauer","first_name":"Stefan"},{"first_name":"Gregor","id":"107","full_name":"Engels, Gregor","last_name":"Engels"}],"date_created":"2018-11-19T15:14:13Z","date_updated":"2022-01-06T07:02:38Z","doi":"10.1007/978-3-319-67585-5\\_61","title":"Model-Driven Context Management for Self-adaptive User Interfaces","page":"624-635","citation":{"ama":"Yigitbas E, Grün S, Sauer S, Engels G. Model-Driven Context Management for Self-adaptive User Interfaces. In: <i>Ubiquitous Computing and Ambient Intelligence - 11th International Conference, UCAmI 2017, Philadelphia, PA, USA, November 7-10, 2017, Proceedings</i>. ; 2017:624-635. doi:<a href=\"https://doi.org/10.1007/978-3-319-67585-5\\_61\">10.1007/978-3-319-67585-5\\_61</a>","chicago":"Yigitbas, Enes, Silas Grün, Stefan Sauer, and Gregor Engels. “Model-Driven Context Management for Self-Adaptive User Interfaces.” In <i>Ubiquitous Computing and Ambient Intelligence - 11th International Conference, UCAmI 2017, Philadelphia, PA, USA, November 7-10, 2017, Proceedings</i>, 624–35, 2017. <a href=\"https://doi.org/10.1007/978-3-319-67585-5\\_61\">https://doi.org/10.1007/978-3-319-67585-5\\_61</a>.","ieee":"E. Yigitbas, S. Grün, S. Sauer, and G. Engels, “Model-Driven Context Management for Self-adaptive User Interfaces,” in <i>Ubiquitous Computing and Ambient Intelligence - 11th International Conference, UCAmI 2017, Philadelphia, PA, USA, November 7-10, 2017, Proceedings</i>, 2017, pp. 624–635.","short":"E. Yigitbas, S. Grün, S. Sauer, G. Engels, in: Ubiquitous Computing and Ambient Intelligence - 11th International Conference, UCAmI 2017, Philadelphia, PA, USA, November 7-10, 2017, Proceedings, 2017, pp. 624–635.","bibtex":"@inproceedings{Yigitbas_Grün_Sauer_Engels_2017, title={Model-Driven Context Management for Self-adaptive User Interfaces}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-67585-5\\_61\">10.1007/978-3-319-67585-5\\_61</a>}, booktitle={Ubiquitous Computing and Ambient Intelligence - 11th International Conference, UCAmI 2017, Philadelphia, PA, USA, November 7-10, 2017, Proceedings}, author={Yigitbas, Enes and Grün, Silas and Sauer, Stefan and Engels, Gregor}, year={2017}, pages={624–635} }","mla":"Yigitbas, Enes, et al. “Model-Driven Context Management for Self-Adaptive User Interfaces.” <i>Ubiquitous Computing and Ambient Intelligence - 11th International Conference, UCAmI 2017, Philadelphia, PA, USA, November 7-10, 2017, Proceedings</i>, 2017, pp. 624–35, doi:<a href=\"https://doi.org/10.1007/978-3-319-67585-5\\_61\">10.1007/978-3-319-67585-5\\_61</a>.","apa":"Yigitbas, E., Grün, S., Sauer, S., &#38; Engels, G. (2017). Model-Driven Context Management for Self-adaptive User Interfaces. In <i>Ubiquitous Computing and Ambient Intelligence - 11th International Conference, UCAmI 2017, Philadelphia, PA, USA, November 7-10, 2017, Proceedings</i> (pp. 624–635). <a href=\"https://doi.org/10.1007/978-3-319-67585-5\\_61\">https://doi.org/10.1007/978-3-319-67585-5\\_61</a>"},"year":"2017"},{"type":"conference","publication":"Formal Methods and Software Engineering - 19th International Conference  on Formal Engineering Methods (ICFEM 2017)","abstract":[{"lang":"eng","text":"Information Flow Analysis (IFA) aims at detecting illegal flows of information between program entities. “Legality” is therein specified in terms of various security policies. For the analysis, this opens up two possibilities: building generic, policy independent and building specific, policy dependent IFAs. While the former needs to track all dependencies between program entities, the latter allows for a reduced and thus more efficient analysis.\r\n\r\nIn this paper, we start out by formally defining a policy independent information flow analysis. Next, we show how to specialize this IFA via policy specific variable tracking, and prove soundness of the specialization. We furthermore investigate refinement relationships between policies, allowing an IFA for one policy to be employed for its refinements. As policy refinement depends on concrete program entities, we additionally propose a precomputation of policy refinement conditions, enabling an efficient refinement check for concrete programs."}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-26T15:07:42Z","date_created":"2018-11-26T15:07:42Z","creator":"mtoews","file_size":424031,"file_id":"5836","access_level":"closed","file_name":"Töws-Wehrheim2017_Chapter_PolicyDependentAndIndependentI.pdf"}],"status":"public","project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901","_id":"1"}],"_id":"5769","user_id":"477","department":[{"_id":"77"}],"ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-26T15:07:42Z","publication_status":"published","publication_identifier":{"isbn":["9783319686899","9783319686905"],"issn":["0302-9743","1611-3349"]},"has_accepted_license":"1","year":"2017","citation":{"ieee":"M. Töws and H. Wehrheim, “Policy Dependent and Independent Information Flow Analyses,” in <i>Formal Methods and Software Engineering - 19th International Conference  on Formal Engineering Methods (ICFEM 2017)</i>, 2017, pp. 362–378.","chicago":"Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information Flow Analyses.” In <i>Formal Methods and Software Engineering - 19th International Conference  on Formal Engineering Methods (ICFEM 2017)</i>, 362–78. Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">https://doi.org/10.1007/978-3-319-68690-5_22</a>.","ama":"Töws M, Wehrheim H. Policy Dependent and Independent Information Flow Analyses. In: <i>Formal Methods and Software Engineering - 19th International Conference  on Formal Engineering Methods (ICFEM 2017)</i>. Springer International Publishing; 2017:362-378. doi:<a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">10.1007/978-3-319-68690-5_22</a>","apa":"Töws, M., &#38; Wehrheim, H. (2017). Policy Dependent and Independent Information Flow Analyses. In <i>Formal Methods and Software Engineering - 19th International Conference  on Formal Engineering Methods (ICFEM 2017)</i> (pp. 362–378). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">https://doi.org/10.1007/978-3-319-68690-5_22</a>","bibtex":"@inproceedings{Töws_Wehrheim_2017, title={Policy Dependent and Independent Information Flow Analyses}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">10.1007/978-3-319-68690-5_22</a>}, booktitle={Formal Methods and Software Engineering - 19th International Conference  on Formal Engineering Methods (ICFEM 2017)}, publisher={Springer International Publishing}, author={Töws, Manuel and Wehrheim, Heike}, year={2017}, pages={362–378} }","short":"M. Töws, H. Wehrheim, in: Formal Methods and Software Engineering - 19th International Conference  on Formal Engineering Methods (ICFEM 2017), Springer International Publishing, 2017, pp. 362–378.","mla":"Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information Flow Analyses.” <i>Formal Methods and Software Engineering - 19th International Conference  on Formal Engineering Methods (ICFEM 2017)</i>, Springer International Publishing, 2017, pp. 362–78, doi:<a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">10.1007/978-3-319-68690-5_22</a>."},"page":"362-378","publisher":"Springer International Publishing","date_updated":"2022-01-06T07:02:39Z","date_created":"2018-11-21T09:38:43Z","author":[{"first_name":"Manuel","id":"11315","full_name":"Töws, Manuel","last_name":"Töws"},{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"}],"title":"Policy Dependent and Independent Information Flow Analyses","doi":"10.1007/978-3-319-68690-5_22"},{"publication":"International Journal of Network Management","abstract":[{"lang":"eng","text":"Network function virtualization and software-defined networking allow services consisting of virtual network functions to be designed and implemented with great flexibility by facilitating automatic deployments, migrations, and reconfigurations for services and their components. For extended flexibility, we go beyond seeing services as a fixed chain of functions. We define the service structure in a flexible way that enables changing the order of functions in case the functionality of the service is not influenced by this, and propose a YANG data model for expressing this flexibility. Flexible structures allow the network orchestration system to choose the optimal composition of service components that for example gives the best results for placement of services in the network. When number of flexible services and number of components in each service increase, combinatorial explosion limits the practical use of this flexibility. In this paper, we describe a selection heuristic that gives a Pareto set of the possible compositions of a service as well as possible combinations of different services, with respect to different optimization objectives. Moreover, we present a heuristic algorithm for placement of a combination of services, which aims at placing service components along shortest paths that have enough capacity for accommodating the services. By applying these solutions, we show that allowing flexibility in the service structure is feasible."}],"file":[{"creator":"florida","date_created":"2018-03-21T13:18:13Z","date_updated":"2018-06-13T09:15:42Z","access_level":"open_access","file_name":"58-preprint-ijnm.pdf","file_id":"1579","file_size":2765738,"content_type":"application/pdf","relation":"hidden"},{"file_size":2766920,"file_name":"58-accepted-ijnm.pdf","file_id":"3197","access_level":"open_access","date_updated":"2018-06-13T09:22:37Z","date_created":"2018-06-13T09:22:37Z","creator":"sevilmeh","relation":"main_file","content_type":"application/pdf"}],"ddc":["040"],"issue":"2","year":"2017","publisher":"Wiley Online Library","date_created":"2017-10-17T12:41:02Z","title":"Specification, Composition, and Placement of Network Services with Flexible Structures","type":"journal_article","urn":"582","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"name":"SFB 901 - Project Area C","_id":"4"},{"grant_number":"671517","_id":"25","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks","call_identifier":"5G PPP Phase 1"}],"_id":"58","user_id":"477","department":[{"_id":"75"}],"file_date_updated":"2018-06-13T09:22:37Z","has_accepted_license":"1","citation":{"short":"S. Dräxler, H. Karl, International Journal of Network Management (2017) 1--16.","mla":"Dräxler, Sevil, and Holger Karl. “Specification, Composition, and Placement of Network Services with Flexible Structures.” <i>International Journal of Network Management</i>, no. 2, Wiley Online Library, 2017, pp. 1--16, doi:<a href=\"https://doi.org/10.1002/nem.1963\">10.1002/nem.1963</a>.","bibtex":"@article{Dräxler_Karl_2017, title={Specification, Composition, and Placement of Network Services with Flexible Structures}, DOI={<a href=\"https://doi.org/10.1002/nem.1963\">10.1002/nem.1963</a>}, number={2}, journal={International Journal of Network Management}, publisher={Wiley Online Library}, author={Dräxler, Sevil and Karl, Holger}, year={2017}, pages={1--16} }","apa":"Dräxler, S., &#38; Karl, H. (2017). Specification, Composition, and Placement of Network Services with Flexible Structures. <i>International Journal of Network Management</i>, (2), 1--16. <a href=\"https://doi.org/10.1002/nem.1963\">https://doi.org/10.1002/nem.1963</a>","ieee":"S. Dräxler and H. Karl, “Specification, Composition, and Placement of Network Services with Flexible Structures,” <i>International Journal of Network Management</i>, no. 2, pp. 1--16, 2017.","chicago":"Dräxler, Sevil, and Holger Karl. “Specification, Composition, and Placement of Network Services with Flexible Structures.” <i>International Journal of Network Management</i>, no. 2 (2017): 1--16. <a href=\"https://doi.org/10.1002/nem.1963\">https://doi.org/10.1002/nem.1963</a>.","ama":"Dräxler S, Karl H. Specification, Composition, and Placement of Network Services with Flexible Structures. <i>International Journal of Network Management</i>. 2017;(2):1--16. doi:<a href=\"https://doi.org/10.1002/nem.1963\">10.1002/nem.1963</a>"},"page":"1--16","date_updated":"2022-01-06T07:02:42Z","oa":"1","author":[{"first_name":"Sevil","last_name":"Dräxler","id":"31764","full_name":"Dräxler, Sevil"},{"last_name":"Karl","id":"126","full_name":"Karl, Holger","first_name":"Holger"}],"doi":"10.1002/nem.1963"},{"type":"conference","publication":"Service-Oriented Computing -- ICSOC 2016 Workshops","status":"public","editor":[{"first_name":"Khalil","full_name":"Drira, Khalil","last_name":"Drira"},{"first_name":"Hongbing","full_name":"Wang, Hongbing","last_name":"Wang"},{"first_name":"Qi","full_name":"Yu, Qi","last_name":"Yu"},{"first_name":"Yan","full_name":"Wang, Yan","last_name":"Wang"},{"last_name":"Yan","full_name":"Yan, Yuhong","first_name":"Yuhong"},{"last_name":"Charoy","full_name":"Charoy, François","first_name":"François"},{"last_name":"Mendling","full_name":"Mendling, Jan","first_name":"Jan"},{"first_name":"Mohamed","last_name":"Mohamed","full_name":"Mohamed, Mohamed"},{"full_name":"Wang, Zhongjie","last_name":"Wang","first_name":"Zhongjie"},{"last_name":"Bhiri","full_name":"Bhiri, Sami","first_name":"Sami"}],"abstract":[{"text":"A lot of people are managing multiple computing devices suited for different purposes, like private and work devices. Integrating applications running on different devices is often a problem, because the services provided by those applications are not meant to be integrated. In this demonstration, we present our XDAI-A framework which enables cross-device integration of services provided by Android apps. The framework uses adapters to convert Android-internal service interfaces of existing apps into external services with a platform-independent interface that can be accessed from applications on other devices and even other platforms. Our ready-to-use framework does not require to alter existing Android apps, since the adapters are installed separately. For the convenient specification of adapters, our framework comes with a domain-specific language (DSL). Additionally, we provide an infrastructure to find and integrate devices and their applications' services.","lang":"eng"}],"user_id":"39928","department":[{"_id":"66"}],"_id":"5830","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-319-68136-8"]},"citation":{"ama":"Wolters D, Kirchhoff J, Gerth C, Engels G. XDAI-A: Framework for Enabling Cross-Device Integration of Android Apps. In: Drira K, Wang H, Yu Q, et al., eds. <i>Service-Oriented Computing -- ICSOC 2016 Workshops</i>. Cham: Springer International Publishing; 2017:203-206. doi:<a href=\"https://doi.org/10.1007/978-3-319-68136-8_25\">10.1007/978-3-319-68136-8_25</a>","ieee":"D. Wolters, J. Kirchhoff, C. Gerth, and G. Engels, “XDAI-A: Framework for Enabling Cross-Device Integration of Android Apps,” in <i>Service-Oriented Computing -- ICSOC 2016 Workshops</i>, 2017, pp. 203–206.","chicago":"Wolters, Dennis, Jonas Kirchhoff, Christian Gerth, and Gregor Engels. “XDAI-A: Framework for Enabling Cross-Device Integration of Android Apps.” In <i>Service-Oriented Computing -- ICSOC 2016 Workshops</i>, edited by Khalil Drira, Hongbing Wang, Qi Yu, Yan Wang, Yuhong Yan, François Charoy, Jan Mendling, Mohamed Mohamed, Zhongjie Wang, and Sami Bhiri, 203–6. Cham: Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-68136-8_25\">https://doi.org/10.1007/978-3-319-68136-8_25</a>.","short":"D. Wolters, J. Kirchhoff, C. Gerth, G. Engels, in: K. Drira, H. Wang, Q. Yu, Y. Wang, Y. Yan, F. Charoy, J. Mendling, M. Mohamed, Z. Wang, S. Bhiri (Eds.), Service-Oriented Computing -- ICSOC 2016 Workshops, Springer International Publishing, Cham, 2017, pp. 203–206.","mla":"Wolters, Dennis, et al. “XDAI-A: Framework for Enabling Cross-Device Integration of Android Apps.” <i>Service-Oriented Computing -- ICSOC 2016 Workshops</i>, edited by Khalil Drira et al., Springer International Publishing, 2017, pp. 203–06, doi:<a href=\"https://doi.org/10.1007/978-3-319-68136-8_25\">10.1007/978-3-319-68136-8_25</a>.","bibtex":"@inproceedings{Wolters_Kirchhoff_Gerth_Engels_2017, place={Cham}, title={XDAI-A: Framework for Enabling Cross-Device Integration of Android Apps}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-68136-8_25\">10.1007/978-3-319-68136-8_25</a>}, booktitle={Service-Oriented Computing -- ICSOC 2016 Workshops}, publisher={Springer International Publishing}, author={Wolters, Dennis and Kirchhoff, Jonas and Gerth, Christian and Engels, Gregor}, editor={Drira, Khalil and Wang, Hongbing and Yu, Qi and Wang, Yan and Yan, Yuhong and Charoy, François and Mendling, Jan and Mohamed, Mohamed and Wang, Zhongjie and Bhiri, SamiEditors}, year={2017}, pages={203–206} }","apa":"Wolters, D., Kirchhoff, J., Gerth, C., &#38; Engels, G. (2017). XDAI-A: Framework for Enabling Cross-Device Integration of Android Apps. In K. Drira, H. Wang, Q. Yu, Y. Wang, Y. Yan, F. Charoy, … S. Bhiri (Eds.), <i>Service-Oriented Computing -- ICSOC 2016 Workshops</i> (pp. 203–206). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-68136-8_25\">https://doi.org/10.1007/978-3-319-68136-8_25</a>"},"page":"203-206","place":"Cham","year":"2017","author":[{"first_name":"Dennis","id":"11308","full_name":"Wolters, Dennis","last_name":"Wolters"},{"id":"39928","full_name":"Kirchhoff, Jonas","last_name":"Kirchhoff","first_name":"Jonas"},{"first_name":"Christian","last_name":"Gerth","full_name":"Gerth, Christian"},{"first_name":"Gregor","id":"107","full_name":"Engels, Gregor","last_name":"Engels"}],"date_created":"2018-11-26T11:50:44Z","date_updated":"2022-01-06T07:02:43Z","publisher":"Springer International Publishing","doi":"10.1007/978-3-319-68136-8_25","title":"XDAI-A: Framework for Enabling Cross-Device Integration of Android Apps"},{"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T13:17:33Z","_id":"59","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"},{"_id":"541"}],"user_id":"477","abstract":[{"lang":"eng","text":"We consider a scheduling problem on $m$ identical processors sharing an arbitrarily divisible resource. In addition to assigning jobs to processors, the scheduler must distribute the resource among the processors (e.g., for three processors in shares of 20\\%, 15\\%, and 65\\%) and adjust this distribution over time. Each job $j$ comes with a size $p_j \\in \\mathbb{R}$ and a resource requirement $r_j > 0$. Jobs do not benefit when receiving a share larger than $r_j$ of the resource. But providing them with a fraction of the resource requirement causes a linear decrease in the processing efficiency. We seek a (non-preemptive) job and resource assignment minimizing the makespan.Our main result is an efficient approximation algorithm which achieves an approximation ratio of $2 + 1/(m-2)$. It can be improved to an (asymptotic) ratio of $1 + 1/(m-1)$ if all jobs have unit size. Our algorithms also imply new results for a well-known bin packing problem with splittable items and a restricted number of allowed item parts per bin.Based upon the above solution, we also derive an approximation algorithm with similar guarantees for a setting in which we introduce so-called tasks each containing several jobs and where we are interested in the average completion time of tasks (a task is completed when all its jobs are completed)."}],"status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T13:17:33Z","date_created":"2018-03-21T13:17:33Z","creator":"florida","file_size":784867,"file_name":"59-progress.pdf","file_id":"1578","access_level":"closed"}],"publication":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","type":"conference","title":"Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource","doi":"10.1145/3087556.3087578","date_updated":"2022-01-06T07:02:46Z","author":[{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"first_name":"Alexander","id":"13536","full_name":"Mäcker, Alexander","last_name":"Mäcker"},{"first_name":"Sören","full_name":"Riechers, Sören","last_name":"Riechers"},{"first_name":"Alexander","full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik"}],"date_created":"2017-10-17T12:41:02Z","year":"2017","page":"123--132","citation":{"ama":"Kling P, Mäcker A, Riechers S, Skopalik A. Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. In: <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2017:123--132. doi:<a href=\"https://doi.org/10.1145/3087556.3087578\">10.1145/3087556.3087578</a>","chicago":"Kling, Peter, Alexander Mäcker, Sören Riechers, and Alexander Skopalik. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” In <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 123--132, 2017. <a href=\"https://doi.org/10.1145/3087556.3087578\">https://doi.org/10.1145/3087556.3087578</a>.","ieee":"P. Kling, A. Mäcker, S. Riechers, and A. Skopalik, “Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource,” in <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2017, pp. 123--132.","apa":"Kling, P., Mäcker, A., Riechers, S., &#38; Skopalik, A. (2017). Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. In <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 123--132). <a href=\"https://doi.org/10.1145/3087556.3087578\">https://doi.org/10.1145/3087556.3087578</a>","short":"P. Kling, A. Mäcker, S. Riechers, A. Skopalik, in: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132.","bibtex":"@inproceedings{Kling_Mäcker_Riechers_Skopalik_2017, title={Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource}, DOI={<a href=\"https://doi.org/10.1145/3087556.3087578\">10.1145/3087556.3087578</a>}, booktitle={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Kling, Peter and Mäcker, Alexander and Riechers, Sören and Skopalik, Alexander}, year={2017}, pages={123--132} }","mla":"Kling, Peter, et al. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2017, pp. 123--132, doi:<a href=\"https://doi.org/10.1145/3087556.3087578\">10.1145/3087556.3087578</a>."},"has_accepted_license":"1"},{"status":"public","editor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Mohammad","full_name":"Taghi Hajiaghayi, Mohammad","last_name":"Taghi Hajiaghayi"}],"type":"conference_editor","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"7"},{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"5980","citation":{"ieee":"C. Scheideler and M. Taghi Hajiaghayi, Eds., <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017</i>. ACM, 2017.","chicago":"Scheideler, Christian, and Mohammad Taghi Hajiaghayi, eds. <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017</i>. ACM, 2017. <a href=\"https://doi.org/10.1145/3087556\">https://doi.org/10.1145/3087556</a>.","ama":"Scheideler C, Taghi Hajiaghayi M, eds. <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017</i>. ACM; 2017. doi:<a href=\"https://doi.org/10.1145/3087556\">10.1145/3087556</a>","bibtex":"@book{Scheideler_Taghi Hajiaghayi_2017, title={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017}, DOI={<a href=\"https://doi.org/10.1145/3087556\">10.1145/3087556</a>}, publisher={ACM}, year={2017} }","mla":"Scheideler, Christian, and Mohammad Taghi Hajiaghayi, editors. <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017</i>. ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3087556\">10.1145/3087556</a>.","short":"C. Scheideler, M. Taghi Hajiaghayi, eds., Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017, ACM, 2017.","apa":"Scheideler, C., &#38; Taghi Hajiaghayi, M. (Eds.). (2017). <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017</i>. ACM. <a href=\"https://doi.org/10.1145/3087556\">https://doi.org/10.1145/3087556</a>"},"year":"2017","publication_identifier":{"isbn":["978-1-4503-4593-4"]},"doi":"10.1145/3087556","title":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017","date_created":"2018-11-29T10:23:12Z","publisher":"ACM","date_updated":"2022-01-06T07:02:48Z"},{"department":[{"_id":"64"}],"user_id":"477","_id":"60","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"type":"mastersthesis","status":"public","supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"author":[{"full_name":"Niehus, David","last_name":"Niehus","first_name":"David"}],"date_created":"2017-10-17T12:41:03Z","date_updated":"2022-01-06T07:02:49Z","publisher":"Universität Paderborn","title":"Semantically Secure Attribute-based Searchable Encryption","citation":{"chicago":"Niehus, David. <i>Semantically Secure Attribute-Based Searchable Encryption</i>. Universität Paderborn, 2017.","ieee":"D. Niehus, <i>Semantically Secure Attribute-based Searchable Encryption</i>. Universität Paderborn, 2017.","ama":"Niehus D. <i>Semantically Secure Attribute-Based Searchable Encryption</i>. Universität Paderborn; 2017.","apa":"Niehus, D. (2017). <i>Semantically Secure Attribute-based Searchable Encryption</i>. Universität Paderborn.","bibtex":"@book{Niehus_2017, title={Semantically Secure Attribute-based Searchable Encryption}, publisher={Universität Paderborn}, author={Niehus, David}, year={2017} }","mla":"Niehus, David. <i>Semantically Secure Attribute-Based Searchable Encryption</i>. Universität Paderborn, 2017.","short":"D. Niehus, Semantically Secure Attribute-Based Searchable Encryption, Universität Paderborn, 2017."},"year":"2017"},{"year":"2017","citation":{"ama":"Strothmann TF. <i>Self-* Algorithms for Distributed Systems</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-150\">10.17619/UNIPB/1-150</a>","chicago":"Strothmann, Thim Frederik. <i>Self-* Algorithms for Distributed Systems</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-150\">https://doi.org/10.17619/UNIPB/1-150</a>.","ieee":"T. F. Strothmann, <i>Self-* Algorithms for Distributed Systems</i>. Universität Paderborn, 2017.","apa":"Strothmann, T. F. (2017). <i>Self-* Algorithms for Distributed Systems</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-150\">https://doi.org/10.17619/UNIPB/1-150</a>","mla":"Strothmann, Thim Frederik. <i>Self-* Algorithms for Distributed Systems</i>. Universität Paderborn, 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-150\">10.17619/UNIPB/1-150</a>.","short":"T.F. Strothmann, Self-* Algorithms for Distributed Systems, Universität Paderborn, 2017.","bibtex":"@book{Strothmann_2017, title={Self-* Algorithms for Distributed Systems}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-150\">10.17619/UNIPB/1-150</a>}, publisher={Universität Paderborn}, author={Strothmann, Thim Frederik}, year={2017} }"},"title":"Self-* Algorithms for Distributed Systems","doi":"10.17619/UNIPB/1-150","date_updated":"2022-01-06T07:02:52Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"date_created":"2017-10-17T12:41:03Z","author":[{"first_name":"Thim Frederik","last_name":"Strothmann","full_name":"Strothmann, Thim Frederik","id":"11319"}],"status":"public","type":"dissertation","language":[{"iso":"eng"}],"_id":"61","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}],"user_id":"477"},{"department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"user_id":"30457","series_title":"Lecture Notes in Computer Science","_id":"6255","status":"public","type":"book_chapter","conference":{"end_date":"2017-07-14","location":"Vancouver, Canada","name":"International Conference of Design, User Experience, and Usability (DUXU) as part of HCI International 2017","start_date":"2017-07-09"},"doi":"10.1007/978-3-319-58634-2_42","volume":10288,"author":[{"first_name":"Holger Gerhard","last_name":"Fischer","full_name":"Fischer, Holger Gerhard","id":"30457"},{"full_name":"Engler, Michael","last_name":"Engler","first_name":"Michael"},{"last_name":"Sauer","full_name":"Sauer, Stefan","id":"447","first_name":"Stefan"}],"date_updated":"2022-01-06T07:02:58Z","page":"570-583","intvolume":"     10288","citation":{"mla":"Fischer, Holger Gerhard, et al. “A Human-Centered Perspective on Software Quality: Acceptance Criteria for Work 4.0.” <i>Design, User Experience, and Usability: Theory, Methodology, and Management</i>, vol. 10288, Springer International Publishing, 2017, pp. 570–83, doi:<a href=\"https://doi.org/10.1007/978-3-319-58634-2_42\">10.1007/978-3-319-58634-2_42</a>.","short":"H.G. Fischer, M. Engler, S. Sauer, in: Design, User Experience, and Usability: Theory, Methodology, and Management, Springer International Publishing, Cham, 2017, pp. 570–583.","bibtex":"@inbook{Fischer_Engler_Sauer_2017, place={Cham}, series={Lecture Notes in Computer Science}, title={A Human-Centered Perspective on Software Quality: Acceptance Criteria for Work 4.0}, volume={10288}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-58634-2_42\">10.1007/978-3-319-58634-2_42</a>}, booktitle={Design, User Experience, and Usability: Theory, Methodology, and Management}, publisher={Springer International Publishing}, author={Fischer, Holger Gerhard and Engler, Michael and Sauer, Stefan}, year={2017}, pages={570–583}, collection={Lecture Notes in Computer Science} }","apa":"Fischer, H. G., Engler, M., &#38; Sauer, S. (2017). A Human-Centered Perspective on Software Quality: Acceptance Criteria for Work 4.0. In <i>Design, User Experience, and Usability: Theory, Methodology, and Management</i> (Vol. 10288, pp. 570–583). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-58634-2_42\">https://doi.org/10.1007/978-3-319-58634-2_42</a>","ama":"Fischer HG, Engler M, Sauer S. A Human-Centered Perspective on Software Quality: Acceptance Criteria for Work 4.0. In: <i>Design, User Experience, and Usability: Theory, Methodology, and Management</i>. Vol 10288. Lecture Notes in Computer Science. Cham: Springer International Publishing; 2017:570-583. doi:<a href=\"https://doi.org/10.1007/978-3-319-58634-2_42\">10.1007/978-3-319-58634-2_42</a>","chicago":"Fischer, Holger Gerhard, Michael Engler, and Stefan Sauer. “A Human-Centered Perspective on Software Quality: Acceptance Criteria for Work 4.0.” In <i>Design, User Experience, and Usability: Theory, Methodology, and Management</i>, 10288:570–83. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-58634-2_42\">https://doi.org/10.1007/978-3-319-58634-2_42</a>.","ieee":"H. G. Fischer, M. Engler, and S. Sauer, “A Human-Centered Perspective on Software Quality: Acceptance Criteria for Work 4.0,” in <i>Design, User Experience, and Usability: Theory, Methodology, and Management</i>, vol. 10288, Cham: Springer International Publishing, 2017, pp. 570–583."},"place":"Cham","publication_identifier":{"isbn":["9783319586335","9783319586342"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","language":[{"iso":"eng"}],"publication":"Design, User Experience, and Usability: Theory, Methodology, and Management","title":"A Human-Centered Perspective on Software Quality: Acceptance Criteria for Work 4.0","date_created":"2018-12-18T10:44:24Z","publisher":"Springer International Publishing","year":"2017"},{"publication_identifier":{"isbn":["978-3-942647-88-5"]},"place":"Paderborn","year":"2017","citation":{"ama":"Fischer HG, Senft B, Stahl K. Akzeptierte Assistenzsysteme in der Arbeitswelt 4.0 durch systematisches Human-Centered Software Engineering. In: Bodden E, Dressler F, Dumitrescu R, et al., eds. <i>Wissenschafts- und Industrieforum 2017 - Intelligente Technische Systeme</i>. Vol 369. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2017:197-210. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-93\">10.17619/UNIPB/1-93</a>","ieee":"H. G. Fischer, B. Senft, and K. Stahl, “Akzeptierte Assistenzsysteme in der Arbeitswelt 4.0 durch systematisches Human-Centered Software Engineering,” in <i>Wissenschafts- und Industrieforum 2017 - Intelligente Technische Systeme</i>, 2017, vol. 369, pp. 197–210.","chicago":"Fischer, Holger Gerhard, Björn Senft, and Katharina Stahl. “Akzeptierte Assistenzsysteme in der Arbeitswelt 4.0 durch systematisches Human-Centered Software Engineering.” In <i>Wissenschafts- und Industrieforum 2017 - Intelligente Technische Systeme</i>, edited by Eric Bodden, Falko Dressler, Roman Dumitrescu, Jürgen Gausemeier, Friedhelm Meyer auf der Heide, Christoph Scheytt, and Ansgar Trächtler, 369:197–210. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-93\">https://doi.org/10.17619/UNIPB/1-93</a>.","bibtex":"@inproceedings{Fischer_Senft_Stahl_2017, place={Paderborn}, title={Akzeptierte Assistenzsysteme in der Arbeitswelt 4.0 durch systematisches Human-Centered Software Engineering}, volume={369}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-93\">10.17619/UNIPB/1-93</a>}, booktitle={Wissenschafts- und Industrieforum 2017 - Intelligente Technische Systeme}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, author={Fischer, Holger Gerhard and Senft, Björn and Stahl, Katharina}, editor={Bodden, Eric and Dressler, Falko and Dumitrescu, Roman and Gausemeier, Jürgen and Meyer auf der Heide, Friedhelm and Scheytt, Christoph and Trächtler, AnsgarEditors}, year={2017}, pages={197–210} }","mla":"Fischer, Holger Gerhard, et al. “Akzeptierte Assistenzsysteme in der Arbeitswelt 4.0 durch systematisches Human-Centered Software Engineering.” <i>Wissenschafts- und Industrieforum 2017 - Intelligente Technische Systeme</i>, edited by Eric Bodden et al., vol. 369, Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2017, pp. 197–210, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-93\">10.17619/UNIPB/1-93</a>.","short":"H.G. Fischer, B. Senft, K. Stahl, in: E. Bodden, F. Dressler, R. Dumitrescu, J. Gausemeier, F. Meyer auf der Heide, C. Scheytt, A. Trächtler (Eds.), Wissenschafts- und Industrieforum 2017 - Intelligente Technische Systeme, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2017, pp. 197–210.","apa":"Fischer, H. G., Senft, B., &#38; Stahl, K. (2017). Akzeptierte Assistenzsysteme in der Arbeitswelt 4.0 durch systematisches Human-Centered Software Engineering. In E. Bodden, F. Dressler, R. Dumitrescu, J. Gausemeier, F. Meyer auf der Heide, C. Scheytt, &#38; A. Trächtler (Eds.), <i>Wissenschafts- und Industrieforum 2017 - Intelligente Technische Systeme</i> (Vol. 369, pp. 197–210). Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts. <a href=\"https://doi.org/10.17619/UNIPB/1-93\">https://doi.org/10.17619/UNIPB/1-93</a>"},"intvolume":"       369","page":"197-210","date_updated":"2022-01-06T07:02:58Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","date_created":"2018-12-18T10:47:50Z","author":[{"full_name":"Fischer, Holger Gerhard","id":"30457","last_name":"Fischer","first_name":"Holger Gerhard"},{"first_name":"Björn","last_name":"Senft","full_name":"Senft, Björn","id":"9109"},{"last_name":"Stahl","full_name":"Stahl, Katharina","first_name":"Katharina"}],"volume":369,"title":"Akzeptierte Assistenzsysteme in der Arbeitswelt 4.0 durch systematisches Human-Centered Software Engineering","doi":"10.17619/UNIPB/1-93","type":"conference","publication":"Wissenschafts- und Industrieforum 2017 - Intelligente Technische Systeme","editor":[{"last_name":"Bodden","full_name":"Bodden, Eric","first_name":"Eric"},{"last_name":"Dressler","full_name":"Dressler, Falko","first_name":"Falko"},{"full_name":"Dumitrescu, Roman","last_name":"Dumitrescu","first_name":"Roman"},{"first_name":"Jürgen","full_name":"Gausemeier, Jürgen","last_name":"Gausemeier"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Christoph","full_name":"Scheytt, Christoph","last_name":"Scheytt"},{"full_name":"Trächtler, Ansgar","last_name":"Trächtler","first_name":"Ansgar"}],"status":"public","_id":"6256","user_id":"30457","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"language":[{"iso":"ger"}]},{"editor":[{"full_name":"Hess, Steffen","last_name":"Hess","first_name":"Steffen"},{"first_name":"Holger Gerhard","last_name":"Fischer","full_name":"Fischer, Holger Gerhard","id":"30457"}],"status":"public","type":"conference_editor","language":[{"iso":"ger"}],"_id":"6305","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"user_id":"30457","year":"2017","place":"Regensburg","citation":{"short":"S. Hess, H.G. Fischer, eds., Mensch und Computer 2017 - Usability Professionals. Tagungsband, Gesellschaft für Informatik e.V. und German UPA e.V., Regensburg, 2017.","bibtex":"@book{Hess_Fischer_2017, place={Regensburg}, title={Mensch und Computer 2017 - Usability Professionals. Tagungsband}, publisher={Gesellschaft für Informatik e.V. und German UPA e.V.}, year={2017} }","mla":"Hess, Steffen, and Holger Gerhard Fischer, editors. <i>Mensch und Computer 2017 - Usability Professionals. Tagungsband</i>. Gesellschaft für Informatik e.V. und German UPA e.V., 2017.","apa":"Hess, S., &#38; Fischer, H. G. (Eds.). (2017). <i>Mensch und Computer 2017 - Usability Professionals. Tagungsband</i>. Regensburg: Gesellschaft für Informatik e.V. und German UPA e.V.","ama":"Hess S, Fischer HG, eds. <i>Mensch und Computer 2017 - Usability Professionals. Tagungsband</i>. Regensburg: Gesellschaft für Informatik e.V. und German UPA e.V.; 2017.","ieee":"S. Hess and H. G. Fischer, Eds., <i>Mensch und Computer 2017 - Usability Professionals. Tagungsband</i>. Regensburg: Gesellschaft für Informatik e.V. und German UPA e.V., 2017.","chicago":"Hess, Steffen, and Holger Gerhard Fischer, eds. <i>Mensch und Computer 2017 - Usability Professionals. Tagungsband</i>. Regensburg: Gesellschaft für Informatik e.V. und German UPA e.V., 2017."},"title":"Mensch und Computer 2017 - Usability Professionals. Tagungsband","date_updated":"2022-01-06T07:03:00Z","publisher":"Gesellschaft für Informatik e.V. und German UPA e.V.","date_created":"2018-12-18T13:11:29Z"},{"issue":"1","year":"2017","date_created":"2017-10-17T12:41:03Z","publisher":"IEEE","title":"Response-Time-Optimised Service Deployment: MILP Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate Mixed-integer Functions","publication":"IEEE Transactions on Network and Service Management","file":[{"file_size":1505773,"file_name":"64-07572217.pdf","access_level":"closed","file_id":"1576","date_updated":"2018-03-21T13:15:53Z","creator":"florida","date_created":"2018-03-21T13:15:53Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"A current trend in networking and cloud computing is to provide compute resources at widely distributed sites; this is exemplified by developments such as Network Function Virtualisation. This paves the way for wide-area service deployments with improved service quality: e.g. user-perceived response times can be reduced by offering services at nearby sites. But always assigning users to the nearest site can be a bad decision if this site is already highly utilised. This paper formalises two related decisions of allocating compute resources at different sites and assigning users to them with the goal of minimising the response times while the total number of resources to be allocated is limited – a non-linear capacitated Facility Location Problem with integrated queuing systems. To efficiently handle its non-linearity, we introduce five linear problem linearisations and adapt the currently best heuristic for a similar scenario to our scenario. All six approaches are compared in experiments for solution quality and solving time. Surprisingly, our best optimisation formulation outperforms the heuristic in both time and quality. Additionally, we evaluate the influence of distributions of available compute resources in the network on the response time: The time was halved for some configurations. The presented formulation techniques for our problem linearisations are applicable to a broader optimisation domain.","lang":"eng"}],"ddc":["040"],"has_accepted_license":"1","page":"121--135","citation":{"ama":"Keller M, Karl H. Response-Time-Optimised Service Deployment: MILP Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate Mixed-integer Functions. <i>IEEE Transactions on Network and Service Management</i>. 2017;(1):121--135. doi:<a href=\"https://doi.org/10.1109/TNSM.2016.2611590\">10.1109/TNSM.2016.2611590</a>","ieee":"M. Keller and H. Karl, “Response-Time-Optimised Service Deployment: MILP Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate Mixed-integer Functions,” <i>IEEE Transactions on Network and Service Management</i>, no. 1, pp. 121--135, 2017.","chicago":"Keller, Matthias, and Holger Karl. “Response-Time-Optimised Service Deployment: MILP Formulations of Piece-Wise Linear Functions Approximating Non-Linear Bivariate Mixed-Integer Functions.” <i>IEEE Transactions on Network and Service Management</i>, no. 1 (2017): 121--135. <a href=\"https://doi.org/10.1109/TNSM.2016.2611590\">https://doi.org/10.1109/TNSM.2016.2611590</a>.","bibtex":"@article{Keller_Karl_2017, title={Response-Time-Optimised Service Deployment: MILP Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate Mixed-integer Functions}, DOI={<a href=\"https://doi.org/10.1109/TNSM.2016.2611590\">10.1109/TNSM.2016.2611590</a>}, number={1}, journal={IEEE Transactions on Network and Service Management}, publisher={IEEE}, author={Keller, Matthias and Karl, Holger}, year={2017}, pages={121--135} }","short":"M. Keller, H. Karl, IEEE Transactions on Network and Service Management (2017) 121--135.","mla":"Keller, Matthias, and Holger Karl. “Response-Time-Optimised Service Deployment: MILP Formulations of Piece-Wise Linear Functions Approximating Non-Linear Bivariate Mixed-Integer Functions.” <i>IEEE Transactions on Network and Service Management</i>, no. 1, IEEE, 2017, pp. 121--135, doi:<a href=\"https://doi.org/10.1109/TNSM.2016.2611590\">10.1109/TNSM.2016.2611590</a>.","apa":"Keller, M., &#38; Karl, H. (2017). Response-Time-Optimised Service Deployment: MILP Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate Mixed-integer Functions. <i>IEEE Transactions on Network and Service Management</i>, (1), 121--135. <a href=\"https://doi.org/10.1109/TNSM.2016.2611590\">https://doi.org/10.1109/TNSM.2016.2611590</a>"},"author":[{"full_name":"Keller, Matthias","last_name":"Keller","first_name":"Matthias"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"date_updated":"2022-01-06T07:03:03Z","doi":"10.1109/TNSM.2016.2611590","type":"journal_article","status":"public","department":[{"_id":"75"}],"user_id":"477","_id":"64","project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"name":"SFB 901 - Project Area C","_id":"4"}],"file_date_updated":"2018-03-21T13:15:53Z"},{"citation":{"ama":"Sundermeier J. <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn; 2017.","chicago":"Sundermeier, Jannik. <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn, 2017.","ieee":"J. Sundermeier, <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn, 2017.","apa":"Sundermeier, J. (2017). <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn.","short":"J. Sundermeier, Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions, Universität Paderborn, 2017.","bibtex":"@book{Sundermeier_2017, title={Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions}, publisher={Universität Paderborn}, author={Sundermeier, Jannik}, year={2017} }","mla":"Sundermeier, Jannik. <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn, 2017."},"year":"2017","supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2017-11-14T08:03:45Z","author":[{"full_name":"Sundermeier, Jannik","id":"38705","last_name":"Sundermeier","first_name":"Jannik"}],"date_updated":"2022-01-06T07:03:25Z","publisher":"Universität Paderborn","title":"Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions","type":"mastersthesis","status":"public","user_id":"38705","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"699","language":[{"iso":"eng"}]},{"type":"conference","publication":"Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":287315,"file_id":"5293","file_name":"PriceFluctuationInOnlineLeasin.pdf","access_level":"closed","date_updated":"2018-11-02T15:06:13Z","date_created":"2018-11-02T15:06:13Z","creator":"ups"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"70","user_id":"477","department":[{"_id":"63"}],"ddc":["000"],"file_date_updated":"2018-11-02T15:06:13Z","language":[{"iso":"eng"}],"has_accepted_license":"1","year":"2017","citation":{"ama":"Feldkord B, Markarian C, Meyer auf der Heide F. Price Fluctuations in Online Leasing. In: <i>Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>. ; 2017:17-31. doi:<a href=\"https://doi.org/10.1007/978-3-319-71147-8_2\">10.1007/978-3-319-71147-8_2</a>","ieee":"B. Feldkord, C. Markarian, and F. Meyer auf der Heide, “Price Fluctuations in Online Leasing,” in <i>Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2017, pp. 17–31.","chicago":"Feldkord, Björn, Christine Markarian, and Friedhelm Meyer auf der Heide. “Price Fluctuations in Online Leasing.” In <i>Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 17–31, 2017. <a href=\"https://doi.org/10.1007/978-3-319-71147-8_2\">https://doi.org/10.1007/978-3-319-71147-8_2</a>.","short":"B. Feldkord, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2017, pp. 17–31.","bibtex":"@inproceedings{Feldkord_Markarian_Meyer auf der Heide_2017, title={Price Fluctuations in Online Leasing}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-71147-8_2\">10.1007/978-3-319-71147-8_2</a>}, booktitle={Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Feldkord, Björn and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2017}, pages={17–31} }","mla":"Feldkord, Björn, et al. “Price Fluctuations in Online Leasing.” <i>Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2017, pp. 17–31, doi:<a href=\"https://doi.org/10.1007/978-3-319-71147-8_2\">10.1007/978-3-319-71147-8_2</a>.","apa":"Feldkord, B., Markarian, C., &#38; Meyer auf der Heide, F. (2017). Price Fluctuations in Online Leasing. In <i>Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i> (pp. 17–31). <a href=\"https://doi.org/10.1007/978-3-319-71147-8_2\">https://doi.org/10.1007/978-3-319-71147-8_2</a>"},"page":"17 - 31","date_updated":"2022-01-06T07:03:26Z","date_created":"2017-10-17T12:41:05Z","author":[{"first_name":"Björn","last_name":"Feldkord","full_name":"Feldkord, Björn","id":"22704"},{"last_name":"Markarian","full_name":"Markarian, Christine","id":"37612","first_name":"Christine"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"title":"Price Fluctuations in Online Leasing","doi":"10.1007/978-3-319-71147-8_2"},{"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"700","citation":{"bibtex":"@book{Knollmann_2017, title={A Self-Stabilizing Protocol for Graphs of Diameter Two}, publisher={Universität Paderborn}, author={Knollmann, Till}, year={2017} }","mla":"Knollmann, Till. <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn, 2017.","short":"T. Knollmann, A Self-Stabilizing Protocol for Graphs of Diameter Two, Universität Paderborn, 2017.","apa":"Knollmann, T. (2017). <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn.","ama":"Knollmann T. <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn; 2017.","chicago":"Knollmann, Till. <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn, 2017.","ieee":"T. Knollmann, <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn, 2017."},"year":"2017","title":"A Self-Stabilizing Protocol for Graphs of Diameter Two","supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"author":[{"first_name":"Till","last_name":"Knollmann","full_name":"Knollmann, Till"}],"date_created":"2017-11-14T08:04:35Z","date_updated":"2022-01-06T07:03:26Z","publisher":"Universität Paderborn"},{"language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"701","user_id":"477","department":[{"_id":"79"}],"status":"public","type":"mastersthesis","title":"Self-Stabilizing Spanners for Tree Metrics","date_updated":"2022-01-06T07:03:26Z","publisher":"Universität Paderborn","date_created":"2017-11-14T09:32:39Z","supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"author":[{"first_name":"Thorsten","full_name":"Götte, Thorsten","id":"34727","last_name":"Götte"}],"year":"2017","citation":{"ama":"Götte T. <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn; 2017.","chicago":"Götte, Thorsten. <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn, 2017.","ieee":"T. Götte, <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn, 2017.","bibtex":"@book{Götte_2017, title={Self-Stabilizing Spanners for Tree Metrics}, publisher={Universität Paderborn}, author={Götte, Thorsten}, year={2017} }","mla":"Götte, Thorsten. <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn, 2017.","short":"T. Götte, Self-Stabilizing Spanners for Tree Metrics, Universität Paderborn, 2017.","apa":"Götte, T. (2017). <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn."}},{"citation":{"apa":"Hottung, A., Tanaka, S., &#38; Tierney, K. (2017). Deep Learning Assisted Heuristic Tree Search for the Container Pre-marshalling Problem. <i>CoRR Abs/1709.09972</i>.","bibtex":"@article{Hottung_Tanaka_Tierney_2017, title={Deep Learning Assisted Heuristic Tree Search for the Container Pre-marshalling Problem}, journal={CoRR abs/1709.09972}, author={Hottung, André and Tanaka, Shunji and Tierney, Kevin}, year={2017} }","short":"A. Hottung, S. Tanaka, K. Tierney, CoRR Abs/1709.09972 (2017).","mla":"Hottung, André, et al. “Deep Learning Assisted Heuristic Tree Search for the Container Pre-Marshalling Problem.” <i>CoRR Abs/1709.09972</i>, 2017.","ama":"Hottung A, Tanaka S, Tierney K. Deep Learning Assisted Heuristic Tree Search for the Container Pre-marshalling Problem. <i>CoRR abs/170909972</i>. 2017.","chicago":"Hottung, André, Shunji Tanaka, and Kevin Tierney. “Deep Learning Assisted Heuristic Tree Search for the Container Pre-Marshalling Problem.” <i>CoRR Abs/1709.09972</i>, 2017.","ieee":"A. Hottung, S. Tanaka, and K. Tierney, “Deep Learning Assisted Heuristic Tree Search for the Container Pre-marshalling Problem,” <i>CoRR abs/1709.09972</i>, 2017."},"year":"2017","title":"Deep Learning Assisted Heuristic Tree Search for the Container Pre-marshalling Problem","author":[{"first_name":"André","last_name":"Hottung","full_name":"Hottung, André"},{"full_name":"Tanaka, Shunji","last_name":"Tanaka","first_name":"Shunji"},{"first_name":"Kevin","full_name":"Tierney, Kevin","last_name":"Tierney"}],"date_created":"2019-01-28T08:25:16Z","date_updated":"2022-01-06T07:03:26Z","status":"public","publication":"CoRR abs/1709.09972","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"66"}],"user_id":"52534","_id":"7011"},{"publication":"CSE@SE 2017","type":"journal_article","status":"public","_id":"7012","department":[{"_id":"66"}],"user_id":"52534","language":[{"iso":"eng"}],"year":"2017","page":"18-21","citation":{"ama":"Fazal-Baqaie M, Güldali B, Oberthür S. Towards DevOps in Multi-provider Projects. <i>CSE@SE 2017</i>. 2017:18-21.","chicago":"Fazal-Baqaie, Masud, Baris Güldali, and Simon Oberthür. “Towards DevOps in Multi-Provider Projects.” <i>CSE@SE 2017</i>, 2017, 18–21.","ieee":"M. Fazal-Baqaie, B. Güldali, and S. Oberthür, “Towards DevOps in Multi-provider Projects,” <i>CSE@SE 2017</i>, pp. 18–21, 2017.","mla":"Fazal-Baqaie, Masud, et al. “Towards DevOps in Multi-Provider Projects.” <i>CSE@SE 2017</i>, 2017, pp. 18–21.","bibtex":"@article{Fazal-Baqaie_Güldali_Oberthür_2017, title={Towards DevOps in Multi-provider Projects}, journal={CSE@SE 2017}, author={Fazal-Baqaie, Masud and Güldali, Baris and Oberthür, Simon}, year={2017}, pages={18–21} }","short":"M. Fazal-Baqaie, B. Güldali, S. Oberthür, CSE@SE 2017 (2017) 18–21.","apa":"Fazal-Baqaie, M., Güldali, B., &#38; Oberthür, S. (2017). Towards DevOps in Multi-provider Projects. <i>CSE@SE 2017</i>, 18–21."},"date_updated":"2022-01-06T07:03:26Z","date_created":"2019-01-28T08:28:26Z","author":[{"first_name":"Masud","last_name":"Fazal-Baqaie","full_name":"Fazal-Baqaie, Masud"},{"first_name":"Baris","last_name":"Güldali","full_name":"Güldali, Baris"},{"first_name":"Simon","id":"383","full_name":"Oberthür, Simon","last_name":"Oberthür"}],"title":"Towards DevOps in Multi-provider Projects"},{"title":"Local Algorithms for the Continuous Gathering Problem","doi":"10.17619/UNIPB/1-230","date_updated":"2022-01-06T07:03:26Z","publisher":"Universität Paderborn","author":[{"full_name":"Podlipyan, Pavel","last_name":"Podlipyan","first_name":"Pavel"}],"supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_created":"2017-11-14T14:13:21Z","year":"2017","citation":{"apa":"Podlipyan, P. (2017). <i>Local Algorithms for the Continuous Gathering Problem</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-230\">https://doi.org/10.17619/UNIPB/1-230</a>","short":"P. Podlipyan, Local Algorithms for the Continuous Gathering Problem, Universität Paderborn, 2017.","mla":"Podlipyan, Pavel. <i>Local Algorithms for the Continuous Gathering Problem</i>. Universität Paderborn, 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-230\">10.17619/UNIPB/1-230</a>.","bibtex":"@book{Podlipyan_2017, title={Local Algorithms for the Continuous Gathering Problem}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-230\">10.17619/UNIPB/1-230</a>}, publisher={Universität Paderborn}, author={Podlipyan, Pavel}, year={2017} }","ieee":"P. Podlipyan, <i>Local Algorithms for the Continuous Gathering Problem</i>. Universität Paderborn, 2017.","chicago":"Podlipyan, Pavel. <i>Local Algorithms for the Continuous Gathering Problem</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-230\">https://doi.org/10.17619/UNIPB/1-230</a>.","ama":"Podlipyan P. <i>Local Algorithms for the Continuous Gathering Problem</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-230\">10.17619/UNIPB/1-230</a>"},"related_material":{"link":[{"relation":"confirmation","url":"https://doi.org/10.17619/UNIPB/1-230"}]},"language":[{"iso":"eng"}],"_id":"703","user_id":"15415","department":[{"_id":"63"}],"status":"public","type":"dissertation"},{"supervisor":[{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"date_created":"2017-11-15T07:51:07Z","author":[{"first_name":"Sören","last_name":"Riechers","full_name":"Riechers, Sören"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:27Z","doi":"10.17619/UNIPB/1-231","title":"Scheduling with Scarce Resources","has_accepted_license":"1","citation":{"ama":"Riechers S. <i>Scheduling with Scarce Resources</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-231\">10.17619/UNIPB/1-231</a>","chicago":"Riechers, Sören. <i>Scheduling with Scarce Resources</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-231\">https://doi.org/10.17619/UNIPB/1-231</a>.","ieee":"S. Riechers, <i>Scheduling with Scarce Resources</i>. Universität Paderborn, 2017.","mla":"Riechers, Sören. <i>Scheduling with Scarce Resources</i>. Universität Paderborn, 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-231\">10.17619/UNIPB/1-231</a>.","bibtex":"@book{Riechers_2017, title={Scheduling with Scarce Resources}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-231\">10.17619/UNIPB/1-231</a>}, publisher={Universität Paderborn}, author={Riechers, Sören}, year={2017} }","short":"S. Riechers, Scheduling with Scarce Resources, Universität Paderborn, 2017.","apa":"Riechers, S. (2017). <i>Scheduling with Scarce Resources</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-231\">https://doi.org/10.17619/UNIPB/1-231</a>"},"year":"2017","user_id":"14052","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"704","language":[{"iso":"eng"}],"file_date_updated":"2018-11-14T15:18:37Z","ddc":["000"],"type":"dissertation","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-14T15:18:37Z","date_created":"2018-11-14T15:18:37Z","creator":"feldi","file_size":1491627,"file_name":"thesisStable.pdf","file_id":"5673","access_level":"closed"}],"status":"public"}]