TCP throughput guarantee in the DiffServ Assured Forwarding service: what about the results?

Since the proposition of Quality of Service architectures by the IETF, the interaction between TCP and the QoS services has been intensively studied. This paper proposes to look forward to the results obtained in terms of TCP throughput guarantee in the DiffServ Assured Forwarding (DiffServ/AF) service and to present an overview of the different proposals to solve the problem. It has been demonstrated that the standardized IETF DiffServ conditioners such as the token bucket color marker and the time sliding window color maker were not good TCP traffic descriptors. Starting with this point, several propositions have been made and most of them presents new marking schemes in order to replace or improve the traditional token bucket color marker. The main problem is that TCP congestion control is not designed to work with the AF service. Indeed, both mechanisms are antagonists. TCP has the property to share in a fair manner the bottleneck bandwidth between flows while DiffServ network provides a level of service controllable and predictable. In this paper, we build a classification of all the propositions made during these last years and compare them. As a result, we will see that these conditioning schemes can be separated in three sets of action level and that the conditioning at the network edge level is the most accepted one. We conclude that the problem is still unsolved and that TCP, conditioned or not conditioned, remains inappropriate to the DiffServ/AF service

Locally Chain-Parsable Languages

If a context-free language enjoys the local parsability property then, no matter how the source string is segmented, each segment can be parsed in- dependently, and an efficient parallel parsing algorithm becomes possible. The new class of locally chain-parsable languages (LCPL), included in deterministic context-free languages, is here defined by means of the chain-driven automa- ton and characterized by decidable properties of grammar derivations. Such au- tomaton decides to reduce or not a factor in a way purely driven by the terminal characters, thus extending the well-known concept of Input-Driven (ID) (visibly) pushdown machines. LCPL extend and improve the practically relevant operator- precedence languages (Floyd), which are known to strictly include the ID lan- guages, and for which a parallel-parser generator exists. Consistently with the classical results for ID, chain-compatible LCPL are closed under reversal and Boolean operations, and language inclusion is decidable

Counterexample-Guided Polynomial Loop Invariant Generation by Lagrange Interpolation

We apply multivariate Lagrange interpolation to synthesize polynomial quantitative loop invariants for probabilistic programs. We reduce the computation of an quantitative loop invariant to solving constraints over program variables and unknown coefficients. Lagrange interpolation allows us to find constraints with less unknown coefficients. Counterexample-guided refinement furthermore generates linear constraints that pinpoint the desired quantitative invariants. We evaluate our technique by several case studies with polynomial quantitative loop invariants in the experiments

Altered vascular smooth muscle function in the ApoE knockout mouse during the progression of atherosclerosis

Objectives: Relaxation of vascular smooth muscle (VSM) requires re-uptake of cytosolic Ca2+ into the sarcoplasmic reticulum (SR) via the Sarco/Endoplasmic Reticulum Ca2+ ATPase (SERCA), or extrusion via the Plasma Membrane Ca2+ ATPase (PMCA) or sodium Ca2+ exchanger (NCX). Peroxynitrite, a reactive species formed in vascular inflammatory diseases, upregulates SERCA activity to induce relaxation but, chronically, can contribute to atherogenesis and altered vascular function by escalating endoplasmic reticulum stress. Our objectives were to determine if peroxynitrite-induced relaxation and Ca2+ handling processes within vascular smooth muscle cells were altered as atherosclerosis develops.<p></p> Methods: Aortae from control and ApoE−/− mice were studied histologically, functionally and for protein expression levels of SERCA and PMCA. Ca2+ responses were assessed in dissociated aortic smooth muscle cells in the presence and absence of extracellular Ca2+.<p></p> Results: Relaxation to peroxynitrite was concentration-dependent and endothelium-independent. The abilities of the SERCA blocker thapsigargin and the PMCA inhibitor carboxyeosin to block this relaxation were altered during fat feeding and plaque progression. SERCA levels were progressively reduced, while PMCA expression was upregulated. In ApoE−/− VSM cells, increases in cytosolic Ca2+ [Ca2+]c in response to SERCA blockade were reduced, while SERCA-independent Ca2+ clearance was faster compared to control.<p></p> Conclusion: As atherosclerosis develops in the ApoE−/− mouse, expression and function of Ca2+ handling proteins are altered. Up-regulation of Ca2+ removal via PMCA may offer a potential compensatory mechanism to help normalise the dysfunctional relaxation observed during disease progression

Non-polynomial Worst-Case Analysis of Recursive Programs

We study the problem of developing efficient approaches for proving worst-case bounds of non-deterministic recursive programs. Ranking functions are sound and complete for proving termination and worst-case bounds of nonrecursive programs. First, we apply ranking functions to recursion, resulting in measure functions. We show that measure functions provide a sound and complete approach to prove worst-case bounds of non-deterministic recursive programs. Our second contribution is the synthesis of measure functions in nonpolynomial forms. We show that non-polynomial measure functions with logarithm and exponentiation can be synthesized through abstraction of logarithmic or exponentiation terms, Farkas' Lemma, and Handelman's Theorem using linear programming. While previous methods obtain worst-case polynomial bounds, our approach can synthesize bounds of the form $\mathcal{O}(n\log n)$ as well as $\mathcal{O}(n^r)$ where $r$ is not an integer. We present experimental results to demonstrate that our approach can obtain efficiently worst-case bounds of classical recursive algorithms such as (i) Merge-Sort, the divide-and-conquer algorithm for the Closest-Pair problem, where we obtain $\mathcal{O}(n \log n)$ worst-case bound, and (ii) Karatsuba's algorithm for polynomial multiplication and Strassen's algorithm for matrix multiplication, where we obtain $\mathcal{O}(n^r)$ bound such that $r$ is not an integer and close to the best-known bounds for the respective algorithms.Comment: 54 Pages, Full Version to CAV 201

