Video analytics for the detection of near-miss incidents on approach to railway level crossings

Recent modelling of socio-economic costs by the Australian railway industry in 2010 has estimated the cost of level crossing accidents to exceed AU$116 million annually. To better understand causal factors that contribute to these accidents, the Cooperative Research Centre for Rail Innovation is running a project entitled Baseline Level Crossing Video. The project aims to improve the recording of level crossing safety data by developing an intelligent system capable of detecting near-miss incidents and capturing quantitative data around these incidents. To detect near-miss events at railway level crossings a video analytics module is being developed to analyse video footage obtained from forward-facing cameras installed on trains. This paper presents a vision base approach for the detection of these near-miss events. The video analytics module is comprised of object detectors and a rail detection algorithm, allowing the distance between a detected object and the rail to be determined. An existing publicly available Histograms of Oriented Gradients (HOG) based object detector algorithm is used to detect various types of vehicles in each video frame. As vehicles are usually seen from a sideway view from the cabin’s perspective, the results of the vehicle detector are verified using an algorithm that can detect the wheels of each detected vehicle. Rail detection is facilitated using a projective transformation of the video, such that the forward-facing view becomes a bird’s eye view. Line Segment Detector is employed as the feature extractor and a sliding window approach is developed to track a pair of rails. Localisation of the vehicles is done by projecting the results of the vehicle and rail detectors on the ground plane allowing the distance between the vehicle and rail to be calculated. The resultant vehicle positions and distance are logged to a database for further analysis. We present preliminary results regarding the performance of a prototype video analytics module on a data set of videos containing more than 30 different railway level crossings. The video data is captured from a journey of a train that has passed through these level crossings.

Skating on Olympic ice: working with winter Olympians

Working as a sport psychologist with Olympic athletes requires a clear understanding of a broad range of multifaceted individual, group, situational, and environmental issues, all of which have the ability to impact upon performance. This article provides an overview of some of the common yet vital issues that have been observed to arise when working with Olympic Winter Games athletes and teams; what to expect, how to recognise them when they occur, and why they are important to prepare for in the context of supporting athletes to achieve the best performance they can at an Olympic Games. Aimed at the emerging sport psychology practitioner, discussion of issues such as performing under pressure, dealing with distractions, adjusting to external factors, team culture, and servicing models creates an informal set of “practical guidelines” based upon real-world experiences that can also be applied to other major sporting competitions.

Active security in multiparty computation over black-box groups

Most previous work on unconditionally secure multiparty computation has focused on computing over a finite field (or ring). Multiparty computation over other algebraic structures has not received much attention, but is an interesting topic whose study may provide new and improved tools for certain applications. At CRYPTO 2007, Desmedt et al introduced a construction for a passive-secure multiparty multiplication protocol for black-box groups, reducing it to a certain graph coloring problem, leaving as an open problem to achieve security against active attacks. We present the first n-party protocol for unconditionally secure multiparty computation over a black-box group which is secure under an active attack model, tolerating any adversary structure Δ satisfying the Q 3 property (in which no union of three subsets from Δ covers the whole player set), which is known to be necessary for achieving security in the active setting. Our protocol uses Maurer’s Verifiable Secret Sharing (VSS) but preserves the essential simplicity of the graph-based approach of Desmedt et al, which avoids each shareholder having to rerun the full VSS protocol after each local computation. A corollary of our result is a new active-secure protocol for general multiparty computation of an arbitrary Boolean circuit.

An algebraic analysis of trivium ciphers based on the boolean satisfiability problem

Trivium is a stream cipher candidate of the eStream project. It has successfully moved into phase three of the selection process under the hardware category. No attacks faster than the exhaustive search have so far been reported on Trivium. Bivium-A and Bivium-B are simplified versions of Trivium that are built on the same design principles but with two registers. The simplified design is useful in investigating Trivium type ciphers with a reduced complexity and provides insight into effective attacks which could be extended to Trivium. This paper focuses on an algebraic analysis which uses the boolean satisfiability problem in propositional logic. For reduced variants of the cipher, this analysis recovers the internal state with a minimal amount of keystream observations.

On secure multi-party computation in black-box groups

