Summarisation of short-term and long-term videos using texture and colour

We present a novel approach to video summarisation that makes use of a Bag-of-visual-Textures (BoT) approach. Two systems are proposed, one based solely on the BoT approach and another which exploits both colour information and BoT features. On 50 short-term videos from the Open Video Project we show that our BoT and fusion systems both achieve state-of-the-art performance, obtaining an average F-measure of 0.83 and 0.86 respectively, a relative improvement of 9% and 13% when compared to the previous state-of-the-art. When applied to a new underwater surveillance dataset containing 33 long-term videos, the proposed system reduces the amount of footage by a factor of 27, with only minor degradation in the information content. This order of magnitude reduction in video data represents significant savings in terms of time and potential labour cost when manually reviewing such footage.

Physical activity recognition from accelerometer data using a multi-scale ensemble method

Accurate and detailed measurement of an individual's physical activity is a key requirement for helping researchers understand the relationship between physical activity and health. Accelerometers have become the method of choice for measuring physical activity due to their small size, low cost, convenience and their ability to provide objective information about physical activity. However, interpreting accelerometer data once it has been collected can be challenging. In this work, we applied machine learning algorithms to the task of physical activity recognition from triaxial accelerometer data. We employed a simple but effective approach of dividing the accelerometer data into short non-overlapping windows, converting each window into a feature vector, and treating each feature vector as an i.i.d training instance for a supervised learning algorithm. In addition, we improved on this simple approach with a multi-scale ensemble method that did not need to commit to a single window size and was able to leverage the fact that physical activities produced time series with repetitive patterns and discriminative features for physical activity occurred at different temporal scales.

Effects of short-duration and long-duration exercise on lipoprotein(a)

Purpose Most studies that use either a single exercise session, exercise training, or a cross-sectional design have failed to find a relationship between exercise and plasma lipoprotein(a) [Lp(a)] concentrations. However, a few studies investigating the effects of longer and/or more strenuous exercise have shown elevated Lp(a) concentrations, possibly as an acute-phase reactant to muscle damage. Based on the assumption that greater muscle damage would occur with exercise of longer duration, the purpose of the present study was to determine whether exercise of longer duration would increase Lp(a) concentration and creatine kinase. (CK) activity more than exercise of shorter duration. Methods Ten endurance-trained men (mean +/- SD: age, 27 +/- 6 yr; maximal oxygen consumption [(V)over dotO(2max)], 57 +/- 7 mL(.)kg(-1) min(-1)) completed two separate exercise sessions at 70% (V)over dotO(2max). One session required 900 kcal of energy expenditure (60 +/- 6 min), and the other required 1500 kcal (112 +/- 12 min). Fasted blood samples were taken immediately before (0-pre), immediately after (0-post), 1 d after (1-post), and 2 d after (2-post) each exercise session. Results CK activity increased after both exercise sessions (mean +/- SE; 800 kcal: 0-pre 55 +/- 11, 1-post 168 +/- 64 U(.)L(-1.)min(-1); 1500 kcal: 0-pre 51 +/- 5, 1-post 187 +/- 30, 2-post 123 +/- 19 U(.)L(-1.)min(-1); P < 0.05). However, median Lp(a) concentrations were not altered by either exercise session (800 kcal: 0-pre 5.0 mg(.)dL(-1), 0-post 3.2 mg(.)dL(-1), 1-post 4.0 mg(.)dL(-1), 2-post 3.4 mg(.)dL(-1); 1500 kcal: 0-pre 5.8 mg(.)dL(-1), 0-post 4.3 mg(.)dL(-1), 1-post 3.2 mg(.)dL(-1), 2-post 5.3 mg(.)dL(-1)). In addition, no relationship existed between exercise-induced changes in CK activity and Lp(a) concentration (800 kcal: r = -0.26; 1500 kcal: r = -0.02). Conclusion These results suggest that plasma Lp(a) concentration will not increase in response to minor exercise-induced muscle damage in endurance-trained runners.

