An algorithm for logit network loading problem by topological sorting

This paper presents a topological sorting based algorithm for logit network loading problem to exclude all cycles by removing certain links from loops. The new algorithm calculates the link weights and flows according to topological order. It produces the theoretical results for networks without loops. Numerical examples show that the new algorithm can reduce errors introduced by the strict definition of 'reasonable route' in Dial's algorithm.

Exponential stabilization of neural networks with various activation functions and mixed time-varying delays

This paper presents some results on the global exponential stabilization for neural networks with various activation functions and time-varying continuously distributed delays. Based on augmented time-varying Lyapunov-Krasovskii functionals, new delay-dependent conditions for the global exponential stabilization are obtained in terms of linear matrix inequalities. A numerical example is given to illustrate the feasibility of our results.

Human behavior recognition with generic exponential family duration modeling in the hidden semi-Markov model

The ability to learn and recognize human activities of daily living (ADLs) is important in building pervasive and smart environments. In this paper, we tackle this problem using the hidden semi-Markov model. We discuss the state-of-the-art duration modeling choices and then address a large class of exponential family distributions to model state durations. Inference and learning are efficiently addressed by providing a graphical representation for the model in terms of a dynamic Bayesian network (DBN). We investigate both discrete and continuous distributions from the exponential family (Poisson and Inverse Gaussian respectively) for the problem of learning and recognizing ADLs. A full comparison between the exponential family duration models and other existing models including the traditional multinomial and the new Coxian are also presented. Our work thus completes a thorough investigation into the aspect of duration modeling and its application to human activities recognition in a real-world smart home surveillance scenario.

Computing of high breakdown regression estimators without sorting on graphics processing units

We present an approach to computing high-breakdown regression estimators in parallel on graphics processing units (GPU).We show that sorting the residuals is not necessary, and it can be substituted by calculating the median. We present and compare various methods to calculate the median and order statistics on GPUs. We introduce an alternative method based on the optimization of a convex function, and showits numerical superiority when calculating the order statistics of very large arrays on GPUs.

Exponential stabilization for state and input delay systems via output feedback

This paper considers the exponential stabilization problem via static and dynamic output feedback controllers of linear systems with a time delay in both the state and input. By using a change of the state variable and combining with the Lyapunov-Krasovskii method, new sufficient conditions for exponential stabilization via static and dynamic output feedback controllers are proposed. The conditions are expressed in terms of matrix inequalities but with only one parameter needs to be tuned and therefore can be efficiently solved by incorporating an one-dimensional search method into the Matlab’s LMI toolbox. Two numerical examples are provided to illustrate the obtained results.

Parallel bucket sorting on graphics processing units based on convex optimization

We found an interesting relation between convex optimization and sorting problem. We present a parallel algorithm to compute multiple order statistics of the data by minimizing a number of related convex functions. The computed order statistics serve as splitters that group the data into buckets suitable for parallel bitonic sorting. This led us to a parallel bucket sort algorithm, which we implemented for many-core architecture of graphics processing units (GPUs). The proposed sorting method is competitive to the state-of-the-art GPU sorting algorithms and is superior to most of them for long sorting keys.

ID scanners in the night-time economy: Social sorting or social order?

Digital technologies are often considered effective methods of deterring or preventing crime. New forms of surveillance have particular appeal when attempting to reduce violence in the night-time economy, given ongoing concerns over perceived increases in the frequency and severity of reported assaults. This study examines the rationales for adopting compulsory patron ID scanning as a key method of reducing violence in and around licensed venues in the Victorian regional city of Geelong. Using a mixed methods approach, this paper challenges the popular perception that ID scanning has helped to reduce violence Geelong’s night-time economy. Further, the research identifies several limits in the administration of this technology that potentially undermine patron safety in the night-time economy. The authors conclude by proposing a series of reforms to address current regulatory gaps associated with ID scanning and related surveillance and identity authentication technologies to prevent crime.

Spike sorting using hidden markov models

In this paper, hidden Markov models (HMM) is studied for spike sorting. We notice that HMM state sequences have capability to represent spikes precisely and concisely. We build a HMM for spikes, where HMM states respect spike significant shape variations. Four shape variations are introduced: silence, going up, going down and peak. They constitute every spike with an underlying probabilistic dependence that is modelled by HMM. Based on this representation, spikes sorting becomes a classification problem of compact HMM state sequences. In addition, we enhance the method by defining HMM on extracted Cepstrum features, which improves the accuracy of spike sorting. Simulation results demonstrate the effectiveness of the proposed method as well as the efficiency.

Spike sorting using locality preserving projection with gap statistics and landmark-based spectral clustering

Understanding neural functions requires knowledge from analysing electrophysiological data. The process of assigning spikes of a multichannel signal into clusters, called spike sorting, is one of the important problems in such analysis. There have been various automated spike sorting techniques with both advantages and disadvantages regarding accuracy and computational costs. Therefore, developing spike sorting methods that are highly accurate and computationally inexpensive is always a challenge in the biomedical engineering practice.