@article{26918, author = {{Wright, C J and Atkinson, F S and Ramalingam, N and Buyken, Anette and Brand-Miller, J C}}, issn = {{0954-3007}}, journal = {{European Journal of Clinical Nutrition}}, pages = {{939--943}}, title = {{{Effects of human milk and formula on postprandial glycaemia and insulinaemia}}}, doi = {{10.1038/ejcn.2015.29}}, year = {{2015}}, } @article{26919, author = {{Goletzke, Janina and Buyken, Anette and Louie, Jimmy CY and Moses, Robert G and Brand-Miller, Jennie C}}, issn = {{0002-9165}}, journal = {{The American Journal of Clinical Nutrition}}, pages = {{626--632}}, title = {{{Dietary micronutrient intake during pregnancy is a function of carbohydrate quality}}}, doi = {{10.3945/ajcn.114.104836}}, year = {{2015}}, } @article{26920, author = {{Günther, Anke L. B. and Schulze, Matthias B. and Kroke, Anja and Diethelm, Katharina and Joslowski, Gesa and Krupp, Danika and Wudy, Stefan and Buyken, Anette}}, issn = {{0163-5581}}, journal = {{Nutrition and Cancer}}, pages = {{877--892}}, title = {{{Early Diet and Later Cancer Risk: Prospective Associations of Dietary Patterns During Critical Periods of Childhood with the GH-IGF Axis, Insulin Resistance and Body Fatness in Younger Adulthood}}}, doi = {{10.1080/01635581.2015.1056313}}, year = {{2015}}, } @article{26921, abstract = {{AbstractThe growth hormone (GH) insulin-like growth factor (IGF) axis has been linked to insulin metabolism and cancer risk. Experimental evidence indicates that the GH–IGF axis itself can be influenced by dietary flavonoids. As fruit and vegetable (FV) intake is a major source of flavonoid consumption, FV’s beneficial health effects may be explained via flavonoids’ influence on the GH–IGF axis, but observational evidence is currently rare. We used data from Dortmund Nutritional and Anthropometric Longitudinally Designed Study participants to analyse prospective associations between FV, fruit intake and flavonoid intake from FV (FlavFV) with IGF-1 and its binding proteins IGFBP-2 and IGFBP-3. Subjects needed to provide a fasting blood sample in adulthood (18–39 years) and at least two 3-d weighed dietary records in early life (0·5−2 years,n191), mid-childhood (3−7 years,n265) or adolescence (girls: 9−15 years, boys: 10−16 years,n261). Additional analyses were conducted among those providing at least three 24-h urine samples in adolescence (n236) to address the predictor urinary hippuric acid (HA), a biomarker of polyphenol intake. Higher fruit intake in mid-childhood and adolescence was related to higher IGFBP-2 in adulthood (P=0·03 andP=0·045). Comparable trends (P=0·045−0·09) were discernable for FV intake (but not FlavFV) in all three time windows. Similarly, higher adolescent HA excretion tended to be related (P=0·06) to higher adult IGFBP-2 levels. Regarding IGFBP-3, a marginal (P=0·08) positive association was observed with FlavFV in mid-childhood only. None of the investigated dietary factors was related to IGF-1. In conclusion, higher fruit and FV intakes during growth may be relevant for adult IGFBP-2, but probably not for IGFBP-3 or IGF-1.}}, author = {{Krupp, Danika and Remer, Thomas and Penczynski, Katharina J. and Bolzenius, Katja and Wudy, Stefan A. and Buyken, Anette}}, issn = {{0007-1145}}, journal = {{British Journal of Nutrition}}, pages = {{527--537}}, title = {{{Relevance of fruits, vegetables and flavonoids from fruits and vegetables during early life, mid-childhood and adolescence for levels of insulin-like growth factor (IGF-1) and its binding proteins IGFBP-2 and IGFBP-3 in young adulthood}}}, doi = {{10.1017/s0007114515004742}}, year = {{2015}}, } @article{26922, author = {{Penczynski, Katharina J. and Krupp, Danika and Bring, Anna and Bolzenius, Katja and Remer, Thomas and Buyken, Anette}}, issn = {{1436-6207}}, journal = {{European Journal of Nutrition}}, pages = {{757--766}}, title = {{{Relative validation of 24-h urinary hippuric acid excretion as a biomarker for dietary flavonoid intake from fruit and vegetables in healthy adolescents}}}, doi = {{10.1007/s00394-015-1121-9}}, year = {{2015}}, } @article{320, abstract = {{We consider structural and algorithmic questions related to the Nash dynamics of weighted congestion games. In weighted congestion games with linear latency functions, the existence of pure Nash equilibria is guaranteed by a potential function argument. Unfortunately, this proof of existence is inefficient and computing pure Nash equilibria in such games is a PLS-hard problem even when all players have unit weights. The situation gets worse when superlinear (e.g., quadratic) latency functions come into play; in this case, the Nash dynamics of the game may contain cycles and pure Nash equilibria may not even exist. Given these obstacles, we consider approximate pure Nash equilibria as alternative solution concepts. A ρ--approximate pure Nash equilibrium is a state of a (weighted congestion) game from which no player has any incentive to deviate in order to improve her cost by a multiplicative factor higher than ρ. Do such equilibria exist for small values of ρ? And if so, can we compute them efficiently?We provide positive answers to both questions for weighted congestion games with polynomial latency functions by exploiting an “approximation” of such games by a new class of potential games that we call Ψ-games. This allows us to show that these games have d!-approximate pure Nash equilibria, where d is the maximum degree of the latency functions. Our main technical contribution is an efficient algorithm for computing O(1)-approximate pure Nash equilibria when d is a constant. For games with linear latency functions, the approximation guarantee is 3+√5/2 + Oγ for arbitrarily small γ > 0; for latency functions with maximum degree d≥ 2, it is d2d+o(d). The running time is polynomial in the number of bits in the representation of the game and 1/γ. As a byproduct of our techniques, we also show the following interesting structural statement for weighted congestion games with polynomial latency functions of maximum degree d ≥ 2: polynomially-long sequences of best-response moves from any initial state to a dO(d2)-approximate pure Nash equilibrium exist and can be efficiently identified in such games as long as d is a constant.To the best of our knowledge, these are the first positive algorithmic results for approximate pure Nash equilibria in weighted congestion games. Our techniques significantly extend our recent work on unweighted congestion games through the use of Ψ-games. The concept of approximating nonpotential games by potential ones is interesting in itself and might have further applications.}}, author = {{Caragiannis, Ioannis and Fanelli, Angelo and Gravin, Nick and Skopalik, Alexander}}, journal = {{Transactions on Economics and Computation}}, number = {{1}}, publisher = {{ACM}}, title = {{{Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure}}}, doi = {{10.1145/2614687}}, volume = {{3}}, year = {{2015}}, } @misc{321, author = {{Eidens, Fabian}}, publisher = {{Universität Paderborn}}, title = {{{Anonymous credential system based on q-Strong Diffie-Hellman Assumption}}}, year = {{2015}}, } @inproceedings{322, abstract = {{Reputation systems are used to compute and publish reputation scores for services or products. We consider reputation systems where users are allowed to rate products that they purchased previously. To obtain trustworthy reputations, they are allowed to rate these products only once. As long as users rate products once, they stay anonymous. Everybody is able to detect users deviating from the rate-products-only-once policy and the anonymity of such dishonest users can be revoked by a system manager. In this paper we present formal models for such reputation systems and their security. Based on group signatures presented by Boneh, Boyen, and Shacham we design an efficient reputation system that meets all our requirements.}}, author = {{Blömer, Johannes and Juhnke, Jakob and Kolb, Christina}}, booktitle = {{Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)}}, pages = {{478----488}}, title = {{{Anonymous and Publicly Linkable Reputation Systems}}}, doi = {{10.1007/978-3-662-47854-7_29}}, year = {{2015}}, } @article{323, abstract = {{On-the-fly composition of service-based software solutions is still a challenging task. Even more challenges emerge when facing automatic service composition in markets of composed services for end users. In this paper, we focus on the functional discrepancy between “what a user wants” specified in terms of a request and “what a user gets” when executing a composed service. To meet the challenge of functional discrepancy, we propose the combination of existing symbolic composition approaches with machine learning techniques. We developed a learning recommendation system that expands the capabilities of existing composition algorithms to facilitate adaptivity and consequently reduces functional discrepancy. As a representative of symbolic techniques, an Artificial Intelligence planning based approach produces solutions that are correct with respect to formal specifications. Our learning recommendation system supports the symbolic approach in decision-making. Reinforcement Learning techniques enable the recommendation system to adjust its recommendation strategy over time based on user ratings. We implemented the proposed functionality in terms of a prototypical composition framework. Preliminary results from experiments conducted in the image processing domain illustrate the benefit of combining both complementary techniques.}}, author = {{Jungmann, Alexander and Mohr, Felix}}, journal = {{Journal of Internet Services and Applications}}, number = {{1}}, pages = {{1--18}}, publisher = {{Springer}}, title = {{{An approach towards adaptive service composition in markets of composed services}}}, doi = {{10.1186/s13174-015-0022-8}}, year = {{2015}}, } @inproceedings{324, abstract = {{Services are self-contained software components that can beused platform independent and that aim at maximizing software reuse. Abasic concern in service oriented architectures is to measure the reusabilityof services. One of the most important qualities is the functionalreusability, which indicates how relevant the task is that a service solves.Current metrics for functional reusability of software, however, have verylittle explanatory power and do not accomplish this goal.This paper presents a new approach to estimate the functional reusabilityof services based on their relevance. To this end, it denes the degreeto which a service enables the execution of other services as its contri-bution. Based on the contribution, relevance of services is dened as anestimation for their functional reusability. Explanatory power is obtainedby normalizing relevance values with a reference service. The applicationof the metric to a service test set conrms its supposed capabilities.}}, author = {{Mohr, Felix}}, booktitle = {{Proceedings of the 14th International Conference on Software Reuse (ICSR)}}, pages = {{298----313}}, title = {{{A Metric for Functional Reusability of Services}}}, doi = {{10.1007/978-3-319-14130-5_21}}, year = {{2015}}, } @misc{325, author = {{Löken, Nils}}, publisher = {{Universität Paderborn}}, title = {{{A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption}}}, year = {{2015}}, } @misc{326, author = {{Heihoff, Frederic}}, publisher = {{Universität Paderborn}}, title = {{{A group signature scheme based on the LSRW assumption}}}, year = {{2015}}, } @article{327, abstract = {{We consider the problem of resource discovery in distributed systems. In particular we give an algorithm, such that each node in a network discovers the address of any other node in the network. We model the knowledge of the nodes as a virtual overlay network given by a directed graph such that complete knowledge of all nodes corresponds to a complete graph in the overlay network. Although there are several solutions for resource discovery, our solution is the first that achieves worst-case optimal work for each node, i.e. the number of addresses (O(n)O(n)) or bits (O(nlog⁡n)O(nlog⁡n)) a node receives or sends coincides with the lower bound, while ensuring only a linear runtime (O(n)O(n)) on the number of rounds.}}, author = {{Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}}, journal = {{Theoretical Computer Science}}, pages = {{67--79}}, publisher = {{Elsevier}}, title = {{{A deterministic worst-case message complexity optimal solution for resource discovery}}}, doi = {{10.1016/j.tcs.2014.11.027}}, year = {{2015}}, } @inproceedings{3284, author = {{Beverungen, Daniel and Klör, Benjamin and Bräuer, Sebastian and Monhof, Markus }}, booktitle = {{Proceedings of the Twenty-Third European Conference on Information Systems (ECIS 2015)}}, location = {{Münster}}, title = {{{Will They Die Another Day? A Decision Support Perspective on Reusing Electric Vehicle Batteries}}}, year = {{2015}}, } @inproceedings{3285, author = {{Klör, Benjamin and Beverungen, Daniel and Bräuer, Sebastian and Plenter, Florian and Monhof, Markus}}, booktitle = {{Proceedings of the Twenty-Third European Conference on Information Systems (ECIS 2015)}}, location = {{Münster}}, title = {{{A Market for Trading Used Electric Vehicle Batteries — Theoretical Foundations and Information Systems}}}, year = {{2015}}, } @article{3295, author = {{Gries, Thomas and Palnau, Irene}}, journal = {{Peace Economics, Peace Science and Public Policy}}, number = {{ 4}}, pages = {{467 --478}}, title = {{{Sustaining Civil Peace: a configurational comparative analysis}}}, doi = {{10.1515/peps-2015-0020}}, volume = {{21}}, year = {{2015}}, } @article{3296, author = {{Gries, Thomas and Meierrieks, Daniel and Redlin, Margarete}}, journal = {{Oxford Economic Papers}}, number = {{1}}, pages = {{83 -- 103}}, title = {{{Oppressive Governments, Dependence on the United States and Anti-American Terrorism}}}, doi = {{10.1093/oep/gpu038}}, volume = {{67}}, year = {{2015}}, } @misc{3309, author = {{Fanasch, Patrizia}}, publisher = {{Universität Paderborn}}, title = {{{Erfolg durch Persönlichkeit? Der Einfluss der Markenpersönlichkeit auf den Zusammenhang von Reputation und Unternehmenserfolg}}}, year = {{2015}}, } @misc{3310, author = {{Walczok, Gregor Paul}}, publisher = {{Universität Paderborn}}, title = {{{Die Veränderung des Mobilfunkmarktes durch die Discountanbieter}}}, year = {{2015}}, } @article{3343, abstract = {{In this paper we consider an extended variant of query learning where the hidden concept is embedded in some Boolean circuit. This additional processing layer modifies query arguments and answers by fixed transformation functions which are known to the learner. For this scenario, we provide a characterization of the solution space and an ordering on it. We give a compact representation of the minimal and maximal solutions as quantified Boolean formulas and we adapt the original algorithms for exact learning of specific classes of propositional formulas.}}, author = {{Bubeck, Uwe and Kleine Büning, Hans}}, issn = {{0004-3702}}, journal = {{Artificial Intelligence}}, keywords = {{Query learning, Propositional logic}}, pages = {{246 -- 257}}, publisher = {{Elsevier}}, title = {{{Learning Boolean Specifications}}}, doi = {{10.1016/j.artint.2015.09.003}}, year = {{2015}}, }