Short-term changes in axial length during simulations of typical far, intermediate and near tasks

Purpose: To investigate the changes in axial length with the combined effect of accommodation and angle of gaze (convergence and downward gaze) over 5 minutes in groups of myopes and emmetropes. Methods: A total of 31 subjects (nine emmetropes, 10 low myopes, and 12 moderate to high myopes) aged from 18 to 31 years were recruited. To measure ocular biometrics in inferonasal gaze with accommodation, an optical biometer (Lenstar LS900) was inclined on a tilt and height adjustable stage, with the subject’s chinrest mounted on a rotary stage to induce various levels of convergence by rotation of the subject’s head in primary or downward gaze. Initially, the subjects performed a distance viewing task in primary gaze for 10 minutes to provide a ‘wash-out’ period for prior visual tasks, and then the subject’s axial length and ocular biometrics were measured in nine different combinations of gaze/accommodation over 5 minutes. These nine sessions for all gaze measurements (i.e. three levels of accommodation 9 three levels of convergence) were completed across 3 days of testing (one accommodation condition on each day).The nine combinations of gaze/accommodation were based on those required to view the centre, right and left edges of a distant TV at 6 m in primary gaze, an intermediate task (i.e. computer at 50 cm in 10° downward gaze) and a near task (i.e. reading A4 page at 20 cm in 20° downward gaze). Subjects were wearing a custom built three-axes head tracker throughout the experiment that monitored subjects’ relative head movements (roll, pitch and yaw) during measurements. Results: A significant increase in axial length occurred with the combined effect of accommodation, convergence and downward gaze (repeated measures ANOVA, p < 0.001), with the greatest axial elongation during the near task in downward gaze with convergence (i.e. downward 20°/inward 33°, with 5 D accommodation) (mean change 33 ± 13 lm, after 5 minutes task) followed by the intermediate task (i.e. downward 10°/inward 25°, with 2 D accommodation) (mean change 14 ± 11 lm, after 5 minutes task).Changes in axial length for the distance task (i.e. primary gaze/9° convergence, with 0.16 D accommodation) were not statistically significant (mean change 4 ± 8 lm, after 5 minutes task, p > 0.05). Moderate to high myopes had a greater change in the axial length (mean change 40 ± 11 lm after 5 minutes of near task) than that of emmetropes (mean change 29 ± 15 lm after 5 minutes of near task) and low myopes (mean change 29 ± 16 lm after 5 minutes of near task) associated with time (p = 0.02) and accommodation by time (p = 0.03). Conclusions: The combination of accommodation, convergence and downward angle has a significant short term effect on axial length over time. The near task in downward gaze with convergence caused a greater change in axial length than the intermediate and distant visual tasks. The greater axial elongation measured in the infero-nasal direction with accommodation is most likely associated with a combination of biomechanical factors such as, extraocular muscle forces and ciliary muscle contraction.

Critical review of time-dependent shortest path algorithms: A multimodal trip planner perspective

A multimodal trip planner that produces optimal journeys involving both public transport and private vehicle legs has to solve a number of shortest path problems, both on the road network and the public transport network. The algorithms that are used to solve these shortest path problems have been researched since the late 1950s. However, in order to provide accurate journey plans that can be trusted by the user, the variability of travel times caused by traffic congestion must be taken into consideration. This requires the use of more sophisticated time-dependent shortest path algorithms, which have only been researched in depth over the last two decades, from the mid-1990s. This paper will review and compare nine algorithms that have been proposed in the literature, discussing the advantages and disadvantages of each algorithm on the basis of five important criteria that must be considered when choosing one or more of them to implement in a multimodal trip planner.

Design methodologies and architectures of hardware-based evolutionary algorithms for aerospace optimisation applications on FPGAS