Mesofluidic Devices for DNA-Programmed Combinatorial Chemistry

Hybrid combinatorial chemistry strategies that use DNA as an information-carrying medium are proving to be powerful tools for molecular discovery. In order to extend these efforts, we present a highly parallel format for DNA-programmed chemical library synthesis. The new format uses a standard microwell plate footprint and is compatible with commercially available automation technology. It can accommodate a wide variety of combinatorial synthetic schemes with up to 384 different building blocks per chemical step. We demonstrate that fluidic routing of DNA populations in the highly parallel format occurs with excellent specificity, and that chemistry on DNA arrayed into 384 well plates proceeds robustly, two requirements for the high-fidelity translation and efficient in vitro evolution of small molecules

Control of blood glucose in type 2 diabetes without weight loss by modification of diet composition

BACKGROUND: Over the past several years our research group has taken a systematic, comprehensive approach to determining the effects on body function (hormonal and non-hormonal) of varying the amounts and types of proteins, carbohydrates and fats in the diet. We have been particularly interested in the dietary management of type 2 diabetes. Our objective has been to develop a diet for people with type 2 diabetes that does not require weight loss, oral agents, or insulin, but that still controls the blood glucose concentration. Our overall goal is to enable the person with type 2 diabetes to control their blood glucose by adjustment in the composition rather than the amount of food in their diet. METHODS: This paper is a brief summary and review of our recent diet-related research, and the rationale used in the development of diets that potentially are useful in the treatment of diabetes. RESULTS: We determined that, of the carbohydrates present in the diet, absorbed glucose is largely responsible for the food-induced increase in blood glucose concentration. We also determined that dietary protein increases insulin secretion and lowers blood glucose. Fat does not significantly affect blood glucose, but can affect insulin secretion and modify the absorption of carbohydrates. Based on these data, we tested the efficacy of diets with various protein:carbohydrate:fat ratios for 5 weeks on blood glucose control in people with untreated type 2 diabetes. The results were compared to those obtained in the same subjects after 5 weeks on a control diet with a protein:carbohydrate:fat ratio of 15:55:30. A 30:40:30 ratio diet resulted in a moderate but significant decrease in 24-hour integrated glucose area and % total glycohemoglobin (%tGHb). A 30:20:50 ratio diet resulted in a 38% decrease in 24-hour glucose area, a reduction in fasting glucose to near normal and a decrease in %tGHb from 9.8% to 7.6%. The response to a 30:30:40 ratio diet was similar. CONCLUSION: Altering the diet composition could be a patient-empowering method of improving the hyperglycemia of type 2 diabetes without weight loss or pharmacologic intervention

Interpersonal and affective dimensions of psychopathic traits in adolescents : development and validation of a self-report instrument

We report the development and psychometric evaluations of a self-report instrument designed to screen for psychopathic traits among mainstream community adolescents. Tests of item functioning were initially conducted with 26 adolescents. In a second study the new instrument was administered to 150 high school adolescents, 73 of who had school records of suspension for antisocial behavior. Exploratory factor analysis yielded a 4-factor structure (Impulsivity α = .73, Self-Centredness α = .70, Callous-Unemotional α = .69, and Manipulativeness α = .83). In a third study involving 328 high school adolescents, 130 with records of suspension for antisocial behaviour, competing measurement models were evaluated using confirmatory factor analysis. The superiority of a first-order model represented by four correlated factors that was invariant across gender and age was confirmed. The findings provide researchers and clinicians with a psychometrically strong, self-report instrument and a greater understanding of psychopathic traits in mainstream adolescents

Highly Parallel Translation of DNA Sequences into Small Molecules

A large body of in vitro evolution work establishes the utility of biopolymer libraries comprising 1010 to 1015 distinct molecules for the discovery of nanomolar-affinity ligands to proteins.[1], [2], [3], [4], [5] Small-molecule libraries of comparable complexity will likely provide nanomolar-affinity small-molecule ligands.[6], [7] Unlike biopolymers, small molecules can offer the advantages of cell permeability, low immunogenicity, metabolic stability, rapid diffusion and inexpensive mass production. It is thought that such desirable in vivo behavior is correlated with the physical properties of small molecules, specifically a limited number of hydrogen bond donors and acceptors, a defined range of hydrophobicity, and most importantly, molecular weights less than 500 Daltons.[8] Creating a collection of 1010 to 1015 small molecules that meet these criteria requires the use of hundreds to thousands of diversity elements per step in a combinatorial synthesis of three to five steps. With this goal in mind, we have reported a set of mesofluidic devices that enable DNA-programmed combinatorial chemistry in a highly parallel 384-well plate format. Here, we demonstrate that these devices can translate DNA genes encoding 384 diversity elements per coding position into corresponding small-molecule gene products. This robust and efficient procedure yields small molecule-DNA conjugates suitable for in vitro evolution experiments