[{"citation":{"ama":"Schwichtenberg S, Gerth C, Huma Z, Engels G. Normalizing Heterogeneous Service Description Models with Generated QVT Transformations. In: <i>Proceedings of the 10th European Conference on Modelling Foundations and Applications (ECMFA)</i>. LNCS. ; 2014:180-195. doi:<a href=\"https://doi.org/10.1007/978-3-319-09195-2_12\">10.1007/978-3-319-09195-2_12</a>","ieee":"S. Schwichtenberg, C. Gerth, Z. Huma, and G. Engels, “Normalizing Heterogeneous Service Description Models with Generated QVT Transformations,” in <i>Proceedings of the 10th European Conference on Modelling Foundations and Applications (ECMFA)</i>, 2014, pp. 180–195.","chicago":"Schwichtenberg, Simon, Christian Gerth, Zille Huma, and Gregor Engels. “Normalizing Heterogeneous Service Description Models with Generated QVT Transformations.” In <i>Proceedings of the 10th European Conference on Modelling Foundations and Applications (ECMFA)</i>, 180–95. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-09195-2_12\">https://doi.org/10.1007/978-3-319-09195-2_12</a>.","apa":"Schwichtenberg, S., Gerth, C., Huma, Z., &#38; Engels, G. (2014). Normalizing Heterogeneous Service Description Models with Generated QVT Transformations. In <i>Proceedings of the 10th European Conference on Modelling Foundations and Applications (ECMFA)</i> (pp. 180–195). <a href=\"https://doi.org/10.1007/978-3-319-09195-2_12\">https://doi.org/10.1007/978-3-319-09195-2_12</a>","mla":"Schwichtenberg, Simon, et al. “Normalizing Heterogeneous Service Description Models with Generated QVT Transformations.” <i>Proceedings of the 10th European Conference on Modelling Foundations and Applications (ECMFA)</i>, 2014, pp. 180–95, doi:<a href=\"https://doi.org/10.1007/978-3-319-09195-2_12\">10.1007/978-3-319-09195-2_12</a>.","bibtex":"@inproceedings{Schwichtenberg_Gerth_Huma_Engels_2014, series={LNCS}, title={Normalizing Heterogeneous Service Description Models with Generated QVT Transformations}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-09195-2_12\">10.1007/978-3-319-09195-2_12</a>}, booktitle={Proceedings of the 10th European Conference on Modelling Foundations and Applications (ECMFA)}, author={Schwichtenberg, Simon and Gerth, Christian and Huma, Zille and Engels, Gregor}, year={2014}, pages={180–195}, collection={LNCS} }","short":"S. Schwichtenberg, C. Gerth, Z. Huma, G. Engels, in: Proceedings of the 10th European Conference on Modelling Foundations and Applications (ECMFA), 2014, pp. 180–195."},"page":"180-195","has_accepted_license":"1","doi":"10.1007/978-3-319-09195-2_12","date_updated":"2022-01-06T06:59:58Z","author":[{"first_name":"Simon","id":"13235","full_name":"Schwichtenberg, Simon","last_name":"Schwichtenberg"},{"first_name":"Christian","last_name":"Gerth","full_name":"Gerth, Christian"},{"last_name":"Huma","full_name":"Huma, Zille","first_name":"Zille"},{"id":"107","full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"}],"status":"public","type":"conference","file_date_updated":"2018-03-20T06:59:55Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"394","user_id":"477","series_title":"LNCS","department":[{"_id":"66"}],"year":"2014","title":"Normalizing Heterogeneous Service Description Models with Generated QVT Transformations","date_created":"2017-10-17T12:42:08Z","abstract":[{"lang":"eng","text":"Service Oriented Architectures (SOAs) enable the reuse and substitution of software services to develop highly flexible software systems. To benefit from the growing plethora of available services, sophisticated service discovery approaches are needed that bring service requests and offers together. Such approaches rely on rich service descriptions, which specify also the behavior of provided/requested services, e.g., by pre- and postconditions of operations. As a base for the specification a data schema is used, which specifies the used data types and their relations. However, data schemas are typically heterogeneous wrt. their structure and terminology, since they are created individually in their diverse application contexts. As a consequence the behavioral models that are typed over the heterogeneous data schemas, cannot be compared directly. In this paper, we present an holistic approach to normalize rich service description models to enable behavior-aware service discovery. The approach consists of a matching algorithm that helps to resolve structural and terminological heterogeneity in data schemas by exploiting domain-specific background ontologies. The resulting data schema mappings are represented in terms of Query View Transformation (QVT) relations that even reflect complex n:m correspondences. By executing the transformation, behavioral models are automatically normalized, which is a prerequisite for a behavior-aware operation matching."}],"file":[{"file_size":1107805,"file_name":"394-SGHE14.pdf","file_id":"1383","access_level":"closed","date_updated":"2018-03-20T06:59:55Z","date_created":"2018-03-20T06:59:55Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"publication":"Proceedings of the 10th European Conference on Modelling Foundations and Applications (ECMFA)","ddc":["040"],"language":[{"iso":"eng"}]},{"year":"2014","date_created":"2017-10-17T12:42:09Z","title":"Multilevel Network Games","publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1382","access_level":"closed","file_name":"395-WINE2014ACJS.pdf","file_size":161479,"date_created":"2018-03-20T06:59:20Z","creator":"florida","date_updated":"2018-03-20T06:59:20Z"}],"abstract":[{"lang":"eng","text":"We consider a multilevel network game, where nodes can improvetheir communication costs by connecting to a high-speed network.The n nodes are connected by a static network and each node can decideindividually to become a gateway to the high-speed network. The goalof a node v is to minimize its private costs, i.e., the sum (SUM-game) ormaximum (MAX-game) of communication distances from v to all othernodes plus a fixed price α > 0 if it decides to be a gateway. Between gatewaysthe communication distance is 0, and gateways also improve othernodes’ distances by behaving as shortcuts. For the SUM-game, we showthat for α ≤ n − 1, the price of anarchy is Θ (n/√α) and in this rangeequilibria always exist. In range α ∈ (n−1, n(n−1)) the price of anarchyis Θ(√α), and for α ≥ n(n − 1) it is constant. For the MAX-game, weshow that the price of anarchy is either Θ (1 + n/√α), for α ≥ 1, orelse 1. Given a graph with girth of at least 4α, equilibria always exist.Concerning the dynamics, both games are not potential games. For theSUM-game, we even show that it is not weakly acyclic."}],"language":[{"iso":"eng"}],"ddc":["040"],"has_accepted_license":"1","citation":{"mla":"Abshoff, Sebastian, et al. “Multilevel Network Games.” <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 435–40, doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_36\">10.1007/978-3-319-13129-0_36</a>.","short":"S. Abshoff, A. Cord-Landwehr, D. Jung, A. Skopalik, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 435–440.","bibtex":"@inproceedings{Abshoff_Cord-Landwehr_Jung_Skopalik_2014, series={LNCS}, title={Multilevel Network Games}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-13129-0_36\">10.1007/978-3-319-13129-0_36</a>}, booktitle={Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}, author={Abshoff, Sebastian and Cord-Landwehr, Andreas and Jung, Daniel and Skopalik, Alexander}, year={2014}, pages={435–440}, collection={LNCS} }","apa":"Abshoff, S., Cord-Landwehr, A., Jung, D., &#38; Skopalik, A. (2014). Multilevel Network Games. In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i> (pp. 435–440). <a href=\"https://doi.org/10.1007/978-3-319-13129-0_36\">https://doi.org/10.1007/978-3-319-13129-0_36</a>","ieee":"S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Multilevel Network Games,” in <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 435–440.","chicago":"Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik. “Multilevel Network Games.” In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 435–40. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13129-0_36\">https://doi.org/10.1007/978-3-319-13129-0_36</a>.","ama":"Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Multilevel Network Games. In: <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>. LNCS. ; 2014:435-440. doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_36\">10.1007/978-3-319-13129-0_36</a>"},"page":"435-440","author":[{"last_name":"Abshoff","full_name":"Abshoff, Sebastian","first_name":"Sebastian"},{"last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas","first_name":"Andreas"},{"first_name":"Daniel","id":"37827","full_name":"Jung, Daniel","last_name":"Jung"},{"id":"40384","full_name":"Skopalik, Alexander","last_name":"Skopalik","first_name":"Alexander"}],"date_updated":"2022-01-06T06:59:59Z","doi":"10.1007/978-3-319-13129-0_36","type":"conference","status":"public","series_title":"LNCS","user_id":"15415","department":[{"_id":"63"},{"_id":"541"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"395","file_date_updated":"2018-03-20T06:59:20Z"},{"abstract":[{"lang":"eng","text":"We present a factor $14D^2$ approximation algorithm for the minimum linear arrangement problem on series-parallel graphs, where $D$ is the maximum degree in the graph. Given a suitable decomposition of the graph, our algorithm runs in time $O(|E|)$ and is very easy to implement. Its divide-and-conquer approach allows for an effective parallelization. Note that a suitable decomposition can also be computed in time $O(|E|\\log{|E|})$ (or even $O(\\log{|E|}\\log^*{|E|})$ on an EREW PRAM using $O(|E|)$ processors). For the proof of the approximation ratio, we use a sophisticated charging method that uses techniques similar to amortized analysis in advanced data structures. On general graphs, the minimum linear arrangement problem is known to be NP-hard. To the best of our knowledge, the minimum linear arrangement problem on series-parallel graphs has not been studied before."}],"file":[{"file_size":365818,"access_level":"closed","file_id":"1381","file_name":"397-WAOA14_01.pdf","date_updated":"2018-03-20T06:58:44Z","creator":"florida","date_created":"2018-03-20T06:58:44Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"conference","publication":"Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)","ddc":["040"],"file_date_updated":"2018-03-20T06:58:44Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"397","series_title":"LNCS","user_id":"15504","department":[{"_id":"79"}],"year":"2014","citation":{"chicago":"Scheideler, Christian, Martina Eikel, and Alexander Setzer. “Minimum Linear Arrangement of Series-Parallel Graphs.” In <i>Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)</i>, 168--180. LNCS, 2014.","ieee":"C. Scheideler, M. Eikel, and A. Setzer, “Minimum Linear Arrangement of Series-Parallel Graphs,” in <i>Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)</i>, 2014, pp. 168--180.","ama":"Scheideler C, Eikel M, Setzer A. Minimum Linear Arrangement of Series-Parallel Graphs. In: <i>Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)</i>. LNCS. ; 2014:168--180.","apa":"Scheideler, C., Eikel, M., &#38; Setzer, A. (2014). Minimum Linear Arrangement of Series-Parallel Graphs. In <i>Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)</i> (pp. 168--180).","bibtex":"@inproceedings{Scheideler_Eikel_Setzer_2014, series={LNCS}, title={Minimum Linear Arrangement of Series-Parallel Graphs}, booktitle={Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)}, author={Scheideler, Christian and Eikel, Martina and Setzer, Alexander}, year={2014}, pages={168--180}, collection={LNCS} }","mla":"Scheideler, Christian, et al. “Minimum Linear Arrangement of Series-Parallel Graphs.” <i>Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)</i>, 2014, pp. 168--180.","short":"C. Scheideler, M. Eikel, A. Setzer, in: Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA), 2014, pp. 168--180."},"page":"168--180","has_accepted_license":"1","title":"Minimum Linear Arrangement of Series-Parallel Graphs","date_updated":"2022-01-06T07:00:02Z","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Martina","last_name":"Eikel","full_name":"Eikel, Martina"},{"first_name":"Alexander","id":"11108","full_name":"Setzer, Alexander","last_name":"Setzer"}],"date_created":"2017-10-17T12:42:09Z"},{"department":[{"_id":"78"}],"user_id":"477","_id":"399","project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-20T06:57:44Z","ddc":["040"],"publication":"Proceedings of the International Conference on Field-Programmable Technology (FPT)","type":"conference","status":"public","file":[{"date_created":"2018-03-20T06:57:44Z","creator":"florida","date_updated":"2018-03-20T06:57:44Z","access_level":"closed","file_id":"1380","file_name":"399-wiersema14_fpt_IEEE_approved.pdf","file_size":404328,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"text":"Ensuring memory access security is a challenge for reconfigurable systems with multiple cores. Previous work introduced access monitors attached to the memory subsystem to ensure that the cores adhere to pre-defined protocols when accessing memory. In this paper, we combine access monitors with a formal runtime verification technique known as proof-carrying hardware to guarantee memory security. We extend previous work on proof-carrying hardware by covering sequential circuits and demonstrate our approach with a prototype leveraging ReconOS/Zynq with an embedded ZUMA virtual FPGA overlay. Experiments show the feasibility of the approach and the capabilities of the prototype, which constitutes the first realization of proof-carrying hardware on real FPGAs. The area overheads for the virtual FPGA are measured as 2x-10x, depending on the resource type. The delay overhead is substantial with almost 100x, but this is an extremely pessimistic estimate that will be lowered once accurate timing analysis for FPGA overlays become available. Finally, reconfiguration time for the virtual FPGA is about one order of magnitude lower than for the native Zynq fabric.","lang":"eng"}],"author":[{"first_name":"Tobias","full_name":"Wiersema, Tobias","id":"3118","last_name":"Wiersema"},{"first_name":"Stephanie","last_name":"Drzevitzky","full_name":"Drzevitzky, Stephanie"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"}],"date_created":"2017-10-17T12:42:09Z","date_updated":"2022-01-06T07:00:05Z","doi":"10.1109/FPT.2014.7082771","title":"Memory Security in Reconfigurable Computers: Combining Formal Verification with Monitoring","has_accepted_license":"1","page":"167-174","citation":{"ama":"Wiersema T, Drzevitzky S, Platzner M. Memory Security in Reconfigurable Computers: Combining Formal Verification with Monitoring. In: <i>Proceedings of the International Conference on Field-Programmable Technology (FPT)</i>. ; 2014:167-174. doi:<a href=\"https://doi.org/10.1109/FPT.2014.7082771\">10.1109/FPT.2014.7082771</a>","ieee":"T. Wiersema, S. Drzevitzky, and M. Platzner, “Memory Security in Reconfigurable Computers: Combining Formal Verification with Monitoring,” in <i>Proceedings of the International Conference on Field-Programmable Technology (FPT)</i>, 2014, pp. 167–174.","chicago":"Wiersema, Tobias, Stephanie Drzevitzky, and Marco Platzner. “Memory Security in Reconfigurable Computers: Combining Formal Verification with Monitoring.” In <i>Proceedings of the International Conference on Field-Programmable Technology (FPT)</i>, 167–74, 2014. <a href=\"https://doi.org/10.1109/FPT.2014.7082771\">https://doi.org/10.1109/FPT.2014.7082771</a>.","apa":"Wiersema, T., Drzevitzky, S., &#38; Platzner, M. (2014). Memory Security in Reconfigurable Computers: Combining Formal Verification with Monitoring. In <i>Proceedings of the International Conference on Field-Programmable Technology (FPT)</i> (pp. 167–174). <a href=\"https://doi.org/10.1109/FPT.2014.7082771\">https://doi.org/10.1109/FPT.2014.7082771</a>","bibtex":"@inproceedings{Wiersema_Drzevitzky_Platzner_2014, title={Memory Security in Reconfigurable Computers: Combining Formal Verification with Monitoring}, DOI={<a href=\"https://doi.org/10.1109/FPT.2014.7082771\">10.1109/FPT.2014.7082771</a>}, booktitle={Proceedings of the International Conference on Field-Programmable Technology (FPT)}, author={Wiersema, Tobias and Drzevitzky, Stephanie and Platzner, Marco}, year={2014}, pages={167–174} }","short":"T. Wiersema, S. Drzevitzky, M. Platzner, in: Proceedings of the International Conference on Field-Programmable Technology (FPT), 2014, pp. 167–174.","mla":"Wiersema, Tobias, et al. “Memory Security in Reconfigurable Computers: Combining Formal Verification with Monitoring.” <i>Proceedings of the International Conference on Field-Programmable Technology (FPT)</i>, 2014, pp. 167–74, doi:<a href=\"https://doi.org/10.1109/FPT.2014.7082771\">10.1109/FPT.2014.7082771</a>."},"year":"2014"},{"ddc":["040"],"file_date_updated":"2018-03-16T11:38:13Z","language":[{"iso":"eng"}],"_id":"401","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"66"},{"_id":"76"}],"series_title":"Communications in Computer and Information Science","user_id":"477","abstract":[{"text":"Service matching approaches determine to what extent a provided service matches a requester's requirements. This process is based on service specifications describing functional (e.g., signatures) as well as non-functional properties (e.g., privacy policies). However, we cannot expect service specifications to be complete as providers do not want to share all details of their services' implementation. Moreover, creating complete specifications requires much effort. In this paper, we propose a novel service matching approach taking into account a service's signatures and privacy policies. In particular, our approach applies fuzzy matching techniques that are able to deal with incomplete service specifications. As a benefit, decision-making based on matching results is improved and service matching becomes better applicable in practice.","lang":"eng"}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-16T11:38:13Z","date_updated":"2018-03-16T11:38:13Z","file_id":"1367","file_name":"401-WAS4FI2014.pdf","access_level":"closed","file_size":396656}],"publication":"Proceedings of the 4th International Workshop on Adaptive Services for the Future Internet","type":"conference","title":"Matching of Incomplete Service Specifications Exemplified by Privacy Policy Matching","doi":"10.1007/978-3-319-14886-1_2","date_updated":"2022-01-06T07:00:07Z","author":[{"last_name":"Platenius","full_name":"Platenius, Marie Christin","first_name":"Marie Christin"},{"last_name":"Arifulina","full_name":"Arifulina, Svetlana","first_name":"Svetlana"},{"last_name":"Petrlic","full_name":"Petrlic, Ronald","first_name":"Ronald"},{"full_name":"Schäfer, Wilhelm","last_name":"Schäfer","first_name":"Wilhelm"}],"date_created":"2017-10-17T12:42:10Z","year":"2014","page":"6-17","citation":{"ieee":"M. C. Platenius, S. Arifulina, R. Petrlic, and W. Schäfer, “Matching of Incomplete Service Specifications Exemplified by Privacy Policy Matching,” in <i>Proceedings of the 4th International Workshop on Adaptive Services for the Future Internet</i>, 2014, pp. 6–17.","chicago":"Platenius, Marie Christin, Svetlana Arifulina, Ronald Petrlic, and Wilhelm Schäfer. “Matching of Incomplete Service Specifications Exemplified by Privacy Policy Matching.” In <i>Proceedings of the 4th International Workshop on Adaptive Services for the Future Internet</i>, 6–17. Communications in Computer and Information Science, 2014. <a href=\"https://doi.org/10.1007/978-3-319-14886-1_2\">https://doi.org/10.1007/978-3-319-14886-1_2</a>.","ama":"Platenius MC, Arifulina S, Petrlic R, Schäfer W. Matching of Incomplete Service Specifications Exemplified by Privacy Policy Matching. In: <i>Proceedings of the 4th International Workshop on Adaptive Services for the Future Internet</i>. Communications in Computer and Information Science. ; 2014:6-17. doi:<a href=\"https://doi.org/10.1007/978-3-319-14886-1_2\">10.1007/978-3-319-14886-1_2</a>","bibtex":"@inproceedings{Platenius_Arifulina_Petrlic_Schäfer_2014, series={Communications in Computer and Information Science}, title={Matching of Incomplete Service Specifications Exemplified by Privacy Policy Matching}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-14886-1_2\">10.1007/978-3-319-14886-1_2</a>}, booktitle={Proceedings of the 4th International Workshop on Adaptive Services for the Future Internet}, author={Platenius, Marie Christin and Arifulina, Svetlana and Petrlic, Ronald and Schäfer, Wilhelm}, year={2014}, pages={6–17}, collection={Communications in Computer and Information Science} }","short":"M.C. Platenius, S. Arifulina, R. Petrlic, W. Schäfer, in: Proceedings of the 4th International Workshop on Adaptive Services for the Future Internet, 2014, pp. 6–17.","mla":"Platenius, Marie Christin, et al. “Matching of Incomplete Service Specifications Exemplified by Privacy Policy Matching.” <i>Proceedings of the 4th International Workshop on Adaptive Services for the Future Internet</i>, 2014, pp. 6–17, doi:<a href=\"https://doi.org/10.1007/978-3-319-14886-1_2\">10.1007/978-3-319-14886-1_2</a>.","apa":"Platenius, M. C., Arifulina, S., Petrlic, R., &#38; Schäfer, W. (2014). Matching of Incomplete Service Specifications Exemplified by Privacy Policy Matching. In <i>Proceedings of the 4th International Workshop on Adaptive Services for the Future Internet</i> (pp. 6–17). <a href=\"https://doi.org/10.1007/978-3-319-14886-1_2\">https://doi.org/10.1007/978-3-319-14886-1_2</a>"},"has_accepted_license":"1"},{"language":[{"iso":"eng"}],"ddc":["040"],"file":[{"creator":"florida","date_created":"2018-03-16T11:38:59Z","date_updated":"2018-03-16T11:38:59Z","file_name":"402-ICSOC2014.pdf","file_id":"1368","access_level":"closed","file_size":377432,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"text":"Various approaches in service engineering are based on servicemarkets where brokers use service matching in order to performservice discovery. For matching, a broker translates the specifications ofproviders' services and requesters' requirements into her own specificationlanguage, in order to check their compliance using a matcher. Thebroker's success depends on the configuration of her language and itsmatcher because they in uence important properties like the effort forproviders and requesters to create suitable specifications as well as accuracyand runtime of matching. However, neither existing service specification languages, nor existing matching approaches are optimized insuch way. Our approach automatically provides brokers with an optimalconfiguration of a language and its matcher to improve her success ina given market with respect to her strategy. The approach is based onformalized configuration properties and a predefined set of configurationrules.","lang":"eng"}],"publication":"Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC 2014)","title":"Market-optimized Service Specification and Matching","date_created":"2017-10-17T12:42:10Z","year":"2014","file_date_updated":"2018-03-16T11:38:59Z","user_id":"477","series_title":"LNCS","department":[{"_id":"66"},{"_id":"76"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"402","status":"public","editor":[{"first_name":"Xavier","full_name":"Franch, Xavier","last_name":"Franch"},{"first_name":"AdityaK.","last_name":"Ghose","full_name":"Ghose, AdityaK."},{"first_name":"GraceA.","full_name":"Lewis, GraceA.","last_name":"Lewis"},{"first_name":"Sami","full_name":"Bhiri, Sami","last_name":"Bhiri"}],"type":"conference","doi":"10.1007/978-3-662-45391-9_47","author":[{"last_name":"Arifulina","full_name":"Arifulina, Svetlana","first_name":"Svetlana"},{"first_name":"Marie Christin","last_name":"Platenius","full_name":"Platenius, Marie Christin"},{"first_name":"Christian","last_name":"Gerth","full_name":"Gerth, Christian"},{"last_name":"Becker","full_name":"Becker, Steffen","first_name":"Steffen"},{"last_name":"Engels","id":"107","full_name":"Engels, Gregor","first_name":"Gregor"},{"full_name":"Schäfer, Wilhelm","last_name":"Schäfer","first_name":"Wilhelm"}],"date_updated":"2022-01-06T07:00:07Z","citation":{"ieee":"S. Arifulina, M. C. Platenius, C. Gerth, S. Becker, G. Engels, and W. Schäfer, “Market-optimized Service Specification and Matching,” in <i>Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC 2014)</i>, 2014, pp. 543–550.","chicago":"Arifulina, Svetlana, Marie Christin Platenius, Christian Gerth, Steffen Becker, Gregor Engels, and Wilhelm Schäfer. “Market-Optimized Service Specification and Matching.” In <i>Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC 2014)</i>, edited by Xavier Franch, AdityaK. Ghose, GraceA. Lewis, and Sami Bhiri, 543–50. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-662-45391-9_47\">https://doi.org/10.1007/978-3-662-45391-9_47</a>.","ama":"Arifulina S, Platenius MC, Gerth C, Becker S, Engels G, Schäfer W. Market-optimized Service Specification and Matching. In: Franch X, Ghose A, Lewis G, Bhiri S, eds. <i>Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC 2014)</i>. LNCS. ; 2014:543-550. doi:<a href=\"https://doi.org/10.1007/978-3-662-45391-9_47\">10.1007/978-3-662-45391-9_47</a>","apa":"Arifulina, S., Platenius, M. C., Gerth, C., Becker, S., Engels, G., &#38; Schäfer, W. (2014). Market-optimized Service Specification and Matching. In X. Franch, A. Ghose, G. Lewis, &#38; S. Bhiri (Eds.), <i>Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC 2014)</i> (pp. 543–550). <a href=\"https://doi.org/10.1007/978-3-662-45391-9_47\">https://doi.org/10.1007/978-3-662-45391-9_47</a>","short":"S. Arifulina, M.C. Platenius, C. Gerth, S. Becker, G. Engels, W. Schäfer, in: X. Franch, A. Ghose, G. Lewis, S. Bhiri (Eds.), Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC 2014), 2014, pp. 543–550.","mla":"Arifulina, Svetlana, et al. “Market-Optimized Service Specification and Matching.” <i>Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC 2014)</i>, edited by Xavier Franch et al., 2014, pp. 543–50, doi:<a href=\"https://doi.org/10.1007/978-3-662-45391-9_47\">10.1007/978-3-662-45391-9_47</a>.","bibtex":"@inproceedings{Arifulina_Platenius_Gerth_Becker_Engels_Schäfer_2014, series={LNCS}, title={Market-optimized Service Specification and Matching}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-45391-9_47\">10.1007/978-3-662-45391-9_47</a>}, booktitle={Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC 2014)}, author={Arifulina, Svetlana and Platenius, Marie Christin and Gerth, Christian and Becker, Steffen and Engels, Gregor and Schäfer, Wilhelm}, editor={Franch, Xavier and Ghose, AdityaK. and Lewis, GraceA. and Bhiri, SamiEditors}, year={2014}, pages={543–550}, collection={LNCS} }"},"page":"543-550","has_accepted_license":"1"},{"file":[{"date_updated":"2018-03-16T11:35:28Z","date_created":"2018-03-16T11:35:28Z","creator":"florida","file_size":561325,"file_name":"408-jakobs14_ifm.pdf","access_level":"closed","file_id":"1364","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","editor":[{"first_name":"Elvira","full_name":"Albert, Elvira","last_name":"Albert"},{"last_name":"Sekerinski","full_name":"Sekerinski, Emil","first_name":"Emil"}],"abstract":[{"lang":"eng","text":"Verification of hardware and software usually proceeds separately, software analysis relying on the correctness of processors executing instructions. This assumption is valid as long as the software runs on standard CPUs that have been extensively validated and are in wide use. However, for processors exploiting custom instruction set extensions to meet performance and energy constraints the validation might be less extensive, challenging the correctness assumption.In this paper we present an approach for integrating software analyses with hardware verification, specifically targeting custom instruction set extensions. We propose three different techniques for deriving the properties to be proven for the hardware implementation of a custom instruction in order to support software analyses. The techniques are designed to explore the trade-off between generality and efficiency and span from proving functional equivalence over checking the rules of a particular analysis domain to verifying actual pre and post conditions resulting from program analysis. We demonstrate and compare the three techniques on example programs with custom instructions, using stateof-the-art software and hardware verification techniques."}],"type":"conference","publication":"Proceedings of the 11th International Conference on Integrated Formal Methods (iFM)","language":[{"iso":"eng"}],"file_date_updated":"2018-03-16T11:35:28Z","ddc":["040"],"series_title":"LNCS","user_id":"477","department":[{"_id":"77"},{"_id":"78"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"408","citation":{"mla":"Jakobs, Marie-Christine, et al. “Integrating Software and Hardware Verification.” <i>Proceedings of the 11th International Conference on Integrated Formal Methods (IFM)</i>, edited by Elvira Albert and Emil Sekerinski, 2014, pp. 307–22, doi:<a href=\"https://doi.org/10.1007/978-3-319-10181-1_19\">10.1007/978-3-319-10181-1_19</a>.","short":"M.-C. Jakobs, M. Platzner, T. Wiersema, H. Wehrheim, in: E. Albert, E. Sekerinski (Eds.), Proceedings of the 11th International Conference on Integrated Formal Methods (IFM), 2014, pp. 307–322.","bibtex":"@inproceedings{Jakobs_Platzner_Wiersema_Wehrheim_2014, series={LNCS}, title={Integrating Software and Hardware Verification}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-10181-1_19\">10.1007/978-3-319-10181-1_19</a>}, booktitle={Proceedings of the 11th International Conference on Integrated Formal Methods (iFM)}, author={Jakobs, Marie-Christine and Platzner, Marco and Wiersema, Tobias and Wehrheim, Heike}, editor={Albert, Elvira and Sekerinski, EmilEditors}, year={2014}, pages={307–322}, collection={LNCS} }","apa":"Jakobs, M.-C., Platzner, M., Wiersema, T., &#38; Wehrheim, H. (2014). Integrating Software and Hardware Verification. In E. Albert &#38; E. Sekerinski (Eds.), <i>Proceedings of the 11th International Conference on Integrated Formal Methods (iFM)</i> (pp. 307–322). <a href=\"https://doi.org/10.1007/978-3-319-10181-1_19\">https://doi.org/10.1007/978-3-319-10181-1_19</a>","chicago":"Jakobs, Marie-Christine, Marco Platzner, Tobias Wiersema, and Heike Wehrheim. “Integrating Software and Hardware Verification.” In <i>Proceedings of the 11th International Conference on Integrated Formal Methods (IFM)</i>, edited by Elvira Albert and Emil Sekerinski, 307–22. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-10181-1_19\">https://doi.org/10.1007/978-3-319-10181-1_19</a>.","ieee":"M.-C. Jakobs, M. Platzner, T. Wiersema, and H. Wehrheim, “Integrating Software and Hardware Verification,” in <i>Proceedings of the 11th International Conference on Integrated Formal Methods (iFM)</i>, 2014, pp. 307–322.","ama":"Jakobs M-C, Platzner M, Wiersema T, Wehrheim H. Integrating Software and Hardware Verification. In: Albert E, Sekerinski E, eds. <i>Proceedings of the 11th International Conference on Integrated Formal Methods (IFM)</i>. LNCS. ; 2014:307-322. doi:<a href=\"https://doi.org/10.1007/978-3-319-10181-1_19\">10.1007/978-3-319-10181-1_19</a>"},"page":"307-322","year":"2014","has_accepted_license":"1","doi":"10.1007/978-3-319-10181-1_19","title":"Integrating Software and Hardware Verification","date_created":"2017-10-17T12:42:11Z","author":[{"last_name":"Jakobs","full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine"},{"last_name":"Platzner","full_name":"Platzner, Marco","id":"398","first_name":"Marco"},{"first_name":"Tobias","full_name":"Wiersema, Tobias","id":"3118","last_name":"Wiersema"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"}],"date_updated":"2022-01-06T07:00:14Z"},{"type":"conference","status":"public","editor":[{"first_name":"Paris","full_name":"Avgeriou, Paris","last_name":"Avgeriou"},{"first_name":"Uwe","full_name":"Zdun, Uwe","last_name":"Zdun"}],"user_id":"477","series_title":"LNCS","department":[{"_id":"76"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"409","file_date_updated":"2018-03-16T11:34:58Z","has_accepted_license":"1","citation":{"apa":"Platenius, M. C., Becker, S., &#38; Schäfer, W. (2014). Integrating Service Matchers into a Service Market Architecture. In P. Avgeriou &#38; U. Zdun (Eds.), <i>Proceedings of the 8th European Conference on Software Architecture (ECSA 2014)</i> (pp. 210–217). <a href=\"https://doi.org/10.1007/978-3-319-09970-5_19\">https://doi.org/10.1007/978-3-319-09970-5_19</a>","bibtex":"@inproceedings{Platenius_Becker_Schäfer_2014, series={LNCS}, title={Integrating Service Matchers into a Service Market Architecture}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-09970-5_19\">10.1007/978-3-319-09970-5_19</a>}, booktitle={Proceedings of the 8th European Conference on Software Architecture (ECSA 2014)}, author={Platenius, Marie Christin and Becker, Steffen and Schäfer, Wilhelm}, editor={Avgeriou, Paris and Zdun, UweEditors}, year={2014}, pages={210–217}, collection={LNCS} }","mla":"Platenius, Marie Christin, et al. “Integrating Service Matchers into a Service Market Architecture.” <i>Proceedings of the 8th European Conference on Software Architecture (ECSA 2014)</i>, edited by Paris Avgeriou and Uwe Zdun, 2014, pp. 210–17, doi:<a href=\"https://doi.org/10.1007/978-3-319-09970-5_19\">10.1007/978-3-319-09970-5_19</a>.","short":"M.C. Platenius, S. Becker, W. Schäfer, in: P. Avgeriou, U. Zdun (Eds.), Proceedings of the 8th European Conference on Software Architecture (ECSA 2014), 2014, pp. 210–217.","chicago":"Platenius, Marie Christin, Steffen Becker, and Wilhelm Schäfer. “Integrating Service Matchers into a Service Market Architecture.” In <i>Proceedings of the 8th European Conference on Software Architecture (ECSA 2014)</i>, edited by Paris Avgeriou and Uwe Zdun, 210–17. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-09970-5_19\">https://doi.org/10.1007/978-3-319-09970-5_19</a>.","ieee":"M. C. Platenius, S. Becker, and W. Schäfer, “Integrating Service Matchers into a Service Market Architecture,” in <i>Proceedings of the 8th European Conference on Software Architecture (ECSA 2014)</i>, 2014, pp. 210–217.","ama":"Platenius MC, Becker S, Schäfer W. Integrating Service Matchers into a Service Market Architecture. In: Avgeriou P, Zdun U, eds. <i>Proceedings of the 8th European Conference on Software Architecture (ECSA 2014)</i>. LNCS. ; 2014:210-217. doi:<a href=\"https://doi.org/10.1007/978-3-319-09970-5_19\">10.1007/978-3-319-09970-5_19</a>"},"page":"210-217","author":[{"first_name":"Marie Christin","last_name":"Platenius","full_name":"Platenius, Marie Christin"},{"full_name":"Becker, Steffen","last_name":"Becker","first_name":"Steffen"},{"last_name":"Schäfer","full_name":"Schäfer, Wilhelm","first_name":"Wilhelm"}],"date_updated":"2022-01-06T07:00:15Z","doi":"10.1007/978-3-319-09970-5_19","publication":"Proceedings of the 8th European Conference on Software Architecture (ECSA 2014)","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"409-ecsa14.pdf","file_id":"1363","file_size":395884,"date_created":"2018-03-16T11:34:58Z","creator":"florida","date_updated":"2018-03-16T11:34:58Z"}],"abstract":[{"text":"Service markets provide software components in the formof services. In order to enable a service discovery that satisfies servicerequesters and providers best, markets need automatic service matching:approaches for comparing whether a provided service satisfies a servicerequest. Current markets, e.g., app markets, are limited to basic keywordbasedsearch although many better suitable matching approaches aredescribed in literature. However, necessary architectural decisions forthe integration of matchers have a huge impact on quality propertieslike performance or security.Architectural decisions wrt. servicematchers have rarely been discussed,yet, and systematic approaches for their integration into service marketsare missing. In this paper, we present a systematic integration approachincluding the definition of requirements and a discussion on architecturaltactics. As a benefit, the decision-making process of integrating servicematchers is supported and the overall market success can be improved.","lang":"eng"}],"language":[{"iso":"eng"}],"ddc":["040"],"year":"2014","date_created":"2017-10-17T12:42:11Z","title":"Integrating Service Matchers into a Service Market Architecture"},{"status":"public","type":"conference","file_date_updated":"2018-03-16T11:34:00Z","user_id":"14052","department":[{"_id":"79"},{"_id":"63"},{"_id":"541"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"412","citation":{"mla":"Feldotto, Matthias, et al. “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.” <i>Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)</i>, 2014, pp. 1–10, doi:<a href=\"https://doi.org/10.1109/P2P.2014.6934300\">10.1109/P2P.2014.6934300</a>.","short":"M. Feldotto, C. Scheideler, K. Graffi, in: Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10.","bibtex":"@inproceedings{Feldotto_Scheideler_Graffi_2014, title={HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths}, DOI={<a href=\"https://doi.org/10.1109/P2P.2014.6934300\">10.1109/P2P.2014.6934300</a>}, booktitle={Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)}, author={Feldotto, Matthias and Scheideler, Christian and Graffi, Kalman}, year={2014}, pages={1–10} }","apa":"Feldotto, M., Scheideler, C., &#38; Graffi, K. (2014). HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. In <i>Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)</i> (pp. 1–10). <a href=\"https://doi.org/10.1109/P2P.2014.6934300\">https://doi.org/10.1109/P2P.2014.6934300</a>","ama":"Feldotto M, Scheideler C, Graffi K. HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. In: <i>Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)</i>. ; 2014:1-10. doi:<a href=\"https://doi.org/10.1109/P2P.2014.6934300\">10.1109/P2P.2014.6934300</a>","chicago":"Feldotto, Matthias, Christian Scheideler, and Kalman Graffi. “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.” In <i>Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)</i>, 1–10, 2014. <a href=\"https://doi.org/10.1109/P2P.2014.6934300\">https://doi.org/10.1109/P2P.2014.6934300</a>.","ieee":"M. Feldotto, C. Scheideler, and K. Graffi, “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths,” in <i>Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)</i>, 2014, pp. 1–10."},"page":"1-10","has_accepted_license":"1","doi":"10.1109/P2P.2014.6934300","author":[{"first_name":"Matthias","id":"14052","full_name":"Feldotto, Matthias","last_name":"Feldotto","orcid":"0000-0003-1348-6516"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"first_name":"Kalman","last_name":"Graffi","full_name":"Graffi, Kalman"}],"date_updated":"2022-01-06T07:00:20Z","file":[{"date_updated":"2018-03-16T11:34:00Z","date_created":"2018-03-16T11:34:00Z","creator":"florida","file_size":472321,"access_level":"closed","file_name":"412-FSG2014P2P.pdf","file_id":"1361","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"lang":"eng","text":"In this paper we present and analyze HSkip+, a self-stabilizing overlay network for nodes with arbitrary heterogeneous bandwidths. HSkip+ has the same topology as the Skip+ graph proposed by Jacob et al. [PODC 2009] but its self-stabilization mechanism significantly outperforms the self-stabilization mechanism proposed for Skip+. Also, the nodes are now ordered according to their bandwidths and not according to their identifiers. Various other solutions have already been proposed for overlay networks with heterogeneous bandwidths, but they are not self-stabilizing. In addition to HSkip+ being self-stabilizing, its performance is on par with the best previous bounds on the time and work for joining or leaving a network of peers of logarithmic diameter and degree and arbitrary bandwidths. Also, the dilation and congestion for routing messages is on par with the best previous bounds for such networks, so that HSkip+ combines the advantages of both worlds. Our theoretical investigations are backed by simulations demonstrating that HSkip+ is indeed performing much better than Skip+ and working correctly under high churn rates."}],"publication":"Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)","ddc":["040"],"external_id":{"arxiv":["1408.0395"]},"year":"2014","title":"HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths","date_created":"2017-10-17T12:42:12Z"},{"author":[{"full_name":"Jochheim, Janek","last_name":"Jochheim","first_name":"Janek"}],"date_created":"2017-10-17T12:42:12Z","supervisor":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:00:23Z","title":"Hiding software components using functional encryption","citation":{"apa":"Jochheim, J. (2014). <i>Hiding software components using functional encryption</i>. Universität Paderborn.","bibtex":"@book{Jochheim_2014, title={Hiding software components using functional encryption}, publisher={Universität Paderborn}, author={Jochheim, Janek}, year={2014} }","short":"J. Jochheim, Hiding Software Components Using Functional Encryption, Universität Paderborn, 2014.","mla":"Jochheim, Janek. <i>Hiding Software Components Using Functional Encryption</i>. Universität Paderborn, 2014.","ieee":"J. Jochheim, <i>Hiding software components using functional encryption</i>. Universität Paderborn, 2014.","chicago":"Jochheim, Janek. <i>Hiding Software Components Using Functional Encryption</i>. Universität Paderborn, 2014.","ama":"Jochheim J. <i>Hiding Software Components Using Functional Encryption</i>. Universität Paderborn; 2014."},"year":"2014","user_id":"25078","department":[{"_id":"64"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"Securing the Financial Cloud","_id":"43"}],"_id":"414","type":"mastersthesis","status":"public"},{"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:00:26Z","date_created":"2017-10-17T12:42:13Z","supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"}],"author":[{"last_name":"Bemmann","full_name":"Bemmann, Pascal","id":"32571","first_name":"Pascal"}],"title":"Group Signature Schemes with Strong Exculpability","year":"2014","citation":{"ieee":"P. Bemmann, <i>Group Signature Schemes with Strong Exculpability</i>. Universität Paderborn, 2014.","chicago":"Bemmann, Pascal. <i>Group Signature Schemes with Strong Exculpability</i>. Universität Paderborn, 2014.","ama":"Bemmann P. <i>Group Signature Schemes with Strong Exculpability</i>. Universität Paderborn; 2014.","short":"P. Bemmann, Group Signature Schemes with Strong Exculpability, Universität Paderborn, 2014.","mla":"Bemmann, Pascal. <i>Group Signature Schemes with Strong Exculpability</i>. Universität Paderborn, 2014.","bibtex":"@book{Bemmann_2014, title={Group Signature Schemes with Strong Exculpability}, publisher={Universität Paderborn}, author={Bemmann, Pascal}, year={2014} }","apa":"Bemmann, P. (2014). <i>Group Signature Schemes with Strong Exculpability</i>. Universität Paderborn."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"416","user_id":"25078","department":[{"_id":"64"}],"type":"bachelorsthesis","status":"public"},{"department":[{"_id":"77"}],"user_id":"477","_id":"417","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-16T11:33:33Z","ddc":["040"],"publication":"Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD)","type":"conference","status":"public","file":[{"date_updated":"2018-03-16T11:33:33Z","creator":"florida","date_created":"2018-03-16T11:33:33Z","file_size":643382,"file_name":"417-main.pdf","file_id":"1360","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"lang":"eng","text":"Model transformation is a key concept in modeldrivensoftware engineering. The definition of model transformationsis usually based on meta-models describing the abstractsyntax of languages. While meta-models are thereby able to abstractfrom superfluous details of concrete syntax, they often loosestructural information inherent in languages, like information onmodel elements always occurring together in particular shapes.As a consequence, model transformations cannot naturally re-uselanguage structures, thus leading to unnecessary complexity intheir development as well as analysis.In this paper, we propose a new approach to model transformationdevelopment which allows to simplify and improve thequality of the developed transformations via the exploitation ofthe languages’ structures. The approach is based on context-freegrammars and transformations defined by pairing productions ofsource and target grammars. We show that such transformationsexhibit three important characteristics: they are sound, completeand deterministic."}],"date_created":"2017-10-17T12:42:13Z","author":[{"full_name":"Besova, Galina","last_name":"Besova","first_name":"Galina"},{"last_name":"Steenke","full_name":"Steenke, Dominik","first_name":"Dominik"},{"last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike","first_name":"Heike"}],"date_updated":"2022-01-06T07:00:28Z","doi":"10.1016/j.cl.2015.05.003","title":"Grammar-based model transformations","has_accepted_license":"1","page":"1601-1610","citation":{"ieee":"G. Besova, D. Steenke, and H. Wehrheim, “Grammar-based model transformations,” in <i>Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD)</i>, 2014, pp. 1601–1610.","chicago":"Besova, Galina, Dominik Steenke, and Heike Wehrheim. “Grammar-Based Model Transformations.” In <i>Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD)</i>, 1601–10, 2014. <a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">https://doi.org/10.1016/j.cl.2015.05.003</a>.","ama":"Besova G, Steenke D, Wehrheim H. Grammar-based model transformations. In: <i>Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD)</i>. ; 2014:1601-1610. doi:<a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">10.1016/j.cl.2015.05.003</a>","apa":"Besova, G., Steenke, D., &#38; Wehrheim, H. (2014). Grammar-based model transformations. In <i>Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD)</i> (pp. 1601–1610). <a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">https://doi.org/10.1016/j.cl.2015.05.003</a>","bibtex":"@inproceedings{Besova_Steenke_Wehrheim_2014, title={Grammar-based model transformations}, DOI={<a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">10.1016/j.cl.2015.05.003</a>}, booktitle={Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD)}, author={Besova, Galina and Steenke, Dominik and Wehrheim, Heike}, year={2014}, pages={1601–1610} }","mla":"Besova, Galina, et al. “Grammar-Based Model Transformations.” <i>Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD)</i>, 2014, pp. 1601–10, doi:<a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">10.1016/j.cl.2015.05.003</a>.","short":"G. Besova, D. Steenke, H. Wehrheim, in: Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD), 2014, pp. 1601–1610."},"year":"2014"},{"_id":"418","project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"77"}],"user_id":"22398","ddc":["000"],"language":[{"iso":"ger"}],"file_date_updated":"2019-08-07T09:05:38Z","type":"bachelorsthesis","status":"public","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2019-08-07T09:05:38Z","creator":"fpauck","date_created":"2019-08-07T09:00:20Z","title":"Bachelorarbeit","file_size":3191756,"file_id":"12906","access_level":"open_access","file_name":"fpauck_2014.pdf"}],"oa":"1","date_updated":"2022-01-06T07:00:30Z","publisher":"Universität Paderborn","author":[{"last_name":"Pauck","full_name":"Pauck, Felix","id":"22398","first_name":"Felix"}],"supervisor":[{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"date_created":"2017-10-17T12:42:13Z","title":"Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren","has_accepted_license":"1","year":"2014","citation":{"mla":"Pauck, Felix. <i>Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren</i>. Universität Paderborn, 2014.","short":"F. Pauck, Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren, Universität Paderborn, 2014.","bibtex":"@book{Pauck_2014, title={Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren}, publisher={Universität Paderborn}, author={Pauck, Felix}, year={2014} }","apa":"Pauck, F. (2014). <i>Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren</i>. Universität Paderborn.","chicago":"Pauck, Felix. <i>Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren</i>. Universität Paderborn, 2014.","ieee":"F. Pauck, <i>Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren</i>. Universität Paderborn, 2014.","ama":"Pauck F. <i>Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren</i>. Universität Paderborn; 2014."}},{"date_created":"2017-10-17T12:42:14Z","supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"author":[{"full_name":"Lippert, Jan","last_name":"Lippert","first_name":"Jan"}],"date_updated":"2022-01-06T07:00:36Z","publisher":"Universität Paderborn","title":"Fujisaki-Okamoto Transformation","citation":{"apa":"Lippert, J. (2014). <i>Fujisaki-Okamoto Transformation</i>. Universität Paderborn.","short":"J. Lippert, Fujisaki-Okamoto Transformation, Universität Paderborn, 2014.","bibtex":"@book{Lippert_2014, title={Fujisaki-Okamoto Transformation}, publisher={Universität Paderborn}, author={Lippert, Jan}, year={2014} }","mla":"Lippert, Jan. <i>Fujisaki-Okamoto Transformation</i>. Universität Paderborn, 2014.","chicago":"Lippert, Jan. <i>Fujisaki-Okamoto Transformation</i>. Universität Paderborn, 2014.","ieee":"J. Lippert, <i>Fujisaki-Okamoto Transformation</i>. Universität Paderborn, 2014.","ama":"Lippert J. <i>Fujisaki-Okamoto Transformation</i>. Universität Paderborn; 2014."},"year":"2014","user_id":"25078","department":[{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"Securing the Financial Cloud","_id":"43"}],"_id":"421","type":"bachelorsthesis","status":"public"},{"citation":{"ieee":"V. Dornseifer, <i>Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network</i>. Universität Paderborn, 2014.","chicago":"Dornseifer, Veit. <i>Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network</i>. Universität Paderborn, 2014.","ama":"Dornseifer V. <i>Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network</i>. Universität Paderborn; 2014.","mla":"Dornseifer, Veit. <i>Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network</i>. Universität Paderborn, 2014.","short":"V. Dornseifer, Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network, Universität Paderborn, 2014.","bibtex":"@book{Dornseifer_2014, title={Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network}, publisher={Universität Paderborn}, author={Dornseifer, Veit}, year={2014} }","apa":"Dornseifer, V. (2014). <i>Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network</i>. Universität Paderborn."},"year":"2014","title":"Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network","author":[{"first_name":"Veit","full_name":"Dornseifer, Veit","last_name":"Dornseifer"}],"date_created":"2017-10-17T12:42:15Z","date_updated":"2022-01-06T07:00:43Z","publisher":"Universität Paderborn","status":"public","type":"mastersthesis","department":[{"_id":"75"}],"user_id":"15504","_id":"426","project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"year":"2014","citation":{"ama":"Mohr F. Estimating Functional Reusability of Services. In: <i>Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC)</i>. LNCS. ; 2014:411-418.","ieee":"F. Mohr, “Estimating Functional Reusability of Services,” in <i>Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC)</i>, 2014, pp. 411–418.","chicago":"Mohr, Felix. “Estimating Functional Reusability of Services.” In <i>Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC)</i>, 411–18. LNCS, 2014.","mla":"Mohr, Felix. “Estimating Functional Reusability of Services.” <i>Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC)</i>, 2014, pp. 411–18.","bibtex":"@inproceedings{Mohr_2014, series={LNCS}, title={Estimating Functional Reusability of Services}, booktitle={Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC)}, author={Mohr, Felix}, year={2014}, pages={411–418}, collection={LNCS} }","short":"F. Mohr, in: Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC), 2014, pp. 411–418.","apa":"Mohr, F. (2014). Estimating Functional Reusability of Services. In <i>Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC)</i> (pp. 411–418)."},"page":"411-418","has_accepted_license":"1","title":"Estimating Functional Reusability of Services","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007%2F978-3-662-45391-9_31"}],"date_updated":"2022-01-06T07:00:47Z","author":[{"last_name":"Mohr","full_name":"Mohr, Felix","first_name":"Felix"}],"date_created":"2017-10-17T12:42:15Z","abstract":[{"text":"Services are self-contained software components that can be used platform independent and that aim at maximizing software reuse. A basic concern in service oriented architectures is to measure the reusability of services. One of the most important qualities is the functional reusability, which indicates how relevant the task is that a service solves. Current metrics for functional reusability of software, however, either require source code analysis or have very little explanatory power. This paper gives a formally described vision statement for the estimation of functional reusability of services and sketches an exemplary reusability metric that is based on the service descriptions.","lang":"eng"}],"file":[{"date_updated":"2018-03-16T11:32:02Z","date_created":"2018-03-16T11:32:02Z","creator":"florida","file_size":200063,"file_name":"428-ICSOC14.pdf","access_level":"closed","file_id":"1357","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","type":"conference","publication":"Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC)","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-16T11:32:02Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B2","_id":"10"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"428","user_id":"477","series_title":"LNCS","department":[{"_id":"355"}]},{"type":"dissertation","status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"1356","file_name":"431-Peter_Kling_PhDThesis_01.pdf","file_size":792106,"creator":"florida","date_created":"2018-03-16T11:31:29Z","date_updated":"2018-03-16T11:31:29Z"}],"abstract":[{"text":"In meiner Dissertation besch{\\\"a}ftige ich mich mit dem Entwurf und der Analyse energieeffizienter Schedulingalgorithmen, insbesondere f{\\\"u}r sogenannte Speed-Scaling Modelle. Diese stellen das theoretische Pendant von Techniken wie AMDs PowerNOW! und Intels SpeedStep dar, welche es erlauben die Geschwindigkeit von Prozessoren zur Laufzeit an die derzeitigen Bedingungen anzupassen. Theoretische Untersuchungen solcher Modelle sind auf eine Arbeit von Yao, Demers und Shenker (FOCS'95) zur{\\\"u}ckzuf{\\\"u}hren. Hier kombinieren die Autoren klassisches Deadline-Scheduling mit einem Prozessor der Speed-Scaling beherrscht. Es gilt Jobs verschiedener Gr{\\\"o}ße fristgerecht abzuarbeiten und die dabei verwendete Energie zu minimieren. Der Energieverbrauch des Prozessors wird durch eine konvexe Funktion $\\POW\\colon\\R_{\\geq0}\\to\\R_{\\geq0}$ modelliert, welche die Geschwindigkeit auf den Energieverbrauch abbildet.Meine Dissertation betrachtet verschiedene Varianten des urspr{\\\"u}nglichen Speed-Scaling Modells. Forschungsrelevante Ergebnisse sind in den Kapiteln 3 bis 6 zu finden und erstrecken sich {\\\"u}ber die im Folgenden beschriebenen Aspekte:- Kapitel 3 und 4 betrachten verschiedene \\emph{Price-Collecting} Varianten des Originalproblems. Hier d{\\\"u}rfen einzelne Deadlines verfehlt werden, sofern eine jobabh{\\\"a}ngige Strafe gezahlt wird. Ich entwerfe insbesondere Online-Algorithmen mit einer beweisbar guten Competitiveness. Dabei liefern meine Ergebnisse substantielle Verbesserungen bestehender Arbeiten und erweitern diese unter Anderem auf Szenarien mit mehreren Prozessoren.- In Kapitel 5 wird statt des klassischen Deadline-Schedulings eine Linearkombination der durchschnittlichen Antwortzeit und des Energieverbrauchs betrachtet. Die Frage, ob dieses Problem NP-schwer ist, stellt eine der zentralen Forschungsfragen in diesem Gebiet dar. F{\\\"u}r eine relaxierte Form dieser Frage entwerfe ich einen effizienter Algorithmus und beweise seine Optimalit{\\\"a}t.- Das letzte Kapitel betrachtet ein Modell, welches – auf den ersten Blick – nicht direkt zur Speed-Scaling Literatur z{\\\"a}hlt. Hier geht es stattdessen um ein allgemeines Resource-Constrained Scheduling, in dem sich die Prozessoren zusammen eine gemeinsame, beliebig aufteilbare Ressource teilen. Ich untersuche die Komplexit{\\\"a}t des Problems und entwerfe verschiedene Approximationsalgorithmen.","lang":"eng"}],"department":[{"_id":"63"}],"user_id":"477","_id":"431","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"}],"file_date_updated":"2018-03-16T11:31:29Z","ddc":["040"],"has_accepted_license":"1","citation":{"mla":"Kling, Peter. <i>Energy-Efficient Scheduling Algorithms</i>. Universität Paderborn, 2014.","bibtex":"@book{Kling_2014, title={Energy-efficient Scheduling Algorithms}, publisher={Universität Paderborn}, author={Kling, Peter}, year={2014} }","short":"P. Kling, Energy-Efficient Scheduling Algorithms, Universität Paderborn, 2014.","apa":"Kling, P. (2014). <i>Energy-efficient Scheduling Algorithms</i>. Universität Paderborn.","ieee":"P. Kling, <i>Energy-efficient Scheduling Algorithms</i>. Universität Paderborn, 2014.","chicago":"Kling, Peter. <i>Energy-Efficient Scheduling Algorithms</i>. Universität Paderborn, 2014.","ama":"Kling P. <i>Energy-Efficient Scheduling Algorithms</i>. Universität Paderborn; 2014."},"year":"2014","date_created":"2017-10-17T12:42:15Z","author":[{"first_name":"Peter","last_name":"Kling","full_name":"Kling, Peter"}],"supervisor":[{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:00:52Z","title":"Energy-efficient Scheduling Algorithms"},{"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-08-30T09:28:00Z","creator":"hclaudia","date_updated":"2018-08-30T09:28:00Z","access_level":"closed","file_id":"4316","file_name":"2014-08 Grynko,Zubko_Light Scattering by Radndom irregular particles with different morphology.pdf","file_size":794798}],"status":"public","abstract":[{"text":"We simulate numerically light scattering by random irregular particles of two classes of shape: Gaussian random field particles and agglomerated debri particles. Comparison of the angular dependencies of the scattering matrix elements for the case of non-absorbing material shows qualitative similarity of optical properties of both types despite different morphology of scatterers. Absorbing particles result in the difference in linear polarization. However, a strong similarty remains for the intensity curves.","lang":"eng"}],"type":"conference","file_date_updated":"2018-08-30T09:28:00Z","language":[{"iso":"eng"}],"ddc":["530"],"user_id":"55706","department":[{"_id":"61"}],"_id":"4315","citation":{"ieee":"Y. Grynko and E. Zubko, “Light Scattering By Random Irregular Particles With Different Morphology,” presented at the 10th International Conference on Laser-Light and Interactions with Particles, Marseille (France), 2014.","chicago":"Grynko, Yevgen, and Evgenij Zubko. “Light Scattering By Random Irregular Particles With Different Morphology,” 2014.","ama":"Grynko Y, Zubko E. Light Scattering By Random Irregular Particles With Different Morphology. In: ; 2014.","apa":"Grynko, Y., &#38; Zubko, E. (2014). Light Scattering By Random Irregular Particles With Different Morphology. Presented at the 10th International Conference on Laser-Light and Interactions with Particles, Marseille (France).","short":"Y. Grynko, E. Zubko, in: 2014.","mla":"Grynko, Yevgen, and Evgenij Zubko. <i>Light Scattering By Random Irregular Particles With Different Morphology</i>. 2014.","bibtex":"@inproceedings{Grynko_Zubko_2014, title={Light Scattering By Random Irregular Particles With Different Morphology}, author={Grynko, Yevgen and Zubko, Evgenij}, year={2014} }"},"year":"2014","publication_status":"published","has_accepted_license":"1","conference":{"name":"10th International Conference on Laser-Light and Interactions with Particles","start_date":"2014-08-25","end_date":"2014-08-29","location":"Marseille (France)"},"title":"Light Scattering By Random Irregular Particles With Different Morphology","date_created":"2018-08-30T09:29:24Z","author":[{"first_name":"Yevgen","last_name":"Grynko","full_name":"Grynko, Yevgen","id":"26059"},{"last_name":"Zubko","full_name":"Zubko, Evgenij","first_name":"Evgenij"}],"date_updated":"2022-01-06T07:00:53Z"},{"user_id":"15504","department":[{"_id":"75"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"432","type":"mastersthesis","status":"public","author":[{"first_name":"Nico","last_name":"Bredenbals","full_name":"Bredenbals, Nico"}],"date_created":"2017-10-17T12:42:16Z","date_updated":"2022-01-06T07:00:54Z","publisher":"Universität Paderborn","title":"Energy-Efficient Queuing with Delayed Deactivation","citation":{"bibtex":"@book{Bredenbals_2014, title={Energy-Efficient Queuing with Delayed Deactivation}, publisher={Universität Paderborn}, author={Bredenbals, Nico}, year={2014} }","mla":"Bredenbals, Nico. <i>Energy-Efficient Queuing with Delayed Deactivation</i>. Universität Paderborn, 2014.","short":"N. Bredenbals, Energy-Efficient Queuing with Delayed Deactivation, Universität Paderborn, 2014.","apa":"Bredenbals, N. (2014). <i>Energy-Efficient Queuing with Delayed Deactivation</i>. Universität Paderborn.","ama":"Bredenbals N. <i>Energy-Efficient Queuing with Delayed Deactivation</i>. Universität Paderborn; 2014.","ieee":"N. Bredenbals, <i>Energy-Efficient Queuing with Delayed Deactivation</i>. Universität Paderborn, 2014.","chicago":"Bredenbals, Nico. <i>Energy-Efficient Queuing with Delayed Deactivation</i>. Universität Paderborn, 2014."},"year":"2014"},{"type":"conference","publication":"Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)","abstract":[{"lang":"eng","text":"Virtual FPGAs are overlay architectures realized on top of physical FPGAs. They are proposed to enhance or abstract away from the physical FPGA for experimenting with novel architectures and design tool flows. In this paper, we present an embedding of a ZUMA-based virtual FPGA fabric into a complete configurable system-on-chip. Such an embedding is required to fully harness the potential of virtual FPGAs, in particular to give the virtual circuits access to main memory and operating system services, and to enable a concurrent operation of virtualized and non-virtualized circuitry. We discuss our extension to ZUMA and its embedding into the ReconOS operating system for hardware/software systems. Furthermore, we present an open source tool flow to synthesize configurations for the virtual FPGA."}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":369333,"access_level":"closed","file_name":"433-wiersema14_reconfig_IEEE_approved.pdf","file_id":"1355","date_updated":"2018-03-16T11:30:58Z","date_created":"2018-03-16T11:30:58Z","creator":"florida"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"433","user_id":"477","department":[{"_id":"78"}],"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-16T11:30:58Z","has_accepted_license":"1","year":"2014","citation":{"mla":"Wiersema, Tobias, et al. “Embedding FPGA Overlays into Configurable Systems-on-Chip: ReconOS Meets ZUMA.” <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, 2014, pp. 1–6, doi:<a href=\"https://doi.org/10.1109/ReConFig.2014.7032514\">10.1109/ReConFig.2014.7032514</a>.","bibtex":"@inproceedings{Wiersema_Bockhorn_Platzner_2014, title={Embedding FPGA Overlays into Configurable Systems-on-Chip: ReconOS meets ZUMA}, DOI={<a href=\"https://doi.org/10.1109/ReConFig.2014.7032514\">10.1109/ReConFig.2014.7032514</a>}, booktitle={Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)}, author={Wiersema, Tobias and Bockhorn, Arne and Platzner, Marco}, year={2014}, pages={1–6} }","short":"T. Wiersema, A. Bockhorn, M. Platzner, in: Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig), 2014, pp. 1–6.","apa":"Wiersema, T., Bockhorn, A., &#38; Platzner, M. (2014). Embedding FPGA Overlays into Configurable Systems-on-Chip: ReconOS meets ZUMA. In <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i> (pp. 1–6). <a href=\"https://doi.org/10.1109/ReConFig.2014.7032514\">https://doi.org/10.1109/ReConFig.2014.7032514</a>","ama":"Wiersema T, Bockhorn A, Platzner M. Embedding FPGA Overlays into Configurable Systems-on-Chip: ReconOS meets ZUMA. In: <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>. ; 2014:1-6. doi:<a href=\"https://doi.org/10.1109/ReConFig.2014.7032514\">10.1109/ReConFig.2014.7032514</a>","chicago":"Wiersema, Tobias, Arne Bockhorn, and Marco Platzner. “Embedding FPGA Overlays into Configurable Systems-on-Chip: ReconOS Meets ZUMA.” In <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, 1–6, 2014. <a href=\"https://doi.org/10.1109/ReConFig.2014.7032514\">https://doi.org/10.1109/ReConFig.2014.7032514</a>.","ieee":"T. Wiersema, A. Bockhorn, and M. Platzner, “Embedding FPGA Overlays into Configurable Systems-on-Chip: ReconOS meets ZUMA,” in <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, 2014, pp. 1–6."},"page":"1-6 ","date_updated":"2022-01-06T07:00:56Z","author":[{"last_name":"Wiersema","id":"3118","full_name":"Wiersema, Tobias","first_name":"Tobias"},{"first_name":"Arne","full_name":"Bockhorn, Arne","last_name":"Bockhorn"},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco","id":"398"}],"date_created":"2017-10-17T12:42:16Z","title":"Embedding FPGA Overlays into Configurable Systems-on-Chip: ReconOS meets ZUMA","doi":"10.1109/ReConFig.2014.7032514"}]