@inproceedings{4078,
  author       = {{Riedl, Thomas and Kovács, A. and Meertens, D. and Lindner, Jörg}},
  location     = {{Warsaw (Poland)}},
  title        = {{{Structure and surface chemistry analysis of ultra-thin reactive ion etched GaAs (111) nanopillars}}},
  year         = {{2014}},
}

@inproceedings{4079,
  author       = {{Rüsing, M. and Merten, L. and Reinert, P. and Rogalla, D. and Becker, H.-W. and Lindner, Jörg}},
  location     = {{Paderborn}},
  title        = {{{RBS of gold-coated polystyrene nanospheres}}},
  year         = {{2014}},
}

@inproceedings{408,
  abstract     = {{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.}},
  author       = {{Jakobs, Marie-Christine and Platzner, Marco and Wiersema, Tobias and Wehrheim, Heike}},
  booktitle    = {{Proceedings of the 11th International Conference on Integrated Formal Methods (iFM)}},
  editor       = {{Albert, Elvira and Sekerinski, Emil}},
  pages        = {{307--322}},
  title        = {{{Integrating Software and Hardware Verification}}},
  doi          = {{10.1007/978-3-319-10181-1_19}},
  year         = {{2014}},
}

@inproceedings{4080,
  author       = {{Lindner, Jörg}},
  location     = {{Dresden (Germany)}},
  title        = {{{TEM investigations on the nanoheteroepitaxy of semiconductors }}},
  year         = {{2014}},
}

@inproceedings{4082,
  author       = {{Lindner, Jörg}},
  location     = {{Porquerolles (France)}},
  title        = {{{Microscopic studies of plasmonic nanostructures II}}},
  year         = {{2014}},
}

@inproceedings{4083,
  author       = {{Lindner, Jörg}},
  location     = {{Jena (Germany)}},
  title        = {{{Nanostrukturierte Oberflächen, nicht nur zum Spass}}},
  year         = {{2014}},
}

@inproceedings{409,
  abstract     = {{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.}},
  author       = {{Platenius, Marie Christin and Becker, Steffen and Schäfer, Wilhelm}},
  booktitle    = {{Proceedings of the 8th European Conference on Software Architecture (ECSA 2014)}},
  editor       = {{Avgeriou, Paris and Zdun, Uwe}},
  pages        = {{210--217}},
  title        = {{{Integrating Service Matchers into a Service Market Architecture}}},
  doi          = {{10.1007/978-3-319-09970-5_19}},
  year         = {{2014}},
}

@inproceedings{41,
  author       = {{Schwichtenberg, Simon and Gerth, Christian and Engels, Gregor}},
  booktitle    = {{Proceedings of the 9th International Workshop on Ontology Matching collocated with the 13th International Semantic Web Conference (ISWC 2014), Riva del Garda, Trentino, Italy, October 20, 2014.}},
  pages        = {{155----162}},
  publisher    = {{CEUR-WS.org}},
  title        = {{{RSDL workbench results for OAEI 2014}}},
  volume       = {{1317}},
  year         = {{2014}},
}

@article{410,
  abstract     = {{One goal of service-oriented computing is to realize future markets of composed services. In such markets, service providers offer services that can be ﬂexibly combined with each other. However, although crucial for decision-making, market participants are usually not able to individually estimate the quality of traded services in advance. To overcome this problem, we present a conceptual design for a reputation system that collects and processes user feedback on transactions, and provides this information as a signal for quality to participants in the market. Based on our proposed concept, we describe the incorporation of reputation information into distinct decision-making processes that are crucial in such service markets. In this context, we present a fuzzy service matching approach that takes reputation information into account. Furthermore, we introduce an adaptive service composition approach, and investigate the impact of exchanging immediate user feedback by reputation information. Last but not least, we describe the importance of reputation information for economic decisions of different market participants. The overall output of this paper is a comprehensive view on managing and exploiting reputation information in markets of composed services using the example of On-The-Fly Computing.}},
  author       = {{Jungmann, Alexander and Brangewitz, Sonja and Petrlic, Ronald and Platenius, Marie Christin}},
  journal      = {{International Journal On Advances in Intelligent Systems (IntSys)}},
  number       = {{3&4}},
  pages        = {{572----594}},
  publisher    = {{IARIA}},
  title        = {{{Incorporating Reputation Information into Decision-Making Processes in Markets of Composed Services}}},
  volume       = {{7}},
  year         = {{2014}},
}

@misc{411,
  author       = {{Taherinajafabadi, Vahide}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Improving Service Specifications for the Service Matching on a Service Market}}},
  year         = {{2014}},
}

@inproceedings{412,
  abstract     = {{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.}},
  author       = {{Feldotto, Matthias and Scheideler, Christian and Graffi, Kalman}},
  booktitle    = {{Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)}},
  pages        = {{1--10}},
  title        = {{{HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths}}},
  doi          = {{10.1109/P2P.2014.6934300}},
  year         = {{2014}},
}

@misc{413,
  author       = {{Eusterholz, Fabian}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Horizontale Fusionen: Theorie und Praxis am Beispiel zweier Entscheidungen des Bundeskartellamtes}}},
  year         = {{2014}},
}

@misc{414,
  author       = {{Jochheim, Janek}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Hiding software components using functional encryption}}},
  year         = {{2014}},
}

@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}},
}

