Developing learning cohorts for postgraduate research degrees

Development of researchers through higher degree research studies is a high priority in most universities. Yet, research about supervision as pedagogy and models of supervision is only recently gained increasing attention. Charged with producing good researchers within very limited resources, academics are constantly looking for more efficient models of supervision for higher degree research students. A cohort model of supervision promises several efficiencies, but we argue that its success lies importantly on how well the cohort is developed specifically for higher degree research studies. We drew on a growing body of literature on higher degree research supervision to design, implement and evaluate our approach to developing a cohort of seven students enrolled in the Master of Education (Research) degree. Our approach included four provisions: initial residential workshop, development of a learning community, nourishing scholarship, and ongoing learning opportunities. The four provisions resulted in gradually developing an environment and culture that students found very supportive and nurturing. This paper is based on the findings from data collected from student evaluations in the first year of studies, feedback from the cohort’s sponsor, and our reflective notes. The evaluation substantiated the value in investing time and resources for purposely developing a cohort for higher degree research studies. Whether the cohorts are sponsored or not, universities will still need to invest time and resources for cohort development if a cohort model is intended to gain wider efficiencies in supervision of higher degree research students.

A multi-hierarchical motorway ramp signalling strategy

Ramp signalling is an access control for motorways, in which a traffic signal is placed at on-ramps to regulate the rate of vehicles entering the motorway and thus to preserve the motorway capacity. In general, ramp signalling algorithms fall into two categories: local control and coordinated control by their effective scope. Coordinated ramp signalling strategies make use of measurements from the entire motorway network to operate individual ramp signals for the optimal performances at the network level. This study proposes a multi-hierarchical strategy for coordinated ramp signalling. The strategy is structured in two layers. At the higher layer with a longer update interval, coordination group is assembled and disassembled based on the location of high-risk breakdown flow. At the lower layer with a shorter update interval, individual ramps are hired to serve the coordination and are also released based on the prevailing congestion level on the ramp. This strategy is modelled and applied to the northbound Pacific Motorway micro-simulation platform (AIMSUN). The simulation results show an effective congestion mitigation of the proposed strategy.

Beyond BIM: It’s not the end of the road!

