The optimisation of legacy water treatment works to produce a more consistent final water quality

DUE TO COPYRIGHT RESTRICTIONS ONLY AVAILABLE FOR CONSULTATION AT ASTON UNIVERSITY LIBRARY AND INFORMATION SERVICES WITH PRIOR ARRANGEMENT

Towards the in silico identification of class II restricted T-cell epitopes:a partial least squares iterative self-consistent algorithm for affinity prediction

Motivation: The immunogenicity of peptides depends on their ability to bind to MHC molecules. MHC binding affinity prediction methods can save significant amounts of experimental work. The class II MHC binding site is open at both ends, making epitope prediction difficult because of the multiple binding ability of long peptides. Results: An iterative self-consistent partial least squares (PLS)-based additive method was applied to a set of 66 pep- tides no longer than 16 amino acids, binding to DRB1*0401. A regression equation containing the quantitative contributions of the amino acids at each of the nine positions was generated. Its predictability was tested using two external test sets which gave r pred =0.593 and r pred=0.655, respectively. Furthermore, it was benchmarked using 25 known T-cell epitopes restricted by DRB1*0401 and we compared our results with four other online predictive methods. The additive method showed the best result finding 24 of the 25 T-cell epitopes. Availability: Peptides used in the study are available from http://www.jenner.ac.uk/JenPep. The PLS method is available commercially in the SYBYL molecular modelling software package. The final model for affinity prediction of peptides binding to DRB1*0401 molecule is available at http://www.jenner.ac.uk/MHCPred. Models developed for DRB1*0101 and DRB1*0701 also are available in MHC- Pred

Some Computational Aspects of the Consistent Mass Finite Element Method for a (semi-)periodic Eigenvalue Problem

We consider a model eigenvalue problem (EVP) in 1D, with periodic or semi–periodic boundary conditions (BCs). The discretization of this type of EVP by consistent mass finite element methods (FEMs) leads to the generalized matrix EVP Kc = λ M c, where K and M are real, symmetric matrices, with a certain (skew–)circulant structure. In this paper we fix our attention to the use of a quadratic FE–mesh. Explicit expressions for the eigenvalues of the resulting algebraic EVP are established. This leads to an explicit form for the approximation error in terms of the mesh parameter, which confirms the theoretical error estimates, obtained in [2].

On the Time Complexity of the Problem Related to Reducts of Consistent Decision Tables

In recent years, rough set approach computing issues concerning reducts of decision tables have attracted the attention of many researchers. In this paper, we present the time complexity of an algorithm computing reducts of decision tables by relational database approach. Let DS = (U, C ∪ {d}) be a consistent decision table, we say that A ⊆ C is a relative reduct of DS if A contains a reduct of DS. Let s = be a relation schema on the attribute set C ∪ {d}, we say that A ⊆ C is a relative minimal set of the attribute d if A contains a minimal set of d. Let Qd be the family of all relative reducts of DS, and Pd be the family of all relative minimal sets of the attribute d on s. We prove that the problem whether Qd ⊆ Pd is co-NP-complete. However, the problem whether Pd ⊆ Qd is in P .

It's about bits of machines & stuff:why girls don't 'do' engineering

This paper draws upon part of the findings of an ethnographic study in which two seventeen year old girls were employed to interview their peer about engineering as a study and career choice. It argues that whilst girls do view engineering as being generally masculine in nature, other factors such as a lack of female role models and an emphasis on physics and maths act as barriers to young women entering the discipline. The paper concludes by noting that engineering has much to offer young women, the problem is, they simply don't know this is the case! Copyright © 2013 Jane Andrews & Robin Clark.

Toward a scalable and consistent manufacturing process for the production of human MSCs

The development of novel, affordable and efficacious therapeutics will be necessary to ensure the continued progression in the standard of global healthcare. With the potential to address previously unmet patient needs as well as tackling the social and economic effects of chronic and age-related conditions, cell therapies will lead the new generation of healthcare products set to improve health and wealth across the globe. However, if many of the small to medium enterprises (SMEs) engaged in much of the commercialization efforts are to successfully traverse the ‘Valley of Death’ as they progress through clinical trials, there are a number of challenges that must be overcome. No longer do the challenges remain biological but rather a series of engineering and manufacturing issues must also be considered and addressed.

Consistent reduction of postprandial glucagon and insulin by lixisenatide in the GetGoal clinical trial programme