We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function f G (x 1,...,x n ) = x 1 ·x 2 ⋯ x n in an arbitrary finite group (G,·), where the input of party P i is x i  ∈ G for i = 1,...,n. For flexibility, we are interested in protocols for f G which require only black-box access to the group G (i.e. the only computations performed by players in the protocol are a group operation, a group inverse, or sampling a uniformly random group element). Our results are as follows. First, on the negative side, we show that if (G,·) is non-abelian and n ≥ 4, then no ⌈n/2⌉-private protocol for computing f G exists. Second, on the positive side, we initiate an approach for construction of black-box protocols for f G based on k-of-k threshold secret sharing schemes, which are efficiently implementable over any black-box group G. We reduce the problem of constructing such protocols to a combinatorial colouring problem in planar graphs. We then give two constructions for such graph colourings. Our first colouring construction gives a protocol with optimal collusion resistance t < n/2, but has exponential communication complexity O(n*2t+1^2/t) group elements (this construction easily extends to general adversary structures). Our second probabilistic colouring construction gives a protocol with (close to optimal) collusion resistance t < n/μ for a graph-related constant μ ≤ 2.948, and has efficient communication complexity O(n*t^2) group elements. Furthermore, we believe that our results can be improved by further study of the associated combinatorial problems.

An alternative theory of legacy information systems

Organisational dependence upon IT continues to grow yet experiences of satisfaction vary widely. Problematic, aged IT is often cited as being a fundamental problem in this respect and this is commonly termed legacy information systems. However, in this paper the author offers an alternative, and arguably more comprehensive, theory of legacy information systems that accommodates multiple viewpoints and recognises its inherent dynamism. The paper suggests a theory of legacy information systems that comprises of the concepts of temporal effects, interpretations and characteristics. It is argued that legacy information systems are constructed of many ‘legacies’ that are handed down continuously, forming an amorphous set of sociotechnical interdependencies and relationships.

FaceXpress : an integrated software suite for facial emotion stimulus manipulation and facial measurement

The characterisation of facial expression through landmark-based analysis methods such as FACEM (Pilowsky & Katsikitis, 1994) has a variety of uses in psychiatric and psychological research. In these systems, important structural relationships are extracted from images of facial expressions by the analysis of a pre-defined set of feature points. These relationship measures may then be used, for instance, to assess the degree of variability and similarity between different facial expressions of emotion. FaceXpress is a multimedia software suite that provides a generalised workbench for landmark-based facial emotion analysis and stimulus manipulation. It is a flexible tool that is designed to be specialised at runtime by the user. While FaceXpress has been used to implement the FACEM process, it can also be configured to support any other similar, arbitrary system for quantifying human facial emotion. FaceXpress also implements an integrated set of image processing tools and specialised tools for facial expression stimulus production including facial morphing routines and the generation of expression-representative line drawings from photographs.

Optimal eradication: When to stop looking for an invasive plant

The notion of being sure that you have completely eradicated an invasive species is fanciful because of imperfect detection and persistent seed banks. Eradication is commonly declared either on an ad hoc basis, on notions of seed bank longevity, or on setting arbitrary thresholds of 1% or 5% confidence that the species is not present. Rather than declaring eradication at some arbitrary level of confidence, we take an economic approach in which we stop looking when the expected costs outweigh the expected benefits. We develop theory that determines the number of years of absent surveys required to minimize the net expected cost. Given detection of a species is imperfect, the optimal stopping time is a trade-off between the cost of continued surveying and the cost of escape and damage if eradication is declared too soon. A simple rule of thumb compares well to the exact optimal solution using stochastic dynamic programming. Application of the approach to the eradication programme of Helenium amarum reveals that the actual stopping time was a precautionary one given the ranges for each parameter. © 2006 Blackwell Publishing Ltd/CNRS.

Effect and process evaluations of an early childhood obesity prevention intervention

The thesis develops a summative evaluation framework of the NOURISH Randomised Controlled Trial, and applies this to a selection of maternal feeding choice outcomes of the programme. The research is based on an ecological model of the complex set of factors that need to be acted upon to address childhood obesity. The novel approach extends the standard RCT effect evaluation, while also conducting an in-depth evaluation of the process of programme development and implementation. Research findings identify adaptations of intervention delivery that could improve its effectiveness and translatability, in a new cycle of the programme.

