@article{1821,
  abstract     = {We review recent progress towards a rigorous understanding of the Bogoliubov approximation for bosonic quantum many-body systems. We focus, in particular, on the excitation spectrum of a Bose gas in the mean-field (Hartree) limit. A list of open problems will be discussed at the end.},
  author       = {Seiringer, Robert},
  journal      = {Journal of Mathematical Physics},
  number       = {7},
  publisher    = {AIP Publishing},
  title        = {{Bose gases, Bose-Einstein condensation, and the Bogoliubov approximation}},
  doi          = {10.1063/1.4881536},
  volume       = {55},
  year         = {2014},
}

@article{1822,
  author       = {Jakšić, Vojkan and Pillet, Claude and Seiringer, Robert},
  journal      = {Journal of Mathematical Physics},
  number       = {7},
  publisher    = {AIP Publishing},
  title        = {{Introduction}},
  doi          = {10.1063/1.4884877},
  volume       = {55},
  year         = {2014},
}

@article{1896,
  abstract     = {Biopolymer length regulation is a complex process that involves a large number of biological, chemical, and physical subprocesses acting simultaneously across multiple spatial and temporal scales. An illustrative example important for genomic stability is the length regulation of telomeres - nucleoprotein structures at the ends of linear chromosomes consisting of tandemly repeated DNA sequences and a specialized set of proteins. Maintenance of telomeres is often facilitated by the enzyme telomerase but, particularly in telomerase-free systems, the maintenance of chromosomal termini depends on alternative lengthening of telomeres (ALT) mechanisms mediated by recombination. Various linear and circular DNA structures were identified to participate in ALT, however, dynamics of the whole process is still poorly understood. We propose a chemical kinetics model of ALT with kinetic rates systematically derived from the biophysics of DNA diffusion and looping. The reaction system is reduced to a coagulation-fragmentation system by quasi-steady-state approximation. The detailed treatment of kinetic rates yields explicit formulas for expected size distributions of telomeres that demonstrate the key role played by the J factor, a quantitative measure of bending of polymers. The results are in agreement with experimental data and point out interesting phenomena: an appearance of very long telomeric circles if the total telomere density exceeds a critical value (excess mass) and a nonlinear response of the telomere size distributions to the amount of telomeric DNA in the system. The results can be of general importance for understanding dynamics of telomeres in telomerase-independent systems as this mode of telomere maintenance is similar to the situation in tumor cells lacking telomerase activity. Furthermore, due to its universality, the model may also serve as a prototype of an interaction between linear and circular DNA structures in various settings.},
  author       = {Kollár, Richard and Bod'ová, Katarína and Nosek, Jozef and Tomáška, Ľubomír},
  journal      = {Physical Review E},
  number       = {3},
  publisher    = {American Physical Society},
  title        = {{Mathematical model of alternative mechanism of telomere length maintenance}},
  doi          = {10.1103/PhysRevE.89.032701},
  volume       = {89},
  year         = {2014},
}

@article{2226,
  abstract     = {Coriolis force effects on shear flows are important in geophysical and astrophysical contexts. We report a study on the linear stability and the transient energy growth of the plane Couette flow with system rotation perpendicular to the shear direction. External rotation causes linear instability. At small rotation rates, the onset of linear instability scales inversely with the rotation rate and the optimal transient growth in the linearly stable region is slightly enhanced ∼Re2. The corresponding optimal initial perturbations are characterized by roll structures inclined in the streamwise direction and are twisted under external rotation. At large rotation rates, the transient growth is significantly inhibited and hence linear stability analysis is a reliable indicator for instability.},
  author       = {Shi, Liang and Hof, Björn and Tilgner, Andreas},
  issn         = {1539-3755},
  journal      = {Physical Review E},
  number       = {1},
  publisher    = {American Physical Society},
  title        = {{Transient growth of Ekman-Couette flow}},
  doi          = {10.1103/PhysRevE.89.013001},
  volume       = {89},
  year         = {2014},
}

@article{2183,
  abstract     = {We describe a simple adaptive network of coupled chaotic maps. The network reaches a stationary state (frozen topology) for all values of the coupling parameter, although the dynamics of the maps at the nodes of the network can be nontrivial. The structure of the network shows interesting hierarchical properties and in certain parameter regions the dynamics is polysynchronous: Nodes can be divided in differently synchronized classes but, contrary to cluster synchronization, nodes in the same class need not be connected to each other. These complicated synchrony patterns have been conjectured to play roles in systems biology and circuits. The adaptive system we study describes ways whereby this behavior can evolve from undifferentiated nodes.},
  author       = {Botella Soler, Vicente and Glendinning, Paul},
  journal      = {Physical Review E},
  number       = {6},
  publisher    = {American Physical Society},
  title        = {{Hierarchy and polysynchrony in an adaptive network }},
  doi          = {10.1103/PhysRevE.89.062809},
  volume       = {89},
  year         = {2014},
}

@article{1999,
  abstract     = {Selection for disease control is believed to have contributed to shape the organisation of insect societies — leading to interaction patterns that mitigate disease transmission risk within colonies, conferring them ‘organisational immunity’. Recent studies combining epidemiological models with social network analysis have identified general properties of interaction networks that may hinder propagation of infection within groups. These can be prophylactic and/or induced upon pathogen exposure. Here we review empirical evidence for these two types of organisational immunity in social insects and describe the individual-level behaviours that underlie it. We highlight areas requiring further investigation, and emphasise the need for tighter links between theory and empirical research and between individual-level and collective-level analyses.},
  author       = {Stroeymeyt, Nathalie and Casillas Perez, Barbara E and Cremer, Sylvia},
  journal      = {Current Opinion in Insect Science},
  number       = {1},
  pages        = {1 -- 15},
  publisher    = {Elsevier},
  title        = {{Organisational immunity in social insects}},
  doi          = {10.1016/j.cois.2014.09.001},
  volume       = {5},
  year         = {2014},
}

@article{10895,
  abstract     = {Due to their sessile lifestyles, plants need to deal with the limitations and stresses imposed by the changing environment. Plants cope with these by a remarkable developmental flexibility, which is embedded in their strategy to survive. Plants can adjust their size, shape and number of organs, bend according to gravity and light, and regenerate tissues that were damaged, utilizing a coordinating, intercellular signal, the plant hormone, auxin. Another versatile signal is the cation, Ca2+, which is a crucial second messenger for many rapid cellular processes during responses to a wide range of endogenous and environmental signals, such as hormones, light, drought stress and others. Auxin is a good candidate for one of these Ca2+-activating signals. However, the role of auxin-induced Ca2+ signaling is poorly understood. Here, we will provide an overview of possible developmental and physiological roles, as well as mechanisms underlying the interconnection of Ca2+ and auxin signaling. },
  author       = {Vanneste, Steffen and Friml, Jiří},
  issn         = {2223-7747},
  journal      = {Plants},
  keywords     = {Plant Science, Ecology, Ecology, Evolution, Behavior and Systematics},
  number       = {4},
  pages        = {650--675},
  publisher    = {MDPI},
  title        = {{Calcium: The missing link in auxin action}},
  doi          = {10.3390/plants2040650},
  volume       = {2},
  year         = {2013},
}

@inproceedings{10897,
  abstract     = {Taking images is an efficient way to collect data about the physical world. It can be done fast and in exquisite detail. By definition, image processing is the field that concerns itself with the computation aimed at harnessing the information contained in images [10]. This talk is concerned with topological information. Our main thesis is that persistent homology [5] is a useful method to quantify and summarize topological information, building a bridge that connects algebraic topology with applications. We provide supporting evidence for this thesis by touching upon four technical developments in the overlap between persistent homology and image processing.},
  author       = {Edelsbrunner, Herbert},
  booktitle    = {Graph-Based Representations in Pattern Recognition},
  isbn         = {9783642382208},
  issn         = {1611-3349},
  location     = {Vienna, Austria},
  pages        = {182--183},
  publisher    = {Springer Nature},
  title        = {{Persistent homology in image processing}},
  doi          = {10.1007/978-3-642-38221-5_19},
  volume       = {7877},
  year         = {2013},
}

@inproceedings{10898,
  abstract     = {A prominent remedy to multicore scalability issues in concurrent data structure implementations is to relax the sequential specification of the data structure. We present distributed queues (DQ), a new family of relaxed concurrent queue implementations. DQs implement relaxed queues with linearizable emptiness check and either configurable or bounded out-of-order behavior or pool behavior. Our experiments show that DQs outperform and outscale in micro- and macrobenchmarks all strict and relaxed queue as well as pool implementations that we considered.},
  author       = {Haas, Andreas and Lippautz, Michael and Henzinger, Thomas A and Payer, Hannes and Sokolova, Ana and Kirsch, Christoph M. and Sezgin, Ali},
  booktitle    = {Proceedings of the ACM International Conference on Computing Frontiers - CF '13},
  isbn         = {978-145032053-5},
  location     = {Ischia, Italy},
  number       = {5},
  publisher    = {ACM},
  title        = {{Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation}},
  doi          = {10.1145/2482767.2482789},
  year         = {2013},
}

@inbook{10899,
  author       = {Barton, Nicholas H},
  booktitle    = {Encyclopedia of Biodiversity},
  isbn         = {978-0-12-384720-1},
  keywords     = {Adaptive landscape, Cline, Coalescent process, Gene flow, Hybrid zone, Local adaptation, Natural selection, Neutral theory, Population structure, Speciation},
  pages        = {508--515},
  publisher    = {Elsevier},
  title        = {{Differentiation}},
  doi          = {10.1016/b978-0-12-384719-5.00031-9},
  year         = {2013},
}

@inbook{10900,
  abstract     = {Leukocyte migration through the interstitial space is crucial for the maintenance of tolerance and immunity. The main cues for leukocyte trafficking are chemokines thought to directionally guide these cells towards their targets. However, model systems that facilitate quantification of chemokine-guided leukocyte migration in vivo are uncommon. Here we describe an ex vivo crawl-in assay using explanted mouse ears that allows the visualization of chemokine-dependent dendritic cell (DC) motility in the dermal interstitium in real time. We present methods for the preparation of mouse ear sheets and their use in multidimensional confocal imaging experiments to monitor and analyze the directional migration of fluorescently labelled DCs through the dermis and into afferent lymphatic vessels. The assay provides a more physiological approach to study leukocyte migration than in vitro three-dimensional (3D) or 2-dimensional (2D) migration assays such as collagen gels and transwell assays.},
  author       = {Weber, Michele and Sixt, Michael K},
  booktitle    = {Chemokines},
  editor       = {Cardona, Astrid and Ubogu, Eroboghene},
  isbn         = {9781627034258},
  issn         = {1940-6029},
  pages        = {215--226},
  publisher    = {Humana Press},
  title        = {{Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse Ear Preparations}},
  doi          = {10.1007/978-1-62703-426-5_14},
  volume       = {1013},
  year         = {2013},
}

@inproceedings{10902,
  abstract     = {We consider how to edit strings from a source language so that the edited strings belong to a target language, where the languages are given as deterministic finite automata. Non-streaming (or offline) transducers perform edits given the whole source string. We show that the class of deterministic one-pass transducers with registers along with increment and min operation suffices for computing optimal edit distance, whereas the same class of transducers without the min operation is not sufficient. Streaming (or online) transducers perform edits as the letters of the source string are received. We present a polynomial time algorithm for the partial-repair problem that given a bound α asks for the construction of a deterministic streaming transducer (if one exists) that ensures that the ‘maximum fraction’ η of the strings of the source language are edited, within cost α, to the target language.},
  author       = {Chatterjee, Krishnendu and Chaubal, Siddhesh and Rubin, Sasha},
  booktitle    = {7th International Conference on Language and Automata Theory and Applications},
  isbn         = {9783642370632},
  issn         = {1611-3349},
  location     = {Bilbao, Spain},
  pages        = {214--225},
  publisher    = {Springer Nature},
  title        = {{How to travel between languages}},
  doi          = {10.1007/978-3-642-37064-9_20},
  volume       = {7810},
  year         = {2013},
}

@inproceedings{2209,
  abstract     = {A straight skeleton is a well-known geometric structure, and several algorithms exist to construct the straight skeleton for a given polygon or planar straight-line graph. In this paper, we ask the reverse question: Given the straight skeleton (in form of a planar straight-line graph, with some rays to infinity), can we reconstruct a planar straight-line graph for which this was the straight skeleton? We show how to reduce this problem to the problem of finding a line that intersects a set of convex polygons. We can find these convex polygons and all such lines in $O(nlog n)$ time in the Real RAM computer model, where $n$ denotes the number of edges of the input graph. We also explain how our approach can be used for recognizing Voronoi diagrams of points, thereby completing a partial solution provided by Ash and Bolker in 1985.
},
  author       = {Biedl, Therese and Held, Martin and Huber, Stefan},
  location     = {St. Petersburg, Russia},
  pages        = {37 -- 46},
  publisher    = {IEEE},
  title        = {{Recognizing straight skeletons and Voronoi diagrams and reconstructing their input}},
  doi          = {10.1109/ISVD.2013.11},
  year         = {2013},
}

@inproceedings{2210,
  abstract     = {A straight skeleton is a well-known geometric structure, and several algorithms exist to construct the straight skeleton for a given polygon. In this paper, we ask the reverse question: Given the straight skeleton (in form of a tree with a drawing in the plane, but with the exact position of the leaves unspecified), can we reconstruct the polygon? We show that in most cases there exists at most one polygon; in the remaining case there is an infinite number of polygons determined by one angle that can range in an interval. We can find this (set of) polygon(s) in linear time in the Real RAM computer model.},
  author       = {Biedl, Therese and Held, Martin and Huber, Stefan},
  booktitle    = {29th European Workshop on Computational Geometry},
  location     = {Braunschweig, Germany},
  pages        = {95 -- 98},
  publisher    = {TU Braunschweig},
  title        = {{Reconstructing polygons from embedded straight skeletons}},
  year         = {2013},
}

@inproceedings{2238,
  abstract     = {We study the problem of achieving a given value in Markov decision processes (MDPs) with several independent discounted reward objectives. We consider a generalised version of discounted reward objectives, in which the amount of discounting depends on the states visited and on the objective. This definition extends the usual definition of discounted reward, and allows to capture the systems in which the value of different commodities diminish at different and variable rates.

We establish results for two prominent subclasses of the problem, namely state-discount models where the discount factors are only dependent on the state of the MDP (and independent of the objective), and reward-discount models where they are only dependent on the objective (but not on the state of the MDP). For the state-discount models we use a straightforward reduction to expected total reward and show that the problem whether a value is achievable can be solved in polynomial time. For the reward-discount model we show that memory and randomisation of the strategies are required, but nevertheless that the problem is decidable and it is sufficient to consider strategies which after a certain number of steps behave in a memoryless way.

For the general case, we show that when restricted to graphs (i.e. MDPs with no randomisation), pure strategies and discount factors of the form 1/n where n is an integer, the problem is in PSPACE and finite memory suffices for achieving a given value. We also show that when the discount factors are not of the form 1/n, the memory required by a strategy can be infinite.
},
  author       = {Chatterjee, Krishnendu and Forejt, Vojtěch and Wojtczak, Dominik},
  location     = {Stellenbosch, South Africa},
  pages        = {228 -- 242},
  publisher    = {Springer},
  title        = {{Multi-objective discounted reward verification in graphs and MDPs}},
  doi          = {10.1007/978-3-642-45221-5_17},
  volume       = {8312},
  year         = {2013},
}

@inproceedings{2243,
  abstract     = {We show that modal logic over universally first-order definable classes of transitive frames is decidable. More precisely, let K be an arbitrary class of transitive Kripke frames definable by a universal first-order sentence. We show that the global and finite global satisfiability problems of modal logic over K are decidable in NP, regardless of choice of K. We also show that the local satisfiability and the finite local satisfiability problems of modal logic over K are decidable in NEXPTIME.},
  author       = {Michaliszyn, Jakub and Otop, Jan},
  location     = {Torino, Italy},
  pages        = {563 -- 577},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Elementary modal logics over transitive structures}},
  doi          = {10.4230/LIPIcs.CSL.2013.563},
  volume       = {23},
  year         = {2013},
}

