@inproceedings{10052, abstract = {A deterministic finite automaton (DFA) 𝒜 is composite if its language L(𝒜) can be decomposed into an intersection ⋂_{i = 1}^k L(𝒜_i) of languages of smaller DFAs. Otherwise, 𝒜 is prime. This notion of primality was introduced by Kupferman and Mosheiff in 2013, and while they proved that we can decide whether a DFA is composite, the precise complexity of this problem is still open, with a doubly-exponential gap between the upper and lower bounds. In this work, we focus on permutation DFAs, i.e., those for which the transition monoid is a group. We provide an NP algorithm to decide whether a permutation DFA is composite, and show that the difficulty of this problem comes from the number of non-accepting states of the instance: we give a fixed-parameter tractable algorithm with the number of rejecting states as the parameter. Moreover, we investigate the class of commutative permutation DFAs. Their structural properties allow us to decide compositionality in NL, and even in LOGSPACE if the alphabet size is fixed. Despite this low complexity, we show that complex behaviors still arise in this class: we provide a family of composite DFAs each requiring polynomially many factors with respect to its size. We also consider the variant of the problem that asks whether a DFA is k-factor composite, that is, decomposable into k smaller DFAs, for some given integer k ∈ ℕ. We show that, for commutative permutation DFAs, restricting the number of factors makes the decision computationally harder, and yields a problem with tight bounds: it is NP-complete. Finally, we show that in general, this problem is in PSPACE, and it is in LOGSPACE for DFAs with a singleton alphabet.}, author = {Jecker, Ismael R and Mazzocchi, Nicolas and Wolf, Petra}, booktitle = {32nd International Conference on Concurrency Theory}, isbn = {978-3-9597-7203-7}, issn = {1868-8969}, location = {Paris, France}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Decomposing permutation automata}}, doi = {10.4230/LIPIcs.CONCUR.2021.18}, volume = {203}, year = {2021}, } @inproceedings{10053, abstract = {This paper characterizes the latency of the simplified successive-cancellation (SSC) decoding scheme for polar codes under hardware resource constraints. In particular, when the number of processing elements P that can perform SSC decoding operations in parallel is limited, as is the case in practice, the latency of SSC decoding is O(N1−1 μ+NPlog2log2NP), where N is the block length of the code and μ is the scaling exponent of polar codes for the channel. Three direct consequences of this bound are presented. First, in a fully-parallel implementation where P=N2 , the latency of SSC decoding is O(N1−1/μ) , which is sublinear in the block length. This recovers a result from an earlier work. Second, in a fully-serial implementation where P=1 , the latency of SSC decoding scales as O(Nlog2log2N) . The multiplicative constant is also calculated: we show that the latency of SSC decoding when P=1 is given by (2+o(1))Nlog2log2N . Third, in a semi-parallel implementation, the smallest P that gives the same latency as that of the fully-parallel implementation is P=N1/μ . The tightness of our bound on SSC decoding latency and the applicability of the foregoing results is validated through extensive simulations.}, author = {Hashemi, Seyyed Ali and Mondelli, Marco and Fazeli, Arman and Vardy, Alexander and Cioffi, John and Goldsmith, Andrea}, booktitle = {2021 IEEE International Symposium on Information Theory}, isbn = {978-1-5386-8210-4}, issn = {2157-8095}, location = {Melbourne, Australia}, pages = {2369--2374}, publisher = {Institute of Electrical and Electronics Engineers}, title = {{Parallelism versus latency in simplified successive-cancellation decoding of polar codes}}, doi = {10.1109/ISIT45174.2021.9518153}, year = {2021}, } @inproceedings{10054, abstract = {Graphs and games on graphs are fundamental models for the analysis of reactive systems, in particular, for model-checking and the synthesis of reactive systems. The class of ω-regular languages provides a robust specification formalism for the desired properties of reactive systems. In the classical infinitary formulation of the liveness part of an ω-regular specification, a "good" event must happen eventually without any bound between the good events. A stronger notion of liveness is bounded liveness, which requires that good events happen within d transitions. Given a graph or a game graph with n vertices, m edges, and a bounded liveness objective, the previous best-known algorithmic bounds are as follows: (i) O(dm) for graphs, which in the worst-case is O(n³); and (ii) O(n² d²) for games on graphs. Our main contributions improve these long-standing algorithmic bounds. For graphs we present: (i) a randomized algorithm with one-sided error with running time O(n^{2.5} log n) for the bounded liveness objectives; and (ii) a deterministic linear-time algorithm for the complement of bounded liveness objectives. For games on graphs, we present an O(n² d) time algorithm for the bounded liveness objectives.}, author = {Chatterjee, Krishnendu and Henzinger, Monika H and Kale, Sagar Sudhir and Svozil, Alexander}, booktitle = {48th International Colloquium on Automata, Languages, and Programming}, isbn = {978-3-95977-195-5}, issn = {1868-8969}, location = {Glasgow, Scotland}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Faster algorithms for bounded liveness in graphs and game graphs}}, doi = {10.4230/LIPIcs.ICALP.2021.124}, volume = {198}, year = {2021}, } @inproceedings{10055, abstract = {Repeated idempotent elements are commonly used to characterise iterable behaviours in abstract models of computation. Therefore, given a monoid M, it is natural to ask how long a sequence of elements of M needs to be to ensure the presence of consecutive idempotent factors. This question is formalised through the notion of the Ramsey function R_M associated to M, obtained by mapping every k ∈ ℕ to the minimal integer R_M(k) such that every word u ∈ M^* of length R_M(k) contains k consecutive non-empty factors that correspond to the same idempotent element of M. In this work, we study the behaviour of the Ramsey function R_M by investigating the regular 𝒟-length of M, defined as the largest size L(M) of a submonoid of M isomorphic to the set of natural numbers {1,2, …, L(M)} equipped with the max operation. We show that the regular 𝒟-length of M determines the degree of R_M, by proving that k^L(M) ≤ R_M(k) ≤ (k|M|⁴)^L(M). To allow applications of this result, we provide the value of the regular 𝒟-length of diverse monoids. In particular, we prove that the full monoid of n × n Boolean matrices, which is used to express transition monoids of non-deterministic automata, has a regular 𝒟-length of (n²+n+2)/2.}, author = {Jecker, Ismael R}, booktitle = {38th International Symposium on Theoretical Aspects of Computer Science}, isbn = {978-3-9597-7180-1}, issn = {1868-8969}, location = {Saarbrücken, Germany}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{A Ramsey theorem for finite monoids}}, doi = {10.4230/LIPIcs.STACS.2021.44}, volume = {187}, year = {2021}, } @article{10069, abstract = {The extent to which women differ in the course of blood cell counts throughout pregnancy, and the importance of these changes to pregnancy outcomes has not been well defined. Here, we develop a series of statistical analyses of repeated measures data to reveal the degree to which women differ in the course of pregnancy, predict the changes that occur, and determine the importance of these changes for post-partum hemorrhage (PPH) which is one of the leading causes of maternal mortality. We present a prospective cohort of 4082 births recorded at the University Hospital, Lausanne, Switzerland between 2009 and 2014 where full labour records could be obtained, along with complete blood count data taken at hospital admission. We find significant differences, at a [Formula: see text] level, among women in how blood count values change through pregnancy for mean corpuscular hemoglobin, mean corpuscular volume, mean platelet volume, platelet count and red cell distribution width. We find evidence that almost all complete blood count values show trimester-specific associations with PPH. For example, high platelet count (OR 1.20, 95% CI 1.01-1.53), high mean platelet volume (OR 1.58, 95% CI 1.04-2.08), and high erythrocyte levels (OR 1.36, 95% CI 1.01-1.57) in trimester 1 increased PPH, but high values in trimester 3 decreased PPH risk (OR 0.85, 0.79, 0.67 respectively). We show that differences among women in the course of blood cell counts throughout pregnancy have an important role in shaping pregnancy outcome and tracking blood count value changes through pregnancy improves identification of women at increased risk of postpartum hemorrhage. This study provides greater understanding of the complex changes in blood count values that occur through pregnancy and provides indicators to guide the stratification of patients into risk groups.}, author = {Robinson, Matthew Richard and Patxot, Marion and Stojanov, Miloš and Blum, Sabine and Baud, David}, issn = {2045-2322}, journal = {Scientific Reports}, publisher = {Springer Nature}, title = {{Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy}}, doi = {10.1038/s41598-021-98411-z}, volume = {11}, year = {2021}, } @article{10070, abstract = {We extensively discuss the Rademacher and Sobolev-to-Lipschitz properties for generalized intrinsic distances on strongly local Dirichlet spaces possibly without square field operator. We present many non-smooth and infinite-dimensional examples. As an application, we prove the integral Varadhan short-time asymptotic with respect to a given distance function for a large class of strongly local Dirichlet forms.}, author = {Dello Schiavo, Lorenzo and Suzuki, Kohei}, issn = {1096-0783}, journal = {Journal of Functional Analysis}, number = {11}, publisher = {Elsevier}, title = {{Rademacher-type theorems and Sobolev-to-Lipschitz properties for strongly local Dirichlet spaces}}, doi = {10.1016/j.jfa.2021.109234}, volume = {281}, year = {2021}, } @article{10071, author = {Adams, Henry and Kourimska, Hana and Heiss, Teresa and Percival, Sarah and Ziegelmeier, Lori}, issn = {1088-9477}, journal = {Notices of the American Mathematical Society}, number = {9}, pages = {1511--1514}, publisher = {American Mathematical Society}, title = {{How to tutorial-a-thon}}, doi = {10.1090/noti2349}, volume = {68}, year = {2021}, } @inproceedings{10072, abstract = {The Lovász Local Lemma (LLL) is a powerful tool in probabilistic combinatorics which can be used to establish the existence of objects that satisfy certain properties. The breakthrough paper of Moser and Tardos and follow-up works revealed that the LLL has intimate connections with a class of stochastic local search algorithms for finding such desirable objects. In particular, it can be seen as a sufficient condition for this type of algorithms to converge fast. Besides conditions for existence of and fast convergence to desirable objects, one may naturally ask further questions regarding properties of these algorithms. For instance, "are they parallelizable?", "how many solutions can they output?", "what is the expected "weight" of a solution?", etc. These questions and more have been answered for a class of LLL-inspired algorithms called commutative. In this paper we introduce a new, very natural and more general notion of commutativity (essentially matrix commutativity) which allows us to show a number of new refined properties of LLL-inspired local search algorithms with significantly simpler proofs.}, author = {Harris, David G. and Iliopoulos, Fotis and Kolmogorov, Vladimir}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques}, isbn = {978-3-9597-7207-5}, issn = {1868-8969}, location = {Virtual}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{A new notion of commutativity for the algorithmic Lovász Local Lemma}}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.31}, volume = {207}, year = {2021}, } @article{10073, abstract = {Thermoelectric materials enable the direct conversion between heat and electricity. SnTe is a promising candidate due to its high charge transport performance. Here, we prepared SnTe nanocomposites by employing an aqueous method to synthetize SnTe nanoparticles (NP), followed by a unique surface treatment prior NP consolidation. This synthetic approach allowed optimizing the charge and phonon transport synergistically. The novelty of this strategy was the use of a soluble PbS molecular complex prepared using a thiol-amine solvent mixture that upon blending is adsorbed on the SnTe NP surface. Upon consolidation with spark plasma sintering, SnTe-PbS nanocomposite is formed. The presence of PbS complexes significantly compensates for the Sn vacancy and increases the average grain size of the nanocomposite, thus improving the carrier mobility. Moreover, lattice thermal conductivity is also reduced by the Pb and S-induced mass and strain fluctuation. As a result, an enhanced ZT of ca. 0.8 is reached at 873 K. Our finding provides a novel strategy to conduct rational surface treatment on NP-based thermoelectrics.}, author = {Chang, Cheng and Ibáñez, Maria}, issn = {1996-1944}, journal = {Materials}, number = {18}, publisher = {MDPI}, title = {{Enhanced thermoelectric performance by surface engineering in SnTe-PbS nanocomposites}}, doi = {10.3390/ma14185416}, volume = {14}, year = {2021}, } @inproceedings{10075, abstract = {We study the expressiveness and succinctness of good-for-games pushdown automata (GFG-PDA) over finite words, that is, pushdown automata whose nondeterminism can be resolved based on the run constructed so far, but independently of the remainder of the input word. We prove that GFG-PDA recognise more languages than deterministic PDA (DPDA) but not all context-free languages (CFL). This class is orthogonal to unambiguous CFL. We further show that GFG-PDA can be exponentially more succinct than DPDA, while PDA can be double-exponentially more succinct than GFG-PDA. We also study GFGness in visibly pushdown automata (VPA), which enjoy better closure properties than PDA, and for which we show GFGness to be ExpTime-complete. GFG-VPA can be exponentially more succinct than deterministic VPA, while VPA can be exponentially more succinct than GFG-VPA. Both of these lower bounds are tight. Finally, we study the complexity of resolving nondeterminism in GFG-PDA. Every GFG-PDA has a positional resolver, a function that resolves nondeterminism and that is only dependant on the current configuration. Pushdown transducers are sufficient to implement the resolvers of GFG-VPA, but not those of GFG-PDA. GFG-PDA with finite-state resolvers are determinisable.}, author = {Guha, Shibashis and Jecker, Ismael R and Lehtinen, Karoliina and Zimmermann, Martin}, booktitle = {46th International Symposium on Mathematical Foundations of Computer Science}, isbn = {978-3-9597-7201-3}, issn = {1868-8969}, location = {Tallinn, Estonia}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{A bit of nondeterminism makes pushdown automata expressive and succinct}}, doi = {10.4230/LIPIcs.MFCS.2021.53}, volume = {202}, year = {2021}, } @inproceedings{10076, abstract = {We present a novel approach for blockchain asset owners to reclaim their funds in case of accidental private-key loss or transfer to a mistyped address. Our solution can be deployed upon failure or absence of proactively implemented backup mechanisms, such as secret sharing and cold storage. The main advantages against previous proposals is it does not require any prior action from users and works with both single-key and multi-sig accounts. We achieve this by a 3-phase Commit()→Reveal()→Claim()−or−Challenge() smart contract that enables accessing funds of addresses for which the spending key is not available. We provide an analysis of the threat and incentive models and formalize the concept of reactive KEy-Loss Protection (KELP).}, author = {Blackshear, Sam and Chalkias, Konstantinos and Chatzigiannis, Panagiotis and Faizullabhoy, Riyaz and Khaburzaniya, Irakliy and Kokoris Kogias, Eleftherios and Lind, Joshua and Wong, David and Zakian, Tim}, booktitle = {FC 2021 Workshops}, isbn = {978-3-6626-3957-3}, issn = {1611-3349}, location = {Virtual}, pages = {431--450}, publisher = {Springer Nature}, title = {{Reactive key-loss protection in blockchains}}, doi = {10.1007/978-3-662-63958-0_34}, volume = {12676 }, year = {2021}, } @unpublished{10080, abstract = {Hippocampal and neocortical neural activity is modulated by the position of the individual in space. While hippocampal neurons provide the basis for a spatial map, prefrontal cortical neurons generalize over environmental features. Whether these generalized representations result from a bidirectional interaction with, or are mainly derived from hippocampal spatial representations is not known. By examining simultaneously recorded hippocampal and medial prefrontal neurons, we observed that prefrontal spatial representations show a delayed coherence with hippocampal ones. We also identified subpopulations of cells in the hippocampus and medial prefrontal cortex that formed functional cross-area couplings; these resembled the optimal connections predicted by a probabilistic model of spatial information transfer and generalization. Moreover, cross-area couplings were strongest and had the shortest delay preceding spatial decision-making. Our results suggest that generalized spatial coding in the medial prefrontal cortex is inherited from spatial representations in the hippocampus, and that the routing of information can change dynamically with behavioral demands.}, author = {Nardin, Michele and Käfer, Karola and Csicsvari, Jozsef L}, booktitle = {bioRxiv}, publisher = {Cold Spring Harbor Laboratory}, title = {{The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus}}, doi = {10.1101/2021.09.30.462269}, year = {2021}, } @article{10103, abstract = {The small cellular molecule inositol hexakisphosphate (IP6) has been known for ~20 years to promote the in vitro assembly of HIV-1 into immature virus-like particles. However, the molecular details underlying this effect have been determined only recently, with the identification of the IP6 binding site in the immature Gag lattice. IP6 also promotes formation of the mature capsid protein (CA) lattice via a second IP6 binding site, and enhances core stability, creating a favorable environment for reverse transcription. IP6 also enhances assembly of other retroviruses, from both the Lentivirus and the Alpharetrovirus genera. These findings suggest that IP6 may have a conserved function throughout the family Retroviridae. Here, we discuss the different steps in the viral life cycle that are influenced by IP6, and describe in detail how IP6 interacts with the immature and mature lattices of different retroviruses.}, author = {Obr, Martin and Schur, Florian KM and Dick, Robert A.}, issn = {1999-4915}, journal = {Viruses}, keywords = {virology, infectious diseases}, number = {9}, publisher = {MDPI}, title = {{A structural perspective of the role of IP6 in immature and mature retroviral assembly}}, doi = {10.3390/v13091853}, volume = {13}, year = {2021}, } @inproceedings{10108, abstract = {We argue that the time is ripe to investigate differential monitoring, in which the specification of a program's behavior is implicitly given by a second program implementing the same informal specification. Similar ideas have been proposed before, and are currently implemented in restricted form for testing and specialized run-time analyses, aspects of which we combine. We discuss the challenges of implementing differential monitoring as a general-purpose, black-box run-time monitoring framework, and present promising results of a preliminary implementation, showing low monitoring overheads for diverse programs.}, author = {Mühlböck, Fabian and Henzinger, Thomas A}, booktitle = {International Conference on Runtime Verification}, isbn = {978-3-030-88493-2}, issn = {1611-3349}, keywords = {run-time verification, software engineering, implicit specification}, location = {Virtual}, pages = {231--243}, publisher = {Springer Nature}, title = {{Differential monitoring}}, doi = {10.1007/978-3-030-88494-9_12}, volume = {12974}, year = {2021}, } @article{10116, abstract = {The ubiquitous Ca2+ sensor calmodulin (CaM) binds and regulates many proteins, including ion channels, CaM kinases, and calcineurin, according to Ca2+-CaM levels. What regulates neuronal CaM levels, is, however, unclear. CaM-binding transcription activators (CAMTAs) are ancient proteins expressed broadly in nervous systems and whose loss confers pleiotropic behavioral defects in flies, mice, and humans. Using Caenorhabditis elegans and Drosophila, we show that CAMTAs control neuronal CaM levels. The behavioral and neuronal Ca2+ signaling defects in mutants lacking camt-1, the sole C. elegans CAMTA, can be rescued by supplementing neuronal CaM. CAMT-1 binds multiple sites in the CaM promoter and deleting these sites phenocopies camt-1. Our data suggest CAMTAs mediate a conserved and general mechanism that controls neuronal CaM levels, thereby regulating Ca2+ signaling, physiology, and behavior.}, author = {Vuong-Brender, Thanh and Flynn, Sean and Vallis, Yvonne and De Bono, Mario}, issn = {2050-084X}, journal = {eLife}, publisher = {eLife Sciences Publications}, title = {{Neuronal calmodulin levels are controlled by CAMTA transcription factors}}, doi = {10.7554/eLife.68238}, volume = {10}, year = {2021}, } @article{10117, abstract = {Proximity labeling provides a powerful in vivo tool to characterize the proteome of subcellular structures and the interactome of specific proteins. The nematode Caenorhabditis elegans is one of the most intensely studied organisms in biology, offering many advantages for biochemistry. Using the highly active biotin ligase TurboID, we optimize here a proximity labeling protocol for C. elegans. An advantage of TurboID is that biotin's high affinity for streptavidin means biotin-labeled proteins can be affinity-purified under harsh denaturing conditions. By combining extensive sonication with aggressive denaturation using SDS and urea, we achieved near-complete solubilization of worm proteins. We then used this protocol to characterize the proteomes of the worm gut, muscle, skin, and nervous system. Neurons are among the smallest C. elegans cells. To probe the method's sensitivity, we expressed TurboID exclusively in the two AFD neurons and showed that the protocol could identify known and previously unknown proteins expressed selectively in AFD. The active zones of synapses are composed of a protein matrix that is difficult to solubilize and purify. To test if our protocol could solubilize active zone proteins, we knocked TurboID into the endogenous elks-1 gene, which encodes a presynaptic active zone protein. We identified many known ELKS-1-interacting active zone proteins, as well as previously uncharacterized synaptic proteins. Versatile vectors and the inherent advantages of using C. elegans, including fast growth and the ability to rapidly make and functionally test knock-ins, make proximity labeling a valuable addition to the armory of this model organism.}, author = {Artan, Murat and Barratt, Stephen and Flynn, Sean M. and Begum, Farida and Skehel, Mark and Nicolas, Armel and De Bono, Mario}, issn = {1083-351X}, journal = {Journal of Biological Chemistry}, number = {3}, publisher = {Elsevier}, title = {{Interactome analysis of Caenorhabditis elegans synapses by TurboID-based proximity labeling}}, doi = {10.1016/J.JBC.2021.101094}, volume = {297}, year = {2021}, } @article{10134, abstract = {We investigate the effect of coupling between translational and internal degrees of freedom of composite quantum particles on their localization in a random potential. We show that entanglement between the two degrees of freedom weakens localization due to the upper bound imposed on the inverse participation ratio by purity of a quantum state. We perform numerical calculations for a two-particle system bound by a harmonic force in a 1D disordered lattice and a rigid rotor in a 2D disordered lattice. We illustrate that the coupling has a dramatic effect on localization properties, even with a small number of internal states participating in quantum dynamics.}, author = {Suzuki, Fumika and Lemeshko, Mikhail and Zurek, Wojciech H. and Krems, Roman V.}, issn = {1079-7114}, journal = {Physical Review Letters}, keywords = {General Physics and Astronomy}, number = {16}, publisher = {American Physical Society }, title = {{Anderson localization of composite particles}}, doi = {10.1103/physrevlett.127.160602}, volume = {127}, year = {2021}, } @article{10146, abstract = {The enzymes of the mitochondrial electron transport chain are key players of cell metabolism. Despite being active when isolated, in vivo they associate into supercomplexes1, whose precise role is debated. Supercomplexes CIII2CIV1-2 (refs. 2,3), CICIII2 (ref. 4) and CICIII2CIV (respirasome)5,6,7,8,9,10 exist in mammals, but in contrast to CICIII2 and the respirasome, to date the only known eukaryotic structures of CIII2CIV1-2 come from Saccharomyces cerevisiae11,12 and plants13, which have different organization. Here we present the first, to our knowledge, structures of mammalian (mouse and ovine) CIII2CIV and its assembly intermediates, in different conformations. We describe the assembly of CIII2CIV from the CIII2 precursor to the final CIII2CIV conformation, driven by the insertion of the N terminus of the assembly factor SCAF1 (ref. 14) deep into CIII2, while its C terminus is integrated into CIV. Our structures (which include CICIII2 and the respirasome) also confirm that SCAF1 is exclusively required for the assembly of CIII2CIV and has no role in the assembly of the respirasome. We show that CIII2 is asymmetric due to the presence of only one copy of subunit 9, which straddles both monomers and prevents the attachment of a second copy of SCAF1 to CIII2, explaining the presence of one copy of CIV in CIII2CIV in mammals. Finally, we show that CIII2 and CIV gain catalytic advantage when assembled into the supercomplex and propose a role for CIII2CIV in fine tuning the efficiency of electron transfer in the electron transport chain.}, author = {Vercellino, Irene and Sazanov, Leonid A}, issn = {1476-4687}, journal = {Nature}, number = {7880}, pages = {364--367}, publisher = {Springer Nature}, title = {{Structure and assembly of the mammalian mitochondrial supercomplex CIII2CIV}}, doi = {10.1038/s41586-021-03927-z}, volume = {598}, year = {2021}, } @inproceedings{10148, abstract = {Tactile feedback of an object’s surface enables us to discern its material properties and affordances. This understanding is used in digital fabrication processes by creating objects with high-resolution surface variations to influence a user’s tactile perception. As the design of such surface haptics commonly relies on knowledge from real-life experiences, it is unclear how to adapt this information for digital design methods. In this work, we investigate replicating the haptics of real materials. Using an existing process for capturing an object’s microgeometry, we digitize and reproduce the stable surface information of a set of 15 fabric samples. In a psychophysical experiment, we evaluate the tactile qualities of our set of original samples and their replicas. From our results, we see that direct reproduction of surface variations is able to influence different psychophysical dimensions of the tactile perception of surface textures. While the fabrication process did not preserve all properties, our approach underlines that replication of surface microgeometries benefits fabrication methods in terms of haptic perception by covering a large range of tactile variations. Moreover, by changing the surface structure of a single fabricated material, its material perception can be influenced. We conclude by proposing strategies for capturing and reproducing digitized textures to better resemble the perceived haptics of the originals.}, author = {Degraen, Donald and Piovarci, Michael and Bickel, Bernd and Kruger, Antonio}, booktitle = {34th Annual ACM Symposium}, isbn = {978-1-4503-8635-7}, location = {Virtual}, pages = {954--971}, publisher = {Association for Computing Machinery}, title = {{Capturing tactile properties of real surfaces for haptic reproduction}}, doi = {10.1145/3472749.3474798}, year = {2021}, } @article{10153, abstract = {Gradual typing is a principled means for mixing typed and untyped code. But typed and untyped code often exhibit different programming patterns. There is already substantial research investigating gradually giving types to code exhibiting typical untyped patterns, and some research investigating gradually removing types from code exhibiting typical typed patterns. This paper investigates how to extend these established gradual-typing concepts to give formal guarantees not only about how to change types as code evolves but also about how to change such programming patterns as well. In particular, we explore mixing untyped "structural" code with typed "nominal" code in an object-oriented language. But whereas previous work only allowed "nominal" objects to be treated as "structural" objects, we also allow "structural" objects to dynamically acquire certain nominal types, namely interfaces. We present a calculus that supports such "cross-paradigm" code migration and interoperation in a manner satisfying both the static and dynamic gradual guarantees, and demonstrate that the calculus can be implemented efficiently.}, author = {Mühlböck, Fabian and Tate, Ross}, issn = {2475-1421}, journal = {Proceedings of the ACM on Programming Languages}, keywords = {gradual typing, gradual guarantee, nominal, structural, call tags}, location = {Chicago, IL, United States}, publisher = {Association for Computing Machinery}, title = {{Transitioning from structural to nominal code with efficient gradual typing}}, doi = {10.1145/3485504}, volume = {5}, year = {2021}, }