TY - JOUR
AU - Witte, M.
AU - Gerstmann, Uwe
AU - Neuba, Adam
AU - Henkel, G.
AU - Schmidt, Wolf Gero
ID - 13487
JF - Journal of Computational Chemistry
SN - 0192-8651
TI - Density functional theory of the CuA-like Cu2S2 diamond core in Cu 2II(NGuaS)2Cl2
VL - 37
ER -
TY - CONF
AU - Hagengruber, Ruth
ID - 13540
T2 - Materials of the Inter-University Scientific Conference with International Participation
TI - The Long-Lasting Tradition of Women Philosophers as an Insight into the History of Ideas
ER -
TY - JOUR
AU - Probst, Heike
AU - Zentgraf, Thomas
ID - 1458
IS - 2
JF - Physik in unserer Zeit
SN - 0031-9252
TI - Designermaterialien für nichtlineare Optik
VL - 47
ER -
TY - JOUR
AU - Xiao, Shiyi
AU - Mühlenbernd, Holger
AU - Li, Guixin
AU - Kenney, Mitchell
AU - Liu, Fu
AU - Zentgraf, Thomas
AU - Zhang, Shuang
AU - Li, Jensen
ID - 1460
IS - 5
JF - Advanced Optical Materials
SN - 2195-1071
TI - Helicity-Preserving Omnidirectional Plasmonic Mirror
VL - 4
ER -
TY - JOUR
AB - Following the direction pioneered by Fiat and Papadimitriou in their 2010 paper [12], we study the complexity of deciding the existence of mixed equilibria for minimization games where players use valuations other than expectation to evaluate their costs. We consider risk-averse players seeking to minimize the sum V=E+R of expectationE and a risk valuationR of their costs; R is non-negative and vanishes exactly when the cost incurred to a player is constant over all choices of strategies by the other players. In a V-equilibrium, no player could unilaterally reduce her cost.Say that V has the Weak-Equilibrium-for-Expectation property if all strategies supported in a player's best-response mixed strategy incur the same conditional expectation of her cost. We introduce E-strict concavity and observe that every E-strictly concave valuation has the Weak-Equilibrium-for-Expectation property. We focus on a broad class of valuations shown to have the Weak-Equilibrium-for-Expectation property, which we exploit to prove two main complexity results, the first of their kind, for the two simplest cases of the problem:• Two strategies: Deciding the existence of a V-equilibrium is strongly NP-hard for the restricted class of player-specific scheduling games on two ordered links [22], when choosing R as (1)Var (variance), or (2)SD (standard deviation), or (3) a concave linear sum of even moments of small order.• Two players: Deciding the existence of a V-equilibrium is strongly NP-hard when choosing R as (1)γ⋅Var, or (2)γ⋅SD, where γ>0 is the risk-coefficient, or choosing V as (3) a convex combination of E+γ⋅Var and the concave ν-valuationν−1(E(ν(⋅))), where ν(x)=xr, with r≥2. This is a concrete consequence of a general strong NP-hardness result that only needs the Weak-Equilibrium-for-Expectation property and a few additional properties for V; its proof involves a reduction with a single parameter, which can be chosen efficiently so that each valuation satisfies the additional properties.
AU - Monien, Burkhard
AU - Mavronicolas, Marios
ID - 144
JF - Theoretical Computer Science
TI - The complexity of equilibria for risk-modeling valuations
VL - 634
ER -
TY - CHAP
AB - Many modern compute nodes are heterogeneous multi-cores that integrate several CPU cores with fixed function or reconfigurable hardware cores. Such systems need to adapt task scheduling and mapping to optimise for performance and energy under varying workloads and, increasingly important, for thermal and fault management and are thus relevant targets for self-aware computing. In this chapter, we take up the generic reference architecture for designing self-aware and self-expressive computing systems and refine it for heterogeneous multi-cores. We present ReconOS, an architecture, programming model and execution environment for heterogeneous multi-cores, and show how the components of the reference architecture can be implemented on top of ReconOS. In particular, the unique feature of dynamic partial reconfiguration supports self-expression through starting and terminating reconfigurable hardware cores. We detail a case study that runs two applications on an architecture with one CPU and 12 reconfigurable hardware cores and present self-expression strategies for adapting under performance, temperature and even conflicting constraints. The case study demonstrates that the reference architecture as a model for self-aware computing is highly useful as it allows us to structure and simplify the design process, which will be essential for designing complex future compute nodes. Furthermore, ReconOS is used as a base technology for flexible protocol stacks in Chapter 10, an approach for self-aware computing at the networking level.
AU - Agne, Andreas
AU - Happe, Markus
AU - Lösch, Achim
AU - Plessl, Christian
AU - Platzner, Marco
ID - 156
T2 - Self-aware Computing Systems
TI - Self-aware Compute Nodes
ER -
TY - CONF
AB - In this paper we consider a strategic variant of the online facility location problem. Given is a graph in which each node serves two roles: it is a strategic client stating requests as well as a potential location for a facility. In each time step one client states a request which induces private costs equal to the distance to the closest facility. Before serving, the clients may collectively decide to open new facilities, sharing the corresponding price. Instead of optimizing the global costs, each client acts selfishly. The prices of new facilities vary between nodes and also change over time, but are always bounded by some fixed value α. Both the requests as well as the facility prices are given by an online sequence and are not known in advance.We characterize the optimal strategies of the clients and analyze their overall performance in comparison to a centralized offline solution. If all players optimize their own competitiveness, the global performance of the system is O(√α⋅α) times worse than the offline optimum. A restriction to a natural subclass of strategies improves this result to O(α). We also show that for fixed facility costs, we can find strategies such that this bound further improves to O(√α).
AU - Drees, Maximilian
AU - Feldkord, Björn
AU - Skopalik, Alexander
ID - 149
T2 - Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)
TI - Strategic Online Facility Location
ER -
TY - CONF
AU - Couso, Ines
AU - Ahmadi Fahandar, Mohsen
AU - Hüllermeier, Eyke
ED - Busa-Fekete, R.
ED - Hüllermeier, Eyke
ED - Mousseau, V.
ED - Pfannschmidt, Karlson
ID - 15402
T2 - in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany
TI - Statistical Inference for Incomplete Ranking Data: A Comparison of two likelihood-based estimators
ER -
TY - GEN
AU - Berhörster, Jan
ID - 151
TI - Software-gestützte Entwicklung von Geschäftsmodellideen: Theoretische Grundlagen und prototypische Implementierung
ER -
TY - CONF
AU - Pfannschmidt, Karlson
AU - Hüllermeier, Eyke
AU - Held, S.
AU - Neiger, R.
ID - 15111
T2 - In Proceedings IPMU 16th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven, The Netherlands
TI - Evaluating tests in medical diagnosis-Combining machine learning with game-theoretical concepts
ER -