Background and aims: Glucagon-like peptide-1 (GLP-1) receptor agonists improve islet function and delay gastric emptying in subjects with type 2 diabetes mellitus. We evaluated 2-hour glucose, glucagon and insulin changes following a standardized mixed-meal tolerance test before and after 24 weeks of treatment with the once-daily prandial GLP-1 receptor agonist lixisenatide (approved for a therapeutic dose of 20 μg once daily) in six randomized, placebo-controlled studies within the lixisenatide Phase III GetGoal programme. In the studies, the mixed-meal test was conducted before and after: (1) lixisenatide treatment in patients insufficiently controlled despite diet and exercise (GetGoal-Mono), (2) lixisenatide treatment in combination with oral antidiabetic drugs (OADs) (GetGoal-M and GetGoal-S), or (3) lixisenatide treatment in combination with basal insulin ± OAD (GetGoal-Duo 1, GetGoal-L and GetGoal-L-Asia).Materials and methods: A meta-analysis was performed (lixisenatide n=1124 vs placebo n=707) combining ANCOVA least squares (LS) mean values using an inverse variance weighted analysis. Results: Lixisenatide significantly reduced 2-hour postprandial glucose from baseline (LS mean difference vs placebo: -4.9 mmol/L, p<0.0001, Figure) and glucose excursions (LS mean difference vs placebo: -4.5 mmol/L, p<0.0001). As measured in two studies, lixisenatide also reduced postprandial glucagon (LS mean difference vs placebo: -19.0 ng/L, p<0.0001) and insulin (LS mean difference vs placebo: -64.8 pmol/L, p<0.0001), although the glucagon/insulin ratio was increased (LS mean difference vs placebo: 0.15, p=0.02) compared with placebo. Conclusion: The results show that lixisenatide potently reduces the glucose excursion after meal ingestion in subjects with type 2 diabetes, in association with marked reductions in glucagon and insulin levels. It is suggested that diminished glucagon secretion and slower gastric emptying contribute to reduced hepatic glucose production and delayed glucose absorption, enabling postprandial glycaemia to be controlled with less demand on beta-cell insulin secretion. Clinical Trial Registration Number: NCT00688701; NCT00712673; NCT00713830; NCT00975286; NCT00715624; NCT00866658 Supported by: Sanofi

Acute Exposure to Terrestrial Trunked Radio (TETRA) has effects on the electroencephalogram and electrocardiogram, consistent with vagal nerve stimulation

BACKGROUND: Terrestrial Trunked Radio (TETRA) is a telecommunications system widely used by police and emergency services around the world. The Stewart Report on mobile telephony and health raised questions about possible health effects associated with TETRA signals. This study investigates possible effects of TETRA signals on the electroencephalogram and electrocardiogram in human volunteers. METHODS: Blinded randomized provocation study with a standardized TETRA signal or sham exposure. In the first of two experiments, police officers had a TETRA set placed first against the left temple and then the upper-left quadrant of the chest and the electroencephalogram was recorded during rest and active cognitive processing. In the second experiment, volunteers were subject to chest exposure of TETRA whilst their electroencephalogram and heart rate variability derived from the electrocardiogram were recorded. RESULTS: In the first experiment, we found that exposure to TETRA had consistent neurophysiological effects on the electroencephalogram, but only during chest exposure, in a pattern suggestive of vagal nerve stimulation. In the second experiment, we observed changes in heart rate variability during exposure to TETRA but the electroencephalogram effects were not replicated. CONCLUSIONS: Observed effects of exposure to TETRA signals on the electroencephalogram (first experiment) and electrocardiogram are consistent with vagal nerve stimulation in the chest by TETRA. However given the small effect on heart rate variability and the lack of consistency on the electroencephalogram, it seems unlikely that this will have a significant impact on health. Long-term monitoring of the health of the police force in relation to TETRA use is on-going.

On pairwise comparison matrices that can be made consistent by the modification of a few elements

Pairwise comparison matrices are often used in Multi-attribute Decision Making forweighting the attributes or for the evaluation of the alternatives with respect to a criteria. Matrices provided by the decision makers are rarely consistent and it is important to index the degree of inconsistency. In the paper, the minimal number of matrix elements by the modification of which the pairwise comparison matrix can be made consistent is examined. From practical point of view, the modification of 1, 2, or, for larger matrices, 3 elements seems to be relevant. These cases are characterized by using the graph representation of the matrices. Empirical examples illustrate that pairwise comparison matrices that can be made consistent by the modification of a few elements are present in the applications.

Páros összehasonlításon alapuló pontozási eljárások monotonitása: önkonzisztencia és önkonzisztens monotonitás. Adalékok a pontozási eljárások axiomatikus tárgyalásához = Monotonicity of paired comparison-based ranking methods: self-consistency and self-consistent monotonicity. Contributions to an axiomatic analysis of scoring methods

