@article{1521, abstract = {Complex I (NADH:ubiquinone oxidoreductase) plays a central role in cellular energy production, coupling electron transfer between NADH and quinone to proton translocation. It is the largest protein assembly of respiratory chains and one of the most elaborate redox membrane proteins known. Bacterial enzyme is about half the size of mitochondrial and thus provides its important "minimal" model. Dysfunction of mitochondrial complex I is implicated in many human neurodegenerative diseases. The L-shaped complex consists of a hydrophilic arm, where electron transfer occurs, and a membrane arm, where proton translocation takes place. We have solved the crystal structures of the hydrophilic domain of complex I from Thermus thermophilus, the membrane domain from Escherichia coli and recently of the intact, entire complex I from T. thermophilus (536. kDa, 16 subunits, 9 iron-sulphur clusters, 64 transmembrane helices). The 95. Å long electron transfer pathway through the enzyme proceeds from the primary electron acceptor flavin mononucleotide through seven conserved Fe-S clusters to the unusual elongated quinone-binding site at the interface with the membrane domain. Four putative proton translocation channels are found in the membrane domain, all linked by the central flexible axis containing charged residues. The redox energy of electron transfer is coupled to proton translocation by the as yet undefined mechanism proposed to involve long-range conformational changes. This article is part of a Special Issue entitled Respiratory complex I, edited by Volker Zickermann and Ulrich Brandt.}, author = {Berrisford, John and Baradaran, Rozbeh and Sazanov, Leonid A}, journal = {Biochimica et Biophysica Acta - Bioenergetics}, number = {7}, pages = {892 -- 901}, publisher = {Elsevier}, title = {{Structure of bacterial respiratory complex I}}, doi = {10.1016/j.bbabio.2016.01.012}, volume = {1857}, year = {2016}, } @article{1522, abstract = {We classify smooth Brunnian (i.e., unknotted on both components) embeddings (S2 × S1) ⊔ S3 → ℝ6. Any Brunnian embedding (S2 × S1) ⊔ S3 → ℝ6 is isotopic to an explicitly constructed embedding fk,m,n for some integers k, m, n such that m ≡ n (mod 2). Two embeddings fk,m,n and fk′ ,m′,n′ are isotopic if and only if k = k′, m ≡ m′ (mod 2k) and n ≡ n′ (mod 2k). We use Haefliger’s classification of embeddings S3 ⊔ S3 → ℝ6 in our proof. The relation between the embeddings (S2 × S1) ⊔ S3 → ℝ6 and S3 ⊔ S3 → ℝ6 is not trivial, however. For example, we show that there exist embeddings f: (S2 ×S1) ⊔ S3 → ℝ6 and g, g′ : S3 ⊔ S3 → ℝ6 such that the componentwise embedded connected sum f # g is isotopic to f # g′ but g is not isotopic to g′.}, author = {Avvakumov, Serhii}, issn = {1609-4514}, journal = {Moscow Mathematical Journal}, number = {1}, pages = {1 -- 25}, publisher = {Independent University of Moscow}, title = {{The classification of certain linked 3-manifolds in 6-space}}, doi = {10.17323/1609-4514-2016-16-1-1-25}, volume = {16}, year = {2016}, } @article{1523, abstract = {For random graphs, the containment problem considers the probability that a binomial random graph G(n, p) contains a given graph as a substructure. When asking for the graph as a topological minor, i.e., for a copy of a subdivision of the given graph, it is well known that the (sharp) threshold is at p = 1/n. We consider a natural analogue of this question for higher-dimensional random complexes Xk(n, p), first studied by Cohen, Costa, Farber and Kappeler for k = 2. Improving previous results, we show that p = Θ(1/ √n) is the (coarse) threshold for containing a subdivision of any fixed complete 2-complex. For higher dimensions k > 2, we get that p = O(n−1/k) is an upper bound for the threshold probability of containing a subdivision of a fixed k-dimensional complex.}, author = {Gundert, Anna and Wagner, Uli}, journal = {Proceedings of the American Mathematical Society}, number = {4}, pages = {1815 -- 1828}, publisher = {American Mathematical Society}, title = {{On topological minors in random simplicial complexes}}, doi = {10.1090/proc/12824}, volume = {144}, year = {2016}, } @inproceedings{1524, abstract = {When designing genetic circuits, the typical primitives used in major existing modelling formalisms are gene interaction graphs, where edges between genes denote either an activation or inhibition relation. However, when designing experiments, it is important to be precise about the low-level mechanistic details as to how each such relation is implemented. The rule-based modelling language Kappa allows to unambiguously specify mechanistic details such as DNA binding sites, dimerisation of transcription factors, or co-operative interactions. Such a detailed description comes with complexity and computationally costly executions. We propose a general method for automatically transforming a rule-based program, by eliminating intermediate species and adjusting the rate constants accordingly. To the best of our knowledge, we show the first automated reduction of rule-based models based on equilibrium approximations. Our algorithm is an adaptation of an existing algorithm, which was designed for reducing reaction-based programs; our version of the algorithm scans the rule-based Kappa model in search for those interaction patterns known to be amenable to equilibrium approximations (e.g. Michaelis-Menten scheme). Additional checks are then performed in order to verify if the reduction is meaningful in the context of the full model. The reduced model is efficiently obtained by static inspection over the rule-set. The tool is tested on a detailed rule-based model of a λ-phage switch, which lists 92 rules and 13 agents. The reduced model has 11 rules and 5 agents, and provides a dramatic reduction in simulation time of several orders of magnitude.}, author = {Beica, Andreea and Guet, Calin C and Petrov, Tatjana}, location = {Madrid, Spain}, pages = {173 -- 191}, publisher = {Springer}, title = {{Efficient reduction of kappa models by static inspection of the rule-set}}, doi = {10.1007/978-3-319-26916-0_10}, volume = {9271}, year = {2016}, } @inproceedings{1526, abstract = {We present the first study of robustness of systems that are both timed as well as reactive (I/O). We study the behavior of such timed I/O systems in the presence of uncertain inputs and formalize their robustness using the analytic notion of Lipschitz continuity: a timed I/O system is K-(Lipschitz) robust if the perturbation in its output is at most K times the perturbation in its input. We quantify input and output perturbation using similarity functions over timed words such as the timed version of the Manhattan distance and the Skorokhod distance. We consider two models of timed I/O systems — timed transducers and asynchronous sequential circuits. We show that K-robustness of timed transducers can be decided in polynomial space under certain conditions. For asynchronous sequential circuits, we reduce K-robustness w.r.t. timed Manhattan distances to K-robustness of discrete letter-to-letter transducers and show PSpace-completeness of the problem.}, author = {Henzinger, Thomas A and Otop, Jan and Samanta, Roopsha}, location = {St. Petersburg, FL, USA}, pages = {250 -- 267}, publisher = {Springer}, title = {{Lipschitz robustness of timed I/O systems}}, doi = {10.1007/978-3-662-49122-5_12}, volume = {9583}, year = {2016}, } @article{1529, abstract = {We consider partially observable Markov decision processes (POMDPs) with a set of target states and an integer cost associated with every transition. The optimization objective we study asks to minimize the expected total cost of reaching a state in the target set, while ensuring that the target set is reached almost surely (with probability 1). We show that for integer costs approximating the optimal cost is undecidable. For positive costs, our results are as follows: (i) we establish matching lower and upper bounds for the optimal cost, both double exponential in the POMDP state space size; (ii) we show that the problem of approximating the optimal cost is decidable and present approximation algorithms developing on the existing algorithms for POMDPs with finite-horizon objectives. While the worst-case running time of our algorithm is double exponential, we also present efficient stopping criteria for the algorithm and show experimentally that it performs well in many examples of interest.}, author = {Chatterjee, Krishnendu and Chmelik, Martin and Gupta, Raghav and Kanodia, Ayush}, journal = {Artificial Intelligence}, pages = {26 -- 48}, publisher = {Elsevier}, title = {{Optimal cost almost-sure reachability in POMDPs}}, doi = {10.1016/j.artint.2016.01.007}, volume = {234}, year = {2016}, } @article{1545, abstract = {We provide general conditions for which bosonic quadratic Hamiltonians on Fock spaces can be diagonalized by Bogoliubov transformations. Our results cover the case when quantum systems have infinite degrees of freedom and the associated one-body kinetic and paring operators are unbounded. Our sufficient conditions are optimal in the sense that they become necessary when the relevant one-body operators commute.}, author = {Nam, Phan and Napiórkowski, Marcin M and Solovej, Jan}, journal = {Journal of Functional Analysis}, number = {11}, pages = {4340 -- 4368}, publisher = {Academic Press}, title = {{Diagonalization of bosonic quadratic Hamiltonians by Bogoliubov transformations}}, doi = {10.1016/j.jfa.2015.12.007}, volume = {270}, year = {2016}, } @article{1552, abstract = {Antibiotic resistance carries a fitness cost that must be overcome in order for resistance to persist over the long term. Compensatory mutations that recover the functional defects associated with resistance mutations have been argued to play a key role in overcoming the cost of resistance, but compensatory mutations are expected to be rare relative to generally beneficial mutations that increase fitness, irrespective of antibiotic resistance. Given this asymmetry, population genetics theory predicts that populations should adapt by compensatory mutations when the cost of resistance is large, whereas generally beneficial mutations should drive adaptation when the cost of resistance is small. We tested this prediction by determining the genomic mechanisms underpinning adaptation to antibiotic-free conditions in populations of the pathogenic bacterium Pseudomonas aeruginosa that carry costly antibiotic resistance mutations. Whole-genome sequencing revealed that populations founded by high-cost rifampicin-resistant mutants adapted via compensatory mutations in three genes of the RNA polymerase core enzyme, whereas populations founded by low-cost mutants adapted by generally beneficial mutations, predominantly in the quorum-sensing transcriptional regulator gene lasR. Even though the importance of compensatory evolution in maintaining resistance has been widely recognized, our study shows that the roles of general adaptation in maintaining resistance should not be underestimated and highlights the need to understand how selection at other sites in the genome influences the dynamics of resistance alleles in clinical settings.}, author = {Qi, Qin and Toll Riera, Macarena and Heilbron, Karl and Preston, Gail and Maclean, R Craig}, journal = {Proceedings of the Royal Society of London Series B Biological Sciences}, number = {1822}, publisher = {Royal Society, The}, title = {{The genomic basis of adaptation to the fitness cost of rifampicin resistance in Pseudomonas aeruginosa}}, doi = {10.1098/rspb.2015.2452}, volume = {283}, year = {2016}, } @article{1592, abstract = {A modular approach to constructing cryptographic protocols leads to simple designs but often inefficient instantiations. On the other hand, ad hoc constructions may yield efficient protocols at the cost of losing conceptual simplicity. We suggest a new design paradigm, structure-preserving cryptography, that provides a way to construct modular protocols with reasonable efficiency while retaining conceptual simplicity. A cryptographic scheme over a bilinear group is called structure-preserving if its public inputs and outputs consist of elements from the bilinear groups and their consistency can be verified by evaluating pairing-product equations. As structure-preserving schemes smoothly interoperate with each other, they are useful as building blocks in modular design of cryptographic applications. This paper introduces structure-preserving commitment and signature schemes over bilinear groups with several desirable properties. The commitment schemes include homomorphic, trapdoor and length-reducing commitments to group elements, and the structure-preserving signature schemes are the first ones that yield constant-size signatures on multiple group elements. A structure-preserving signature scheme is called automorphic if the public keys lie in the message space, which cannot be achieved by compressing inputs via a cryptographic hash function, as this would destroy the mathematical structure we are trying to preserve. Automorphic signatures can be used for building certification chains underlying privacy-preserving protocols. Among a vast number of applications of structure-preserving protocols, we present an efficient round-optimal blind-signature scheme and a group signature scheme with an efficient and concurrently secure protocol for enrolling new members.}, author = {Abe, Masayuki and Fuchsbauer, Georg and Groth, Jens and Haralambiev, Kristiyan and Ohkubo, Miyako}, journal = {Journal of Cryptology}, number = {2}, pages = {363 -- 421}, publisher = {Springer}, title = {{Structure preserving signatures and commitments to group elements}}, doi = {10.1007/s00145-014-9196-7}, volume = {29}, year = {2016}, } @article{1597, abstract = {Chemokines are the main guidance cues directing leukocyte migration. Opposed to early assumptions, chemokines do not necessarily act as soluble cues but are often immobilized within tissues, e.g., dendritic cell migration toward lymphatic vessels is guided by a haptotactic gradient of the chemokine CCL21. Controlled assay systems to quantitatively study haptotaxis in vitro are still missing. In this chapter, we describe an in vitro haptotaxis assay optimized for the unique properties of dendritic cells. The chemokine CCL21 is immobilized in a bioactive state, using laser-assisted protein adsorption by photobleaching. The cells follow this immobilized CCL21 gradient in a haptotaxis chamber, which provides three dimensionally confined migration conditions.}, author = {Schwarz, Jan and Sixt, Michael K}, journal = {Methods in Enzymology}, pages = {567 -- 581}, publisher = {Elsevier}, title = {{Quantitative analysis of dendritic cell haptotaxis}}, doi = {10.1016/bs.mie.2015.11.004}, volume = {570}, year = {2016}, } @article{1599, abstract = {The addition of polysialic acid to N- and/or O-linked glycans, referred to as polysialylation, is a rare posttranslational modification that is mainly known to control the developmental plasticity of the nervous system. Here we show that CCR7, the central chemokine receptor controlling immune cell trafficking to secondary lymphatic organs, carries polysialic acid. This modification is essential for the recognition of the CCR7 ligand CCL21. As a consequence, dendritic cell trafficking is abrogated in polysialyltransferase-deficient mice, manifesting as disturbed lymph node homeostasis and unresponsiveness to inflammatory stimuli. Structure-function analysis of chemokine-receptor interactions reveals that CCL21 adopts an autoinhibited conformation, which is released upon interaction with polysialic acid. Thus, we describe a glycosylation-mediated immune cell trafficking disorder and its mechanistic basis. }, author = {Kiermaier, Eva and Moussion, Christine and Veldkamp, Christopher and Gerardy Schahn, Rita and De Vries, Ingrid and Williams, Larry and Chaffee, Gary and Phillips, Andrew and Freiberger, Friedrich and Imre, Richard and Taleski, Deni and Payne, Richard and Braun, Asolina and Förster, Reinhold and Mechtler, Karl and Mühlenhoff, Martina and Volkman, Brian and Sixt, Michael K}, journal = {Science}, number = {6269}, pages = {186 -- 190}, publisher = {American Association for the Advancement of Science}, title = {{Polysialylation controls dendritic cell trafficking by regulating chemokine recognition}}, doi = {10.1126/science.aad0512}, volume = {351}, year = {2016}, } @article{1608, abstract = {We show that the Anderson model has a transition from localization to delocalization at exactly 2 dimensional growth rate on antitrees with normalized edge weights which are certain discrete graphs. The kinetic part has a one-dimensional structure allowing a description through transfer matrices which involve some Schur complement. For such operators we introduce the notion of having one propagating channel and extend theorems from the theory of one-dimensional Jacobi operators that relate the behavior of transfer matrices with the spectrum. These theorems are then applied to the considered model. In essence, in a certain energy region the kinetic part averages the random potentials along shells and the transfer matrices behave similar as for a one-dimensional operator with random potential of decaying variance. At d dimensional growth for d>2 this effective decay is strong enough to obtain absolutely continuous spectrum, whereas for some uniform d dimensional growth with d<2 one has pure point spectrum in this energy region. At exactly uniform 2 dimensional growth also some singular continuous spectrum appears, at least at small disorder. As a corollary we also obtain a change from singular spectrum (d≤2) to absolutely continuous spectrum (d≥3) for random operators of the type rΔdr+λ on ℤd, where r is an orthogonal radial projection, Δd the discrete adjacency operator (Laplacian) on ℤd and λ a random potential. }, author = {Sadel, Christian}, journal = {Annales Henri Poincare}, number = {7}, pages = {1631 -- 1675}, publisher = {Birkhäuser}, title = {{Anderson transition at 2 dimensional growth rate on antitrees and spectral theory for operators with one propagating channel}}, doi = {10.1007/s00023-015-0456-3}, volume = {17}, year = {2016}, } @article{1612, abstract = {We prove that whenever A is a 3-conservative relational structure with only binary and unary relations,then the algebra of polymorphisms of A either has no Taylor operation (i.e.,CSP(A)is NP-complete),or it generates an SD(∧) variety (i.e.,CSP(A)has bounded width).}, author = {Kazda, Alexandr}, journal = {Algebra Universalis}, number = {1}, pages = {75 -- 84}, publisher = {Springer}, title = {{CSP for binary conservative relational structures}}, doi = {10.1007/s00012-015-0358-8}, volume = {75}, year = {2016}, } @article{1613, abstract = {In the last decade, induced pluripotent stem (iPS) cells have revolutionized the utility of human in vitro models of neurological disease. The iPS-derived and differentiated cells allow researchers to study the impact of a distinct cell type in health and disease as well as performing therapeutic drug screens on a human genetic background. In particular, clinical trials for Alzheimer's disease (AD) have been often failing. Two of the potential reasons are first, the species gap involved in proceeding from initial discoveries in rodent models to human studies, and second, an unsatisfying patient stratification, meaning subgrouping patients based on the disease severity due to the lack of phenotypic and genetic markers. iPS cells overcome this obstacles and will improve our understanding of disease subtypes in AD. They allow researchers conducting in depth characterization of neural cells from both familial and sporadic AD patients as well as preclinical screens on human cells. In this review, we briefly outline the status quo of iPS cell research in neurological diseases along with the general advantages and pitfalls of these models. We summarize how genome-editing techniques such as CRISPR/Cas will allow researchers to reduce the problem of genomic variability inherent to human studies, followed by recent iPS cell studies relevant to AD. We then focus on current techniques for the differentiation of iPS cells into neural cell types that are relevant to AD research. Finally, we discuss how the generation of three-dimensional cell culture systems will be important for understanding AD phenotypes in a complex cellular milieu, and how both two- and three-dimensional iPS cell models can provide platforms for drug discovery and translational studies into the treatment of AD.}, author = {Mungenast, Alison and Siegert, Sandra and Tsai, Li}, journal = {Molecular and Cellular Neuroscience}, pages = {13 -- 31}, publisher = {Academic Press}, title = {{Modeling Alzheimer's disease with human induced pluripotent stem (iPS) cells}}, doi = {doi:10.1016/j.mcn.2015.11.010}, volume = {73}, year = {2016}, } @article{1306, abstract = {Resolving patterns of synaptic connectivity in neural circuits currently requires serial section electron microscopy. However, complete circuit reconstruction is prohibitively slow and may not be necessary for many purposes such as comparing neuronal structure and connectivity among multiple animals. Here, we present an alternative strategy, targeted reconstruction of specific neuronal types. We used viral vectors to deliver peroxidase derivatives, which catalyze production of an electron-dense tracer, to genetically identify neurons, and developed a protocol that enhances the electron-density of the labeled cells while retaining the quality of the ultrastructure. The high contrast of the marked neurons enabled two innovations that speed data acquisition: targeted high-resolution reimaging of regions selected from rapidly-acquired lower resolution reconstruction, and an unsupervised segmentation algorithm. This pipeline reduces imaging and reconstruction times by two orders of magnitude, facilitating directed inquiry of circuit motifs.}, author = {Maximilian Jösch and Mankus, David and Yamagata, Masahito and Shahbazi, Ali and Schalek, Richard L and Suissa-Peleg, Adi and Meister, Markus and Lichtman, Jeff W and Scheirer, Walter J and Sanes, Joshua R}, journal = {eLife}, number = {2016JULY}, publisher = {eLife Sciences Publications}, title = {{Reconstruction of genetically identified neurons imaged by serial-section electron microscopy}}, doi = {10.7554/eLife.15015}, volume = {5}, year = {2016}, } @article{1315, abstract = {We prove optimal second order convergence of a modified lowest-order Brezzi-Douglas-Marini (BDM1) mixed finite element scheme for advection-diffusion problems in divergence form. If advection is present, it is known that the total flux is approximated only with first-order accuracy by the classical BDM1 mixed method, which is suboptimal since the same order of convergence is obtained if the computationally less expensive Raviart-Thomas (RT0) element is used. The modification that was first proposed by Brunner et al. [Adv. Water Res., 35 (2012),pp. 163-171] is based on the hybrid problem formulation and consists in using the Lagrange multipliers for the discretization of the advective term instead of the cellwise constant approximation of the scalar unknown.}, author = {Brunner, Fabian and Julian Fischer and Knabner, Peter}, journal = {SIAM Journal on Numerical Analysis}, number = {4}, pages = {2359 -- 2378}, publisher = {Society for Industrial and Applied Mathematics }, title = {{Analysis of a modified second-order mixed hybrid BDM1 finite element method for transport problems in divergence form}}, doi = {10.1137/15M1035379}, volume = {54}, year = {2016}, } @article{1317, abstract = {We analyze the behaviour of free boundaries in thin-film flow in the regime of strong slippage n∈[1,2) and in the regime of very weak slippage n∈,3) qualitatively and quantitatively. In the regime of strong slippage, we construct initial data which are bounded from above by the steady state but for which nevertheless instantaneous forward motion of the free boundary occurs. This shows that the initial behaviour of the free boundary is not determined just by the growth of the initial data at the free boundary. Note that this is a new phenomenon for degenerate parabolic equations which is specific for higher-order equations. Furthermore, this result resolves a controversy in the literature over optimality of sufficient conditions for the occurrence of a waiting time phenomenon. In contrast, in the regime of very weak slippage we derive lower bounds on free boundary propagation which are optimal in the sense that they coincide up to a constant factor with the known upper bounds. In particular, in this regime the growth of the initial data at the free boundary fully determines the initial behaviour of the interface.}, author = {Julian Fischer}, journal = {Annales de l'Institut Henri Poincare (C) Non Linear Analysis}, number = {5}, pages = {1301 -- 1327}, publisher = {Elsevier}, title = {{Behaviour of free boundaries in thin-film flow: The regime of strong slippage and the regime of very weak slippage}}, doi = {10.1016/j.anihpc.2015.05.001}, volume = {33}, year = {2016}, } @article{1318, abstract = {We develop a large-scale regularity theory of higher order for divergence-form elliptic equations with heterogeneous coefficient fields a in the context of stochastic homogenization. The large-scale regularity of a-harmonic functions is encoded by Liouville principles: The space of a-harmonic functions that grow at most like a polynomial of degree k has the same dimension as in the constant-coefficient case. This result can be seen as the qualitative side of a large-scale Ck,α-regularity theory, which in the present work is developed in the form of a corresponding Ck,α-“excess decay” estimate: For a given a-harmonic function u on a ball BR, its energy distance on some ball Br to the above space of a-harmonic functions that grow at most like a polynomial of degree k has the natural decay in the radius r above some minimal radius r0. Though motivated by stochastic homogenization, the contribution of this paper is of purely deterministic nature: We work under the assumption that for the given realization a of the coefficient field, the couple (φ, σ) of scalar and vector potentials of the harmonic coordinates, where φ is the usual corrector, grows sublinearly in a mildly quantified way. We then construct “kth-order correctors” and thereby the space of a-harmonic functions that grow at most like a polynomial of degree k, establish the above excess decay, and then the corresponding Liouville principle.}, author = {Julian Fischer and Otto, Felix}, journal = {Communications in Partial Differential Equations}, number = {7}, pages = {1108 -- 1148}, publisher = {Taylor & Francis}, title = {{A higher-order large scale regularity theory for random elliptic operators}}, doi = {10.1080/03605302.2016.1179318}, volume = {41}, year = {2016}, } @inproceedings{1319, abstract = {We present a novel optimization-based algorithm for the design and fabrication of customized, deformable input devices, capable of continuously sensing their deformation. We propose to embed piezoresistive sensing elements into flexible 3D printed objects. These sensing elements are then utilized to recover rich and natural user interactions at runtime. Designing such objects is a challenging and hard problem if attempted manually for all but the simplest geometries and deformations. Our method simultaneously optimizes the internal routing of the sensing elements and computes a mapping from low-level sensor readings to user-specified outputs in order to minimize reconstruction error. We demonstrate the power and flexibility of the approach by designing and fabricating a set of flexible input devices. Our results indicate that the optimization-based design greatly outperforms manual routings in terms of reconstruction accuracy and thus interaction fidelity.}, author = {Bächer, Moritz and Hepp, Benjamin and Pece, Fabrizio and Kry, Paul and Bickel, Bernd and Thomaszewski, Bernhard and Hilliges, Otmar}, location = {San Jose, California, USA}, pages = {3806 -- 3816}, publisher = {ACM}, title = {{DefSense: computational design of customized deformable input devices}}, doi = {10.1145/2858036.2858354}, year = {2016}, } @inproceedings{1320, abstract = {In recent years, several biomolecular systems have been shown to be scale-invariant (SI), i.e. to show the same output dynamics when exposed to geometrically scaled input signals (u → pu, p > 0) after pre-adaptation to accordingly scaled constant inputs. In this article, we show that SI systems-as well as systems invariant with respect to other input transformations-can realize nonlinear differential operators: when excited by inputs obeying functional forms characteristic for a given class of invariant systems, the systems' outputs converge to constant values directly quantifying the speed of the input.}, author = {Lang, Moritz and Sontag, Eduardo}, location = {Boston, MA, USA}, publisher = {IEEE}, title = {{Scale-invariant systems realize nonlinear differential operators}}, doi = {10.1109/ACC.2016.7526722}, volume = {2016-July}, year = {2016}, }