This thesis is a study of new design methods for allowing evolutionary algorithms to be more effectively utilised in aerospace optimisation applications where computation needs are high and computation platform space may be restrictive. It examines the applicability of special hardware computational platforms known as field programmable gate arrays and shows that with the right implementation methods they can offer significant benefits. This research is a step forward towards the advancement of efficient and highly automated aircraft systems for meeting compact physical constraints in aerospace platforms and providing effective performance speedups over traditional methods.

Исследования и испытания алгоритмов автоматической пилотажно-навигационной системы малогабаритного беспилотного летательного аппарата = Research and testing of automatic navigation management system’s algorithms for small unmanned aerial vehicle

В статье представлено развитие принципа построения автоматической пилотажно-навигационной системы (АПНС) для беспилотного летательного аппарата (БЛА). Принцип заключается в синтезе комплексных систем управления БПЛА не только на основе использования алгоритмов БИНС, но и алгоритмов, объединяющих в себе решение задач формирования и отработки сформированной траектории резервированной системой управления и навигации. Приведены результаты аналитического исследования и данные летных экспериментов разработанных алгоритмов АПНС БЛА, обеспечивающих дополнительное резервирование алгоритмов навигации и наделяющих БЛА новым функциональной способностью по выходу в заданную точку пространства с заданной скоростью в заданный момент времени с учетом атмосферных ветровых возмущений. Предложена и испытана методика идентификации параметров воздушной атмосферы: направления и скорости W ветра. Данные летных испытаний полученного решения задачи терминальной навигации демонстрируют устойчивую работу синтезированных алгоритмов управления в различных метеоусловиях. The article presents a progress in principle of development of automatic navigation management system (ANMS) for small unmanned aerial vehicle (UAV). The principle defines a development of integrated control systems for UAV based on tight coupling of strap down inertial navigation system algorithms and algorithms of redundant flight management system to form and control flight trajectory. The results of the research and flight testing of the developed ANMS UAV algorithms are presented. The system demonstrates advanced functional redundancy of UAV guidance. The system enables new UAV capability to perform autonomous multidimensional navigation along waypoints with controlled speed and time of arrival taking into account wind. The paper describes the technique for real-time identification of atmosphere parameters such as wind direction and wind speed. The flight test results demonstrate robustness of the algorithms in diverse meteorological conditions.

Authentication of concast communication

In this paper we tackle the problem of finding an efficient signature verification scheme when the number of signatures is signi.- cantly large and the verifier is relatively weak. In particular, we tackle the problem of message authentication in many-to-one communication networks known as concast communication. The paper presents three signature screening algorithms for a variant of ElGamal-type digital signatures. The cost for these schemes is n applications of hash functions, 2n modular multiplications, and n modular additions plus the verification of one digital signature, where n is the number of signatures. The paper also presents a solution to the open problem of finding a fast screening signature for non-RSA digital signature schemes.

Fast, energy-efficient synthesis of luminescent carbon quantum dots

A simple, fast, energy and labour efficient, carbon dot synthesis method involving only the mixing of a saccharide and base is presented. Uniform, green luminescent carbon dots with an average size of 3.5 nm were obtained, without the need for additional energy input or external heating. Detection of formation moment for fructose-NaOH-produced carbon dots is also presented.

From short pulses to short breaks : exotic plasma bullets via residual electron control

Plasma plumes with exotically segmented channel structure and plasma bullet propagation are produced in atmospheric plasma jets. This is achieved by tailoring interruptions of a continuous DC power supply over the time scales of lifetimes of residual electrons produced by the preceding discharge phase. These phenomena are explained by studying the plasma dynamics using nanosecond-precision imaging. One of the plumes is produced using 2-10μs interruptions in the 8kV DC voltage and features a still bright channel from which a propagating bullet detaches. A shorter interruption of 900ns produces a plume with the additional long conducting dark channel between the jet nozzle and the bright area. The bullet size, formation dynamics, and propagation speed and distance can be effectively controlled. This may lead to micrometer-and nanosecond-precision delivery of quantized plasma bits, warranted for next-generation health, materials, and device technologies.