@inproceedings{2244,
  abstract     = {We consider two systems (α1,...,αm) and (β1,...,βn) of curves drawn on a compact two-dimensional surface ℳ with boundary. Each αi and each βj is either an arc meeting the boundary of ℳ at its two endpoints, or a closed curve. The αi are pairwise disjoint except for possibly sharing endpoints, and similarly for the βj. We want to "untangle" the βj from the αi by a self-homeomorphism of ℳ; more precisely, we seek an homeomorphism φ: ℳ → ℳ fixing the boundary of ℳ pointwise such that the total number of crossings of the αi with the φ(βj) is as small as possible. This problem is motivated by an application in the algorithmic theory of embeddings and 3-manifolds. We prove that if ℳ is planar, i.e., a sphere with h ≥ 0 boundary components ("holes"), then O(mn) crossings can be achieved (independently of h), which is asymptotically tight, as an easy lower bound shows. In general, for an arbitrary (orientable or nonorientable) surface ℳ with h holes and of (orientable or nonorientable) genus g ≥ 0, we obtain an O((m + n)4) upper bound, again independent of h and g. },
  author       = {Matoušek, Jiří and Sedgwick, Eric and Tancer, Martin and Wagner, Uli},
  location     = {Bordeaux, France},
  pages        = {472 -- 483},
  publisher    = {Springer},
  title        = {{Untangling two systems of noncrossing curves}},
  doi          = {10.1007/978-3-319-03841-4_41},
  volume       = {8242},
  year         = {2013},
}

