@article{615, abstract = {We show that the Dyson Brownian Motion exhibits local universality after a very short time assuming that local rigidity and level repulsion of the eigenvalues hold. These conditions are verified, hence bulk spectral universality is proven, for a large class of Wigner-like matrices, including deformed Wigner ensembles and ensembles with non-stochastic variance matrices whose limiting densities differ from Wigner's semicircle law.}, author = {Erdös, László and Schnelli, Kevin}, issn = {0246-0203}, journal = {Annales de l'institut Henri Poincare (B) Probability and Statistics}, number = {4}, pages = {1606 -- 1656}, publisher = {Institute of Mathematical Statistics}, title = {{Universality for random matrix flows with time dependent density}}, doi = {10.1214/16-AIHP765}, volume = {53}, year = {2017}, } @article{618, abstract = {Background: Increasing temperatures are predicted to strongly impact host-parasite interactions, but empirical tests are rare. Host species that are naturally exposed to a broad temperature spectrum offer the possibility to investigate the effects of elevated temperatures on hosts and parasites. Using three-spined sticklebacks, Gasterosteus aculeatus L., and tapeworms, Schistocephalus solidus (Müller, 1776), originating from a cold and a warm water site of a volcanic lake, we subjected sympatric and allopatric host-parasite combinations to cold and warm conditions in a fully crossed design. We predicted that warm temperatures would promote the development of the parasites, while the hosts might benefit from cooler temperatures. We further expected adaptations to the local temperature and mutual adaptations of local host-parasite pairs. Results: Overall, S. solidus parasites grew faster at warm temperatures and stickleback hosts at cold temperatures. On a finer scale, we observed that parasites were able to exploit their hosts more efficiently at the parasite’s temperature of origin. In contrast, host tolerance towards parasite infection was higher when sticklebacks were infected with parasites at the parasite’s ‘foreign’ temperature. Cold-origin sticklebacks tended to grow faster and parasite infection induced a stronger immune response. Conclusions: Our results suggest that increasing environmental temperatures promote the parasite rather than the host and that host tolerance is dependent on the interaction between parasite infection and temperature. Sticklebacks might use tolerance mechanisms towards parasite infection in combination with their high plasticity towards temperature changes to cope with increasing parasite infection pressures and rising temperatures.}, author = {Franke, Frederik and Armitage, Sophie and Kutzer, Megan and Kurtz, Joachim and Scharsack, Jörn}, issn = {17563305}, journal = {Parasites & Vectors}, number = {252}, publisher = {BioMed Central}, title = {{Environmental temperature variation influences fitness trade-offs in a fish-tapeworm association }}, doi = {10.1186/s13071-017-2192-7}, volume = {10}, year = {2017}, } @article{621, abstract = {The mammalian cerebral cortex is responsible for higher cognitive functions such as perception, consciousness, and acquiring and processing information. The neocortex is organized into six distinct laminae, each composed of a rich diversity of cell types which assemble into highly complex cortical circuits. Radial glia progenitors (RGPs) are responsible for producing all neocortical neurons and certain glia lineages. Here, we discuss recent discoveries emerging from clonal lineage analysis at the single RGP cell level that provide us with an inaugural quantitative framework of RGP lineage progression. We further discuss the importance of the relative contribution of intrinsic gene functions and non-cell-autonomous or community effects in regulating RGP proliferation behavior and lineage progression.}, author = {Beattie, Robert J and Hippenmeyer, Simon}, issn = {0014-5793}, journal = {FEBS letters}, number = {24}, pages = {3993 -- 4008}, publisher = {Wiley-Blackwell}, title = {{Mechanisms of radial glia progenitor cell lineage progression}}, doi = {10.1002/1873-3468.12906}, volume = {591}, year = {2017}, } @article{624, abstract = {Bacteria adapt to adverse environmental conditions by altering gene expression patterns. Recently, a novel stress adaptation mechanism has been described that allows Escherichia coli to alter gene expression at the post-transcriptional level. The key player in this regulatory pathway is the endoribonuclease MazF, the toxin component of the toxin-antitoxin module mazEF that is triggered by various stressful conditions. In general, MazF degrades the majority of transcripts by cleaving at ACA sites, which results in the retardation of bacterial growth. Furthermore, MazF can process a small subset of mRNAs and render them leaderless by removing their ribosome binding site. MazF concomitantly modifies ribosomes, making them selective for the translation of leaderless mRNAs. In this study, we employed fluorescent reporter-systems to investigate mazEF expression during stressful conditions, and to infer consequences of the mRNA processing mediated by MazF on gene expression at the single-cell level. Our results suggest that mazEF transcription is maintained at low levels in single cells encountering adverse conditions, such as antibiotic stress or amino acid starvation. Moreover, using the grcA mRNA as a model for MazF-mediated mRNA processing, we found that MazF activation promotes heterogeneity in the grcA reporter expression, resulting in a subpopulation of cells with increased levels of GrcA reporter protein.}, author = {Nikolic, Nela and Didara, Zrinka and Moll, Isabella}, issn = {2167-8359}, journal = {PeerJ}, number = {9}, publisher = {PeerJ}, title = {{MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia coli populations}}, doi = {10.7717/peerj.3830}, volume = {2017}, year = {2017}, } @inbook{625, abstract = {In the analysis of reactive systems a quantitative objective assigns a real value to every trace of the system. The value decision problem for a quantitative objective requires a trace whose value is at least a given threshold, and the exact value decision problem requires a trace whose value is exactly the threshold. We compare the computational complexity of the value and exact value decision problems for classical quantitative objectives, such as sum, discounted sum, energy, and mean-payoff for two standard models of reactive systems, namely, graphs and graph games.}, author = {Chatterjee, Krishnendu and Doyen, Laurent and Henzinger, Thomas A}, booktitle = {Models, Algorithms, Logics and Tools}, editor = {Aceto, Luca and Bacci, Giorgio and Ingólfsdóttir, Anna and Legay, Axel and Mardare, Radu}, isbn = {978-3-319-63120-2}, issn = {0302-9743}, pages = {367 -- 381}, publisher = {Springer}, title = {{The cost of exactness in quantitative reachability}}, doi = {10.1007/978-3-319-63121-9_18}, volume = {10460}, year = {2017}, } @article{626, abstract = {Our focus here is on the infinitesimal model. In this model, one or several quantitative traits are described as the sum of a genetic and a non-genetic component, the first being distributed within families as a normal random variable centred at the average of the parental genetic components, and with a variance independent of the parental traits. Thus, the variance that segregates within families is not perturbed by selection, and can be predicted from the variance components. This does not necessarily imply that the trait distribution across the whole population should be Gaussian, and indeed selection or population structure may have a substantial effect on the overall trait distribution. One of our main aims is to identify some general conditions on the allelic effects for the infinitesimal model to be accurate. We first review the long history of the infinitesimal model in quantitative genetics. Then we formulate the model at the phenotypic level in terms of individual trait values and relationships between individuals, but including different evolutionary processes: genetic drift, recombination, selection, mutation, population structure, …. We give a range of examples of its application to evolutionary questions related to stabilising selection, assortative mating, effective population size and response to selection, habitat preference and speciation. We provide a mathematical justification of the model as the limit as the number M of underlying loci tends to infinity of a model with Mendelian inheritance, mutation and environmental noise, when the genetic component of the trait is purely additive. We also show how the model generalises to include epistatic effects. We prove in particular that, within each family, the genetic components of the individual trait values in the current generation are indeed normally distributed with a variance independent of ancestral traits, up to an error of order 1∕M. Simulations suggest that in some cases the convergence may be as fast as 1∕M.}, author = {Barton, Nicholas H and Etheridge, Alison and Véber, Amandine}, issn = {0040-5809}, journal = {Theoretical Population Biology}, pages = {50 -- 73}, publisher = {Academic Press}, title = {{The infinitesimal model: Definition derivation and implications}}, doi = {10.1016/j.tpb.2017.06.001}, volume = {118}, year = {2017}, } @article{627, abstract = {Beige adipocytes are a new type of recruitable brownish adipocytes, with highly mitochondrial membrane uncoupling protein 1 expression and thermogenesis. Beige adipocytes were found among white adipocytes, especially in subcutaneous white adipose tissue (sWAT). Therefore, beige adipocytes may be involved in the regulation of energy metabolism and fat deposition. Transient receptor potential melastatin 8 (TRPM8), a Ca2+-permeable non-selective cation channel, plays vital roles in the regulation of various cellular functions. It has been reported that TRPM8 activation enhanced the thermogenic function of brown adiposytes. However, the involvement of TRPM8 in the thermogenic function of WAT remains unexplored. Our data revealed that TRPM8 was expressed in mouse white adipocytes at mRNA, protein and functional levels. The mRNA expression of Trpm8 was significantly increased in the differentiated white adipocytes than pre-adipocytes. Moreover, activation of TRPM8 by menthol enhanced the expression of thermogenic genes in cultured white aidpocytes. And menthol-induced increases of the thermogenic genes in white adipocytes was inhibited by either KT5720 (a protein kinase A inhibitor) or BAPTA-AM. In addition, high fat diet (HFD)-induced obesity in mice was significantly recovered by co-treatment with menthol. Dietary menthol enhanced WAT "browning" and improved glucose metabolism in HFD-induced obesity mice as well. Therefore, we concluded that TRPM8 might be involved in WAT "browning" by increasing the expression levels of genes related to thermogenesis and energy metabolism. And dietary menthol could be a novel approach for combating human obesity and related metabolic diseases.}, author = {Jiang, Changyu and Zhai, Ming-Zhu and Yan, Dong and Li, Da and Li, Chen and Zhang, Yonghong and Xiao, Lizu and Xiong, Donglin and Deng, Qiwen and Sun, Wuping}, issn = {1949-2553}, journal = {Oncotarget}, number = {43}, pages = {75114 -- 75126}, publisher = {Impact Journals}, title = {{Dietary menthol-induced TRPM8 activation enhances WAT “browning” and ameliorates diet-induced obesity}}, doi = {10.18632/oncotarget.20540}, volume = {8}, year = {2017}, } @inproceedings{628, abstract = {We consider the problem of developing automated techniques for solving recurrence relations to aid the expected-runtime analysis of programs. The motivation is that several classical textbook algorithms have quite efficient expected-runtime complexity, whereas the corresponding worst-case bounds are either inefficient (e.g., Quick-Sort), or completely ineffective (e.g., Coupon-Collector). Since the main focus of expected-runtime analysis is to obtain efficient bounds, we consider bounds that are either logarithmic, linear or almost-linear (O(log n), O(n), O(n · log n), respectively, where n represents the input size). Our main contribution is an efficient (simple linear-time algorithm) sound approach for deriving such expected-runtime bounds for the analysis of recurrence relations induced by randomized algorithms. The experimental results show that our approach can efficiently derive asymptotically optimal expected-runtime bounds for recurrences of classical randomized algorithms, including Randomized-Search, Quick-Sort, Quick-Select, Coupon-Collector, where the worst-case bounds are either inefficient (such as linear as compared to logarithmic expected-runtime complexity, or quadratic as compared to linear or almost-linear expected-runtime complexity), or ineffective.}, author = {Chatterjee, Krishnendu and Fu, Hongfei and Murhekar, Aniket}, editor = {Majumdar, Rupak and Kunčak, Viktor}, isbn = {978-331963386-2}, location = {Heidelberg, Germany}, pages = {118 -- 139}, publisher = {Springer}, title = {{Automated recurrence analysis for almost linear expected runtime bounds}}, doi = {10.1007/978-3-319-63387-9_6}, volume = {10426}, year = {2017}, } @inbook{629, abstract = {Even simple cells like bacteria have precisely regulated cellular anatomies, which allow them to grow, divide and to respond to internal or external cues with high fidelity. How spatial and temporal intracellular organization in prokaryotic cells is achieved and maintained on the basis of locally interacting proteins still remains largely a mystery. Bulk biochemical assays with purified components and in vivo experiments help us to approach key cellular processes from two opposite ends, in terms of minimal and maximal complexity. However, to understand how cellular phenomena emerge, that are more than the sum of their parts, we have to assemble cellular subsystems step by step from the bottom up. Here, we review recent in vitro reconstitution experiments with proteins of the bacterial cell division machinery and illustrate how they help to shed light on fundamental cellular mechanisms that constitute spatiotemporal order and regulate cell division.}, author = {Loose, Martin and Zieske, Katja and Schwille, Petra}, booktitle = {Prokaryotic Cytoskeletons}, pages = {419 -- 444}, publisher = {Springer}, title = {{Reconstitution of protein dynamics involved in bacterial cell division}}, doi = {10.1007/978-3-319-53047-5_15}, volume = {84}, year = {2017}, } @inproceedings{630, abstract = {Background: Standards have become available to share semantically encoded vital parameters from medical devices, as required for example by personal healthcare records. Standardised sharing of biosignal data largely remains open. Objectives: The goal of this work is to explore available biosignal file format and data exchange standards and profiles, and to conceptualise end-To-end solutions. Methods: The authors reviewed and discussed available biosignal file format standards with other members of international standards development organisations (SDOs). Results: A raw concept for standards based acquisition, storage, archiving and sharing of biosignals was developed. The GDF format may serve for storing biosignals. Signals can then be shared using FHIR resources and may be stored on FHIR servers or in DICOM archives, with DICOM waveforms as one possible format. Conclusion: Currently a group of international SDOs (e.g. HL7, IHE, DICOM, IEEE) is engaged in intensive discussions. This discussion extends existing work that already was adopted by large implementer communities. The concept presented here only reports the current status of the discussion in Austria. The discussion will continue internationally, with results to be expected over the coming years.}, author = {Sauermann, Stefan and David, Veronika and Schlögl, Alois and Egelkraut, Reinhard and Frohner, Matthias and Pohn, Birgit and Urbauer, Philipp and Mense, Alexander}, isbn = {978-161499758-0}, location = {Vienna, Austria}, pages = {356 -- 362}, publisher = {IOS Press}, title = {{Biosignals standards and FHIR: The way to go}}, doi = {10.3233/978-1-61499-759-7-356}, volume = {236}, year = {2017}, } @article{632, abstract = {We consider a 2D quantum system of N bosons in a trapping potential |x|s, interacting via a pair potential of the form N2β−1 w(Nβ x). We show that for all 0 < β < (s + 1)/(s + 2), the leading order behavior of ground states of the many-body system is described in the large N limit by the corresponding cubic nonlinear Schrödinger energy functional. Our result covers the focusing case (w < 0) where even the stability of the many-body system is not obvious. This answers an open question mentioned by X. Chen and J. Holmer for harmonic traps (s = 2). Together with the BBGKY hierarchy approach used by these authors, our result implies the convergence of the many-body quantum dynamics to the focusing NLS equation with harmonic trap for all 0 < β < 3/4. }, author = {Lewin, Mathieu and Nam, Phan and Rougerie, Nicolas}, journal = {Proceedings of the American Mathematical Society}, number = {6}, pages = {2441 -- 2454}, publisher = {American Mathematical Society}, title = {{A note on 2D focusing many boson systems}}, doi = {10.1090/proc/13468}, volume = {145}, year = {2017}, } @inproceedings{633, abstract = {A Rapidly-exploring Random Tree (RRT) is an algorithm which can search a non-convex region of space by incrementally building a space-filling tree. The tree is constructed from random points drawn from system’s state space and is biased to grow towards large unexplored areas in the system. RRT can provide better coverage of a system’s possible behaviors compared with random simulations, but is more lightweight than full reachability analysis. In this paper, we explore some of the design decisions encountered while implementing a hybrid extension of the RRT algorithm, which have not been elaborated on before. In particular, we focus on handling non-determinism, which arises due to discrete transitions. We introduce the notion of important points to account for this phenomena. We showcase our ideas using heater and navigation benchmarks.}, author = {Bak, Stanley and Bogomolov, Sergiy and Henzinger, Thomas A and Kumar, Aviral}, editor = {Abate, Alessandro and Bodo, Sylvie}, isbn = {978-331963500-2}, location = {Heidelberg, Germany}, pages = {83 -- 89}, publisher = {Springer}, title = {{Challenges and tool implementation of hybrid rapidly exploring random trees}}, doi = {10.1007/978-3-319-63501-9_6}, volume = {10381}, year = {2017}, } @inbook{634, abstract = {As autism spectrum disorder (ASD) is largely regarded as a neurodevelopmental condition, long-time consensus was that its hallmark features are irreversible. However, several studies from recent years using defined mouse models of ASD have provided clear evidence that in mice neurobiological and behavioural alterations can be ameliorated or even reversed by genetic restoration or pharmacological treatment either before or after symptom onset. Here, we review findings on genetic and pharmacological reversibility of phenotypes in mouse models of ASD. Our review should give a comprehensive overview on both aspects and encourage future studies to better understand the underlying molecular mechanisms that might be translatable from animals to humans.}, author = {Schroeder, Jan and Deliu, Elena and Novarino, Gaia and Schmeisser, Michael}, booktitle = {Translational Anatomy and Cell Biology of Autism Spectrum Disorder}, editor = {Schmeisser, Michael and Boekers, Tobias}, pages = {189 -- 211}, publisher = {Springer}, title = {{Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder}}, doi = {10.1007/978-3-319-52498-6_10}, volume = {224}, year = {2017}, } @inproceedings{635, abstract = {Memory-hard functions (MHFs) are hash algorithms whose evaluation cost is dominated by memory cost. As memory, unlike computation, costs about the same across different platforms, MHFs cannot be evaluated at significantly lower cost on dedicated hardware like ASICs. MHFs have found widespread applications including password hashing, key derivation, and proofs-of-work. This paper focuses on scrypt, a simple candidate MHF designed by Percival, and described in RFC 7914. It has been used within a number of cryptocurrencies (e.g., Litecoin and Dogecoin) and has been an inspiration for Argon2d, one of the winners of the recent password-hashing competition. Despite its popularity, no rigorous lower bounds on its memory complexity are known. We prove that scrypt is optimally memory-hard, i.e., its cumulative memory complexity (cmc) in the parallel random oracle model is Ω(n2w), where w and n are the output length and number of invocations of the underlying hash function, respectively. High cmc is a strong security target for MHFs introduced by Alwen and Serbinenko (STOC’15) which implies high memory cost even for adversaries who can amortize the cost over many evaluations and evaluate the underlying hash functions many times in parallel. Our proof is the first showing optimal memory-hardness for any MHF. Our result improves both quantitatively and qualitatively upon the recent work by Alwen et al. (EUROCRYPT’16) who proved a weaker lower bound of Ω(n2w/ log2 n) for a restricted class of adversaries.}, author = {Alwen, Joel F and Chen, Binchi and Pietrzak, Krzysztof Z and Reyzin, Leonid and Tessaro, Stefano}, editor = {Coron, Jean-Sébastien and Buus Nielsen, Jesper}, isbn = {978-331956616-0}, location = {Paris, France}, pages = {33 -- 62}, publisher = {Springer}, title = {{Scrypt is maximally memory hard}}, doi = {10.1007/978-3-319-56617-7_2}, volume = {10212}, year = {2017}, } @inproceedings{636, abstract = {Signal regular expressions can specify sequential properties of real-valued signals based on threshold conditions, regular operations, and duration constraints. In this paper we endow them with a quantitative semantics which indicates how robustly a signal matches or does not match a given expression. First, we show that this semantics is a safe approximation of a distance between the signal and the language defined by the expression. Then, we consider the robust matching problem, that is, computing the quantitative semantics of every segment of a given signal relative to an expression. We present an algorithm that solves this problem for piecewise-constant and piecewise-linear signals and show that for such signals the robustness map is a piecewise-linear function. The availability of an indicator describing how robustly a signal segment matches some regular pattern provides a general framework for quantitative monitoring of cyber-physical systems.}, author = {Bakhirkin, Alexey and Ferrere, Thomas and Maler, Oded and Ulus, Dogan}, editor = {Abate, Alessandro and Geeraerts, Gilles}, isbn = {978-331965764-6}, location = {Berlin, Germany}, pages = {189 -- 206}, publisher = {Springer}, title = {{On the quantitative semantics of regular expressions over real-valued signals}}, doi = {10.1007/978-3-319-65765-3_11}, volume = {10419}, year = {2017}, } @inproceedings{640, abstract = {Data-independent Memory Hard Functions (iMHFS) are finding a growing number of applications in security; especially in the domain of password hashing. An important property of a concrete iMHF is specified by fixing a directed acyclic graph (DAG) Gn on n nodes. The quality of that iMHF is then captured by the following two pebbling complexities of Gn: – The parallel cumulative pebbling complexity Π∥cc(Gn) must be as high as possible (to ensure that the amortized cost of computing the function on dedicated hardware is dominated by the cost of memory). – The sequential space-time pebbling complexity Πst(Gn) should be as close as possible to Π∥cc(Gn) (to ensure that using many cores in parallel and amortizing over many instances does not give much of an advantage). In this paper we construct a family of DAGs with best possible parameters in an asymptotic sense, i.e., where Π∥cc(Gn) = Ω(n2/ log(n)) (which matches a known upper bound) and Πst(Gn) is within a constant factor of Π∥cc(Gn). Our analysis relies on a new connection between the pebbling complexity of a DAG and its depth-robustness (DR) – a well studied combinatorial property. We show that high DR is sufficient for high Π∥cc. Alwen and Blocki (CRYPTO’16) showed that high DR is necessary and so, together, these results fully characterize DAGs with high Π∥cc in terms of DR. Complementing these results, we provide new upper and lower bounds on the Π∥cc of several important candidate iMHFs from the literature. We give the first lower bounds on the memory hardness of the Catena and Balloon Hashing functions in a parallel model of computation and we give the first lower bounds of any kind for (a version) of Argon2i. Finally we describe a new class of pebbling attacks improving on those of Alwen and Blocki (CRYPTO’16). By instantiating these attacks we upperbound the Π∥cc of the Password Hashing Competition winner Argon2i and one of the Balloon Hashing functions by O (n1.71). We also show an upper bound of O(n1.625) for the Catena functions and the two remaining Balloon Hashing functions.}, author = {Alwen, Joel F and Blocki, Jeremiah and Pietrzak, Krzysztof Z}, editor = {Coron, Jean-Sébastien and Buus Nielsen, Jesper}, isbn = {978-331956616-0}, location = {Paris, France}, pages = {3 -- 32}, publisher = {Springer}, title = {{Depth-robust graphs and their cumulative memory complexity}}, doi = {10.1007/978-3-319-56617-7_1}, volume = {10212}, year = {2017}, } @inproceedings{641, abstract = {We introduce two novel methods for learning parameters of graphical models for image labelling. The following two tasks underline both methods: (i) perturb model parameters based on given features and ground truth labelings, so as to exactly reproduce these labelings as optima of the local polytope relaxation of the labelling problem; (ii) train a predictor for the perturbed model parameters so that improved model parameters can be applied to the labelling of novel data. Our first method implements task (i) by inverse linear programming and task (ii) using a regressor e.g. a Gaussian process. Our second approach simultaneously solves tasks (i) and (ii) in a joint manner, while being restricted to linearly parameterised predictors. Experiments demonstrate the merits of both approaches.}, author = {Trajkovska, Vera and Swoboda, Paul and Åström, Freddie and Petra, Stefanie}, editor = {Lauze, François and Dong, Yiqiu and Bjorholm Dahl, Anders}, isbn = {978-331958770-7}, location = {Kolding, Denmark}, pages = {323 -- 334}, publisher = {Springer}, title = {{Graphical model parameter learning by inverse linear programming}}, doi = {10.1007/978-3-319-58771-4_26}, volume = {10302}, year = {2017}, } @article{642, abstract = {Cauchy problems with SPDEs on the whole space are localized to Cauchy problems on a ball of radius R. This localization reduces various kinds of spatial approximation schemes to finite dimensional problems. The error is shown to be exponentially small. As an application, a numerical scheme is presented which combines the localization and the space and time discretization, and thus is fully implementable.}, author = {Gerencser, Mate and Gyöngy, István}, issn = {0025-5718}, journal = {Mathematics of Computation}, number = {307}, pages = {2373 -- 2397}, publisher = {American Mathematical Society}, title = {{Localization errors in solving stochastic partial differential equations in the whole space}}, doi = {10.1090/mcom/3201}, volume = {86}, year = {2017}, } @misc{6426, abstract = {Synchronous programs are easy to specify because the side effects of an operation are finished by the time the invocation of the operation returns to the caller. Asynchronous programs, on the other hand, are difficult to specify because there are side effects due to pending computation scheduled as a result of the invocation of an operation. They are also difficult to verify because of the large number of possible interleavings of concurrent asynchronous computation threads. We show that specifications and correctness proofs for asynchronous programs can be structured by introducing the fiction, for proof purposes, that intermediate, non-quiescent states of asynchronous operations can be ignored. Then, the task of specification becomes relatively simple and the task of verification can be naturally decomposed into smaller sub-tasks. The sub-tasks iteratively summarize, guided by the structure of an asynchronous program, the atomic effect of non-atomic operations and the synchronous effect of asynchronous operations. This structuring of specifications and proofs corresponds to the introduction of multiple layers of stepwise refinement for asynchronous programs. We present the first proof rule, called synchronization, to reduce asynchronous invocations on a lower layer to synchronous invocations on a higher layer. We implemented our proof method in CIVL and evaluated it on a collection of benchmark programs.}, author = {Henzinger, Thomas A and Kragl, Bernhard and Qadeer, Shaz}, issn = {2664-1690}, pages = {28}, publisher = {IST Austria}, title = {{Synchronizing the asynchronous}}, doi = {10.15479/AT:IST-2018-853-v2-2}, year = {2017}, } @article{643, abstract = {It has been reported that nicotinamide-overload induces oxidative stress associated with insulin resistance, the key feature of type 2 diabetes mellitus (T2DM). This study aimed to investigate the effects of B vitamins in T2DM. Glucose tolerance tests (GTT) were carried out in adult Sprague-Dawley rats treated with or without cumulative doses of B vitamins. More specifically, insulin tolerance tests (ITT) were also carried out in adult Sprague-Dawley rats treated with or without cumulative doses of Vitamin B3. We found that cumulative Vitamin B1 and Vitamin B3 administration significantly increased the plasma H2O2 levels associated with high insulin levels. Only Vitamin B3 reduced muscular and hepatic glycogen contents. Cumulative administration of nicotinic acid, another form of Vitamin B3, also significantly increased plasma insulin level and H2O2 generation. Moreover, cumulative administration of nicotinic acid or nicotinamide impaired glucose metabolism. This study suggested that excess Vitamin B1 and Vitamin B3 caused oxidative stress and insulin resistance.}, author = {Sun, Wuping and Zhai, Ming-Zhu and Zhou, Qian and Qian, Chengrui and Jiang, Changyu}, issn = {0304-4920}, journal = {Chinese Journal of Physiology}, number = {4}, pages = {207 -- 214}, publisher = {Chinese Physiological Society}, title = {{Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats}}, doi = {10.4077/CJP.2017.BAF469}, volume = {60}, year = {2017}, }