@book{60246, author = {{Lippegaus, Petra and Voigt, Birgit}}, publisher = {{Institut für berufliche Bildung, Arbeitsmarkt- und Sozialpolitik GmbH}}, title = {{{Potenziale erkennen und fördern. Qualität entwickeln. Band 2: Anregungen zur Gestaltung der Potenzialanalyse}}}, year = {{2012}}, } @article{62788, abstract = {{AbstractWe present a novel approach for the simulation of solid to solid phase‐transformations in polycrystalline materials. To facilitate the utilization of a non‐affine micro‐sphere formulation with volumetric‐deviatoric split, we introduce Helmholtz free energy functions depending on volumetric and deviatoric strain measures for the underlying scalar‐valued phase‐transformation model. As an extension of affine micro‐sphere models [5], the non‐affine micro‐sphere formulation with volumetric‐deviatoric split allows to capture different Young's moduli and Poisson's ratios on the macro‐scale [1]. As a consequence, the temperature‐dependent free energy assigned to each individual phase takes the form of an elliptic paraboloid in volumetric‐deviatoric strain space, where the energy landscape of the overall material is obtained from the contributions of the individual constituents. For the evolution of volume fractions, we use an approach based on statistical physics–taking into account actual Gibbs energy barriers and transformation probabilities [2]. The computation of individual energy barriers between the phases considered is enabled by numerical minimization of parametric intersection curves of elliptic Gibbs energy paraboloids. (© 2012 Wiley‐VCH Verlag GmbH & Co. KGaA, Weinheim)}}, author = {{Ostwald, Richard and Bartel, Thorsten and Menzel, Andreas}}, issn = {{1617-7061}}, journal = {{PAMM}}, number = {{1}}, pages = {{277--278}}, publisher = {{Wiley}}, title = {{{Simulation of phase‐transformations based on numerical minimization of intersecting Gibbs energy potentials}}}, doi = {{10.1002/pamm.201210129}}, volume = {{12}}, year = {{2012}}, } @article{62808, abstract = {{Conventional alkaline solutions used for capacitive performance of electrodeposited cobalt hydroxides have a number of disadvantages as they are corrosive, environmentally unfriendly and provide a small working potential range. In this study, the capacitive properties of electrodeposited cobalt hydroxide/oxide were investigated in 1 M Na2SO4 solution with pH 5.5 by means of cyclic voltammetry, galvanostatic charging/discharging experiments and electrochemical impedance spectroscopy. The capacitance of the cobalt hydroxide/oxide was demonstrated to have high values of 141 F g−1 at scan rate 8 mV s−1 in this 1 M Na2SO4 solution. The anodic potential range is extended by 0.8–1.3 V vs. Ag/AgCl. A good cyclic stability and reversibility were observed.}}, author = {{Fedorov, Fedor S. and Linnemann, Julia and Tschulik, Kristina and Giebeler, Lars and Uhlemann, Margitta and Gebert, Annett}}, issn = {{0013-4686}}, journal = {{Electrochimica Acta}}, keywords = {{electrodeposition, cobalt hydroxide, supercapacitors}}, pages = {{166--170}}, publisher = {{Elsevier BV}}, title = {{{Capacitance performance of cobalt hydroxide-based capacitors with utilization of near-neutral electrolytes}}}, doi = {{10.1016/j.electacta.2012.11.123}}, volume = {{90}}, year = {{2012}}, } @article{13546, author = {{Riefer, A. and Rauls, E. and Schmidt, Wolf Gero and Eberhard, J. and Stoll, I. and Mattay, J.}}, issn = {{1098-0121}}, journal = {{Physical Review B}}, number = {{16}}, title = {{{2-Aminopyrimidine-silver(I) based organic semiconductors: Electronic structure and optical response}}}, doi = {{10.1103/physrevb.85.165202}}, volume = {{85}}, year = {{2012}}, } @article{13548, author = {{Thissen, Peter and Thissen, Vera and Wippermann, Stefan and Chabal, Yves J. and Grundmeier, Guido and Schmidt, Wolf Gero}}, issn = {{0039-6028}}, journal = {{Surface Science}}, pages = {{902--907}}, title = {{{pH-dependent structure and energetics of H2O/MgO(100)}}}, doi = {{10.1016/j.susc.2012.01.018}}, volume = {{606}}, year = {{2012}}, } @inproceedings{63083, author = {{Fechner, Sabine and van Vorst, Helena}}, booktitle = {{Ebook of the ESERA 2011 conference. Science learning and citizenship (S. 135–141)}}, editor = {{Bruguiére, C. and Tiberghien , A. and Clément , P.}}, title = {{{Characteristics of real life contexts and their influence on student interest in learning chemistry}}}, year = {{2012}}, } @article{13820, author = {{Schmidt, Wolf Gero and Wippermann, S. and Sanna, S. and Babilon, M. and Vollmers, N. J. and Gerstmann, Uwe}}, issn = {{0370-1972}}, journal = {{physica status solidi (b)}}, number = {{2}}, pages = {{343--359}}, title = {{{In-Si(111)(4 × 1)/(8 × 2) nanowires: Electron transport, entropy, and metal-insulator transition}}}, doi = {{10.1002/pssb.201100457}}, volume = {{249}}, year = {{2012}}, } @inbook{64901, author = {{Greb, Lutz and Paradies, Jan}}, booktitle = {{Topics in Current Chemistry}}, isbn = {{9783642377587}}, issn = {{0340-1022}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Paracyclophane Derivatives in Frustrated Lewis Pair Chemistry}}}, doi = {{10.1007/128_2012_375}}, year = {{2012}}, } @article{2512, abstract = {{In this paper we introduce the concept of an overall power function that is meant to combine two sources of a party’s power in a parliament. The first source is based on the possibilities for the party to be part of a majority coalition and it is typically modeled using a cooperative simple game. The second source takes into account parties’ asymmetries outside the cooperative game and it is displayed by a vector of exogenously given weights. We adopt a normative point of view and provide an axiomatic characterization of a specific overall power function, in which the weights enter in a proportional fashion.}}, author = {{Dimitrov, Dinko and Haake, Claus-Jochen}}, issn = {{1742-7355}}, journal = {{International Journal of Economic Theory}}, number = {{2}}, pages = {{189--200}}, publisher = {{Wiley-Blackwell}}, title = {{{Proportionality and the power of unequal parties}}}, doi = {{10.1111/j.1742-7363.2011.00158.x}}, volume = {{7}}, year = {{2011}}, } @inproceedings{3185, author = {{Ruhroth, Thomas and Wehrheim, Heike and Ziegert, Steffen}}, booktitle = {{37th {EUROMICRO} Conference on Software Engineering and Advanced Applications, {SEAA} 2011, Oulu, Finland, August 30 - September 2, 2011}}, pages = {{83----90}}, title = {{{ReL: {A} Generic Refactoring Language for Specification and Execution}}}, doi = {{10.1109/SEAA.2011.22}}, year = {{2011}}, } @article{27011, abstract = {{There are no published data regarding the overall dietary glycaemic index (GI) and glycaemic load (GL) of Australian children and adolescents. We therefore aim to describe the dietary GI and GL of participants of the 2007 Australian National Children's Nutrition and Physical Activity Survey (2007ANCNPAS), and to identify the main foods contributing to their GL. Children, aged 2–16 years, who provided two 24 h recalls in the 2007ANCNPAS were included. A final dataset of 4184 participants was analysed. GI of each food item was assigned using a previously published method. GL was calculated, and food groups contributing to the GL were described by age group and sex. The weighted mean dietary GI and GL of the participants were 54 (sd 5) and 136 (sd 44), respectively. Among the nutrients examined, Ca had the highest inverse relationship with GI (P < 0·001), while percentage energy from starch was most positively associated with GI. The association between fibre density and GI was modest, and percentage energy from sugar had an inverse relationship with GI. Daily dietary GL contributed by energy-dense and/or nutrient-poor (EDNP) items in subjects aged 14–16 years was more than doubled that of subjects aged 2–3 years. To conclude, Australian children and adolescents were having a high-GI dietary pattern characterised by high-starchy food intake and low Ca intake. A significant proportion of their dietary GL was from EDNP foods. Efforts to reduce dietary GI and GL in children and adolescents should focus on energy-dense starchy foods.}}, author = {{Chun Yu Louie, Jimmy and Buyken, Anette and Heyer, Kristina and Flood, Victoria M.}}, issn = {{0007-1145}}, journal = {{British Journal of Nutrition}}, pages = {{1273--1282}}, title = {{{Dietary glycaemic index and glycaemic load among Australian children and adolescents}}}, doi = {{10.1017/s0007114511001577}}, year = {{2011}}, } @article{27728, abstract = {{ Context: Whether prepubertal glucocorticoid status impacts on the timing of puberty is not clear. Objective: The objective of the study was to examine the relationship between prepubertal glucocorticoid status and early or late pubertal markers, independent of adrenarchal and nutritional status. Design and Participants: Prospective cohort study of healthy Caucasian children (n = 111, 56 boys) who provided both 24-h urine samples and weighed dietary records 1 and 2 yr before the start of pubertal growth spurt [age at take-off (ATO)]. Measurements: Major urinary glucocorticoid and androgen metabolites determined by gas chromatography-mass spectrometry analysis were summed to assess daily overall cortisol (ΣC21) and adrenal androgen secretion; urinary free cortisol and cortisone measured by RIA were summed (UFF+UFE) as an indicator of potentially bioactive free glucocorticoids. Main Outcomes: The main outcomes included ATO, age at peak height velocity, age at menarche/voice break, ages at Tanner stage 2 for breast (girls) and genital (boys) development, and pubic hair. Results: In girls ΣC21, but not UFF+UFE, was associated with pubertal markers after adjusting for overall adrenal androgen, urinary nitrogen, and body fat. Girls with higher ΣC21 (fourth quartile) reached ATO 0.7 yr (P = 0.01) and menarche 0.9 yr later (P = 0.006) than girls with lower ΣC21 (first quartile). The ΣC21 tended to be also positively associated with age at Tanner stage 2 for breast (P = 0.1), Tanner stage 2 for pubic hair (P = 0.1), and age at peak height velocity (P = 0.06). In boys, neither the ΣC21 nor UFF+UFE was related to pubertal timing. Conclusion: An individually higher prepubertal glucocorticoid secretion level, even in physiological range, appears to delay early and late pubertal timing of healthy girls, particularly their onset of pubertal growth spurt and menarche. }}, author = {{Shi, Lijie and Wudy, Stefan A. and Buyken, Anette and Maser-Gluth, Christiane and Hartmann, Michaela F. and Remer, Thomas}}, issn = {{0021-972X}}, journal = {{The Journal of Clinical Endocrinology & Metabolism}}, pages = {{E891--E898}}, title = {{{Prepubertal Glucocorticoid Status and Pubertal Timing}}}, doi = {{10.1210/jc.2010-2935}}, year = {{2011}}, } @article{27744, abstract = {{The aim of the present study was to examine the association of pre-pubertal dietary energy density (ED) with both age and body fatness at the start of the pubertal growth spurt (age at take-off, ATO). Analyses included 219 DOrtmund Nutritional and Anthropometric Longitudinally Designed Study participants with sufficient height measurements to estimate ATO who provided 3 d weighed dietary records at baseline, i.e. 2 and 3 years before ATO (mean age 6·9 (sd 1·2) years). Mean energy intakes and amounts of foods/drinks consumed at baseline were derived from the records. ED (kJ/g) was calculated based on (1) all foods and drinks (ED_all), (2) foods and energy-containing drinks (ED_energy), (3) foods and milk as a drink, but no other beverages (ED_milk) and (4) foods only, solid or liquid (ED_food). Using multiple regression analyses, the association between the ED variables and ATO was investigated. Furthermore, Z-scores of BMI and fat mass index (FMI) at ATO were considered as outcomes to reflect body fatness at puberty onset. The results showed that ED at baseline was not associated with ATO, regardless of the ED method used. For example, mean ATO in the lowest v. highest tertile of ED_food was 9·3 (95 % CI 9·0, 9·5) v. 9·4 (95 % CI 9·1, 9·7) years, Ptrend = 0·8 (adjusted for sex, maternal age, birth weight, dietary protein, dietary fibre, baseline BMI Z-score). Similarly, ED was not independently associated with BMI or FMI Z-score at ATO (Ptrend = 0·3–0·9). In conclusion, dietary ED in childhood did not influence timing or body fatness at ATO in this cohort of healthy, free-living children.}}, author = {{Günther, Anke L. B. and Stahl, Lisa J. and Buyken, Anette and Kroke, Anja}}, issn = {{0007-1145}}, journal = {{British Journal of Nutrition}}, pages = {{345--349}}, title = {{{Association of dietary energy density in childhood with age and body fatness at the onset of the pubertal growth spurt}}}, doi = {{10.1017/s0007114511001772}}, year = {{2011}}, } @article{27764, author = {{Buyken, Anette and Mitchell, P. and Ceriello, A. and Brand-Miller, J.}}, issn = {{0012-186X}}, journal = {{Diabetologia}}, pages = {{2471--2472}}, title = {{{Prevention strategies for type 2 diabetes should be based on evidence-based medical nutrition data. Reply to Uusitupa M, Lindström J, Tuomilehto J [letter]}}}, doi = {{10.1007/s00125-011-2230-5}}, year = {{2011}}, } @article{20947, abstract = {{Alkylphosphonic acids of different alkyl chain lengths were adsorbed on electrochemically polished NiTi surfaces from ethanolic solutions. The electropolishing process led to passive films mainly composed of Ti-oxyhydroxide. The surface showed nanoscopic etching pits with a depths of about 2 nm and a diameter of about 20 nm. The interfacial binding mechanism of the phosphonic acid group to the oxyhydroxide surface and the ordering of the monolayer were spectroscopically analysed by means of infrared reflection absorption FTIR-spectroscopy with (PM-IRRAS) and without (IRRAS) photoelastic modulation. The comparison of IRRAS and PM-IRRAS data of the long chain octadecylphosphonic acid monolayer proved that the binding mechanism of the phosphonic acid group to the oxyhydroxide surface is based on a mono-or bidentate bond, which is not stable in the presence of high water activities. An alkyl chain length of 17 CH2 groups is required for the formation of self-assembled monolayers, which are stable in aqueous environments. These long chain aliphatic organophosphonic acid monolayers were shown to inhibit anodic and cathodic surface reactions. (C) 2010 Elsevier B.V. All rights reserved.}}, author = {{Maxisch, M. and Ebbert, Christoph and Torun, B. and Fink, N. and de los Arcos, T. and Lackmann, J. and Maier, H. J. and Grundmeier, Guido}}, issn = {{1873-5584}}, journal = {{APPLIED SURFACE SCIENCE}}, number = {{6}}, pages = {{2011--2018}}, title = {{{PM-IRRAS studies of the adsorption and stability of organophosphonate monolayers on passivated NiTi surfaces}}}, doi = {{10.1016/j.apsusc.2010.09.044}}, volume = {{257}}, year = {{2011}}, } @inproceedings{1891, author = {{W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}}, booktitle = {{2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011}}, isbn = {{978-0-7695-4364-2}}, pages = {{507----516}}, publisher = {{IEEE Computer Society}}, title = {{{Competitive and Fair Medium Access Despite Reactive Jamming}}}, doi = {{10.1109/ICDCS.2011.8}}, year = {{2011}}, } @inproceedings{1893, author = {{W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}}, booktitle = {{Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011}}, isbn = {{978-1-4503-0722-2}}, pages = {{15}}, publisher = {{ACM}}, title = {{{Self-stabilizing leader election for single-hop wireless networks despite jamming}}}, doi = {{10.1145/2107502.2107522}}, year = {{2011}}, } @article{23739, abstract = {{This paper deals with the design of efficiently computable incentive-compatible mechanisms for combinatorial optimization problems with single-minded agents each possibly having multiple private parameters. We focus on approximation algorithms for NP-hard mechanism design problems. These algorithms need to satisfy certain monotonicity properties to ensure truthfulness. Since most of the known approximation techniques do not fulfill these properties, we study alternative techniques. Our first contribution is a quite general method to transform a pseudopolynomial algorithm into a monotone fully polynomial time approximation scheme (FPTAS). This can be applied to various problems like, e.g., knapsack, constrained shortest path, or job scheduling with deadlines. For example, the monotone FPTAS for the knapsack problem gives a very efficient, truthful mechanism for single-minded multiunit auctions. The best previous result for such auctions was a 2-appro-xi-ma-tion. In addition, we present a monotone PTAS for the generalized assignment problem with any constant number of private parameters per agent. The most efficient way to solve packing integer programs (PIPs) is linear programming–based randomized rounding, which also is in general not monotone. We show that primal-dual greedy algorithms achieve almost the same approximation ratios for PIPs as randomized rounding. The advantage is that these algorithms are inherently monotone. This way, we can significantly improve the approximation ratios of truthful mechanisms for various fundamental mechanism design problems like single-minded combinatorial auctions (CAs), unsplittable flow routing, and multicast routing. Our primal-dual approximation algorithms can also be used for the winner determination in CAs with general bidders specifying their bids through an oracle. }}, author = {{Briest, Patrick and Krysta, Piotr and Vöcking, Berthold}}, issn = {{0097-5397}}, journal = {{SIAM Journal on Computing}}, pages = {{1587--1622}}, title = {{{Approximation Techniques for Utilitarian Mechanism Design}}}, doi = {{10.1137/090772988}}, year = {{2011}}, } @article{23740, abstract = {{We investigate nonparametric multiproduct pricing problems, in which we want to find revenue maximizing prices for products $\mathcal{P}$ based on a set of customer samples $\mathcal{C}$. We mostly focus on the unit-demand case, in which products constitute strict substitutes and each customer aims to purchase a single product. In this setting a customer sample consists of a number of nonzero values for different products and possibly an additional product ranking. Once prices are fixed, each customer chooses to buy one of the products she can afford based on some predefined selection rule. We distinguish between the min-buying, max-buying, and rank-buying models. Some of our results also extend to single-minded pricing, in which case products are strict complements and every customer seeks to buy a single set of products, which she purchases if the sum of prices is below her valuation for that set. For the min-buying model we show that the revenue maximization problem is not approximable within factor $\mathcal{O}(\log^{\varepsilon}|\mathcal{C}|)$ for some constant $\varepsilon>0$, unless $\mathrm{NP}\subseteq\mathrm{DTIME}(n^{\mathcal{O}(\log\log n)})$, thereby almost closing the gap between the known algorithmic results and previous lower bounds. We also prove inapproximability within $\mathcal{O}(\ell^{\varepsilon})$, $\ell$ being an upper bound on the number of nonzero values per customer, and $\mathcal{O}(|\mathcal{P}|^{\varepsilon})$ under slightly stronger assumptions and provide matching upper bounds. Surprisingly, these hardness results hold even if a price ladder constraint, i.e., a predefined order on the prices of all products, is given. Without the price ladder constraint we obtain similar hardness results for the special case of uniform valuations, i.e., the case that every customer has identical values for all the products she is interested in, assuming specific hardness of the balanced bipartite independent set problem in constant degree graphs or hardness of refuting random 3CNF formulas. Introducing a slightly more general problem definition in which customers are given as an explicit probability distribution, we obtain inapproximability within $\mathcal{O}(|\mathcal{P}|^{\varepsilon})$ assuming $\mathrm{NP}\nsubseteq\bigcap_{\delta>0}\mathrm{BPTIME}(2^{\mathcal{O}(n^{\delta})})$. These results apply to single-minded pricing as well. For the max-buying model a polynomial-time approximation scheme exists if a price ladder is given. We give a matching lower bound by proving strong NP-hardness. Assuming limited product supply, we analyze a generic local search algorithm and prove that it is 2-approximate. Finally, we discuss implications for the rank-buying model. }}, author = {{Briest, Patrick and Krysta, Piotr}}, issn = {{0097-5397}}, journal = {{SIAM Journal on Computing}}, pages = {{1554--1586}}, title = {{{Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems}}}, doi = {{10.1137/090752353}}, year = {{2011}}, } @misc{17997, author = {{Setzer, Alexander}}, publisher = {{Universität Paderborn}}, title = {{{Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk}}}, year = {{2011}}, }