@inproceedings{2258,
  abstract     = {In a digital signature scheme with message recovery, rather than transmitting the message m and its signature σ, a single enhanced signature τ is transmitted. The verifier is able to recover m from τ and at the same time verify its authenticity. The two most important parameters of such a scheme are its security and overhead |τ| − |m|. A simple argument shows that for any scheme with “n bits security” |τ| − |m| ≥ n, i.e., the overhead is lower bounded by the security parameter n. Currently, the best known constructions in the random oracle model are far from this lower bound requiring an overhead of n + logq h , where q h is the number of queries to the random oracle. In this paper we give a construction which basically matches the n bit lower bound. We propose a simple digital signature scheme with n + o(logq h ) bits overhead, where q h denotes the number of random oracle queries.

Our construction works in two steps. First, we propose a signature scheme with message recovery having optimal overhead in a new ideal model, the random invertible function model. Second, we show that a four-round Feistel network with random oracles as round functions is tightly “public-indifferentiable” from a random invertible function. At the core of our indifferentiability proof is an almost tight upper bound for the expected number of edges of the densest “small” subgraph of a random Cayley graph, which may be of independent interest.
},
  author       = {Kiltz, Eike and Pietrzak, Krzysztof Z and Szegedy, Mario},
  location     = {Santa Barbara, CA, United States},
  pages        = {571 -- 588},
  publisher    = {Springer},
  title        = {{Digital signatures with minimal overhead from indifferentiable random invertible functions}},
  doi          = {10.1007/978-3-642-40041-4_31},
  volume       = {8042},
  year         = {2013},
}

