@article{2514,
abstract = {Visual information must be relayed through the lateral geniculate nucleus before it reaches the visual cortex. However, not all spikes created in the retina lead to postsynaptic spikes and properties of the retinogeniculate synapse contribute to this filtering. To understand the mechanisms underlying this filtering process, we conducted electrophysiology to assess the properties of signal transmission in the Long-Evans rat. We also performed SDS-digested freeze-fracture replica labeling to quantify the receptor and transporter distribution, as well as EM reconstruction to describe the 3D structure. To analyze the impact of transmitter diffusion on the activity of the receptors, simulations were integrated. We identified that a large contributor to the filtering is the marked paired-pulse depression at this synapse, which was intensified by the morphological characteristics of the contacts. The broad presynaptic and postsynaptic contact area restricts transmitter diffusion two dimensionally. Additionally, the presence of multiple closely arranged release sites invites intersynaptic spillover, which causes desensitization of AMPA receptors. The presence of AMPA receptors that slowly recover from desensitization along with the high presynaptic release probability and multivesicular release at each synapse also contribute to the depression. These features contrast with many other synapses where spatiotemporal spread of transmitter is limited by rapid transmitter clearance allowing synapses to operate more independently. We propose that the micrometer-order structure can ultimately affect the visual information processing.},
author = {Budisantoso, Timotheus and Matsui, Ko and Kamasawa, Naomi and Fukazawa, Yugo and Ryuichi Shigemoto},
journal = {Journal of Neuroscience},
number = {7},
pages = {2357 -- 2376},
publisher = {Society for Neuroscience},
title = {{Mechanisms underlying signal filtering at a multisynapse contact}},
doi = {10.1523/JNEUROSCI.5243-11.2012},
volume = {32},
year = {2012},
}
@article{2515,
abstract = {We investigated the temporal and spatial expression of SK2 in the developing mouse hippocampus using molecular and biochemical techniques, quantitative immunogold electron microscopy, and electrophysiology. The mRNA encoding SK2 was expressed in the developing and adult hippocampus. Western blotting and immunohistochemistry showed that SK2 protein increased with age. This was accompanied by a shift in subcellular localization. Early in development (P5), SK2 was predominantly localized to the endoplasmic reticulum in the pyramidal cell layer. But by P30 SK2 was almost exclusively expressed in the dendrites and spines. The level of SK2 at the postsynaptic density (PSD) also increased during development. In the adult, SK2 expression on the spine plasma membrane showed a proximal-to-distal gradient. Consistent with this redistribution and gradient of SK2, the selective SK channel blocker apamin increased evoked excitatory postsynaptic potentials (EPSPs) only in CA1 pyramidal neurons from mice older than P15. However, the effect of apamin on EPSPs was not different between synapses in proximal or distal stratum radiatum or stratum lacunosum-moleculare in adult. These results show a developmental increase and gradient in SK2-containing channel surface expression that underlie their influence on neurotransmission, and that may contribute to increased memory acquisition during early development.},
author = {Ballesteros-Merino, Carmen and Lin, Michael and Wu, Wendy W and Ferrándiz-Huertas, Clotilde and Cabañero, María José and Watanabe, Masahiko and Fukazawa, Yugo and Ryuichi Shigemoto and Maylie, James G and Adelman, John P and Luján, Rafael},
journal = {Hippocampus},
number = {6},
pages = {1467 -- 1480},
publisher = {Wiley-Blackwell},
title = {{ Developmental profile of SK2 channel expression and function in CA1 neurons}},
doi = {10.1002/hipo.20986},
volume = {22},
year = {2012},
}
@article{2687,
abstract = {Left-right asymmetry of human brain function has been known for a century, although much of molecular and cellular basis of brain laterality remains to be elusive. Recent studies suggest that hippocampal CA3-CA1 excitatory synapses are asymmetrically arranged, however, the functional implication of the asymmetrical circuitry has not been studied at the behavioral level. In order to address the left-right asymmetry of hippocampal function in behaving mice, we analyzed the performance of "split-brain" mice in the Barnes maze. The "split-brain" mice received ventral hippocampal commissure and corpus callosum transection in addition to deprivation of visual input from one eye. In such mice, the hippocampus in the side of visual deprivation receives sensory-driven input. Better spatial task performance was achieved by the mice which were forced to use the right hippocampus than those which were forced to use the left hippocampus. In two-choice spatial maze, forced usage of left hippocampus resulted in a comparable performance to the right counterpart, suggesting that both hippocampal hemispheres are capable of conducting spatial learning. Therefore, the results obtained from the Barnes maze suggest that the usage of the right hippocampus improves the accuracy of spatial memory. Performance of non-spatial yet hippocampus-dependent tasks (e.g. fear conditioning) was not influenced by the laterality of the hippocampus.},
author = {Shinohara, Yoshiaki and Hosoya, Aki and Yamasaki, Nobuyuki and Ahmed, Hassan and Hattori, Satoko and Eguchi, Megumi and Yamaguchi, Shun and Miyakawa, Tsuyoshi and Hirase, Hajime and Ryuichi Shigemoto},
journal = {Hippocampus},
number = {2},
pages = {117 -- 121},
publisher = {Wiley-Blackwell},
title = {{Right-hemispheric dominance of spatial memory in split-brain mice}},
doi = {10.1002/hipo.20886},
volume = {22},
year = {2012},
}
@article{2688,
abstract = {To gain insights into structure-function relationship of excitatory synapses, we revisit our quantitative analysis of synaptic AMPAR by highly sensitive freeze-fracture replica labeling in eight different connections. All of these connections showed linear correlation between synapse size and AMPAR number indicating a common intra-synapse-type relationship in CNS synapses. On the contrary, inter-synapse-type relationship is unexpected indicating no correlation between averages of synapse size and AMPAR number. Interestingly, connections with large average synapse size and low AMPAR density showed high variability of AMPAR number and mosaic distribution within the postsynaptic membrane. We propose an idea that these connections may quickly exhibit synaptic plasticity by modifying AMPAR density/number whereas those with high AMPAR density change their efficacy by modifying synapse size.},
author = {Fukazawa, Yugo and Ryuichi Shigemoto},
journal = {Current Opinion in Neurobiology},
number = {3},
pages = {446 -- 452},
publisher = {Elsevier},
title = {{Intra-synapse-type and inter-synapse-type relationships between synaptic size and AMPAR expression}},
doi = {10.1016/j.conb.2012.01.006},
volume = {22},
year = {2012},
}
@article{2689,
abstract = {R-type calcium channels (RTCCs) are well known for their role in synaptic plasticity, but little is known about their subcellular distribution across various neuronal compartments. Using subtype-specific antibodies, we characterized the regional and subcellular localization of Ca v2.3 in mice and rats at both light and electron microscopic levels. Ca v2.3 immunogold particles were found to be predominantly presynaptic in the interpeduncular nucleus, but postsynaptic in other brain regions. Serial section analysis of electron microscopic images from the hippocampal CA1 revealed a higher density of immunogold particles in the dendritic shaft plasma membrane compared with the pyramidal cell somata. However, the labeling densities were not significantly different among the apical, oblique, or basal dendrites. Immunogold particles were also observed over the plasma membrane of dendritic spines, including both synaptic and extrasynaptic sites. Individual spine heads contained <20 immunogold particles, with an average density of ~260 immunoparticles per μm 3 spine head volume, in accordance with the density of RTCCs estimated using calcium imaging (Sabatini and Svoboda, 2000). The Ca v2.3 density was variable among similar-sized spine heads and did not correlate with the density in the parent dendrite, implying that spines are individual calcium compartments operating autonomously from their parent dendrites.},
author = {Parajuli, Laxmi K and Nakajima, Chikako and Kulik, Ákos and Matsui, Ko and Schneider, Toni and Ryuichi Shigemoto and Fukazawa, Yugo},
journal = {Journal of Neuroscience},
number = {39},
pages = {13555 -- 13567},
publisher = {Society for Neuroscience},
title = {{Quantitative regional and ultra structural localization of the Ca v2 3 subunit of R type calcium channel in mouse brain}},
doi = {10.1523/JNEUROSCI.1142-12.2012},
volume = {32},
year = {2012},
}
@unpublished{2696,
author = {László Erdös},
booktitle = {ArXiv},
publisher = {ArXiv},
title = {{Universality for random matrices and log-gases}},
year = {2012},
}
@inproceedings{2700,
author = {László Erdös},
pages = {3 -- 98},
publisher = {Oxford University Press},
title = {{Lecture notes on quantum Brownian motion}},
volume = {95},
year = {2012},
}
@inproceedings{2715,
abstract = {We consider Markov decision processes (MDPs) with specifications given as Büchi (liveness) objectives. We consider the problem of computing the set of almost-sure winning vertices from where the objective can be ensured with probability 1. We study for the first time the average case complexity of the classical algorithm for computing the set of almost-sure winning vertices for MDPs with Büchi objectives. Our contributions are as follows: First, we show that for MDPs with constant out-degree the expected number of iterations is at most logarithmic and the average case running time is linear (as compared to the worst case linear number of iterations and quadratic time complexity). Second, for the average case analysis over all MDPs we show that the expected number of iterations is constant and the average case running time is linear (again as compared to the worst case linear number of iterations and quadratic time complexity). Finally we also show that given that all MDPs are equally likely, the probability that the classical algorithm requires more than constant number of iterations is exponentially small.},
author = {Chatterjee, Krishnendu and Joglekar, Manas and Shah, Nisarg},
location = {Hyderabad, India},
pages = {461 -- 473},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
title = {{Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives}},
doi = {10.4230/LIPIcs.FSTTCS.2012.461},
volume = {18},
year = {2012},
}
@article{2767,
abstract = {Consider N × N Hermitian or symmetric random matrices H where the distribution of the (i, j) matrix element is given by a probability measure ν ij with a subexponential decay. Let σ ij 2 be the variance for the probability measure ν ij with the normalization property that Σ iσ i,j 2 = 1 for all j. Under essentially the only condition that c ≤ N σ ij 2 ≤ c -1 for some constant c > 0, we prove that, in the limit N → ∞, the eigenvalue spacing statistics of H in the bulk of the spectrum coincide with those of the Gaussian unitary or orthogonal ensemble (GUE or GOE). We also show that for band matrices with bandwidth M the local semicircle law holds to the energy scale M -1. },
author = {László Erdös and Yau, Horng-Tzer and Yin, Jun},
journal = {Probability Theory and Related Fields},
number = {1-2},
pages = {341 -- 407},
publisher = {Springer},
title = {{Bulk universality for generalized Wigner matrices}},
doi = {10.1007/s00440-011-0390-3},
volume = {154},
year = {2012},
}
@article{2768,
abstract = {We consider a two dimensional magnetic Schrödinger operator with a spatially stationary random magnetic field. We assume that the magnetic field has a positive lower bound and that it has Fourier modes on arbitrarily short scales. We prove the Wegner estimate at arbitrary energy, i. e. we show that the averaged density of states is finite throughout the whole spectrum. We also prove Anderson localization at the bottom of the spectrum.},
author = {László Erdös and Hasler, David G},
journal = {Communications in Mathematical Physics},
number = {2},
pages = {507 -- 542},
publisher = {Springer},
title = {{Wegner estimate and Anderson localization for random magnetic fields}},
doi = {10.1007/s00220-011-1373-z},
volume = {309},
year = {2012},
}
@article{2769,
abstract = {We present a generalization of the method of the local relaxation flow to establish the universality of local spectral statistics of a broad class of large random matrices. We show that the local distribution of the eigenvalues coincides with the local statistics of the corresponding Gaussian ensemble provided the distribution of the individual matrix element is smooth and the eigenvalues {X J} N j=1 are close to their classical location {y j} N j=1 determined by the limiting density of eigenvalues. Under the scaling where the typical distance between neighboring eigenvalues is of order 1/N, the necessary apriori estimate on the location of eigenvalues requires only to know that E|x j - γ j| 2 ≤ N-1-ε on average. This information can be obtained by well established methods for various matrix ensembles. We demonstrate the method by proving local spectral universality for sample covariance matrices.},
author = {László Erdös and Schlein, Benjamin and Yau, Horng-Tzer and Yin, Jun},
journal = {Annales de l'institut Henri Poincare (B) Probability and Statistics},
number = {1},
pages = {1 -- 46},
publisher = {Institute of Mathematical Statistics},
title = {{The local relaxation flow approach to universality of the local statistics for random matrices}},
doi = {10.1214/10-AIHP388},
volume = {48},
year = {2012},
}
@article{2770,
abstract = {Consider N×N Hermitian or symmetric random matrices H with independent entries, where the distribution of the (i,j) matrix element is given by the probability measure vij with zero expectation and with variance σ ιj 2. We assume that the variances satisfy the normalization condition Σiσij2=1 for all j and that there is a positive constant c such that c≤Nσ ιj 2 ιc -1. We further assume that the probability distributions νij have a uniform subexponential decay. We prove that the Stieltjes transform of the empirical eigenvalue distribution of H is given by the Wigner semicircle law uniformly up to the edges of the spectrum with an error of order (Nη) -1 where η is the imaginary part of the spectral parameter in the Stieltjes transform. There are three corollaries to this strong local semicircle law: (1) Rigidity of eigenvalues: If γj=γj,N denotes the classical location of the j-th eigenvalue under the semicircle law ordered in increasing order, then the j-th eigenvalue λj is close to γj in the sense that for some positive constants C, c P{double-struck}(∃j:|λ j-γ j|≥(logN) CloglogN[min(j,N-j+1)] -1/3N -2/3)≤ C exp[-(logN) cloglogN] for N large enough. (2) The proof of Dyson's conjecture (Dyson, 1962 [15]) which states that the time scale of the Dyson Brownian motion to reach local equilibrium is of order N -1 up to logarithmic corrections. (3) The edge universality holds in the sense that the probability distributions of the largest (and the smallest) eigenvalues of two generalized Wigner ensembles are the same in the large N limit provided that the second moments of the two ensembles are identical.},
author = {László Erdös and Yau, Horng-Tzer and Yin, Jun},
journal = {Advances in Mathematics},
number = {3},
pages = {1435 -- 1515},
publisher = {Academic Press},
title = {{Rigidity of eigenvalues of generalized Wigner matrices}},
doi = {10.1016/j.aim.2011.12.010},
volume = {229},
year = {2012},
}
@article{2771,
abstract = {We consider a magnetic Schrödinger operator in two dimensions. The magnetic field is given as the sum of a large and constant magnetic field and a random magnetic field. Moreover, we allow for an additional deterministic potential as well as a magnetic field which are both periodic. We show that the spectrum of this operator is contained in broadened bands around the Landau levels and that the edges of these bands consist of pure point spectrum with exponentially decaying eigenfunctions. The proof is based on a recent Wegner estimate obtained in Erdos and Hasler (Commun. Math. Phys., preprint, arXiv:1012.5185) and a multiscale analysis.},
author = {László Erdös and Hasler, David G},
journal = {Journal of Statistical Physics},
number = {5},
pages = {900 -- 923},
publisher = {Springer},
title = {{Anderson localization at band edges for random magnetic fields}},
doi = {10.1007/s10955-012-0445-6},
volume = {146},
year = {2012},
}
@article{2772,
abstract = {We consider the semiclassical asymptotics of the sum of negative eigenvalues of the three-dimensional Pauli operator with an external potential and a self-generated magnetic field B. We also add the field energy β ∫ B 2 and we minimize over all magnetic fields. The parameter β effectively determines the strength of the field. We consider the weak field regime with βh 2 ≥ const > 0, where h is the semiclassical parameter. For smooth potentials we prove that the semiclassical asymptotics of the total energy is given by the non-magnetic Weyl term to leading order with an error bound that is smaller by a factor h 1+e{open}, i. e. the subleading term vanishes. However for potentials with a Coulomb singularity, the subleading term does not vanish due to the non-semiclassical effect of the singularity. Combined with a multiscale technique, this refined estimate is used in the companion paper (Erdo{double acute}s et al. in Scott correction for large molecules with a self-generated magnetic field, Preprint, 2011) to prove the second order Scott correction to the ground state energy of large atoms and molecules.},
author = {László Erdös and Fournais, Søren and Solovej, Jan P},
journal = {Annales Henri Poincare},
number = {4},
pages = {671 -- 730},
publisher = {Birkhäuser},
title = {{Second order semiclassics with self generated magnetic fields}},
doi = {10.1007/s00023-011-0150-z},
volume = {13},
year = {2012},
}
@article{2773,
abstract = {Recently we proved [3, 4, 6, 7, 9, 10, 11] that the eigenvalue correlation functions of a general class of random matrices converge, weakly with respect to the energy, to the corresponding ones of Gaussian matrices. Tao and Vu [15] gave a proof that for the special case of Hermitian Wigner matrices the convergence can be strengthened to vague convergence at any fixed energy in the bulk. In this article we show that this theorem is an immediate corollary of our earlier results. Indeed, a more general form of this theorem also follows directly from our work [2].},
author = {László Erdös and Yau, Horng-Tzer},
journal = {Electronic Journal of Probability},
publisher = {Institute of Mathematical Statistics},
title = {{A comment on the Wigner-Dyson-Mehta bulk universality conjecture for Wigner matrices}},
doi = {10.1214/EJP.v17-1779},
volume = {17},
year = {2012},
}
@article{2774,
abstract = {We consider a large neutral molecule with total nuclear charge Z in non-relativistic quantum mechanics with a self-generated classical electromagnetic field. To ensure stability, we assume that Zα 2 ≤ κ 0 for a sufficiently small κ 0, where α denotes the fine structure constant. We show that, in the simultaneous limit Z → ∞, α → 0 such that κ = Zα 2 is fixed, the ground state energy of the system is given by a two term expansion c 1Z 7/3 + c 2(κ) Z 2 + o(Z 2). The leading term is given by the non-magnetic Thomas-Fermi theory. Our result shows that the magnetic field affects only the second (so-called Scott) term in the expansion.},
author = {László Erdös and Fournais, Søren and Solovej, Jan P},
journal = {Communications in Mathematical Physics},
number = {3},
pages = {847 -- 882},
publisher = {Springer},
title = {{Scott correction for large atoms and molecules in a self-generated magnetic field}},
doi = {10.1007/s00220-012-1468-1},
volume = {312},
year = {2012},
}
@article{2775,
abstract = {The Wigner-Dyson-Gaudin-Mehta conjecture asserts that the local eigenvalue statistics of large random matrices exhibit universal behavior depending only on the symmetry class of the matrix ensemble. For invariant matrix models, the eigenvalue distributions are given by a log-gas with potential V and inverse temperature β = 1, 2, 4, corresponding to the orthogonal, unitary and symplectic ensembles. For β ∉ {1, 2, 4}, there is no natural random matrix ensemble behind this model, but the statistical physics interpretation of the log-gas is still valid for all β > 0. The universality conjecture for invariant ensembles asserts that the local eigenvalue statistics are independent of V. In this article, we review our recent solution to the universality conjecture for both invariant and non-invariant ensembles. We will also demonstrate that the local ergodicity of the Dyson Brownian motion is the intrinsic mechanism behind the universality. Furthermore, we review the solution of Dyson's conjecture on the local relaxation time of the Dyson Brownian motion. Related questions such as delocalization of eigenvectors and local version of Wigner's semicircle law will also be discussed.},
author = {László Erdös and Yau, Horng-Tzer},
journal = {Bulletin of the American Mathematical Society},
number = {3},
pages = {377 -- 414},
publisher = {American Mathematical Society},
title = {{Universality of local spectral statistics of random matrices}},
doi = {10.1090/S0273-0979-2012-01372-1},
volume = {49},
year = {2012},
}
@article{2776,
abstract = {We consider the ensemble of adjacency matrices of Erdős-Rényi random graphs, i.e. graphs on N vertices where every edge is chosen independently and with probability p ≡ p(N). We rescale the matrix so that its bulk eigenvalues are of order one. Under the assumption pN≫N2/3 , we prove the universality of eigenvalue distributions both in the bulk and at the edge of the spectrum. More precisely, we prove (1) that the eigenvalue spacing of the Erdős-Rényi graph in the bulk of the spectrum has the same distribution as that of the Gaussian orthogonal ensemble; and (2) that the second largest eigenvalue of the Erdős-Rényi graph has the same distribution as the largest eigenvalue of the Gaussian orthogonal ensemble. As an application of our method, we prove the bulk universality of generalized Wigner matrices under the assumption that the matrix entries have at least 4 + ε moments.},
author = {László Erdös and Knowles, Antti and Yau, Horng-Tzer and Yin, Jun},
journal = {Communications in Mathematical Physics},
number = {3},
pages = {587 -- 640},
publisher = {Springer},
title = {{Spectral statistics of Erdős-Rényi graphs II: Eigenvalue spacing and the extreme eigenvalues}},
doi = {10.1007/s00220-012-1527-7},
volume = {314},
year = {2012},
}
@article{2777,
abstract = {We consider a large neutral molecule with total nuclear charge Z in a model with self-generated classical magnetic field and where the kinetic energy of the electrons is treated relativistically. To ensure stability, we assume that Zα < 2/π, where α denotes the fine structure constant. We are interested in the ground state energy in the simultaneous limit Z → ∞, α → 0 such that κ = Zα is fixed. The leading term in the energy asymptotics is independent of κ, it is given by the Thomas-Fermi energy of order Z7/3 and it is unchanged by including the self-generated magnetic field. We prove the first correction term to this energy, the so-called Scott correction of the form S(αZ)Z2. The current paper extends the result of Solovej et al. [Commun. Pure Appl. Math.LXIII, 39-118 (2010)] on the Scott correction for relativistic molecules to include a self-generated magnetic field. Furthermore, we show that the corresponding Scott correction function S, first identified by Solovej et al. [Commun. Pure Appl. Math.LXIII, 39-118 (2010)], is unchanged by including a magnetic field. We also prove new Lieb-Thirring inequalities for the relativistic kinetic energy with magnetic fields.},
author = {László Erdös and Fournais, Søren and Solovej, Jan P},
journal = {Journal of Mathematical Physics},
number = {9},
publisher = {American Institute of Physics},
title = {{Relativistic Scott correction in self-generated magnetic fields}},
doi = {10.1063/1.3697417},
volume = {53},
year = {2012},
}
@article{2778,
abstract = {We prove the bulk universality of the β-ensembles with non-convex regular analytic potentials for any β > 0. This removes the convexity assumption appeared in the earlier work [P. Bourgade, L. Erdös, and H.-T. Yau, Universality of general β-ensembles, preprint arXiv:0907.5605 (2011)]. The convexity condition enabled us to use the logarithmic Sobolev inequality to estimate events with small probability. The new idea is to introduce a "convexified measure" so that the local statistics are preserved under this convexification.},
author = {Bourgade, Paul and László Erdös and Yau, Horng-Tzer},
journal = {Journal of Mathematical Physics},
number = {9},
publisher = {American Institute of Physics},
title = {{Bulk universality of general β-ensembles with non-convex potential}},
doi = {10.1063/1.4751478},
volume = {53},
year = {2012},
}
@article{2779,
abstract = {We consider a two-dimensional magnetic Schrödinger operator on a square lattice with a spatially stationary random magnetic field. We prove Anderson localization near the spectral edges. We use a new approach to establish a Wegner estimate that does not rely on the monotonicity of the energy on the random parameters.},
author = {László Erdös and Hasler, David G},
journal = {Annales Henri Poincare},
number = {8},
pages = {1719 -- 1731},
publisher = {Birkhäuser},
title = {{Wegner estimate for random magnetic Laplacian on ℤ 2}},
doi = {10.1007/s00023-012-0177-9},
volume = {13},
year = {2012},
}
@article{2802,
abstract = {When a binary fluid demixes under a slow temperature ramp, nucleation, coarsening and sedimentation of droplets lead to an oscillatory evolution of the phase-separating system. The advection of the sedimenting droplets is found to be chaotic. The flow is driven by density differences between two phases. Here, we show how image processing can be combined with particle tracking to resolve droplet size and velocity simultaneously. Droplets are used as tracer particles, and the sedimentation velocity is determined. Taking these effects into account, droplets with radii in the range of 4-40 μm are detected and tracked. Based on these data, we resolve the oscillations in the droplet size distribution that are coupled to the convective flow.},
author = {Lapp, Tobias and Rohloff, Martin and Vollmer, Jürgen T and Björn Hof},
journal = {Experiments in Fluids},
number = {5},
pages = {1187 -- 1200},
publisher = {Springer},
title = {{Particle tracking for polydisperse sedimenting droplets in phase separation}},
doi = {10.1007/s00348-011-1243-7},
volume = {52},
year = {2012},
}
@article{2803,
abstract = {Recent numerical studies suggest that in pipe and related shear flows, the region of phase space separating laminar from turbulent motion is organized by a chaotic attractor, called an edge state, which mediates the transition process. We here confirm the existence of the edge state in laboratory experiments. We observe that it governs the dynamics during the decay of turbulence underlining its potential relevance for turbulence control. In addition we unveil two unstable traveling wave solutions underlying the experimental flow fields. This observation corroborates earlier suggestions that unstable solutions organize turbulence and its stability border.},
author = {de Lózar, Alberto and Mellibovsky, Fernando and Avila, Marc and Björn Hof},
journal = {Physical Review Letters},
number = {21},
publisher = {American Physical Society},
title = {{Edge state in pipe flow experiments}},
doi = {10.1103/PhysRevLett.108.214502},
volume = {108},
year = {2012},
}
@article{2804,
abstract = {The analysis of the size distribution of droplets condensing on a substrate (breath figures) is a test ground for scaling theories. Here, we show that a faithful description of these distributions must explicitly deal with the growth mechanisms of the droplets. This finding establishes a gateway connecting nucleation and growth of the smallest droplets on surfaces to gross features of the evolution of the droplet size distribution},
author = {Blaschke, Johannes and Lapp, Tobias and Björn Hof and Vollmer, Jürgen T},
journal = {Physical Review Letters},
number = {6},
publisher = {American Physical Society},
title = {{Breath figures: Nucleation, growth, coalescence, and the size distribution of droplets}},
doi = {10.1103/PhysRevLett.109.068701},
volume = {109},
year = {2012},
}
@inproceedings{2825,
abstract = {We study the problem of maximum marginal prediction (MMP) in probabilistic graphical models, a task that occurs, for example, as the Bayes optimal decision rule under a Hamming loss. MMP is typically performed as a two-stage procedure: one estimates each variable's marginal probability and then forms a prediction from the states of maximal probability. In this work we propose a simple yet effective technique for accelerating MMP when inference is sampling-based: instead of the above two-stage procedure we directly estimate the posterior probability of each decision variable. This allows us to identify the point of time when we are sufficiently certain about any individual decision. Whenever this is the case, we dynamically prune the variables we are confident about from the underlying factor graph. Consequently, at any time only samples of variables whose decision is still uncertain need to be created. Experiments in two prototypical scenarios, multi-label classification and image inpainting, show that adaptive sampling can drastically accelerate MMP without sacrificing prediction accuracy.},
author = {Lampert, Christoph},
location = {Lake Tahoe, NV, United States},
pages = {82 -- 90},
publisher = {Neural Information Processing Systems},
title = {{Dynamic pruning of factor graphs for maximum marginal prediction}},
volume = {1},
year = {2012},
}
@article{2848,
abstract = {We study evolutionary game theory in a setting where individuals learn from each other. We extend the traditional approach by assuming that a population contains individuals with different learning abilities. In particular, we explore the situation where individuals have different search spaces, when attempting to learn the strategies of others. The search space of an individual specifies the set of strategies learnable by that individual. The search space is genetically given and does not change under social evolutionary dynamics. We introduce a general framework and study a specific example in the context of direct reciprocity. For this example, we obtain the counter intuitive result that cooperation can only evolve for intermediate benefit-to-cost ratios, while small and large benefit-to-cost ratios favor defection. Our paper is a step toward making a connection between computational learning theory and evolutionary game dynamics.},
author = {Chatterjee, Krishnendu and Zufferey, Damien and Nowak, Martin},
journal = {Journal of Theoretical Biology},
pages = {161 -- 173},
publisher = {Elsevier},
title = {{Evolutionary game dynamics in populations with different learners}},
doi = {10.1016/j.jtbi.2012.02.021},
volume = {301},
year = {2012},
}
@article{2849,
author = {Edelsbrunner, Herbert and Strelkova, Nataliya},
journal = {Russian Mathematical Surveys},
number = {6},
pages = {1167 -- 1168},
publisher = {IOP Publishing Ltd.},
title = {{On the configuration space of Steiner minimal trees}},
doi = {10.1070/RM2012v067n06ABEH004820},
volume = {67},
year = {2012},
}
@article{2875,
abstract = {Phytohormones are important plant growth regulators that control many developmental processes, such as cell division, cell differentiation, organogenesis and morphogenesis. They regulate a multitude of apparently unrelated physiological processes, often with overlapping roles, and they mutually modulate their effects. These features imply important synergistic and antagonistic interactions between the various plant hormones. Auxin and cytokinin are central hormones involved in the regulation of plant growth and development, including processes determining root architecture, such as root pole establishment during early embryogenesis, root meristem maintenance and lateral root organogenesis. Thus, to control root development both pathways put special demands on the mechanisms that balance their activities and mediate their interactions. Here, we summarize recent knowledge on the role of auxin and cytokinin in the regulation of root architecture with special focus on lateral root organogenesis, discuss the latest findings on the molecular mechanisms of their interactions, and present forward genetic screen as a tool to identify novel molecular components of the auxin and cytokinin crosstalk.},
author = {Bielach, Agnieszka and Duclercq, Jérôme and Peter Marhavy and Eva Benková},
journal = {Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences},
number = {1595},
pages = {1469 -- 1478},
publisher = {Royal Society, The},
title = {{Genetic approach towards the identification of auxin - cytokinin crosstalk components involved in root development}},
doi = {10.1098/rstb.2011.0233},
volume = {367},
year = {2012},
}
@article{2876,
abstract = {Cytokinin (CK) activity is regulated by the complex interplay of their metabolism, transport, stability and cellular/tissue localization. O-glucosides of zeatin-type CKs are postulated to be storage and/or transport forms. Active CK levels are determined in part by their differential distribution of CK metabolites across different subcellular compartments. We have previously shown that overexpressing chloroplast-localized Zm-p60.1, a maize β-glucosidase capable of releasing active cytokinins from their O- and N3-glucosides, perturbs CK homeostasis in transgenic tobacco. We obtained tobacco (Nicotiana tabacum L., cv Petit Havana SR1) plants overexpressing a recombinant Zm-p60.1 that is targeted to the vacuole. The protein is correctly processed and localized to the vacuole. When grown on medium containing exogenous zeatin, transgenic seedlings rapidly accumulate fresh weight due to ectopic growths at the base of the hypocotyl. The presence of the enzyme in these ectopic structures is shown by histochemical staining. CK quantification reveals that these transgenic seedlings are unable to accumulate zeatin-O-glucoside to levels similar to those observed in the wild type. When crossed with tobacco overexpressing the zeatin-O-glucosyltransferase gene from Phaseolus, the vacuolar variant shows an almost complete reversion in the root elongation assay. This is the first evidence from intact plants that the vacuole is the storage organelle for CK O-glucosides and that they are available to attack by Zm-p60.1. We propose the use of Zm-p60.1 as a robust molecular tool that exploits the reversibility of O-glucosylation and enables delicate manipulations of active CK content at the cellular level.},
author = {Kiran, Nagavalli S and Eva Benková and Reková, Alena and Dubová, Jaroslava and Malbeck, Jiří and Palme, Klaus and Brzobohatý, Břetislav},
journal = {Phytochemistry},
pages = {67 -- 77},
publisher = {Elsevier},
title = {{Retargeting a maize β-glucosidase to the vacuole - Evidence from intact plants that zeatin-O-glucoside is stored in the vacuole}},
doi = {10.1016/j.phytochem.2012.03.012},
volume = {79},
year = {2012},
}
@article{2878,
abstract = {Phyllotaxis, the regular arrangement of leaves and flowers around the stem, is a key feature of plant architecture. Current models propose that the spatiotemporal regulation of organ initiation is controlled by a positive feedback loop between the plant hormone auxin and its efflux carrier PIN-FORMED1 (PIN1). Consequently, pin1 mutants give rise to naked inflorescence stalks with few or no flowers, indicating that PIN1 plays a crucial role in organ initiation. However, pin1 mutants do produce leaves. In order to understand the regulatory mechanisms controlling leaf initiation in Arabidopsis (Arabidopsis thaliana) rosettes, we have characterized the vegetative pin1 phenotype in detail. We show that although the timing of leaf initiation in vegetative pin1 mutants is variable and divergence angles clearly deviate from the canonical 137° value, leaves are not positioned at random during early developmental stages. Our data further indicate that other PIN proteins are unlikely to explain the persistence of leaf initiation and positioning during pin1 vegetative development. Thus, phyllotaxis appears to be more complex than suggested by current mechanistic models.},
author = {Guenot, Bernadette and Bayer, Emmanuelle and Kierzkowski, Daniel and Smith, Richard S and Mandel, Therese and Žádníková, Petra and Eva Benková and Kuhlemeier, Cris},
journal = {Plant Physiology},
number = {4},
pages = {1501 -- 1510},
publisher = {American Society of Plant Biologists},
title = {{Pin1 independent leaf initiation in Arabidopsis}},
doi = {10.1104/pp.112.200402},
volume = {159},
year = {2012},
}
@article{2879,
abstract = {Hormones, such as auxin and cytokinin, are involved in the complex molecular network that regulates the coordinated development of plant organs. Genes controlling ovule patterning have been identified and studied in detail; however, the roles of auxin and cytokinin in ovule development are largely unknown. Here we show that key cytokinin pathway genes, such as isopentenyltransferase and cytokinin receptors, are expressed during ovule development. Also, in a cre1-12 ahk2-2 ahk3-3 triple mutant with severely reduced cytokinin perception, expression of the auxin efflux facilitator PIN-FORMED 1 (PIN1) was severely reduced. In sporocyteless/nozzle (spl/nzz) mutants, which show a similar phenotype to the cre1-12 ahk2-2 ahk3-3 triple mutant, PIN1 expression is also reduced. Treatment with the exogenous cytokinin N6-benzylaminopurine also altered both auxin distribution and patterning of the ovule; this process required the homeodomain transcription factor BELL1 (BEL1). Thus, this article shows that cytokinin regulates ovule development through the regulation of PIN1. Furthermore, the transcription factors BEL1 and SPL/NZZ, previously described as key regulators of ovule development, are needed for the auxin and cytokinin signaling pathways for the correct patterning of the ovule.},
author = {Bencivenga, Stefano and Simonini, Sara and Eva Benková and Colombo, Lucia},
journal = {Plant Cell},
number = {7},
pages = {2886 -- 2897},
publisher = {American Society of Plant Biologists},
title = {{The transcription factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule development in Arabidopsis}},
doi = {10.1105/tpc.112.100164},
volume = {24},
year = {2012},
}
@inproceedings{2888,
abstract = {Formal verification aims to improve the quality of hardware and software by detecting errors before they do harm. At the basis of formal verification lies the logical notion of correctness, which purports to capture whether or not a circuit or program behaves as desired. We suggest that the boolean partition into correct and incorrect systems falls short of the practical need to assess the behavior of hardware and software in a more nuanced fashion against multiple criteria.},
author = {Henzinger, Thomas A},
booktitle = {Conference proceedings MODELS 2012},
location = {Innsbruck, Austria},
pages = {1 -- 2},
publisher = {Springer},
title = {{Quantitative reactive models}},
doi = {10.1007/978-3-642-33666-9_1},
volume = {7590},
year = {2012},
}
@inproceedings{2890,
abstract = {Systems are often specified using multiple requirements on their behavior. In practice, these requirements can be contradictory. The classical approach to specification, verification, and synthesis demands more detailed specifications that resolve any contradictions in the requirements. These detailed specifications are usually large, cumbersome, and hard to maintain or modify. In contrast, quantitative frameworks allow the formalization of the intuitive idea that what is desired is an implementation that comes "closest" to satisfying the mutually incompatible requirements, according to a measure of fit that can be defined by the requirements engineer. One flexible framework for quantifying how "well" an implementation satisfies a specification is offered by simulation distances that are parameterized by an error model. We introduce this framework, study its properties, and provide an algorithmic solution for the following quantitative synthesis question: given two (or more) behavioral requirements specified by possibly incompatible finite-state machines, and an error model, find the finite-state implementation that minimizes the maximal simulation distance to the given requirements. Furthermore, we generalize the framework to handle infinite alphabets (for example, realvalued domains). We also demonstrate how quantitative specifications based on simulation distances might lead to smaller and easier to modify specifications. Finally, we illustrate our approach using case studies on error correcting codes and scheduler synthesis.},
author = {Cerny, Pavol and Gopi, Sivakanth and Henzinger, Thomas A and Radhakrishna, Arjun and Totla, Nishant},
booktitle = {Proceedings of the tenth ACM international conference on Embedded software},
location = {Tampere, Finland},
pages = {53 -- 62},
publisher = {ACM},
title = {{Synthesis from incompatible specifications}},
doi = {10.1145/2380356.2380371},
year = {2012},
}
@inproceedings{2891,
abstract = {Quantitative automata are nondeterministic finite automata with edge weights. They value a
run by some function from the sequence of visited weights to the reals, and value a word by its
minimal/maximal run. They generalize boolean automata, and have gained much attention in
recent years. Unfortunately, important automaton classes, such as sum, discounted-sum, and
limit-average automata, cannot be determinized. Yet, the quantitative setting provides the potential
of approximate determinization. We define approximate determinization with respect to
a distance function, and investigate this potential.
We show that sum automata cannot be determinized approximately with respect to any
distance function. However, restricting to nonnegative weights allows for approximate determinization
with respect to some distance functions.
Discounted-sum automata allow for approximate determinization, as the influence of a word’s
suffix is decaying. However, the naive approach, of unfolding the automaton computations up
to a sufficient level, is shown to be doubly exponential in the discount factor. We provide an
alternative construction that is singly exponential in the discount factor, in the precision, and
in the number of states. We prove matching lower bounds, showing exponential dependency on
each of these three parameters.
Average and limit-average automata are shown to prohibit approximate determinization with
respect to any distance function, and this is the case even for two weights, 0 and 1.},
author = {Boker, Udi and Henzinger, Thomas A},
booktitle = {Leibniz International Proceedings in Informatics},
location = {Hyderabad, India},
pages = {362 -- 373},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
title = {{Approximate determinization of quantitative automata}},
doi = {10.4230/LIPIcs.FSTTCS.2012.362},
volume = {18},
year = {2012},
}
@article{2902,
abstract = {We present an algorithm for simplifying linear cartographic objects and results obtained with a computer program implementing this algorithm. },
author = {Edelsbrunner, Herbert and Musin, Oleg and Ukhalov, Alexey and Yakimova, Olga and Alexeev, Vladislav and Bogaevskaya, Victoriya and Gorohov, Andrey and Preobrazhenskaya, Margarita},
journal = {Modeling and Analysis of Information Systems},
number = {6},
pages = {152 -- 160},
publisher = {Technische Universität Darmstadt},
title = {{Fractal and computational geometry for generalizing cartographic objects}},
volume = {19},
year = {2012},
}
@inproceedings{2903,
abstract = {In order to enjoy a digital version of the Jordan Curve Theorem, it is common to use the closed topology for the foreground and the open topology for the background of a 2-dimensional binary image. In this paper, we introduce a single topology that enjoys this theorem for all thresholds decomposing a real-valued image into foreground and background. This topology is easy to construct and it generalizes to n-dimensional images.},
author = {Edelsbrunner, Herbert and Symonova, Olga},
location = {New Brunswick, NJ, USA },
pages = {41 -- 48},
publisher = {IEEE},
title = {{The adaptive topology of a digital image}},
doi = {10.1109/ISVD.2012.11},
year = {2012},
}
@article{2904,
abstract = {Generalized van der Corput sequences are onedimensional, infinite sequences in the unit interval. They are generated from permutations in integer base b and are the building blocks of the multi-dimensional Halton sequences. Motivated by recent progress of Atanassov on the uniform distribution behavior of Halton sequences, we study, among others, permutations of the form P(i) = ai (mod b) for coprime integers a and b. We show that multipliers a that either divide b - 1 or b + 1 generate van der Corput sequences with weak distribution properties. We give explicit lower bounds for the asymptotic distribution behavior of these sequences and relate them to sequences generated from the identity permutation in smaller bases, which are, due to Faure, the weakest distributed generalized van der Corput sequences.},
author = {Pausinger, Florian},
issn = {2118-8572},
journal = {Journal de Theorie des Nombres des Bordeaux},
number = {3},
pages = {729 -- 749},
publisher = {Universite de Bordeaux},
title = {{Weak multipliers for generalized van der Corput sequences}},
doi = {10.5802/jtnb.819},
volume = {24},
year = {2012},
}
@article{2911,
abstract = {We have selected problems that may not yet be well known, but have the
potential to push the research in interesting directions. In particular, we state
problems that do not require specific knowledge outside the standard circle of ideas
in discrete geometry. Despite the relatively simple statements, these problems are
related to current research and their solutions are likely to require new ideas and
approaches. We have chosen problems from different fields to make this short paper
attractive to a wide range of specialists.},
author = {Herbert Edelsbrunner and Ivanov, Alexander and Karasev, Roman},
journal = {Automatic Control and Computer Sciences},
publisher = {Springer},
title = {{Open problems in discrete and computational geometry}},
volume = {in print},
year = {2012},
}
@article{2912,
author = {Edelsbrunner, Herbert and Strelkova, Nataliya},
journal = { Uspekhi Mat. Nauk},
number = {6},
pages = {203 -- 204},
publisher = {Moscow Mathematical Society },
title = {{Configuration space for shortest networks }},
doi = {10.4213/rm9503},
volume = {67},
year = {2012},
}
@inproceedings{2915,
author = {Kroemer, Oliver and Lampert, Christoph and Peters, Jan},
publisher = {Deutsches Zentrum für Luft und Raumfahrt},
title = {{Multi-modal learning for dynamic tactile sensing}},
year = {2012},
}
@inproceedings{2916,
abstract = {The classical (boolean) notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a quantitative measure for interfaces, called interface simulation distance. It makes the alternating refinement preorder quantitative by, intu- itively, tolerating errors (while counting them) in the alternating simulation game. We show that the interface simulation distance satisfies the triangle inequality, that the distance between two interfaces does not increase under parallel composition with a third interface, and that the distance between two interfaces can be bounded from above and below by distances between abstractions of the two interfaces. We illustrate the framework, and the properties of the distances under composition of interfaces, with two case studies.},
author = {Cerny, Pavol and Chmelik, Martin and Henzinger, Thomas A and Radhakrishna, Arjun},
booktitle = {Electronic Proceedings in Theoretical Computer Science},
location = {Napoli, Italy},
pages = {29 -- 42},
publisher = {EPTCS},
title = {{Interface Simulation Distances}},
doi = {10.4204/EPTCS.96.3},
volume = {96},
year = {2012},
}
@article{2917,
abstract = {The search for extra-terrestrial intelligence (SETI) has been performed principally as a one-way survey, listening of radio frequencies across the Milky Way and other galaxies. However, scientists have engaged in an active messaging only rarely. This suggests the simple rationale that if other civilizations exist and take a similar approach to ours, namely listening but not broadcasting, the result is a silent universe. A simple game theoretical model, the prisoner's dilemma, explains this situation: each player (civilization) can passively search (defect), or actively search and broadcast (cooperate). In order to maximize the payoff (or, equivalently, minimize the risks) the best strategy is not to broadcast. In fact, the active search has been opposed on the basis that it might be dangerous to expose ourselves. However, most of these ideas have not been based on objective arguments, and ignore accounting of the possible gains and losses. Thus, the question stands: should we perform an active search? I develop a game-theoretical framework where civilizations can be of different types, and explicitly apply it to a situation where societies are either interested in establishing a two-way communication or belligerent and in urge to exploit ours. The framework gives a quantitative solution (a mixed-strategy), which is how frequent we should perform the active SETI. This frequency is roughly proportional to the inverse of the risk, and can be extremely small. However, given the immense amount of stars being scanned, it supports active SETI. The model is compared with simulations, and the possible actions are evaluated through the San Marino scale, measuring the risks of messaging.},
author = {Vladar, Harold},
journal = {International Journal of Astrobiology},
number = {1},
pages = {53 -- 62},
publisher = {Cambridge University Press},
title = {{The game of active search for extra terrestrial intelligence Breaking the Great Silence }},
doi = {10.1017/S1473550412000407},
volume = {12},
year = {2012},
}
@unpublished{2928,
abstract = { This paper addresses the problem of approximate MAP-MRF inference in general graphical models. Following [36], we consider a family of linear programming relaxations of the problem where each relaxation is specified by a set of nested pairs of factors for which the marginalization constraint needs to be enforced. We develop a generalization of the TRW-S algorithm [9] for this problem, where we use a decomposition into junction chains, monotonic w.r.t. some ordering on the nodes. This generalizes the monotonic chains in [9] in a natural way. We also show how to deal with nested factors in an efficient way. Experiments show an improvement over min-sum diffusion, MPLP and subgradient ascent algorithms on a number of computer vision and natural language processing problems. },
author = {Kolmogorov, Vladimir and Schoenemann, Thomas},
booktitle = {arXiv},
pages = {16},
publisher = {ArXiv},
title = {{Generalized sequential tree-reweighted message passing}},
year = {2012},
}
@techreport{2929,
author = {Vladimir Kolmogorov},
publisher = {Unknown},
title = {{The power of linear programming for valued CSPs: a constructive characterization}},
year = {2012},
}
@inproceedings{2930,
abstract = {In this paper we investigate k-submodular functions. This natural family of discrete functions includes submodular and bisubmodular functions as the special cases k = 1 and k = 2 respectively.
In particular we generalize the known Min-Max-Theorem for submodular and bisubmodular functions. This theorem asserts that the minimum of the (bi)submodular function can be found by solving a maximization problem over a (bi)submodular polyhedron. We define a k-submodular polyhedron, prove a Min-Max-Theorem for k-submodular functions, and give a greedy algorithm to construct the vertices of the polyhedron.
},
author = {Huber, Anna and Kolmogorov, Vladimir},
location = {Athens, Greece},
pages = {451 -- 462},
publisher = {Springer},
title = {{Towards minimizing k-submodular functions}},
doi = {10.1007/978-3-642-32147-4_40},
volume = {7422},
year = {2012},
}
@article{2931,
abstract = {In this paper, we present a new approach for establishing correspondences between sparse image features related by an unknown nonrigid mapping and corrupted by clutter and occlusion, such as points extracted from images of different instances of the same object category. We formulate this matching task as an energy minimization problem by defining an elaborate objective function of the appearance and the spatial arrangement of the features. Optimization of this energy is an instance of graph matching, which is in general an NP-hard problem. We describe a novel graph matching optimization technique, which we refer to as dual decomposition (DD), and demonstrate on a variety of examples that this method outperforms existing graph matching algorithms. In the majority of our examples, DD is able to find the global minimum within a minute. The ability to globally optimize the objective allows us to accurately learn the parameters of our matching model from training examples. We show on several matching tasks that our learned model yields results superior to those of state-of-the-art methods.
},
author = {Torresani, Lorenzo and Kolmogorov, Vladimir and Rother, Carsten},
journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
number = {2},
pages = {259 -- 271},
publisher = {IEEE},
title = {{A dual decomposition approach to feature correspondence}},
doi = {10.1109/TPAMI.2012.105},
volume = {35},
year = {2012},
}
@inproceedings{2936,
abstract = {The notion of delays arises naturally in many computational models, such as, in the design of circuits, control systems, and dataflow languages. In this work, we introduce automata with delay blocks (ADBs), extending finite state automata with variable time delay blocks, for deferring individual transition output symbols, in a discrete-time setting. We show that the ADB languages strictly subsume the regular languages, and are incomparable in expressive power to the context-free languages. We show that ADBs are closed under union, concatenation and Kleene star, and under intersection with regular languages, but not closed under complementation and intersection with other ADB languages. We show that the emptiness and the membership problems are decidable in polynomial time for ADBs, whereas the universality problem is undecidable. Finally we consider the linear-time model checking problem, i.e., whether the language of an ADB is contained in a regular language, and show that the model checking problem is PSPACE-complete. Copyright 2012 ACM.},
author = {Chatterjee, Krishnendu and Henzinger, Thomas A and Prabhu, Vinayak},
booktitle = {roceedings of the tenth ACM international conference on Embedded software},
location = {Tampere, Finland},
pages = {43 -- 52},
publisher = {ACM},
title = {{Finite automata with time delay blocks}},
doi = {10.1145/2380356.2380370},
year = {2012},
}
@inproceedings{2937,
abstract = {Developers building cryptography into security-sensitive applications face a daunting task. Not only must they understand the security guarantees delivered by the constructions they choose, they must also implement and combine them correctly and efficiently. Cryptographic compilers free developers from this task by turning high-level specifications of security goals into efficient implementations. Yet, trusting such tools is hard as they rely on complex mathematical machinery and claim security properties that are subtle and difficult to verify. In this paper we present ZKCrypt, an optimizing cryptographic compiler achieving an unprecedented level of assurance without sacrificing practicality for a comprehensive class of cryptographic protocols, known as Zero-Knowledge Proofs of Knowledge. The pipeline of ZKCrypt integrates purpose-built verified compilers and verifying compilers producing formal proofs in the CertiCrypt framework. By combining the guarantees delivered by each stage, ZKCrypt provides assurance that the output implementation securely realizes the abstract proof goal given as input. We report on the main characteristics of ZKCrypt, highlight new definitions and concepts at its foundations, and illustrate its applicability through a representative example of an anonymous credential system.},
author = {Almeida, José and Barbosa, Manuel and Bangerter, Endre and Barthe, Gilles and Krenn, Stephan and Béguelin, Santiago},
booktitle = {Proceedings of the 2012 ACM conference on Computer and communications security},
location = {Raleigh, NC, USA},
pages = {488 -- 500},
publisher = {ACM},
title = {{Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols}},
doi = {10.1145/2382196.2382249},
year = {2012},
}
@article{2938,
abstract = {Social insects have a very high potential to become invasive pest species. Here, we explore how their social lifestyle and their interaction with parasites may contribute to this invasive success. Similar to solitary species, parasite release followed by the evolution of increased competitive ability can promote establishment of introduced social insect hosts in their introduced range. Genetic bottlenecks during introduction of low numbers of founder individuals decrease the genetic diversity at three levels: the population, the colony and the individual, with the colony level being specific to social insects. Reduced genetic diversity can affect both the individual immune system and the collective colony-level disease defences (social immunity). Still, the dual immune system is likely to make social insects more robust to parasite attack. Changes in social structure from small, family-based, territorially aggressive societies in native populations towards huge networks of cooperating nests (unicoloniality) occur in some invasive social insects, for example, most invasive ants and some termites. Unicoloniality is likely to affect disease dynamics in multiple ways. The free exchange of individuals within the population leads to an increased genetic heterogeneity among individuals of a single nest, thereby decreasing disease transmission. However, the multitude of reproductively active queens per colony buffers the effect of individual diseased queens and their offspring, which may result in a higher level of vertical disease transmission in unicolonial societies. Lastly, unicoloniality provides a competitive advantage over native species, allowing them to quickly become the dominant species in the habitat, which in turn selects for parasite adaptation to this common host genotype and thus eventually a high parasite pressure. Overall, invasions by insect societies are characterized by general features applying to all introduced species, as well as idiosyncrasies that emerge from their social lifestyle. It is important to study these effects in concert to be able to develop efficient management and biocontrol strategies. © 2012 British Ecological Society.},
author = {Ugelvig, Line V and Cremer, Sylvia},
journal = {Functional Ecology},
number = {6},
pages = {1300 -- 1312},
publisher = {Wiley-Blackwell},
title = {{Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies}},
doi = {10.1111/1365-2435.12013},
volume = {26},
year = {2012},
}
@article{2941,
author = {Dolbilin, Nikolai and Edelsbrunner, Herbert and Musin, Oleg},
journal = {Russian Mathematical Surveys},
number = {4},
pages = {781 -- 783},
publisher = {IOP Publishing},
title = {{On the optimality of functionals over triangulations of Delaunay sets}},
doi = {10.1070/RM2012v067n04ABEH004807},
volume = {67},
year = {2012},
}