Facing the wave of change: Stakeholder perspectives on climate adaptation for Australian seafood supply chains

Climate change is one of the most important issues confronting the sustainable supply of seafood, with projections suggesting major effects on wild and farmed fisheries worldwide. While climate change has been a consideration for Australian fisheries and aquaculture management, emphasis in both research and adaptation effort has been at the production end of supply chains—impacts further along the chain have been overlooked to date. A holistic biophysical and socio-economic system view of seafood industries, as represented by end-to-end supply chains, may lead to an additional set of options in the face of climate change, thus maximizing opportunities for improved fishery profitability, while also reducing the potential for maladaptation. In this paper, we explore Australian seafood industry stakeholder perspectives on potential options for adaptation along seafood supply chains based on future potential scenarios. Stakeholders, representing wild capture and aquaculture industries, provided a range of actions targeting different stages of the supply chain. Overall, proposed strategies were predominantly related to the production end of the supply chain, suggesting that greater attention in developing adaptation options is needed at post-production stages. However, there are chain-wide adaptation strategies that can present win–win scenarios, where commercial objectives beyond adaptation can also be addressed alongside direct or indirect impacts of climate. Likewise, certain adaptation strategies in place at one stage of the chain may have varying implications on other stages of the chain. These findings represent an important step in understanding the role of supply chains in effective adaptation of fisheries and aquaculture industries to climate change.

Molecular self-assembly on graphene

The formation of ordered arrays of molecules via self-assembly is a rapid, scalable route towards the realization of nanoscale architectures with tailored properties. In recent years, graphene has emerged as an appealing substrate for molecular self-assembly in two dimensions. Here, the first five years of progress in supramolecular organization on graphene are reviewed. The self-assembly process can vary depending on the type of graphene employed: epitaxial graphene, grown in situ on a metal surface, and non-epitaxial graphene, transferred onto an arbitrary substrate, can have different effects on the final structure. On epitaxial graphene, the process is sensitive to the interaction between the graphene and the substrate on which it is grown. In the case of graphene that strongly interacts with its substrate, such as graphene/Ru(0001), the inhomogeneous adsorption landscape of the graphene moiré superlattice provides a unique opportunity for guiding molecular organization, since molecules experience spatially constrained diffusion and adsorption. On weaker-interacting epitaxial graphene films, and on non-epitaxial graphene transferred onto a host substrate, self-assembly leads to films similar to those obtained on graphite surfaces. The efficacy of a graphene layer for facilitating planar adsorption of aromatic molecules has been repeatedly demonstrated, indicating that it can be used to direct molecular adsorption, and therefore carrier transport, in a certain orientation, and suggesting that the use of transferred graphene may allow for predictible molecular self-assembly on a wide range of surfaces.

Bounds on isoperimetric values of trees

Let G = (V, E) be a finite, simple and undirected graph. For S subset of V, let delta(S, G) = {(u, v) is an element of E : u is an element of S and v is an element of V - S} be the edge boundary of S. Given an integer i, 1 <= i <= vertical bar V vertical bar, let the edge isoperimetric value of G at i be defined as b(e)(i, G) = min(S subset of V:vertical bar S vertical bar=i)vertical bar delta(S, G)vertical bar. The edge isoperimetric peak of G is defined as b(e)(G) = max(1 <= j <=vertical bar V vertical bar)b(e)(j, G). Let b(v)(G) denote the vertex isoperimetric peak defined in a corresponding way. The problem of determining a lower bound for the vertex isoperimetric peak in complete t-ary trees was recently considered in [Y. Otachi, K. Yamazaki, A lower bound for the vertex boundary-width of complete k-ary trees, Discrete Mathematics, in press (doi: 10.1016/j.disc.2007.05.014)]. In this paper we provide bounds which improve those in the above cited paper. Our results can be generalized to arbitrary (rooted) trees. The depth d of a tree is the number of nodes on the longest path starting from the root and ending at a leaf. In this paper we show that for a complete binary tree of depth d (denoted as T-d(2)), c(1)d <= b(e) (T-d(2)) <= d and c(2)d <= b(v)(T-d(2)) <= d where c(1), c(2) are constants. For a complete t-ary tree of depth d (denoted as T-d(t)) and d >= c log t where c is a constant, we show that c(1)root td <= b(e)(T-d(t)) <= td and c(2)d/root t <= b(v) (T-d(t)) <= d where c(1), c(2) are constants. At the heart of our proof we have the following theorem which works for an arbitrary rooted tree and not just for a complete t-ary tree. Let T = (V, E, r) be a finite, connected and rooted tree - the root being the vertex r. Define a weight function w : V -> N where the weight w(u) of a vertex u is the number of its successors (including itself) and let the weight index eta(T) be defined as the number of distinct weights in the tree, i.e eta(T) vertical bar{w(u) : u is an element of V}vertical bar. For a positive integer k, let l(k) = vertical bar{i is an element of N : 1 <= i <= vertical bar V vertical bar, b(e)(i, G) <= k}vertical bar. We show that l(k) <= 2(2 eta+k k)

