@inproceedings{18217, abstract = {A central challenge in building robotic prostheses is the creation of a sensor-based system able to read physiological signals from the lower limb and instruct a robotic hand to perform various tasks. Existing systems typically perform discrete gestures such as pointing or grasping, by employing electromyography (EMG) or ultrasound (US) technologies to analyze muscle states. While estimating finger gestures has been done in the past by detecting prominent gestures, we are interested in detection, or inference, done in the context of fine motions that evolve over time. Examples include motions occurring when performing fine and dexterous tasks such as keyboard typing or piano playing. We consider this task as an important step towards higher adoption rates of robotic prostheses among arm amputees, as it has the potential to dramatically increase functionality in performing daily tasks. To this end, we present an end-to-end robotic system, which can successfully infer fine finger motions. This is achieved by modeling the hand as a robotic manipulator and using it as an intermediate representation to encode muscles' dynamics from a sequence of US images. We evaluated our method by collecting data from a group of subjects and demonstrating how it can be used to replay music played or text typed. To the best of our knowledge, this is the first study demonstrating these downstream tasks within an end-to-end system.}, author = {Zadok, Dean and Salzman, Oren and Wolf, Alon and Bronstein, Alexander}, booktitle = {2023 IEEE International Conference on Robotics and Automation}, location = {London, United Kingdom}, publisher = {IEEE}, title = {{Towards predicting fine finger motions from ultrasound images via kinematic representation}}, doi = {10.1109/icra48891.2023.10160601}, volume = {27}, year = {2023}, } @inproceedings{18218, abstract = {Deep neural networks are known to be susceptible to adversarial perturbations – small perturbations that alter the output of the network and exist under strict norm limitations. While such perturbations are usually discussed as tailored to a specific input, a universal perturbation can be constructed to alter the model’s output on a set of inputs. Universal perturbations present a more realistic case of adversarial attacks, as awareness of the model’s exact input is not required. In addition, the universal attack setting raises the subject of generalization to unseen data, where given a set of inputs, the universal perturbations aim to alter the model’s output on out-of-sample data. In this work, we study physical passive patch adversarial attacks on visual odometry-based autonomous navigation systems. A visual odometry system aims to infer the relative camera motion between two corresponding viewpoints, and is frequently used by vision-based autonomous navigation systems to estimate their state. For such navigation systems, a patch adversarial perturbation poses a severe security issue, as it can be used to mislead a system onto some collision course. To the best of our knowledge, we show for the first time that the error margin of a visual odometry model can be significantly increased by deploying patch adversarial attacks in the scene. We provide evaluation on synthetic closed-loop drone navigation data and demonstrate that a comparable vulnerability exists in real data. A reference implementation of the proposed method and the reported experiments is provided at https://github.com/patchadversarialattacks/patchadversarialattacks.}, author = {Nemcovsky, Yaniv and Jacoby, Matan and Bronstein, Alexander and Baskin, Chaim}, booktitle = {16th Asian Conference on Computer Vision}, isbn = {9783031262920}, issn = {1611-3349}, location = {Macao, China}, pages = {518--534}, publisher = {Springer Nature}, title = {{Physical passive patch adversarial attacks on visual odometry systems}}, doi = {10.1007/978-3-031-26293-7_31}, volume = {13847}, year = {2023}, } @article{18219, abstract = {Nowadays, many of the images captured are ‘observed’ by machines only and not by humans, e.g., in autonomous systems. High-level machine vision models, such as object recognition or semantic segmentation, assume images are transformed into some canonical image space by the camera Image Signal Processor (ISP). However, the camera ISP is optimized for producing visually pleasing images for human observers and not for machines. Therefore, one may spare the ISP compute time and apply vision models directly to RAW images. Yet, it has been shown that training such models directly on RAW images results in a performance drop. To mitigate this drop, we use a RAW and RGB image pairs dataset, which can be easily acquired with no human labeling. We then train a model that is applied directly to the RAW data by using knowledge distillation such that the model predictions for RAW images will be aligned with the predictions of an off-the-shelf pre-trained model for processed RGB images. Our experiments show that our performance on RAW images for object classification and semantic segmentation is significantly better than models trained on labeled RAW images. It also reasonably matches the predictions of a pre-trained model on processed RGB images, while saving the ISP compute overhead.}, author = {Schwartz, Eli and Bronstein, Alexander and Giryes, Raja}, issn = {2644-1322}, journal = {IEEE Open Journal of Signal Processing}, pages = {12--20}, publisher = {Institute of Electrical and Electronics Engineers}, title = {{ISP Distillation}}, doi = {10.1109/ojsp.2023.3239819}, volume = {4}, year = {2023}, } @article{18621, abstract = {During neural development, cellular adhesion is crucial for interactions among and between neurons and surrounding tissues. This function is mediated by conserved cell adhesion molecules, which are tightly regulated to allow for coordinated neuronal outgrowth. Here, we show that the proprotein convertase KPC-1 (homolog of mammalian furin) regulates the Menorin adhesion complex during development of PVD dendritic arbors in Caenorhabditis elegans. We found a finely regulated antagonistic balance between PVD-expressed KPC-1 and the epidermally expressed putative cell adhesion molecule MNR-1 (Menorin). Genetically, partial loss of mnr-1 suppressed partial loss of kpc-1, and both loss of kpc-1 and transgenic overexpression of mnr-1 resulted in indistinguishable phenotypes in PVD dendrites. This balance regulated cell-surface localization of the DMA-1 leucine-rich transmembrane receptor in PVD neurons. Lastly, kpc-1 mutants showed increased amounts of MNR-1 and decreased amounts of muscle-derived LECT-2 (Chondromodulin II), which is also part of the Menorin adhesion complex. These observations suggest that KPC-1 in PVD neurons directly or indirectly controls the abundance of proteins of the Menorin adhesion complex from adjacent tissues, thereby providing negative feedback from the dendrite to the instructive cues of surrounding tissues.}, author = {Ramirez, Nelson and Belalcazar, Helen M. and Rahman, Maisha and Trivedi, Meera and Tang, Leo T. H. and Bülow, Hannes E.}, issn = {1477-9129}, journal = {Development}, number = {18}, publisher = {The Company of Biologists}, title = {{Convertase-dependent regulation of membrane-tethered and secreted ligands tunes dendrite adhesion}}, doi = {10.1242/dev.201208}, volume = {150}, year = {2023}, } @misc{18634, abstract = {There are 4 tar.xz files with the result of the model for the paper: A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen, Svalbard. }, author = {Muñoz Hermosilla, José M}, publisher = {Zenodo}, title = {{A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen}}, doi = {10.5281/ZENODO.8005257}, year = {2023}, } @article{12287, abstract = {We present criteria for establishing a triangulation of a manifold. Given a manifold M, a simplicial complex A, and a map H from the underlying space of A to M, our criteria are presented in local coordinate charts for M, and ensure that H is a homeomorphism. These criteria do not require a differentiable structure, or even an explicit metric on M. No Delaunay property of A is assumed. The result provides a triangulation guarantee for algorithms that construct a simplicial complex by working in local coordinate patches. Because the criteria are easily verified in such a setting, they are expected to be of general use.}, author = {Boissonnat, Jean-Daniel and Dyer, Ramsay and Ghosh, Arijit and Wintraecken, Mathijs}, issn = {1432-0444}, journal = {Discrete & Computational Geometry}, keywords = {Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Theoretical Computer Science}, pages = {156--191}, publisher = {Springer Nature}, title = {{Local criteria for triangulating general manifolds}}, doi = {10.1007/s00454-022-00431-7}, volume = {69}, year = {2023}, } @article{12313, abstract = {Let P be a nontorsion point on an elliptic curve defined over a number field K and consider the sequence {Bn}n∈N of the denominators of x(nP). We prove that every term of the sequence of the Bn has a primitive divisor for n greater than an effectively computable constant that we will explicitly compute. This constant will depend only on the model defining the curve.}, author = {Verzobio, Matteo}, issn = {0030-8730}, journal = {Pacific Journal of Mathematics}, number = {2}, pages = {331--351}, publisher = {Mathematical Sciences Publishers}, title = {{Some effectivity results for primitive divisors of elliptic divisibility sequences}}, doi = {10.2140/pjm.2023.325.331}, volume = {325}, year = {2023}, } @article{12329, abstract = {In this article, we develop two independent and new approaches to model epidemic spread in a network. Contrary to the most studied models, those developed here allow for contacts with different probabilities of transmitting the disease (transmissibilities). We then examine each of these models using some mean field type approximations. The first model looks at the late-stage effects of an epidemic outbreak and allows for the computation of the probability that a given vertex was infected. This computation is based on a mean field approximation and only depends on the number of contacts and their transmissibilities. This approach shares many similarities with percolation models in networks. The second model we develop is a dynamic model which we analyze using a mean field approximation which highly reduces the dimensionality of the system. In particular, the original system which individually analyses each vertex of the network is reduced to one with as many equations as different transmissibilities. Perhaps the greatest contribution of this article is the observation that, in both these models, the existence and size of an epidemic outbreak are linked to the properties of a matrix which we call the R-matrix. This is a generalization of the basic reproduction number which more precisely characterizes the main routes of infection.}, author = {Gómez, Arturo and Oliveira, Goncalo}, issn = {2045-2322}, journal = {Scientific Reports}, publisher = {Springer Nature}, title = {{New approaches to epidemic modeling on networks}}, doi = {10.1038/s41598-022-19827-9}, volume = {13}, year = {2023}, } @article{12330, abstract = {The design and implementation of efficient concurrent data structures has seen significant attention. However, most of this work has focused on concurrent data structures providing good worst-case guarantees, although, in real workloads, objects are often accessed at different rates. Efficient distribution-adaptive data structures, such as splay-trees, are known in the sequential case; however, they often are hard to translate efficiently to the concurrent case. We investigate distribution-adaptive concurrent data structures, and propose a new design called the splay-list. At a high level, the splay-list is similar to a standard skip-list, with the key distinction that the height of each element adapts dynamically to its access rate: popular elements “move up,” whereas rarely-accessed elements decrease in height. We show that the splay-list provides order-optimal amortized complexity bounds for a subset of operations, while being amenable to efficient concurrent implementation. Experiments show that the splay-list can leverage distribution-adaptivity for performance, and can outperform the only previously-known distribution-adaptive concurrent design in certain workloads.}, author = {Aksenov, Vitalii and Alistarh, Dan-Adrian and Drozdova, Alexandra and Mohtashami, Amirkeivan}, issn = {1432-0452}, journal = {Distributed Computing}, pages = {395--418}, publisher = {Springer Nature}, title = {{The splay-list: A distribution-adaptive concurrent skip-list}}, doi = {10.1007/s00446-022-00441-x}, volume = {36}, year = {2023}, } @article{12331, abstract = {High carrier mobility is critical to improving thermoelectric performance over a broad temperature range. However, traditional doping inevitably deteriorates carrier mobility. Herein, we develop a strategy for fine tuning of defects to improve carrier mobility. To begin, n-type PbTe is created by compensating for the intrinsic Pb vacancy in bare PbTe. Excess Pb2+ reduces vacancy scattering, resulting in a high carrier mobility of ∼3400 cm2 V–1 s–1. Then, excess Ag is introduced to compensate for the remaining intrinsic Pb vacancies. We find that excess Ag exhibits a dynamic doping process with increasing temperatures, increasing both the carrier concentration and carrier mobility throughout a wide temperature range; specifically, an ultrahigh carrier mobility ∼7300 cm2 V–1 s–1 is obtained for Pb1.01Te + 0.002Ag at 300 K. Moreover, the dynamic doping-induced high carrier concentration suppresses the bipolar thermal conductivity at high temperatures. The final step is using iodine to optimize the carrier concentration to ∼1019 cm–3. Ultimately, a maximum ZT value of ∼1.5 and a large average ZTave value of ∼1.0 at 300–773 K are obtained for Pb1.01Te0.998I0.002 + 0.002Ag. These findings demonstrate that fine tuning of defects with <0.5% impurities can remarkably enhance carrier mobility and improve thermoelectric performance.}, author = {Wang, Siqi and Chang, Cheng and Bai, Shulin and Qin, Bingchao and Zhu, Yingcai and Zhan, Shaoping and Zheng, Junqing and Tang, Shuwei and Zhao, Li Dong}, issn = {1520-5002}, journal = {Chemistry of Materials}, number = {2}, pages = {755--763}, publisher = {American Chemical Society}, title = {{Fine tuning of defects enables high carrier mobility and enhanced thermoelectric performance of n-type PbTe}}, doi = {10.1021/acs.chemmater.2c03542}, volume = {35}, year = {2023}, } @article{12406, abstract = {Let X be a sufficiently large positive integer. We prove that one may choose a subset S of primes with cardinality O(logX) such that a positive proportion of integers less than X can be represented by x2+py2 for at least one p∈S.}, author = {Diao, Yijie}, issn = {1730-6264}, journal = {Acta Arithmetica}, keywords = {Algebra, Number Theory}, pages = {1--17}, publisher = {Instytut Matematyczny}, title = {{Density of the union of positive diagonal binary quadratic forms}}, doi = {10.4064/aa210830-24-11}, volume = {207}, year = {2023}, } @misc{12407, abstract = {As the complexity and criticality of software increase every year, so does the importance of run-time monitoring. Third-party monitoring, with limited knowledge of the monitored software, and best-effort monitoring, which keeps pace with the monitored software, are especially valuable, yet underexplored areas of run-time monitoring. Most existing monitoring frameworks do not support their combination because they either require access to the monitored code for instrumentation purposes or the processing of all observed events, or both. We present a middleware framework, VAMOS, for the run-time monitoring of software which is explicitly designed to support third-party and best-effort scenarios. The design goals of VAMOS are (i) efficiency (keeping pace at low overhead), (ii) flexibility (the ability to monitor black-box code through a variety of different event channels, and the connectability to monitors written in different specification languages), and (iii) ease-of-use. To achieve its goals, VAMOS combines aspects of event broker and event recognition systems with aspects of stream processing systems. We implemented a prototype toolchain for VAMOS and conducted experiments including a case study of monitoring for data races. The results indicate that VAMOS enables writing useful yet efficient monitors, is compatible with a variety of event sources and monitor specifications, and simplifies key aspects of setting up a monitoring system from scratch.}, author = {Chalupa, Marek and Mühlböck, Fabian and Muroya Lei, Stefanie and Henzinger, Thomas A}, issn = {2664-1690}, keywords = {runtime monitoring, best effort, third party}, pages = {38}, publisher = {Institute of Science and Technology Austria}, title = {{VAMOS: Middleware for Best-Effort Third-Party Monitoring}}, doi = {10.15479/AT:ISTA:12407}, year = {2023}, } @article{12421, abstract = {The actin cytoskeleton plays a key role in cell migration and cellular morphodynamics in most eukaryotes. The ability of the actin cytoskeleton to assemble and disassemble in a spatiotemporally controlled manner allows it to form higher-order structures, which can generate forces required for a cell to explore and navigate through its environment. It is regulated not only via a complex synergistic and competitive interplay between actin-binding proteins (ABP), but also by filament biochemistry and filament geometry. The lack of structural insights into how geometry and ABPs regulate the actin cytoskeleton limits our understanding of the molecular mechanisms that define actin cytoskeleton remodeling and, in turn, impact emerging cell migration characteristics. With the advent of cryo-electron microscopy (cryo-EM) and advanced computational methods, it is now possible to define these molecular mechanisms involving actin and its interactors at both atomic and ultra-structural levels in vitro and in cellulo. In this review, we will provide an overview of the available cryo-EM methods, applicable to further our understanding of the actin cytoskeleton, specifically in the context of cell migration. We will discuss how these methods have been employed to elucidate ABP- and geometry-defined regulatory mechanisms in initiating, maintaining, and disassembling cellular actin networks in migratory protrusions.}, author = {Fäßler, Florian and Javoor, Manjunath and Schur, Florian KM}, issn = {1470-8752}, journal = {Biochemical Society Transactions}, keywords = {Biochemistry}, number = {1}, pages = {87--99}, publisher = {Portland Press}, title = {{Deciphering the molecular mechanisms of actin cytoskeleton regulation in cell migration using cryo-EM}}, doi = {10.1042/bst20220221}, volume = {51}, year = {2023}, } @article{12427, abstract = {Let k be a number field and X a smooth, geometrically integral quasi-projective variety over k. For any linear algebraic group G over k and any G-torsor g : Z → X, we observe that if the étale-Brauer obstruction is the only one for strong approximation off a finite set of places S for all twists of Z by elements in H^1(k, G), then the étale-Brauer obstruction is the only one for strong approximation off a finite set of places S for X. As an application, we show that any homogeneous space of the form G/H with G a connected linear algebraic group over k satisfies strong approximation off the infinite places with étale-Brauer obstruction, under some compactness assumptions when k is totally real. We also prove more refined strong approximation results for homogeneous spaces of the form G/H with G semisimple simply connected and H finite, using the theory of torsors and descent.}, author = {Balestrieri, Francesca}, issn = {1088-6826}, journal = {Proceedings of the American Mathematical Society}, number = {3}, pages = {907--914}, publisher = {American Mathematical Society}, title = {{Some remarks on strong approximation and applications to homogeneous spaces of linear algebraic groups}}, doi = {10.1090/proc/15239}, volume = {151}, year = {2023}, } @inbook{12428, abstract = {The mammary gland consists of a bilayered epithelial structure with an extensively branched morphology. The majority of this epithelial tree is laid down during puberty, during which actively proliferating terminal end buds repeatedly elongate and bifurcate to form the basic structure of the ductal tree. Mammary ducts consist of a basal and luminal cell layer with a multitude of identified sub-lineages within both layers. The understanding of how these different cell lineages are cooperatively driving branching morphogenesis is a problem of crossing multiple scales, as this requires information on the macroscopic branched structure of the gland, as well as data on single-cell dynamics driving the morphogenic program. Here we describe a method to combine genetic lineage tracing with whole-gland branching analysis. Quantitative data on the global organ structure can be used to derive a model for mammary gland branching morphogenesis and provide a backbone on which the dynamics of individual cell lineages can be simulated and compared to lineage-tracing approaches. Eventually, these quantitative models and experiments allow to understand the couplings between the macroscopic shape of the mammary gland and the underlying single-cell dynamics driving branching morphogenesis.}, author = {Hannezo, Edouard B and Scheele, Colinda L.G.J.}, booktitle = {Cell Migration in Three Dimensions}, editor = {Margadant, Coert}, isbn = {9781071628867}, issn = {1940-6029}, pages = {183--205}, publisher = {Springer Nature}, title = {{A Guide Toward Multi-scale and Quantitative Branching Analysis in the Mammary Gland}}, doi = {10.1007/978-1-0716-2887-4_12}, volume = {2608}, year = {2023}, } @article{12429, abstract = {In this paper, we consider traces at initial times for functions with mixed time-space smoothness. Such results are often needed in the theory of evolution equations. Our result extends and unifies many previous results. Our main improvement is that we can allow general interpolation couples. The abstract results are applied to regularity problems for fractional evolution equations and stochastic evolution equations, where uniform trace estimates on the half-line are shown.}, author = {Agresti, Antonio and Lindemulder, Nick and Veraar, Mark}, issn = {1522-2616}, journal = {Mathematische Nachrichten}, number = {4}, pages = {1319--1350}, publisher = {Wiley}, title = {{On the trace embedding and its applications to evolution equations}}, doi = {10.1002/mana.202100192}, volume = {296}, year = {2023}, } @article{12430, abstract = {We study the time evolution of the Nelson model in a mean-field limit in which N nonrelativistic bosons weakly couple (with respect to the particle number) to a positive or zero mass quantized scalar field. Our main result is the derivation of the Bogoliubov dynamics and higher-order corrections. More precisely, we prove the convergence of the approximate wave function to the many-body wave function in norm, with a convergence rate proportional to the number of corrections taken into account in the approximation. We prove an analogous result for the unitary propagator. As an application, we derive a simple system of partial differential equations describing the time evolution of the first- and second-order approximations to the one-particle reduced density matrices of the particles and the quantum field, respectively.}, author = {Falconi, Marco and Leopold, Nikolai K and Mitrouskas, David Johannes and Petrat, Sören P}, issn = {0129-055X}, journal = {Reviews in Mathematical Physics}, number = {4}, publisher = {World Scientific Publishing}, title = {{Bogoliubov dynamics and higher-order corrections for the regularized Nelson model}}, doi = {10.1142/S0129055X2350006X}, volume = {35}, year = {2023}, } @inproceedings{12467, abstract = {Safety and liveness are elementary concepts of computation, and the foundation of many verification paradigms. The safety-liveness classification of boolean properties characterizes whether a given property can be falsified by observing a finite prefix of an infinite computation trace (always for safety, never for liveness). In quantitative specification and verification, properties assign not truth values, but quantitative values to infinite traces (e.g., a cost, or the distance to a boolean property). We introduce quantitative safety and liveness, and we prove that our definitions induce conservative quantitative generalizations of both (1)~the safety-progress hierarchy of boolean properties and (2)~the safety-liveness decomposition of boolean properties. In particular, we show that every quantitative property can be written as the pointwise minimum of a quantitative safety property and a quantitative liveness property. Consequently, like boolean properties, also quantitative properties can be min-decomposed into safety and liveness parts, or alternatively, max-decomposed into co-safety and co-liveness parts. Moreover, quantitative properties can be approximated naturally. We prove that every quantitative property that has both safe and co-safe approximations can be monitored arbitrarily precisely by a monitor that uses only a finite number of states.}, author = {Henzinger, Thomas A and Mazzocchi, Nicolas Adrien and Sarac, Naci E}, booktitle = {26th International Conference Foundations of Software Science and Computation Structures}, isbn = {9783031308284}, issn = {1611-3349}, location = {Paris, France}, pages = {349--370}, publisher = {Springer Nature}, title = {{Quantitative safety and liveness}}, doi = {10.1007/978-3-031-30829-1_17}, volume = {13992}, year = {2023}, } @article{12469, abstract = {Hosts can carry many viruses in their bodies, but not all of them cause disease. We studied ants as a social host to determine both their overall viral repertoire and the subset of actively infecting viruses across natural populations of three subfamilies: the Argentine ant (Linepithema humile, Dolichoderinae), the invasive garden ant (Lasius neglectus, Formicinae) and the red ant (Myrmica rubra, Myrmicinae). We used a dual sequencing strategy to reconstruct complete virus genomes by RNA-seq and to simultaneously determine the small interfering RNAs (siRNAs) by small RNA sequencing (sRNA-seq), which constitute the host antiviral RNAi immune response. This approach led to the discovery of 41 novel viruses in ants and revealed a host ant-specific RNAi response (21 vs. 22 nt siRNAs) in the different ant species. The efficiency of the RNAi response (sRNA/RNA read count ratio) depended on the virus and the respective ant species, but not its population. Overall, we found the highest virus abundance and diversity per population in Li. humile, followed by La. neglectus and M. rubra. Argentine ants also shared a high proportion of viruses between populations, whilst overlap was nearly absent in M. rubra. Only one of the 59 viruses was found to infect two of the ant species as hosts, revealing high host-specificity in active infections. In contrast, six viruses actively infected one ant species, but were found as contaminants only in the others. Disentangling spillover of disease-causing infection from non-infecting contamination across species is providing relevant information for disease ecology and ecosystem management.}, author = {Viljakainen, Lumi and Fürst, Matthias and Grasse, Anna V and Jurvansuu, Jaana and Oh, Jinook and Tolonen, Lassi and Eder, Thomas and Rattei, Thomas and Cremer, Sylvia}, issn = {1664-302X}, journal = {Frontiers in Microbiology}, publisher = {Frontiers}, title = {{Antiviral immune response reveals host-specific virus infections in natural ant populations}}, doi = {10.3389/fmicb.2023.1119002}, volume = {14}, year = {2023}, } @article{12478, abstract = {In Gram negative bacteria, the multiple antibiotic resistance or mar operon, is known to control the expression of multi-drug efflux genes that protect bacteria from a wide range of drugs. As many different chemical compounds can induce this operon, identifying the parameters that govern the dynamics of its induction is crucial to better characterize the processes of tolerance and resistance. Most experiments have assumed that the properties of the mar transcriptional network can be inferred from population measurements. However, measurements from an asynchronous population of cells can mask underlying phenotypic variations of single cells. We monitored the activity of the mar promoter in single Escherichia coli cells in linear micro-colonies and established that the response to a steady level of inducer was most heterogeneous within individual colonies for an intermediate value of inducer. Specifically, sub-lineages defined by contiguous daughter-cells exhibited similar promoter activity, whereas activity was greatly variable between different sub-lineages. Specific sub-trees of uniform promoter activity persisted over several generations. Statistical analyses of the lineages suggest that the presence of these sub-trees is the signature of an inducible memory of the promoter state that is transmitted from mother to daughter cells. This single-cell study reveals that the degree of epigenetic inheritance changes as a function of inducer concentration, suggesting that phenotypic inheritance may be an inducible phenotype.}, author = {Guet, Calin C and Bruneaux, L and Oikonomou, P and Aldana, M and Cluzel, P}, issn = {1664-302X}, journal = {Frontiers in Microbiology}, publisher = {Frontiers}, title = {{Monitoring lineages of growing and dividing bacteria reveals an inducible memory of mar operon expression}}, doi = {10.3389/fmicb.2023.1049255}, volume = {14}, year = {2023}, }