Nanoscale plasma chemistry enables fast, size-selective nanotube nucleation

The possibility of fast, narrow-size/chirality nucleation of thin single-walled carbon nanotubes (SWCNTs) at low, device-tolerant process temperatures in a plasma-enhanced chemical vapor deposition (CVD) is demonstrated using multiphase, multiscale numerical experiments. These effects are due to the unique nanoscale reactive plasma chemistry (NRPC) on the surfaces and within Au catalyst nanoparticles. The computed three-dimensional process parameter maps link the nanotube incubation times and the relative differences between the incubation times of SWCNTs of different sizes/chiralities to the main plasma- and precursor gas-specific parameters and explain recent experimental observations. It is shown that the unique NRPC leads not only to much faster nucleation of thin nanotubes at much lower process temperatures, but also to better selectivity between the incubation times of SWCNTs with different sizes and chiralities, compared to thermal CVD. These results are used to propose a time-programmed kinetic approach based on fast-responding plasmas which control the size-selective, narrow-chirality nucleation and growth of thin SWCNTs. This approach is generic and can be used for other nanostructure and materials systems.

Arterial short-term travel time prediction using Bluetooth data

This project recognized lack of data analysis and travel time prediction on arterials as the main gap in the current literature. For this purpose it first investigated reliability of data gathered by Bluetooth technology as a new cost effective method for data collection on arterial roads. Then by considering the similarity among varieties of daily travel time on different arterial routes, created a SARIMA model to predict future travel time values. Based on this research outcome, the created model can be applied for online short term travel time prediction in future.

Part 2. MOO methods for multidisciplinary design using parallel evolutionary algorithms, game theory and hierarchical topology. (Part 2.) Numerical aspects and implementation of model test cases

These lecture notes describe the use and implementation of a framework in which mathematical as well as engineering optimisation problems can be analysed. The foundations of the framework and algorithms described -Hierarchical Asynchronous Parallel Evolutionary Algorithms (HAPEAs) - lie upon traditional evolution strategies and incorporate the concepts of a multi-objective optimisation, hierarchical topology, asynchronous evaluation of candidate solutions , parallel computing and game strategies. In a step by step approach, the numerical implementation of EAs and HAPEAs for solving multi criteria optimisation problems is conducted providing the reader with the knowledge to reproduce these hand on training in his – her- academic or industrial environment.

Part 3. MOO methods for multidisciplinary design using parallel evolutionary algorithms, game theory and hierarchical topology. (Part 3.) Practical application to the design and optimisation of UAV systems

These lecture notes highlight some of the recent applications of multi-objective and multidisciplinary design optimisation in aeronautical design using the framework and methodology described in References 8, 23, 24 and in Part 1 and 2 of the notes. A summary of the methodology is described and the treatment of uncertainties in flight conditions parameters by the HAPEAs software and game strategies is introduced. Several test cases dealing with detailed design and computed with the software are presented and results discussed in section 4 of these notes.

On algebraic immunity and annihilators

Algebraic immunity AI(f) defined for a boolean function f measures the resistance of the function against algebraic attacks. Currently known algorithms for computing the optimal annihilator of f and AI(f) are inefficient. This work consists of two parts. In the first part, we extend the concept of algebraic immunity. In particular, we argue that a function f may be replaced by another boolean function f^c called the algebraic complement of f. This motivates us to examine AI(f ^c ). We define the extended algebraic immunity of f as AI *(f)= min {AI(f), AI(f^c )}. We prove that 0≤AI(f)–AI *(f)≤1. Since AI(f)–AI *(f)= 1 holds for a large number of cases, the difference between AI(f) and AI *(f) cannot be ignored in algebraic attacks. In the second part, we link boolean functions to hypergraphs so that we can apply known results in hypergraph theory to boolean functions. This not only allows us to find annihilators in a fast and simple way but also provides a good estimation of the upper bound on AI *(f).