@inproceedings{2259,
  abstract     = {The learning with rounding (LWR) problem, introduced by Banerjee, Peikert and Rosen at EUROCRYPT ’12, is a variant of learning with errors (LWE), where one replaces random errors with deterministic rounding. The LWR problem was shown to be as hard as LWE for a setting of parameters where the modulus and modulus-to-error ratio are super-polynomial. In this work we resolve the main open problem and give a new reduction that works for a larger range of parameters, allowing for a polynomial modulus and modulus-to-error ratio. In particular, a smaller modulus gives us greater efficiency, and a smaller modulus-to-error ratio gives us greater security, which now follows from the worst-case hardness of GapSVP with polynomial (rather than super-polynomial) approximation factors.

As a tool in the reduction, we show that there is a “lossy mode” for the LWR problem, in which LWR samples only reveal partial information about the secret. This property gives us several interesting new applications, including a proof that LWR remains secure with weakly random secrets of sufficient min-entropy, and very simple constructions of deterministic encryption, lossy trapdoor functions and reusable extractors.

Our approach is inspired by a technique of Goldwasser et al. from ICS ’10, which implicitly showed the existence of a “lossy mode” for LWE. By refining this technique, we also improve on the parameters of that work to only requiring a polynomial (instead of super-polynomial) modulus and modulus-to-error ratio.
},
  author       = {Alwen, Joel F and Krenn, Stephan and Pietrzak, Krzysztof Z and Wichs, Daniel},
  location     = {Santa Barbara, CA, United States},
  number       = {1},
  pages        = {57 -- 74},
  publisher    = {Springer},
  title        = {{Learning with rounding, revisited: New reduction properties and applications}},
  doi          = {10.1007/978-3-642-40041-4_4},
  volume       = {8042},
  year         = {2013},
}

@inproceedings{2260,
  abstract     = {Direct Anonymous Attestation (DAA) is one of the most complex cryptographic protocols deployed in practice. It allows an embedded secure processor known as a Trusted Platform Module (TPM) to attest to the configuration of its host computer without violating the owner’s privacy. DAA has been standardized by the Trusted Computing Group and ISO/IEC.

The security of the DAA standard and all existing schemes is analyzed in the random-oracle model. We provide the first constructions of DAA in the standard model, that is, without relying on random oracles. Our constructions use new building blocks, including the first efficient signatures of knowledge in the standard model, which have many applications beyond DAA.
},
  author       = {Bernhard, David and Fuchsbauer, Georg and Ghadafi, Essam},
  location     = {Banff, AB, Canada},
  pages        = {518 -- 533},
  publisher    = {Springer},
  title        = {{Efficient signatures of knowledge and DAA in the standard model}},
  doi          = {10.1007/978-3-642-38980-1_33},
  volume       = {7954},
  year         = {2013},
}