Composite field approximations for ion traps with apertures on electrodes

This paper presents two approximate analytical expressions for nonlinear electric fields in the principal direction in axially symmetric (3D) and two dimensional (2D) ion trap mass analysers with apertures (holes in case of 3D traps and slits in case of 2D traps) on the electrodes. Considered together (3D and 2D), we present composite approximations for the principal unidirectional nonlinear electric fields in these ion traps. The composite electric field E has the form E = E-noaperture + E-aperture. where E-noaperture is the field within an imagined trap which is identical to the practical trap except that the apertures are missing and E-aperture is the field contribution due to apertures on the two trap electrodes. The field along the principal axis, of the trap can in this way be well approximated for any aperture that is not too large. To derive E-aperture. classical results of electrostatics have been extended to electrodes with finite thickness and different aperture shapes.E-noaperture is a modified truncated multipole expansion for the imagined trap with no aperture. The first several terms in the multipole expansion are in principle exact(though numerically determined using the BEM), while the last term is chosen to match the field at the electrode. This expansion, once Computed, works with any aperture in the practical trap. The composite field approximation for axially symmetric (3D) traps is checked for three geometries: the Paul trap, the cylindrical ion trap (CIT) and an arbitrary other trap. The approximation for 2D traps is verified using two geometries: the linear ion trap (LIT) and the rectilinear ion trap (RIT). In each case, for two aperture sizes (10% and 50% of the trap dimension), highly satisfactory fits are obtained. These composite approximations may be used in more detailed nonlinear ion dynamics Studies than have been hitherto attempted. (C) 2009 Elsevier B.V. All rights reserved.

Integrating voice and data on SALAN: an experimental local area network

This paper is concerned with the integration of voice and data on an experimental local area network used by the School of Automation, of the Indian Institute of Science. SALAN (School of Automation Local Area Network) consists of a number of microprocessor-based communication nodes linked to a shared coaxial cable transmission medium. The communication nodes handle the various low-level functions associated with computer communication, and interface user data equipment to the network. SALAN at present provides a file transfer facility between an Intel Series III microcomputer development system and a Texas Instruments Model 990/4 microcomputer system. Further, a packet voice communication system has also been implemented on SALAN. The various aspects of the design and implementation of the above two utilities are discussed.

An eels study of water, methanol, formaldehyde and formic acid adsorbed on clean and oxygen-covered zinc(0001) surfaces

Water adsorbs molecularly on a clean Zn(0001) surface; on a surface covered with atomic oxygen, however, hydroxyl species is produced due to proton abstraction by the surface oxygen atoms. Methanol, molecularly adsorbed on a clean surface at 80 K, transforms to methoxy species above 110 K. On an atomic oxygen-covered surface, adsorbed methanol gives rise to methoxy species and water, the latter arising from proton abstraction. HCHO adsorbs molecularly at 80 K on both clean as well as oxygen-covered surfaces and polymerizes at higher temperatures. Formic acid does not adsorb on a clean Zn surface, but on an oxygen-covered surface gives rise to formate and hydroxyl species.