@inproceedings{1364,
abstract = {We present a computational method for designing wire sculptures consisting of interlocking wires. Our method allows the computation of aesthetically pleasing structures that are structurally stable, efficiently fabricatable with a 2D wire bending machine, and assemblable without the need of additional connectors. Starting from a set of planar contours provided by the user, our method automatically tests for the feasibility of a design, determines a discrete ordering of wires at intersection points, and optimizes for the rest shape of the individual wires to maximize structural stability under frictional contact. In addition to their application to art, wire sculptures present an extremely efficient and fast alternative for low-fidelity rapid prototyping because manufacturing time and required material linearly scales with the physical size of objects. We demonstrate the effectiveness of our approach on a varied set of examples, all of which we fabricated.},
author = {Miguel Villalba, Eder and Lepoutre, Mathias and Bickel, Bernd},
location = {Anaheim, CA, USA},
number = {4},
publisher = {ACM},
title = {{Computational design of stable planar-rod structures}},
doi = {10.1145/2897824.2925978},
volume = {35},
year = {2016},
}
@inproceedings{1365,
abstract = {A memory-hard function (MHF) f is equipped with a space cost σ and time cost τ parameter such that repeatedly computing fσ,τ on an application specific integrated circuit (ASIC) is not economically advantageous relative to a general purpose computer. Technically we would like that any (generalized) circuit for evaluating an iMHF fσ,τ has area × time (AT) complexity at Θ(σ2 ∗ τ). A data-independent MHF (iMHF) has the added property that it can be computed with almost optimal memory and time complexity by an algorithm which accesses memory in a pattern independent of the input value. Such functions can be specified by fixing a directed acyclic graph (DAG) G on n = Θ(σ ∗ τ) nodes representing its computation graph. In this work we develop new tools for analyzing iMHFs. First we define and motivate a new complexity measure capturing the amount of energy (i.e. electricity) required to compute a function. We argue that, in practice, this measure is at least as important as the more traditional AT-complexity. Next we describe an algorithm A for repeatedly evaluating an iMHF based on an arbitrary DAG G. We upperbound both its energy and AT complexities per instance evaluated in terms of a certain combinatorial property of G. Next we instantiate our attack for several general classes of DAGs which include those underlying many of the most important iMHF candidates in the literature. In particular, we obtain the following results which hold for all choices of parameters σ and τ (and thread-count) such that n = σ ∗ τ. -The Catena-Dragonfly function of [FLW13] has AT and energy complexities O(n1.67). -The Catena-Butterfly function of [FLW13] has complexities is O(n1.67). -The Double-Buffer and the Linear functions of [CGBS16] both have complexities in O(n1.67). -The Argon2i function of [BDK15] (winner of the Password Hashing Competition [PHC]) has complexities O(n7/4 log(n)). -The Single-Buffer function of [CGBS16] has complexities O(n7/4 log(n)). -Any iMHF can be computed by an algorithm with complexities O(n2/ log1 −ε(n)) for all ε > 0. In particular when τ = 1 this shows that the goal of constructing an iMHF with AT-complexity Θ(σ2 ∗ τ ) is unachievable. Along the way we prove a lemma upper-bounding the depth-robustness of any DAG which may prove to be of independent interest.},
author = {Alwen, Joel F and Blocki, Jeremiah},
location = {Santa Barbara, CA, USA},
pages = {241 -- 271},
publisher = {Springer},
title = {{Efficiently computing data-independent memory-hard functions}},
doi = {10.1007/978-3-662-53008-5_9},
volume = {9815},
year = {2016},
}
@inproceedings{1366,
abstract = {We study the problem of devising provably secure PRNGs with input based on the sponge paradigm. Such constructions are very appealing, as efficient software/hardware implementations of SHA-3 can easily be translated into a PRNG in a nearly black-box way. The only existing sponge-based construction, proposed by Bertoni et al. (CHES 2010), fails to achieve the security notion of robustness recently considered by Dodis et al. (CCS 2013), for two reasons: (1) The construction is deterministic, and thus there are high-entropy input distributions on which the construction fails to extract random bits, and (2) The construction is not forward secure, and presented solutions aiming at restoring forward security have not been rigorously analyzed. We propose a seeded variant of Bertoni et al.’s PRNG with input which we prove secure in the sense of robustness, delivering in particular concrete security bounds. On the way, we make what we believe to be an important conceptual contribution, developing a variant of the security framework of Dodis et al. tailored at the ideal permutation model that captures PRNG security in settings where the weakly random inputs are provided from a large class of possible adversarial samplers which are also allowed to query the random permutation. As a further application of our techniques, we also present an efficient sponge-based key-derivation function (which can be instantiated from SHA-3 in a black-box fashion), which we also prove secure when fed with samples from permutation-dependent distributions.},
author = {Gazi, Peter and Tessaro, Stefano},
location = {Vienna, Austria},
pages = {87 -- 116},
publisher = {Springer},
title = {{Provably robust sponge-based PRNGs and KDFs}},
doi = {10.1007/978-3-662-49890-3_4},
volume = {9665},
year = {2016},
}
@article{1368,
abstract = {Superconductivity in heavy-fermion systems has an unconventional nature and is considered to originate from the universal features of the electronic structure. Here, the Anderson lattice model is studied by means of the full variational Gutzwiller wave function incorporating nonlocal effects of the on-site interaction. We show that the d-wave superconducting ground state can be driven solely by interelectronic correlations. The proposed microscopic mechanism leads to a multigap superconductivity with the dominant contribution due to f electrons and in the dx2−y2-wave channel. Our results rationalize several important observations for CeCoIn5.},
author = {Wysokiński, Marcin and Kaczmarczyk, Jan and Spałek, Jozef},
journal = {Physical Review B - Condensed Matter and Materials Physics},
number = {2},
publisher = {American Physical Society},
title = {{Correlation driven d wave superconductivity in Anderson lattice model: Two gaps}},
doi = {10.1103/PhysRevB.94.024517},
volume = {94},
year = {2016},
}
@inproceedings{1369,
abstract = {We introduce a new loss function for the weakly-supervised training of semantic image segmentation models based on three guiding principles: to seed with weak localization cues, to expand objects based on the information about which classes can occur in an image, and to constrain the segmentations to coincide with object boundaries. We show experimentally that training a deep convolutional neural network using the proposed loss function leads to substantially better segmentations than previous state-of-the-art methods on the challenging PASCAL VOC 2012 dataset. We furthermore give insight into the working mechanism of our method by a detailed experimental study that illustrates how the segmentation quality is affected by each term of the proposed loss function as well as their combinations.},
author = {Kolesnikov, Alexander and Lampert, Christoph},
location = {Amsterdam, The Netherlands},
pages = {695 -- 711},
publisher = {Springer},
title = {{Seed, expand and constrain: Three principles for weakly-supervised image segmentation}},
doi = {10.1007/978-3-319-46493-0_42},
volume = {9908},
year = {2016},
}
@article{1370,
abstract = {We study coherent phonon oscillations and tunneling between two coupled nonlinear nanomechanical resonators. We show that the coupling between two nanomechanical resonators creates an effective phonon Josephson junction, which exhibits two different dynamical behaviors: Josephson oscillation (phonon-Rabi oscillation) and macroscopic self-trapping (phonon blockade). Self-trapping originates from mechanical nonlinearities, meaning that when the nonlinearity exceeds its critical value, the energy exchange between the two resonators is suppressed, and phonon Josephson oscillations between them are completely blocked. An effective classical Hamiltonian for the phonon Josephson junction is derived and its mean-field dynamics is studied in phase space. Finally, we study the phonon-phonon coherence quantified by the mean fringe visibility, and show that the interaction between the two resonators may lead to the loss of coherence in the phononic junction.},
author = {Barzanjeh, Shabir and Vitali, David},
journal = {Physical Review A - Atomic, Molecular, and Optical Physics},
number = {3},
publisher = {American Physical Society},
title = {{Phonon Josephson junction with nanomechanical resonators}},
doi = {10.1103/PhysRevA.93.033846},
volume = {93},
year = {2016},
}
@article{1371,
abstract = {Living cells can maintain their internal states, react to changing environments, grow, differentiate, divide, etc. All these processes are tightly controlled by what can be called a regulatory program. The logic of the underlying control can sometimes be guessed at by examining the network of influences amongst genetic components. Some associated gene regulatory networks have been studied in prokaryotes and eukaryotes, unveiling various structural features ranging from broad distributions of out-degrees to recurrent "motifs", that is small subgraphs having a specific pattern of interactions. To understand what factors may be driving such structuring, a number of groups have introduced frameworks to model the dynamics of gene regulatory networks. In that context, we review here such in silico approaches and show how selection for phenotypes, i.e., network function, can shape network structure.},
author = {Martin, Olivier and Krzywicki, André and Zagórski, Marcin P},
journal = {Physics of Life Reviews},
pages = {124 -- 158},
publisher = {Elsevier},
title = {{Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function}},
doi = {10.1016/j.plrev.2016.06.002},
volume = {17},
year = {2016},
}
@article{1372,
abstract = {Redirection of intercellular auxin fluxes via relocalization of the PIN-FORMED 3 (PIN3) and PIN7 auxin efflux carriers has been suggested to be necessary for the root gravitropic response. Cytokinins have also been proposed to play a role in controlling root gravitropism, but conclusive evidence is lacking. We present a detailed study of the dynamics of root bending early after gravistimulation, which revealed a delayed gravitropic response in transgenic lines with depleted endogenous cytokinins (Pro35S:AtCKX) and cytokinin signaling mutants. Pro35S:AtCKX lines, as well as a cytokinin receptor mutant ahk3, showed aberrations in the auxin response distribution in columella cells consistent with defects in the auxin transport machinery. Using in vivo real-time imaging of PIN3-GFP and PIN7-GFP in AtCKX3 overexpression and ahk3 backgrounds, we observed wild-type-like relocalization of PIN proteins in the columella early after gravistimulation, with gravity-induced relocalization of PIN7 faster than that of PIN3. Nonetheless, the cellular distribution of PIN3 and PIN7 and expression of PIN7 and the auxin influx carrier AUX1 was affected in AtCKX overexpression lines. Based on the retained cytokinin sensitivity in pin3 pin4 pin7 mutant, we propose the AUX1-mediated auxin transport rather than columella-located PIN proteins as a target of endogenous cytokinins in the control of root gravitropism.},
author = {Pernisová, Markéta and Prat, Tomas and Grones, Peter and Haruštiaková, Danka and Matonohova, Martina and Spíchal, Lukáš and Nodzyński, Tomasz and Friml, Jirí and Hejátko, Jan},
journal = {New Phytologist},
number = {2},
pages = {497 -- 509},
publisher = {Wiley-Blackwell},
title = {{Cytokinins influence root gravitropism via differential regulation of auxin transporter expression and localization in Arabidopsis}},
doi = {10.1111/nph.14049},
volume = {212},
year = {2016},
}
@article{1377,
abstract = {We consider the problem of minimizing the continuous valued total variation subject to different unary terms on trees and propose fast direct algorithms based on dynamic programming to solve these problems. We treat both the convex and the nonconvex case and derive worst-case complexities that are equal to or better than existing methods. We show applications to total variation based two dimensional image processing and computer vision problems based on a Lagrangian decomposition approach. The resulting algorithms are very effcient, offer a high degree of parallelism, and come along with memory requirements which are only in the order of the number of image pixels.},
author = {Kolmogorov, Vladimir and Pock, Thomas and Rolinek, Michal},
journal = {SIAM Journal on Imaging Sciences},
number = {2},
pages = {605 -- 636},
publisher = {Society for Industrial and Applied Mathematics },
title = {{Total variation on a tree}},
doi = {10.1137/15M1010257},
volume = {9},
year = {2016},
}
@inproceedings{1378,
abstract = {We give a detailed and easily accessible proof of Gromov's Topological Overlap Theorem. Let X be a finite simplicial complex or, more generally, a finite polyhedral cell complex of dimension d. Informally, the theorem states that if X has sufficiently strong higher-dimensional expansion properties (which generalize edge expansion of graphs and are defined in terms of cellular cochains of X) then X has the following topological overlap property: for every continuous map X → ℝd there exists a point p ∈ ℝd whose preimage intersects a positive fraction μ > 0 of the d-cells of X. More generally, the conclusion holds if ℝd is replaced by any d-dimensional piecewise-linear (PL) manifold M, with a constant μ that depends only on d and on the expansion properties of X, but not on M.},
author = {Dotterrer, Dominic and Kaufman, Tali and Wagner, Uli},
location = {Medford, MA, USA},
pages = {35.1 -- 35.10},
publisher = {Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing},
title = {{On expansion and topological overlap}},
doi = {10.4230/LIPIcs.SoCG.2016.35},
volume = {51},
year = {2016},
}