Emergence time and foraging activity in Pallas' mastiff bat, Molossus molossus (Chiroptera: Molossidae) in relation to sunset/sunrise and phase of the moon

The decision on when to emerge from the safety of a roost and forage for prey is thought to be a result of the trade off between peak insect abundance and predation pressure for bats. In this study we show that the velvety free-tailed bat Molossus molossus emerges just after sunset and just before sunrise for very short foraging bouts (average 82.2 min foraging per night). Contrary to previous studies, bats remain inactive in their roost between activity patterns. Activity was measured over two complete lunar cycles and there was no indication that phase of the moon had an influence on emergence time or the numbers of bats that emerged from the roost. This data suggests that M. molossus represents an example of an aerial hawking bat whose foraging behaviour is in fact adapted to the compromise between the need to exploit highest prey availability and the need to avoid predation.

An orientation free adaptive step detection algorithm using a smart phone in physical activity monitoring

In this paper we present an Orientation Free Adaptive Step Detection (OFASD) algorithm for deployment in a smart phone for the purposes of physical activity monitoring. The OFASD algorithm detects individual steps and measures a user’s step counts using the smart phone’s in-built accelerometer. The algorithm considers both the variance of an individual’s walking pattern and the orientation of the smart phone. Experimental validation of the algorithm involved the collection of data from 10 participants using five phones (worn at five different body positions) whilst walking on a treadmill at a controlled speed for periods of 5 min. Results indicated that, for steps detected by the OFASD algorithm, there were no significant differences between where the phones were placed on the body (p > 0.05). The mean step detection accuracies ranged from 93.4 % to 96.4 %. Compared to measurements acquired using existing dedicated commercial devices, the results demonstrated that using a smart phone for monitoring physical activity is promising, as it adds value to an accepted everyday accessory, whilst imposing minimum interaction from the user. The algorithm can be used as the underlying component within an application deployed within a smart phone designed to promote self-management of chronic disease where activity measurement is a significant factor, as it provides a practical solution, with minimal requirements for user intervention and less constraints than current solutions.

A sequential algorithm for sparse support vector classifiers

Support vector machines (SVMs), though accurate, are not preferred in applications requiring high classification speed or when deployed in systems of limited computational resources, due to the large number of support vectors involved in the model. To overcome this problem we have devised a primal SVM method with the following properties: (1) it solves for the SVM representation without the need to invoke the representer theorem, (2) forward and backward selections are combined to approach the final globally optimal solution, and (3) a criterion is introduced for identification of support vectors leading to a much reduced support vector set. In addition to introducing this method the paper analyzes the complexity of the algorithm and presents test results on three public benchmark problems and a human activity recognition application. These applications demonstrate the effectiveness and efficiency of the proposed algorithm.


--------------------------------------------------------------------------------

A wavelet-based damage detection algorithm based on bridge acceleration response to a vehicle

Previous research based on theoretical simulations has shown the potential of the wavelet transform to detect damage in a beam by analysing the time-deflection response due to a constant moving load. However, its application to identify damage from the response of a bridge to a vehicle raises a number of questions. Firstly, it may be difficult to record the difference in the deflection signal between a healthy and a slightly damaged structure to the required level of accuracy and high scanning frequencies in the field. Secondly, the bridge is going to have a road profile and it will be loaded by a sprung vehicle and time-varying forces rather than a constant load. Therefore, an algorithm based on a plot of wavelet coefficients versus time to detect damage (a singularity in the plot) appears to be very sensitive to noise. This paper addresses these questions by: (a) using the acceleration signal, instead of the deflection signal, (b) employing a vehicle-bridge finite element interaction model, and (c) developing a novel wavelet-based approach using wavelet energy content at each bridge section which proves to be more sensitive to damage than a wavelet coefficient line plot at a given scale as employed by others.

FAULT-TOLERANT ALGORITHM FOR HIGH-AVAILABILITY AND WAFER SCALE SYSTEMS.

In this paper, the authors have presented one approach to configuring a Wafer-Scale Integration Chip. The approach described is called the 'WINNER', in which bus channels and an external controller for configuring the working processors are not required. In addition, the technique is applicable to high availability systems constructed using conventional methods. The technique can also be extended to arrays of arbitrary size and with any degree of fault tolerance simply by using an appropriate number of cells.

Bit-level systolic array implementation of the Winograd Fourier transform algorithm

A bit level systolic array system is proposed for the Winograd Fourier transform algorithm. The design uses bit-serial arithmetic and, in common with other systolic arrays, features nearest-neighbor interconnections, regularity and high throughput. The short interconnections in this method contrast favorably with the long interconnections between butterflies required in the FFT. The structure is well suited to VLSI implementations. It is demonstrated how long transforms can be implemented with components designed to perform a short length transform. These components build into longer transforms preserving the regularity and structure of the short length transform design.

SYSTOLIC IMPLEMENTATION OF THE WINOGRAD FOURIER TRANSFORM ALGORITHM.

