@unpublished{8547, abstract = {The cerebral cortex contains multiple hierarchically organized areas with distinctive cytoarchitectonical patterns, but the cellular mechanisms underlying the emergence of this diversity remain unclear. Here, we have quantitatively investigated the neuronal output of individual progenitor cells in the ventricular zone of the developing mouse neocortex using a combination of methods that together circumvent the biases and limitations of individual approaches. We found that individual cortical progenitor cells show a high degree of stochasticity and generate pyramidal cell lineages that adopt a wide range of laminar configurations. Mathematical modelling these lineage data suggests that a small number of progenitor cell populations, each generating pyramidal cells following different stochastic developmental programs, suffice to generate the heterogenous complement of pyramidal cell lineages that collectively build the complex cytoarchitecture of the neocortex.}, author = {Llorca, Alfredo and Ciceri, Gabriele and Beattie, Robert J and Wong, Fong K. and Diana, Giovanni and Serafeimidou, Eleni and Fernández-Otero, Marian and Streicher, Carmen and Arnold, Sebastian J. and Meyer, Martin and Hippenmeyer, Simon and Maravall, Miguel and Marín, Oscar}, booktitle = {bioRxiv}, publisher = {Cold Spring Harbor Laboratory}, title = {{Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture}}, doi = {10.1101/494088}, year = {2018}, } @inbook{86, abstract = {Responsiveness—the requirement that every request to a system be eventually handled—is one of the fundamental liveness properties of a reactive system. Average response time is a quantitative measure for the responsiveness requirement used commonly in performance evaluation. We show how average response time can be computed on state-transition graphs, on Markov chains, and on game graphs. In all three cases, we give polynomial-time algorithms.}, author = {Chatterjee, Krishnendu and Henzinger, Thomas A and Otop, Jan}, booktitle = {Principles of Modeling}, editor = {Lohstroh, Marten and Derler, Patricia and Sirjani, Marjan}, pages = {143 -- 161}, publisher = {Springer}, title = {{Computing average response time}}, doi = {10.1007/978-3-319-95246-8_9}, volume = {10760}, year = {2018}, } @article{9062, abstract = {Self-assembly is the autonomous organization of components into patterns or structures: an essential ingredient of biology and a desired route to complex organization1. At equilibrium, the structure is encoded through specific interactions2,3,4,5,6,7,8, at an unfavourable entropic cost for the system. An alternative approach, widely used by nature, uses energy input to bypass the entropy bottleneck and develop features otherwise impossible at equilibrium9. Dissipative building blocks that inject energy locally were made available by recent advances in colloidal science10,11 but have not been used to control self-assembly. Here we show the targeted formation of self-powered microgears from active particles and their autonomous synchronization into dynamical superstructures. We use a photoactive component that consumes fuel, haematite, to devise phototactic microswimmers that form self-spinning microgears following spatiotemporal light patterns. The gears are coupled via their chemical clouds by diffusiophoresis12 and constitute the elementary bricks of synchronized superstructures, which autonomously regulate their dynamics. The results are quantitatively rationalized on the basis of a stochastic description of diffusio-phoretic oscillators dynamically coupled by chemical gradients. Our findings harness non-equilibrium phoretic phenomena to program interactions and direct self-assembly with fidelity and specificity. It lays the groundwork for the autonomous construction of dynamical architectures and functional micro-machinery.}, author = {Aubret, Antoine and Youssef, Mena and Sacanna, Stefano and Palacci, Jérémie A}, issn = {1745-2481}, journal = {Nature Physics}, number = {11}, pages = {1114--1118}, publisher = {Springer Nature}, title = {{Targeted assembly and synchronization of self-spinning microgears}}, doi = {10.1038/s41567-018-0227-4}, volume = {14}, year = {2018}, } @article{9229, author = {Danzl, Johann G}, issn = {2500-2295}, journal = {Opera Medica et Physiologica}, number = {S1}, pages = {11}, publisher = {Lobachevsky State University of Nizhny Novgorod}, title = {{Diffraction-unlimited optical imaging for synaptic physiology}}, doi = {10.20388/omp2018.00s1.001}, volume = {4}, year = {2018}, } @inproceedings{6005, abstract = {Network games are widely used as a model for selfish resource-allocation problems. In the classicalmodel, each player selects a path connecting her source and target vertices. The cost of traversingan edge depends on theload; namely, number of players that traverse it. Thus, it abstracts the factthat different users may use a resource at different times and for different durations, which playsan important role in determining the costs of the users in reality. For example, when transmittingpackets in a communication network, routing traffic in a road network, or processing a task in aproduction system, actual sharing and congestion of resources crucially depends on time.In [13], we introducedtimed network games, which add a time component to network games.Each vertexvin the network is associated with a cost function, mapping the load onvto theprice that a player pays for staying invfor one time unit with this load. Each edge in thenetwork is guarded by the time intervals in which it can be traversed, which forces the players tospend time in the vertices. In this work we significantly extend the way time can be referred toin timed network games. In the model we study, the network is equipped withclocks, and, as intimed automata, edges are guarded by constraints on the values of the clocks, and their traversalmay involve a reset of some clocks. We argue that the stronger model captures many realisticnetworks. The addition of clocks breaks the techniques we developed in [13] and we developnew techniques in order to show that positive results on classic network games carry over to thestronger timed setting.}, author = {Avni, Guy and Guha, Shibashis and Kupferman, Orna}, issn = {1868-8969}, location = {Liverpool, United Kingdom}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Timed network games with clocks}}, doi = {10.4230/LIPICS.MFCS.2018.23}, volume = {117}, year = {2018}, }