@article{7225, abstract = {This is a literature teaching resource review for biologically inspired microfluidics courses or exploring the diverse applications of microfluidics. The structure is around key papers and model organisms. While courses gradually change over time, a focus remains on understanding how microfluidics has developed as well as what it can and cannot do for researchers. As a primary starting point, we cover micro-fluid mechanics principles and microfabrication of devices. A variety of applications are discussed using model prokaryotic and eukaryotic organisms from the set of bacteria (Escherichia coli), trypanosomes (Trypanosoma brucei), yeast (Saccharomyces cerevisiae), slime molds (Physarum polycephalum), worms (Caenorhabditis elegans), flies (Drosophila melangoster), plants (Arabidopsis thaliana), and mouse immune cells (Mus musculus). Other engineering and biochemical methods discussed include biomimetics, organ on a chip, inkjet, droplet microfluidics, biotic games, and diagnostics. While we have not yet reached the end-all lab on a chip, microfluidics can still be used effectively for specific applications.}, author = {Merrin, Jack}, issn = {23065354}, journal = {Bioengineering}, number = {4}, publisher = {MDPI}, title = {{Frontiers in microfluidics, a teaching resource review}}, doi = {10.3390/bioengineering6040109}, volume = {6}, year = {2019}, } @inproceedings{7228, abstract = {Traditional concurrent programming involves manipulating shared mutable state. Alternatives to this programming style are communicating sequential processes (CSP) and actor models, which share data via explicit communication. These models have been known for almost half a century, and have recently had started to gain significant traction among modern programming languages. The common abstraction for communication between several processes is the channel. Although channels are similar to producer-consumer data structures, they have different semantics and support additional operations, such as the select expression. Despite their growing popularity, most known implementations of channels use lock-based data structures and can be rather inefficient. In this paper, we present the first efficient lock-free algorithm for implementing a communication channel for CSP programming. We provide implementations and experimental results in the Kotlin and Go programming languages. Our new algorithm outperforms existing implementations on many workloads, while providing non-blocking progress guarantee. Our design can serve as an example of how to construct general communication data structures for CSP and actor models. }, author = {Koval, Nikita and Alistarh, Dan-Adrian and Elizarov, Roman}, booktitle = {25th Anniversary of Euro-Par}, isbn = {978-3-0302-9399-4}, issn = {1611-3349}, location = {Göttingen, Germany}, pages = {317--333}, publisher = {Springer Nature}, title = {{Scalable FIFO channels for programming via communicating sequential processes}}, doi = {10.1007/978-3-030-29400-7_23}, volume = {11725}, year = {2019}, } @inproceedings{7216, abstract = {We present LiveTraVeL (Live Transit Vehicle Labeling), a real-time system to label a stream of noisy observations of transit vehicle trajectories with the transit routes they are serving (e.g., northbound bus #5). In order to scale efficiently to large transit networks, our system first retrieves a small set of candidate routes from a geometrically indexed data structure, then applies a fine-grained scoring step to choose the best match. Given that real-time data remains unavailable for the majority of the world’s transit agencies, these inferences can help feed a real-time map of a transit system’s trips, infer transit trip delays in real time, or measure and correct noisy transit tracking data. This system can run on vehicle observations from a variety of sources that don’t attach route information to vehicle observations, such as public imagery streams or user-contributed transit vehicle sightings.We abstract away the specifics of the sensing system and demonstrate the effectiveness of our system on a "semisynthetic" dataset of all New York City buses, where we simulate sensed trajectories by starting with fully labeled vehicle trajectories reported via the GTFS-Realtime protocol, removing the transit route IDs, and perturbing locations with synthetic noise. Using just the geometric shapes of the trajectories, we demonstrate that our system converges on the correct route ID within a few minutes, even after a vehicle switches from serving one trip to the next.}, author = {Osang, Georg F and Cook, James and Fabrikant, Alex and Gruteser, Marco}, booktitle = {2019 IEEE Intelligent Transportation Systems Conference}, isbn = {9781538670248}, location = {Auckland, New Zealand}, publisher = {IEEE}, title = {{LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale}}, doi = {10.1109/ITSC.2019.8917514}, year = {2019}, } @inproceedings{7231, abstract = {Piecewise Barrier Tubes (PBT) is a new technique for flowpipe overapproximation for nonlinear systems with polynomial dynamics, which leverages a combination of barrier certificates. PBT has advantages over traditional time-step based methods in dealing with those nonlinear dynamical systems in which there is a large difference in speed between trajectories, producing an overapproximation that is time independent. However, the existing approach for PBT is not efficient due to the application of interval methods for enclosure-box computation, and it can only deal with continuous dynamical systems without uncertainty. In this paper, we extend the approach with the ability to handle both continuous and hybrid dynamical systems with uncertainty that can reside in parameters and/or noise. We also improve the efficiency of the method significantly, by avoiding the use of interval-based methods for the enclosure-box computation without loosing soundness. We have developed a C++ prototype implementing the proposed approach and we evaluate it on several benchmarks. The experiments show that our approach is more efficient and precise than other methods in the literature.}, author = {Kong, Hui and Bartocci, Ezio and Jiang, Yu and Henzinger, Thomas A}, booktitle = {17th International Conference on Formal Modeling and Analysis of Timed Systems}, isbn = {978-3-0302-9661-2}, issn = {1611-3349}, location = {Amsterdam, The Netherlands}, pages = {123--141}, publisher = {Springer Nature}, title = {{Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty}}, doi = {10.1007/978-3-030-29662-9_8}, volume = {11750}, year = {2019}, } @article{7340, abstract = {Coupling of endoplasmic reticulum stress to dimerisation‑dependent activation of the UPR transducer IRE1 is incompletely understood. Whilst the luminal co-chaperone ERdj4 promotes a complex between the Hsp70 BiP and IRE1's stress-sensing luminal domain (IRE1LD) that favours the latter's monomeric inactive state and loss of ERdj4 de-represses IRE1, evidence linking these cellular and in vitro observations is presently lacking. We report that enforced loading of endogenous BiP onto endogenous IRE1α repressed UPR signalling in CHO cells and deletions in the IRE1α locus that de-repressed the UPR in cells, encode flexible regions of IRE1LD that mediated BiP‑induced monomerisation in vitro. Changes in the hydrogen exchange mass spectrometry profile of IRE1LD induced by ERdj4 and BiP confirmed monomerisation and were consistent with active destabilisation of the IRE1LD dimer. Together, these observations support a competition model whereby waning ER stress passively partitions ERdj4 and BiP to IRE1LD to initiate active repression of UPR signalling.}, author = {Amin-Wetzel, Niko Paresh and Neidhardt, Lisa and Yan, Yahui and Mayer, Matthias P. and Ron, David}, issn = {2050084X}, journal = {eLife}, publisher = {eLife Sciences Publications}, title = {{Unstructured regions in IRE1α specify BiP-mediated destabilisation of the luminal domain dimer and repression of the UPR}}, doi = {10.7554/eLife.50793}, volume = {8}, year = {2019}, }