STORRE Community: This community contains the ePrints and eTheses produced by Computing Science and Mathematics staff and students.
http://hdl.handle.net/1893/35
This community contains the ePrints and eTheses produced by Computing Science and Mathematics staff and students.Fri, 09 Jun 2023 14:00:26 GMT2023-06-09T14:00:26ZGlycated Haemoglobin A1c Variability Score Elicits Kidney Function Decline in Chinese People Living with Type 2 Diabetes
http://hdl.handle.net/1893/35190
Title: Glycated Haemoglobin A1c Variability Score Elicits Kidney Function Decline in Chinese People Living with Type 2 Diabetes
Author(s): Zhou, Yiling; Huang, Hongmei; Yan, Xueqin; Hapca, Simona; Bell, Samira; Qu, Furong; Liu, Li; Chen, Xiangyang; Zhang, Shengzhao; Shi, Qingyang; Zeng, Xiaoxi; Wang, Miye; Li, Nan; Du, Heyue; Meng, Wentong
Abstract: Our aim was to investigate the association of glycated haemoglobin A1c (HbA1c) variability score (HVS) with estimated glomerular filtration rate (eGFR) slope in Chinese adults living with type 2 diabetes. This cohort study included adults with type 2 diabetes attending outpatient clinics between 2011 and 2019 from a large electronic medical record-based database of diabetes in China (WECODe). We estimated the individual-level visit-to-visit HbA1c variability using HVS, a proportion of changes in HbA1c of ≥0.5% (5.5 mmol/mol). We estimated the odds of people experiencing a rapid eGFR annual decline using a logistic regression and differences across HVS categories in the mean eGFR slope using a mixed-effect model. The analysis involved 2397 individuals and a median follow-up of 4.7 years. Compared with people with HVS ≤ 20%, those with HVS of 60% to 80% had 11% higher odds of experiencing rapid eGFR annual decline, with an extra eGFR decline of 0.93 mL/min/1.73 m2 per year on average; those with HVS > 80% showed 26% higher odds of experiencing a rapid eGFR annual decline, with an extra decline of 1.83 mL/min/1.73 m2 per year on average. Chinese adults with type 2 diabetes and HVS > 60% could experience a more rapid eGFR decline.Tue, 01 Nov 2022 00:00:00 GMThttp://hdl.handle.net/1893/351902022-11-01T00:00:00ZGMM-IL: Image Classification Using Incrementally Learnt, Independent Probabilistic Models for Small Sample Sizes
http://hdl.handle.net/1893/35184
Title: GMM-IL: Image Classification Using Incrementally Learnt, Independent Probabilistic Models for Small Sample Sizes
Author(s): Johnston, Penny; Nogueira, Keiller; Swingler, Kevin
Abstract: When deep-learning classifiers try to learn new classes through supervised learning, they exhibit catastrophic forgetting issues. In this paper we propose the Gaussian Mixture Model - Incremental Learner (GMM-IL), a novel two-stage architecture that couples unsupervised visual feature learning with supervised probabilistic models to represent each class. The key novelty of GMM-IL is that each class is learnt independently of the other classes. New classes can be incrementally learnt using a small set of annotated images with no requirement to relearn data from existing classes. This enables the incremental addition of classes to a model, that can be indexed by visual features and reasoned over based on perception. Using Gaussian Mixture Models to represent the independent classes, we outperform a benchmark of an equivalent network with a Softmax head, obtaining increased accuracy for sample sizes smaller than 12 and increased weighted F1 score for 3 imbalanced class profiles in that sample range. This novel method enables new classes to be added to a system with only access to a few annotated images of the new class.Sun, 01 Jan 2023 00:00:00 GMThttp://hdl.handle.net/1893/351842023-01-01T00:00:00ZProgram Transformation Landscapes for Automated Program Modification Using Gin
http://hdl.handle.net/1893/35130
Title: Program Transformation Landscapes for Automated Program Modification Using Gin
Author(s): Petke, Justyna; Alexander, Brad; Barr, Earl T; Brownlee, Alexander; Wagner, Markus; White, David
Abstract: Automated program modification underlies two successful research areas-genetic improvement and program repair. Under the generate-and-validate strategy, automated program modification transforms a program, then validates the result against a test suite. Much work has focused on the search space of application of single fine-grained operators-copy, delete, replace , and swap at both line and statement granularity. This work explores the limits of this strategy. We scale up existing findings an order of magnitude from small corpora to 10 real-world Java programs comprising up to 500k LoC. We decisively show that the grammar-specificity of statement granular edits pays off: its pass rate triples that of line edits and uses 10% less computational resources. We confirm previous findings that delete is the most effective operator for creating test-suite equivalent program variants. We go farther than prior work by exploring the limits of delete's effectiveness by exhaustively applying it. We show this strategy is too costly in practice to be used to search for improved software variants. We further find that pass rates drop from 12-34% for single statement edits to 2-6% for 5-edit sequences, which implies that further progress will need human-inspired operators that target specific faults or improvements. A program is amenable to automated modification to the extent to which automatically editing it is likely to produce test-suite passing variants. We are the first to systematically search for a code measure that correlates with a program's amenability to automated modification. We found no strong correlations , leaving the question open.http://hdl.handle.net/1893/35130Some classes of topological vector spaces associated with the Closed graph theorem
http://hdl.handle.net/1893/35115
Title: Some classes of topological vector spaces associated with the Closed graph theorem
Author(s): Popoola, Joseph Oyeniyi
Abstract: Introduction: Given two topological vector spaces E and F and a linear mapping t : E → F with a closed graph, t may or may not be continuous. When such a linear mapping t is necessarily continuous, the closed graph theorem is said to hold for E and F . For example, if E and F are Banach spaces, then every linear mapping with a closed graph of E into F is necessarily continuous.
The main aim of this thesis is to give precise descriptions of certain topological vector spaces that can serve as domain spaces, and also those that can serve as range spaces for a closed graph theorem. This is motivated by the works of M. Mahowald [35], N. Adasch [1], V. Eberhardt [12, 14, 11] and N.J. Kalton [25],
Chapter 2 of the thesis is concerned with the concept of essential separability which turns out to be a useful variation of separability. We look at various characterizations of essential separability and link it up with the well-known concepts of weak compactness and weak relative compactness (Section 2.2).
In Chapter 3, we introduce the class of 6-barrelled spaces which serve as domain spaces for some closed graph theorems (Theorems 3.1.2 and 4,1.3). We show that in the separated case, 6-barrelled spaces can be characterized in terms of essential separability (Theorem 3.1.1). We establish also some of the basic permanence properties of 6-barrelled spaces including the countable codimensional subspace property (Theorem 3.1.6). It is seen that the class of separated δ-barrelled spaces is a proper subclass of Kalton's domain spaces and strictly contains the class of separated barrelled spaces (Example 3.1.1(a), (d)). Also in this Chapter, conditions under which a δ-barrelled space is barrelled are considered.
In Chapter 4, those locally convex spaces which can serve as range spaces in our closed graph theorem in which the domain space is an arbitrary δ-barrelled space with its Mackey topology are considered. These are the infra- δ-spaces. We also look at the domain spaces (δ-spaces) for the corresponding open mapping theorem (Theorem 4.1.4).
Finally, Chapter 5 deals with some topics that are closely related to the concept of δ-barrelledness. In particular, we look at the closed graph theorem when the range space is not assumed to be complete. Then we generalize δ-barrelledness to δ-ultrabarrelledness in general topological vector spaces. In a way similar to the characterization of δ-barrelledness, we obtain a characterization of δ-ultrabarrelledness by means of a closed graph theorem (Theorem 5.2.2). We end the Chapter with a generalization of some of our concepts to arbitrary infinite cardinals.Thu, 01 Jan 1976 00:00:00 GMThttp://hdl.handle.net/1893/351151976-01-01T00:00:00Z