Over several decades, academics around the world have investigated the necessary tools, techniques, and conditions which would allow BIM (building information modeling) to become a positive force in the world of construction. As the research results matured, BIM started to become commercially available. Researchers and many in industry soon realized that BIM, as a technological innovation, was, in and of itself, not the end point in the journey. The technical adoption of BIM has to be supported by process and culture change within organizations to make a real impact on a project (for example, see AECbytes Viewpoint #35 by Chuck Eastman, Paul Teicholz, Rafael Sacks and Kathleen Liston). Current academic research aims to understand the steps beyond BIM, which will help chart the future of our industry over the coming decades. This article describes an international research effort in this area, coordinated by the Integrated Design and Delivery Solutions (IDDS) initiative of the CIB (International Council for Research and Innovation in Building and Construction). We hope that it responds to and extends the discussion initiated by Brian Lighthart in AECbytes Viewpoint #56, which asked about who is charting future BIM directions.

Electrical imaging and fluid modeling of convective fingering in a shallow water-table aquifer

Unstable density-driven flow can lead to enhanced solute transport in groundwater. Only recently has the complex fingering pattern associated with free convection been documented in field settings. Electrical resistivity (ER) tomography has been used to capture a snapshot of convective instabilities at a single point in time, but a thorough transient analysis is still lacking in the literature. We present the results of a 2 year experimental study at a shallow aquifer in the United Arab Emirates that was designed to specifically explore the transient nature of free convection. ER tomography data documented the presence of convective fingers following a significant rainfall event. We demonstrate that the complex fingering pattern had completely disappeared a year after the rainfall event. The observation is supported by an analysis of the aquifer halite budget and hydrodynamic modeling of the transient character of the fingering instabilities. Modeling results show that the transient dynamics of the gravitational instabilities (their initial development, infiltration into the underlying lower-density groundwater, and subsequent decay) are in agreement with the timing observed in the time-lapse ER measurements. All experimental observations and modeling results are consistent with the hypothesis that a dense brine that infiltrated into the aquifer from a surficial source was the cause of free convection at this site, and that the finite nature of the dense brine source and dispersive mixing led to the decay of instabilities with time. This study highlights the importance of the transience of free convection phenomena and suggests that these processes are more rapid than was previously understood.

Object tracking via non-Euclidean geometry : a Grassmann approach

A robust visual tracking system requires an object appearance model that is able to handle occlusion, pose, and illumination variations in the video stream. This can be difficult to accomplish when the model is trained using only a single image. In this paper, we first propose a tracking approach based on affine subspaces (constructed from several images) which are able to accommodate the abovementioned variations. We use affine subspaces not only to represent the object, but also the candidate areas that the object may occupy. We furthermore propose a novel approach to measure affine subspace-to-subspace distance via the use of non-Euclidean geometry of Grassmann manifolds. The tracking problem is then considered as an inference task in a Markov Chain Monte Carlo framework via particle filtering. Quantitative evaluation on challenging video sequences indicates that the proposed approach obtains considerably better performance than several recent state-of-the-art methods such as Tracking-Learning-Detection and MILtrack.

Random projections on manifolds of symmetric positive definite matrices for image classification

Recent advances suggest that encoding images through Symmetric Positive Definite (SPD) matrices and then interpreting such matrices as points on Riemannian manifolds can lead to increased classification performance. Taking into account manifold geometry is typically done via (1) embedding the manifolds in tangent spaces, or (2) embedding into Reproducing Kernel Hilbert Spaces (RKHS). While embedding into tangent spaces allows the use of existing Euclidean-based learning algorithms, manifold shape is only approximated which can cause loss of discriminatory information. The RKHS approach retains more of the manifold structure, but may require non-trivial effort to kernelise Euclidean-based learning algorithms. In contrast to the above approaches, in this paper we offer a novel solution that allows SPD matrices to be used with unmodified Euclidean-based learning algorithms, with the true manifold shape well-preserved. Specifically, we propose to project SPD matrices using a set of random projection hyperplanes over RKHS into a random projection space, which leads to representing each matrix as a vector of projection coefficients. Experiments on face recognition, person re-identification and texture classification show that the proposed approach outperforms several recent methods, such as Tensor Sparse Coding, Histogram Plus Epitome, Riemannian Locality Preserving Projection and Relational Divergence Classification.

Matching image sets via adaptive multi convex hull

Traditional nearest points methods use all the samples in an image set to construct a single convex or affine hull model for classification. However, strong artificial features and noisy data may be generated from combinations of training samples when significant intra-class variations and/or noise occur in the image set. Existing multi-model approaches extract local models by clustering each image set individually only once, with fixed clusters used for matching with various image sets. This may not be optimal for discrimination, as undesirable environmental conditions (eg. illumination and pose variations) may result in the two closest clusters representing different characteristics of an object (eg. frontal face being compared to non-frontal face). To address the above problem, we propose a novel approach to enhance nearest points based methods by integrating affine/convex hull classification with an adapted multi-model approach. We first extract multiple local convex hulls from a query image set via maximum margin clustering to diminish the artificial variations and constrain the noise in local convex hulls. We then propose adaptive reference clustering (ARC) to constrain the clustering of each gallery image set by forcing the clusters to have resemblance to the clusters in the query image set. By applying ARC, noisy clusters in the query set can be discarded. Experiments on Honda, MoBo and ETH-80 datasets show that the proposed method outperforms single model approaches and other recent techniques, such as Sparse Approximated Nearest Points, Mutual Subspace Method and Manifold Discriminant Analysis.

Automatic classification of human epithelial type 2 cell indirect immunofluorescence images using cell pyramid matching

This paper describes a novel system for automatic classification of images obtained from Anti-Nuclear Antibody (ANA) pathology tests on Human Epithelial type 2 (HEp-2) cells using the Indirect Immunofluorescence (IIF) protocol. The IIF protocol on HEp-2 cells has been the hallmark method to identify the presence of ANAs, due to its high sensitivity and the large range of antigens that can be detected. However, it suffers from numerous shortcomings, such as being subjective as well as time and labour intensive. Computer Aided Diagnostic (CAD) systems have been developed to address these problems, which automatically classify a HEp-2 cell image into one of its known patterns (eg. speckled, homogeneous). Most of the existing CAD systems use handpicked features to represent a HEp-2 cell image, which may only work in limited scenarios. We propose a novel automatic cell image classification method termed Cell Pyramid Matching (CPM), which is comprised of regional histograms of visual words coupled with the Multiple Kernel Learning framework. We present a study of several variations of generating histograms and show the efficacy of the system on two publicly available datasets: the ICPR HEp-2 cell classification contest dataset and the SNPHEp-2 dataset.

Improved image set classification via joint sparse approximated nearest subspaces

Existing multi-model approaches for image set classification extract local models by clustering each image set individually only once, with fixed clusters used for matching with other image sets. However, this may result in the two closest clusters to represent different characteristics of an object, due to different undesirable environmental conditions (such as variations in illumination and pose). To address this problem, we propose to constrain the clustering of each query image set by forcing the clusters to have resemblance to the clusters in the gallery image sets. We first define a Frobenius norm distance between subspaces over Grassmann manifolds based on reconstruction error. We then extract local linear subspaces from a gallery image set via sparse representation. For each local linear subspace, we adaptively construct the corresponding closest subspace from the samples of a probe image set by joint sparse representation. We show that by minimising the sparse representation reconstruction error, we approach the nearest point on a Grassmann manifold. Experiments on Honda, ETH-80 and Cambridge-Gesture datasets show that the proposed method consistently outperforms several other recent techniques, such as Affine Hull based Image Set Distance (AHISD), Sparse Approximated Nearest Points (SANP) and Manifold Discriminant Analysis (MDA).

Spotlight on ... Philately : a tale of two postage stamps - following the things

I found it on eBay: ‘Jamaica GB used in 1858 6d x 2 sg Z5 used on piece A01 [Kingston] 1858’. Offered for sale by a stamp dealer on the Isle of Man was a scrap of blue paper, apparently part of an old envelope or torn off a sealed, folded letter, on which was stuck an attached pair of British postage stamps, each bearing the image of a young Queen Victoria

The impacts of variable speed limit on speed variation and headway distribution

This thesis investigates the impacts of variable speed limit on motorway speed variation and headway distribution. Initiative techniques of traffic flow categorisation study contribute in analysing the effects of variable speed limit on various traffic states. The project focuses on the speed harmonisation impacts within and across lanes as well as the uniformity of headway spread in the application of variable speed limit.

An efficient eAuction potocol

A secure protocol for electronic, sealed-bid, single item auctions is presented. The protocol caters to both first and second price (Vickrey) auctions and provides full price flexibility. Both computational and communication cost are linear with the number of bidders and utilize only standard cryptographic primitives. The protocol strictly divides knowledge of the bidder's identity and their actual bids between, respectively, a registration authority and an auctioneer, who are assumed not to collude but may be separately corrupt. This assures strong bidder-anonymity, though only weak bid privacy. The protocol is structured in two phases, each involving only off-line communication. Registration, requiring the use of the public key infrastructure, is simultaneous with hash-sealed bid-commitment and generates a receipt to the bidder containing a pseudonym. This phase is followed by encrypted bid-submission. Both phases involve the registration authority acting as a communication conduit but the actual message size is quite small. It is argued that this structure guarantees non-repudiation by both the winner and the auctioneer. Second price correctness is enforced either by observing the absence of registration of the claimed second-price bid or, where registered but lower than the actual second price, is subject to cooperation by the second price bidder - presumably motivated through self-interest. The use of the registration authority in other contexts is also considered with a view to developing an architecture for efficient secure multiparty transactions

Analysis of albumin-associated peptides and proteins from ovarian cancer patients

Albumin binds low–molecular-weight molecules, including proteins and peptides, which then acquire its longer half-life, thereby protecting the bound species from kidney clearance. We developed an experimental method to isolate albumin in its native state and to then identify [mass spectrometry (MS) sequencing] the corresponding bound low–molecular-weight molecules. We used this method to analyze pooled sera from a human disease study set (high-risk persons without cancer, n= 40; stage I ovarian cancer, n = 30; stage III ovarian cancer, n = 40) to demonstrate the feasibility of this approach as a discovery method. Methods Albumin was isolated by solid-phase affinity capture under native binding and washing conditions. Captured albumin-associated proteins and peptides were separated by gel electrophoresis and subjected to iterative MS sequencing by microcapillary reversed-phase tandem MS. Selected albumin-bound protein fragments were confirmed in human sera by Western blotting and immunocompetition. Results In total, 1208 individual protein sequences were predicted from all 3 pools. The predicted sequences were largely fragments derived from proteins with diverse biological functions. More than one third of these fragments were identified by multiple peptide sequences, and more than one half of the identified species were in vivo cleavage products of parent proteins. An estimated 700 serum peptides or proteins were predicted that had not been reported in previous serum databases. Several proteolytic fragments of larger molecules that may be cancer-related were confirmed immunologically in blood by Western blotting and peptide immunocompetition. BRCA2, a 390-kDa low-abundance nuclear protein linked to cancer susceptibility, was represented in sera as a series of specific fragments bound to albumin. Conclusion Carrier-protein harvesting provides a rich source of candidate peptides and proteins with potential diverse tissue and cellular origins that may reflect important disease-related information.