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.

Exponential stability for markovian jumping stochastic BAM neural networks with mode-dependent probabilistic time-varying delays and impulse control

Abstract
In this article, an exponential stability analysis of Markovian jumping stochastic bidirectional associative memory (BAM) neural networks with mode-dependent probabilistic time-varying delays and impulsive control is investigated. By establishment of a stochastic variable with Bernoulli distribution, the information of probabilistic time-varying delay is considered and transformed into one with deterministic time-varying delay and stochastic parameters. By fully taking the inherent characteristic of such kind of stochastic BAM neural networks into account, a novel Lyapunov-Krasovskii functional is constructed with as many as possible positive definite matrices which depends on the system mode and a triple-integral term is introduced for deriving the delay-dependent stability conditions. Furthermore, mode-dependent mean square exponential stability criteria are derived by constructing a new Lyapunov-Krasovskii functional with modes in the integral terms and using some stochastic analysis techniques. The criteria are formulated in terms of a set of linear matrix inequalities, which can be checked efficiently by use of some standard numerical packages. Finally, numerical examples and its simulations are given to demonstrate the usefulness and effectiveness of the proposed results.

Optimal feature subset selection for neuron spike sorting using the genetic algorithm

It is crucial for a neuron spike sorting algorithm to cluster data from different neurons efficiently. In this study, the search capability of the Genetic Algorithm (GA) is exploited for identifying the optimal feature subset for neuron spike sorting with a clustering algorithm. Two important objectives of the optimization process are considered: to reduce the number of features and increase the clustering performance. Specifically, we employ a binary GA with the silhouette evaluation criterion as the fitness function for neuron spike sorting using the Super-Paramagnetic Clustering (SPC) algorithm. The clustering results of SPC with and without the GA-based feature selector are evaluated using benchmark synthetic neuron spike data sets. The outcome indicates the usefulness of the GA in identifying a smaller feature set with improved clustering performance.

Statistical modelling of artificial neural network for sorting temporally synchronous spikes

Artificial neural network (ANN) models are able to predict future events based on current data. The usefulness of an ANN lies in the capacity of the model to learn and adjust the weights following previous errors during training. In this study, we carefully analyse the existing methods in neuronal spike sorting algorithms. The current methods use clustering as a basis to establish the ground truths, which requires tedious procedures pertaining to feature selection and evaluation of the selected features. Even so, the accuracy of clusters is still questionable. Here, we develop an ANN model to specially address the present drawbacks and major challenges in neuronal spike sorting. New enhancements are introduced into the conventional backpropagation ANN for determining the network weights, input nodes, target node, and error calculation. Coiflet modelling of noise is employed to enhance the spike shape features and overshadow noise. The ANN is used in conjunction with a special spiking event detection technique to prioritize the targets. The proposed enhancements are able to bolster the training concept, and on the whole, contributing to sorting neuronal spikes with close approximations.