A bit-level systolic array system is proposed for the Winograd Fourier transform algorithm. The design uses bit-serial arithmetic and, in common with other systolic arrays, features nearest neighbor interconnections, regularity, and high throughput. The short interconnections in this method contrast favorably with the long interconnections between butterflies required in the FFT. The structure is well suited to VLSI implementations. It is demonstrated how long transforms can be implemented with components designed to perform short-length transforms. These components build into longer transforms, preserving the regularity and structure of the short-length transform design.

QRD and SVD processor design based on an approximate rotations algorithm

A silicon implementation of the Approximate Rotations algorithm capable of carrying the computational load of algorithms such as QRD and SVD, within the real-time realisation of applications such as Adaptive Beamforming, is described. A modification to the original Approximate Rotations algorithm to simplify the method of optimal angle selection is proposed. Analysis shows that fewer iterations of the Approximate Rotations algorithm are required compared with the conventional CORDIC algorithm to achieve similar degrees of accuracy. The silicon design studies undertaken provide direct practical evidence of superior performance with the Approximate Rotations algorithm, requiring approximately 40% of the total computation time of the conventional CORDIC algorithm, for a similar silicon area cost. © 2004 IEEE.

Improved Montgomery modular inverse algorithm

A new, single and unified Montgomery modular inverse algorithm, which performs both classical and Montgomery modular inversion, is proposed. This reduces the number of Montgomery multiplication operations required by 33% when compared with previous algorithms reported in the literature. The use of this in practice has been investigated by implementation of the improved unified algorithm and the previous algorithms on FPGA devices. The unified algorithm implementation shows a significant speed-up and a reduction in silicon area usage.

Architectural synthesis of an image processing algorithm using IRIS

Details are presented of the IRIS synthesis system for high-performance digital signal processing. This tool allows non-specialists to automatically derive VLSI circuit architectures from high-level, algorithmic representations, and provides a quick route to silicon implementation. The applicability of the system is demonstrated using the design example of a one-dimensional Discrete Cosine Transform circuit.

Constant scale factor, on-line CORDIC algorithm in the circular coordinate system

Real time digital signal processing requires the development of high performance arithmetic algorithms suitable for VLSI design. In this paper, a new online, circular coordinate system CORDIC algorithm is described, which has a constant scale factor. This algorithm was developed using a new Angular Representation (AR) model A radix 2 version of the CORDIC algorithm is presented, along with an architecture suitable for VLSI implementation.

Pathobiology of rabies virus and the European bat lyssaviruses in experimentally infected mice

A comparison of the clinicopathology of European bat lyssavirus (EBLV) types-1 and -2 and of rabies virus was undertaken. Following inoculation of mice at a peripheral site with these viruses, clinical signs of rabies and distribution of virus antigen in the mouse brain were examined. The appearance of clinical signs of disease varied both within and across the different virus species, with variation in incubation periods and weight loss throughout disease progression. The distribution of viral antigen throughout the regions of the brain examined was similar for each of the isolates during the different stages of disease progression, suggesting that antigen distribution was not associated with clinical presentation. However, specific regions of the brain including the cerebellum, caudal medulla, hypothalamus and thalamus, showed notable differences in the proportion of virus antigen positive cells present in comparison to other brain regions suggesting that these areas are important in disease development irrespective of virus species.

Scaled Heavy-Ball Acceleration of the Richardson-Lucy Algorithm

The Richardson-Lucy algorithm is one of the most important algorithms in the image deconvolution area. However, one of its drawbacks is slow convergence. A very significant acceleration is obtained by the technique proposed by Biggs and Andrews (BA), which is implemented in the deconvlucy function of the Image Processing MATLAB toolbox. The BA method was developed heuristically with no proof of convergence. In this paper, we introduce the Heavy-Ball (H-B) method for Poisson data optimization and extend it to a scaled H-B method, which includes the BA method as a special case. The method has proof of the convergence rate of O(k-2), where k is the number of iterations. We demonstrate the superior convergence performance of the scaled H-B method on both synthetic and real 3D images.

The spatial ecology of the whiskered bat (Myotis mystacinus) at the western extreme of its range provides evidence of regional adaptation

Although widespread, the ecology of the whiskered bat, Myotis mystacinus in Europe remains poorly understood. Ireland is positioned at the most western extreme of this species' range. To ascertain the ecology of M. mystacinus at its geographic range extreme, the roosting behaviour, home range and habitat use of females in a maternity roost in Ireland was investigated by radio-tracking. M. mystacinus were active in a diversity of habitats: namely, mixed woodland, riparian vegetation, arable land and rough grassland. However, only mixed woodland and riparian habitats were selected as core foraging areas. This is in contrast to a previous study from Britain where only pasture was utilised but is in agreement with data from Slovakia, where woodland was also selected, whilst riparian areas were also utilised by this species in Germany. A high degree of overlap in the foraging areas of individuals was observed. A total of seven roosts were utilised by tracked bats and roost switching behaviour was observed. We discuss our contrasting results in respect to range limitations, regional variability in landscape structure and the composition of bat communities. The present results have implications for the conservation of M. mystacinus within Ireland and other parts of its range, highlighting the need for range wide ecological studies. Regional variability in the ecology of bats related to landscape factors is an important consideration for bat conservation and therefore must be incorporated into future management plans. (C) 2012 Deutsche Gesellschaft fur Saugetierkunde. Published by Elsevier GmbH. All rights reserved.