[{"status":"public","type":"mastersthesis","_id":"422","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"}],"user_id":"15504","year":"2014","citation":{"apa":"Sanati, M. (2014). <i>Formal Semantics of Probabilistic SMT Solving in Verification of Service Compositions</i>. Universität Paderborn.","mla":"Sanati, Maryam. <i>Formal Semantics of Probabilistic SMT Solving in Verification of Service Compositions</i>. Universität Paderborn, 2014.","bibtex":"@book{Sanati_2014, title={Formal Semantics of Probabilistic SMT Solving in Verification of Service Compositions}, publisher={Universität Paderborn}, author={Sanati, Maryam}, year={2014} }","short":"M. Sanati, Formal Semantics of Probabilistic SMT Solving in Verification of Service Compositions, Universität Paderborn, 2014.","chicago":"Sanati, Maryam. <i>Formal Semantics of Probabilistic SMT Solving in Verification of Service Compositions</i>. Universität Paderborn, 2014.","ieee":"M. Sanati, <i>Formal Semantics of Probabilistic SMT Solving in Verification of Service Compositions</i>. Universität Paderborn, 2014.","ama":"Sanati M. <i>Formal Semantics of Probabilistic SMT Solving in Verification of Service Compositions</i>. Universität Paderborn; 2014."},"title":"Formal Semantics of Probabilistic SMT Solving in Verification of Service Compositions","date_updated":"2022-01-06T07:00:38Z","publisher":"Universität Paderborn","author":[{"last_name":"Sanati","full_name":"Sanati, Maryam","first_name":"Maryam"}],"date_created":"2017-10-17T12:42:14Z"},{"title":"Finding Optimal Self-Adaption Rules by Design-Space Exploration","date_updated":"2022-01-06T07:00:40Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"_id":"3","name":"SFB 901 - Project Area B"}],"publisher":"Universität Paderborn","_id":"423","author":[{"first_name":"Suman","last_name":"Jojiju","full_name":"Jojiju, Suman"}],"date_created":"2017-10-17T12:42:14Z","user_id":"15504","year":"2014","citation":{"apa":"Jojiju, S. (2014). <i>Finding Optimal Self-Adaption Rules by Design-Space Exploration</i>. Universität Paderborn.","mla":"Jojiju, Suman. <i>Finding Optimal Self-Adaption Rules by Design-Space Exploration</i>. Universität Paderborn, 2014.","bibtex":"@book{Jojiju_2014, title={Finding Optimal Self-Adaption Rules by Design-Space Exploration}, publisher={Universität Paderborn}, author={Jojiju, Suman}, year={2014} }","short":"S. Jojiju, Finding Optimal Self-Adaption Rules by Design-Space Exploration, Universität Paderborn, 2014.","ama":"Jojiju S. <i>Finding Optimal Self-Adaption Rules by Design-Space Exploration</i>. Universität Paderborn; 2014.","chicago":"Jojiju, Suman. <i>Finding Optimal Self-Adaption Rules by Design-Space Exploration</i>. Universität Paderborn, 2014.","ieee":"S. Jojiju, <i>Finding Optimal Self-Adaption Rules by Design-Space Exploration</i>. Universität Paderborn, 2014."},"status":"public","type":"mastersthesis"},{"citation":{"chicago":"Finkensiep, Christoph. <i>Fast and Flexible Automatic Composition of Semantic Web Services</i>. Universität Paderborn, 2014.","ieee":"C. Finkensiep, <i>Fast and Flexible Automatic Composition of Semantic Web Services</i>. Universität Paderborn, 2014.","ama":"Finkensiep C. <i>Fast and Flexible Automatic Composition of Semantic Web Services</i>. Universität Paderborn; 2014.","apa":"Finkensiep, C. (2014). <i>Fast and Flexible Automatic Composition of Semantic Web Services</i>. Universität Paderborn.","short":"C. Finkensiep, Fast and Flexible Automatic Composition of Semantic Web Services, Universität Paderborn, 2014.","bibtex":"@book{Finkensiep_2014, title={Fast and Flexible Automatic Composition of Semantic Web Services}, publisher={Universität Paderborn}, author={Finkensiep, Christoph}, year={2014} }","mla":"Finkensiep, Christoph. <i>Fast and Flexible Automatic Composition of Semantic Web Services</i>. Universität Paderborn, 2014."},"year":"2014","title":"Fast and Flexible Automatic Composition of Semantic Web Services","author":[{"last_name":"Finkensiep","full_name":"Finkensiep, Christoph","first_name":"Christoph"}],"date_created":"2017-10-17T12:42:14Z","date_updated":"2022-01-06T07:00:40Z","publisher":"Universität Paderborn","status":"public","type":"bachelorsthesis","user_id":"15504","_id":"424","project":[{"name":"SFB 901","_id":"1"},{"_id":"10","name":"SFB 901 - Subprojekt B2"},{"_id":"3","name":"SFB 901 - Project Area B"}]},{"has_accepted_license":"1","year":"2014","citation":{"mla":"Jungmann, Alexander, et al. “Evaluation of Color Spaces for Robust Image Segmentation.” <i>Proceedings of the 9th International Conference on Computer Vision Theory and Applications (VISAPP)</i>, 2014, pp. 648–55.","bibtex":"@inproceedings{Jungmann_Jatzkowski_Kleinjohann_2014, title={Evaluation of Color Spaces for Robust Image Segmentation}, booktitle={Proceedings of the 9th International Conference on Computer Vision Theory and Applications (VISAPP)}, author={Jungmann, Alexander and Jatzkowski, Jan and Kleinjohann, Bernd}, year={2014}, pages={648–655} }","short":"A. Jungmann, J. Jatzkowski, B. Kleinjohann, in: Proceedings of the 9th International Conference on Computer Vision Theory and Applications (VISAPP), 2014, pp. 648–655.","apa":"Jungmann, A., Jatzkowski, J., &#38; Kleinjohann, B. (2014). Evaluation of Color Spaces for Robust Image Segmentation. In <i>Proceedings of the 9th International Conference on Computer Vision Theory and Applications (VISAPP)</i> (pp. 648–655).","ama":"Jungmann A, Jatzkowski J, Kleinjohann B. Evaluation of Color Spaces for Robust Image Segmentation. In: <i>Proceedings of the 9th International Conference on Computer Vision Theory and Applications (VISAPP)</i>. ; 2014:648-655.","ieee":"A. Jungmann, J. Jatzkowski, and B. Kleinjohann, “Evaluation of Color Spaces for Robust Image Segmentation,” in <i>Proceedings of the 9th International Conference on Computer Vision Theory and Applications (VISAPP)</i>, 2014, pp. 648–655.","chicago":"Jungmann, Alexander, Jan Jatzkowski, and Bernd Kleinjohann. “Evaluation of Color Spaces for Robust Image Segmentation.” In <i>Proceedings of the 9th International Conference on Computer Vision Theory and Applications (VISAPP)</i>, 648–55, 2014."},"page":"648-655","date_updated":"2022-01-06T07:00:42Z","author":[{"first_name":"Alexander","last_name":"Jungmann","full_name":"Jungmann, Alexander"},{"full_name":"Jatzkowski, Jan","last_name":"Jatzkowski","first_name":"Jan"},{"last_name":"Kleinjohann","full_name":"Kleinjohann, Bernd","first_name":"Bernd"}],"date_created":"2017-10-17T12:42:14Z","title":"Evaluation of Color Spaces for Robust Image Segmentation","type":"conference","publication":"Proceedings of the 9th International Conference on Computer Vision Theory and Applications (VISAPP)","abstract":[{"text":"In this paper, we evaluate the robustness of our color-based segmentation approach in combination with different color spaces, namely RGB, L*a*b*, HSV, and log-chromaticity (LCCS). For this purpose, we describe our deterministic segmentation algorithm including its gradually transformation of pixel-precise image data into a less error-prone and therefore more robust statistical representation in terms of moments. To investigate the robustness of a specific segmentation setting, we introduce our evaluation framework that directly works on the statistical representation. It is based on two different types of robustness measures, namely relative and absolute robustness. While relative robustness measures stability of segmentation results over time, absolute robustness measures stability regarding varying illumination by comparing results with ground truth data. The significance of these robustness measures is shown by evaluating our segmentation approach with different color spaces. For the evaluation process, an artificial scene was chosen as representative for application scenarios based on artificial landmarks.","lang":"eng"}],"file":[{"creator":"florida","date_created":"2018-03-16T11:32:35Z","date_updated":"2018-03-16T11:32:35Z","file_id":"1358","access_level":"closed","file_name":"425-visapp2014-camera-ready.pdf","file_size":6355291,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B2","_id":"10"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"425","user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-16T11:32:35Z"},{"type":"mastersthesis","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"426","user_id":"15504","department":[{"_id":"75"}],"year":"2014","citation":{"apa":"Dornseifer, V. (2014). <i>Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network</i>. Universität Paderborn.","bibtex":"@book{Dornseifer_2014, title={Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network}, publisher={Universität Paderborn}, author={Dornseifer, Veit}, year={2014} }","short":"V. Dornseifer, Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network, Universität Paderborn, 2014.","mla":"Dornseifer, Veit. <i>Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network</i>. Universität Paderborn, 2014.","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."},"date_updated":"2022-01-06T07:00:43Z","publisher":"Universität Paderborn","author":[{"first_name":"Veit","full_name":"Dornseifer, Veit","last_name":"Dornseifer"}],"date_created":"2017-10-17T12:42:15Z","title":"Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network"},{"year":"2014","citation":{"ama":"Bulk B. <i>Evaluating the Influence of Different Abstraction Levels of Software Design on Performance Prediction</i>. Universität Paderborn; 2014.","chicago":"Bulk, Benjamin. <i>Evaluating the Influence of Different Abstraction Levels of Software Design on Performance Prediction</i>. Universität Paderborn, 2014.","ieee":"B. Bulk, <i>Evaluating the Influence of Different Abstraction Levels of Software Design on Performance prediction</i>. Universität Paderborn, 2014.","apa":"Bulk, B. (2014). <i>Evaluating the Influence of Different Abstraction Levels of Software Design on Performance prediction</i>. Universität Paderborn.","mla":"Bulk, Benjamin. <i>Evaluating the Influence of Different Abstraction Levels of Software Design on Performance Prediction</i>. Universität Paderborn, 2014.","bibtex":"@book{Bulk_2014, title={Evaluating the Influence of Different Abstraction Levels of Software Design on Performance prediction}, publisher={Universität Paderborn}, author={Bulk, Benjamin}, year={2014} }","short":"B. Bulk, Evaluating the Influence of Different Abstraction Levels of Software Design on Performance Prediction, Universität Paderborn, 2014."},"status":"public","type":"mastersthesis","title":"Evaluating the Influence of Different Abstraction Levels of Software Design on Performance prediction","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"date_updated":"2022-01-06T07:00:45Z","publisher":"Universität Paderborn","_id":"427","date_created":"2017-10-17T12:42:15Z","user_id":"15504","author":[{"last_name":"Bulk","full_name":"Bulk, Benjamin","first_name":"Benjamin"}]},{"has_accepted_license":"1","page":"411-418","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.","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).","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} }","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.","short":"F. Mohr, in: Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC), 2014, pp. 411–418."},"year":"2014","author":[{"full_name":"Mohr, Felix","last_name":"Mohr","first_name":"Felix"}],"date_created":"2017-10-17T12:42:15Z","date_updated":"2022-01-06T07:00:47Z","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007%2F978-3-662-45391-9_31"}],"title":"Estimating Functional Reusability of Services","publication":"Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC)","type":"conference","status":"public","file":[{"date_updated":"2018-03-16T11:32:02Z","creator":"florida","date_created":"2018-03-16T11:32:02Z","file_size":200063,"access_level":"closed","file_name":"428-ICSOC14.pdf","file_id":"1357","content_type":"application/pdf","success":1,"relation":"main_file"}],"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"}],"department":[{"_id":"355"}],"series_title":"LNCS","user_id":"477","_id":"428","project":[{"name":"SFB 901","_id":"1"},{"_id":"10","name":"SFB 901 - Subprojekt B2"},{"name":"SFB 901 - Project Area B","_id":"3"}],"file_date_updated":"2018-03-16T11:32:02Z","language":[{"iso":"eng"}],"ddc":["040"]},{"year":"2014","citation":{"bibtex":"@book{Herbort_2014, title={Entwicklung eines mathematischen Modells zur Optimierung der Struktur eines Trinkwasserbehälters}, publisher={Universität Paderborn}, author={Herbort, Maik}, year={2014} }","mla":"Herbort, Maik. <i>Entwicklung eines mathematischen Modells zur Optimierung der Struktur eines Trinkwasserbehälters</i>. Universität Paderborn, 2014.","short":"M. Herbort, Entwicklung eines mathematischen Modells zur Optimierung der Struktur eines Trinkwasserbehälters, Universität Paderborn, 2014.","apa":"Herbort, M. (2014). <i>Entwicklung eines mathematischen Modells zur Optimierung der Struktur eines Trinkwasserbehälters</i>. Universität Paderborn.","ama":"Herbort M. <i>Entwicklung eines mathematischen Modells zur Optimierung der Struktur eines Trinkwasserbehälters</i>. Universität Paderborn; 2014.","chicago":"Herbort, Maik. <i>Entwicklung eines mathematischen Modells zur Optimierung der Struktur eines Trinkwasserbehälters</i>. Universität Paderborn, 2014.","ieee":"M. Herbort, <i>Entwicklung eines mathematischen Modells zur Optimierung der Struktur eines Trinkwasserbehälters</i>. Universität Paderborn, 2014."},"title":"Entwicklung eines mathematischen Modells zur Optimierung der Struktur eines Trinkwasserbehälters","date_updated":"2022-01-06T07:00:48Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:15Z","author":[{"first_name":"Maik","last_name":"Herbort","full_name":"Herbort, Maik"}],"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"_id":"429","project":[{"_id":"1","name":"SFB 901"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"_id":"4","name":"SFB 901 - Project Area C"}],"user_id":"477"},{"citation":{"ieee":"A. Krakau, <i>Entwicklung eines Konzepts zur Kodierung eines objektorientierten Typsystems in SMT</i>. Universität Paderborn, 2014.","chicago":"Krakau, Andreas. <i>Entwicklung eines Konzepts zur Kodierung eines objektorientierten Typsystems in SMT</i>. Universität Paderborn, 2014.","ama":"Krakau A. <i>Entwicklung eines Konzepts zur Kodierung eines objektorientierten Typsystems in SMT</i>. Universität Paderborn; 2014.","apa":"Krakau, A. (2014). <i>Entwicklung eines Konzepts zur Kodierung eines objektorientierten Typsystems in SMT</i>. Universität Paderborn.","mla":"Krakau, Andreas. <i>Entwicklung eines Konzepts zur Kodierung eines objektorientierten Typsystems in SMT</i>. Universität Paderborn, 2014.","short":"A. Krakau, Entwicklung eines Konzepts zur Kodierung eines objektorientierten Typsystems in SMT, Universität Paderborn, 2014.","bibtex":"@book{Krakau_2014, title={Entwicklung eines Konzepts zur Kodierung eines objektorientierten Typsystems in SMT}, publisher={Universität Paderborn}, author={Krakau, Andreas}, year={2014} }"},"year":"2014","date_created":"2017-10-17T12:42:15Z","author":[{"full_name":"Krakau, Andreas","last_name":"Krakau","first_name":"Andreas"}],"date_updated":"2022-01-06T07:00:50Z","publisher":"Universität Paderborn","title":"Entwicklung eines Konzepts zur Kodierung eines objektorientierten Typsystems in SMT","type":"bachelorsthesis","status":"public","user_id":"477","project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"430","language":[{"iso":"ger"}]},{"department":[{"_id":"63"}],"user_id":"477","_id":"431","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"}],"file_date_updated":"2018-03-16T11:31:29Z","ddc":["040"],"type":"dissertation","status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":792106,"access_level":"closed","file_name":"431-Peter_Kling_PhDThesis_01.pdf","file_id":"1356","date_updated":"2018-03-16T11:31:29Z","creator":"florida","date_created":"2018-03-16T11:31:29Z"}],"abstract":[{"lang":"eng","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."}],"date_created":"2017-10-17T12:42:15Z","supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"author":[{"full_name":"Kling, Peter","last_name":"Kling","first_name":"Peter"}],"date_updated":"2022-01-06T07:00:52Z","publisher":"Universität Paderborn","title":"Energy-efficient Scheduling Algorithms","has_accepted_license":"1","citation":{"chicago":"Kling, Peter. <i>Energy-Efficient Scheduling Algorithms</i>. Universität Paderborn, 2014.","ieee":"P. Kling, <i>Energy-efficient Scheduling Algorithms</i>. Universität Paderborn, 2014.","ama":"Kling P. <i>Energy-Efficient Scheduling Algorithms</i>. Universität Paderborn; 2014.","apa":"Kling, P. (2014). <i>Energy-efficient Scheduling Algorithms</i>. Universität Paderborn.","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.","mla":"Kling, Peter. <i>Energy-Efficient Scheduling Algorithms</i>. Universität Paderborn, 2014."},"year":"2014"},{"title":"Light Scattering By Random Irregular Particles With Different Morphology","conference":{"end_date":"2014-08-29","location":"Marseille (France)","name":"10th International Conference on Laser-Light and Interactions with Particles","start_date":"2014-08-25"},"date_updated":"2022-01-06T07:00:53Z","author":[{"first_name":"Yevgen","full_name":"Grynko, Yevgen","id":"26059","last_name":"Grynko"},{"full_name":"Zubko, Evgenij","last_name":"Zubko","first_name":"Evgenij"}],"date_created":"2018-08-30T09:29:24Z","year":"2014","citation":{"mla":"Grynko, Yevgen, and Evgenij Zubko. <i>Light Scattering By Random Irregular Particles With Different Morphology</i>. 2014.","short":"Y. Grynko, E. Zubko, in: 2014.","bibtex":"@inproceedings{Grynko_Zubko_2014, title={Light Scattering By Random Irregular Particles With Different Morphology}, author={Grynko, Yevgen and Zubko, Evgenij}, year={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).","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."},"has_accepted_license":"1","publication_status":"published","ddc":["530"],"file_date_updated":"2018-08-30T09:28:00Z","language":[{"iso":"eng"}],"_id":"4315","department":[{"_id":"61"}],"user_id":"55706","abstract":[{"lang":"eng","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."}],"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":794798,"access_level":"closed","file_id":"4316","file_name":"2014-08 Grynko,Zubko_Light Scattering by Radndom irregular particles with different morphology.pdf","date_updated":"2018-08-30T09:28:00Z","creator":"hclaudia","date_created":"2018-08-30T09:28:00Z"}],"type":"conference"},{"title":"Energy-Efficient Queuing with Delayed Deactivation","author":[{"first_name":"Nico","full_name":"Bredenbals, Nico","last_name":"Bredenbals"}],"date_created":"2017-10-17T12:42:16Z","date_updated":"2022-01-06T07:00:54Z","publisher":"Universität Paderborn","citation":{"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.","apa":"Bredenbals, N. (2014). <i>Energy-Efficient Queuing with Delayed Deactivation</i>. Universität Paderborn.","short":"N. Bredenbals, Energy-Efficient Queuing with Delayed Deactivation, Universität Paderborn, 2014.","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."},"year":"2014","user_id":"15504","department":[{"_id":"75"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"432","status":"public","type":"mastersthesis"},{"file_date_updated":"2018-03-16T11:30:58Z","language":[{"iso":"eng"}],"ddc":["040"],"user_id":"477","department":[{"_id":"78"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"433","file":[{"date_created":"2018-03-16T11:30:58Z","creator":"florida","date_updated":"2018-03-16T11:30:58Z","file_name":"433-wiersema14_reconfig_IEEE_approved.pdf","access_level":"closed","file_id":"1355","file_size":369333,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","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."}],"type":"conference","publication":"Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)","doi":"10.1109/ReConFig.2014.7032514","title":"Embedding FPGA Overlays into Configurable Systems-on-Chip: ReconOS meets ZUMA","date_created":"2017-10-17T12:42:16Z","author":[{"first_name":"Tobias","full_name":"Wiersema, Tobias","id":"3118","last_name":"Wiersema"},{"full_name":"Bockhorn, Arne","last_name":"Bockhorn","first_name":"Arne"},{"full_name":"Platzner, Marco","id":"398","last_name":"Platzner","first_name":"Marco"}],"date_updated":"2022-01-06T07:00:56Z","citation":{"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.","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>","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>.","short":"T. Wiersema, A. Bockhorn, M. Platzner, in: Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig), 2014, pp. 1–6.","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} }"},"page":"1-6 ","year":"2014","has_accepted_license":"1"},{"issue":"2","year":"2014","date_created":"2018-08-30T14:04:23Z","publisher":"American Chemical Society (ACS)","title":"Radio Frequency Electromechanical Control over a Surface Plasmon Polariton Coupler","publication":"ACS Photonics","abstract":[{"lang":"eng","text":"We explore the impact of ∼500 MHz surface acoustic waves traveling across a commensurable plasmonic grating coupler. A stroboscopic technique involving surface acoustic waves synchronized to a modelocked optical source allows to time-resolve the dynamical impact of the electromechanically induced perturbation. The surface acoustic wave periodically enhances or decreases the surface ripple of the static grating. Most remarkably, the dynamic surface deformation deliberately modulates the coupler’s efficiency by ±2% during the ∼2 ns acoustic cycle."}],"language":[{"iso":"eng"}],"keyword":["nanomechanics","plasmonics","surface acoustic waves","surface plasmon polaritons"],"publication_status":"published","publication_identifier":{"issn":["2330-4022","2330-4022"]},"citation":{"ieee":"C. Ruppert <i>et al.</i>, “Radio Frequency Electromechanical Control over a Surface Plasmon Polariton Coupler,” <i>ACS Photonics</i>, vol. 1, no. 2, pp. 91–95, 2014.","chicago":"Ruppert, Claudia, Frederike Förster, Artur Zrenner, Jörg B. Kinzel, Achim Wixforth, Hubert J. Krenner, and Markus Betz. “Radio Frequency Electromechanical Control over a Surface Plasmon Polariton Coupler.” <i>ACS Photonics</i> 1, no. 2 (2014): 91–95. <a href=\"https://doi.org/10.1021/ph400022u\">https://doi.org/10.1021/ph400022u</a>.","ama":"Ruppert C, Förster F, Zrenner A, et al. Radio Frequency Electromechanical Control over a Surface Plasmon Polariton Coupler. <i>ACS Photonics</i>. 2014;1(2):91-95. doi:<a href=\"https://doi.org/10.1021/ph400022u\">10.1021/ph400022u</a>","apa":"Ruppert, C., Förster, F., Zrenner, A., Kinzel, J. B., Wixforth, A., Krenner, H. J., &#38; Betz, M. (2014). Radio Frequency Electromechanical Control over a Surface Plasmon Polariton Coupler. <i>ACS Photonics</i>, <i>1</i>(2), 91–95. <a href=\"https://doi.org/10.1021/ph400022u\">https://doi.org/10.1021/ph400022u</a>","short":"C. Ruppert, F. Förster, A. Zrenner, J.B. Kinzel, A. Wixforth, H.J. Krenner, M. Betz, ACS Photonics 1 (2014) 91–95.","mla":"Ruppert, Claudia, et al. “Radio Frequency Electromechanical Control over a Surface Plasmon Polariton Coupler.” <i>ACS Photonics</i>, vol. 1, no. 2, American Chemical Society (ACS), 2014, pp. 91–95, doi:<a href=\"https://doi.org/10.1021/ph400022u\">10.1021/ph400022u</a>.","bibtex":"@article{Ruppert_Förster_Zrenner_Kinzel_Wixforth_Krenner_Betz_2014, title={Radio Frequency Electromechanical Control over a Surface Plasmon Polariton Coupler}, volume={1}, DOI={<a href=\"https://doi.org/10.1021/ph400022u\">10.1021/ph400022u</a>}, number={2}, journal={ACS Photonics}, publisher={American Chemical Society (ACS)}, author={Ruppert, Claudia and Förster, Frederike and Zrenner, Artur and Kinzel, Jörg B. and Wixforth, Achim and Krenner, Hubert J. and Betz, Markus}, year={2014}, pages={91–95} }"},"intvolume":"         1","page":"91-95","author":[{"first_name":"Claudia","last_name":"Ruppert","full_name":"Ruppert, Claudia"},{"first_name":"Frederike","full_name":"Förster, Frederike","last_name":"Förster"},{"first_name":"Artur","id":"606","full_name":"Zrenner, Artur","last_name":"Zrenner","orcid":"0000-0002-5190-0944"},{"first_name":"Jörg B.","last_name":"Kinzel","full_name":"Kinzel, Jörg B."},{"full_name":"Wixforth, Achim","last_name":"Wixforth","first_name":"Achim"},{"first_name":"Hubert J.","full_name":"Krenner, Hubert J.","last_name":"Krenner"},{"full_name":"Betz, Markus","last_name":"Betz","first_name":"Markus"}],"volume":1,"date_updated":"2022-01-06T07:00:56Z","doi":"10.1021/ph400022u","type":"journal_article","status":"public","user_id":"49428","department":[{"_id":"15"},{"_id":"230"},{"_id":"35"}],"_id":"4335","article_type":"original"},{"_id":"434","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"user_id":"477","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","date_updated":"2022-01-06T07:00:57Z","publisher":"Universität Paderborn","author":[{"last_name":"Luo","full_name":"Luo, Linghui","first_name":"Linghui"}],"date_created":"2017-10-17T12:42:16Z","title":"Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen","year":"2014","citation":{"apa":"Luo, L. (2014). <i>Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen</i>. Universität Paderborn.","mla":"Luo, Linghui. <i>Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen</i>. Universität Paderborn, 2014.","bibtex":"@book{Luo_2014, title={Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen}, publisher={Universität Paderborn}, author={Luo, Linghui}, year={2014} }","short":"L. Luo, Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen, Universität Paderborn, 2014.","ama":"Luo L. <i>Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen</i>. Universität Paderborn; 2014.","ieee":"L. Luo, <i>Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen</i>. Universität Paderborn, 2014.","chicago":"Luo, Linghui. <i>Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen</i>. Universität Paderborn, 2014."}},{"has_accepted_license":"1","year":"2014","citation":{"chicago":"Antoniadis, Antonios, Neal Barcelo, Mario Consuegra, Peer Kling, Michael Nugent, Kirk Pruhs, and Michele Scquizzato. “Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules.” In <i>Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 63--74. LIPIcs, 2014. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2014.63\">https://doi.org/10.4230/LIPIcs.STACS.2014.63</a>.","ieee":"A. Antoniadis <i>et al.</i>, “Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules,” in <i>Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 2014, pp. 63--74.","ama":"Antoniadis A, Barcelo N, Consuegra M, et al. Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules. In: <i>Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)</i>. LIPIcs. ; 2014:63--74. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2014.63\">10.4230/LIPIcs.STACS.2014.63</a>","mla":"Antoniadis, Antonios, et al. “Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules.” <i>Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 2014, pp. 63--74, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2014.63\">10.4230/LIPIcs.STACS.2014.63</a>.","bibtex":"@inproceedings{Antoniadis_Barcelo_Consuegra_Kling_Nugent_Pruhs_Scquizzato_2014, series={LIPIcs}, title={Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2014.63\">10.4230/LIPIcs.STACS.2014.63</a>}, booktitle={Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)}, author={Antoniadis, Antonios and Barcelo, Neal and Consuegra, Mario and Kling, Peer and Nugent, Michael and Pruhs, Kirk and Scquizzato, Michele}, year={2014}, pages={63--74}, collection={LIPIcs} }","short":"A. Antoniadis, N. Barcelo, M. Consuegra, P. Kling, M. Nugent, K. Pruhs, M. Scquizzato, in: Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS), 2014, pp. 63--74.","apa":"Antoniadis, A., Barcelo, N., Consuegra, M., Kling, P., Nugent, M., Pruhs, K., &#38; Scquizzato, M. (2014). Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules. In <i>Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)</i> (pp. 63--74). <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2014.63\">https://doi.org/10.4230/LIPIcs.STACS.2014.63</a>"},"page":"63--74","date_updated":"2022-01-06T07:00:58Z","author":[{"last_name":"Antoniadis","full_name":"Antoniadis, Antonios","first_name":"Antonios"},{"last_name":"Barcelo","full_name":"Barcelo, Neal","first_name":"Neal"},{"first_name":"Mario","last_name":"Consuegra","full_name":"Consuegra, Mario"},{"first_name":"Peer","full_name":"Kling, Peer","last_name":"Kling"},{"full_name":"Nugent, Michael","last_name":"Nugent","first_name":"Michael"},{"last_name":"Pruhs","full_name":"Pruhs, Kirk","first_name":"Kirk"},{"first_name":"Michele","full_name":"Scquizzato, Michele","last_name":"Scquizzato"}],"date_created":"2017-10-17T12:42:16Z","title":"Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules","doi":"10.4230/LIPIcs.STACS.2014.63","type":"conference","publication":"Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)","abstract":[{"lang":"eng","text":"We give a polynomial time algorithm to compute an optimal energy and fractional weighted flow trade-off schedule for a speed-scalable processor with discrete speeds.Our algorithm uses a geometric approach that is based on structural properties obtained from a primal-dual formulation of the problem."}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":525851,"file_id":"1354","file_name":"435-Kling_C2_STACS2014.pdf","access_level":"closed","date_updated":"2018-03-16T11:30:23Z","date_created":"2018-03-16T11:30:23Z","creator":"florida"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"14","name":"SFB 901 - Subproject C2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"435","user_id":"477","series_title":"LIPIcs","department":[{"_id":"63"}],"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-16T11:30:23Z"},{"title":"Easy-to-use on-the-fly binary program acceleration on many-cores","date_created":"2017-10-17T12:42:16Z","author":[{"first_name":"Marvin","last_name":"Damschen","full_name":"Damschen, Marvin"}],"user_id":"15504","date_updated":"2022-01-06T07:00:58Z","publisher":"Universität Paderborn","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"436","citation":{"ama":"Damschen M. <i>Easy-to-Use on-the-Fly Binary Program Acceleration on Many-Cores</i>. Universität Paderborn; 2014.","ieee":"M. Damschen, <i>Easy-to-use on-the-fly binary program acceleration on many-cores</i>. Universität Paderborn, 2014.","chicago":"Damschen, Marvin. <i>Easy-to-Use on-the-Fly Binary Program Acceleration on Many-Cores</i>. Universität Paderborn, 2014.","apa":"Damschen, M. (2014). <i>Easy-to-use on-the-fly binary program acceleration on many-cores</i>. Universität Paderborn.","bibtex":"@book{Damschen_2014, title={Easy-to-use on-the-fly binary program acceleration on many-cores}, publisher={Universität Paderborn}, author={Damschen, Marvin}, year={2014} }","short":"M. Damschen, Easy-to-Use on-the-Fly Binary Program Acceleration on Many-Cores, Universität Paderborn, 2014.","mla":"Damschen, Marvin. <i>Easy-to-Use on-the-Fly Binary Program Acceleration on Many-Cores</i>. Universität Paderborn, 2014."},"status":"public","year":"2014","type":"mastersthesis"},{"title":"Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells","date_updated":"2022-01-06T07:00:59Z","publisher":"Universität Paderborn","supervisor":[{"id":"37339","full_name":"Hehenkamp, Burkhard","last_name":"Hehenkamp","first_name":"Burkhard"}],"date_created":"2017-10-17T12:42:17Z","author":[{"full_name":"Wemhöner, Vanessa","last_name":"Wemhöner","first_name":"Vanessa"}],"year":"2014","citation":{"ieee":"V. Wemhöner, <i>Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells</i>. Universität Paderborn, 2014.","chicago":"Wemhöner, Vanessa. <i>Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells</i>. Universität Paderborn, 2014.","ama":"Wemhöner V. <i>Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells</i>. Universität Paderborn; 2014.","apa":"Wemhöner, V. (2014). <i>Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells</i>. Universität Paderborn.","mla":"Wemhöner, Vanessa. <i>Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells</i>. Universität Paderborn, 2014.","short":"V. Wemhöner, Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells, Universität Paderborn, 2014.","bibtex":"@book{Wemhöner_2014, title={Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells}, publisher={Universität Paderborn}, author={Wemhöner, Vanessa}, year={2014} }"},"language":[{"iso":"ger"}],"_id":"437","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"280"}],"user_id":"42447","status":"public","type":"bachelorsthesis"},{"title":"Designing an Anonymous and Secure Reputation System Using a Group Signature Variant","date_created":"2017-10-17T12:42:17Z","author":[{"first_name":"Andreas","last_name":"Kokoschka","full_name":"Kokoschka, Andreas"}],"date_updated":"2022-01-06T07:01:00Z","publisher":"Universität Paderborn","citation":{"bibtex":"@book{Kokoschka_2014, title={Designing an Anonymous and Secure Reputation System Using a Group Signature Variant}, publisher={Universität Paderborn}, author={Kokoschka, Andreas}, year={2014} }","mla":"Kokoschka, Andreas. <i>Designing an Anonymous and Secure Reputation System Using a Group Signature Variant</i>. Universität Paderborn, 2014.","short":"A. Kokoschka, Designing an Anonymous and Secure Reputation System Using a Group Signature Variant, Universität Paderborn, 2014.","apa":"Kokoschka, A. (2014). <i>Designing an Anonymous and Secure Reputation System Using a Group Signature Variant</i>. Universität Paderborn.","ieee":"A. Kokoschka, <i>Designing an Anonymous and Secure Reputation System Using a Group Signature Variant</i>. Universität Paderborn, 2014.","chicago":"Kokoschka, Andreas. <i>Designing an Anonymous and Secure Reputation System Using a Group Signature Variant</i>. Universität Paderborn, 2014.","ama":"Kokoschka A. <i>Designing an Anonymous and Secure Reputation System Using a Group Signature Variant</i>. Universität Paderborn; 2014."},"year":"2014","user_id":"15504","_id":"438","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"status":"public","type":"bachelorsthesis"},{"status":"public","file":[{"file_size":531139,"access_level":"closed","file_id":"5424","file_name":"Dissertation_2014_Kaimann.pdf","date_updated":"2018-11-08T09:29:04Z","date_created":"2018-11-08T09:29:04Z","creator":"dkaimann","success":1,"relation":"main_file","content_type":"application/pdf"}],"type":"dissertation","language":[{"iso":"eng"}],"file_date_updated":"2018-11-08T09:29:04Z","ddc":["330"],"department":[{"_id":"19"},{"_id":"200"},{"_id":"205"},{"_id":"183"}],"user_id":"477","_id":"440","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"citation":{"ama":"Kaimann D. <i>Decision Making under Asymmetric Information in Markets for Experience Goods: Empirical Evidence of Signaling Effects on Consumer Perceptions</i>. Universität Paderborn; 2014.","ieee":"D. Kaimann, <i>Decision Making under Asymmetric Information in Markets for Experience Goods: Empirical Evidence of Signaling Effects on Consumer Perceptions</i>. Universität Paderborn, 2014.","chicago":"Kaimann, Daniel. <i>Decision Making under Asymmetric Information in Markets for Experience Goods: Empirical Evidence of Signaling Effects on Consumer Perceptions</i>. Universität Paderborn, 2014.","apa":"Kaimann, D. (2014). <i>Decision Making under Asymmetric Information in Markets for Experience Goods: Empirical Evidence of Signaling Effects on Consumer Perceptions</i>. Universität Paderborn.","bibtex":"@book{Kaimann_2014, title={Decision Making under Asymmetric Information in Markets for Experience Goods: Empirical Evidence of Signaling Effects on Consumer Perceptions}, publisher={Universität Paderborn}, author={Kaimann, Daniel}, year={2014} }","mla":"Kaimann, Daniel. <i>Decision Making under Asymmetric Information in Markets for Experience Goods: Empirical Evidence of Signaling Effects on Consumer Perceptions</i>. Universität Paderborn, 2014.","short":"D. Kaimann, Decision Making under Asymmetric Information in Markets for Experience Goods: Empirical Evidence of Signaling Effects on Consumer Perceptions, Universität Paderborn, 2014."},"year":"2014","has_accepted_license":"1","title":"Decision Making under Asymmetric Information in Markets for Experience Goods: Empirical Evidence of Signaling Effects on Consumer Perceptions","supervisor":[{"first_name":"Claus-Jochen","last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen"},{"first_name":"Bernd","last_name":"Frick","full_name":"Frick, Bernd"}],"date_created":"2017-10-17T12:42:17Z","author":[{"last_name":"Kaimann","full_name":"Kaimann, Daniel","id":"18949","first_name":"Daniel"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:01Z"}]