TY - JOUR
AU - Shaker, A.
AU - Hüllermeier, Eyke
ID - 16067
JF - Neurocomputing
TI - Recovery analysis for adaptive learning from non-stationary data streams: Experimental design and case study
VL - 150
ER -
TY - CONF
AU - Weiß Borkowski, Nathalie
AU - Marten, Thorsten
AU - Block, Holger
AU - Tröster, Thomas
ID - 16132
TI - Multi-axial Material Testing at High Strain Rates in High Speed Cupping Tests
ER -
TY - CONF
AU - Jager, Tibor
AU - Schwenk, Jörg
AU - Somorovsky, Juraj
ID - 15898
SN - 9781450338325
T2 - Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security - CCS '15
TI - On the Security of TLS 1.3 and QUIC Against Weaknesses in PKCS#1 v1.5 Encryption
ER -
TY - GEN
ED - Dagiene, Valentina
ED - Schulte, Carsten
ED - Jevsikova, Tatjana
ID - 15658
TI - Proceedings of the 2015 ACM Conference on Innovation and Technology in Computer Science Education, ITiCS 2015, Vilnius, Lithuania, July 4-8, 2015
ER -
TY - JOUR
AU - Zheng, Guoxing
AU - Mühlenbernd, Holger
AU - Kenney, Mitchell
AU - Li, Guixin
AU - Zentgraf, Thomas
AU - Zhang, Shuang
ID - 1700
IS - 4
JF - Nature Nanotechnology
SN - 1748-3387
TI - Metasurface holograms reaching 80% efficiency
VL - 10
ER -
TY - JOUR
AB - In this article an efficient numerical method to solve multiobjective optimization problems for fluid flow governed by the Navier Stokes equations is presented. In order to decrease the computational effort, a reduced order model is introduced using Proper Orthogonal Decomposition and a corresponding Galerkin Projection. A global, derivative free multiobjective optimization algorithm is applied to compute the Pareto set (i.e. the set of optimal compromises) for the concurrent objectives minimization of flow field fluctuations and control cost. The method is illustrated for a 2D flow around a cylinder at Re = 100.
AU - Peitz, Sebastian
AU - Dellnitz, Michael
ID - 1774
IS - 1
JF - PAMM
SN - 1617-7061
TI - Multiobjective Optimization of the Flow Around a Cylinder Using Model Order Reduction
VL - 15
ER -
TY - CHAP
AU - Krimphove, Dieter
ED - Fritz, Roland
ED - Herzberg, Anja
ED - Kühnberger, Manfred
ID - 2044
T2 - Festschrift für Jürgen Keßler
TI - Kann der internationale, europäische und nationale Gesetzgeber angemessen auf Banken- und Kapitalmarktrisiken reagieren?,
ER -
TY - JOUR
AU - Zeuner, Franziska
AU - Muldarisnur, Mulda
AU - Hildebrandt, Andre
AU - Förstner, Jens
AU - Zentgraf, Thomas
ID - 1697
IS - 6
JF - Nano Letters
KW - tet_topic_plasmonics
SN - 1530-6984
TI - Coupling Mediated Coherent Control of Localized Surface Plasmon Polaritons
VL - 15
ER -
TY - CONF
AU - Derakhshandeh, Zahra
AU - Gmyr, Robert
AU - W. Richa, Andrea
AU - Scheideler, Christian
AU - Strothmann, Thim Frederik
ID - 1851
SN - 978-1-4503-3674-1
T2 - Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM' 15, Boston, MA, USA, September 21-22, 2015
TI - An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems
ER -
TY - JOUR
AB - We revisit the simple class of weighted congestion games on parallel links [10], where each player has a non-negative weight and her cost on the link she chooses is the sum of the weights of all players choosing the link. We extend this class to mix-weighted congestion games on parallel links, where weights may as well be negative. For the resulting simple class, we study the complexity of deciding the existence of a pure equilibrium, where no player could unilaterally improve her cost by switching to another link.We show that even for a singlenegative weight, this decision problem is strongly NP-complete when the number of links is part of the input; the problem is NP-complete already for two links. When the number of links is a fixed constant, we show, through a pseudopolynomial, dynamic programming algorithm, that the problem is not strongly NP-complete unless P = NP; the algorithm works for any number of negative weights.
AU - Monien, Burkhard
AU - Mavronicolas, Marios
ID - 244
IS - 12
JF - Information Processing Letters
TI - The complexity of pure equilibria in mix-weighted congestion games on parallel links
VL - 115
ER -
TY - GEN
AB - We analyze the stability of networks when two intermediaries strategically form costly links to customers. We interpret these links as customer relationships that enable trade to sell a product. Equilibrium prices and equilibrium quantities on the output as well as on the input market are determined endogenously for a given network of customer relationships. We investigate in how far the substitutability of the intermediaries' products and the costs of link formation influence the intermediaries' equilibrium profits and thus have an impact on the incentives to strategically form relationships to customers. For networks with three customers we characterize locally stable networks, in particular existence is guaranteed for any degree of substitutability. Moreover for the special cases of perfect complements, independent products and perfect substitutes, local stability coincides with the stronger concept of Nash stability. Additionally, for networks with n customers we analyze stability regions for selected networks and determine their limits when n goes to infinity. It turns out that the shape of the stability regions for those networks does not significantly change compared to a setting with a small number of customers.
AU - Brangewitz, Sonja
AU - Haake, Claus-Jochen
AU - Möhlmeier, Philipp
ID - 249
TI - Strategic Formation of Customer Relationship Networks
VL - 91
ER -
TY - GEN
AU - Pfannschmidt, Karlson
ID - 251
TI - Solving the aggregated bandits problem
ER -
TY - CONF
AB - We investigate a non-cooperative game-theoretic model for the formation of communication networks by selfish agents. Each agent aims for a central position at minimum cost for creating edges. In particular, the general model (Fabrikant et al., PODC'03) became popular for studying the structure of the Internet or social networks. Despite its significance, locality in this game was first studied only recently (Bilò et al., SPAA'14), where a worst case locality model was presented, which came with a high efficiency loss in terms of quality of equilibria. Our main contribution is a new and more optimistic view on locality: agents are limited in their knowledge and actions to their local view ranges, but can probe different strategies and finally choose the best. We study the influence of our locality notion on the hardness of computing best responses, convergence to equilibria, and quality of equilibria. Moreover, we compare the strength of local versus non-local strategy changes. Our results address the gap between the original model and the worst case locality variant. On the bright side, our efficiency results are in line with observations from the original model, yet we have a non-constant lower bound on the Price of Anarchy.
AU - Cord-Landwehr, Andreas
AU - Lenzner, Pascal
ID - 275
T2 - Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)
TI - Network Creation Games: Think Global - Act Local
ER -
TY - JOUR
AU - Gries, Thomas
AU - Feng, Yuanhua
AU - Guo, Zhichao
ID - 2816
IS - 2
JF - China Agricultural Economic Review
TI - Changes of China’s agri-food exports to Germany caused by its accession to WTO and the 2008 financial crisis
VL - 7
ER -
TY - GEN
AU - Kirsch, Michelle
ID - 282
TI - Koordinierter Patentschutz in einer globalisierten Welt - Effizienz- und Anreizwirkungen auf die Arzneimittelversorgung in Entwicklungsländern
ER -
TY - CONF
AB - The size of modern data centers is constantly increasing. As it is not economic to interconnect all machines in the data center using a full-bisection-bandwidth network, techniques have to be developed to increase the efficiency of data-center networks. The Software-Defined Network paradigm opened the door for centralized traffic engineering (TE) in such environments. Up to now, there were already a number of TE proposals for SDN-controlled data centers that all work very well. However, these techniques either use a high amount of flow table entries or a high flow installation rate that overwhelms available switching hardware, or they require custom or very expensive end-of-line equipment to be usable in practice. We present HybridTE, a TE technique that uses (uncertain) information about large flows. Using this extra information, our technique has very low hardware requirements while maintaining better performance than existing TE techniques. This enables us to build very low-cost, high performance data-center networks.
AU - Wette, Philip
AU - Karl, Holger
ID - 287
T2 - Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)
TI - HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks
ER -
TY - GEN
AU - Materna, GinaJoanna
ID - 294
TI - Fair Trade - Eine neue Perspektive in der internationalen Handelspolitik
ER -
TY - GEN
AU - Zindler, Finn
ID - 256
TI - Selektive Vertriebssysteme am Fallbeispiel der Adidas AG - eine wettbewerbspolitische Beurteilung
ER -
TY - JOUR
AB - In the last two decades, water consumption in Germany has been decreasing, which causes the water tanks and pipes in water distribution systems to work inefficiently. This paper proposes a method that supports the planning process for tanks in water distribution systems. The method uses a combination of network reduction, mathematical optimization and hydraulic simulation. The mathematical optimization model is a non-convex Mixed Integer Quadratically Constrained Program (MIQCP) that is solved by a piecewise linearization. As this may lead to many binary variables and therefore high computing times, the size of the water distribution system model is reduced before building the optimization model. After applying several network reduction techniques and using a piecewise approximation of the original model, there may be some hydraulic differences between the original network model and the reduced network model. To make sure that the solution obtained in the optimization process is feasible in the original water distribution system model, the solution is verified by a hydraulic simulation. If the solution is not feasible, the reduced model has to be modified and solved again until the hydraulic simulation verifies a solution as feasible. In this paper, each of these processes is described and the results indicate the usefulness of each of them.
AU - Hallmann, Corinna
AU - Suhl, Leena
ID - 263
JF - OR Spectrum
TI - Optimizing Water Tanks in Water Distribution Systems by combining Network Reduction, Mathematical Optimization and Hydraulic Simulation
ER -
TY - CONF
AU - Bergsma, Florian
AU - Jager, Tibor
AU - Schwenk, Jörg
ID - 3124
T2 - Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings
TI - One-Round Key Exchange with Strong Security: An Efficient and Generic Construction in the Standard Model
ER -