@misc{415, author = {{Vijapurwala, Shafi}}, publisher = {{Universität Paderborn}}, title = {{{Handling Incomplete Service Specifications using Fuzzy Matching}}}, year = {{2014}}, } @misc{416, author = {{Bemmann, Pascal}}, publisher = {{Universität Paderborn}}, title = {{{Group Signature Schemes with Strong Exculpability}}}, year = {{2014}}, } @inproceedings{417, abstract = {{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.}}, author = {{Besova, Galina and Steenke, Dominik and Wehrheim, Heike}}, booktitle = {{Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD)}}, pages = {{1601--1610}}, title = {{{Grammar-based model transformations}}}, doi = {{10.1016/j.cl.2015.05.003}}, year = {{2014}}, } @misc{418, author = {{Pauck, Felix}}, publisher = {{Universität Paderborn}}, title = {{{Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren}}}, year = {{2014}}, } @phdthesis{419, abstract = {{The present thesis investigates the prevalence of and the reasons for hiring discrimination against women and ethnic Turks in the German labor market. Subsequent to a discussion of how to reveal discrimination, the literature on wage and employment differences inside and outside the German labor market is reviewed. Afterwards, different (economic) theories explaining inequalities in labor markets are presented. In the empirical analyses a field experiment - the so called correspondence testing - is conducted where matched pairs of (fictitious) male and female as well as German-named and Turkish-named applicants respond to, respectively, 656 and 608 (real) apprenticeship offers in predominantly male-dominated jobs. Descriptive results and econometric analyses using probit regressions on various model specifications indicate that the female applicant has a 19 percent lower callback probability compared to her male counterpart. However, differential treatment is both job- and firm-type driven. While callback rates are not statistically different from zero in female-dominated and “gender-neutral” occupations, they prevail in jobs where men are overrepresented. Furthermore, discrimination is restricted to late recruiters, i.e., companies that advertise their vacancies right before the apprenticeship is supposed to start. Similar conclusions can be drawn from the study investigating ethnic discrimination. The 32 percent lower callback probability of the Turkish-named applicant decreases if early rather than late recruiters are addressed. Apart from that, comparing response and callback rates to the candidates using different experimental designs, i.e., sending out single versus pairs of applications, yields no statistically significant differences demonstrating the unbiasedness of the correspondence approach.}}, author = {{Kolle, Andre}}, publisher = {{Universität Paderborn}}, title = {{{Gender and ethnic discrimination in hiring : evidence from field experiments in the German labor market}}}, year = {{2014}}, } @misc{420, author = {{Merschjohann, Sven}}, publisher = {{Universität Paderborn}}, title = {{{Fuzzy Matching of Service Price Specifications}}}, year = {{2014}}, } @misc{421, author = {{Lippert, Jan}}, publisher = {{Universität Paderborn}}, title = {{{Fujisaki-Okamoto Transformation}}}, year = {{2014}}, } @misc{422, author = {{Sanati, Maryam}}, publisher = {{Universität Paderborn}}, title = {{{Formal Semantics of Probabilistic SMT Solving in Verification of Service Compositions}}}, year = {{2014}}, } @misc{423, author = {{Jojiju, Suman}}, publisher = {{Universität Paderborn}}, title = {{{Finding Optimal Self-Adaption Rules by Design-Space Exploration}}}, year = {{2014}}, } @misc{424, author = {{Finkensiep, Christoph}}, publisher = {{Universität Paderborn}}, title = {{{Fast and Flexible Automatic Composition of Semantic Web Services}}}, year = {{2014}}, } @inproceedings{425, abstract = {{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.}}, author = {{Jungmann, Alexander and Jatzkowski, Jan and Kleinjohann, Bernd}}, booktitle = {{Proceedings of the 9th International Conference on Computer Vision Theory and Applications (VISAPP)}}, pages = {{648--655}}, title = {{{Evaluation of Color Spaces for Robust Image Segmentation}}}, year = {{2014}}, } @misc{426, author = {{Dornseifer, Veit}}, publisher = {{Universität Paderborn}}, title = {{{Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network}}}, year = {{2014}}, } @misc{427, author = {{Bulk, Benjamin}}, publisher = {{Universität Paderborn}}, title = {{{Evaluating the Influence of Different Abstraction Levels of Software Design on Performance prediction}}}, year = {{2014}}, } @inproceedings{428, abstract = {{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.}}, author = {{Mohr, Felix}}, booktitle = {{Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC)}}, pages = {{411--418}}, title = {{{Estimating Functional Reusability of Services}}}, year = {{2014}}, } @misc{429, author = {{Herbort, Maik}}, publisher = {{Universität Paderborn}}, title = {{{Entwicklung eines mathematischen Modells zur Optimierung der Struktur eines Trinkwasserbehälters}}}, year = {{2014}}, } @misc{430, author = {{Krakau, Andreas}}, publisher = {{Universität Paderborn}}, title = {{{Entwicklung eines Konzepts zur Kodierung eines objektorientierten Typsystems in SMT}}}, year = {{2014}}, } @phdthesis{431, abstract = {{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.}}, author = {{Kling, Peter}}, publisher = {{Universität Paderborn}}, title = {{{Energy-efficient Scheduling Algorithms}}}, year = {{2014}}, } @misc{432, author = {{Bredenbals, Nico}}, publisher = {{Universität Paderborn}}, title = {{{Energy-Efficient Queuing with Delayed Deactivation}}}, year = {{2014}}, } @inproceedings{433, abstract = {{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.}}, author = {{Wiersema, Tobias and Bockhorn, Arne and Platzner, Marco}}, booktitle = {{Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)}}, pages = {{1--6 }}, title = {{{Embedding FPGA Overlays into Configurable Systems-on-Chip: ReconOS meets ZUMA}}}, doi = {{10.1109/ReConFig.2014.7032514}}, year = {{2014}}, } @misc{434, author = {{Luo, Linghui}}, publisher = {{Universität Paderborn}}, title = {{{Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen}}}, year = {{2014}}, }