@inbook{5805, abstract = {Discretization of sphere in the integer space follows a particular discretization scheme, which, in principle, conforms to some topological model. This eventually gives rise to interesting topological properties of a discrete spherical surface, which need to be investigated for its analytical characterization. This paper presents some novel results on the local topological properties of the naive model of discrete sphere. They follow from the bijection of each quadraginta octant of naive sphere with its projection map called f -map on the corresponding functional plane and from the characterization of certain jumps in the f-map. As an application, we have shown how these properties can be used in designing an efficient reconstruction algorithm for a naive spherical surface from an input voxel set when it is sparse or noisy.}, author = {Sen, Nabhasmita and Biswas, Ranita and Bhowmick, Partha}, booktitle = {Computational Topology in Image Context}, isbn = {978-3-319-39440-4}, issn = {1611-3349}, location = {Marseille, France}, pages = {253--264}, publisher = {Springer Nature}, title = {{On some local topological properties of naive discrete sphere}}, doi = {10.1007/978-3-319-39441-1_23}, volume = {9667}, year = {2016}, } @inproceedings{5806, abstract = {Although the concept of functional plane for naive plane is studied and reported in the literature in great detail, no similar study is yet found for naive sphere. This article exposes the first study in this line, opening up further prospects of analyzing the topological properties of sphere in the discrete space. We show that each quadraginta octant Q of a naive sphere forms a bijection with its projected pixel set on a unique coordinate plane, which thereby serves as the functional plane of Q, and hence gives rise to merely mono-jumps during back projection. The other two coordinate planes serve as para-functional and dia-functional planes for Q, as the former is ‘mono-jumping’ but not bijective, whereas the latter holds neither of the two. Owing to this, the quadraginta octants form symmetry groups and subgroups with equivalent jump conditions. We also show a potential application in generating a special class of discrete 3D circles based on back projection and jump bridging by Steiner voxels. A circle in this class possesses 4-symmetry, uniqueness, and bounded distance from the underlying real sphere and real plane.}, author = {Biswas, Ranita and Bhowmick, Partha}, booktitle = {Discrete Geometry for Computer Imagery}, isbn = {978-3-319-32359-6}, issn = {0302-9743}, location = {Nantes, France}, pages = {256--267}, publisher = {Springer Nature}, title = {{On functionality of quadraginta octants of naive sphere with application to circle drawing}}, doi = {10.1007/978-3-319-32360-2_20}, volume = {9647}, year = {2016}, } @inbook{5809, abstract = {A discrete spherical circle is a topologically well-connected 3D circle in the integer space, which belongs to a discrete sphere as well as a discrete plane. It is one of the most important 3D geometric primitives, but has not possibly yet been studied up to its merit. This paper is a maiden exposition of some of its elementary properties, which indicates a sense of its profound theoretical prospects in the framework of digital geometry. We have shown how different types of discretization can lead to forbidden and admissible classes, when one attempts to define the discretization of a spherical circle in terms of intersection between a discrete sphere and a discrete plane. Several fundamental theoretical results have been presented, the algorithm for construction of discrete spherical circles has been discussed, and some test results have been furnished to demonstrate its practicality and usefulness.}, author = {Biswas, Ranita and Bhowmick, Partha and Brimkov, Valentin E.}, booktitle = {Combinatorial image analysis}, isbn = {978-3-319-26144-7}, issn = {1611-3349}, location = {Kolkata, India}, pages = {86--100}, publisher = {Springer Nature}, title = {{On the connectivity and smoothness of discrete spherical circles}}, doi = {10.1007/978-3-319-26145-4_7}, volume = {9448}, year = {2016}, } @misc{9862, author = {Roux, Camille and Fraisse, Christelle and Romiguier, Jonathan and Anciaux, Youann and Galtier, Nicolas and Bierne, Nicolas}, publisher = {Public Library of Science}, title = {{Simulation study to test the robustness of ABC in face of recent times of divergence}}, doi = {10.1371/journal.pbio.2000234.s016}, year = {2016}, } @misc{9863, author = {Roux, Camille and Fraisse, Christelle and Romiguier, Jonathan and Anciaux, Youann and Galtier, Nicolas and Bierne, Nicolas}, publisher = {Public Library of Science}, title = {{Accessions of surveyed individuals, geographic locations and summary statistics}}, doi = {10.1371/journal.pbio.2000234.s017}, year = {2016}, } @misc{9864, abstract = {Viral capsids are structurally constrained by interactions among the amino acids (AAs) of their constituent proteins. Therefore, epistasis is expected to evolve among physically interacting sites and to influence the rates of substitution. To study the evolution of epistasis, we focused on the major structural protein of the ϕX174 phage family by, first, reconstructing the ancestral protein sequences of 18 species using a Bayesian statistical framework. The inferred ancestral reconstruction differed at eight AAs, for a total of 256 possible ancestral haplotypes. For each ancestral haplotype and the extant species, we estimated, in silico, the distribution of free energies and epistasis of the capsid structure. We found that free energy has not significantly increased but epistasis has. We decomposed epistasis up to fifth order and found that higher-order epistasis sometimes compensates pairwise interactions making the free energy seem additive. The dN/dS ratio is low, suggesting strong purifying selection, and that structure is under stabilizing selection. We synthesized phages carrying ancestral haplotypes of the coat protein gene and measured their fitness experimentally. Our findings indicate that stabilizing mutations can have higher fitness, and that fitness optima do not necessarily coincide with energy minima.}, author = {Fernandes Redondo, Rodrigo A and de Vladar, Harold and Włodarski, Tomasz and Bollback, Jonathan P}, publisher = {The Royal Society}, title = {{Data from evolutionary interplay between structure, energy and epistasis in the coat protein of the ϕX174 phage family}}, doi = {10.6084/m9.figshare.4315652.v1}, year = {2016}, } @misc{9866, author = {Zagórski, Marcin P and Burda, Zdzisław and Wacław, Bartłomiej}, publisher = {Public Library of Science}, title = {{ZIP-archived directory containing all data and computer programs}}, doi = {10.1371/journal.pcbi.1005218.s009}, year = {2016}, } @misc{9867, abstract = {In the beginning of our experiment, subjects were asked to read a few pages on their computer screens that would explain the rules of the subsequent game. Here, we provide these instructions, translated from German.}, author = {Hilbe, Christian and Hagel, Kristin and Milinski, Manfred}, publisher = {Public Library of Science}, title = {{Experimental game instructions}}, doi = {10.1371/journal.pone.0163867.s008}, year = {2016}, } @misc{9868, abstract = {The raw data file containing the experimental decisions of all our study subjects.}, author = {Hilbe, Christian and Hagel, Kristin and Milinski, Manfred}, publisher = {Public Library of Science}, title = {{Experimental data}}, doi = {10.1371/journal.pone.0163867.s009}, year = {2016}, } @misc{9869, abstract = {A lower bound on the error of a positional estimator with limited positional information is derived.}, author = {Hillenbrand, Patrick and Gerland, Ulrich and Tkačik, Gašper}, publisher = {Public Library of Science}, title = {{Error bound on an estimator of position}}, doi = {10.1371/journal.pone.0163628.s001}, year = {2016}, } @misc{9870, abstract = {The effect of noise in the input field on an Ising model is approximated. Furthermore, methods to compute positional information in an Ising model by transfer matrices and Monte Carlo sampling are outlined.}, author = {Hillenbrand, Patrick and Gerland, Ulrich and Tkačik, Gašper}, publisher = {Public Library of Science}, title = {{Computation of positional information in an Ising model}}, doi = {10.1371/journal.pone.0163628.s002}, year = {2016}, } @misc{9871, abstract = {The positional information in a discrete morphogen field with Gaussian noise is computed.}, author = {Hillenbrand, Patrick and Gerland, Ulrich and Tkačik, Gašper}, publisher = {Public Library of Science}, title = {{Computation of positional information in a discrete morphogen field}}, doi = {10.1371/journal.pone.0163628.s003}, year = {2016}, } @misc{9873, author = {Boehm, Alex and Arnoldini, Markus and Bergmiller, Tobias and Röösli, Thomas and Bigosch, Colette and Ackermann, Martin}, publisher = {Public Library of Science}, title = {{Quantification of the growth rate reduction as a consequence of age-specific mortality}}, doi = {10.1371/journal.pgen.1005974.s015}, year = {2016}, } @inbook{19990, abstract = {Visualizing molecular localization at high resolution contributes to understanding of their functions and roles in physiological and pathological conditions. Sodium dodecyl sulfate-digested freeze-fracture replica labeling (SDS-FRL) is a powerful electron microscopy method to study high-resolution two-dimensional distribution of transmembrane proteins and their tightly associated proteins on platinum-carbon replica. During treatment with SDS, unfixed proteins and intracellular organelle are dissolved and integral membrane proteins captured and stabilized by carbon and platinum deposition are denatured, retaining most of their antigenicity, and exposed on exoplasmic and protoplasmic surfaces of lipid monolayers. The exposure of these antigens on the surface of replica facilitates the accessibility of antibodies and therefore provides higher labeling efficiency than those obtained with other immunoelectron microscopy techniques. In this chapter, we describe the protocols of SDS-FRL adapted for mammalian brain samples and an additional procedure for fluorescence-guided electron microscopy for replica immunolabeling.}, author = {Harada, Harumi and Shigemoto, Ryuichi}, booktitle = {Receptor and Ion Channel Detection in the Brain}, isbn = {9781493930630}, issn = {1940-6045}, pages = {233--245}, publisher = {Springer Nature}, title = {{High-Resolution Localization of Membrane Proteins by SDS-Digested Freeze-Fracture Replica Labeling (SDS-FRL)}}, doi = {10.1007/978-1-4939-3064-7_17}, year = {2016}, } @article{1328, abstract = {Hole spins have gained considerable interest in the past few years due to their potential for fast electrically controlled qubits. Here, we study holes confined in Ge hut wires, a so-far unexplored type of nanostructure. Low-temperature magnetotransport measurements reveal a large anisotropy between the in-plane and out-of-plane g-factors of up to 18. Numerical simulations verify that this large anisotropy originates from a confined wave function of heavy-hole character. A light-hole admixture of less than 1% is estimated for the states of lowest energy, leading to a surprisingly large reduction of the out-of-plane g-factors compared with those for pure heavy holes. Given this tiny light-hole contribution, the spin lifetimes are expected to be very long, even in isotopically nonpurified samples.}, author = {Watzinger, Hannes and Kloeffel, Christoph and Vukusic, Lada and Rossell, Marta and Sessi, Violetta and Kukucka, Josip and Kirchschlager, Raimund and Lausecker, Elisabeth and Truhlar, Alisha and Glaser, Martin and Rastelli, Armando and Fuhrer, Andreas and Loss, Daniel and Katsaros, Georgios}, journal = {Nano Letters}, number = {11}, pages = {6879 -- 6885}, publisher = {American Chemical Society}, title = {{Heavy-hole states in germanium hut wires}}, doi = {10.1021/acs.nanolett.6b02715}, volume = {16}, year = {2016}, } @article{1346, abstract = {ATP production requires the establishment of an electrochemical proton gradient across the inner mitochondrial membrane. Mitochondrial uncouplers dissipate this proton gradient and disrupt numerous cellular processes, including vesicular trafficking, mainly through energy depletion. Here we show that Endosidin9 (ES9), a novel mitochondrial uncoupler, is a potent inhibitor of clathrin-mediated endocytosis (CME) in different systems and that ES9 induces inhibition of CME not because of its effect on cellular ATP, but rather due to its protonophore activity that leads to cytoplasm acidification. We show that the known tyrosine kinase inhibitor tyrphostinA23, which is routinely used to block CME, displays similar properties, thus questioning its use as a specific inhibitor of cargo recognition by the AP-2 adaptor complex via tyrosine motif-based endocytosis signals. Furthermore, we show that cytoplasm acidification dramatically affects the dynamics and recruitment of clathrin and associated adaptors, and leads to reduction of phosphatidylinositol 4,5-biphosphate from the plasma membrane.}, author = {Dejonghe, Wim and Kuenen, Sabine and Mylle, Evelien and Vasileva, Mina K and Keech, Olivier and Viotti, Corrado and Swerts, Jef and Fendrych, Matyas and Ortiz Morea, Fausto and Mishev, Kiril and Delang, Simon and Scholl, Stefan and Zarza, Xavier and Heilmann, Mareike and Kourelis, Jiorgos and Kasprowicz, Jaroslaw and Nguyen, Le and Drozdzecki, Andrzej and Van Houtte, Isabelle and Szatmári, Anna and Majda, Mateusz and Baisa, Gary and Bednarek, Sebastian and Robert, Stéphanie and Audenaert, Dominique and Testerink, Christa and Munnik, Teun and Van Damme, Daniël and Heilmann, Ingo and Schumacher, Karin and Winne, Johan and Friml, Jirí and Verstreken, Patrik and Russinova, Eugenia}, journal = {Nature Communications}, publisher = {Nature Publishing Group}, title = {{Mitochondrial uncouplers inhibit clathrin-mediated endocytosis largely through cytoplasmic acidification}}, doi = {10.1038/ncomms11710}, volume = {7}, year = {2016}, } @article{1358, abstract = {Gene regulation relies on the specificity of transcription factor (TF)–DNA interactions. Limited specificity may lead to crosstalk: a regulatory state in which a gene is either incorrectly activated due to noncognate TF–DNA interactions or remains erroneously inactive. As each TF can have numerous interactions with noncognate cis-regulatory elements, crosstalk is inherently a global problem, yet has previously not been studied as such. We construct a theoretical framework to analyse the effects of global crosstalk on gene regulation. We find that crosstalk presents a significant challenge for organisms with low-specificity TFs, such as metazoans. Crosstalk is not easily mitigated by known regulatory schemes acting at equilibrium, including variants of cooperativity and combinatorial regulation. Our results suggest that crosstalk imposes a previously unexplored global constraint on the functioning and evolution of regulatory networks, which is qualitatively distinct from the known constraints that act at the level of individual gene regulatory elements.}, author = {Friedlander, Tamar and Prizak, Roshan and Guet, Calin C and Barton, Nicholas H and Tkacik, Gasper}, journal = {Nature Communications}, publisher = {Nature Publishing Group}, title = {{Intrinsic limits to gene regulation by global crosstalk}}, doi = {10.1038/ncomms12307}, volume = {7}, year = {2016}, } @article{1096, author = {Schwayer, Cornelia and Sikora, Mateusz K and Slovakova, Jana and Kardos, Roland and Heisenberg, Carl-Philipp J}, journal = {Developmental Cell}, number = {6}, pages = {493 -- 506}, publisher = {Cell Press}, title = {{Actin rings of power}}, doi = {10.1016/j.devcel.2016.05.024}, volume = {37}, year = {2016}, } @inproceedings{1229, abstract = {Witness encryption (WE) was introduced by Garg et al. [GGSW13]. A WE scheme is defined for some NP language L and lets a sender encrypt messages relative to instances x. A ciphertext for x can be decrypted using w witnessing x ∈ L, but hides the message if x ∈ L. Garg et al. construct WE from multilinear maps and give another construction [GGH+13b] using indistinguishability obfuscation (iO) for circuits. Due to the reliance on such heavy tools, WE can cur- rently hardly be implemented on powerful hardware and will unlikely be realizable on constrained devices like smart cards any time soon. We construct a WE scheme where encryption is done by simply computing a Naor-Yung ciphertext (two CPA encryptions and a NIZK proof). To achieve this, our scheme has a setup phase, which outputs public parameters containing an obfuscated circuit (only required for decryption), two encryption keys and a common reference string (used for encryption). This setup need only be run once, and the parame- ters can be used for arbitrary many encryptions. Our scheme can also be turned into a functional WE scheme, where a message is encrypted w.r.t. a statement and a function f, and decryption with a witness w yields f (m, w). Our construction is inspired by the functional encryption scheme by Garg et al. and we prove (selective) security assuming iO and statistically simulation-sound NIZK. We give a construction of the latter in bilinear groups and combining it with ElGamal encryption, our ciphertexts are of size 1.3 kB at a 128-bit security level and can be computed on a smart card.}, author = {Abusalah, Hamza M and Fuchsbauer, Georg and Pietrzak, Krzysztof Z}, location = {Guildford, UK}, pages = {285 -- 303}, publisher = {Springer}, title = {{Offline witness encryption}}, doi = {10.1007/978-3-319-39555-5_16}, volume = {9696}, year = {2016}, } @inproceedings{1236, abstract = {A constrained pseudorandom function F: K × X → Y for a family T ⊆ 2X of subsets of X is a function where for any key k ∈ K and set S ∈ T one can efficiently compute a constrained key kS which allows to evaluate F (k, ·) on all inputs x ∈ S, while even given this key, the outputs on all inputs x ∉ S look random. At Asiacrypt’13 Boneh and Waters gave a construction which supports the most general set family so far. Its keys kc are defined for sets decided by boolean circuits C and enable evaluation of the PRF on any x ∈ X where C(x) = 1. In their construction the PRF input length and the size of the circuits C for which constrained keys can be computed must be fixed beforehand during key generation. We construct a constrained PRF that has an unbounded input length and whose constrained keys can be defined for any set recognized by a Turing machine. The only a priori bound we make is on the description size of the machines. We prove our construction secure assuming publiccoin differing-input obfuscation. As applications of our constrained PRF we build a broadcast encryption scheme where the number of potential receivers need not be fixed at setup (in particular, the length of the keys is independent of the number of parties) and the first identity-based non-interactive key exchange protocol with no bound on the number of parties that can agree on a shared key.}, author = {Abusalah, Hamza M and Fuchsbauer, Georg and Pietrzak, Krzysztof Z}, location = {San Francisco, CA, USA}, pages = {413 -- 428}, publisher = {Springer}, title = {{Constrained PRFs for unbounded inputs}}, doi = {10.1007/978-3-319-29485-8_24}, volume = {9610}, year = {2016}, }