A cikk a páros összehasonlításokon alapuló pontozási eljárásokat tárgyalja axiomatikus megközelítésben. A szakirodalomban számos értékelő függvényt javasoltak erre a célra, néhány karakterizációs eredmény is ismert. Ennek ellenére a megfelelő módszer kiválasztása nem egy-szerű feladat, a különböző tulajdonságok bevezetése elsősorban ebben nyújthat segítséget. Itt az összehasonlított objektumok teljesítményén érvényesülő monotonitást tárgyaljuk az önkonzisztencia és önkonzisztens monotonitás axiómákból kiindulva. Bemutatásra kerülnek lehetséges gyengítéseik és kiterjesztéseik, illetve egy, az irreleváns összehasonlításoktól való függetlenséggel kapcsolatos lehetetlenségi tétel is. A tulajdonságok teljesülését három eljárásra, a klasszikus pontszám eljárásra, az ezt továbbfejlesztő általánosított sorösszegre és a legkisebb négyzetek módszerére vizsgáljuk meg, melyek mindegyike egy lineáris egyenletrendszer megoldásaként számítható. A kapott eredmények új szempontokkal gazdagítják a pontozási eljárás megválasztásának kérdését. _____ The paper provides an axiomatic analysis of some scoring procedures based on paired comparisons. Several methods have been proposed for these generalized tournaments, some of them have been also characterized by a set of properties. The choice of an appropriate method is supported by a discussion of their theoretical properties. In the paper we focus on the connections of self-consistency and self-consistent-monotonicity, two axioms based on the comparisons of object's performance. The contradiction of self-consistency and independence of irrel-evant matches is revealed, as well as some possible reductions and extensions of these properties. Their satisfiability is examined through three scoring procedures, the score, generalised row sum and least squares methods, each of them is calculated as a solution of a system of linear equations. Our results contribute to the problem of finding a proper paired comparison based scoring method.

How consistent is the new Common Agricultural Policy with the challenges it faces?

The latest reform of the Common Agricultural Policy (CAP) has recently been accepted, identifying important challenges for EU agriculture, but proposing only limited changes to the previous CAP. Now it is time for the implementation of the new measures. However, from a theoretical point of view, it seems that the CAP can hardly meet the challenges it faces due to the inconsistencies between the predefined challenges and the measures proposed to meet them. The aim of the paper is to systematically analyse the consistency between the challenges of European agriculture and the policy measures aimed at meeting them. It seems that not all measures are consistent with the challenges.

How consistent is the new common agricultural policy with the challenges it faces?

The latest reform of the Common Agricultural Policy (CAP) has recently been accepted, identifying important challenges for EU agriculture, but proposing only limited changes to the previous CAP. Now it is time for the implementation of the new measures. However, from a theoretical point of view, it seems that the CAP can hardly meet the challenges it faces due to the inconsistencies between the predefined challenges and the measures proposed to meet them. The aim of the paper is to systematically analyse the consistency between the challenges of European agriculture and the policy measures aimed at meeting them. It seems that not all measures are consistent with the challenges.

Algorithms for efficient transaction management and consistent queries in client -server semantic object-oriented parallel databases

Large read-only or read-write transactions with a large read set and a small write set constitute an important class of transactions used in such applications as data mining, data warehousing, statistical applications, and report generators. Such transactions are best supported with optimistic concurrency, because locking of large amounts of data for extended periods of time is not an acceptable solution. The abort rate in regular optimistic concurrency algorithms increases exponentially with the size of the transaction. The algorithm proposed in this dissertation solves this problem by using a new transaction scheduling technique that allows a large transaction to commit safely with significantly greater probability that can exceed several orders of magnitude versus regular optimistic concurrency algorithms. A performance simulation study and a formal proof of serializability and external consistency of the proposed algorithm are also presented.^ This dissertation also proposes a new query optimization technique (lazy queries). Lazy Queries is an adaptive query execution scheme which optimizes itself as the query runs. Lazy queries can be used to find an intersection of sub-queries in a very efficient way, which does not require full execution of large sub-queries nor does it require any statistical knowledge about the data.^ An efficient optimistic concurrency control algorithm used in a massively parallel B-tree with variable-length keys is introduced. B-trees with variable-length keys can be effectively used in a variety of database types. In particular, we show how such a B-tree was used in our implementation of a semantic object-oriented DBMS. The concurrency control algorithm uses semantically safe optimistic virtual "locks" that achieve very fine granularity in conflict detection. This algorithm ensures serializability and external consistency by using logical clocks and backward validation of transactional queries. A formal proof of correctness of the proposed algorithm is also presented. ^