@article{1120,
abstract = {The existence of a self-localization transition in the polaron problem has been under an active debate ever since Landau suggested it 83 years ago. Here we reveal the self-localization transition for the rotational analogue of the polaron -- the angulon quasiparticle. We show that, unlike for the polarons, self-localization of angulons occurs at finite impurity-bath coupling already at the mean-field level. The transition is accompanied by the spherical-symmetry breaking of the angulon ground state and a discontinuity in the first derivative of the ground-state energy. Moreover, the type of the symmetry breaking is dictated by the symmetry of the microscopic impurity-bath interaction, which leads to a number of distinct self-localized states. The predicted effects can potentially be addressed in experiments on cold molecules trapped in superfluid helium droplets and ultracold quantum gases, as well as on electronic excitations in solids and Bose-Einstein condensates. },
author = {Li, Xiang and Seiringer, Robert and Lemeshko, Mikhail},
issn = {24699926},
journal = {Physical Review A},
number = {3},
publisher = {American Physical Society},
title = {{Angular self-localization of impurities rotating in a bosonic bath}},
doi = {10.1103/PhysRevA.95.033608},
volume = {95},
year = {2017},
}
@article{1132,
abstract = {The hippocampus is thought to initiate systems-wide mnemonic processes through the reactivation of previously acquired spatial and episodic memory traces, which can recruit the entorhinal cortex as a first stage of memory redistribution to other brain areas. Hippocampal reactivation occurs during sharp wave-ripples, in which synchronous network firing encodes sequences of places.We investigated the coordination of this replay by recording assembly activity simultaneously in the CA1 region of the hippocampus and superficial layers of the medial entorhinal cortex. We found that entorhinal cell assemblies can replay trajectories independently of the hippocampus and sharp wave-ripples. This suggests that the hippocampus is not the sole initiator of spatial and episodic memory trace reactivation. Memory systems involved in these processes may include nonhierarchical, parallel components.},
author = {O'Neill, Joseph and Boccara, Charlotte and Stella, Federico and Schönenberger, Philipp and Csicsvari, Jozsef L},
issn = {00368075},
journal = {Science},
number = {6321},
pages = {184 -- 188},
publisher = {American Association for the Advancement of Science},
title = {{Superficial layers of the medial entorhinal cortex replay independently of the hippocampus}},
doi = {10.1126/science.aag2787},
volume = {355},
year = {2017},
}
@article{1133,
abstract = {It is a common knowledge that an effective interaction of a quantum impurity with an electromagnetic field can be screened by surrounding charge carriers, whether mobile or static. Here we demonstrate that very strong, "anomalous" screening can take place in the presence of a neutral, weakly polarizable environment, due to an exchange of orbital angular momentum between the impurity and the bath. Furthermore, we show that it is possible to generalize all phenomena related to isolated impurities in an external field to the case when a many-body environment is present, by casting the problem in terms of the angulon quasiparticle. As a result, the relevant observables such as the effective Rabi frequency, geometric phase, and impurity spatial alignment are straightforward to evaluate in terms of a single parameter: the angular-momentum-dependent screening factor.},
author = {Yakaboylu, Enderalp and Lemeshko, Mikhail},
issn = {00319007},
journal = {Physical Review Letters},
number = {8},
publisher = {American Physical Society},
title = {{Anomalous screening of quantum impurities by a neutral environment}},
doi = {10.1103/PhysRevLett.118.085302},
volume = {118},
year = {2017},
}
@article{1144,
abstract = {We show that matrix elements of functions of N × N Wigner matrices fluctuate on a scale of order N−1/2 and we identify the limiting fluctuation. Our result holds for any function f of the matrix that has bounded variation thus considerably relaxing the regularity requirement imposed in [7, 11].},
author = {Erdös, László and Schröder, Dominik J},
journal = {Electronic Communications in Probability},
publisher = {Institute of Mathematical Statistics},
title = {{Fluctuations of functions of Wigner matrices}},
doi = {10.1214/16-ECP38},
volume = {21},
year = {2017},
}
@article{1152,
abstract = {We propose a new memetic strategy that can solve the multi-physics, complex inverse problems, formulated as the multi-objective optimization ones, in which objectives are misfits between the measured and simulated states of various governing processes. The multi-deme structure of the strategy allows for both, intensive, relatively cheap exploration with a moderate accuracy and more accurate search many regions of Pareto set in parallel. The special type of selection operator prefers the coherent alternative solutions, eliminating artifacts appearing in the particular processes. The additional accuracy increment is obtained by the parallel convex searches applied to the local scalarizations of the misfit vector. The strategy is dedicated for solving ill-conditioned problems, for which inverting the single physical process can lead to the ambiguous results. The skill of the selection in artifact elimination is shown on the benchmark problem, while the whole strategy was applied for identification of oil deposits, where the misfits are related to various frequencies of the magnetic and electric waves of the magnetotelluric measurements. 2016 Elsevier B.V.},
author = {Gajda-Zagorska, Ewa P and Schaefer, Robert and Smołka, Maciej and Pardo, David and Alvarez Aramberri, Julen},
issn = {18777503},
journal = {Journal of Computational Science},
pages = {85 -- 94},
publisher = {Elsevier},
title = {{A multi objective memetic inverse solver reinforced by local optimization methods}},
doi = {10.1016/j.jocs.2016.06.007},
volume = {18},
year = {2017},
}
@phdthesis{1155,
abstract = {This dissertation concerns the automatic verification of probabilistic systems and programs with arrays by statistical and logical methods. Although statistical and logical methods are different in nature, we show that they can be successfully combined for system analysis. In the first part of the dissertation we present a new statistical algorithm for the verification of probabilistic systems with respect to unbounded properties, including linear temporal logic. Our algorithm often performs faster than the previous approaches, and at the same time requires less information about the system. In addition, our method can be generalized to unbounded quantitative properties such as mean-payoff bounds. In the second part, we introduce two techniques for comparing probabilistic systems. Probabilistic systems are typically compared using the notion of equivalence, which requires the systems to have the equal probability of all behaviors. However, this notion is often too strict, since probabilities are typically only empirically estimated, and any imprecision may break the relation between processes. On the one hand, we propose to replace the Boolean notion of equivalence by a quantitative distance of similarity. For this purpose, we introduce a statistical framework for estimating distances between Markov chains based on their simulation runs, and we investigate which distances can be approximated in our framework. On the other hand, we propose to compare systems with respect to a new qualitative logic, which expresses that behaviors occur with probability one or a positive probability. This qualitative analysis is robust with respect to modeling errors and applicable to many domains. In the last part, we present a new quantifier-free logic for integer arrays, which allows us to express counting. Counting properties are prevalent in array-manipulating programs, however they cannot be expressed in the quantified fragments of the theory of arrays. We present a decision procedure for our logic, and provide several complexity results.},
author = {Daca, Przemyslaw},
pages = {163},
publisher = {IST Austria},
title = {{Statistical and logical methods for property checking}},
doi = {10.15479/AT:ISTA:TH_730},
year = {2017},
}
@article{1159,
abstract = {Auxin steers numerous physiological processes in plants, making the tight control of its endogenous levels and spatiotemporal distribution a necessity. This regulation is achieved by different mechanisms, including auxin biosynthesis, metabolic conversions, degradation, and transport. Here, we introduce cis-cinnamic acid (c-CA) as a novel and unique addition to a small group of endogenous molecules affecting in planta auxin concentrations. c-CA is the photo-isomerization product of the phenylpropanoid pathway intermediate trans-CA (t-CA). When grown on c-CA-containing medium, an evolutionary diverse set of plant species were shown to exhibit phenotypes characteristic for high auxin levels, including inhibition of primary root growth, induction of root hairs, and promotion of adventitious and lateral rooting. By molecular docking and receptor binding assays, we showed that c-CA itself is neither an auxin nor an anti-auxin, and auxin profiling data revealed that c-CA does not significantly interfere with auxin biosynthesis. Single cell-based auxin accumulation assays showed that c-CA, and not t-CA, is a potent inhibitor of auxin efflux. Auxin signaling reporters detected changes in spatiotemporal distribution of the auxin response along the root of c-CA-treated plants, and long-distance auxin transport assays showed no inhibition of rootward auxin transport. Overall, these results suggest that the phenotypes of c-CA-treated plants are the consequence of a local change in auxin accumulation, induced by the inhibition of auxin efflux. This work reveals a novel mechanism how plants may regulate auxin levels and adds a novel, naturally occurring molecule to the chemical toolbox for the studies of auxin homeostasis.},
author = {Steenackers, Ward and Klíma, Petr and Quareshy, Mussa and Cesarino, Igor and Kumpf, Robert and Corneillie, Sander and Araújo, Pedro and Viaene, Tom and Goeminne, Geert and Nowack, Moritz and Ljung, Karin and Friml, Jirí and Blakeslee, Joshua and Novák, Ondřej and Zažímalová, Eva and Napier, Richard and Boerjan, Wout and Vanholme, Bartel},
issn = {00320889},
journal = {Plant Physiology},
number = {1},
pages = {552 -- 565},
publisher = {American Society of Plant Biologists},
title = {{Cis-cinnamic acid is a novel natural auxin efflux inhibitor that promotes lateral root formation}},
doi = {10.1104/pp.16.00943},
volume = {173},
year = {2017},
}
@article{1160,
abstract = {We investigate fundamental nonlinear dynamics of ferrofluidic Taylor-Couette flow - flow confined be-tween two concentric independently rotating cylinders - consider small aspect ratio by solving the ferro-hydrodynamical equations, carrying out systematic bifurcation analysis. Without magnetic field, we find steady flow patterns, previously observed with a simple fluid, such as those containing normal one- or two vortex cells, as well as anomalous one-cell and twin-cell flow states. However, when a symmetry-breaking transverse magnetic field is present, all flow states exhibit stimulated, finite two-fold mode. Various bifurcations between steady and unsteady states can occur, corresponding to the transitions between the two-cell and one-cell states. While unsteady, axially oscillating flow states can arise, we also detect the emergence of new unsteady flow states. In particular, we uncover two new states: one contains only the azimuthally oscillating solution in the configuration of the twin-cell flow state, and an-other a rotating flow state. Topologically, these flow states are a limit cycle and a quasiperiodic solution on a two-torus, respectively. Emergence of new flow states in addition to observed ones with classical fluid, indicates that richer but potentially more controllable dynamics in ferrofluidic flows, as such flow states depend on the external magnetic field.},
author = {Altmeyer, Sebastian and Do, Younghae and Lai, Ying},
issn = {20452322},
journal = {Scientific Reports},
publisher = {Nature Publishing Group},
title = {{Dynamics of ferrofluidic flow in the Taylor-Couette system with a small aspect ratio}},
doi = {10.1038/srep40012},
volume = {7},
year = {2017},
}
@article{1162,
abstract = {Selected universal experimental properties of high-temperature superconducting (HTS) cuprates have been singled out in the last decade. One of the pivotal challenges in this field is the designation of a consistent interpretation framework within which we can describe quantitatively the universal features of those systems. Here we analyze in a detailed manner the principal experimental data and compare them quantitatively with the approach based on a single-band model of strongly correlated electrons supplemented with strong antiferromagnetic (super)exchange interaction (the so-called t−J−U model). The model rationale is provided by estimating its microscopic parameters on the basis of the three-band approach for the Cu-O plane. We use our original full Gutzwiller wave-function solution by going beyond the renormalized mean-field theory (RMFT) in a systematic manner. Our approach reproduces very well the observed hole doping (δ) dependence of the kinetic-energy gain in the superconducting phase, one of the principal non-Bardeen-Cooper-Schrieffer features of the cuprates. The calculated Fermi velocity in the nodal direction is practically δ-independent and its universal value agrees very well with that determined experimentally. Also, a weak doping dependence of the Fermi wave vector leads to an almost constant value of the effective mass in a pure superconducting phase which is both observed in experiment and reproduced within our approach. An assessment of the currently used models (t−J, Hubbard) is carried out and the results of the canonical RMFT as a zeroth-order solution are provided for comparison to illustrate the necessity of the introduced higher-order contributions.},
author = {Spałek, Jozef and Zegrodnik, Michał and Kaczmarczyk, Jan},
issn = {24699950},
journal = {Physical Review B - Condensed Matter and Materials Physics},
number = {2},
publisher = {American Physical Society},
title = {{Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment}},
doi = {10.1103/PhysRevB.95.024506},
volume = {95},
year = {2017},
}
@article{1168,
abstract = {Optimum experimental design theory has recently been extended for parameter estimation in copula models. The use of these models allows one to gain in flexibility by considering the model parameter set split into marginal and dependence parameters. However, this separation also leads to the natural issue of estimating only a subset of all model parameters. In this work, we treat this problem with the application of the (Formula presented.)-optimality to copula models. First, we provide an extension of the corresponding equivalence theory. Then, we analyze a wide range of flexible copula models to highlight the usefulness of (Formula presented.)-optimality in many possible scenarios. Finally, we discuss how the usage of the introduced design criterion also relates to the more general issue of copula selection and optimal design for model discrimination.},
author = {Perrone, Elisa and Rappold, Andreas and Müller, Werner},
journal = {Statistical Methods and Applications},
number = {3},
pages = {403 -- 418},
publisher = {Springer},
title = {{D inf s optimality in copula models}},
doi = {10.1007/s10260-016-0375-6},
volume = {26},
year = {2017},
}
@article{1169,
abstract = {Dispersal is a crucial factor in natural evolution, since it determines the habitat experienced by any population and defines the spatial scale of interactions between individuals. There is compelling evidence for systematic differences in dispersal characteristics within the same population, i.e., genotype-dependent dispersal. The consequences of genotype-dependent dispersal on other evolutionary phenomena, however, are poorly understood. In this article we investigate the effect of genotype-dependent dispersal on spatial gene frequency patterns, using a generalization of the classical diffusion model of selection and dispersal. Dispersal is characterized by the variance of dispersal (diffusion coefficient) and the mean displacement (directional advection term). We demonstrate that genotype-dependent dispersal may change the qualitative behavior of Fisher waves, which change from being “pulled” to being “pushed” wave fronts as the discrepancy in dispersal between genotypes increases. The speed of any wave is partitioned into components due to selection, genotype-dependent variance of dispersal, and genotype-dependent mean displacement. We apply our findings to wave fronts maintained by selection against heterozygotes. Furthermore, we identify a benefit of increased variance of dispersal, quantify its effect on the speed of the wave, and discuss the implications for the evolution of dispersal strategies.},
author = {Novak, Sebastian and Kollár, Richard},
issn = {00166731},
journal = {Genetics},
number = {1},
pages = {367 -- 374},
publisher = {Genetics Society of America},
title = {{Spatial gene frequency waves under genotype dependent dispersal}},
doi = {10.1534/genetics.116.193946},
volume = {205},
year = {2017},
}
@article{1173,
abstract = {We introduce the Voronoi functional of a triangulation of a finite set of points in the Euclidean plane and prove that among all geometric triangulations of the point set, the Delaunay triangulation maximizes the functional. This result neither extends to topological triangulations in the plane nor to geometric triangulations in three and higher dimensions.},
author = {Edelsbrunner, Herbert and Glazyrin, Alexey and Musin, Oleg and Nikitenko, Anton},
issn = {02099683},
journal = {Combinatorica},
number = {5},
pages = {887 -- 910},
publisher = {Springer},
title = {{The Voronoi functional is maximized by the Delaunay triangulation in the plane}},
doi = {10.1007/s00493-016-3308-y},
volume = {37},
year = {2017},
}
@inproceedings{1174,
abstract = {Security of cryptographic applications is typically defined by security games. The adversary, within certain resources, cannot win with probability much better than 0 (for unpredictability applications, like one-way functions) or much better than 1/2 (indistinguishability applications for instance encryption schemes). In so called squared-friendly applications the winning probability of the adversary, for different values of the application secret randomness, is not only close to 0 or 1/2 on average, but also concentrated in the sense that its second central moment is small. The class of squared-friendly applications, which contains all unpredictability applications and many indistinguishability applications, is particularly important for key derivation. Barak et al. observed that for square-friendly applications one can beat the "RT-bound", extracting secure keys with significantly smaller entropy loss. In turn Dodis and Yu showed that in squared-friendly applications one can directly use a "weak" key, which has only high entropy, as a secure key. In this paper we give sharp lower bounds on square security assuming security for "weak" keys. We show that any application which is either (a) secure with weak keys or (b) allows for entropy savings for keys derived by universal hashing, must be square-friendly. Quantitatively, our lower bounds match the positive results of Dodis and Yu and Barak et al. (TCC\'13, CRYPTO\'11) Hence, they can be understood as a general characterization of squared-friendly applications. While the positive results on squared-friendly applications where derived by one clever application of the Cauchy-Schwarz Inequality, for tight lower bounds we need more machinery. In our approach we use convex optimization techniques and some theory of circular matrices.},
author = {Skórski, Maciej},
issn = {18688969},
location = {Hannover, Germany},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
title = {{Lower bounds on key derivation for square-friendly applications}},
doi = {10.4230/LIPIcs.STACS.2017.57},
volume = {66},
year = {2017},
}
@inproceedings{1175,
abstract = {We study space complexity and time-space trade-offs with a focus not on peak memory usage but on overall memory consumption throughout the computation. Such a cumulative space measure was introduced for the computational model of parallel black pebbling by [Alwen and Serbinenko ’15] as a tool for obtaining results in cryptography. We consider instead the non- deterministic black-white pebble game and prove optimal cumulative space lower bounds and trade-offs, where in order to minimize pebbling time the space has to remain large during a significant fraction of the pebbling. We also initiate the study of cumulative space in proof complexity, an area where other space complexity measures have been extensively studied during the last 10–15 years. Using and extending the connection between proof complexity and pebble games in [Ben-Sasson and Nordström ’08, ’11] we obtain several strong cumulative space results for (even parallel versions of) the resolution proof system, and outline some possible future directions of study of this, in our opinion, natural and interesting space measure.},
author = {Alwen, Joel F and De Rezende, Susanna and Nordstrom, Jakob and Vinyals, Marc},
editor = {Papadimitriou, Christos},
issn = {18688969},
location = {Berkeley, CA, United States},
pages = {38:1--38--21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
title = {{Cumulative space in black-white pebbling and resolution}},
doi = {10.4230/LIPIcs.ITCS.2017.38},
volume = {67},
year = {2017},
}
@inproceedings{1176,
abstract = {The algorithm Argon2i-B of Biryukov, Dinu and Khovratovich is currently being considered by the IRTF (Internet Research Task Force) as a new de-facto standard for password hashing. An older version (Argon2i-A) of the same algorithm was chosen as the winner of the recent Password Hashing Competition. An important competitor to Argon2i-B is the recently introduced Balloon Hashing (BH) algorithm of Corrigan-Gibs, Boneh and Schechter. A key security desiderata for any such algorithm is that evaluating it (even using a custom device) requires a large amount of memory amortized across multiple instances. Alwen and Blocki (CRYPTO 2016) introduced a class of theoretical attacks against Argon2i-A and BH. While these attacks yield large asymptotic reductions in the amount of memory, it was not, a priori, clear if (1) they can be extended to the newer Argon2i-B, (2) the attacks are effective on any algorithm for practical parameter ranges (e.g., 1GB of memory) and (3) if they can be effectively instantiated against any algorithm under realistic hardware constrains. In this work we answer all three of these questions in the affirmative for all three algorithms. This is also the first work to analyze the security of Argon2i-B. In more detail, we extend the theoretical attacks of Alwen and Blocki (CRYPTO 2016) to the recent Argon2i-B proposal demonstrating severe asymptotic deficiencies in its security. Next we introduce several novel heuristics for improving the attack's concrete memory efficiency even when on-chip memory bandwidth is bounded. We then simulate our attacks on randomly sampled Argon2i-A, Argon2i-B and BH instances and measure the resulting memory consumption for various practical parameter ranges and for a variety of upperbounds on the amount of parallelism available to the attacker. Finally we describe, implement, and test a new heuristic for applying the Alwen-Blocki attack to functions employing a technique developed by Corrigan-Gibs et al. for improving concrete security of memory-hard functions. We analyze the collected data and show the effects various parameters have on the memory consumption of the attack. In particular, we can draw several interesting conclusions about the level of security provided by these functions. · For the Alwen-Blocki attack to fail against practical memory parameters, Argon2i-B must be instantiated with more than 10 passes on memory - beyond the "paranoid" parameter setting in the current IRTF proposal. · The technique of Corrigan-Gibs for improving security can also be overcome by the Alwen-Blocki attack under realistic hardware constraints. · On a positive note, both the asymptotic and concrete security of Argon2i-B seem to improve on that of Argon2i-A.},
author = {Alwen, Joel F and Blocki, Jeremiah},
isbn = {978-150905761-0},
location = {Paris, France},
publisher = {IEEE},
title = {{Towards practical attacks on Argon2i and balloon hashing}},
doi = {10.1109/EuroSP.2017.47},
year = {2017},
}
@article{1180,
abstract = {In this article we define an algebraic vertex of a generalized polyhedron and show that the set of algebraic vertices is the smallest set of points needed to define the polyhedron. We prove that the indicator function of a generalized polytope P is a linear combination of indicator functions of simplices whose vertices are algebraic vertices of P. We also show that the indicator function of any generalized polyhedron is a linear combination, with integer coefficients, of indicator functions of cones with apices at algebraic vertices and line-cones. The concept of an algebraic vertex is closely related to the Fourier–Laplace transform. We show that a point v is an algebraic vertex of a generalized polyhedron P if and only if the tangent cone of P, at v, has non-zero Fourier–Laplace transform.},
author = {Akopyan, Arseniy and Bárány, Imre and Robins, Sinai},
issn = {00018708},
journal = {Advances in Mathematics},
pages = {627 -- 644},
publisher = {Academic Press},
title = {{Algebraic vertices of non-convex polyhedra}},
doi = {10.1016/j.aim.2016.12.026},
volume = {308},
year = {2017},
}
@article{1187,
abstract = {We construct efficient authentication protocols and message authentication codes (MACs) whose security can be reduced to the learning parity with noise (LPN) problem. Despite a large body of work—starting with the (Formula presented.) protocol of Hopper and Blum in 2001—until now it was not even known how to construct an efficient authentication protocol from LPN which is secure against man-in-the-middle attacks. A MAC implies such a (two-round) protocol.},
author = {Kiltz, Eike and Pietrzak, Krzysztof Z and Venturi, Daniele and Cash, David and Jain, Abhishek},
journal = {Journal of Cryptology},
number = {4},
pages = {1238 -- 1275},
publisher = {Springer},
title = {{Efficient authentication from hard learning problems}},
doi = {10.1007/s00145-016-9247-3},
volume = {30},
year = {2017},
}
@article{1191,
abstract = {Variation in genotypes may be responsible for differences in dispersal rates, directional biases, and growth rates of individuals. These traits may favor certain genotypes and enhance their spatiotemporal spreading into areas occupied by the less advantageous genotypes. We study how these factors influence the speed of spreading in the case of two competing genotypes under the assumption that spatial variation of the total population is small compared to the spatial variation of the frequencies of the genotypes in the population. In that case, the dynamics of the frequency of one of the genotypes is approximately described by a generalized Fisher–Kolmogorov–Petrovskii–Piskunov (F–KPP) equation. This generalized F–KPP equation with (nonlinear) frequency-dependent diffusion and advection terms admits traveling wave solutions that characterize the invasion of the dominant genotype. Our existence results generalize the classical theory for traveling waves for the F–KPP with constant coefficients. Moreover, in the particular case of the quadratic (monostable) nonlinear growth–decay rate in the generalized F–KPP we study in detail the influence of the variance in diffusion and mean displacement rates of the two genotypes on the minimal wave propagation speed.},
author = {Kollár, Richard and Novak, Sebastian},
journal = {Bulletin of Mathematical Biology},
number = {3},
pages = {525--559},
publisher = {Springer},
title = {{Existence of traveling waves for the generalized F–KPP equation}},
doi = {10.1007/s11538-016-0244-3},
volume = {79},
year = {2017},
}
@inproceedings{1192,
abstract = {The main result of this paper is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all constraints are even Δ-matroid relations (represented by lists of tuples). As a consequence of this, we settle the complexity classification of planar Boolean CSPs started by Dvorak and Kupec. Knowing that edge CSP is tractable for even Δ-matroid constraints allows us to extend the tractability result to a larger class of Δ-matroids that includes many classes that were known to be tractable before, namely co-independent, compact, local and binary.},
author = {Kazda, Alexandr and Kolmogorov, Vladimir and Rolinek, Michal},
isbn = {978-161197478-2},
location = {Barcelona, Spain},
pages = {307 -- 326},
publisher = {SIAM},
title = {{Even delta-matroids and the complexity of planar Boolean CSPs}},
doi = {10.1137/1.9781611974782.20},
year = {2017},
}
@inproceedings{1194,
abstract = {Termination is one of the basic liveness properties, and we study the termination problem for probabilistic programs with real-valued variables. Previous works focused on the qualitative problem that asks whether an input program terminates with probability~1 (almost-sure termination). A powerful approach for this qualitative problem is the notion of ranking supermartingales with respect to a given set of invariants. The quantitative problem (probabilistic termination) asks for bounds on the termination probability. A fundamental and conceptual drawback of the existing approaches to address probabilistic termination is that even though the supermartingales consider the probabilistic behavior of the programs, the invariants are obtained completely ignoring the probabilistic aspect. In this work we address the probabilistic termination problem for linear-arithmetic probabilistic programs with nondeterminism. We define the notion of {\em stochastic invariants}, which are constraints along with a probability bound that the constraints hold. We introduce a concept of {\em repulsing supermartingales}. First, we show that repulsing supermartingales can be used to obtain bounds on the probability of the stochastic invariants. Second, we show the effectiveness of repulsing supermartingales in the following three ways: (1)~With a combination of ranking and repulsing supermartingales we can compute lower bounds on the probability of termination; (2)~repulsing supermartingales provide witnesses for refutation of almost-sure termination; and (3)~with a combination of ranking and repulsing supermartingales we can establish persistence properties of probabilistic programs. We also present results on related computational problems and an experimental evaluation of our approach on academic examples. },
author = {Chatterjee, Krishnendu and Novotny, Petr and Zikelic, Djordje},
issn = {07308566},
location = {Paris, France},
number = {1},
pages = {145 -- 160},
publisher = {ACM},
title = {{Stochastic invariants for probabilistic termination}},
doi = {10.1145/3009837.3009873},
volume = {52},
year = {2017},
}
@article{1198,
abstract = {We consider a model of fermions interacting via point interactions, defined via a certain weighted Dirichlet form. While for two particles the interaction corresponds to infinite scattering length, the presence of further particles effectively decreases the interaction strength. We show that the model becomes trivial in the thermodynamic limit, in the sense that the free energy density at any given particle density and temperature agrees with the corresponding expression for non-interacting particles.},
author = {Moser, Thomas and Seiringer, Robert},
issn = {03779017},
journal = {Letters in Mathematical Physics},
number = {3},
pages = { 533 -- 552},
publisher = {Springer},
title = {{Triviality of a model of particles with point interactions in the thermodynamic limit}},
doi = {10.1007/s11005-016-0915-x},
volume = {107},
year = {2017},
}
@article{1207,
abstract = {The eigenvalue distribution of the sum of two large Hermitian matrices, when one of them is conjugated by a Haar distributed unitary matrix, is asymptotically given by the free convolution of their spectral distributions. We prove that this convergence also holds locally in the bulk of the spectrum, down to the optimal scales larger than the eigenvalue spacing. The corresponding eigenvectors are fully delocalized. Similar results hold for the sum of two real symmetric matrices, when one is conjugated by Haar orthogonal matrix.},
author = {Bao, Zhigang and Erdös, László and Schnelli, Kevin},
issn = {00103616},
journal = {Communications in Mathematical Physics},
number = {3},
pages = {947 -- 990},
publisher = {Springer},
title = {{Local law of addition of random matrices on optimal scale}},
doi = {10.1007/s00220-016-2805-6},
volume = {349},
year = {2017},
}
@article{1208,
abstract = {We study parameter estimation in linear Gaussian covariance models, which are p-dimensional Gaussian models with linear constraints on the covariance matrix. Maximum likelihood estimation for this class of models leads to a non-convex optimization problem which typically has many local maxima. Using recent results on the asymptotic distribution of extreme eigenvalues of the Wishart distribution, we provide sufficient conditions for any hill climbing method to converge to the global maximum. Although we are primarily interested in the case in which n≫p, the proofs of our results utilize large sample asymptotic theory under the scheme n/p→γ>1. Remarkably, our numerical simulations indicate that our results remain valid for p as small as 2. An important consequence of this analysis is that, for sample sizes n≃14p, maximum likelihood estimation for linear Gaussian covariance models behaves as if it were a convex optimization problem. © 2016 The Royal Statistical Society and Blackwell Publishing Ltd.},
author = {Zwiernik, Piotr and Uhler, Caroline and Richards, Donald},
issn = {13697412},
journal = {Journal of the Royal Statistical Society. Series B: Statistical Methodology},
number = {4},
pages = {1269 -- 1292},
publisher = {Wiley-Blackwell},
title = {{Maximum likelihood estimation for linear Gaussian covariance models}},
doi = {10.1111/rssb.12217},
volume = {79},
year = {2017},
}
@article{1211,
abstract = {Systems such as fluid flows in channels and pipes or the complex Ginzburg–Landau system, defined over periodic domains, exhibit both continuous symmetries, translational and rotational, as well as discrete symmetries under spatial reflections or complex conjugation. The simplest, and very common symmetry of this type is the equivariance of the defining equations under the orthogonal group O(2). We formulate a novel symmetry reduction scheme for such systems by combining the method of slices with invariant polynomial methods, and show how it works by applying it to the Kuramoto–Sivashinsky system in one spatial dimension. As an example, we track a relative periodic orbit through a sequence of bifurcations to the onset of chaos. Within the symmetry-reduced state space we are able to compute and visualize the unstable manifolds of relative periodic orbits, their torus bifurcations, a transition to chaos via torus breakdown, and heteroclinic connections between various relative periodic orbits. It would be very hard to carry through such analysis in the full state space, without a symmetry reduction such as the one we present here.},
author = {Budanur, Nazmi B and Cvitanović, Predrag},
journal = {Journal of Statistical Physics},
number = {3-4},
pages = {636--655},
publisher = {Springer},
title = {{Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system}},
doi = {10.1007/s10955-016-1672-z},
volume = {167},
year = {2017},
}
@article{1228,
abstract = {Since 2006, reprogrammed cells have increasingly been used as a biomedical research technique in addition to neuro-psychiatric methods. These rapidly evolving techniques allow for the generation of neuronal sub-populations, and have sparked interest not only in monogenetic neuro-psychiatric diseases, but also in poly-genetic and poly-aetiological disorders such as schizophrenia (SCZ) and bipolar disorder (BPD). This review provides a summary of 19 publications on reprogrammed adult somatic cells derived from patients with SCZ, and five publications using this technique in patients with BPD. As both disorders are complex and heterogeneous, there is a plurality of hypotheses to be tested in vitro. In SCZ, data on alterations of dopaminergic transmission in vitro are sparse, despite the great explanatory power of the so-called DA hypothesis of SCZ. Some findings correspond to perturbations of cell energy metabolism, and observations in reprogrammed cells suggest neuro-developmental alterations. Some studies also report on the efficacy of medicinal compounds to revert alterations observed in cellular models. However, due to the paucity of replication studies, no comprehensive conclusions can be drawn from studies using reprogrammed cells at the present time. In the future, findings from cell culture methods need to be integrated with clinical, epidemiological, pharmacological and imaging data in order to generate a more comprehensive picture of SCZ and BPD.},
author = {Sauerzopf, Ulrich and Sacco, Roberto and Novarino, Gaia and Niello, Marco and Weidenauer, Ana and Praschak Rieder, Nicole and Sitte, Harald and Willeit, Matthaeus},
journal = {European Journal of Neuroscience},
number = {1},
pages = {45 -- 57},
publisher = {Wiley-Blackwell},
title = {{Are reprogrammed cells a useful tool for studying dopamine dysfunction in psychotic disorders? A review of the current evidence}},
doi = {10.1111/ejn.13418},
volume = {45},
year = {2017},
}
@article{909,
abstract = {We study the lengths of curves passing through a fixed number of points on the boundary of a convex shape in the plane. We show that, for any convex shape K, there exist four points on the boundary of K such that the length of any curve passing through these points is at least half of the perimeter of K. It is also shown that the same statement does not remain valid with the additional constraint that the points are extreme points of K. Moreover, the factor ½ cannot be achieved with any fixed number of extreme points. We conclude the paper with a few other inequalities related to the perimeter of a convex shape.},
author = {Akopyan, Arseniy and Vysotsky, Vladislav},
issn = {00029890},
journal = {The American Mathematical Monthly},
number = {7},
pages = {588 -- 596},
publisher = {Mathematical Association of America},
title = {{On the lengths of curves passing through boundary points of a planar convex shape}},
doi = {10.4169/amer.math.monthly.124.7.588},
volume = {124},
year = {2017},
}
@article{910,
abstract = {Frequency-independent selection is generally considered as a force that acts to reduce the genetic variation in evolving populations, yet rigorous arguments for this idea are scarce. When selection fluctuates in time, it is unclear whether frequency-independent selection may maintain genetic polymorphism without invoking additional mechanisms. We show that constant frequency-independent selection with arbitrary epistasis on a well-mixed haploid population eliminates genetic variation if we assume linkage equilibrium between alleles. To this end, we introduce the notion of frequency-independent selection at the level of alleles, which is sufficient to prove our claim and contains the notion of frequency-independent selection on haploids. When selection and recombination are weak but of the same order, there may be strong linkage disequilibrium; numerical calculations show that stable equilibria are highly unlikely. Using the example of a diallelic two-locus model, we then demonstrate that frequency-independent selection that fluctuates in time can maintain stable polymorphism if linkage disequilibrium changes its sign periodically. We put our findings in the context of results from the existing literature and point out those scenarios in which the possible role of frequency-independent selection in maintaining genetic variation remains unclear.
},
author = {Novak, Sebastian and Barton, Nicholas H},
journal = {Genetics},
number = {2},
pages = {653 -- 668},
publisher = {Genetics Society of America},
title = {{When does frequency-independent selection maintain genetic variation?}},
doi = {10.1534/genetics.117.300129},
volume = {207},
year = {2017},
}
@inproceedings{911,
abstract = {We develop a probabilistic technique for colorizing grayscale natural images. In light of the intrinsic uncertainty of this task, the proposed probabilistic framework has numerous desirable properties. In particular, our model is able to produce multiple plausible and vivid colorizations for a given grayscale image and is one of the first colorization models to provide a proper stochastic sampling scheme. Moreover, our training procedure is supported by a rigorous theoretical framework that does not require any ad hoc heuristics and allows for efficient modeling and learning of the joint pixel color distribution.We demonstrate strong quantitative and qualitative experimental results on the CIFAR-10 dataset and the challenging ILSVRC 2012 dataset.},
author = {Royer, Amélie and Kolesnikov, Alexander and Lampert, Christoph},
location = {London, United Kingdom},
pages = {85.1--85.12},
publisher = {BMVA Press},
title = {{Probabilistic image colorization}},
doi = {10.5244/c.31.85},
year = {2017},
}
@article{912,
abstract = {We consider a many-body system of fermionic atoms interacting via a local pair potential and subject to an external potential within the framework of Bardeen-Cooper-Schrieffer (BCS) theory. We measure the free energy of the whole sample with respect to the free energy of a reference state which allows us to define a BCS functional with boundary conditions at infinity. Our main result is a lower bound for this energy functional in terms of expressions that typically appear in Ginzburg-Landau functionals.
},
author = {Deuchert, Andreas},
issn = {00222488},
journal = { Journal of Mathematical Physics},
number = {8},
publisher = {AIP},
title = {{A lower bound for the BCS functional with boundary conditions at infinity}},
doi = {10.1063/1.4996580},
volume = {58},
year = {2017},
}
@inproceedings{915,
abstract = {We propose a dual decomposition and linear program relaxation of the NP-hard minimum cost multicut problem. Unlike other polyhedral relaxations of the multicut polytope, it is amenable to efficient optimization by message passing. Like other polyhedral relaxations, it can be tightened efficiently by cutting planes. We define an algorithm that alternates between message passing and efficient separation of cycle- and odd-wheel inequalities. This algorithm is more efficient than state-of-the-art algorithms based on linear programming, including algorithms written in the framework of leading commercial software, as we show in experiments with large instances of the problem from applications in computer vision, biomedical image analysis and data mining.},
author = {Swoboda, Paul and Andres, Bjoern},
isbn = {978-153860457-1},
location = {Honolulu, HA, United States},
pages = {4990--4999},
publisher = {IEEE},
title = {{A message passing algorithm for the minimum cost multicut problem}},
doi = {10.1109/CVPR.2017.530},
volume = {2017},
year = {2017},
}
@inproceedings{916,
abstract = {We study the quadratic assignment problem, in computer vision also known as graph matching. Two leading solvers for this problem optimize the Lagrange decomposition duals with sub-gradient and dual ascent (also known as message passing) updates. We explore this direction further and propose several additional Lagrangean relaxations of the graph matching problem along with corresponding algorithms, which are all based on a common dual ascent framework. Our extensive empirical evaluation gives several theoretical insights and suggests a new state-of-the-art anytime solver for the considered problem. Our improvement over state-of-the-art is particularly visible on a new dataset with large-scale sparse problem instances containing more than 500 graph nodes each.},
author = {Swoboda, Paul and Rother, Carsten and Abu Alhaija, Carsten and Kainmueller, Dagmar and Savchynskyy, Bogdan},
isbn = {978-153860457-1},
location = {Honolulu, HA, United States},
pages = {7062--7071},
publisher = {IEEE},
title = {{A study of lagrangean decompositions and dual ascent solvers for graph matching}},
doi = {10.1109/CVPR.2017.747},
volume = {2017},
year = {2017},
}
@inproceedings{917,
abstract = {We propose a general dual ascent framework for Lagrangean decomposition of combinatorial problems. Although methods of this type have shown their efficiency for a number of problems, so far there was no general algorithm applicable to multiple problem types. In this work, we propose such a general algorithm. It depends on several parameters, which can be used to optimize its performance in each particular setting. We demonstrate efficacy of our method on graph matching and multicut problems, where it outperforms state-of-the-art solvers including those based on subgradient optimization and off-the-shelf linear programming solvers.},
author = {Swoboda, Paul and Kuske, Jan and Savchynskyy, Bogdan},
isbn = {978-153860457-1},
location = {Honolulu, HA, United States},
pages = {4950--4960},
publisher = {IEEE},
title = {{A dual ascent framework for Lagrangean decomposition of combinatorial problems}},
doi = {10.1109/CVPR.2017.526},
volume = {2017},
year = {2017},
}
@phdthesis{938,
abstract = {The thesis encompasses several topics of plant cell biology which were studied in the model plant Arabidopsis thaliana. Chapter 1 concerns the plant hormone auxin and its polar transport through cells and tissues. The highly controlled, directional transport of auxin is facilitated by plasma membrane-localized transporters. Transporters from the PIN family direct auxin transport due to their polarized localizations at cell membranes. Substantial effort has been put into research on cellular trafficking of PIN proteins, which is thought to underlie their polar distribution. I participated in a forward genetic screen aimed at identifying novel regulators of PIN polarity. The screen yielded several genes which may be involved in PIN polarity regulation or participate in polar auxin transport by other means. Chapter 2 focuses on the endomembrane system, with particular attention to clathrin-mediated endocytosis. The project started with identification of several proteins that interact with clathrin light chains. Among them, I focused on two putative homologues of auxilin, which in non-plant systems is an endocytotic factor known for uncoating clathrin-coated vesicles in the final step of endocytosis. The body of my work consisted of an in-depth characterization of transgenic A. thaliana lines overexpressing these putative auxilins in an inducible manner. Overexpression of these proteins leads to an inhibition of endocytosis, as documented by imaging of cargoes and clathrin-related endocytic machinery. An extension of this work is an investigation into a concept of homeostatic regulation acting between distinct transport processes in the endomembrane system. With auxilin overexpressing lines, where endocytosis is blocked specifically, I made observations on the mutual relationship between two opposite trafficking processes of secretion and endocytosis. In Chapter 3, I analyze cortical microtubule arrays and their relationship to auxin signaling and polarized growth in elongating cells. In plants, microtubules are organized into arrays just below the plasma membrane, and it is thought that their function is to guide membrane-docked cellulose synthase complexes. These, in turn, influence cell wall structure and cell shape by directed deposition of cellulose fibres. In elongating cells, cortical microtubule arrays are able to reorient in relation to long cell axis, and these reorientations have been linked to cell growth and to signaling of growth-regulating factors such as auxin or light. In this chapter, I am addressing the causal relationship between microtubule array reorientation, growth, and auxin signaling. I arrive at a model where array reorientation is not guided by auxin directly, but instead is only controlled by growth, which, in turn, is regulated by auxin.},
author = {Adamowski, Maciek},
pages = {117},
publisher = {IST Austria},
title = {{Investigations into cell polarity and trafficking in the plant model Arabidopsis thaliana }},
doi = {10.15479/AT:ISTA:th_842},
year = {2017},
}
@article{939,
abstract = {We reveal the existence of continuous families of guided single-mode solitons in planar waveguides with weakly nonlinear active core and absorbing boundaries. Stable propagation of TE and TM-polarized solitons is accompanied by attenuation of all other modes, i.e., the waveguide features properties of conservative and dissipative systems. If the linear spectrum of the waveguide possesses exceptional points, which occurs in the case of TM polarization, an originally focusing (defocusing) material nonlinearity may become effectively defocusing (focusing). This occurs due to the geometric phase of the carried eigenmode when the surface impedance encircles the exceptional point. In its turn, the change of the effective nonlinearity ensures the existence of dark (bright) solitons in spite of focusing (defocusing) Kerr nonlinearity of the core. The existence of an exceptional point can also result in anomalous enhancement of the effective nonlinearity. In terms of practical applications, the nonlinearity of the reported waveguide can be manipulated by controlling the properties of the absorbing cladding.},
author = {Midya, Bikashkali and Konotop, Vladimir},
issn = {00319007},
journal = {Physical Review Letters},
number = {3},
publisher = {American Physical Society},
title = {{Waveguides with absorbing boundaries: Nonlinearity controlled by an exceptional point and solitons}},
doi = {10.1103/PhysRevLett.119.033905},
volume = {119},
year = {2017},
}
@article{943,
abstract = {Like many developing tissues, the vertebrate neural tube is patterned by antiparallel morphogen gradients. To understand how these inputs are interpreted, we measured morphogen signaling and target gene expression in mouse embryos and chick ex vivo assays. From these data, we derived and validated a characteristic decoding map that relates morphogen input to the positional identity of neural progenitors. Analysis of the observed responses indicates that the underlying interpretation strategy minimizes patterning errors in response to the joint input of noisy opposing gradients. We reverse-engineered a transcriptional network that provides a mechanistic basis for the observed cell fate decisions and accounts for the precision and dynamics of pattern formation. Together, our data link opposing gradient dynamics in a growing tissue to precise pattern formation.},
author = {Zagórski, Marcin P and Tabata, Yoji and Brandenberg, Nathalie and Lutolf, Matthias and Tkacik, Gasper and Bollenbach, Tobias and Briscoe, James and Kicheva, Anna},
issn = {00368075},
journal = {Science},
number = {6345},
pages = {1379 -- 1383},
publisher = {American Association for the Advancement of Science},
title = {{Decoding of position in the developing neural tube from antiparallel morphogen gradients}},
doi = {10.1126/science.aam5887},
volume = {356},
year = {2017},
}
@article{945,
abstract = {While chromosome-wide dosage compensation of the X chromosome has been found in many species, studies in ZW clades have indicated that compensation of the Z is more localized and/or incomplete. In the ZW Lepidoptera, some species show complete compensation of the Z chromosome, while others lack full equalization, but what drives these inconsistencies is unclear. Here, we compare patterns of male and female gene expression on the Z chromosome of two closely related butterfly species, Papilio xuthus and Papilio machaon, and in multiple tissues of two moths species, Plodia interpunctella and Bombyx mori, which were previously found to differ in the extent to which they equalize Z-linked gene expression between the sexes. We find that, while some species and tissues seem to have incomplete dosage compensation, this is in fact due to the accumulation of male-biased genes and the depletion of female-biased genes on the Z chromosome. Once this is accounted for, the Z chromosome is fully compensated in all four species, through the up-regulation of Z expression in females and in some cases additional down-regulation in males. We further find that both sex-biased genes and Z-linked genes have increased rates of expression divergence in this clade, and that this can lead to fast shifts in patterns of gene expression even between closely related species. Taken together, these results show that the uneven distribution of sex-biased genes on sex chromosomes can confound conclusions about dosage compensation and that Z chromosome-wide dosage compensation is not only possible but ubiquitous among Lepidoptera.},
author = {Huylmans, Ann K and Macon, Ariana and Vicoso, Beatriz},
issn = {07374038},
journal = {Molecular Biology and Evolution},
number = {10},
pages = {2637 -- 2649},
publisher = {Oxford University Press},
title = {{Global dosage compensation is ubiquitous in Lepidoptera, but counteracted by the masculinization of the Z chromosome}},
doi = {10.1093/molbev/msx190},
volume = {34},
year = {2017},
}
@article{946,
abstract = {Roots navigate through soil integrating environmental signals to orient their growth. The Arabidopsis root is a widely used model for developmental, physiological and cell biological studies. Live imaging greatly aids these efforts, but the horizontal sample position and continuous root tip displacement present significant difficulties. Here, we develop a confocal microscope setup for vertical sample mounting and integrated directional illumination. We present TipTracker – a custom software for automatic tracking of diverse moving objects usable on various microscope setups. Combined, this enables observation of root tips growing along the natural gravity vector over prolonged periods of time, as well as the ability to induce rapid gravity or light stimulation. We also track migrating cells in the developing zebrafish embryo, demonstrating the utility of this system in the acquisition of high-resolution data sets of dynamic samples. We provide detailed descriptions of the tools enabling the easy implementation on other microscopes.},
author = {Von Wangenheim, Daniel and Hauschild, Robert and Fendrych, Matyas and Barone, Vanessa and Benková, Eva and Friml, Jirí},
journal = {eLife},
publisher = {eLife Sciences Publications},
title = {{Live tracking of moving samples in confocal microscopy for vertically grown roots}},
doi = {10.7554/eLife.26792},
volume = {6},
year = {2017},
}
@article{947,
abstract = {Viewing the ways a living cell can organize its metabolism as the phase space of a physical system, regulation can be seen as the ability to reduce the entropy of that space by selecting specific cellular configurations that are, in some sense, optimal. Here we quantify the amount of regulation required to control a cell's growth rate by a maximum-entropy approach to the space of underlying metabolic phenotypes, where a configuration corresponds to a metabolic flux pattern as described by genome-scale models. We link the mean growth rate achieved by a population of cells to the minimal amount of metabolic regulation needed to achieve it through a phase diagram that highlights how growth suppression can be as costly (in regulatory terms) as growth enhancement. Moreover, we provide an interpretation of the inverse temperature β controlling maximum-entropy distributions based on the underlying growth dynamics. Specifically, we show that the asymptotic value of β for a cell population can be expected to depend on (i) the carrying capacity of the environment, (ii) the initial size of the colony, and (iii) the probability distribution from which the inoculum was sampled. Results obtained for E. coli and human cells are found to be remarkably consistent with empirical evidence.},
author = {De Martino, Daniele and Capuani, Fabrizio and De Martino, Andrea},
issn = {24700045},
journal = { Physical Review E Statistical Nonlinear and Soft Matter Physics },
number = {1},
publisher = {American Institute of Physics},
title = {{Quantifying the entropic cost of cellular growth control}},
doi = {10.1103/PhysRevE.96.010401},
volume = {96},
year = {2017},
}
@inproceedings{950,
abstract = {Two-player games on graphs are widely studied in formal methods as they model the interaction between a system and its environment. The game is played by moving a token throughout a graph to produce an infinite path. There are several common modes to determine how the players move the token through the graph; e.g., in turn-based games the players alternate turns in moving the token. We study the bidding mode of moving the token, which, to the best of our knowledge, has never been studied in infinite-duration games. Both players have separate budgets, which sum up to $1$. In each turn, a bidding takes place. Both players submit bids simultaneously, and a bid is legal if it does not exceed the available budget. The winner of the bidding pays his bid to the other player and moves the token. For reachability objectives, repeated bidding games have been studied and are called Richman games. There, a central question is the existence and computation of threshold budgets; namely, a value t\in [0,1] such that if\PO's budget exceeds $t$, he can win the game, and if\PT's budget exceeds 1-t, he can win the game. We focus on parity games and mean-payoff games. We show the existence of threshold budgets in these games, and reduce the problem of finding them to Richman games. We also determine the strategy-complexity of an optimal strategy. Our most interesting result shows that memoryless strategies suffice for mean-payoff bidding games.
},
author = {Avni, Guy and Henzinger, Thomas A and Chonev, Ventsislav K},
issn = {1868-8969},
location = {Berlin, Germany},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
title = {{Infinite-duration bidding games}},
doi = {10.4230/LIPIcs.CONCUR.2017.21},
volume = {85},
year = {2017},
}
@article{952,
abstract = {A novel strategy for controlling the spread of arboviral diseases such as dengue, Zika and chikungunya is to transform mosquito populations with virus-suppressing Wolbachia. In general, Wolbachia transinfected into mosquitoes induce fitness costs through lower viability or fecundity. These maternally inherited bacteria also produce a frequency-dependent advantage for infected females by inducing cytoplasmic incompatibility (CI), which kills the embryos produced by uninfected females mated to infected males. These competing effects, a frequency-dependent advantage and frequency-independent costs, produce bistable Wolbachia frequency dynamics. Above a threshold frequency, denoted pˆ, CI drives fitness-decreasing Wolbachia transinfections through local populations; but below pˆ, infection frequencies tend to decline to zero. If pˆ is not too high, CI also drives spatial spread once infections become established over sufficiently large areas. We illustrate how simple models provide testable predictions concerning the spatial and temporal dynamics of Wolbachia introductions, focusing on rate of spatial spread, the shape of spreading waves, and the conditions for initiating spread from local introductions. First, we consider the robustness of diffusion-based predictions to incorporating two important features of wMel-Aedes aegypti biology that may be inconsistent with the diffusion approximations, namely fast local dynamics induced by complete CI (i.e., all embryos produced from incompatible crosses die) and long-tailed, non-Gaussian dispersal. With complete CI, our numerical analyses show that long-tailed dispersal changes wave-width predictions only slightly; but it can significantly reduce wave speed relative to the diffusion prediction; it also allows smaller local introductions to initiate spatial spread. Second, we use approximations for pˆ and dispersal distances to predict the outcome of 2013 releases of wMel-infected Aedes aegypti in Cairns, Australia, Third, we describe new data from Ae. aegypti populations near Cairns, Australia that demonstrate long-distance dispersal and provide an approximate lower bound on pˆ for wMel in northeastern Australia. Finally, we apply our analyses to produce operational guidelines for efficient transformation of vector populations over large areas. We demonstrate that even very slow spatial spread, on the order of 10-20 m/month (as predicted), can produce area-wide population transformation within a few years following initial releases covering about 20-30% of the target area.},
author = {Turelli, Michael and Barton, Nicholas H},
issn = {00405809},
journal = {Theoretical Population Biology},
pages = {45 -- 60},
publisher = {Elsevier},
title = {{Deploying dengue-suppressing Wolbachia: Robust models predict slow but effective spatial spread in Aedes aegypti}},
doi = {10.1016/j.tpb.2017.03.003},
volume = {115},
year = {2017},
}
@article{953,
abstract = {The role of natural selection in the evolution of adaptive phenotypes has undergone constant probing by evolutionary biologists, employing both theoretical and empirical approaches. As Darwin noted, natural selection can act together with other processes, including random changes in the frequencies of phenotypic differences that are not under strong selection, and changes in the environment, which may reflect evolutionary changes in the organisms themselves. As understanding of genetics developed after 1900, the new genetic discoveries were incorporated into evolutionary biology. The resulting general principles were summarized by Julian Huxley in his 1942 book Evolution: the modern synthesis. Here, we examine how recent advances in genetics, developmental biology and molecular biology, including epigenetics, relate to today's understanding of the evolution of adaptations. We illustrate how careful genetic studies have repeatedly shown that apparently puzzling results in a wide diversity of organisms involve processes that are consistent with neo-Darwinism. They do not support important roles in adaptation for processes such as directed mutation or the inheritance of acquired characters, and therefore no radical revision of our understanding of the mechanism of adaptive evolution is needed.},
author = {Charlesworth, Deborah and Barton, Nicholas H and Charlesworth, Brian},
journal = {Proceedings of the Royal Society of London Series B Biological Sciences},
number = {1855},
publisher = {Royal Society, The},
title = {{The sources of adaptive evolution}},
doi = {10.1098/rspb.2016.2864},
volume = {284},
year = {2017},
}
@article{954,
abstract = {Understanding the relation between genotype and phenotype remains a major challenge. The difficulty of predicting individual mutation effects, and particularly the interactions between them, has prevented the development of a comprehensive theory that links genotypic changes to their phenotypic effects. We show that a general thermodynamic framework for gene regulation, based on a biophysical understanding of protein-DNA binding, accurately predicts the sign of epistasis in a canonical cis-regulatory element consisting of overlapping RNA polymerase and repressor binding sites. Sign and magnitude of individual mutation effects are sufficient to predict the sign of epistasis and its environmental dependence. Thus, the thermodynamic model offers the correct null prediction for epistasis between mutations across DNA-binding sites. Our results indicate that a predictive theory for the effects of cis-regulatory mutations is possible from first principles, as long as the essential molecular mechanisms and the constraints these impose on a biological system are accounted for.},
author = {Lagator, Mato and Paixao, Tiago and Barton, Nicholas H and Bollback, Jonathan P and Guet, Calin C},
issn = {2050084X},
journal = {eLife},
publisher = {eLife Sciences Publications},
title = {{On the mechanistic nature of epistasis in a canonical cis-regulatory element}},
doi = {10.7554/eLife.25192},
volume = {6},
year = {2017},
}
@article{955,
abstract = {Gene expression is controlled by networks of regulatory proteins that interact specifically with external signals and DNA regulatory sequences. These interactions force the network components to co-evolve so as to continually maintain function. Yet, existing models of evolution mostly focus on isolated genetic elements. In contrast, we study the essential process by which regulatory networks grow: the duplication and subsequent specialization of network components. We synthesize a biophysical model of molecular interactions with the evolutionary framework to find the conditions and pathways by which new regulatory functions emerge. We show that specialization of new network components is usually slow, but can be drastically accelerated in the presence of regulatory crosstalk and mutations that promote promiscuous interactions between network components.},
author = {Friedlander, Tamar and Prizak, Roshan and Barton, Nicholas H and Tkacik, Gasper},
issn = {20411723},
journal = {Nature Communications},
number = {1},
publisher = {Nature Publishing Group},
title = {{Evolution of new regulatory functions on biophysically realistic fitness landscapes}},
doi = {10.1038/s41467-017-00238-8},
volume = {8},
year = {2017},
}
@article{956,
abstract = {We study a class of ergodic quantum Markov semigroups on finite-dimensional unital C⁎-algebras. These semigroups have a unique stationary state σ, and we are concerned with those that satisfy a quantum detailed balance condition with respect to σ. We show that the evolution on the set of states that is given by such a quantum Markov semigroup is gradient flow for the relative entropy with respect to σ in a particular Riemannian metric on the set of states. This metric is a non-commutative analog of the 2-Wasserstein metric, and in several interesting cases we are able to show, in analogy with work of Otto on gradient flows with respect to the classical 2-Wasserstein metric, that the relative entropy is strictly and uniformly convex with respect to the Riemannian metric introduced here. As a consequence, we obtain a number of new inequalities for the decay of relative entropy for ergodic quantum Markov semigroups with detailed balance.},
author = {Carlen, Eric and Maas, Jan},
issn = {00221236},
journal = {Journal of Functional Analysis},
number = {5},
pages = {1810 -- 1869},
publisher = {Academic Press},
title = {{Gradient flow and entropy inequalities for quantum Markov semigroups with detailed balance}},
doi = {10.1016/j.jfa.2017.05.003},
volume = {273},
year = {2017},
}
@article{959,
abstract = {In this work it is shown that scale-free tails in metabolic flux distributions inferred in stationary models are an artifact due to reactions involved in thermodynamically unfeasible cycles, unbounded by physical constraints and in principle able to perform work without expenditure of free energy. After implementing thermodynamic constraints by removing such loops, metabolic flux distributions scale meaningfully with the physical limiting factors, acquiring in turn a richer multimodal structure potentially leading to symmetry breaking while optimizing for objective functions.},
author = {De Martino, Daniele},
issn = {24700045},
journal = { Physical Review E Statistical Nonlinear and Soft Matter Physics },
number = {6},
pages = {062419},
publisher = {American Institute of Physics},
title = {{Scales and multimodal flux distributions in stationary metabolic network models via thermodynamics}},
doi = {10.1103/PhysRevE.95.062419},
volume = {95},
year = {2017},
}
@phdthesis{961,
abstract = {Cell-cell contact formation constitutes the first step in the emergence of multicellularity in evolution, thereby allowing the differentiation of specialized cell types. In metazoan development, cell-cell contact formation is thought to influence cell fate specification, and cell fate specification has been implicated in cell-cell contact formation. However, remarkably little is yet known about whether and how the interaction and feedback between cell-cell contact formation and cell fate specification affect development. Here we identify a positive feedback loop between cell-cell contact duration, morphogen signaling and mesendoderm cell fate specification during zebrafish gastrulation. We show that long lasting cell-cell contacts enhance the competence of prechordal plate (ppl) progenitor cells to respond to Nodal signaling, required for proper ppl cell fate specification. We further show that Nodal signalling romotes ppl cell-cell contact duration, thereby generating an effective positive feedback loop between ppl cell-cell contact duration and cell fate specification. Finally, by using a combination of theoretical modeling and experimentation, we show that this feedback loop determines whether anterior axial mesendoderm cells become ppl progenitors or, instead, turn into endoderm progenitors. Our findings reveal that the gene regulatory networks leading to cell fate diversification within the developing embryo are controlled by the interdependent activities of cell-cell signaling and contact formation.},
author = {Barone, Vanessa},
pages = {109},
publisher = {IST Austria},
title = {{Cell adhesion and cell fate: An effective feedback loop during zebrafish gastrulation}},
doi = {10.15479/AT:ISTA:th_825},
year = {2017},
}
@inproceedings{963,
abstract = {Network games are widely used as a model for selfish resource-allocation problems. In the classical model, each player selects a path connecting her source and target vertex. The cost of traversing an edge depends on the number of players that traverse it. Thus, it abstracts the fact that different users may use a resource at different times and for different durations, which plays an important role in defining the costs of the users in reality. For example, when transmitting packets in a communication network, routing traffic in a road network, or processing a task in a production system, the traversal of the network involves an inherent delay, and so sharing and congestion of resources crucially depends on time. We study timed network games , which add a time component to network games. Each vertex v in the network is associated with a cost function, mapping the load on v to the price that a player pays for staying in v for one time unit with this load. In addition, each edge has a guard, describing time intervals in which the edge can be traversed, forcing the players to spend time on vertices. Unlike earlier work that add a time component to network games, the time in our model is continuous and cannot be discretized. In particular, players have uncountably many strategies, and a game may have uncountably many pure Nash equilibria. We study properties of timed network games with cost-sharing or congestion cost functions: their stability, equilibrium inefficiency, and complexity. In particular, we show that the answer to the question whether we can restrict attention to boundary strategies, namely ones in which edges are traversed only at the boundaries of guards, is mixed. },
author = {Avni, Guy and Guha, Shibashis and Kupferman, Orna},
issn = {18688969},
location = {Aalborg, Denmark},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
title = {{Timed network games with clocks}},
doi = {10.4230/LIPIcs.MFCS.2017.37},
volume = {83},
year = {2017},
}
@article{988,
abstract = {The current-phase relation (CPR) of a Josephson junction (JJ) determines how the supercurrent evolves with the superconducting phase difference across the junction. Knowledge of the CPR is essential in order to understand the response of a JJ to various external parameters. Despite the rising interest in ultraclean encapsulated graphene JJs, the CPR of such junctions remains unknown. Here, we use a fully gate-tunable graphene superconducting quantum intereference device (SQUID) to determine the CPR of ballistic graphene JJs. Each of the two JJs in the SQUID is made with graphene encapsulated in hexagonal boron nitride. By independently controlling the critical current of the JJs, we can operate the SQUID either in a symmetric or asymmetric configuration. The highly asymmetric SQUID allows us to phase-bias one of the JJs and thereby directly obtain its CPR. The CPR is found to be skewed, deviating significantly from a sinusoidal form. The skewness can be tuned with the gate voltage and oscillates in antiphase with Fabry-Pérot resistance oscillations of the ballistic graphene cavity. We compare our experiments with tight-binding calculations that include realistic graphene-superconductor interfaces and find a good qualitative agreement.},
author = {Nanda, Gaurav and Aguilera Servin, Juan L and Rakyta, Péter and Kormányos, Andor and Kleiner, Reinhold and Koelle, Dieter and Watanabe, Kazuo and Taniguchi, Takashi and Vandersypen, Lieven and Goswami, Srijit},
issn = {15306984},
journal = {Nano Letters},
number = {6},
pages = {3396 -- 3401},
publisher = {American Chemical Society},
title = {{Current-phase relation of ballistic graphene Josephson junctions}},
doi = {10.1021/acs.nanolett.7b00097},
volume = {17},
year = {2017},
}
@article{990,
abstract = {Assortative mating is an important driver of speciation in populations with gene flow and is predicted to evolve under certain conditions in few-locus models. However, the evolution of assortment is less understood for mating based on quantitative traits, which are often characterized by high genetic variability and extensive linkage disequilibrium between trait loci. We explore this scenario for a two-deme model with migration, by considering a single polygenic trait subject to divergent viability selection across demes, as well as assortative mating and sexual selection within demes, and investigate how trait divergence is shaped by various evolutionary forces. Our analysis reveals the existence of sharp thresholds of assortment strength, at which divergence increases dramatically. We also study the evolution of assortment via invasion of modifiers of mate discrimination and show that the ES assortment strength has an intermediate value under a range of migration-selection parameters, even in diverged populations, due to subtle effects which depend sensitively on the extent of phenotypic variation within these populations. The evolutionary dynamics of the polygenic trait is studied using the hypergeometric and infinitesimal models. We further investigate the sensitivity of our results to the assumptions of the hypergeometric model, using individual-based simulations.},
author = {Sachdeva, Himani and Barton, Nicholas H},
issn = {00143820},
journal = {Evolution; International Journal of Organic Evolution},
number = {6},
pages = {1478 -- 1493 },
publisher = {Wiley-Blackwell},
title = {{Divergence and evolution of assortative mating in a polygenic trait model of speciation with gene flow}},
doi = {10.1111/evo.13252},
volume = {71},
year = {2017},
}
@phdthesis{992,
abstract = {An instance of the Constraint Satisfaction Problem (CSP) is given by a finite set of
variables, a finite domain of labels, and a set of constraints, each constraint acting on
a subset of the variables. The goal is to find an assignment of labels to its variables
that satisfies all constraints (or decide whether one exists). If we allow more general
“soft” constraints, which come with (possibly infinite) costs of particular assignments,
we obtain instances from a richer class called Valued Constraint Satisfaction Problem
(VCSP). There the goal is to find an assignment with minimum total cost.
In this thesis, we focus (assuming that P
6
=
NP) on classifying computational com-
plexity of CSPs and VCSPs under certain restricting conditions. Two results are the core
content of the work. In one of them, we consider VCSPs parametrized by a constraint
language, that is the set of “soft” constraints allowed to form the instances, and finish
the complexity classification modulo (missing pieces of) complexity classification for
analogously parametrized CSP. The other result is a generalization of Edmonds’ perfect
matching algorithm. This generalization contributes to complexity classfications in two
ways. First, it gives a new (largest known) polynomial-time solvable class of Boolean
CSPs in which every variable may appear in at most two constraints and second, it
settles full classification of Boolean CSPs with planar drawing (again parametrized by a
constraint language).},
author = {Rolinek, Michal},
pages = {97},
publisher = {IST Austria},
title = {{Complexity of constraint satisfaction}},
doi = {10.15479/AT:ISTA:th_815},
year = {2017},
}