Automated spike sorting algorithm based on Laplacian eigenmaps and k-means clustering.

Science.gov (United States)

Chah, E; Hok, V; Della-Chiesa, A; Miller, J J H; O'Mara, S M; Reilly, R B

2011-02-01

This study presents a new automatic spike sorting method based on feature extraction by Laplacian eigenmaps combined with k-means clustering. The performance of the proposed method was compared against previously reported algorithms such as principal component analysis (PCA) and amplitude-based feature extraction. Two types of classifier (namely k-means and classification expectation-maximization) were incorporated within the spike sorting algorithms, in order to find a suitable classifier for the feature sets. Simulated data sets and in-vivo tetrode multichannel recordings were employed to assess the performance of the spike sorting algorithms. The results show that the proposed algorithm yields significantly improved performance with mean sorting accuracy of 73% and sorting error of 10% compared to PCA which combined with k-means had a sorting accuracy of 58% and sorting error of 10%.A correction was made to this article on 22 February 2011. The spacing of the title was amended on the abstract page. No changes were made to the article PDF and the print version was unaffected.

Efficient Architecture for Spike Sorting in Reconfigurable Hardware

Science.gov (United States)

Hwang, Wen-Jyi; Lee, Wei-Hao; Lin, Shiow-Jyu; Lai, Sheng-Ying

2013-01-01

This paper presents a novel hardware architecture for fast spike sorting. The architecture is able to perform both the feature extraction and clustering in hardware. The generalized Hebbian algorithm (GHA) and fuzzy C-means (FCM) algorithm are used for feature extraction and clustering, respectively. The employment of GHA allows efficient computation of principal components for subsequent clustering operations. The FCM is able to achieve near optimal clustering for spike sorting. Its performance is insensitive to the selection of initial cluster centers. The hardware implementations of GHA and FCM feature low area costs and high throughput. In the GHA architecture, the computation of different weight vectors share the same circuit for lowering the area costs. Moreover, in the FCM hardware implementation, the usual iterative operations for updating the membership matrix and cluster centroid are merged into one single updating process to evade the large storage requirement. To show the effectiveness of the circuit, the proposed architecture is physically implemented by field programmable gate array (FPGA). It is embedded in a System-on-Chip (SOC) platform for performance measurement. Experimental results show that the proposed architecture is an efficient spike sorting design for attaining high classification correct rate and high speed computation. PMID:24189331

Efficient Architecture for Spike Sorting in Reconfigurable Hardware

Directory of Open Access Journals (Sweden)

Sheng-Ying Lai

2013-11-01

Full Text Available This paper presents a novel hardware architecture for fast spike sorting. The architecture is able to perform both the feature extraction and clustering in hardware. The generalized Hebbian algorithm (GHA and fuzzy C-means (FCM algorithm are used for feature extraction and clustering, respectively. The employment of GHA allows efficient computation of principal components for subsequent clustering operations. The FCM is able to achieve near optimal clustering for spike sorting. Its performance is insensitive to the selection of initial cluster centers. The hardware implementations of GHA and FCM feature low area costs and high throughput. In the GHA architecture, the computation of different weight vectors share the same circuit for lowering the area costs. Moreover, in the FCM hardware implementation, the usual iterative operations for updating the membership matrix and cluster centroid are merged into one single updating process to evade the large storage requirement. To show the effectiveness of the circuit, the proposed architecture is physically implemented by field programmable gate array (FPGA. It is embedded in a System-on-Chip (SOC platform for performance measurement. Experimental results show that the proposed architecture is an efficient spike sorting design for attaining high classification correct rate and high speed computation.

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

Science.gov (United States)

Nguyen, Thanh; Khosravi, Abbas; Creighton, Douglas; Nahavandi, Saeid

2014-12-30

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. An automatic unsupervised spike sorting method is proposed in this paper. The method uses features extracted by the locality preserving projection (LPP) algorithm. These features afterwards serve as inputs for the landmark-based spectral clustering (LSC) method. Gap statistics (GS) is employed to evaluate the number of clusters before the LSC can be performed. The proposed LPP-LSC is highly accurate and computationally inexpensive spike sorting approach. LPP spike features are very discriminative; thereby boost the performance of clustering methods. Furthermore, the LSC method exhibits its efficiency when integrated with the cluster evaluator GS. The proposed method's accuracy is approximately 13% superior to that of the benchmark combination between wavelet transformation and superparamagnetic clustering (WT-SPC). Additionally, LPP-LSC computing time is six times less than that of the WT-SPC. LPP-LSC obviously demonstrates a win-win spike sorting solution meeting both accuracy and computational cost criteria. LPP and LSC are linear algorithms that help reduce computational burden and thus their combination can be applied into real-time spike analysis. Copyright © 2014 Elsevier B.V. All rights reserved.

Validation of neural spike sorting algorithms without ground-truth information.

Science.gov (United States)

Barnett, Alex H; Magland, Jeremy F; Greengard, Leslie F

2016-05-01

The throughput of electrophysiological recording is growing rapidly, allowing thousands of simultaneous channels, and there is a growing variety of spike sorting algorithms designed to extract neural firing events from such data. This creates an urgent need for standardized, automatic evaluation of the quality of neural units output by such algorithms. We introduce a suite of validation metrics that assess the credibility of a given automatic spike sorting algorithm applied to a given dataset. By rerunning the spike sorter two or more times, the metrics measure stability under various perturbations consistent with variations in the data itself, making no assumptions about the internal workings of the algorithm, and minimal assumptions about the noise. We illustrate the new metrics on standard sorting algorithms applied to both in vivo and ex vivo recordings, including a time series with overlapping spikes. We compare the metrics to existing quality measures, and to ground-truth accuracy in simulated time series. We provide a software implementation. Metrics have until now relied on ground-truth, simulated data, internal algorithm variables (e.g. cluster separation), or refractory violations. By contrast, by standardizing the interface, our metrics assess the reliability of any automatic algorithm without reference to internal variables (e.g. feature space) or physiological criteria. Stability is a prerequisite for reproducibility of results. Such metrics could reduce the significant human labor currently spent on validation, and should form an essential part of large-scale automated spike sorting and systematic benchmarking of algorithms. Copyright © 2016 Elsevier B.V. All rights reserved.

A model-based spike sorting algorithm for removing correlation artifacts in multi-neuron recordings.

Science.gov (United States)

Pillow, Jonathan W; Shlens, Jonathon; Chichilnisky, E J; Simoncelli, Eero P

2013-01-01

We examine the problem of estimating the spike trains of multiple neurons from voltage traces recorded on one or more extracellular electrodes. Traditional spike-sorting methods rely on thresholding or clustering of recorded signals to identify spikes. While these methods can detect a large fraction of the spikes from a recording, they generally fail to identify synchronous or near-synchronous spikes: cases in which multiple spikes overlap. Here we investigate the geometry of failures in traditional sorting algorithms, and document the prevalence of such errors in multi-electrode recordings from primate retina. We then develop a method for multi-neuron spike sorting using a model that explicitly accounts for the superposition of spike waveforms. We model the recorded voltage traces as a linear combination of spike waveforms plus a stochastic background component of correlated Gaussian noise. Combining this measurement model with a Bernoulli prior over binary spike trains yields a posterior distribution for spikes given the recorded data. We introduce a greedy algorithm to maximize this posterior that we call "binary pursuit". The algorithm allows modest variability in spike waveforms and recovers spike times with higher precision than the voltage sampling rate. This method substantially corrects cross-correlation artifacts that arise with conventional methods, and substantially outperforms clustering methods on both real and simulated data. Finally, we develop diagnostic tools that can be used to assess errors in spike sorting in the absence of ground truth.

Noise-robust unsupervised spike sorting based on discriminative subspace learning with outlier handling.

Science.gov (United States)

Keshtkaran, Mohammad Reza; Yang, Zhi

2017-06-01

Spike sorting is a fundamental preprocessing step for many neuroscience studies which rely on the analysis of spike trains. Most of the feature extraction and dimensionality reduction techniques that have been used for spike sorting give a projection subspace which is not necessarily the most discriminative one. Therefore, the clusters which appear inherently separable in some discriminative subspace may overlap if projected using conventional feature extraction approaches leading to a poor sorting accuracy especially when the noise level is high. In this paper, we propose a noise-robust and unsupervised spike sorting algorithm based on learning discriminative spike features for clustering. The proposed algorithm uses discriminative subspace learning to extract low dimensional and most discriminative features from the spike waveforms and perform clustering with automatic detection of the number of the clusters. The core part of the algorithm involves iterative subspace selection using linear discriminant analysis and clustering using Gaussian mixture model with outlier detection. A statistical test in the discriminative subspace is proposed to automatically detect the number of the clusters. Comparative results on publicly available simulated and real in vivo datasets demonstrate that our algorithm achieves substantially improved cluster distinction leading to higher sorting accuracy and more reliable detection of clusters which are highly overlapping and not detectable using conventional feature extraction techniques such as principal component analysis or wavelets. By providing more accurate information about the activity of more number of individual neurons with high robustness to neural noise and outliers, the proposed unsupervised spike sorting algorithm facilitates more detailed and accurate analysis of single- and multi-unit activities in neuroscience and brain machine interface studies.

Noise-robust unsupervised spike sorting based on discriminative subspace learning with outlier handling

Science.gov (United States)

Keshtkaran, Mohammad Reza; Yang, Zhi

2017-06-01

Objective. Spike sorting is a fundamental preprocessing step for many neuroscience studies which rely on the analysis of spike trains. Most of the feature extraction and dimensionality reduction techniques that have been used for spike sorting give a projection subspace which is not necessarily the most discriminative one. Therefore, the clusters which appear inherently separable in some discriminative subspace may overlap if projected using conventional feature extraction approaches leading to a poor sorting accuracy especially when the noise level is high. In this paper, we propose a noise-robust and unsupervised spike sorting algorithm based on learning discriminative spike features for clustering. Approach. The proposed algorithm uses discriminative subspace learning to extract low dimensional and most discriminative features from the spike waveforms and perform clustering with automatic detection of the number of the clusters. The core part of the algorithm involves iterative subspace selection using linear discriminant analysis and clustering using Gaussian mixture model with outlier detection. A statistical test in the discriminative subspace is proposed to automatically detect the number of the clusters. Main results. Comparative results on publicly available simulated and real in vivo datasets demonstrate that our algorithm achieves substantially improved cluster distinction leading to higher sorting accuracy and more reliable detection of clusters which are highly overlapping and not detectable using conventional feature extraction techniques such as principal component analysis or wavelets. Significance. By providing more accurate information about the activity of more number of individual neurons with high robustness to neural noise and outliers, the proposed unsupervised spike sorting algorithm facilitates more detailed and accurate analysis of single- and multi-unit activities in neuroscience and brain machine interface studies.

Past, present and future of spike sorting techniques.

Science.gov (United States)

Rey, Hernan Gonzalo; Pedreira, Carlos; Quian Quiroga, Rodrigo

2015-10-01

Spike sorting is a crucial step to extract information from extracellular recordings. With new recording opportunities provided by the development of new electrodes that allow monitoring hundreds of neurons simultaneously, the scenario for the new generation of algorithms is both exciting and challenging. However, this will require a new approach to the problem and the development of a common reference framework to quickly assess the performance of new algorithms. In this work, we review the basic concepts of spike sorting, including the requirements for different applications, together with the problems faced by presently available algorithms. We conclude by proposing a roadmap stressing the crucial points to be addressed to support the neuroscientific research of the near future. Copyright © 2015 The Authors. Published by Elsevier Inc. All rights reserved.

A real-time spike sorting method based on the embedded GPU.

Science.gov (United States)

Zelan Yang; Kedi Xu; Xiang Tian; Shaomin Zhang; Xiaoxiang Zheng

2017-07-01

Microelectrode arrays with hundreds of channels have been widely used to acquire neuron population signals in neuroscience studies. Online spike sorting is becoming one of the most important challenges for high-throughput neural signal acquisition systems. Graphic processing unit (GPU) with high parallel computing capability might provide an alternative solution for increasing real-time computational demands on spike sorting. This study reported a method of real-time spike sorting through computing unified device architecture (CUDA) which was implemented on an embedded GPU (NVIDIA JETSON Tegra K1, TK1). The sorting approach is based on the principal component analysis (PCA) and K-means. By analyzing the parallelism of each process, the method was further optimized in the thread memory model of GPU. Our results showed that the GPU-based classifier on TK1 is 37.92 times faster than the MATLAB-based classifier on PC while their accuracies were the same with each other. The high-performance computing features of embedded GPU demonstrated in our studies suggested that the embedded GPU provide a promising platform for the real-time neural signal processing.

Event-driven processing for hardware-efficient neural spike sorting

Science.gov (United States)

Liu, Yan; Pereira, João L.; Constandinou, Timothy G.

2018-02-01

Objective. The prospect of real-time and on-node spike sorting provides a genuine opportunity to push the envelope of large-scale integrated neural recording systems. In such systems the hardware resources, power requirements and data bandwidth increase linearly with channel count. Event-based (or data-driven) processing can provide here a new efficient means for hardware implementation that is completely activity dependant. In this work, we investigate using continuous-time level-crossing sampling for efficient data representation and subsequent spike processing. Approach. (1) We first compare signals (synthetic neural datasets) encoded with this technique against conventional sampling. (2) We then show how such a representation can be directly exploited by extracting simple time domain features from the bitstream to perform neural spike sorting. (3) The proposed method is implemented in a low power FPGA platform to demonstrate its hardware viability. Main results. It is observed that considerably lower data rates are achievable when using 7 bits or less to represent the signals, whilst maintaining the signal fidelity. Results obtained using both MATLAB and reconfigurable logic hardware (FPGA) indicate that feature extraction and spike sorting accuracies can be achieved with comparable or better accuracy than reference methods whilst also requiring relatively low hardware resources. Significance. By effectively exploiting continuous-time data representation, neural signal processing can be achieved in a completely event-driven manner, reducing both the required resources (memory, complexity) and computations (operations). This will see future large-scale neural systems integrating on-node processing in real-time hardware.

A Fully Automated Approach to Spike Sorting.

Science.gov (United States)

Chung, Jason E; Magland, Jeremy F; Barnett, Alex H; Tolosa, Vanessa M; Tooker, Angela C; Lee, Kye Y; Shah, Kedar G; Felix, Sarah H; Frank, Loren M; Greengard, Leslie F

2017-09-13

Understanding the detailed dynamics of neuronal networks will require the simultaneous measurement of spike trains from hundreds of neurons (or more). Currently, approaches to extracting spike times and labels from raw data are time consuming, lack standardization, and involve manual intervention, making it difficult to maintain data provenance and assess the quality of scientific results. Here, we describe an automated clustering approach and associated software package that addresses these problems and provides novel cluster quality metrics. We show that our approach has accuracy comparable to or exceeding that achieved using manual or semi-manual techniques with desktop central processing unit (CPU) runtimes faster than acquisition time for up to hundreds of electrodes. Moreover, a single choice of parameters in the algorithm is effective for a variety of electrode geometries and across multiple brain regions. This algorithm has the potential to enable reproducible and automated spike sorting of larger scale recordings than is currently possible. Copyright © 2017 Elsevier Inc. All rights reserved.

How many neurons can we see with current spike sorting algorithms?

Science.gov (United States)

Pedreira, Carlos; Martinez, Juan; Ison, Matias J; Quian Quiroga, Rodrigo

2012-10-15

Recent studies highlighted the disagreement between the typical number of neurons observed with extracellular recordings and the ones to be expected based on anatomical and physiological considerations. This disagreement has been mainly attributed to the presence of sparsely firing neurons. However, it is also possible that this is due to limitations of the spike sorting algorithms used to process the data. To address this issue, we used realistic simulations of extracellular recordings and found a relatively poor spike sorting performance for simulations containing a large number of neurons. In fact, the number of correctly identified neurons for single-channel recordings showed an asymptotic behavior saturating at about 8-10 units, when up to 20 units were present in the data. This performance was significantly poorer for neurons with low firing rates, as these units were twice more likely to be missed than the ones with high firing rates in simulations containing many neurons. These results uncover one of the main reasons for the relatively low number of neurons found in extracellular recording and also stress the importance of further developments of spike sorting algorithms. Copyright © 2012 Elsevier B.V. All rights reserved.

Comparison of Classifier Architectures for Online Neural Spike Sorting.

Science.gov (United States)

Saeed, Maryam; Khan, Amir Ali; Kamboh, Awais Mehmood

2017-04-01

High-density, intracranial recordings from micro-electrode arrays need to undergo Spike Sorting in order to associate the recorded neuronal spikes to particular neurons. This involves spike detection, feature extraction, and classification. To reduce the data transmission and power requirements, on-chip real-time processing is becoming very popular. However, high computational resources are required for classifiers in on-chip spike-sorters, making scalability a great challenge. In this review paper, we analyze several popular classifiers to propose five new hardware architectures using the off-chip training with on-chip classification approach. These include support vector classification, fuzzy C-means classification, self-organizing maps classification, moving-centroid K-means classification, and Cosine distance classification. The performance of these architectures is analyzed in terms of accuracy and resource requirement. We establish that the neural networks based Self-Organizing Maps classifier offers the most viable solution. A spike sorter based on the Self-Organizing Maps classifier, requires only 7.83% of computational resources of the best-reported spike sorter, hierarchical adaptive means, while offering a 3% better accuracy at 7 dB SNR.

Feature extraction using extrema sampling of discrete derivatives for spike sorting in implantable upper-limb neural prostheses.

Science.gov (United States)

Zamani, Majid; Demosthenous, Andreas

2014-07-01

Next generation neural interfaces for upper-limb (and other) prostheses aim to develop implantable interfaces for one or more nerves, each interface having many neural signal channels that work reliably in the stump without harming the nerves. To achieve real-time multi-channel processing it is important to integrate spike sorting on-chip to overcome limitations in transmission bandwidth. This requires computationally efficient algorithms for feature extraction and clustering suitable for low-power hardware implementation. This paper describes a new feature extraction method for real-time spike sorting based on extrema analysis (namely positive peaks and negative peaks) of spike shapes and their discrete derivatives at different frequency bands. Employing simulation across different datasets, the accuracy and computational complexity of the proposed method are assessed and compared with other methods. The average classification accuracy of the proposed method in conjunction with online sorting (O-Sort) is 91.6%, outperforming all the other methods tested with the O-Sort clustering algorithm. The proposed method offers a better tradeoff between classification error and computational complexity, making it a particularly strong choice for on-chip spike sorting.

An extensible infrastructure for fully automated spike sorting during online experiments.

Science.gov (United States)

Santhanam, Gopal; Sahani, Maneesh; Ryu, Stephen; Shenoy, Krishna

2004-01-01

When recording extracellular neural activity, it is often necessary to distinguish action potentials arising from distinct cells near the electrode tip, a process commonly referred to as "spike sorting." In a number of experiments, notably those that involve direct neuroprosthetic control of an effector, this cell-by-cell classification of the incoming signal must be achieved in real time. Several commercial offerings are available for this task, but all of these require some manual supervision per electrode, making each scheme cumbersome with large electrode counts. We present a new infrastructure that leverages existing unsupervised algorithms to sort and subsequently implement the resulting signal classification rules for each electrode using a commercially available Cerebus neural signal processor. We demonstrate an implementation of this infrastructure to classify signals from a cortical electrode array, using a probabilistic clustering algorithm (described elsewhere). The data were collected from a rhesus monkey performing a delayed center-out reach task. We used both sorted and unsorted (thresholded) action potentials from an array implanted in pre-motor cortex to "predict" the reach target, a common decoding operation in neuroprosthetic research. The use of sorted spikes led to an improvement in decoding accuracy of between 3.6 and 6.4%.

Performance evaluation of PCA-based spike sorting algorithms.

Science.gov (United States)

Adamos, Dimitrios A; Kosmidis, Efstratios K; Theophilidis, George

2008-09-01

Deciphering the electrical activity of individual neurons from multi-unit noisy recordings is critical for understanding complex neural systems. A widely used spike sorting algorithm is being evaluated for single-electrode nerve trunk recordings. The algorithm is based on principal component analysis (PCA) for spike feature extraction. In the neuroscience literature it is generally assumed that the use of the first two or most commonly three principal components is sufficient. We estimate the optimum PCA-based feature space by evaluating the algorithm's performance on simulated series of action potentials. A number of modifications are made to the open source nev2lkit software to enable systematic investigation of the parameter space. We introduce a new metric to define clustering error considering over-clustering more favorable than under-clustering as proposed by experimentalists for our data. Both the program patch and the metric are available online. Correlated and white Gaussian noise processes are superimposed to account for biological and artificial jitter in the recordings. We report that the employment of more than three principal components is in general beneficial for all noise cases considered. Finally, we apply our results to experimental data and verify that the sorting process with four principal components is in agreement with a panel of electrophysiology experts.

An Efficient Hardware Circuit for Spike Sorting Based on Competitive Learning Networks

Directory of Open Access Journals (Sweden)

Huan-Yuan Chen

2017-09-01

Full Text Available This study aims to present an effective VLSI circuit for multi-channel spike sorting. The circuit supports the spike detection, feature extraction and classification operations. The detection circuit is implemented in accordance with the nonlinear energy operator algorithm. Both the peak detection and area computation operations are adopted for the realization of the hardware architecture for feature extraction. The resulting feature vectors are classified by a circuit for competitive learning (CL neural networks. The CL circuit supports both online training and classification. In the proposed architecture, all the channels share the same detection, feature extraction, learning and classification circuits for a low area cost hardware implementation. The clock-gating technique is also employed for reducing the power dissipation. To evaluate the performance of the architecture, an application-specific integrated circuit (ASIC implementation is presented. Experimental results demonstrate that the proposed circuit exhibits the advantages of a low chip area, a low power dissipation and a high classification success rate for spike sorting.

An Efficient Hardware Circuit for Spike Sorting Based on Competitive Learning Networks

Science.gov (United States)

Chen, Huan-Yuan; Chen, Chih-Chang

2017-01-01

This study aims to present an effective VLSI circuit for multi-channel spike sorting. The circuit supports the spike detection, feature extraction and classification operations. The detection circuit is implemented in accordance with the nonlinear energy operator algorithm. Both the peak detection and area computation operations are adopted for the realization of the hardware architecture for feature extraction. The resulting feature vectors are classified by a circuit for competitive learning (CL) neural networks. The CL circuit supports both online training and classification. In the proposed architecture, all the channels share the same detection, feature extraction, learning and classification circuits for a low area cost hardware implementation. The clock-gating technique is also employed for reducing the power dissipation. To evaluate the performance of the architecture, an application-specific integrated circuit (ASIC) implementation is presented. Experimental results demonstrate that the proposed circuit exhibits the advantages of a low chip area, a low power dissipation and a high classification success rate for spike sorting. PMID:28956859

Low power and high accuracy spike sorting microprocessor with on-line interpolation and re-alignment in 90 nm CMOS process.

Science.gov (United States)

Chen, Tung-Chien; Ma, Tsung-Chuan; Chen, Yun-Yu; Chen, Liang-Gee

2012-01-01

Accurate spike sorting is an important issue for neuroscientific and neuroprosthetic applications. The sorting of spikes depends on the features extracted from the neural waveforms, and a better sorting performance usually comes with a higher sampling rate (SR). However for the long duration experiments on free-moving subjects, the miniaturized and wireless neural recording ICs are the current trend, and the compromise on sorting accuracy is usually made by a lower SR for the lower power consumption. In this paper, we implement an on-chip spike sorting processor with integrated interpolation hardware in order to improve the performance in terms of power versus accuracy. According to the fabrication results in 90nm process, if the interpolation is appropriately performed during the spike sorting, the system operated at the SR of 12.5 k samples per second (sps) can outperform the one not having interpolation at 25 ksps on both accuracy and power.

ViSAPy: a Python tool for biophysics-based generation of virtual spiking activity for evaluation of spike-sorting algorithms.

Science.gov (United States)

Hagen, Espen; Ness, Torbjørn V; Khosrowshahi, Amir; Sørensen, Christina; Fyhn, Marianne; Hafting, Torkel; Franke, Felix; Einevoll, Gaute T

2015-04-30

New, silicon-based multielectrodes comprising hundreds or more electrode contacts offer the possibility to record spike trains from thousands of neurons simultaneously. This potential cannot be realized unless accurate, reliable automated methods for spike sorting are developed, in turn requiring benchmarking data sets with known ground-truth spike times. We here present a general simulation tool for computing benchmarking data for evaluation of spike-sorting algorithms entitled ViSAPy (Virtual Spiking Activity in Python). The tool is based on a well-established biophysical forward-modeling scheme and is implemented as a Python package built on top of the neuronal simulator NEURON and the Python tool LFPy. ViSAPy allows for arbitrary combinations of multicompartmental neuron models and geometries of recording multielectrodes. Three example benchmarking data sets are generated, i.e., tetrode and polytrode data mimicking in vivo cortical recordings and microelectrode array (MEA) recordings of in vitro activity in salamander retinas. The synthesized example benchmarking data mimics salient features of typical experimental recordings, for example, spike waveforms depending on interspike interval. ViSAPy goes beyond existing methods as it includes biologically realistic model noise, synaptic activation by recurrent spiking networks, finite-sized electrode contacts, and allows for inhomogeneous electrical conductivities. ViSAPy is optimized to allow for generation of long time series of benchmarking data, spanning minutes of biological time, by parallel execution on multi-core computers. ViSAPy is an open-ended tool as it can be generalized to produce benchmarking data or arbitrary recording-electrode geometries and with various levels of complexity. Copyright © 2015 The Authors. Published by Elsevier B.V. All rights reserved.

Complexity optimization and high-throughput low-latency hardware implementation of a multi-electrode spike-sorting algorithm.

Science.gov (United States)

Dragas, Jelena; Jackel, David; Hierlemann, Andreas; Franke, Felix

2015-03-01

Reliable real-time low-latency spike sorting with large data throughput is essential for studies of neural network dynamics and for brain-machine interfaces (BMIs), in which the stimulation of neural networks is based on the networks' most recent activity. However, the majority of existing multi-electrode spike-sorting algorithms are unsuited for processing high quantities of simultaneously recorded data. Recording from large neuronal networks using large high-density electrode sets (thousands of electrodes) imposes high demands on the data-processing hardware regarding computational complexity and data transmission bandwidth; this, in turn, entails demanding requirements in terms of chip area, memory resources and processing latency. This paper presents computational complexity optimization techniques, which facilitate the use of spike-sorting algorithms in large multi-electrode-based recording systems. The techniques are then applied to a previously published algorithm, on its own, unsuited for large electrode set recordings. Further, a real-time low-latency high-performance VLSI hardware architecture of the modified algorithm is presented, featuring a folded structure capable of processing the activity of hundreds of neurons simultaneously. The hardware is reconfigurable “on-the-fly” and adaptable to the nonstationarities of neuronal recordings. By transmitting exclusively spike time stamps and/or spike waveforms, its real-time processing offers the possibility of data bandwidth and data storage reduction.

Performance comparison of extracellular spike sorting algorithms for single-channel recordings.

Science.gov (United States)

Wild, Jiri; Prekopcsak, Zoltan; Sieger, Tomas; Novak, Daniel; Jech, Robert

2012-01-30

Proper classification of action potentials from extracellular recordings is essential for making an accurate study of neuronal behavior. Many spike sorting algorithms have been presented in the technical literature. However, no comparative analysis has hitherto been performed. In our study, three widely-used publicly-available spike sorting algorithms (WaveClus, KlustaKwik, OSort) were compared with regard to their parameter settings. The algorithms were evaluated using 112 artificial signals (publicly available online) with 2-9 different neurons and varying noise levels between 0.00 and 0.60. An optimization technique based on Adjusted Mutual Information was employed to find near-optimal parameter settings for a given artificial signal and algorithm. All three algorithms performed significantly better (psorting algorithm, receiving the best evaluation score for 60% of all signals. OSort operated at almost five times the speed of the other algorithms. In terms of accuracy, OSort performed significantly less well (palgorithms was optimal in general. The accuracy of the algorithms depended on proper choice of the algorithm parameters and also on specific properties of the examined signal. Copyright © 2011 Elsevier B.V. All rights reserved.

Hierarchical Adaptive Means (HAM) clustering for hardware-efficient, unsupervised and real-time spike sorting.

Science.gov (United States)

Paraskevopoulou, Sivylla E; Wu, Di; Eftekhar, Amir; Constandinou, Timothy G

2014-09-30

This work presents a novel unsupervised algorithm for real-time adaptive clustering of neural spike data (spike sorting). The proposed Hierarchical Adaptive Means (HAM) clustering method combines centroid-based clustering with hierarchical cluster connectivity to classify incoming spikes using groups of clusters. It is described how the proposed method can adaptively track the incoming spike data without requiring any past history, iteration or training and autonomously determines the number of spike classes. Its performance (classification accuracy) has been tested using multiple datasets (both simulated and recorded) achieving a near-identical accuracy compared to k-means (using 10-iterations and provided with the number of spike classes). Also, its robustness in applying to different feature extraction methods has been demonstrated by achieving classification accuracies above 80% across multiple datasets. Last but crucially, its low complexity, that has been quantified through both memory and computation requirements makes this method hugely attractive for future hardware implementation. Copyright © 2014 Elsevier B.V. All rights reserved.

A Framework for the Comparative Assessment of Neuronal Spike Sorting Algorithms towards More Accurate Off-Line and On-Line Microelectrode Arrays Data Analysis.

Science.gov (United States)

Regalia, Giulia; Coelli, Stefania; Biffi, Emilia; Ferrigno, Giancarlo; Pedrocchi, Alessandra

2016-01-01

Neuronal spike sorting algorithms are designed to retrieve neuronal network activity on a single-cell level from extracellular multiunit recordings with Microelectrode Arrays (MEAs). In typical analysis of MEA data, one spike sorting algorithm is applied indiscriminately to all electrode signals. However, this approach neglects the dependency of algorithms' performances on the neuronal signals properties at each channel, which require data-centric methods. Moreover, sorting is commonly performed off-line, which is time and memory consuming and prevents researchers from having an immediate glance at ongoing experiments. The aim of this work is to provide a versatile framework to support the evaluation and comparison of different spike classification algorithms suitable for both off-line and on-line analysis. We incorporated different spike sorting "building blocks" into a Matlab-based software, including 4 feature extraction methods, 3 feature clustering methods, and 1 template matching classifier. The framework was validated by applying different algorithms on simulated and real signals from neuronal cultures coupled to MEAs. Moreover, the system has been proven effective in running on-line analysis on a standard desktop computer, after the selection of the most suitable sorting methods. This work provides a useful and versatile instrument for a supported comparison of different options for spike sorting towards more accurate off-line and on-line MEA data analysis.

A graph-Laplacian-based feature extraction algorithm for neural spike sorting.

Science.gov (United States)

Ghanbari, Yasser; Spence, Larry; Papamichalis, Panos

2009-01-01

Analysis of extracellular neural spike recordings is highly dependent upon the accuracy of neural waveform classification, commonly referred to as spike sorting. Feature extraction is an important stage of this process because it can limit the quality of clustering which is performed in the feature space. This paper proposes a new feature extraction method (which we call Graph Laplacian Features, GLF) based on minimizing the graph Laplacian and maximizing the weighted variance. The algorithm is compared with Principal Components Analysis (PCA, the most commonly-used feature extraction method) using simulated neural data. The results show that the proposed algorithm produces more compact and well-separated clusters compared to PCA. As an added benefit, tentative cluster centers are output which can be used to initialize a subsequent clustering stage.

An Efficient VLSI Architecture for Multi-Channel Spike Sorting Using a Generalized Hebbian Algorithm

Directory of Open Access Journals (Sweden)

Ying-Lun Chen

2015-08-01

Full Text Available A novel VLSI architecture for multi-channel online spike sorting is presented in this paper. In the architecture, the spike detection is based on nonlinear energy operator (NEO, and the feature extraction is carried out by the generalized Hebbian algorithm (GHA. To lower the power consumption and area costs of the circuits, all of the channels share the same core for spike detection and feature extraction operations. Each channel has dedicated buffers for storing the detected spikes and the principal components of that channel. The proposed circuit also contains a clock gating system supplying the clock to only the buffers of channels currently using the computation core to further reduce the power consumption. The architecture has been implemented by an application-specific integrated circuit (ASIC with 90-nm technology. Comparisons to the existing works show that the proposed architecture has lower power consumption and hardware area costs for real-time multi-channel spike detection and feature extraction.

An Efficient VLSI Architecture for Multi-Channel Spike Sorting Using a Generalized Hebbian Algorithm.

Science.gov (United States)

Chen, Ying-Lun; Hwang, Wen-Jyi; Ke, Chi-En

2015-08-13

A novel VLSI architecture for multi-channel online spike sorting is presented in this paper. In the architecture, the spike detection is based on nonlinear energy operator (NEO), and the feature extraction is carried out by the generalized Hebbian algorithm (GHA). To lower the power consumption and area costs of the circuits, all of the channels share the same core for spike detection and feature extraction operations. Each channel has dedicated buffers for storing the detected spikes and the principal components of that channel. The proposed circuit also contains a clock gating system supplying the clock to only the buffers of channels currently using the computation core to further reduce the power consumption. The architecture has been implemented by an application-specific integrated circuit (ASIC) with 90-nm technology. Comparisons to the existing works show that the proposed architecture has lower power consumption and hardware area costs for real-time multi-channel spike detection and feature extraction.

An Efficient VLSI Architecture for Multi-Channel Spike Sorting Using a Generalized Hebbian Algorithm

Science.gov (United States)

Chen, Ying-Lun; Hwang, Wen-Jyi; Ke, Chi-En

2015-01-01

A novel VLSI architecture for multi-channel online spike sorting is presented in this paper. In the architecture, the spike detection is based on nonlinear energy operator (NEO), and the feature extraction is carried out by the generalized Hebbian algorithm (GHA). To lower the power consumption and area costs of the circuits, all of the channels share the same core for spike detection and feature extraction operations. Each channel has dedicated buffers for storing the detected spikes and the principal components of that channel. The proposed circuit also contains a clock gating system supplying the clock to only the buffers of channels currently using the computation core to further reduce the power consumption. The architecture has been implemented by an application-specific integrated circuit (ASIC) with 90-nm technology. Comparisons to the existing works show that the proposed architecture has lower power consumption and hardware area costs for real-time multi-channel spike detection and feature extraction. PMID:26287193

A spike sorting toolbox for up to thousands of electrodes validated with ground truth recordings in vitro and in vivo

Science.gov (United States)

Lefebvre, Baptiste; Deny, Stéphane; Gardella, Christophe; Stimberg, Marcel; Jetter, Florian; Zeck, Guenther; Picaud, Serge; Duebel, Jens

2018-01-01

In recent years, multielectrode arrays and large silicon probes have been developed to record simultaneously between hundreds and thousands of electrodes packed with a high density. However, they require novel methods to extract the spiking activity of large ensembles of neurons. Here, we developed a new toolbox to sort spikes from these large-scale extracellular data. To validate our method, we performed simultaneous extracellular and loose patch recordings in rodents to obtain ‘ground truth’ data, where the solution to this sorting problem is known for one cell. The performance of our algorithm was always close to the best expected performance, over a broad range of signal-to-noise ratios, in vitro and in vivo. The algorithm is entirely parallelized and has been successfully tested on recordings with up to 4225 electrodes. Our toolbox thus offers a generic solution to sort accurately spikes for up to thousands of electrodes. PMID:29557782

A Low Cost VLSI Architecture for Spike Sorting Based on Feature Extraction with Peak Search.

Science.gov (United States)

Chang, Yuan-Jyun; Hwang, Wen-Jyi; Chen, Chih-Chang

2016-12-07

The goal of this paper is to present a novel VLSI architecture for spike sorting with high classification accuracy, low area costs and low power consumption. A novel feature extraction algorithm with low computational complexities is proposed for the design of the architecture. In the feature extraction algorithm, a spike is separated into two portions based on its peak value. The area of each portion is then used as a feature. The algorithm is simple to implement and less susceptible to noise interference. Based on the algorithm, a novel architecture capable of identifying peak values and computing spike areas concurrently is proposed. To further accelerate the computation, a spike can be divided into a number of segments for the local feature computation. The local features are subsequently merged with the global ones by a simple hardware circuit. The architecture can also be easily operated in conjunction with the circuits for commonly-used spike detection algorithms, such as the Non-linear Energy Operator (NEO). The architecture has been implemented by an Application-Specific Integrated Circuit (ASIC) with 90-nm technology. Comparisons to the existing works show that the proposed architecture is well suited for real-time multi-channel spike detection and feature extraction requiring low hardware area costs, low power consumption and high classification accuracy.

A Low Cost VLSI Architecture for Spike Sorting Based on Feature Extraction with Peak Search

Directory of Open Access Journals (Sweden)

Yuan-Jyun Chang

2016-12-01

Full Text Available The goal of this paper is to present a novel VLSI architecture for spike sorting with high classification accuracy, low area costs and low power consumption. A novel feature extraction algorithm with low computational complexities is proposed for the design of the architecture. In the feature extraction algorithm, a spike is separated into two portions based on its peak value. The area of each portion is then used as a feature. The algorithm is simple to implement and less susceptible to noise interference. Based on the algorithm, a novel architecture capable of identifying peak values and computing spike areas concurrently is proposed. To further accelerate the computation, a spike can be divided into a number of segments for the local feature computation. The local features are subsequently merged with the global ones by a simple hardware circuit. The architecture can also be easily operated in conjunction with the circuits for commonly-used spike detection algorithms, such as the Non-linear Energy Operator (NEO. The architecture has been implemented by an Application-Specific Integrated Circuit (ASIC with 90-nm technology. Comparisons to the existing works show that the proposed architecture is well suited for real-time multi-channel spike detection and feature extraction requiring low hardware area costs, low power consumption and high classification accuracy.

A novel unsupervised spike sorting algorithm for intracranial EEG.

Science.gov (United States)

Yadav, R; Shah, A K; Loeb, J A; Swamy, M N S; Agarwal, R

2011-01-01

This paper presents a novel, unsupervised spike classification algorithm for intracranial EEG. The method combines template matching and principal component analysis (PCA) for building a dynamic patient-specific codebook without a priori knowledge of the spike waveforms. The problem of misclassification due to overlapping classes is resolved by identifying similar classes in the codebook using hierarchical clustering. Cluster quality is visually assessed by projecting inter- and intra-clusters onto a 3D plot. Intracranial EEG from 5 patients was utilized to optimize the algorithm. The resulting codebook retains 82.1% of the detected spikes in non-overlapping and disjoint clusters. Initial results suggest a definite role of this method for both rapid review and quantitation of interictal spikes that could enhance both clinical treatment and research studies on epileptic patients.

A Screen Space GPGPU Surface LIC Algorithm for Distributed Memory Data Parallel Sort Last Rendering Infrastructures

Energy Technology Data Exchange (ETDEWEB)

Loring, Burlen; Karimabadi, Homa; Rortershteyn, Vadim

2014-07-01

The surface line integral convolution(LIC) visualization technique produces dense visualization of vector fields on arbitrary surfaces. We present a screen space surface LIC algorithm for use in distributed memory data parallel sort last rendering infrastructures. The motivations for our work are to support analysis of datasets that are too large to fit in the main memory of a single computer and compatibility with prevalent parallel scientific visualization tools such as ParaView and VisIt. By working in screen space using OpenGL we can leverage the computational power of GPUs when they are available and run without them when they are not. We address efficiency and performance issues that arise from the transformation of data from physical to screen space by selecting an alternate screen space domain decomposition. We analyze the algorithm's scaling behavior with and without GPUs on two high performance computing systems using data from turbulent plasma simulations.

A review on cluster estimation methods and their application to neural spike data.

Science.gov (United States)

Zhang, James; Nguyen, Thanh; Cogill, Steven; Bhatti, Asim; Luo, Lingkun; Yang, Samuel; Nahavandi, Saeid

2018-06-01

The extracellular action potentials recorded on an electrode result from the collective simultaneous electrophysiological activity of an unknown number of neurons. Identifying and assigning these action potentials to their firing neurons-'spike sorting'-is an indispensable step in studying the function and the response of an individual or ensemble of neurons to certain stimuli. Given the task of neural spike sorting, the determination of the number of clusters (neurons) is arguably the most difficult and challenging issue, due to the existence of background noise and the overlap and interactions among neurons in neighbouring regions. It is not surprising that some researchers still rely on visual inspection by experts to estimate the number of clusters in neural spike sorting. Manual inspection, however, is not suitable to processing the vast, ever-growing amount of neural data. To address this pressing need, in this paper, thirty-three clustering validity indices have been comprehensively reviewed and implemented to determine the number of clusters in neural datasets. To gauge the suitability of the indices to neural spike data, and inform the selection process, we then calculated the indices by applying k-means clustering to twenty widely used synthetic neural datasets and one empirical dataset, and compared the performance of these indices against pre-existing ground truth labels. The results showed that the top five validity indices work consistently well across variations in noise level, both for the synthetic datasets and the real dataset. Using these top performing indices provides strong support for the determination of the number of neural clusters, which is essential in the spike sorting process.

The Omega-Infinity Limit of Single Spikes

CERN Document Server

Axenides, Minos; Linardopoulos, Georgios

A new infinite-size limit of strings in RxS2 is presented. The limit is obtained from single spike strings by letting their angular velocity omega become infinite. We derive the energy-momenta relation of omega-infinity single spikes as their linear velocity v-->1 and their angular momentum J-->1. Generally, the v-->1, J-->1 limit of single spikes is singular and has to be excluded from the spectrum and be studied separately. We discover that the dispersion relation of omega-infinity single spikes contains logarithms in the limit J-->1. This result is somewhat surprising, since the logarithmic behavior in the string spectra is typically associated with their motion in non-compact spaces such as AdS. Omega-infinity single spikes seem to completely cover the surface of the 2-sphere they occupy, so that they may essentially be viewed as some sort of "brany strings". A proof of the sphere-filling property of omega-infinity single spikes is given in the appendix.

Unified selective sorting approach to analyse multi-electrode extracellular data

Science.gov (United States)

Veerabhadrappa, R.; Lim, C. P.; Nguyen, T. T.; Berk, M.; Tye, S. J.; Monaghan, P.; Nahavandi, S.; Bhatti, A.

2016-01-01

Extracellular data analysis has become a quintessential method for understanding the neurophysiological responses to stimuli. This demands stringent techniques owing to the complicated nature of the recording environment. In this paper, we highlight the challenges in extracellular multi-electrode recording and data analysis as well as the limitations pertaining to some of the currently employed methodologies. To address some of the challenges, we present a unified algorithm in the form of selective sorting. Selective sorting is modelled around hypothesized generative model, which addresses the natural phenomena of spikes triggered by an intricate neuronal population. The algorithm incorporates Cepstrum of Bispectrum, ad hoc clustering algorithms, wavelet transforms, least square and correlation concepts which strategically tailors a sequence to characterize and form distinctive clusters. Additionally, we demonstrate the influence of noise modelled wavelets to sort overlapping spikes. The algorithm is evaluated using both raw and synthesized data sets with different levels of complexity and the performances are tabulated for comparison using widely accepted qualitative and quantitative indicators. PMID:27339770

An Overview of Bayesian Methods for Neural Spike Train Analysis

Directory of Open Access Journals (Sweden)

Zhe Chen

2013-01-01

Full Text Available Neural spike train analysis is an important task in computational neuroscience which aims to understand neural mechanisms and gain insights into neural circuits. With the advancement of multielectrode recording and imaging technologies, it has become increasingly demanding to develop statistical tools for analyzing large neuronal ensemble spike activity. Here we present a tutorial overview of Bayesian methods and their representative applications in neural spike train analysis, at both single neuron and population levels. On the theoretical side, we focus on various approximate Bayesian inference techniques as applied to latent state and parameter estimation. On the application side, the topics include spike sorting, tuning curve estimation, neural encoding and decoding, deconvolution of spike trains from calcium imaging signals, and inference of neuronal functional connectivity and synchrony. Some research challenges and opportunities for neural spike train analysis are discussed.

A review on cluster estimation methods and their application to neural spike data

Science.gov (United States)

Zhang, James; Nguyen, Thanh; Cogill, Steven; Bhatti, Asim; Luo, Lingkun; Yang, Samuel; Nahavandi, Saeid

2018-06-01

The extracellular action potentials recorded on an electrode result from the collective simultaneous electrophysiological activity of an unknown number of neurons. Identifying and assigning these action potentials to their firing neurons—‘spike sorting’—is an indispensable step in studying the function and the response of an individual or ensemble of neurons to certain stimuli. Given the task of neural spike sorting, the determination of the number of clusters (neurons) is arguably the most difficult and challenging issue, due to the existence of background noise and the overlap and interactions among neurons in neighbouring regions. It is not surprising that some researchers still rely on visual inspection by experts to estimate the number of clusters in neural spike sorting. Manual inspection, however, is not suitable to processing the vast, ever-growing amount of neural data. To address this pressing need, in this paper, thirty-three clustering validity indices have been comprehensively reviewed and implemented to determine the number of clusters in neural datasets. To gauge the suitability of the indices to neural spike data, and inform the selection process, we then calculated the indices by applying k-means clustering to twenty widely used synthetic neural datasets and one empirical dataset, and compared the performance of these indices against pre-existing ground truth labels. The results showed that the top five validity indices work consistently well across variations in noise level, both for the synthetic datasets and the real dataset. Using these top performing indices provides strong support for the determination of the number of neural clusters, which is essential in the spike sorting process.

Real-time volume rendering of digital medical images on an iOS device

Science.gov (United States)

Noon, Christian; Holub, Joseph; Winer, Eliot

2013-03-01

Performing high quality 3D visualizations on mobile devices, while tantalizingly close in many areas, is still a quite difficult task. This is especially true for 3D volume rendering of digital medical images. Allowing this would empower medical personnel a powerful tool to diagnose and treat patients and train the next generation of physicians. This research focuses on performing real time volume rendering of digital medical images on iOS devices using custom developed GPU shaders for orthogonal texture slicing. An interactive volume renderer was designed and developed with several new features including dynamic modification of render resolutions, an incremental render loop, a shader-based clipping algorithm to support OpenGL ES 2.0, and an internal backface culling algorithm for properly sorting rendered geometry with alpha blending. The application was developed using several application programming interfaces (APIs) such as OpenSceneGraph (OSG) as the primary graphics renderer coupled with iOS Cocoa Touch for user interaction, and DCMTK for DICOM I/O. The developed application rendered volume datasets over 450 slices up to 50-60 frames per second, depending on the specific model of the iOS device. All rendering is done locally on the device so no Internet connection is required.

The transfer function of neuron spike.

Science.gov (United States)

Palmieri, Igor; Monteiro, Luiz H A; Miranda, Maria D

2015-08-01

The mathematical modeling of neuronal signals is a relevant problem in neuroscience. The complexity of the neuron behavior, however, makes this problem a particularly difficult task. Here, we propose a discrete-time linear time-invariant (LTI) model with a rational function in order to represent the neuronal spike detected by an electrode located in the surroundings of the nerve cell. The model is presented as a cascade association of two subsystems: one that generates an action potential from an input stimulus, and one that represents the medium between the cell and the electrode. The suggested approach employs system identification and signal processing concepts, and is dissociated from any considerations about the biophysical processes of the neuronal cell, providing a low-complexity alternative to model the neuronal spike. The model is validated by using in vivo experimental readings of intracellular and extracellular signals. A computational simulation of the model is presented in order to assess its proximity to the neuronal signal and to observe the variability of the estimated parameters. The implications of the results are discussed in the context of spike sorting. Copyright © 2015 Elsevier Ltd. All rights reserved.

Reconstructing stimuli from the spike-times of leaky integrate and fire neurons

Directory of Open Access Journals (Sweden)

Sebastian eGerwinn

2011-02-01

Full Text Available Reconstructing stimuli from the spike-trains of neurons is an important approach for understanding the neural code. One of the difficulties associated with this task is that signals which are varying continuously in time are encoded into sequences of discrete events or spikes. An important problem is to determine how much information about the continuously varying stimulus can be extracted from the time-points at which spikes were observed, especially if these time-points are subject to some sort of randomness. For the special case of spike trains generated by leaky integrate and fire neurons, noise can be introduced by allowing variations in the threshold every time a spike is released. A simple decoding algorithm previously derived for the noiseless case can be extended to the stochastic case, but turns out to be biased. Here, we review a solution to this problem, by presenting a simple yet efficient algorithm which greatly reduces the bias, and therefore leads to better decoding performance in the stochastic case.

Perbandingan Kecepatan Gabungan Algoritma Quick Sort dan Merge Sort dengan Insertion Sort, Bubble Sort dan Selection Sort

OpenAIRE

Al Rivan, Muhammad Ezar

2017-01-01

Ordering is one of the process done before doing data processing. The sorting algorithm has its own strengths and weaknesses. By taking strengths of each algorithm then combined can be a better algorithm. Quick Sort and Merge Sort are algorithms that divide the data into parts and each part divide again into sub-section until one element. Usually one element join with others and then sorted by. In this experiment data divide into parts that have size not more than threshold. This part then so...

Chromium: A Stress-Processing Framework for Interactive Rendering on Clusters

International Nuclear Information System (INIS)

Humphreys, G.; Houston, M.; Ng, Y.-R.; Frank, R.; Ahern, S.; Kirchner, P.D.; Klosowski, J.T.

2002-01-01

We describe Chromium, a system for manipulating streams of graphics API commands on clusters of workstations. Chromium's stream filters can be arranged to create sort-first and sort-last parallel graphics architectures that, in many cases, support the same applications while using only commodity graphics accelerators. In addition, these stream filters can be extended programmatically, allowing the user to customize the stream transformations performed by nodes in a cluster. Because our stream processing mechanism is completely general, any cluster-parallel rendering algorithm can be either implemented on top of or embedded in Chromium. In this paper, we give examples of real-world applications that use Chromium to achieve good scalability on clusters of workstations, and describe other potential uses of this stream processing technology. By completely abstracting the underlying graphics architecture, network topology, and API command processing semantics, we allow a variety of applications to run in different environments

Comprehensive two-dimensional gas chromatography/time-of-flight mass spectrometry peak sorting algorithm.

Science.gov (United States)

Oh, Cheolhwan; Huang, Xiaodong; Regnier, Fred E; Buck, Charles; Zhang, Xiang

2008-02-01

We report a novel peak sorting method for the two-dimensional gas chromatography/time-of-flight mass spectrometry (GC x GC/TOF-MS) system. The objective of peak sorting is to recognize peaks from the same metabolite occurring in different samples from thousands of peaks detected in the analytical procedure. The developed algorithm is based on the fact that the chromatographic peaks for a given analyte have similar retention times in all of the chromatograms. Raw instrument data are first processed by ChromaTOF (Leco) software to provide the peak tables. Our algorithm achieves peak sorting by utilizing the first- and second-dimension retention times in the peak tables and the mass spectra generated during the process of electron impact ionization. The algorithm searches the peak tables for the peaks generated by the same type of metabolite using several search criteria. Our software also includes options to eliminate non-target peaks from the sorting results, e.g., peaks of contaminants. The developed software package has been tested using a mixture of standard metabolites and another mixture of standard metabolites spiked into human serum. Manual validation demonstrates high accuracy of peak sorting with this algorithm.

Binar Sort: A Linear Generalized Sorting Algorithm

OpenAIRE

Gilreath, William F.

2008-01-01

Sorting is a common and ubiquitous activity for computers. It is not surprising that there exist a plethora of sorting algorithms. For all the sorting algorithms, it is an accepted performance limit that sorting algorithms are linearithmic or O(N lg N). The linearithmic lower bound in performance stems from the fact that the sorting algorithms use the ordering property of the data. The sorting algorithm uses comparison by the ordering property to arrange the data elements from an initial perm...

Electrical stimulus artifact cancellation and neural spike detection on large multi-electrode arrays.

Science.gov (United States)

Mena, Gonzalo E; Grosberg, Lauren E; Madugula, Sasidhar; Hottowy, Paweł; Litke, Alan; Cunningham, John; Chichilnisky, E J; Paninski, Liam

2017-11-01

Simultaneous electrical stimulation and recording using multi-electrode arrays can provide a valuable technique for studying circuit connectivity and engineering neural interfaces. However, interpreting these measurements is challenging because the spike sorting process (identifying and segregating action potentials arising from different neurons) is greatly complicated by electrical stimulation artifacts across the array, which can exhibit complex and nonlinear waveforms, and overlap temporarily with evoked spikes. Here we develop a scalable algorithm based on a structured Gaussian Process model to estimate the artifact and identify evoked spikes. The effectiveness of our methods is demonstrated in both real and simulated 512-electrode recordings in the peripheral primate retina with single-electrode and several types of multi-electrode stimulation. We establish small error rates in the identification of evoked spikes, with a computational complexity that is compatible with real-time data analysis. This technology may be helpful in the design of future high-resolution sensory prostheses based on tailored stimulation (e.g., retinal prostheses), and for closed-loop neural stimulation at a much larger scale than currently possible.

LazySorted: A Lazily, Partially Sorted Python List

Directory of Open Access Journals (Sweden)

Naftali Harris

2015-06-01

Full Text Available LazySorted is a Python C extension implementing a partially and lazily sorted list data structure. It solves a common problem faced by programmers, in which they need just part of a sorted list, like its middle element (the median, but sort the entire list to get it. LazySorted presents them with the abstraction that they are working with a fully sorted list, while actually only sorting the list partially with quicksort partitions to return the requested sub-elements. This enables programmers to use naive "sort first" algorithms but nonetheless attain linear run-times when possible. LazySorted may serve as a drop-in replacement for the built-in sorted function in most cases, and can sometimes achieve run-times more than 7 times faster.

Parallel rendering

Science.gov (United States)

Crockett, Thomas W.

1995-01-01

This article provides a broad introduction to the subject of parallel rendering, encompassing both hardware and software systems. The focus is on the underlying concepts and the issues which arise in the design of parallel rendering algorithms and systems. We examine the different types of parallelism and how they can be applied in rendering applications. Concepts from parallel computing, such as data decomposition, task granularity, scalability, and load balancing, are considered in relation to the rendering problem. We also explore concepts from computer graphics, such as coherence and projection, which have a significant impact on the structure of parallel rendering algorithms. Our survey covers a number of practical considerations as well, including the choice of architectural platform, communication and memory requirements, and the problem of image assembly and display. We illustrate the discussion with numerous examples from the parallel rendering literature, representing most of the principal rendering methods currently used in computer graphics.

When the Ostrich-Algorithm Fails: Blanking Method Affects Spike Train Statistics.

Science.gov (United States)

Joseph, Kevin; Mottaghi, Soheil; Christ, Olaf; Feuerstein, Thomas J; Hofmann, Ulrich G

2018-01-01

Modern electroceuticals are bound to employ the usage of electrical high frequency (130-180 Hz) stimulation carried out under closed loop control, most prominent in the case of movement disorders. However, particular challenges are faced when electrical recordings of neuronal tissue are carried out during high frequency electrical stimulation, both in-vivo and in-vitro . This stimulation produces undesired artifacts and can render the recorded signal only partially useful. The extent of these artifacts is often reduced by temporarily grounding the recording input during stimulation pulses. In the following study, we quantify the effects of this method, "blanking," on the spike count and spike train statistics. Starting from a theoretical standpoint, we calculate a loss in the absolute number of action potentials, depending on: width of the blanking window, frequency of stimulation, and intrinsic neuronal activity. These calculations were then corroborated by actual high signal to noise ratio (SNR) single cell recordings. We state that, for clinically relevant frequencies of 130 Hz (used for movement disorders) and realistic blanking windows of 2 ms, up to 27% of actual existing spikes are lost. We strongly advice cautioned use of the blanking method when spike rate quantification is attempted. Blanking (artifact removal by temporarily grounding input), depending on recording parameters, can lead to significant spike loss. Very careful use of blanking circuits is advised.

When the Ostrich-Algorithm Fails: Blanking Method Affects Spike Train Statistics

Directory of Open Access Journals (Sweden)

Kevin Joseph

2018-04-01

Full Text Available Modern electroceuticals are bound to employ the usage of electrical high frequency (130–180 Hz stimulation carried out under closed loop control, most prominent in the case of movement disorders. However, particular challenges are faced when electrical recordings of neuronal tissue are carried out during high frequency electrical stimulation, both in-vivo and in-vitro. This stimulation produces undesired artifacts and can render the recorded signal only partially useful. The extent of these artifacts is often reduced by temporarily grounding the recording input during stimulation pulses. In the following study, we quantify the effects of this method, “blanking,” on the spike count and spike train statistics. Starting from a theoretical standpoint, we calculate a loss in the absolute number of action potentials, depending on: width of the blanking window, frequency of stimulation, and intrinsic neuronal activity. These calculations were then corroborated by actual high signal to noise ratio (SNR single cell recordings. We state that, for clinically relevant frequencies of 130 Hz (used for movement disorders and realistic blanking windows of 2 ms, up to 27% of actual existing spikes are lost. We strongly advice cautioned use of the blanking method when spike rate quantification is attempted.Impact statementBlanking (artifact removal by temporarily grounding input, depending on recording parameters, can lead to significant spike loss. Very careful use of blanking circuits is advised.

Sorting Out Sorts

OpenAIRE

Jonathan B. Berk

1998-01-01

In this paper we analyze the theoretical implications of sorting data into groups and then running asset pricing tests within each group. We show that the way this procedure is implemented introduces a severe bias in favor of rejecting the model under consideration. By simply picking enough groups to sort into even the true asset pricing model can be shown to have no explanatory power within each group.

Verification of counting sort and radix sort

NARCIS (Netherlands)

C.P.T. de Gouw (Stijn); F.S. de Boer (Frank); J.C. Rot (Jurriaan)

2016-01-01

textabstractSorting is an important algorithmic task used in many applications. Two main aspects of sorting algorithms which have been studied extensively are complexity and correctness. [Foley and Hoare, 1971] published the first formal correctness proof of a sorting algorithm (Quicksort). While

A stationary wavelet transform and a time-frequency based spike detection algorithm for extracellular recorded data.

Science.gov (United States)

Lieb, Florian; Stark, Hans-Georg; Thielemann, Christiane

2017-06-01

Spike detection from extracellular recordings is a crucial preprocessing step when analyzing neuronal activity. The decision whether a specific part of the signal is a spike or not is important for any kind of other subsequent preprocessing steps, like spike sorting or burst detection in order to reduce the classification of erroneously identified spikes. Many spike detection algorithms have already been suggested, all working reasonably well whenever the signal-to-noise ratio is large enough. When the noise level is high, however, these algorithms have a poor performance. In this paper we present two new spike detection algorithms. The first is based on a stationary wavelet energy operator and the second is based on the time-frequency representation of spikes. Both algorithms are more reliable than all of the most commonly used methods. The performance of the algorithms is confirmed by using simulated data, resembling original data recorded from cortical neurons with multielectrode arrays. In order to demonstrate that the performance of the algorithms is not restricted to only one specific set of data, we also verify the performance using a simulated publicly available data set. We show that both proposed algorithms have the best performance under all tested methods, regardless of the signal-to-noise ratio in both data sets. This contribution will redound to the benefit of electrophysiological investigations of human cells. Especially the spatial and temporal analysis of neural network communications is improved by using the proposed spike detection algorithms.

SuperSpike: Supervised Learning in Multilayer Spiking Neural Networks.

Science.gov (United States)

Zenke, Friedemann; Ganguli, Surya

2018-04-13

A vast majority of computation in the brain is performed by spiking neural networks. Despite the ubiquity of such spiking, we currently lack an understanding of how biological spiking neural circuits learn and compute in vivo, as well as how we can instantiate such capabilities in artificial spiking circuits in silico. Here we revisit the problem of supervised learning in temporally coding multilayer spiking neural networks. First, by using a surrogate gradient approach, we derive SuperSpike, a nonlinear voltage-based three-factor learning rule capable of training multilayer networks of deterministic integrate-and-fire neurons to perform nonlinear computations on spatiotemporal spike patterns. Second, inspired by recent results on feedback alignment, we compare the performance of our learning rule under different credit assignment strategies for propagating output errors to hidden units. Specifically, we test uniform, symmetric, and random feedback, finding that simpler tasks can be solved with any type of feedback, while more complex tasks require symmetric feedback. In summary, our results open the door to obtaining a better scientific understanding of learning and computation in spiking neural networks by advancing our ability to train them to solve nonlinear problems involving transformations between different spatiotemporal spike time patterns.

Spiking neural network for recognizing spatiotemporal sequences of spikes

International Nuclear Information System (INIS)

Jin, Dezhe Z.

2004-01-01

Sensory neurons in many brain areas spike with precise timing to stimuli with temporal structures, and encode temporally complex stimuli into spatiotemporal spikes. How the downstream neurons read out such neural code is an important unsolved problem. In this paper, we describe a decoding scheme using a spiking recurrent neural network. The network consists of excitatory neurons that form a synfire chain, and two globally inhibitory interneurons of different types that provide delayed feedforward and fast feedback inhibition, respectively. The network signals recognition of a specific spatiotemporal sequence when the last excitatory neuron down the synfire chain spikes, which happens if and only if that sequence was present in the input spike stream. The recognition scheme is invariant to variations in the intervals between input spikes within some range. The computation of the network can be mapped into that of a finite state machine. Our network provides a simple way to decode spatiotemporal spikes with diverse types of neurons

The Severe Acute Respiratory Syndrome (SARS-coronavirus 3a protein may function as a modulator of the trafficking properties of the spike protein

Directory of Open Access Journals (Sweden)

Tan Yee-Joo

2005-02-01

Full Text Available Abstract Background A recent publication reported that a tyrosine-dependent sorting signal, present in cytoplasmic tail of the spike protein of most coronaviruses, mediates the intracellular retention of the spike protein. This motif is missing from the spike protein of the severe acute respiratory syndrome-coronavirus (SARS-CoV, resulting in high level of surface expression of the spike protein when it is expressed on its own in vitro. Presentation of the hypothesis It has been shown that the severe acute respiratory syndrome-coronavirus genome contains open reading frames that encode for proteins with no homologue in other coronaviruses. One of them is the 3a protein, which is expressed during infection in vitro and in vivo. The 3a protein, which contains a tyrosine-dependent sorting signal in its cytoplasmic domain, is expressed on the cell surface and can undergo internalization. In addition, 3a can bind to the spike protein and through this interaction, it may be able to cause the spike protein to become internalized, resulting in a decrease in its surface expression. Testing the hypothesis The effects of 3a on the internalization of cell surface spike protein can be examined biochemically and the significance of the interplay between these two viral proteins during viral infection can be studied using reverse genetics methodology. Implication of the hypothesis If this hypothesis is proven, it will indicate that the severe acute respiratory syndrome-coronavirus modulates the surface expression of the spike protein via a different mechanism from other coronaviruses. The interaction between 3a and S, which are expressed from separate subgenomic RNA, would be important for controlling the trafficking properties of S. The cell surface expression of S in infected cells significantly impacts viral assembly, viral spread and viral pathogenesis. Modulation by this unique pathway could confer certain advantages during the replication of the severe

A stationary wavelet transform and a time-frequency based spike detection algorithm for extracellular recorded data

Science.gov (United States)

Lieb, Florian; Stark, Hans-Georg; Thielemann, Christiane

2017-06-01

Objective. Spike detection from extracellular recordings is a crucial preprocessing step when analyzing neuronal activity. The decision whether a specific part of the signal is a spike or not is important for any kind of other subsequent preprocessing steps, like spike sorting or burst detection in order to reduce the classification of erroneously identified spikes. Many spike detection algorithms have already been suggested, all working reasonably well whenever the signal-to-noise ratio is large enough. When the noise level is high, however, these algorithms have a poor performance. Approach. In this paper we present two new spike detection algorithms. The first is based on a stationary wavelet energy operator and the second is based on the time-frequency representation of spikes. Both algorithms are more reliable than all of the most commonly used methods. Main results. The performance of the algorithms is confirmed by using simulated data, resembling original data recorded from cortical neurons with multielectrode arrays. In order to demonstrate that the performance of the algorithms is not restricted to only one specific set of data, we also verify the performance using a simulated publicly available data set. We show that both proposed algorithms have the best performance under all tested methods, regardless of the signal-to-noise ratio in both data sets. Significance. This contribution will redound to the benefit of electrophysiological investigations of human cells. Especially the spatial and temporal analysis of neural network communications is improved by using the proposed spike detection algorithms.

Perbandingan Bubble Sort dengan Insertion Sort pada Bahasa Pemrograman C dan Fortran

OpenAIRE

Reina, Reina; Gautama, Josef Bernadi

2013-01-01

Sorting is a basic algorithm studied by students of computer science major. Sorting algorithm is the basis of other algorithms such as searching algorithm, pattern matching algorithm. Bubble sort is a popular basic sorting algorithm due to its easiness to be implemented. Besides bubble sort, there is insertion sort. It is lesspopular than bubble sort because it has more difficult algorithm. This paper discusses about process time between insertion sort and bubble sort with two kinds of data. ...

Interactive dual-volume rendering visualization with real-time fusion and transfer function enhancement

Science.gov (United States)

Macready, Hugh; Kim, Jinman; Feng, David; Cai, Weidong

2006-03-01

Dual-modality imaging scanners combining functional PET and anatomical CT constitute a challenge in volumetric visualization that can be limited by the high computational demand and expense. This study aims at providing physicians with multi-dimensional visualization tools, in order to navigate and manipulate the data running on a consumer PC. We have maximized the utilization of pixel-shader architecture of the low-cost graphic hardware and the texture-based volume rendering to provide visualization tools with high degree of interactivity. All the software was developed using OpenGL and Silicon Graphics Inc. Volumizer, tested on a Pentium mobile CPU on a PC notebook with 64M graphic memory. We render the individual modalities separately, and performing real-time per-voxel fusion. We designed a novel "alpha-spike" transfer function to interactively identify structure of interest from volume rendering of PET/CT. This works by assigning a non-linear opacity to the voxels, thus, allowing the physician to selectively eliminate or reveal information from the PET/CT volumes. As the PET and CT are rendered independently, manipulations can be applied to individual volumes, for instance, the application of transfer function to CT to reveal the lung boundary while adjusting the fusion ration between the CT and PET to enhance the contrast of a tumour region, with the resultant manipulated data sets fused together in real-time as the adjustments are made. In addition to conventional navigation and manipulation tools, such as scaling, LUT, volume slicing, and others, our strategy permits efficient visualization of PET/CT volume rendering which can potentially aid in interpretation and diagnosis.

Serial Spike Time Correlations Affect Probability Distribution of Joint Spike Events.

Science.gov (United States)

Shahi, Mina; van Vreeswijk, Carl; Pipa, Gordon

2016-01-01

Detecting the existence of temporally coordinated spiking activity, and its role in information processing in the cortex, has remained a major challenge for neuroscience research. Different methods and approaches have been suggested to test whether the observed synchronized events are significantly different from those expected by chance. To analyze the simultaneous spike trains for precise spike correlation, these methods typically model the spike trains as a Poisson process implying that the generation of each spike is independent of all the other spikes. However, studies have shown that neural spike trains exhibit dependence among spike sequences, such as the absolute and relative refractory periods which govern the spike probability of the oncoming action potential based on the time of the last spike, or the bursting behavior, which is characterized by short epochs of rapid action potentials, followed by longer episodes of silence. Here we investigate non-renewal processes with the inter-spike interval distribution model that incorporates spike-history dependence of individual neurons. For that, we use the Monte Carlo method to estimate the full shape of the coincidence count distribution and to generate false positives for coincidence detection. The results show that compared to the distributions based on homogeneous Poisson processes, and also non-Poisson processes, the width of the distribution of joint spike events changes. Non-renewal processes can lead to both heavy tailed or narrow coincidence distribution. We conclude that small differences in the exact autostructure of the point process can cause large differences in the width of a coincidence distribution. Therefore, manipulations of the autostructure for the estimation of significance of joint spike events seem to be inadequate.

iSpike: a spiking neural interface for the iCub robot

International Nuclear Information System (INIS)

Gamez, D; Fidjeland, A K; Lazdins, E

2012-01-01

This paper presents iSpike: a C++ library that interfaces between spiking neural network simulators and the iCub humanoid robot. It uses a biologically inspired approach to convert the robot’s sensory information into spikes that are passed to the neural network simulator, and it decodes output spikes from the network into motor signals that are sent to control the robot. Applications of iSpike range from embodied models of the brain to the development of intelligent robots using biologically inspired spiking neural networks. iSpike is an open source library that is available for free download under the terms of the GPL. (paper)

Perbandingan Bubble Sort dengan Insertion Sort pada Bahasa Pemrograman C dan Fortran

Directory of Open Access Journals (Sweden)

Reina Reina

2013-12-01

Full Text Available Sorting is a basic algorithm studied by students of computer science major. Sorting algorithm is the basis of other algorithms such as searching algorithm, pattern matching algorithm. Bubble sort is a popular basic sorting algorithm due to its easiness to be implemented. Besides bubble sort, there is insertion sort. It is lesspopular than bubble sort because it has more difficult algorithm. This paper discusses about process time between insertion sort and bubble sort with two kinds of data. First is randomized data, and the second is data of descending list. Comparison of process time has been done in two kinds of programming language that is C programming language and FORTRAN programming language. The result shows that bubble sort needs more time than insertion sort does.

Cryoelectron Tomography of HIV-1 Envelope Spikes: Further Evidence for Tripod-Like Legs

Science.gov (United States)

Zhu, Ping; Winkler, Hanspeter; Chertova, Elena; Taylor, Kenneth A.; Roux, Kenneth H.

2008-01-01

A detailed understanding of the morphology of the HIV-1 envelope (Env) spike is key to understanding viral pathogenesis and for informed vaccine design. We have previously presented a cryoelectron microscopic tomogram (cryoET) of the Env spikes on SIV virions. Several structural features were noted in the gp120 head and gp41 stalk regions. Perhaps most notable was the presence of three splayed legs projecting obliquely from the base of the spike head toward the viral membrane. Subsequently, a second 3D image of SIV spikes, also obtained by cryoET, was published by another group which featured a compact vertical stalk. We now report the cryoET analysis of HIV-1 virion-associated Env spikes using enhanced analytical cryoET procedures. More than 2,000 Env spike volumes were initially selected, aligned, and sorted into structural classes using algorithms that compensate for the “missing wedge” and do not impose any symmetry. The results show varying morphologies between structural classes: some classes showed trimers in the head domains; nearly all showed two or three legs, though unambiguous three-fold symmetry was not observed either in the heads or the legs. Subsequently, clearer evidence of trimeric head domains and three splayed legs emerged when head and leg volumes were independently aligned and classified. These data show that HIV-1, like SIV, also displays the tripod-like leg configuration, and, unexpectedly, shows considerable gp41 leg flexibility/heteromorphology. The tripod-like model for gp41 is consistent with, and helps explain, many of the unique biophysical and immunological features of this region. PMID:19008954

RenderToolbox3: MATLAB tools that facilitate physically based stimulus rendering for vision research.

Science.gov (United States)

Heasly, Benjamin S; Cottaris, Nicolas P; Lichtman, Daniel P; Xiao, Bei; Brainard, David H

2014-02-07

RenderToolbox3 provides MATLAB utilities and prescribes a workflow that should be useful to researchers who want to employ graphics in the study of vision and perhaps in other endeavors as well. In particular, RenderToolbox3 facilitates rendering scene families in which various scene attributes and renderer behaviors are manipulated parametrically, enables spectral specification of object reflectance and illuminant spectra, enables the use of physically based material specifications, helps validate renderer output, and converts renderer output to physical units of radiance. This paper describes the design and functionality of the toolbox and discusses several examples that demonstrate its use. We have designed RenderToolbox3 to be portable across computer hardware and operating systems and to be free and open source (except for MATLAB itself). RenderToolbox3 is available at https://github.com/DavidBrainard/RenderToolbox3.

Design and realization of sort manipulator of crystal-angle sort machine

Science.gov (United States)

Wang, Ming-shun; Chen, Shu-ping; Guan, Shou-ping; Zhang, Yao-wei

2005-12-01

It is a current tendency of development in automation technology to replace manpower with manipulators in working places where dangerous, harmful, heavy or repetitive work is involved. The sort manipulator is installed in a crystal-angle sort machine to take the place of manpower, and engaged in unloading and sorting work. It is the outcome of combing together mechanism, electric transmission, and pneumatic element and micro-controller control. The step motor makes the sort manipulator operate precisely. The pneumatic elements make the sort manipulator be cleverer. Micro-controller's software bestows some simple artificial intelligence on the sort manipulator, so that it can precisely repeat its unloading and sorting work. The combination of manipulator's zero position and step motor counting control puts an end to accumulating error in long time operation. A sort manipulator's design in the practice engineering has been proved to be correct and reliable.

Training spiking neural networks to associate spatio-temporal input-output spike patterns

OpenAIRE

Mohemmed, A; Schliebs, S; Matsuda, S; Kasabov, N

2013-01-01

In a previous work (Mohemmed et al., Method for training a spiking neuron to associate input–output spike trains) [1] we have proposed a supervised learning algorithm based on temporal coding to train a spiking neuron to associate input spatiotemporal spike patterns to desired output spike patterns. The algorithm is based on the conversion of spike trains into analogue signals and the application of the Widrow–Hoff learning rule. In this paper we present a mathematical formulation of the prop...

Spike persistence and normalization in benign epilepsy with centrotemporal spikes - Implications for management.

Science.gov (United States)

Kim, Hunmin; Kim, Soo Yeon; Lim, Byung Chan; Hwang, Hee; Chae, Jong-Hee; Choi, Jieun; Kim, Ki Joong; Dlugos, Dennis J

2018-05-10

This study was performed 1) to determine the timing of spike normalization in patients with benign epilepsy with centrotemporal spikes (BECTS); 2) to identify relationships between age of seizure onset, age of spike normalization, years of spike persistence and treatment; and 3) to assess final outcomes between groups of patients with or without spikes at the time of medication tapering. Retrospective analysis of BECTS patients confirmed by clinical data, including age of onset, seizure semiology and serial electroencephalography (EEG) from diagnosis to remission. Age at spike normalization, years of spike persistence, and time of treatment onset to spike normalization were assessed. Final seizure and EEG outcome were compared between the groups with or without spikes at the time of AED tapering. One hundred and thirty-four patients were included. Mean age at seizure onset was 7.52 ± 2.11 years. Mean age at spike normalization was 11.89 ± 2.11 (range: 6.3-16.8) years. Mean time of treatment onset to spike normalization was 4.11 ± 2.13 (range: 0.24-10.08) years. Younger age of seizure onset was correlated with longer duration of spike persistence (r = -0.41, p < 0.001). In treated patients, spikes persisted for 4.1 ± 1.95 years, compared with 2.9 ± 1.97 years in untreated patients. No patients had recurrent seizures after AED was discontinued, regardless of the presence/absence of spikes at time of AED tapering. Years of spike persistence was longer in early onset BECTS patients. Treatment with AEDs did not shorten years of spike persistence. Persistence of spikes at time of treatment withdrawal was not associated with seizure recurrence. Copyright © 2018 The Japanese Society of Child Neurology. Published by Elsevier B.V. All rights reserved.

Parallel sorting algorithms

CERN Document Server

Akl, Selim G

1985-01-01

Parallel Sorting Algorithms explains how to use parallel algorithms to sort a sequence of items on a variety of parallel computers. The book reviews the sorting problem, the parallel models of computation, parallel algorithms, and the lower bounds on the parallel sorting problems. The text also presents twenty different algorithms, such as linear arrays, mesh-connected computers, cube-connected computers. Another example where algorithm can be applied is on the shared-memory SIMD (single instruction stream multiple data stream) computers in which the whole sequence to be sorted can fit in the

Video-based rendering

CERN Document Server

Magnor, Marcus A

2005-01-01

Driven by consumer-market applications that enjoy steadily increasing economic importance, graphics hardware and rendering algorithms are a central focus of computer graphics research. Video-based rendering is an approach that aims to overcome the current bottleneck in the time-consuming modeling process and has applications in areas such as computer games, special effects, and interactive TV. This book offers an in-depth introduction to video-based rendering, a rapidly developing new interdisciplinary topic employing techniques from computer graphics, computer vision, and telecommunication en

The Second Spiking Threshold: Dynamics of Laminar Network Spiking in the Visual Cortex

DEFF Research Database (Denmark)

Forsberg, Lars E.; Bonde, Lars H.; Harvey, Michael A.

2016-01-01

and moving visual stimuli from the spontaneous ongoing spiking state, in all layers and zones of areas 17 and 18 indicating that the second threshold is a property of the network. Spontaneous and evoked spiking, thus can easily be distinguished. In addition, the trajectories of spontaneous ongoing states......Most neurons have a threshold separating the silent non-spiking state and the state of producing temporal sequences of spikes. But neurons in vivo also have a second threshold, found recently in granular layer neurons of the primary visual cortex, separating spontaneous ongoing spiking from...... visually evoked spiking driven by sharp transients. Here we examine whether this second threshold exists outside the granular layer and examine details of transitions between spiking states in ferrets exposed to moving objects. We found the second threshold, separating spiking states evoked by stationary...

Span: spike pattern association neuron for learning spatio-temporal spike patterns.

Science.gov (United States)

Mohemmed, Ammar; Schliebs, Stefan; Matsuda, Satoshi; Kasabov, Nikola

2012-08-01

Spiking Neural Networks (SNN) were shown to be suitable tools for the processing of spatio-temporal information. However, due to their inherent complexity, the formulation of efficient supervised learning algorithms for SNN is difficult and remains an important problem in the research area. This article presents SPAN - a spiking neuron that is able to learn associations of arbitrary spike trains in a supervised fashion allowing the processing of spatio-temporal information encoded in the precise timing of spikes. The idea of the proposed algorithm is to transform spike trains during the learning phase into analog signals so that common mathematical operations can be performed on them. Using this conversion, it is possible to apply the well-known Widrow-Hoff rule directly to the transformed spike trains in order to adjust the synaptic weights and to achieve a desired input/output spike behavior of the neuron. In the presented experimental analysis, the proposed learning algorithm is evaluated regarding its learning capabilities, its memory capacity, its robustness to noisy stimuli and its classification performance. Differences and similarities of SPAN regarding two related algorithms, ReSuMe and Chronotron, are discussed.

Deep Spiking Networks

NARCIS (Netherlands)

O'Connor, P.; Welling, M.

2016-01-01

We introduce an algorithm to do backpropagation on a spiking network. Our network is "spiking" in the sense that our neurons accumulate their activation into a potential over time, and only send out a signal (a "spike") when this potential crosses a threshold and the neuron is reset. Neurons only

What is a Sorting Function?

DEFF Research Database (Denmark)

Henglein, Fritz

2009-01-01

What is a sorting function—not a sorting function for a given ordering relation, but a sorting function with nothing given? Formulating four basic properties of sorting algorithms as defining requirements, we arrive at intrinsic notions of sorting and stable sorting: A function is a sorting...... are derivable without compromising data abstraction. Finally we point out that stable sorting functions as default representations of ordering relations have the advantage of permitting linear-time sorting algorithms; inequality tests forfeit this possibility....... function if and only it is an intrinsically parametric permutation function. It is a stable sorting function if and only if it is an intrinsically stable permutation function. We show that ordering relations can be represented isomorphically as inequality tests, comparators and stable sorting functions...

Cortical plasticity induced by spike-triggered microstimulation in primate somatosensory cortex.

Directory of Open Access Journals (Sweden)

Weiguo Song

Full Text Available Electrical stimulation of the nervous system for therapeutic purposes, such as deep brain stimulation in the treatment of Parkinson's disease, has been used for decades. Recently, increased attention has focused on using microstimulation to restore functions as diverse as somatosensation and memory. However, how microstimulation changes the neural substrate is still not fully understood. Microstimulation may cause cortical changes that could either compete with or complement natural neural processes, and could result in neuroplastic changes rendering the region dysfunctional or even epileptic. As part of our efforts to produce neuroprosthetic devices and to further study the effects of microstimulation on the cortex, we stimulated and recorded from microelectrode arrays in the hand area of the primary somatosensory cortex (area 1 in two awake macaque monkeys. We applied a simple neuroprosthetic microstimulation protocol to a pair of electrodes in the area 1 array, using either random pulses or pulses time-locked to the recorded spiking activity of a reference neuron. This setup was replicated using a computer model of the thalamocortical system, which consisted of 1980 spiking neurons distributed among six cortical layers and two thalamic nuclei. Experimentally, we found that spike-triggered microstimulation induced cortical plasticity, as shown by increased unit-pair mutual information, while random microstimulation did not. In addition, there was an increased response to touch following spike-triggered microstimulation, along with decreased neural variability. The computer model successfully reproduced both qualitative and quantitative aspects of the experimental findings. The physiological findings of this study suggest that even simple microstimulation protocols can be used to increase somatosensory information flow.

Decoding spikes in a spiking neuronal network

Energy Technology Data Exchange (ETDEWEB)

Feng Jianfeng [Department of Informatics, University of Sussex, Brighton BN1 9QH (United Kingdom); Ding, Mingzhou [Department of Mathematics, Florida Atlantic University, Boca Raton, FL 33431 (United States)

2004-06-04

We investigate how to reliably decode the input information from the output of a spiking neuronal network. A maximum likelihood estimator of the input signal, together with its Fisher information, is rigorously calculated. The advantage of the maximum likelihood estimation over the 'brute-force rate coding' estimate is clearly demonstrated. It is pointed out that the ergodic assumption in neuroscience, i.e. a temporal average is equivalent to an ensemble average, is in general not true. Averaging over an ensemble of neurons usually gives a biased estimate of the input information. A method on how to compensate for the bias is proposed. Reconstruction of dynamical input signals with a group of spiking neurons is extensively studied and our results show that less than a spike is sufficient to accurately decode dynamical inputs.

Decoding spikes in a spiking neuronal network

International Nuclear Information System (INIS)

Feng Jianfeng; Ding, Mingzhou

2004-01-01

We investigate how to reliably decode the input information from the output of a spiking neuronal network. A maximum likelihood estimator of the input signal, together with its Fisher information, is rigorously calculated. The advantage of the maximum likelihood estimation over the 'brute-force rate coding' estimate is clearly demonstrated. It is pointed out that the ergodic assumption in neuroscience, i.e. a temporal average is equivalent to an ensemble average, is in general not true. Averaging over an ensemble of neurons usually gives a biased estimate of the input information. A method on how to compensate for the bias is proposed. Reconstruction of dynamical input signals with a group of spiking neurons is extensively studied and our results show that less than a spike is sufficient to accurately decode dynamical inputs

The dynamic relationship between cerebellar Purkinje cell simple spikes and the spikelet number of complex spikes.

Science.gov (United States)

Burroughs, Amelia; Wise, Andrew K; Xiao, Jianqiang; Houghton, Conor; Tang, Tianyu; Suh, Colleen Y; Lang, Eric J; Apps, Richard; Cerminara, Nadia L

2017-01-01

Purkinje cells are the sole output of the cerebellar cortex and fire two distinct types of action potential: simple spikes and complex spikes. Previous studies have mainly considered complex spikes as unitary events, even though the waveform is composed of varying numbers of spikelets. The extent to which differences in spikelet number affect simple spike activity (and vice versa) remains unclear. We found that complex spikes with greater numbers of spikelets are preceded by higher simple spike firing rates but, following the complex spike, simple spikes are reduced in a manner that is graded with spikelet number. This dynamic interaction has important implications for cerebellar information processing, and suggests that complex spike spikelet number may maintain Purkinje cells within their operational range. Purkinje cells are central to cerebellar function because they form the sole output of the cerebellar cortex. They exhibit two distinct types of action potential: simple spikes and complex spikes. It is widely accepted that interaction between these two types of impulse is central to cerebellar cortical information processing. Previous investigations of the interactions between simple spikes and complex spikes have mainly considered complex spikes as unitary events. However, complex spikes are composed of an initial large spike followed by a number of secondary components, termed spikelets. The number of spikelets within individual complex spikes is highly variable and the extent to which differences in complex spike spikelet number affects simple spike activity (and vice versa) remains poorly understood. In anaesthetized adult rats, we have found that Purkinje cells recorded from the posterior lobe vermis and hemisphere have high simple spike firing frequencies that precede complex spikes with greater numbers of spikelets. This finding was also evident in a small sample of Purkinje cells recorded from the posterior lobe hemisphere in awake cats. In addition

The Second Spiking Threshold: Dynamics of Laminar Network Spiking in the Visual Cortex

Science.gov (United States)

Forsberg, Lars E.; Bonde, Lars H.; Harvey, Michael A.; Roland, Per E.

2016-01-01

Most neurons have a threshold separating the silent non-spiking state and the state of producing temporal sequences of spikes. But neurons in vivo also have a second threshold, found recently in granular layer neurons of the primary visual cortex, separating spontaneous ongoing spiking from visually evoked spiking driven by sharp transients. Here we examine whether this second threshold exists outside the granular layer and examine details of transitions between spiking states in ferrets exposed to moving objects. We found the second threshold, separating spiking states evoked by stationary and moving visual stimuli from the spontaneous ongoing spiking state, in all layers and zones of areas 17 and 18 indicating that the second threshold is a property of the network. Spontaneous and evoked spiking, thus can easily be distinguished. In addition, the trajectories of spontaneous ongoing states were slow, frequently changing direction. In single trials, sharp as well as smooth and slow transients transform the trajectories to be outward directed, fast and crossing the threshold to become evoked. Although the speeds of the evolution of the evoked states differ, the same domain of the state space is explored indicating uniformity of the evoked states. All evoked states return to the spontaneous evoked spiking state as in a typical mono-stable dynamical system. In single trials, neither the original spiking rates, nor the temporal evolution in state space could distinguish simple visual scenes. PMID:27582693

Sex-sorting sperm using flow cytometry/cell sorting.

Science.gov (United States)

Garner, Duane L; Evans, K Michael; Seidel, George E

2013-01-01

The sex of mammalian offspring can be predetermined by flow sorting relatively pure living populations of X- and Y-chromosome-bearing sperm. This method is based on precise staining of the DNA of sperm with the nucleic acid-specific fluorophore, Hoechst 33342, to differentiate between the subpopulations of X- and Y-sperm. The fluorescently stained sperm are then sex-sorted using a specialized high speed sorter, MoFlo(®) SX XDP, and collected into biologically supportive media prior to reconcentration and cryopreservation in numbers adequate for use with artificial insemination for some species or for in vitro fertilization. Sperm sorting can provide subpopulations of X- or Y-bearing bovine sperm at rates in the 8,000 sperm/s range while maintaining; a purity of 90% such that it has been applied to cattle on a commercial basis. The sex of offspring has been predetermined in a wide variety of mammalian species including cattle, swine, horses, sheep, goats, dogs, cats, deer, elk, dolphins, water buffalo as well as in humans using flow cytometric sorting of X- and Y-sperm.

Automatic EEG spike detection.

Science.gov (United States)

Harner, Richard

2009-10-01

Since the 1970s advances in science and technology during each succeeding decade have renewed the expectation of efficient, reliable automatic epileptiform spike detection (AESD). But even when reinforced with better, faster tools, clinically reliable unsupervised spike detection remains beyond our reach. Expert-selected spike parameters were the first and still most widely used for AESD. Thresholds for amplitude, duration, sharpness, rise-time, fall-time, after-coming slow waves, background frequency, and more have been used. It is still unclear which of these wave parameters are essential, beyond peak-peak amplitude and duration. Wavelet parameters are very appropriate to AESD but need to be combined with other parameters to achieve desired levels of spike detection efficiency. Artificial Neural Network (ANN) and expert-system methods may have reached peak efficiency. Support Vector Machine (SVM) technology focuses on outliers rather than centroids of spike and nonspike data clusters and should improve AESD efficiency. An exemplary spike/nonspike database is suggested as a tool for assessing parameters and methods for AESD and is available in CSV or Matlab formats from the author at brainvue@gmail.com. Exploratory Data Analysis (EDA) is presented as a graphic method for finding better spike parameters and for the step-wise evaluation of the spike detection process.

SpikeTemp: An Enhanced Rank-Order-Based Learning Approach for Spiking Neural Networks With Adaptive Structure.

Science.gov (United States)

Wang, Jinling; Belatreche, Ammar; Maguire, Liam P; McGinnity, Thomas Martin

2017-01-01

This paper presents an enhanced rank-order-based learning algorithm, called SpikeTemp, for spiking neural networks (SNNs) with a dynamically adaptive structure. The trained feed-forward SNN consists of two layers of spiking neurons: 1) an encoding layer which temporally encodes real-valued features into spatio-temporal spike patterns and 2) an output layer of dynamically grown neurons which perform spatio-temporal classification. Both Gaussian receptive fields and square cosine population encoding schemes are employed to encode real-valued features into spatio-temporal spike patterns. Unlike the rank-order-based learning approach, SpikeTemp uses the precise times of the incoming spikes for adjusting the synaptic weights such that early spikes result in a large weight change and late spikes lead to a smaller weight change. This removes the need to rank all the incoming spikes and, thus, reduces the computational cost of SpikeTemp. The proposed SpikeTemp algorithm is demonstrated on several benchmark data sets and on an image recognition task. The results show that SpikeTemp can achieve better classification performance and is much faster than the existing rank-order-based learning approach. In addition, the number of output neurons is much smaller when the square cosine encoding scheme is employed. Furthermore, SpikeTemp is benchmarked against a selection of existing machine learning algorithms, and the results demonstrate the ability of SpikeTemp to classify different data sets after just one presentation of the training samples with comparable classification performance.

Conservation of old renderings - the consolidation of rendering with loss of cohesion

Directory of Open Access Journals (Sweden)

Martha Tavares

2008-01-01

Full Text Available The study of external renderings in the scope of conservation and restoration has acquired in the last years great methodological, scientific and technical advances. These renderings are important elements of the built structure, for besides possessing a protection function, they possess often a decorative function of great relevance for the image of the monument. The maintenance of these renderings implies the conservation of traditional constructive techniques and the use of compatible materials, as similar to the originals as possible. The main objective of this study is to define a methodology of conservative restoration using strategies of maintenance of renderings and traditional constructive techniques. The minimum intervention principle is maintained as well as the use of materials compatible with the original ones. This paper describes the technique and products used for the consolidation of the loss of cohesion. The testing campaign was developed under controlled conditions, in laboratory, and in situ in order to evaluate their efficacy for the consolidation of old renders. A set of tests is presented to evaluate the effectiveness of the process. The results are analysed and a reflection is added referring to the applicability of these techniques. Finally the paper presents a proposal for further research.

Ready, steady, SORT!

CERN Document Server

Laëtitia Pedroso

2010-01-01

The selective or ecological sorting of waste is already second nature to many of us and concerns us all. As the GS Department's new awareness-raising campaign reminds us, everything we do to sort waste contributes to preserving the environment.    Placemats printed on recycled paper using vegetable-based ink will soon be distributed in Restaurant No.1.   Environmental protection is never far from the headlines, and CERN has a responsibility to ensure that the 3000 tonnes and more of waste it produces every year are correctly and selectively sorted. Materials can be given a second life through recycling and re-use, thereby avoiding pollution from landfill sites and incineration plants and saving on processing costs. The GS Department is launching a new poster campaign designed to raise awareness of the importance of waste sorting and recycling. "After conducting a survey to find out whether members of the personnel were prepared to make an effort to sort a...

Memory recall and spike-frequency adaptation

Science.gov (United States)

Roach, James P.; Sander, Leonard M.; Zochowski, Michal R.

2016-05-01

The brain can reproduce memories from partial data; this ability is critical for memory recall. The process of memory recall has been studied using autoassociative networks such as the Hopfield model. This kind of model reliably converges to stored patterns that contain the memory. However, it is unclear how the behavior is controlled by the brain so that after convergence to one configuration, it can proceed with recognition of another one. In the Hopfield model, this happens only through unrealistic changes of an effective global temperature that destabilizes all stored configurations. Here we show that spike-frequency adaptation (SFA), a common mechanism affecting neuron activation in the brain, can provide state-dependent control of pattern retrieval. We demonstrate this in a Hopfield network modified to include SFA, and also in a model network of biophysical neurons. In both cases, SFA allows for selective stabilization of attractors with different basins of attraction, and also for temporal dynamics of attractor switching that is not possible in standard autoassociative schemes. The dynamics of our models give a plausible account of different sorts of memory retrieval.

Reliability of MEG source imaging of anterior temporal spikes: analysis of an intracranially characterized spike focus.

Science.gov (United States)

Wennberg, Richard; Cheyne, Douglas

2014-05-01

To assess the reliability of MEG source imaging (MSI) of anterior temporal spikes through detailed analysis of the localization and orientation of source solutions obtained for a large number of spikes that were separately confirmed by intracranial EEG to be focally generated within a single, well-characterized spike focus. MSI was performed on 64 identical right anterior temporal spikes from an anterolateral temporal neocortical spike focus. The effects of different volume conductors (sphere and realistic head model), removal of noise with low frequency filters (LFFs) and averaging multiple spikes were assessed in terms of the reliability of the source solutions. MSI of single spikes resulted in scattered dipole source solutions that showed reasonable reliability for localization at the lobar level, but only for solutions with a goodness-of-fit exceeding 80% using a LFF of 3 Hz. Reliability at a finer level of intralobar localization was limited. Spike averaging significantly improved the reliability of source solutions and averaging 8 or more spikes reduced dependency on goodness-of-fit and data filtering. MSI performed on topographically identical individual spikes from an intracranially defined classical anterior temporal lobe spike focus was limited by low reliability (i.e., scattered source solutions) in terms of fine, sublobar localization within the ipsilateral temporal lobe. Spike averaging significantly improved reliability. MSI performed on individual anterior temporal spikes is limited by low reliability. Reduction of background noise through spike averaging significantly improves the reliability of MSI solutions. Copyright © 2013 International Federation of Clinical Neurophysiology. Published by Elsevier Ireland Ltd. All rights reserved.

Decoding spatiotemporal spike sequences via the finite state automata dynamics of spiking neural networks

International Nuclear Information System (INIS)

Jin, Dezhe Z

2008-01-01

Temporally complex stimuli are encoded into spatiotemporal spike sequences of neurons in many sensory areas. Here, we describe how downstream neurons with dendritic bistable plateau potentials can be connected to decode such spike sequences. Driven by feedforward inputs from the sensory neurons and controlled by feedforward inhibition and lateral excitation, the neurons transit between UP and DOWN states of the membrane potentials. The neurons spike only in the UP states. A decoding neuron spikes at the end of an input to signal the recognition of specific spike sequences. The transition dynamics is equivalent to that of a finite state automaton. A connection rule for the networks guarantees that any finite state automaton can be mapped into the transition dynamics, demonstrating the equivalence in computational power between the networks and finite state automata. The decoding mechanism is capable of recognizing an arbitrary number of spatiotemporal spike sequences, and is insensitive to the variations of the spike timings in the sequences

Application of cross-correlated delay shift rule in spiking neural networks for interictal spike detection.

Science.gov (United States)

Lilin Guo; Zhenzhong Wang; Cabrerizo, Mercedes; Adjouadi, Malek

2016-08-01

This study proposes a Cross-Correlated Delay Shift (CCDS) supervised learning rule to train neurons with associated spatiotemporal patterns to classify spike patterns. The objective of this study was to evaluate the feasibility of using the CCDS rule to automate the detection of interictal spikes in electroencephalogram (EEG) data on patients with epilepsy. Encoding is the initial yet essential step for spiking neurons to process EEG patterns. A new encoding method is utilized to convert the EEG signal into spike patterns. The simulation results show that the proposed algorithm identified 69 spikes out of 82 spikes, or 84% detection rate, which is quite high considering the subtleties of interictal spikes and the tediousness of monitoring long EEG records. This CCDS rule is also benchmarked by ReSuMe on the same task.

Sorting a distribution theory

CERN Document Server

Mahmoud, Hosam M

2011-01-01

A cutting-edge look at the emerging distributional theory of sorting Research on distributions associated with sorting algorithms has grown dramatically over the last few decades, spawning many exact and limiting distributions of complexity measures for many sorting algorithms. Yet much of this information has been scattered in disparate and highly specialized sources throughout the literature. In Sorting: A Distribution Theory, leading authority Hosam Mahmoud compiles, consolidates, and clarifies the large volume of available research, providing a much-needed, comprehensive treatment of the

Spike rate and spike timing contributions to coding taste quality information in rat periphery

Directory of Open Access Journals (Sweden)

Vernon eLawhern

2011-05-01

Full Text Available There is emerging evidence that individual sensory neurons in the rodent brain rely on temporal features of the discharge pattern to code differences in taste quality information. In contrast, in-vestigations of individual sensory neurons in the periphery have focused on analysis of spike rate and mostly disregarded spike timing as a taste quality coding mechanism. The purpose of this work was to determine the contribution of spike timing to taste quality coding by rat geniculate ganglion neurons using computational methods that have been applied successfully in other sys-tems. We recorded the discharge patterns of narrowly-tuned and broadly-tuned neurons in the rat geniculate ganglion to representatives of the five basic taste qualities. We used mutual in-formation to determine significant responses and the van Rossum metric to characterize their temporal features. While our findings show that spike timing contributes a significant part of the message, spike rate contributes the largest portion of the message relayed by afferent neurons from rat fungiform taste buds to the brain. Thus, spike rate and spike timing together are more effective than spike rate alone in coding stimulus quality information to a single basic taste in the periphery for both narrowly-tuned specialist and broadly-tuned generalist neurons.

Rendering of Gemstones

OpenAIRE

Krtek, Lukáš

2012-01-01

The distinctive appearance of gemstones is caused by the way light reflects and refracts multiple times inside of them. The goal of this thesis is to design and implement an application for photorealistic rendering of gems. The most important effects we aim for are realistic dispersion of light and refractive caustics. For rendering we use well-known algorithm of path tracing with an experimental modification for faster computation of caustic effects. In this thesis we also design and impleme...

Impact of spike train autostructure on probability distribution of joint spike events.

Science.gov (United States)

Pipa, Gordon; Grün, Sonja; van Vreeswijk, Carl

2013-05-01

The discussion whether temporally coordinated spiking activity really exists and whether it is relevant has been heated over the past few years. To investigate this issue, several approaches have been taken to determine whether synchronized events occur significantly above chance, that is, whether they occur more often than expected if the neurons fire independently. Most investigations ignore or destroy the autostructure of the spiking activity of individual cells or assume Poissonian spiking as a model. Such methods that ignore the autostructure can significantly bias the coincidence statistics. Here, we study the influence of the autostructure on the probability distribution of coincident spiking events between tuples of mutually independent non-Poisson renewal processes. In particular, we consider two types of renewal processes that were suggested as appropriate models of experimental spike trains: a gamma and a log-normal process. For a gamma process, we characterize the shape of the distribution analytically with the Fano factor (FFc). In addition, we perform Monte Carlo estimations to derive the full shape of the distribution and the probability for false positives if a different process type is assumed as was actually present. We also determine how manipulations of such spike trains, here dithering, used for the generation of surrogate data change the distribution of coincident events and influence the significance estimation. We find, first, that the width of the coincidence count distribution and its FFc depend critically and in a nontrivial way on the detailed properties of the structure of the spike trains as characterized by the coefficient of variation CV. Second, the dependence of the FFc on the CV is complex and mostly nonmonotonic. Third, spike dithering, even if as small as a fraction of the interspike interval, can falsify the inference on coordinated firing.

Nicotine-Mediated ADP to Spike Transition: Double Spiking in Septal Neurons.

Science.gov (United States)

Kodirov, Sodikdjon A; Wehrmeister, Michael; Colom, Luis

2016-04-01

The majority of neurons in lateral septum (LS) are electrically silent at resting membrane potential. Nicotine transiently excites a subset of neurons and occasionally leads to long lasting bursting activity upon longer applications. We have observed simultaneous changes in frequencies and amplitudes of spontaneous action potentials (AP) in the presence of nicotine. During the prolonged exposure, nicotine increased numbers of spikes within a burst. One of the hallmarks of nicotine effects was the occurrences of double spikes (known also as bursting). Alignment of 51 spontaneous spikes, triggered upon continuous application of nicotine, revealed that the slope of after-depolarizing potential gradually increased (1.4 vs. 3 mV/ms) and neuron fired the second AP, termed as double spiking. A transition from a single AP to double spikes increased the amplitude of after-hyperpolarizing potential. The amplitude of the second (premature) AP was smaller compared to the first one, and this correlation persisted in regard to their duration (half-width). A similar bursting activity in the presence of nicotine, to our knowledge, has not been reported previously in the septal structure in general and in LS in particular.

Transformative Rendering of Internet Resources

Science.gov (United States)

2012-10-01

using either the Firefox or Google Chrome rendering engine. The rendering server then captures a screen shot of the page and creates code that positions...be compromised at web pages the hackers had built for that hacking competition to exploit that particular OS /browser configuration. During...of risk with no benefit. They include: - The rendering server is hosted on a Linux-based operating system ( OS ). The OS is much more secure than the

Wage Sorting Trends

DEFF Research Database (Denmark)

Bagger, Jesper; Vejlin, Rune Majlund; Sørensen, Kenneth Lykke

Using a population-wide Danish Matched Employer-Employee panel from 1980-2006, we document a strong trend towards more positive assortative wage sorting. The correlation between worker and firm fixed effects estimated from a log wage regression increases from -0.07 in 1981 to .14 in 2001. The non......Using a population-wide Danish Matched Employer-Employee panel from 1980-2006, we document a strong trend towards more positive assortative wage sorting. The correlation between worker and firm fixed effects estimated from a log wage regression increases from -0.07 in 1981 to .14 in 2001....... The nonstationary wage sorting pattern is not due to compositional changes in the labor market, primarily occurs among high wage workers, and comprises 41 percent of the increase in the standard deviation of log real wages between 1980 and 2006. We show that the wage sorting trend is associated with worker...

Flow sorting in aquatic ecology

Directory of Open Access Journals (Sweden)

Marcus Reckermann

2000-06-01

Full Text Available Flow sorting can be a very helpful tool in revealing phytoplankton and bacterial community structure and elaborating specific physiological parameters of isolated species. Droplet sorting has been the most common technique. Despite the high optical and hydro-dynamic stress for the cells to be sorted, many species grow in culture subsequent to sorting. To date, flow sorting has been applied to post-incubation separation in natural water samples to account for group-specific physiological parameters (radiotracer-uptake rates, to the production of clonal or non-clonal cultures from mixtures, to the isolaton of cell groups from natural assemblages for molecular analyses, and for taxonomic identification of sorted cells by microscopy. The application of cell sorting from natural water samples from the Wadden Sea, including different cryptophytes, cyanobacteria and diatoms, is shown, as well as the establishment of laboratory cultures from field samples. The optional use of a red laser to account for phycocyanine-rich cells is also discussed.

Ore sorting

International Nuclear Information System (INIS)

Hawkins, A.P.; Richards, A.W.

1982-01-01

In an ore sorting apparatus, ore particles are bombarded with neutrons in a chamber and sorted by detecting radiation emitted by isotopes of elements, such as gold, forming or contained in the particles, using detectors and selectively controlling fluid jets. The isotopes can be selectively recognised by their radiation characteristics. In an alternative embodiment, shorter life isotopes are formed by neutron bombardment and detection of radiation takes place immediately adjacent the region of bombardment

External parallel sorting with multiprocessor computers

International Nuclear Information System (INIS)

Comanceau, S.I.

1984-01-01

This article describes methods of external sorting in which the entire main computer memory is used for the internal sorting of entries, forming out of them sorted segments of the greatest possible size, and outputting them to external memories. The obtained segments are merged into larger segments until all entries form one ordered segment. The described methods are suitable for sequential files stored on magnetic tape. The needs of the sorting algorithm can be met by using the relatively slow peripheral storage devices (e.g., tapes, disks, drums). The efficiency of the external sorting methods is determined by calculating the total sorting time as a function of the number of entries to be sorted and the number of parallel processors participating in the sorting process

Detection of bursts in neuronal spike trains by the mean inter-spike interval method

Institute of Scientific and Technical Information of China (English)

Lin Chen; Yong Deng; Weihua Luo; Zhen Wang; Shaoqun Zeng

2009-01-01

Bursts are electrical spikes firing with a high frequency, which are the most important property in synaptic plasticity and information processing in the central nervous system. However, bursts are difficult to identify because bursting activities or patterns vary with phys-iological conditions or external stimuli. In this paper, a simple method automatically to detect bursts in spike trains is described. This method auto-adaptively sets a parameter (mean inter-spike interval) according to intrinsic properties of the detected burst spike trains, without any arbitrary choices or any operator judgrnent. When the mean value of several successive inter-spike intervals is not larger than the parameter, a burst is identified. By this method, bursts can be automatically extracted from different bursting patterns of cultured neurons on multi-electrode arrays, as accurately as by visual inspection. Furthermore, significant changes of burst variables caused by electrical stimulus have been found in spontaneous activity of neuronal network. These suggest that the mean inter-spike interval method is robust for detecting changes in burst patterns and characteristics induced by environmental alterations.

Information transmission with spiking Bayesian neurons

International Nuclear Information System (INIS)

Lochmann, Timm; Deneve, Sophie

2008-01-01

Spike trains of cortical neurons resulting from repeatedpresentations of a stimulus are variable and exhibit Poisson-like statistics. Many models of neural coding therefore assumed that sensory information is contained in instantaneous firing rates, not spike times. Here, we ask how much information about time-varying stimuli can be transmitted by spiking neurons with such input and output variability. In particular, does this variability imply spike generation to be intrinsically stochastic? We consider a model neuron that estimates optimally the current state of a time-varying binary variable (e.g. presence of a stimulus) by integrating incoming spikes. The unit signals its current estimate to other units with spikes whenever the estimate increased by a fixed amount. As shown previously, this computation results in integrate and fire dynamics with Poisson-like output spike trains. This output variability is entirely due to the stochastic input rather than noisy spike generation. As a result such a deterministic neuron can transmit most of the information about the time varying stimulus. This contrasts with a standard model of sensory neurons, the linear-nonlinear Poisson (LNP) model which assumes that most variability in output spike trains is due to stochastic spike generation. Although it yields the same firing statistics, we found that such noisy firing results in the loss of most information. Finally, we use this framework to compare potential effects of top-down attention versus bottom-up saliency on information transfer with spiking neurons

Barbed micro-spikes for micro-scale biopsy

Science.gov (United States)

Byun, Sangwon; Lim, Jung-Min; Paik, Seung-Joon; Lee, Ahra; Koo, Kyo-in; Park, Sunkil; Park, Jaehong; Choi, Byoung-Doo; Seo, Jong Mo; Kim, Kyung-ah; Chung, Hum; Song, Si Young; Jeon, Doyoung; Cho, Dongil

2005-06-01

Single-crystal silicon planar micro-spikes with protruding barbs are developed for micro-scale biopsy and the feasibility of using the micro-spike as a micro-scale biopsy tool is evaluated for the first time. The fabrication process utilizes a deep silicon etch to define the micro-spike outline, resulting in protruding barbs of various shapes. Shanks of the fabricated micro-spikes are 3 mm long, 100 µm thick and 250 µm wide. Barbs protruding from micro-spike shanks facilitate the biopsy procedure by tearing off and retaining samples from target tissues. Micro-spikes with barbs successfully extracted tissue samples from the small intestines of the anesthetized pig, whereas micro-spikes without barbs failed to obtain a biopsy sample. Parylene coating can be applied to improve the biocompatibility of the micro-spike without deteriorating the biopsy function of the micro-spike. In addition, to show that the biopsy with the micro-spike can be applied to tissue analysis, samples obtained by micro-spikes were examined using immunofluorescent staining. Nuclei and F-actin of cells which are extracted by the micro-spike from a transwell were clearly visualized by immunofluorescent staining.

Distributed rendering for multiview parallax displays

Science.gov (United States)

Annen, T.; Matusik, W.; Pfister, H.; Seidel, H.-P.; Zwicker, M.

2006-02-01

3D display technology holds great promise for the future of television, virtual reality, entertainment, and visualization. Multiview parallax displays deliver stereoscopic views without glasses to arbitrary positions within the viewing zone. These systems must include a high-performance and scalable 3D rendering subsystem in order to generate multiple views at real-time frame rates. This paper describes a distributed rendering system for large-scale multiview parallax displays built with a network of PCs, commodity graphics accelerators, multiple projectors, and multiview screens. The main challenge is to render various perspective views of the scene and assign rendering tasks effectively. In this paper we investigate two different approaches: Optical multiplexing for lenticular screens and software multiplexing for parallax-barrier displays. We describe the construction of large-scale multi-projector 3D display systems using lenticular and parallax-barrier technology. We have developed different distributed rendering algorithms using the Chromium stream-processing framework and evaluate the trade-offs and performance bottlenecks. Our results show that Chromium is well suited for interactive rendering on multiview parallax displays.

Sketchy Rendering for Information Visualization

NARCIS (Netherlands)

Wood, Jo; Isenberg, Petra; Isenberg, Tobias; Dykes, Jason; Boukhelifa, Nadia; Slingsby, Aidan

2012-01-01

We present and evaluate a framework for constructing sketchy style information visualizations that mimic data graphics drawn by hand. We provide an alternative renderer for the Processing graphics environment that redefines core drawing primitives including line, polygon and ellipse rendering. These

Simple sorting algorithm test based on CUDA

OpenAIRE

Meng, Hongyu; Guo, Fangjin

2015-01-01

With the development of computing technology, CUDA has become a very important tool. In computer programming, sorting algorithm is widely used. There are many simple sorting algorithms such as enumeration sort, bubble sort and merge sort. In this paper, we test some simple sorting algorithm based on CUDA and draw some useful conclusions.

Bayesian population decoding of spiking neurons.

Science.gov (United States)

Gerwinn, Sebastian; Macke, Jakob; Bethge, Matthias

2009-01-01

The timing of action potentials in spiking neurons depends on the temporal dynamics of their inputs and contains information about temporal fluctuations in the stimulus. Leaky integrate-and-fire neurons constitute a popular class of encoding models, in which spike times depend directly on the temporal structure of the inputs. However, optimal decoding rules for these models have only been studied explicitly in the noiseless case. Here, we study decoding rules for probabilistic inference of a continuous stimulus from the spike times of a population of leaky integrate-and-fire neurons with threshold noise. We derive three algorithms for approximating the posterior distribution over stimuli as a function of the observed spike trains. In addition to a reconstruction of the stimulus we thus obtain an estimate of the uncertainty as well. Furthermore, we derive a 'spike-by-spike' online decoding scheme that recursively updates the posterior with the arrival of each new spike. We use these decoding rules to reconstruct time-varying stimuli represented by a Gaussian process from spike trains of single neurons as well as neural populations.

Bayesian population decoding of spiking neurons

Directory of Open Access Journals (Sweden)

Sebastian Gerwinn

2009-10-01

Full Text Available The timing of action potentials in spiking neurons depends on the temporal dynamics of their inputs and contains information about temporal fluctuations in the stimulus. Leaky integrate-and-fire neurons constitute a popular class of encoding models, in which spike times depend directly on the temporal structure of the inputs. However, optimal decoding rules for these models have only been studied explicitly in the noiseless case. Here, we study decoding rules for probabilistic inference of a continuous stimulus from the spike times of a population of leaky integrate-and-fire neurons with threshold noise. We derive three algorithms for approximating the posterior distribution over stimuli as a function of the observed spike trains. In addition to a reconstruction of the stimulus we thus obtain an estimate of the uncertainty as well. Furthermore, we derive a `spike-by-spike' online decoding scheme that recursively updates the posterior with the arrival of each new spike. We use these decoding rules to reconstruct time-varying stimuli represented by a Gaussian process from spike trains of single neurons as well as neural populations.

Optimized distributed systems achieve significant performance improvement on sorted merging of massive VCF files.

Science.gov (United States)

Sun, Xiaobo; Gao, Jingjing; Jin, Peng; Eng, Celeste; Burchard, Esteban G; Beaty, Terri H; Ruczinski, Ingo; Mathias, Rasika A; Barnes, Kathleen; Wang, Fusheng; Qin, Zhaohui S

2018-06-01

Sorted merging of genomic data is a common data operation necessary in many sequencing-based studies. It involves sorting and merging genomic data from different subjects by their genomic locations. In particular, merging a large number of variant call format (VCF) files is frequently required in large-scale whole-genome sequencing or whole-exome sequencing projects. Traditional single-machine based methods become increasingly inefficient when processing large numbers of files due to the excessive computation time and Input/Output bottleneck. Distributed systems and more recent cloud-based systems offer an attractive solution. However, carefully designed and optimized workflow patterns and execution plans (schemas) are required to take full advantage of the increased computing power while overcoming bottlenecks to achieve high performance. In this study, we custom-design optimized schemas for three Apache big data platforms, Hadoop (MapReduce), HBase, and Spark, to perform sorted merging of a large number of VCF files. These schemas all adopt the divide-and-conquer strategy to split the merging job into sequential phases/stages consisting of subtasks that are conquered in an ordered, parallel, and bottleneck-free way. In two illustrating examples, we test the performance of our schemas on merging multiple VCF files into either a single TPED or a single VCF file, which are benchmarked with the traditional single/parallel multiway-merge methods, message passing interface (MPI)-based high-performance computing (HPC) implementation, and the popular VCFTools. Our experiments suggest all three schemas either deliver a significant improvement in efficiency or render much better strong and weak scalabilities over traditional methods. Our findings provide generalized scalable schemas for performing sorted merging on genetics and genomics data using these Apache distributed systems.

Heterogeneity of Purkinje cell simple spike-complex spike interactions: zebrin- and non-zebrin-related variations.

Science.gov (United States)

Tang, Tianyu; Xiao, Jianqiang; Suh, Colleen Y; Burroughs, Amelia; Cerminara, Nadia L; Jia, Linjia; Marshall, Sarah P; Wise, Andrew K; Apps, Richard; Sugihara, Izumi; Lang, Eric J

2017-08-01

Cerebellar Purkinje cells (PCs) generate two types of action potentials, simple and complex spikes. Although they are generated by distinct mechanisms, interactions between the two spike types exist. Zebrin staining produces alternating positive and negative stripes of PCs across most of the cerebellar cortex. Thus, here we compared simple spike-complex spike interactions both within and across zebrin populations. Simple spike activity undergoes a complex modulation preceding and following a complex spike. The amplitudes of the pre- and post-complex spike modulation phases were correlated across PCs. On average, the modulation was larger for PCs in zebrin positive regions. Correlations between aspects of the complex spike waveform and simple spike activity were found, some of which varied between zebrin positive and negative PCs. The implications of the results are discussed with regard to hypotheses that complex spikes are triggered by rises in simple spike activity for either motor learning or homeostatic functions. Purkinje cells (PCs) generate two types of action potentials, called simple and complex spikes (SSs and CSs). We first investigated the CS-associated modulation of SS activity and its relationship to the zebrin status of the PC. The modulation pattern consisted of a pre-CS rise in SS activity, and then, following the CS, a pause, a rebound, and finally a late inhibition of SS activity for both zebrin positive (Z+) and negative (Z-) cells, though the amplitudes of the phases were larger in Z+ cells. Moreover, the amplitudes of the pre-CS rise with the late inhibitory phase of the modulation were correlated across PCs. In contrast, correlations between modulation phases across CSs of individual PCs were generally weak. Next, the relationship between CS spikelets and SS activity was investigated. The number of spikelets/CS correlated with the average SS firing rate only for Z+ cells. In contrast, correlations across CSs between spikelet numbers and the

Layers in sorting practices: Sorting out patients with potential cancer

DEFF Research Database (Denmark)

Møller, Naja Holten; Bjørn, Pernille

2011-01-01

for a particular patient. Due to the limited resources within the Danish healthcare system, initiating cancer pathways for all patients with a remote suspicion of cancer would crash the system, as it would be impossible for healthcare professionals to commit to the prescribed schedules and times defined...... they show that sorting patients before initiating a standardized cancer pathway is not a simple process of deciding on a predefined category that will stipulate particular dates and times. Instead, these informal sorting mechanisms show that the process of sorting patients prior to diagnosis......In the last couple of years, widespread use of standardized cancer pathways has been seen across a range of countries, including Denmark, to improve prognosis of cancer patients. In Denmark, standardized cancer pathways take the form of guidelines prescribing well-defined sequences where steps...

Improved SpikeProp for Using Particle Swarm Optimization

Directory of Open Access Journals (Sweden)

Falah Y. H. Ahmed

2013-01-01

Full Text Available A spiking neurons network encodes information in the timing of individual spike times. A novel supervised learning rule for SpikeProp is derived to overcome the discontinuities introduced by the spiking thresholding. This algorithm is based on an error-backpropagation learning rule suited for supervised learning of spiking neurons that use exact spike time coding. The SpikeProp is able to demonstrate the spiking neurons that can perform complex nonlinear classification in fast temporal coding. This study proposes enhancements of SpikeProp learning algorithm for supervised training of spiking networks which can deal with complex patterns. The proposed methods include the SpikeProp particle swarm optimization (PSO and angle driven dependency learning rate. These methods are presented to SpikeProp network for multilayer learning enhancement and weights optimization. Input and output patterns are encoded as spike trains of precisely timed spikes, and the network learns to transform the input trains into target output trains. With these enhancements, our proposed methods outperformed other conventional neural network architectures.

Effects of bursting dynamic features on the generation of multi-clustered structure of neural network with symmetric spike-timing-dependent plasticity learning rule

International Nuclear Information System (INIS)

Liu, Hui; Song, Yongduan; Xue, Fangzheng; Li, Xiumin

2015-01-01

In this paper, the generation of multi-clustered structure of self-organized neural network with different neuronal firing patterns, i.e., bursting or spiking, has been investigated. The initially all-to-all-connected spiking neural network or bursting neural network can be self-organized into clustered structure through the symmetric spike-timing-dependent plasticity learning for both bursting and spiking neurons. However, the time consumption of this clustering procedure of the burst-based self-organized neural network (BSON) is much shorter than the spike-based self-organized neural network (SSON). Our results show that the BSON network has more obvious small-world properties, i.e., higher clustering coefficient and smaller shortest path length than the SSON network. Also, the results of larger structure entropy and activity entropy of the BSON network demonstrate that this network has higher topological complexity and dynamical diversity, which benefits for enhancing information transmission of neural circuits. Hence, we conclude that the burst firing can significantly enhance the efficiency of clustering procedure and the emergent clustered structure renders the whole network more synchronous and therefore more sensitive to weak input. This result is further confirmed from its improved performance on stochastic resonance. Therefore, we believe that the multi-clustered neural network which self-organized from the bursting dynamics has high efficiency in information processing

Effects of bursting dynamic features on the generation of multi-clustered structure of neural network with symmetric spike-timing-dependent plasticity learning rule

Energy Technology Data Exchange (ETDEWEB)

Liu, Hui; Song, Yongduan; Xue, Fangzheng; Li, Xiumin, E-mail: xmli@cqu.edu.cn [Key Laboratory of Dependable Service Computing in Cyber Physical Society of Ministry of Education, Chongqing University, Chongqing 400044 (China); College of Automation, Chongqing University, Chongqing 400044 (China)

2015-11-15

In this paper, the generation of multi-clustered structure of self-organized neural network with different neuronal firing patterns, i.e., bursting or spiking, has been investigated. The initially all-to-all-connected spiking neural network or bursting neural network can be self-organized into clustered structure through the symmetric spike-timing-dependent plasticity learning for both bursting and spiking neurons. However, the time consumption of this clustering procedure of the burst-based self-organized neural network (BSON) is much shorter than the spike-based self-organized neural network (SSON). Our results show that the BSON network has more obvious small-world properties, i.e., higher clustering coefficient and smaller shortest path length than the SSON network. Also, the results of larger structure entropy and activity entropy of the BSON network demonstrate that this network has higher topological complexity and dynamical diversity, which benefits for enhancing information transmission of neural circuits. Hence, we conclude that the burst firing can significantly enhance the efficiency of clustering procedure and the emergent clustered structure renders the whole network more synchronous and therefore more sensitive to weak input. This result is further confirmed from its improved performance on stochastic resonance. Therefore, we believe that the multi-clustered neural network which self-organized from the bursting dynamics has high efficiency in information processing.

Real-time photorealistic stereoscopic rendering of fire

Science.gov (United States)

Rose, Benjamin M.; McAllister, David F.

2007-02-01

We propose a method for real-time photorealistic stereo rendering of the natural phenomenon of fire. Applications include the use of virtual reality in fire fighting, military training, and entertainment. Rendering fire in real-time presents a challenge because of the transparency and non-static fluid-like behavior of fire. It is well known that, in general, methods that are effective for monoscopic rendering are not necessarily easily extended to stereo rendering because monoscopic methods often do not provide the depth information necessary to produce the parallax required for binocular disparity in stereoscopic rendering. We investigate the existing techniques used for monoscopic rendering of fire and discuss their suitability for extension to real-time stereo rendering. Methods include the use of precomputed textures, dynamic generation of textures, and rendering models resulting from the approximation of solutions of fluid dynamics equations through the use of ray-tracing algorithms. We have found that in order to attain real-time frame rates, our method based on billboarding is effective. Slicing is used to simulate depth. Texture mapping or 2D images are mapped onto polygons and alpha blending is used to treat transparency. We can use video recordings or prerendered high-quality images of fire as textures to attain photorealistic stereo.

Chip-based droplet sorting

Energy Technology Data Exchange (ETDEWEB)

Beer, Neil Reginald; Lee, Abraham; Hatch, Andrew

2017-11-21

A non-contact system for sorting monodisperse water-in-oil emulsion droplets in a microfluidic device based on the droplet's contents and their interaction with an applied electromagnetic field or by identification and sorting.

Precise-spike-driven synaptic plasticity: learning hetero-association of spatiotemporal spike patterns.

Directory of Open Access Journals (Sweden)

Qiang Yu

Full Text Available A new learning rule (Precise-Spike-Driven (PSD Synaptic Plasticity is proposed for processing and memorizing spatiotemporal patterns. PSD is a supervised learning rule that is analytically derived from the traditional Widrow-Hoff rule and can be used to train neurons to associate an input spatiotemporal spike pattern with a desired spike train. Synaptic adaptation is driven by the error between the desired and the actual output spikes, with positive errors causing long-term potentiation and negative errors causing long-term depression. The amount of modification is proportional to an eligibility trace that is triggered by afferent spikes. The PSD rule is both computationally efficient and biologically plausible. The properties of this learning rule are investigated extensively through experimental simulations, including its learning performance, its generality to different neuron models, its robustness against noisy conditions, its memory capacity, and the effects of its learning parameters. Experimental results show that the PSD rule is capable of spatiotemporal pattern classification, and can even outperform a well studied benchmark algorithm with the proposed relative confidence criterion. The PSD rule is further validated on a practical example of an optical character recognition problem. The results again show that it can achieve a good recognition performance with a proper encoding. Finally, a detailed discussion is provided about the PSD rule and several related algorithms including tempotron, SPAN, Chronotron and ReSuMe.

Precise-spike-driven synaptic plasticity: learning hetero-association of spatiotemporal spike patterns.

Science.gov (United States)

Yu, Qiang; Tang, Huajin; Tan, Kay Chen; Li, Haizhou

2013-01-01

A new learning rule (Precise-Spike-Driven (PSD) Synaptic Plasticity) is proposed for processing and memorizing spatiotemporal patterns. PSD is a supervised learning rule that is analytically derived from the traditional Widrow-Hoff rule and can be used to train neurons to associate an input spatiotemporal spike pattern with a desired spike train. Synaptic adaptation is driven by the error between the desired and the actual output spikes, with positive errors causing long-term potentiation and negative errors causing long-term depression. The amount of modification is proportional to an eligibility trace that is triggered by afferent spikes. The PSD rule is both computationally efficient and biologically plausible. The properties of this learning rule are investigated extensively through experimental simulations, including its learning performance, its generality to different neuron models, its robustness against noisy conditions, its memory capacity, and the effects of its learning parameters. Experimental results show that the PSD rule is capable of spatiotemporal pattern classification, and can even outperform a well studied benchmark algorithm with the proposed relative confidence criterion. The PSD rule is further validated on a practical example of an optical character recognition problem. The results again show that it can achieve a good recognition performance with a proper encoding. Finally, a detailed discussion is provided about the PSD rule and several related algorithms including tempotron, SPAN, Chronotron and ReSuMe.

Algorithm Sorts Groups Of Data

Science.gov (United States)

Evans, J. D.

1987-01-01

For efficient sorting, algorithm finds set containing minimum or maximum most significant data. Sets of data sorted as desired. Sorting process simplified by reduction of each multielement set of data to single representative number. First, each set of data expressed as polynomial with suitably chosen base, using elements of set as coefficients. Most significant element placed in term containing largest exponent. Base selected by examining range in value of data elements. Resulting series summed to yield single representative number. Numbers easily sorted, and each such number converted back to original set of data by successive division. Program written in BASIC.

Effects of Spike Anticipation on the Spiking Dynamics of Neural Networks

Directory of Open Access Journals (Sweden)

Daniel ede Santos-Sierra

2015-11-01

Full Text Available Synchronization is one of the central phenomena involved in information processing in living systems. It is known that the nervous system requires the coordinated activity of both local and distant neural populations. Such an interplay allows to merge different information modalities in a whole processing supporting high-level mental skills as understanding, memory, abstraction, etc. Though the biological processes underlying synchronization in the brain are not fully understood there have been reported a variety of mechanisms supporting different types of synchronization both at theoretical and experimental level. One of the more intriguing of these phenomena is the anticipating synchronization, which has been recently reported in a pair of unidirectionally coupled artificial neurons under simple conditions cite{Pyragas}, where the slave neuron is able to anticipate in time the behaviour of the master one. In this paper we explore the effect of spike anticipation over the information processing performed by a neural network at functional and structural level. We show that the introduction of intermediary neurons in the network enhances spike anticipation and analyse how these variations in spike anticipation can significantly change the firing regime of the neural network according to its functional and structural properties. In addition we show that the interspike interval (ISI, one of the main features of the neural response associated to the information coding, can be closely related to spike anticipation by each spike, and how synaptic plasticity can be modulated through that relationship. This study has been performed through numerical simulation of a coupled system of Hindmarsh-Rose neurons.

Effects of Spike Anticipation on the Spiking Dynamics of Neural Networks.

Science.gov (United States)

de Santos-Sierra, Daniel; Sanchez-Jimenez, Abel; Garcia-Vellisca, Mariano A; Navas, Adrian; Villacorta-Atienza, Jose A

2015-01-01

Synchronization is one of the central phenomena involved in information processing in living systems. It is known that the nervous system requires the coordinated activity of both local and distant neural populations. Such an interplay allows to merge different information modalities in a whole processing supporting high-level mental skills as understanding, memory, abstraction, etc. Though, the biological processes underlying synchronization in the brain are not fully understood there have been reported a variety of mechanisms supporting different types of synchronization both at theoretical and experimental level. One of the more intriguing of these phenomena is the anticipating synchronization, which has been recently reported in a pair of unidirectionally coupled artificial neurons under simple conditions (Pyragiene and Pyragas, 2013), where the slave neuron is able to anticipate in time the behavior of the master one. In this paper, we explore the effect of spike anticipation over the information processing performed by a neural network at functional and structural level. We show that the introduction of intermediary neurons in the network enhances spike anticipation and analyse how these variations in spike anticipation can significantly change the firing regime of the neural network according to its functional and structural properties. In addition we show that the interspike interval (ISI), one of the main features of the neural response associated with the information coding, can be closely related to spike anticipation by each spike, and how synaptic plasticity can be modulated through that relationship. This study has been performed through numerical simulation of a coupled system of Hindmarsh-Rose neurons.

Transform coding for hardware-accelerated volume rendering.

Science.gov (United States)

Fout, Nathaniel; Ma, Kwan-Liu

2007-01-01

Hardware-accelerated volume rendering using the GPU is now the standard approach for real-time volume rendering, although limited graphics memory can present a problem when rendering large volume data sets. Volumetric compression in which the decompression is coupled to rendering has been shown to be an effective solution to this problem; however, most existing techniques were developed in the context of software volume rendering, and all but the simplest approaches are prohibitive in a real-time hardware-accelerated volume rendering context. In this paper we present a novel block-based transform coding scheme designed specifically with real-time volume rendering in mind, such that the decompression is fast without sacrificing compression quality. This is made possible by consolidating the inverse transform with dequantization in such a way as to allow most of the reprojection to be precomputed. Furthermore, we take advantage of the freedom afforded by off-line compression in order to optimize the encoding as much as possible while hiding this complexity from the decoder. In this context we develop a new block classification scheme which allows us to preserve perceptually important features in the compression. The result of this work is an asymmetric transform coding scheme that allows very large volumes to be compressed and then decompressed in real-time while rendering on the GPU.

Coronavirus spike-receptor interactions

NARCIS (Netherlands)

Mou, H.

2015-01-01

Coronaviruses cause important diseases in humans and animals. Coronavirus infection starts with the virus binding with its spike proteins to molecules present on the surface of host cells that act as receptors. This spike-receptor interaction is highly specific and determines the virus’ cell, tissue

Spike-based population coding and working memory.

Directory of Open Access Journals (Sweden)

Martin Boerlin

2011-02-01

Full Text Available Compelling behavioral evidence suggests that humans can make optimal decisions despite the uncertainty inherent in perceptual or motor tasks. A key question in neuroscience is how populations of spiking neurons can implement such probabilistic computations. In this article, we develop a comprehensive framework for optimal, spike-based sensory integration and working memory in a dynamic environment. We propose that probability distributions are inferred spike-per-spike in recurrently connected networks of integrate-and-fire neurons. As a result, these networks can combine sensory cues optimally, track the state of a time-varying stimulus and memorize accumulated evidence over periods much longer than the time constant of single neurons. Importantly, we propose that population responses and persistent working memory states represent entire probability distributions and not only single stimulus values. These memories are reflected by sustained, asynchronous patterns of activity which make relevant information available to downstream neurons within their short time window of integration. Model neurons act as predictive encoders, only firing spikes which account for new information that has not yet been signaled. Thus, spike times signal deterministically a prediction error, contrary to rate codes in which spike times are considered to be random samples of an underlying firing rate. As a consequence of this coding scheme, a multitude of spike patterns can reliably encode the same information. This results in weakly correlated, Poisson-like spike trains that are sensitive to initial conditions but robust to even high levels of external neural noise. This spike train variability reproduces the one observed in cortical sensory spike trains, but cannot be equated to noise. On the contrary, it is a consequence of optimal spike-based inference. In contrast, we show that rate-based models perform poorly when implemented with stochastically spiking neurons.

Visually Evoked Spiking Evolves While Spontaneous Ongoing Dynamics Persist

Science.gov (United States)

Huys, Raoul; Jirsa, Viktor K.; Darokhan, Ziauddin; Valentiniene, Sonata; Roland, Per E.

2016-01-01

Neurons in the primary visual cortex spontaneously spike even when there are no visual stimuli. It is unknown whether the spiking evoked by visual stimuli is just a modification of the spontaneous ongoing cortical spiking dynamics or whether the spontaneous spiking state disappears and is replaced by evoked spiking. This study of laminar recordings of spontaneous spiking and visually evoked spiking of neurons in the ferret primary visual cortex shows that the spiking dynamics does not change: the spontaneous spiking as well as evoked spiking is controlled by a stable and persisting fixed point attractor. Its existence guarantees that evoked spiking return to the spontaneous state. However, the spontaneous ongoing spiking state and the visual evoked spiking states are qualitatively different and are separated by a threshold (separatrix). The functional advantage of this organization is that it avoids the need for a system reorganization following visual stimulation, and impedes the transition of spontaneous spiking to evoked spiking and the propagation of spontaneous spiking from layer 4 to layers 2–3. PMID:26778982

ScanSort{sup SM} at Whiteshell Laboratories for sorting of experimental cesium pond soil

Energy Technology Data Exchange (ETDEWEB)

Downey, H., E-mail: heath.downey@amecfw.com [Amec Foster Wheeler, Portland, ME (United States)

2015-07-01

The ScanSort{sup SM} soil sorting system is a unique and efficient radiological instrument used for measuring and sorting bulk soils and volumetric materials. The system performs automatic radioassay and segregation of preconditioned material using a gamma spectroscopy system mounted above a conveyor belt. It was deployed to the Whiteshell Laboratories site to process the excavated soils generated during the decommissioning of the former Experimental Cesium Pond. The ScanSort{sup SM} system was utilized to segregate material with Cs-137 concentrations above the established site unrestricted release and restricted site reuse levels as well as demonstrated the ability to accurately determine the radioactivity concentrations of the radiologically-impacted material and to confidently segregate volumes of that material for appropriate final disposition. (author)

PhySortR: a fast, flexible tool for sorting phylogenetic trees in R.

Science.gov (United States)

Stephens, Timothy G; Bhattacharya, Debashish; Ragan, Mark A; Chan, Cheong Xin

2016-01-01

A frequent bottleneck in interpreting phylogenomic output is the need to screen often thousands of trees for features of interest, particularly robust clades of specific taxa, as evidence of monophyletic relationship and/or reticulated evolution. Here we present PhySortR, a fast, flexible R package for classifying phylogenetic trees. Unlike existing utilities, PhySortR allows for identification of both exclusive and non-exclusive clades uniting the target taxa based on tip labels (i.e., leaves) on a tree, with customisable options to assess clades within the context of the whole tree. Using simulated and empirical datasets, we demonstrate the potential and scalability of PhySortR in analysis of thousands of phylogenetic trees without a priori assumption of tree-rooting, and in yielding readily interpretable trees that unambiguously satisfy the query. PhySortR is a command-line tool that is freely available and easily automatable.

Sorting out Downside Beta

NARCIS (Netherlands)

G.T. Post (Thierry); P. van Vliet (Pim); S.D. Lansdorp (Simon)

2009-01-01

textabstractDownside risk, when properly defined and estimated, helps to explain the cross-section of US stock returns. Sorting stocks by a proper estimate of downside market beta leads to a substantially larger cross-sectional spread in average returns than sorting on regular market beta. This

Spike voltage topography in temporal lobe epilepsy.

Science.gov (United States)

Asadi-Pooya, Ali A; Asadollahi, Marjan; Shimamoto, Shoichi; Lorenzo, Matthew; Sperling, Michael R

2016-07-15

We investigated the voltage topography of interictal spikes in patients with temporal lobe epilepsy (TLE) to see whether topography was related to etiology for TLE. Adults with TLE, who had epilepsy surgery for drug-resistant seizures from 2011 until 2014 at Jefferson Comprehensive Epilepsy Center were selected. Two groups of patients were studied: patients with mesial temporal sclerosis (MTS) on MRI and those with other MRI findings. The voltage topography maps of the interictal spikes at the peak were created using BESA software. We classified the interictal spikes as polar, basal, lateral, or others. Thirty-four patients were studied, from which the characteristics of 340 spikes were investigated. The most common type of spike orientation was others (186 spikes; 54.7%), followed by lateral (146; 42.9%), polar (5; 1.5%), and basal (3; 0.9%). Characteristics of the voltage topography maps of the spikes between the two groups of patients were somewhat different. Five spikes in patients with MTS had polar orientation, but none of the spikes in patients with other MRI findings had polar orientation (odds ratio=6.98, 95% confidence interval=0.38 to 127.38; p=0.07). Scalp topographic mapping of interictal spikes has the potential to offer different information than visual inspection alone. The present results do not allow an immediate clinical application of our findings; however, detecting a polar spike in a patient with TLE may increase the possibility of mesial temporal sclerosis as the underlying etiology. Copyright © 2016 Elsevier B.V. All rights reserved.

Three Sorts of Naturalism

DEFF Research Database (Denmark)

Fink, Hans

2006-01-01

In "Two sorts of Naturalism" John McDowell is sketching his own sort of naturalism in ethics as an alternative to "bald naturalism". In this paper I distinguish materialist, idealist and absolute conceptions of nature and of naturalism in order to provide a framework for a clearer understanding...

Multineuronal Spike Sequences Repeat with Millisecond Precision

Directory of Open Access Journals (Sweden)

Koki eMatsumoto

2013-06-01

Full Text Available Cortical microcircuits are nonrandomly wired by neurons. As a natural consequence, spikes emitted by microcircuits are also nonrandomly patterned in time and space. One of the prominent spike organizations is a repetition of fixed patterns of spike series across multiple neurons. However, several questions remain unsolved, including how precisely spike sequences repeat, how the sequences are spatially organized, how many neurons participate in sequences, and how different sequences are functionally linked. To address these questions, we monitored spontaneous spikes of hippocampal CA3 neurons ex vivo using a high-speed functional multineuron calcium imaging technique that allowed us to monitor spikes with millisecond resolution and to record the location of spiking and nonspiking neurons. Multineuronal spike sequences were overrepresented in spontaneous activity compared to the statistical chance level. Approximately 75% of neurons participated in at least one sequence during our observation period. The participants were sparsely dispersed and did not show specific spatial organization. The number of sequences relative to the chance level decreased when larger time frames were used to detect sequences. Thus, sequences were precise at the millisecond level. Sequences often shared common spikes with other sequences; parts of sequences were subsequently relayed by following sequences, generating complex chains of multiple sequences.

Enhancement of Selection, Bubble and Insertion Sorting Algorithm

OpenAIRE

Muhammad Farooq Umar; Ehsan Ullah Munir; Shafqat Ali Shad; Muhammad Wasif Nisar

2014-01-01

In everyday life there is a large amount of data to arrange because sorting removes any ambiguities and make the data analysis and data processing very easy, efficient and provides with cost less effort. In this study a set of improved sorting algorithms are proposed which gives better performance and design idea. In this study five new sorting algorithms (Bi-directional Selection Sort, Bi-directional bubble sort, MIDBiDirectional Selection Sort, MIDBidirectional bubble sort and linear insert...

Spiking Neural P Systems with Communication on Request.

Science.gov (United States)

Pan, Linqiang; Păun, Gheorghe; Zhang, Gexiang; Neri, Ferrante

2017-12-01

Spiking Neural [Formula: see text] Systems are Neural System models characterized by the fact that each neuron mimics a biological cell and the communication between neurons is based on spikes. In the Spiking Neural [Formula: see text] systems investigated so far, the application of evolution rules depends on the contents of a neuron (checked by means of a regular expression). In these [Formula: see text] systems, a specified number of spikes are consumed and a specified number of spikes are produced, and then sent to each of the neurons linked by a synapse to the evolving neuron. [Formula: see text]In the present work, a novel communication strategy among neurons of Spiking Neural [Formula: see text] Systems is proposed. In the resulting models, called Spiking Neural [Formula: see text] Systems with Communication on Request, the spikes are requested from neighboring neurons, depending on the contents of the neuron (still checked by means of a regular expression). Unlike the traditional Spiking Neural [Formula: see text] systems, no spikes are consumed or created: the spikes are only moved along synapses and replicated (when two or more neurons request the contents of the same neuron). [Formula: see text]The Spiking Neural [Formula: see text] Systems with Communication on Request are proved to be computationally universal, that is, equivalent with Turing machines as long as two types of spikes are used. Following this work, further research questions are listed to be open problems.

Self-control with spiking and non-spiking neural networks playing games.

Science.gov (United States)

Christodoulou, Chris; Banfield, Gaye; Cleanthous, Aristodemos

2010-01-01

Self-control can be defined as choosing a large delayed reward over a small immediate reward, while precommitment is the making of a choice with the specific aim of denying oneself future choices. Humans recognise that they have self-control problems and attempt to overcome them by applying precommitment. Problems in exercising self-control, suggest a conflict between cognition and motivation, which has been linked to competition between higher and lower brain functions (representing the frontal lobes and the limbic system respectively). This premise of an internal process conflict, lead to a behavioural model being proposed, based on which, we implemented a computational model for studying and explaining self-control through precommitment behaviour. Our model consists of two neural networks, initially non-spiking and then spiking ones, representing the higher and lower brain systems viewed as cooperating for the benefit of the organism. The non-spiking neural networks are of simple feed forward multilayer type with reinforcement learning, one with selective bootstrap weight update rule, which is seen as myopic, representing the lower brain and the other with the temporal difference weight update rule, which is seen as far-sighted, representing the higher brain. The spiking neural networks are implemented with leaky integrate-and-fire neurons with learning based on stochastic synaptic transmission. The differentiating element between the two brain centres in this implementation is based on the memory of past actions determined by an eligibility trace time constant. As the structure of the self-control problem can be likened to the Iterated Prisoner's Dilemma (IPD) game in that cooperation is to defection what self-control is to impulsiveness or what compromising is to insisting, we implemented the neural networks as two players, learning simultaneously but independently, competing in the IPD game. With a technique resembling the precommitment effect, whereby the

Memristors Empower Spiking Neurons With Stochasticity

KAUST Repository

Al-Shedivat, Maruan

2015-06-01

Recent theoretical studies have shown that probabilistic spiking can be interpreted as learning and inference in cortical microcircuits. This interpretation creates new opportunities for building neuromorphic systems driven by probabilistic learning algorithms. However, such systems must have two crucial features: 1) the neurons should follow a specific behavioral model, and 2) stochastic spiking should be implemented efficiently for it to be scalable. This paper proposes a memristor-based stochastically spiking neuron that fulfills these requirements. First, the analytical model of the memristor is enhanced so it can capture the behavioral stochasticity consistent with experimentally observed phenomena. The switching behavior of the memristor model is demonstrated to be akin to the firing of the stochastic spike response neuron model, the primary building block for probabilistic algorithms in spiking neural networks. Furthermore, the paper proposes a neural soma circuit that utilizes the intrinsic nondeterminism of memristive switching for efficient spike generation. The simulations and analysis of the behavior of a single stochastic neuron and a winner-take-all network built of such neurons and trained on handwritten digits confirm that the circuit can be used for building probabilistic sampling and pattern adaptation machinery in spiking networks. The findings constitute an important step towards scalable and efficient probabilistic neuromorphic platforms. © 2011 IEEE.

Sorting waves and associated eigenvalues

Science.gov (United States)

Carbonari, Costanza; Colombini, Marco; Solari, Luca

2017-04-01

The presence of mixed sediment always characterizes gravel bed rivers. Sorting processes take place during bed load transport of heterogeneous sediment mixtures. The two main elements necessary to the occurrence of sorting are the heterogeneous character of sediments and the presence of an active sediment transport. When these two key ingredients are simultaneously present, the segregation of bed material is consistently detected both in the field [7] and in laboratory [3] observations. In heterogeneous sediment transport, bed altimetric variations and sorting always coexist and both mechanisms are independently capable of driving the formation of morphological patterns. Indeed, consistent patterns of longitudinal and transverse sorting are identified almost ubiquitously. In some cases, such as bar formation [2] and channel bends [5], sorting acts as a stabilizing effect and therefore the dominant mechanism driving pattern formation is associated with bed altimetric variations. In other cases, such as longitudinal streaks, sorting enhances system instability and can therefore be considered the prevailing mechanism. Bedload sheets, first observed by Khunle and Southard [1], represent another classic example of a morphological pattern essentially triggered by sorting, as theoretical [4] and experimental [3] results suggested. These sorting waves cause strong spatial and temporal fluctuations of bedload transport rate typical observed in gravel bed rivers. The problem of bed load transport of a sediment mixture is formulated in the framework of a 1D linear stability analysis. The base state consists of a uniform flow in an infinitely wide channel with active bed load transport. The behaviour of the eigenvalues associated with fluid motion, bed evolution and sorting processes in the space of the significant flow and sediment parameters is analysed. A comparison is attempted with the results of the theoretical analysis of Seminara Colombini and Parker [4] and Stecca

Non-orthogonally transitive G2 spike solution

International Nuclear Information System (INIS)

Lim, Woei Chet

2015-01-01

We generalize the orthogonally transitive (OT) G 2 spike solution to the non-OT G 2 case. This is achieved by applying Geroch’s transformation on a Kasner seed. The new solution contains two more parameters than the OT G 2 spike solution. Unlike the OT G 2 spike solution, the new solution always resolves its spike. (fast track communication)

Wavelet analysis of epileptic spikes

Science.gov (United States)

Latka, Miroslaw; Was, Ziemowit; Kozik, Andrzej; West, Bruce J.

2003-05-01

Interictal spikes and sharp waves in human EEG are characteristic signatures of epilepsy. These potentials originate as a result of synchronous pathological discharge of many neurons. The reliable detection of such potentials has been the long standing problem in EEG analysis, especially after long-term monitoring became common in investigation of epileptic patients. The traditional definition of a spike is based on its amplitude, duration, sharpness, and emergence from its background. However, spike detection systems built solely around this definition are not reliable due to the presence of numerous transients and artifacts. We use wavelet transform to analyze the properties of EEG manifestations of epilepsy. We demonstrate that the behavior of wavelet transform of epileptic spikes across scales can constitute the foundation of a relatively simple yet effective detection algorithm.

Wavelet analysis of epileptic spikes

CERN Document Server

Latka, M; Kozik, A; West, B J; Latka, Miroslaw; Was, Ziemowit; Kozik, Andrzej; West, Bruce J.

2003-01-01

Interictal spikes and sharp waves in human EEG are characteristic signatures of epilepsy. These potentials originate as a result of synchronous, pathological discharge of many neurons. The reliable detection of such potentials has been the long standing problem in EEG analysis, especially after long-term monitoring became common in investigation of epileptic patients. The traditional definition of a spike is based on its amplitude, duration, sharpness, and emergence from its background. However, spike detection systems built solely around this definition are not reliable due to the presence of numerous transients and artifacts. We use wavelet transform to analyze the properties of EEG manifestations of epilepsy. We demonstrate that the behavior of wavelet transform of epileptic spikes across scales can constitute the foundation of a relatively simple yet effective detection algorithm.

CellSort: a support vector machine tool for optimizing fluorescence-activated cell sorting and reducing experimental effort.

Science.gov (United States)

Yu, Jessica S; Pertusi, Dante A; Adeniran, Adebola V; Tyo, Keith E J

2017-03-15

High throughput screening by fluorescence activated cell sorting (FACS) is a common task in protein engineering and directed evolution. It can also be a rate-limiting step if high false positive or negative rates necessitate multiple rounds of enrichment. Current FACS software requires the user to define sorting gates by intuition and is practically limited to two dimensions. In cases when multiple rounds of enrichment are required, the software cannot forecast the enrichment effort required. We have developed CellSort, a support vector machine (SVM) algorithm that identifies optimal sorting gates based on machine learning using positive and negative control populations. CellSort can take advantage of more than two dimensions to enhance the ability to distinguish between populations. We also present a Bayesian approach to predict the number of sorting rounds required to enrich a population from a given library size. This Bayesian approach allowed us to determine strategies for biasing the sorting gates in order to reduce the required number of enrichment rounds. This algorithm should be generally useful for improve sorting outcomes and reducing effort when using FACS. Source code available at http://tyolab.northwestern.edu/tools/ . k-tyo@northwestern.edu. Supplementary data are available at Bioinformatics online. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com

RenderGAN: Generating Realistic Labeled Data

Directory of Open Access Journals (Sweden)

Leon Sixt

2018-06-01

Full Text Available Deep Convolutional Neuronal Networks (DCNNs are showing remarkable performance on many computer vision tasks. Due to their large parameter space, they require many labeled samples when trained in a supervised setting. The costs of annotating data manually can render the use of DCNNs infeasible. We present a novel framework called RenderGAN that can generate large amounts of realistic, labeled images by combining a 3D model and the Generative Adversarial Network framework. In our approach, image augmentations (e.g., lighting, background, and detail are learned from unlabeled data such that the generated images are strikingly realistic while preserving the labels known from the 3D model. We apply the RenderGAN framework to generate images of barcode-like markers that are attached to honeybees. Training a DCNN on data generated by the RenderGAN yields considerably better performance than training it on various baselines.

Physically based rendering from theory to implementation

CERN Document Server

Pharr, Matt

2010-01-01

"Physically Based Rendering, 2nd Edition" describes both the mathematical theory behind a modern photorealistic rendering system as well as its practical implementation. A method - known as 'literate programming'- combines human-readable documentation and source code into a single reference that is specifically designed to aid comprehension. The result is a stunning achievement in graphics education. Through the ideas and software in this book, you will learn to design and employ a full-featured rendering system for creating stunning imagery. This book features new sections on subsurface scattering, Metropolis light transport, precomputed light transport, multispectral rendering, and much more. It includes a companion site complete with source code for the rendering system described in the book, with support for Windows, OS X, and Linux. Code and text are tightly woven together through a unique indexing feature that lists each function, variable, and method on the page that they are first described.

Surface acoustic wave actuated cell sorting (SAWACS).

Science.gov (United States)

Franke, T; Braunmüller, S; Schmid, L; Wixforth, A; Weitz, D A

2010-03-21

We describe a novel microfluidic cell sorter which operates in continuous flow at high sorting rates. The device is based on a surface acoustic wave cell-sorting scheme and combines many advantages of fluorescence activated cell sorting (FACS) and fluorescence activated droplet sorting (FADS) in microfluidic channels. It is fully integrated on a PDMS device, and allows fast electronic control of cell diversion. We direct cells by acoustic streaming excited by a surface acoustic wave which deflects the fluid independently of the contrast in material properties of deflected objects and the continuous phase; thus the device underlying principle works without additional enhancement of the sorting by prior labelling of the cells with responsive markers such as magnetic or polarizable beads. Single cells are sorted directly from bulk media at rates as fast as several kHz without prior encapsulation into liquid droplet compartments as in traditional FACS. We have successfully directed HaCaT cells (human keratinocytes), fibroblasts from mice and MV3 melanoma cells. The low shear forces of this sorting method ensure that cells survive after sorting.

Motor control by precisely timed spike patterns

DEFF Research Database (Denmark)

Srivastava, Kyle H; Holmes, Caroline M; Vellema, Michiel

2017-01-01

whether the information in spike timing actually plays a role in brain function. By examining the activity of individual motor units (the muscle fibers innervated by a single motor neuron) and manipulating patterns of activation of these neurons, we provide both correlative and causal evidence......A fundamental problem in neuroscience is understanding how sequences of action potentials ("spikes") encode information about sensory signals and motor outputs. Although traditional theories assume that this information is conveyed by the total number of spikes fired within a specified time...... interval (spike rate), recent studies have shown that additional information is carried by the millisecond-scale timing patterns of action potentials (spike timing). However, it is unknown whether or how subtle differences in spike timing drive differences in perception or behavior, leaving it unclear...

Cache-Aware and Cache-Oblivious Adaptive Sorting

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Fagerberg, Rolf; Moruz, Gabriel

2005-01-01

Two new adaptive sorting algorithms are introduced which perform an optimal number of comparisons with respect to the number of inversions in the input. The first algorithm is based on a new linear time reduction to (non-adaptive) sorting. The second algorithm is based on a new division protocol...... for the GenericSort algorithm by Estivill-Castro and Wood. From both algorithms we derive I/O-optimal cache-aware and cache-oblivious adaptive sorting algorithms. These are the first I/O-optimal adaptive sorting algorithms....

Data Sorting Using Graphics Processing Units

Directory of Open Access Journals (Sweden)

M. J. Mišić

2012-06-01

Full Text Available Graphics processing units (GPUs have been increasingly used for general-purpose computation in recent years. The GPU accelerated applications are found in both scientific and commercial domains. Sorting is considered as one of the very important operations in many applications, so its efficient implementation is essential for the overall application performance. This paper represents an effort to analyze and evaluate the implementations of the representative sorting algorithms on the graphics processing units. Three sorting algorithms (Quicksort, Merge sort, and Radix sort were evaluated on the Compute Unified Device Architecture (CUDA platform that is used to execute applications on NVIDIA graphics processing units. Algorithms were tested and evaluated using an automated test environment with input datasets of different characteristics. Finally, the results of this analysis are briefly discussed.

Big Five Measurement via Q-Sort

Directory of Open Access Journals (Sweden)

Chris D. Fluckinger

2014-08-01

Full Text Available Socially desirable responding presents a difficult challenge in measuring personality. I tested whether a partially ipsative measure—a normatively scored Q-sort containing traditional Big Five items—would produce personality scores indicative of less socially desirable responding compared with Likert-based measures. Across both instructions to respond honestly and in the context of applying for a job, the Q-sort produced lower mean scores, lower intercorrelations between dimensions, and similar validity in predicting supervisor performance ratings to Likert. In addition, the Q-sort produced a more orthogonal structure (but not fully orthogonal when modeled at the latent level. These results indicate that the Q-sort method did constrain socially desirable responding. Researchers and practitioners should consider Big Five measurement via Q-sort for contexts in which high socially desirable responding is expected.

Magnet sorting algorithms

International Nuclear Information System (INIS)

Dinev, D.

1996-01-01

Several new algorithms for sorting of dipole and/or quadrupole magnets in synchrotrons and storage rings are described. The algorithms make use of a combinatorial approach to the problem and belong to the class of random search algorithms. They use an appropriate metrization of the state space. The phase-space distortion (smear) is used as a goal function. Computational experiments for the case of the JINR-Dubna superconducting heavy ion synchrotron NUCLOTRON have shown a significant reduction of the phase-space distortion after the magnet sorting. (orig.)

Generalized activity equations for spiking neural network dynamics

Directory of Open Access Journals (Sweden)

Michael A Buice

2013-11-01

Full Text Available Much progress has been made in uncovering the computational capabilities of spiking neural networks. However, spiking neurons will always be more expensive to simulate compared to rate neurons because of the inherent disparity in time scales - the spike duration time is much shorter than the inter-spike time, which is much shorter than any learning time scale. In numerical analysis, this is a classic stiff problem. Spiking neurons are also much more difficult to study analytically. One possible approach to making spiking networks more tractable is to augment mean field activity models with some information about spiking correlations. For example, such a generalized activity model could carry information about spiking rates and correlations between spikes self-consistently. Here, we will show how this can be accomplished by constructing a complete formal probabilistic description of the network and then expanding around a small parameter such as the inverse of the number of neurons in the network. The mean field theory of the system gives a rate-like description. The first order terms in the perturbation expansion keep track of covariances.

Online sorting of recovered wood waste by automated XRF-technology: part II. Sorting efficiencies.

Science.gov (United States)

Hasan, A Rasem; Solo-Gabriele, Helena; Townsend, Timothy

2011-04-01

Sorting of waste wood is an important process practiced at recycling facilities in order to detect and divert contaminants from recycled wood products. Contaminants of concern include arsenic, chromium and copper found in chemically preserved wood. The objective of this research was to evaluate the sorting efficiencies of both treated and untreated parts of the wood waste stream, and metal (As, Cr and Cu) mass recoveries by the use of automated X-ray fluorescence (XRF) systems. A full-scale system was used for experimentation. This unit consisted of an XRF-detection chamber mounted on the top of a conveyor and a pneumatic slide-way diverter which sorted wood into presumed treated and presumed untreated piles. A randomized block design was used to evaluate the operational conveyance parameters of the system, including wood feed rate and conveyor belt speed. Results indicated that online sorting efficiencies of waste wood by XRF technology were high based on number and weight of pieces (70-87% and 75-92% for treated wood and 66-97% and 68-96% for untreated wood, respectively). These sorting efficiencies achieved mass recovery for metals of 81-99% for As, 75-95% for Cu and 82-99% of Cr. The incorrect sorting of wood was attributed almost equally to deficiencies in the detection and conveyance/diversion systems. Even with its deficiencies, the system was capable of producing a recyclable portion that met residential soil quality levels established for Florida, for an infeed that contained 5% of treated wood. Copyright © 2010 Elsevier Ltd. All rights reserved.

Pengembangan Algoritma Pengurutan SMS (Scan, Move, And Sort)

OpenAIRE

Lubis, Denni Aprilsyah

2015-01-01

Sorting has been a profound area for the algorithmic researchers. And many resources are invested to suggest a more working sorting algorithm. For this purpose many existing sorting algorithms were observed in terms of the efficiency of the algorithmic complexity. Efficient sorting is important to optimize the use of other algorithms that require sorted lists to work correctly. sorting has been considered as a fundamental problem in the study of algorithms that due to many reas...

Advanced Material Rendering in Blender

Czech Academy of Sciences Publication Activity Database

Hatka, Martin; Haindl, Michal

2012-01-01

Roč. 11, č. 2 (2012), s. 15-23 ISSN 1081-1451 R&D Projects: GA ČR GAP103/11/0335; GA ČR GA102/08/0593 Grant - others:CESNET(CZ) 387/2010; CESNET(CZ) 409/2011 Institutional support: RVO:67985556 Keywords : realistic material rendering * bidirectional texture function * Blender Subject RIV: BD - Theory of Information http://library.utia.cas.cz/separaty/2013/RO/haindl-advanced material rendering in blender.pdf

Word Sorts for General Music Classes

Science.gov (United States)

Cardany, Audrey Berger

2015-01-01

Word sorts are standard practice for aiding children in acquiring skills in English language arts. When included in the general music classroom, word sorts may aid students in acquiring a working knowledge of music vocabulary. The author shares a word sort activity drawn from vocabulary in John Lithgow's children's book "Never Play…

A Sequence of Sorting Strategies.

Science.gov (United States)

Duncan, David R.; Litwiller, Bonnie H.

1984-01-01

Describes eight increasingly sophisticated and efficient sorting algorithms including linear insertion, binary insertion, shellsort, bubble exchange, shakersort, quick sort, straight selection, and tree selection. Provides challenges for the reader and the student to program these efficiently. (JM)

Realistic Real-Time Outdoor Rendering in Augmented Reality

Science.gov (United States)

Kolivand, Hoshang; Sunar, Mohd Shahrizal

2014-01-01

Realistic rendering techniques of outdoor Augmented Reality (AR) has been an attractive topic since the last two decades considering the sizeable amount of publications in computer graphics. Realistic virtual objects in outdoor rendering AR systems require sophisticated effects such as: shadows, daylight and interactions between sky colours and virtual as well as real objects. A few realistic rendering techniques have been designed to overcome this obstacle, most of which are related to non real-time rendering. However, the problem still remains, especially in outdoor rendering. This paper proposed a much newer, unique technique to achieve realistic real-time outdoor rendering, while taking into account the interaction between sky colours and objects in AR systems with respect to shadows in any specific location, date and time. This approach involves three main phases, which cover different outdoor AR rendering requirements. Firstly, sky colour was generated with respect to the position of the sun. Second step involves the shadow generation algorithm, Z-Partitioning: Gaussian and Fog Shadow Maps (Z-GaF Shadow Maps). Lastly, a technique to integrate sky colours and shadows through its effects on virtual objects in the AR system, is introduced. The experimental results reveal that the proposed technique has significantly improved the realism of real-time outdoor AR rendering, thus solving the problem of realistic AR systems. PMID:25268480

Realistic real-time outdoor rendering in augmented reality.

Directory of Open Access Journals (Sweden)

Hoshang Kolivand

Full Text Available Realistic rendering techniques of outdoor Augmented Reality (AR has been an attractive topic since the last two decades considering the sizeable amount of publications in computer graphics. Realistic virtual objects in outdoor rendering AR systems require sophisticated effects such as: shadows, daylight and interactions between sky colours and virtual as well as real objects. A few realistic rendering techniques have been designed to overcome this obstacle, most of which are related to non real-time rendering. However, the problem still remains, especially in outdoor rendering. This paper proposed a much newer, unique technique to achieve realistic real-time outdoor rendering, while taking into account the interaction between sky colours and objects in AR systems with respect to shadows in any specific location, date and time. This approach involves three main phases, which cover different outdoor AR rendering requirements. Firstly, sky colour was generated with respect to the position of the sun. Second step involves the shadow generation algorithm, Z-Partitioning: Gaussian and Fog Shadow Maps (Z-GaF Shadow Maps. Lastly, a technique to integrate sky colours and shadows through its effects on virtual objects in the AR system, is introduced. The experimental results reveal that the proposed technique has significantly improved the realism of real-time outdoor AR rendering, thus solving the problem of realistic AR systems.

RenderSelect: a Cloud Broker Framework for Cloud Renderfarm Services

OpenAIRE

Ruby, Annette J; Aisha, Banu W; Subash, Chandran P

2016-01-01

In the 3D studios the animation scene files undergo a process called as rendering, where the 3D wire frame models are converted into 3D photorealistic images. As the rendering process is both a computationally intensive and a time consuming task, the cloud services based rendering in cloud render farms is gaining popularity among the animators. Though cloud render farms offer many benefits, the animators hesitate to move from their traditional offline rendering to cloud services based render ...

Epileptiform spike detection via convolutional neural networks

DEFF Research Database (Denmark)

Johansen, Alexander Rosenberg; Jin, Jing; Maszczyk, Tomasz

2016-01-01

The EEG of epileptic patients often contains sharp waveforms called "spikes", occurring between seizures. Detecting such spikes is crucial for diagnosing epilepsy. In this paper, we develop a convolutional neural network (CNN) for detecting spikes in EEG of epileptic patients in an automated...

Fixing the Sorting Algorithm for Android, Java and Python

NARCIS (Netherlands)

C.P.T. de Gouw (Stijn); F.S. de Boer (Frank)

2015-01-01

htmlabstractTim Peters developed the Timsort hybrid sorting algorithm in 2002. TimSort was first developed for Python, a popular programming language, but later ported to Java (where it appears as java.util.Collections.sort and java.util.Arrays.sort). TimSort is today used as the default sorting

IMPLEMENTATION OF SERIAL AND PARALLEL BUBBLE SORT ON FPGA

Directory of Open Access Journals (Sweden)

Dwi Marhaendro Jati Purnomo

2016-06-01

Full Text Available Sorting is common process in computational world. Its utilization are on many fields from research to industry. There are many sorting algorithm in nowadays. One of the simplest yet powerful is bubble sort. In this study, bubble sort is implemented on FPGA. The implementation was taken on serial and parallel approach. Serial and parallel bubble sort then compared by means of its memory, execution time, and utility which comprises slices and LUTs. The experiments show that serial bubble sort required smaller memory as well as utility compared to parallel bubble sort. Meanwhile, parallel bubble sort performed faster than serial bubble sort

Statistical properties of superimposed stationary spike trains.

Science.gov (United States)

Deger, Moritz; Helias, Moritz; Boucsein, Clemens; Rotter, Stefan

2012-06-01

The Poisson process is an often employed model for the activity of neuronal populations. It is known, though, that superpositions of realistic, non- Poisson spike trains are not in general Poisson processes, not even for large numbers of superimposed processes. Here we construct superimposed spike trains from intracellular in vivo recordings from rat neocortex neurons and compare their statistics to specific point process models. The constructed superimposed spike trains reveal strong deviations from the Poisson model. We find that superpositions of model spike trains that take the effective refractoriness of the neurons into account yield a much better description. A minimal model of this kind is the Poisson process with dead-time (PPD). For this process, and for superpositions thereof, we obtain analytical expressions for some second-order statistical quantities-like the count variability, inter-spike interval (ISI) variability and ISI correlations-and demonstrate the match with the in vivo data. We conclude that effective refractoriness is the key property that shapes the statistical properties of the superposition spike trains. We present new, efficient algorithms to generate superpositions of PPDs and of gamma processes that can be used to provide more realistic background input in simulations of networks of spiking neurons. Using these generators, we show in simulations that neurons which receive superimposed spike trains as input are highly sensitive for the statistical effects induced by neuronal refractoriness.

Image Based Rendering and Virtual Reality

DEFF Research Database (Denmark)

Livatino, Salvatore

The Presentation concerns with an overview of Image Based Rendering approaches and their use on Virtual Reality, including Virtual Photography and Cinematography, and Mobile Robot Navigation.......The Presentation concerns with an overview of Image Based Rendering approaches and their use on Virtual Reality, including Virtual Photography and Cinematography, and Mobile Robot Navigation....

Neural network based pattern matching and spike detection tools and services--in the CARMEN neuroinformatics project.

Science.gov (United States)

Fletcher, Martyn; Liang, Bojian; Smith, Leslie; Knowles, Alastair; Jackson, Tom; Jessop, Mark; Austin, Jim

2008-10-01

In the study of information flow in the nervous system, component processes can be investigated using a range of electrophysiological and imaging techniques. Although data is difficult and expensive to produce, it is rarely shared and collaboratively exploited. The Code Analysis, Repository and Modelling for e-Neuroscience (CARMEN) project addresses this challenge through the provision of a virtual neuroscience laboratory: an infrastructure for sharing data, tools and services. Central to the CARMEN concept are federated CARMEN nodes, which provide: data and metadata storage, new, thirdparty and legacy services, and tools. In this paper, we describe the CARMEN project as well as the node infrastructure and an associated thick client tool for pattern visualisation and searching, the Signal Data Explorer (SDE). We also discuss new spike detection methods, which are central to the services provided by CARMEN. The SDE is a client application which can be used to explore data in the CARMEN repository, providing data visualization, signal processing and a pattern matching capability. It performs extremely fast pattern matching and can be used to search for complex conditions composed of many different patterns across the large datasets that are typical in neuroinformatics. Searches can also be constrained by specifying text based metadata filters. Spike detection services which use wavelet and morphology techniques are discussed, and have been shown to outperform traditional thresholding and template based systems. A number of different spike detection and sorting techniques will be deployed as services within the CARMEN infrastructure, to allow users to benchmark their performance against a wide range of reference datasets.

Learning Universal Computations with Spikes

Science.gov (United States)

Thalmeier, Dominik; Uhlmann, Marvin; Kappen, Hilbert J.; Memmesheimer, Raoul-Martin

2016-01-01

Providing the neurobiological basis of information processing in higher animals, spiking neural networks must be able to learn a variety of complicated computations, including the generation of appropriate, possibly delayed reactions to inputs and the self-sustained generation of complex activity patterns, e.g. for locomotion. Many such computations require previous building of intrinsic world models. Here we show how spiking neural networks may solve these different tasks. Firstly, we derive constraints under which classes of spiking neural networks lend themselves to substrates of powerful general purpose computing. The networks contain dendritic or synaptic nonlinearities and have a constrained connectivity. We then combine such networks with learning rules for outputs or recurrent connections. We show that this allows to learn even difficult benchmark tasks such as the self-sustained generation of desired low-dimensional chaotic dynamics or memory-dependent computations. Furthermore, we show how spiking networks can build models of external world systems and use the acquired knowledge to control them. PMID:27309381

Spiking Neurons for Analysis of Patterns

Science.gov (United States)

Huntsberger, Terrance

2008-01-01

Artificial neural networks comprising spiking neurons of a novel type have been conceived as improved pattern-analysis and pattern-recognition computational systems. These neurons are represented by a mathematical model denoted the state-variable model (SVM), which among other things, exploits a computational parallelism inherent in spiking-neuron geometry. Networks of SVM neurons offer advantages of speed and computational efficiency, relative to traditional artificial neural networks. The SVM also overcomes some of the limitations of prior spiking-neuron models. There are numerous potential pattern-recognition, tracking, and data-reduction (data preprocessing) applications for these SVM neural networks on Earth and in exploration of remote planets. Spiking neurons imitate biological neurons more closely than do the neurons of traditional artificial neural networks. A spiking neuron includes a central cell body (soma) surrounded by a tree-like interconnection network (dendrites). Spiking neurons are so named because they generate trains of output pulses (spikes) in response to inputs received from sensors or from other neurons. They gain their speed advantage over traditional neural networks by using the timing of individual spikes for computation, whereas traditional artificial neurons use averages of activity levels over time. Moreover, spiking neurons use the delays inherent in dendritic processing in order to efficiently encode the information content of incoming signals. Because traditional artificial neurons fail to capture this encoding, they have less processing capability, and so it is necessary to use more gates when implementing traditional artificial neurons in electronic circuitry. Such higher-order functions as dynamic tasking are effected by use of pools (collections) of spiking neurons interconnected by spike-transmitting fibers. The SVM includes adaptive thresholds and submodels of transport of ions (in imitation of such transport in biological

Earth mortars and earth-lime renders

Directory of Open Access Journals (Sweden)

Maria Fernandes

2008-01-01

Full Text Available Earth surface coatings play a decorative architectural role, apart from their function as wall protection. In Portuguese vernacular architecture, earth mortars were usually applied on stone masonry, while earth renders and plasters were used on indoors surface coatings. Limestone exists only in certain areas of the country and consequently lime was not easily available everywhere, especially on granite and schist regions where stone masonry was a current building technique. In the central west coast of Portugal, the lime slaking procedure entailed slaking the quicklime mixed with earth (sandy soil, in a pit; the resulting mixture would then be combined in a mortar or plaster. This was also the procedure for manufactured adobes stabilized with lime. Adobe buildings with earth-lime renderings and plasters were also traditional in the same region, using lime putty and lime wash for final coat and decoration. Classic decoration on earth architecture from the 18th-19th century was in many countries a consequence of the François Cointeraux (1740-1830 manuals - Les Cahiers d'Architecture Rurale" (1793 - a French guide for earth architecture and building construction. This manual arrived to Portugal in the beginning of XIX century, but was never translated to Portuguese. References about decoration for earth houses were explained on this manual, as well as procedures about earth-lime renders and ornamentation of earth walls; in fact, these procedures are exactly the same as the ones used in adobe buildings in this Portuguese region. The specific purpose of the present paper is to show some cases of earth mortars, renders and plasters on stone buildings in Portugal and to explain the methods of producing earth-lime renders, and also to show some examples of rendering and coating with earth-lime in Portuguese adobe vernacular architecture.

Stress-Induced Impairment of a Working Memory Task: Role of Spiking Rate and Spiking History Predicted Discharge

Science.gov (United States)

Devilbiss, David M.; Jenison, Rick L.; Berridge, Craig W.

2012-01-01

Stress, pervasive in society, contributes to over half of all work place accidents a year and over time can contribute to a variety of psychiatric disorders including depression, schizophrenia, and post-traumatic stress disorder. Stress impairs higher cognitive processes, dependent on the prefrontal cortex (PFC) and that involve maintenance and integration of information over extended periods, including working memory and attention. Substantial evidence has demonstrated a relationship between patterns of PFC neuron spiking activity (action-potential discharge) and components of delayed-response tasks used to probe PFC-dependent cognitive function in rats and monkeys. During delay periods of these tasks, persistent spiking activity is posited to be essential for the maintenance of information for working memory and attention. However, the degree to which stress-induced impairment in PFC-dependent cognition involves changes in task-related spiking rates or the ability for PFC neurons to retain information over time remains unknown. In the current study, spiking activity was recorded from the medial PFC of rats performing a delayed-response task of working memory during acute noise stress (93 db). Spike history-predicted discharge (SHPD) for PFC neurons was quantified as a measure of the degree to which ongoing neuronal discharge can be predicted by past spiking activity and reflects the degree to which past information is retained by these neurons over time. We found that PFC neuron discharge is predicted by their past spiking patterns for nearly one second. Acute stress impaired SHPD, selectively during delay intervals of the task, and simultaneously impaired task performance. Despite the reduction in delay-related SHPD, stress increased delay-related spiking rates. These findings suggest that neural codes utilizing SHPD within PFC networks likely reflects an additional important neurophysiological mechanism for maintenance of past information over time. Stress

Spikes and matter inhomogeneities in massless scalar field models

International Nuclear Information System (INIS)

Coley, A A; Lim, W C

2016-01-01

We shall discuss the general relativistic generation of spikes in a massless scalar field or stiff perfect fluid model. We first investigate orthogonally transitive (OT) G 2 stiff fluid spike models both heuristically and numerically, and give a new exact OT G 2 stiff fluid spike solution. We then present a new two-parameter family of non-OT G 2 stiff fluid spike solutions, obtained by the generalization of non-OT G 2 vacuum spike solutions to the stiff fluid case by applying Geroch’s transformation on a Jacobs seed. The dynamics of these new stiff fluid spike solutions is qualitatively different from that of the vacuum spike solutions in that the matter (stiff fluid) feels the spike directly and the stiff fluid spike solution can end up with a permanent spike. We then derive the evolution equations of non-OT G 2 stiff fluid models, including a second perfect fluid, in full generality, and briefly discuss some of their qualitative properties and their potential numerical analysis. Finally, we discuss how a fluid, and especially a stiff fluid or massless scalar field, affects the physics of the generation of spikes. (paper)

Spiking neural P systems with multiple channels.

Science.gov (United States)

Peng, Hong; Yang, Jinyu; Wang, Jun; Wang, Tao; Sun, Zhang; Song, Xiaoxiao; Luo, Xiaohui; Huang, Xiangnian

2017-11-01

Spiking neural P systems (SNP systems, in short) are a class of distributed parallel computing systems inspired from the neurophysiological behavior of biological spiking neurons. In this paper, we investigate a new variant of SNP systems in which each neuron has one or more synaptic channels, called spiking neural P systems with multiple channels (SNP-MC systems, in short). The spiking rules with channel label are introduced to handle the firing mechanism of neurons, where the channel labels indicate synaptic channels of transmitting the generated spikes. The computation power of SNP-MC systems is investigated. Specifically, we prove that SNP-MC systems are Turing universal as both number generating and number accepting devices. Copyright © 2017 Elsevier Ltd. All rights reserved.

A Preliminary Study of MSD-First Radix-Sorting Methed

OpenAIRE

小田, 哲久

1984-01-01

Many kinds of sorting algorithms have been developed from the age of Punched Card System. Nowadays, any sorting algorithm can be called either (1) internal sorting methed or (2) external sorting method. Internal sorting method is used only when the number of records to be sorted (N) is not so large for the internal memory of the computer system. Larger memory space has become available with the aid of semiconductor technology. Therefore, it might be desired to develop a new internal sorting m...

Data parallel sorting for particle simulation

Science.gov (United States)

Dagum, Leonardo

1992-01-01

Sorting on a parallel architecture is a communications intensive event which can incur a high penalty in applications where it is required. In the case of particle simulation, only integer sorting is necessary, and sequential implementations easily attain the minimum performance bound of O (N) for N particles. Parallel implementations, however, have to cope with the parallel sorting problem which, in addition to incurring a heavy communications cost, can make the minimun performance bound difficult to attain. This paper demonstrates how the sorting problem in a particle simulation can be reduced to a merging problem, and describes an efficient data parallel algorithm to solve this merging problem in a particle simulation. The new algorithm is shown to be optimal under conditions usual for particle simulation, and its fieldwise implementation on the Connection Machine is analyzed in detail. The new algorithm is about four times faster than a fieldwise implementation of radix sort on the Connection Machine.

Stochastic Model of Vesicular Sorting in Cellular Organelles

Science.gov (United States)

Vagne, Quentin; Sens, Pierre

2018-02-01

The proper sorting of membrane components by regulated exchange between cellular organelles is crucial to intracellular organization. This process relies on the budding and fusion of transport vesicles, and should be strongly influenced by stochastic fluctuations, considering the relatively small size of many organelles. We identify the perfect sorting of two membrane components initially mixed in a single compartment as a first passage process, and we show that the mean sorting time exhibits two distinct regimes as a function of the ratio of vesicle fusion to budding rates. Low ratio values lead to fast sorting but result in a broad size distribution of sorted compartments dominated by small entities. High ratio values result in two well-defined sorted compartments but sorting is exponentially slow. Our results suggest an optimal balance between vesicle budding and fusion for the rapid and efficient sorting of membrane components and highlight the importance of stochastic effects for the steady-state organization of intracellular compartments.

Application of visible spectroscopy in waste sorting

Science.gov (United States)

Spiga, Philippe; Bourely, Antoine

2011-10-01

Today, waste recycling, (bottles, papers...), is a mechanical operation: the waste are crushed, fused and agglomerated in order to obtain new manufactured products (e.g. new bottles, clothes ...). The plastics recycling is the main application in the color sorting process. The colorless plastics recovered are more valuable than the colored plastics. Other emergent applications are in the paper sorting, where the main goal is to sort dyed paper from white papers. Up to now, Pellenc Selective Technologies has manufactured color sorting machines based on RGB cameras. Three dimensions (red, green and blue) are no longer sufficient to detect low quantities of dye in the considered waste. In order to increase the efficiency of the color detection, a new sorting machine, based on visible spectroscopy, has been developed. This paper presents the principles of the two approaches and their difference in terms of sorting performance, making visible spectroscopy a clear winner.

Geomagnetic spikes on the core-mantle boundary

Science.gov (United States)

Davies, C. J.; Constable, C.

2017-12-01

Extreme variations of Earth's magnetic field occurred in the Levantine region around 1000 BC, where the field intensity rose and fell by a factor of 2-3 over a short time and confined spatial region. There is presently no coherent link between this intensity spike and the generating processes in Earth's liquid core. Here we test the attribution of a surface spike to a flux patch visible on the core-mantle boundary (CMB), calculating geometric and energetic bounds on resulting surface geomagnetic features. We show that the Levantine intensity high must span at least 60 degrees in longitude. Models providing the best trade-off between matching surface spike intensity, minimizing L1 and L2 misfit to the available data and satisfying core energy constraints produce CMB spikes 8-22 degrees wide with peak values of O(100) mT. We propose that the Levantine spike grew in place before migrating northward and westward, contributing to the growth of the axial dipole field seen in Holocene field models. Estimates of Ohmic dissipation suggest that diffusive processes, which are often neglected, likely govern the ultimate decay of geomagnetic spikes. Using these results, we search for the presence of spike-like features in geodynamo simulations.

ALGORITHM FOR SORTING GROUPED DATA

Science.gov (United States)

Evans, J. D.

1994-01-01

It is often desirable to sort data sets in ascending or descending order. This becomes more difficult for grouped data, i.e., multiple sets of data, where each set of data involves several measurements or related elements. The sort becomes increasingly cumbersome when more than a few elements exist for each data set. In order to achieve an efficient sorting process, an algorithm has been devised in which the maximum most significant element is found, and then compared to each element in succession. The program was written to handle the daily temperature readings of the Voyager spacecraft, particularly those related to the special tracking requirements of Voyager 2. By reducing each data set to a single representative number, the sorting process becomes very easy. The first step in the process is to reduce the data set of width 'n' to a data set of width '1'. This is done by representing each data set by a polynomial of length 'n' based on the differences of the maximum and minimum elements. These single numbers are then sorted and converted back to obtain the original data sets. Required input data are the name of the data file to read and sort, and the starting and ending record numbers. The package includes a sample data file, containing 500 sets of data with 5 elements in each set. This program will perform a sort of the 500 data sets in 3 - 5 seconds on an IBM PC-AT with a hard disk; on a similarly equipped IBM PC-XT the time is under 10 seconds. This program is written in BASIC (specifically the Microsoft QuickBasic compiler) for interactive execution and has been implemented on the IBM PC computer series operating under PC-DOS with a central memory requirement of approximately 40K of 8 bit bytes. A hard disk is desirable for speed considerations, but is not required. This program was developed in 1986.

Bursts generate a non-reducible spike-pattern code

Directory of Open Access Journals (Sweden)

Hugo G Eyherabide

2009-05-01

Full Text Available On the single-neuron level, precisely timed spikes can either constitute firing-rate codes or spike-pattern codes that utilize the relative timing between consecutive spikes. There has been little experimental support for the hypothesis that such temporal patterns contribute substantially to information transmission. Using grasshopper auditory receptors as a model system, we show that correlations between spikes can be used to represent behaviorally relevant stimuli. The correlations reflect the inner structure of the spike train: a succession of burst-like patterns. We demonstrate that bursts with different spike counts encode different stimulus features, such that about 20% of the transmitted information corresponds to discriminating between different features, and the remaining 80% is used to allocate these features in time. In this spike-pattern code, the "what" and the "when" of the stimuli are encoded in the duration of each burst and the time of burst onset, respectively. Given the ubiquity of burst firing, we expect similar findings also for other neural systems.

Stochastic Variational Learning in Recurrent Spiking Networks

Directory of Open Access Journals (Sweden)

Danilo eJimenez Rezende

2014-04-01

Full Text Available The ability to learn and perform statistical inference with biologically plausible recurrent network of spiking neurons is an important step towards understanding perception and reasoning. Here we derive and investigate a new learning rule for recurrent spiking networks with hidden neurons, combining principles from variational learning and reinforcement learning. Our network defines a generative model over spike train histories and the derived learning rule has the form of a local Spike Timing Dependent Plasticity rule modulated by global factors (neuromodulators conveying information about ``novelty on a statistically rigorous ground.Simulations show that our model is able to learn bothstationary and non-stationary patterns of spike trains.We also propose one experiment that could potentially be performed with animals in order to test the dynamics of the predicted novelty signal.

Stochastic variational learning in recurrent spiking networks.

Science.gov (United States)

Jimenez Rezende, Danilo; Gerstner, Wulfram

2014-01-01

The ability to learn and perform statistical inference with biologically plausible recurrent networks of spiking neurons is an important step toward understanding perception and reasoning. Here we derive and investigate a new learning rule for recurrent spiking networks with hidden neurons, combining principles from variational learning and reinforcement learning. Our network defines a generative model over spike train histories and the derived learning rule has the form of a local Spike Timing Dependent Plasticity rule modulated by global factors (neuromodulators) conveying information about "novelty" on a statistically rigorous ground. Simulations show that our model is able to learn both stationary and non-stationary patterns of spike trains. We also propose one experiment that could potentially be performed with animals in order to test the dynamics of the predicted novelty signal.

Hybrid rendering of the chest and virtual bronchoscopy [corrected].

Science.gov (United States)

Seemann, M D; Seemann, O; Luboldt, W; Gebicke, K; Prime, G; Claussen, C D

2000-10-30

Thin-section spiral computed tomography was used to acquire the volume data sets of the thorax. The tracheobronchial system and pathological changes of the chest were visualized using a color-coded surface rendering method. The structures of interest were then superimposed on a volume rendering of the other thoracic structures, thus producing a hybrid rendering. The hybrid rendering technique exploit the advantages of both rendering methods and enable virtual bronchoscopic examinations using different representation models. Virtual bronchoscopic examinations with a transparent color-coded shaded-surface model enables the simultaneous visualization of both the airways and the adjacent structures behind of the tracheobronchial wall and therefore, offers a practical alternative to fiberoptic bronchoscopy. Hybrid rendering and virtual endoscopy obviate the need for time consuming detailed analysis and presentation of axial source images.

Parallel integer sorting with medium and fine-scale parallelism

Science.gov (United States)

Dagum, Leonardo

1993-01-01

Two new parallel integer sorting algorithms, queue-sort and barrel-sort, are presented and analyzed in detail. These algorithms do not have optimal parallel complexity, yet they show very good performance in practice. Queue-sort designed for fine-scale parallel architectures which allow the queueing of multiple messages to the same destination. Barrel-sort is designed for medium-scale parallel architectures with a high message passing overhead. The performance results from the implementation of queue-sort on a Connection Machine CM-2 and barrel-sort on a 128 processor iPSC/860 are given. The two implementations are found to be comparable in performance but not as good as a fully vectorized bucket sort on the Cray YMP.

Inferring oscillatory modulation in neural spike trains.

Science.gov (United States)

Arai, Kensuke; Kass, Robert E

2017-10-01

Oscillations are observed at various frequency bands in continuous-valued neural recordings like the electroencephalogram (EEG) and local field potential (LFP) in bulk brain matter, and analysis of spike-field coherence reveals that spiking of single neurons often occurs at certain phases of the global oscillation. Oscillatory modulation has been examined in relation to continuous-valued oscillatory signals, and independently from the spike train alone, but behavior or stimulus triggered firing-rate modulation, spiking sparseness, presence of slow modulation not locked to stimuli and irregular oscillations with large variability in oscillatory periods, present challenges to searching for temporal structures present in the spike train. In order to study oscillatory modulation in real data collected under a variety of experimental conditions, we describe a flexible point-process framework we call the Latent Oscillatory Spike Train (LOST) model to decompose the instantaneous firing rate in biologically and behaviorally relevant factors: spiking refractoriness, event-locked firing rate non-stationarity, and trial-to-trial variability accounted for by baseline offset and a stochastic oscillatory modulation. We also extend the LOST model to accommodate changes in the modulatory structure over the duration of the experiment, and thereby discover trial-to-trial variability in the spike-field coherence of a rat primary motor cortical neuron to the LFP theta rhythm. Because LOST incorporates a latent stochastic auto-regressive term, LOST is able to detect oscillations when the firing rate is low, the modulation is weak, and when the modulating oscillation has a broad spectral peak.

High-dimensional cluster analysis with the Masked EM Algorithm

Science.gov (United States)

Kadir, Shabnam N.; Goodman, Dan F. M.; Harris, Kenneth D.

2014-01-01

Cluster analysis faces two problems in high dimensions: first, the “curse of dimensionality” that can lead to overfitting and poor generalization performance; and second, the sheer time taken for conventional algorithms to process large amounts of high-dimensional data. We describe a solution to these problems, designed for the application of “spike sorting” for next-generation high channel-count neural probes. In this problem, only a small subset of features provide information about the cluster member-ship of any one data vector, but this informative feature subset is not the same for all data points, rendering classical feature selection ineffective. We introduce a “Masked EM” algorithm that allows accurate and time-efficient clustering of up to millions of points in thousands of dimensions. We demonstrate its applicability to synthetic data, and to real-world high-channel-count spike sorting data. PMID:25149694

UCSD SORT Test (U-SORT): Examination of a newly developed organizational skills assessment tool for severely mentally ill adults.

Science.gov (United States)

Tiznado, Denisse; Mausbach, Brent T; Cardenas, Veronica; Jeste, Dilip V; Patterson, Thomas L

2010-12-01

The present investigation examined the validity of a new cognitive test intended to assess organizational skills. Participants were 180 middle-aged or older participants with a Diagnostic and Statistical Manual of Mental Disorders, Fourth Edition diagnosis of schizophrenia or schizoaffective disorder. Participants' organizational skills were measured using our newly developed University of California, San Diego Sorting Test (U-SORT), a performance-based test of organizational ability in which subjects sort objects (e.g., battery, pens) from a "junk drawer" into "keep" versus "trash" piles. Significant correlations between U-SORT scores and theoretically similar constructs (i.e. functional capacity, cognitive functioning, and clinical symptoms) were acceptable (mean r = 0.34), and weak correlations were found between U-SORT scores and theoretically dissimilar constructs (e.g., health symptoms, social support, gender; mean r = 0.06 ). The correlation between assessment scores provides preliminary support for the U-SORT test as a brief, easily transportable, reliable, and valid measure of functioning for this population.

Categorizing Variations of Student-Implemented Sorting Algorithms

Science.gov (United States)

Taherkhani, Ahmad; Korhonen, Ari; Malmi, Lauri

2012-01-01

In this study, we examined freshmen students' sorting algorithm implementations in data structures and algorithms' course in two phases: at the beginning of the course before the students received any instruction on sorting algorithms, and after taking a lecture on sorting algorithms. The analysis revealed that many students have insufficient…

On the Construction of Sorted Reactive Systems

DEFF Research Database (Denmark)

Birkedal, Lars; Debois, Søren; Hildebrandt, Thomas

2008-01-01

We develop a theory of sorted bigraphical reactive systems. Every application of bigraphs in the literature has required an extension, a sorting, of pure bigraphs. In turn, every such application has required a redevelopment of the theory of pure bigraphical reactive systems for the sorting at hand...... bigraphs. Technically, we give our construction for ordinary reactive systems, then lift it to bigraphical reactive systems. As such, we give also a construction of sortings for ordinary reactive systems. This construction is an improvement over previous attempts in that it produces smaller and much more...

The local field potential reflects surplus spike synchrony

DEFF Research Database (Denmark)

Denker, Michael; Roux, Sébastien; Lindén, Henrik

2011-01-01

While oscillations of the local field potential (LFP) are commonly attributed to the synchronization of neuronal firing rate on the same time scale, their relationship to coincident spiking in the millisecond range is unknown. Here, we present experimental evidence to reconcile the notions...... of synchrony at the level of spiking and at the mesoscopic scale. We demonstrate that only in time intervals of significant spike synchrony that cannot be explained on the basis of firing rates, coincident spikes are better phase locked to the LFP than predicted by the locking of the individual spikes....... This effect is enhanced in periods of large LFP amplitudes. A quantitative model explains the LFP dynamics by the orchestrated spiking activity in neuronal groups that contribute the observed surplus synchrony. From the correlation analysis, we infer that neurons participate in different constellations...

Rendering the Topological Spines

Energy Technology Data Exchange (ETDEWEB)

Nieves-Rivera, D. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

2015-05-05

Many tools to analyze and represent high dimensional data already exits yet most of them are not flexible, informative and intuitive enough to help the scientists make the corresponding analysis and predictions, understand the structure and complexity of scientific data, get a complete picture of it and explore a greater number of hypotheses. With this in mind, N-Dimensional Data Analysis and Visualization (ND²AV) is being developed to serve as an interactive visual analysis platform with the purpose of coupling together a number of these existing tools that range from statistics, machine learning, and data mining, with new techniques, in particular with new visualization approaches. My task is to create the rendering and implementation of a new concept called topological spines in order to extend ND²AV's scope. Other existing visualization tools create a representation preserving either the topological properties or the structural (geometric) ones because it is challenging to preserve them both simultaneously. Overcoming such challenge by creating a balance in between them, the topological spines are introduced as a new approach that aims to preserve them both. Its render using OpenGL and C++ and is currently being tested to further on be implemented on ND²AV. In this paper I will present what are the Topological Spines and how they are rendered.

Implementation of Serial and Parallel Bubble Sort on Fpga

OpenAIRE

Purnomo, Dwi Marhaendro Jati; Arinaldi, Ahmad; Priyantini, Dwi Teguh; Wibisono, Ari; Febrian, Andreas

2016-01-01

Sorting is common process in computational world. Its utilization are on many fields from research to industry. There are many sorting algorithm in nowadays. One of the simplest yet powerful is bubble sort. In this study, bubble sort is implemented on FPGA. The implementation was taken on serial and parallel approach. Serial and parallel bubble sort then compared by means of its memory, execution time, and utility which comprises slices and LUTs. The experiments show that serial bubble sort r...

Evaluating progressive-rendering algorithms in appearance design tasks.

Science.gov (United States)

Jiawei Ou; Karlik, Ondrej; Křivánek, Jaroslav; Pellacini, Fabio

2013-01-01

Progressive rendering is becoming a popular alternative to precomputational approaches to appearance design. However, progressive algorithms create images exhibiting visual artifacts at early stages. A user study investigated these artifacts' effects on user performance in appearance design tasks. Novice and expert subjects performed lighting and material editing tasks with four algorithms: random path tracing, quasirandom path tracing, progressive photon mapping, and virtual-point-light rendering. Both the novices and experts strongly preferred path tracing to progressive photon mapping and virtual-point-light rendering. None of the participants preferred random path tracing to quasirandom path tracing or vice versa; the same situation held between progressive photon mapping and virtual-point-light rendering. The user workflow didn’t differ significantly with the four algorithms. The Web Extras include a video showing how four progressive-rendering algorithms converged (at http://youtu.be/ck-Gevl1e9s), the source code used, and other supplementary materials.

A cargo-sorting DNA robot.

Science.gov (United States)

Thubagere, Anupama J; Li, Wei; Johnson, Robert F; Chen, Zibo; Doroudi, Shayan; Lee, Yae Lim; Izatt, Gregory; Wittman, Sarah; Srinivas, Niranjan; Woods, Damien; Winfree, Erik; Qian, Lulu

2017-09-15

Two critical challenges in the design and synthesis of molecular robots are modularity and algorithm simplicity. We demonstrate three modular building blocks for a DNA robot that performs cargo sorting at the molecular level. A simple algorithm encoding recognition between cargos and their destinations allows for a simple robot design: a single-stranded DNA with one leg and two foot domains for walking, and one arm and one hand domain for picking up and dropping off cargos. The robot explores a two-dimensional testing ground on the surface of DNA origami, picks up multiple cargos of two types that are initially at unordered locations, and delivers them to specified destinations until all molecules are sorted into two distinct piles. The robot is designed to perform a random walk without any energy supply. Exploiting this feature, a single robot can repeatedly sort multiple cargos. Localization on DNA origami allows for distinct cargo-sorting tasks to take place simultaneously in one test tube or for multiple robots to collectively perform the same task. Copyright © 2017, American Association for the Advancement of Science.

Supervised Learning Based on Temporal Coding in Spiking Neural Networks.

Science.gov (United States)

Mostafa, Hesham

2017-08-01

Gradient descent training techniques are remarkably successful in training analog-valued artificial neural networks (ANNs). Such training techniques, however, do not transfer easily to spiking networks due to the spike generation hard nonlinearity and the discrete nature of spike communication. We show that in a feedforward spiking network that uses a temporal coding scheme where information is encoded in spike times instead of spike rates, the network input-output relation is differentiable almost everywhere. Moreover, this relation is piecewise linear after a transformation of variables. Methods for training ANNs thus carry directly to the training of such spiking networks as we show when training on the permutation invariant MNIST task. In contrast to rate-based spiking networks that are often used to approximate the behavior of ANNs, the networks we present spike much more sparsely and their behavior cannot be directly approximated by conventional ANNs. Our results highlight a new approach for controlling the behavior of spiking networks with realistic temporal dynamics, opening up the potential for using these networks to process spike patterns with complex temporal information.

New age radiometric ore sorting - the elegant solution

International Nuclear Information System (INIS)

Gordon, H.P.; Heuer, T.

2000-01-01

Radiometric ore sorting technology and application are described in two parts. Part I reviews the history of radiometric sorting in the minerals industry and describes the latest developments in radiometric sorting technology. Part II describes the history, feasibility study and approach used in the application of the new technology at Rossing Uranium Limited. There has been little progress in the field of radiometric sorting since the late 1970s. This has changed with the development of a high capacity radiometric sorter designed to operate on low-grade ore in the +75mm / -300mm size fraction. This has been designed specifically for an application at Rossing. Rossing has a long history in radiometric sorting dating back to 1968 when initial tests were conducted on the Rossing prospect. Past feasibility studies concluded that radiometric sorting would not conclusively reduce the unit cost of production unless sorting was used to increase production levels. The current feasibility study shows that the application of new radiometric sorter technology makes sorting viable without increasing production, and significantly more attractive with increased production. A pilot approach to confirm sorter performance is described. (author)

Clusterless Decoding of Position From Multiunit Activity Using A Marked Point Process Filter

Science.gov (United States)

Deng, Xinyi; Liu, Daniel F.; Kay, Kenneth; Frank, Loren M.; Eden, Uri T.

2016-01-01

Point process filters have been applied successfully to decode neural signals and track neural dynamics. Traditionally, these methods assume that multiunit spiking activity has already been correctly spike-sorted. As a result, these methods are not appropriate for situations where sorting cannot be performed with high precision such as real-time decoding for brain-computer interfaces. As the unsupervised spike-sorting problem remains unsolved, we took an alternative approach that takes advantage of recent insights about clusterless decoding. Here we present a new point process decoding algorithm that does not require multiunit signals to be sorted into individual units. We use the theory of marked point processes to construct a function that characterizes the relationship between a covariate of interest (in this case, the location of a rat on a track) and features of the spike waveforms. In our example, we use tetrode recordings, and the marks represent a four-dimensional vector of the maximum amplitudes of the spike waveform on each of the four electrodes. In general, the marks may represent any features of the spike waveform. We then use Bayes’ rule to estimate spatial location from hippocampal neural activity. We validate our approach with a simulation study and with experimental data recorded in the hippocampus of a rat moving through a linear environment. Our decoding algorithm accurately reconstructs the rat’s position from unsorted multiunit spiking activity. We then compare the quality of our decoding algorithm to that of a traditional spike-sorting and decoding algorithm. Our analyses show that the proposed decoding algorithm performs equivalently or better than algorithms based on sorted single-unit activity. These results provide a path toward accurate real-time decoding of spiking patterns that could be used to carry out content-specific manipulations of population activity in hippocampus or elsewhere in the brain. PMID:25973549

Linking investment spikes and productivity growth

NARCIS (Netherlands)

Geylani, P.C.; Stefanou, S.E.

2013-01-01

We investigate the relationship between productivity growth and investment spikes using Census Bureau’s plant-level dataset for the U.S. food manufacturing industry. There are differences in productivity growth and investment spike patterns across different sub-industries and food manufacturing

A new supervised learning algorithm for spiking neurons.

Science.gov (United States)

Xu, Yan; Zeng, Xiaoqin; Zhong, Shuiming

2013-06-01

The purpose of supervised learning with temporal encoding for spiking neurons is to make the neurons emit a specific spike train encoded by the precise firing times of spikes. If only running time is considered, the supervised learning for a spiking neuron is equivalent to distinguishing the times of desired output spikes and the other time during the running process of the neuron through adjusting synaptic weights, which can be regarded as a classification problem. Based on this idea, this letter proposes a new supervised learning method for spiking neurons with temporal encoding; it first transforms the supervised learning into a classification problem and then solves the problem by using the perceptron learning rule. The experiment results show that the proposed method has higher learning accuracy and efficiency over the existing learning methods, so it is more powerful for solving complex and real-time problems.

A Comparison of Card-sorting Analysis Methods

DEFF Research Database (Denmark)

Nawaz, Ather

2012-01-01

This study investigates how the choice of analysis method for card sorting studies affects the suggested information structure for websites. In the card sorting technique, a variety of methods are used to analyse the resulting data. The analysis of card sorting data helps user experience (UX......) designers to discover the patterns in how users make classifications and thus to develop an optimal, user-centred website structure. During analysis, the recurrence of patterns of classification between users influences the resulting website structure. However, the algorithm used in the analysis influences...... the recurrent patterns found and thus has consequences for the resulting website design. This paper draws an attention to the choice of card sorting analysis and techniques and shows how it impacts the results. The research focuses on how the same data for card sorting can lead to different website structures...

Solving constraint satisfaction problems with networks of spiking neurons

Directory of Open Access Journals (Sweden)

Zeno eJonke

2016-03-01

Full Text Available Network of neurons in the brain apply – unlike processors in our current generation ofcomputer hardware – an event-based processing strategy, where short pulses (spikes areemitted sparsely by neurons to signal the occurrence of an event at a particular point intime. Such spike-based computations promise to be substantially more power-efficient thantraditional clocked processing schemes. However it turned out to be surprisingly difficult todesign networks of spiking neurons that can solve difficult computational problems on the levelof single spikes (rather than rates of spikes. We present here a new method for designingnetworks of spiking neurons via an energy function. Furthermore we show how the energyfunction of a network of stochastically firing neurons can be shaped in a quite transparentmanner by composing the networks of simple stereotypical network motifs. We show that thisdesign approach enables networks of spiking neurons to produce approximate solutions todifficult (NP-hard constraint satisfaction problems from the domains of planning/optimizationand verification/logical inference. The resulting networks employ noise as a computationalresource. Nevertheless the timing of spikes (rather than just spike rates plays an essential rolein their computations. Furthermore, networks of spiking neurons carry out for the Traveling Salesman Problem a more efficient stochastic search for good solutions compared with stochastic artificial neural networks (Boltzmann machines and Gibbs sampling.

Surfing a spike wave down the ventral stream.

Science.gov (United States)

VanRullen, Rufin; Thorpe, Simon J

2002-10-01

Numerous theories of neural processing, often motivated by experimental observations, have explored the computational properties of neural codes based on the absolute or relative timing of spikes in spike trains. Spiking neuron models and theories however, as well as their experimental counterparts, have generally been limited to the simulation or observation of isolated neurons, isolated spike trains, or reduced neural populations. Such theories would therefore seem inappropriate to capture the properties of a neural code relying on temporal spike patterns distributed across large neuronal populations. Here we report a range of computer simulations and theoretical considerations that were designed to explore the possibilities of one such code and its relevance for visual processing. In a unified framework where the relation between stimulus saliency and spike relative timing plays the central role, we describe how the ventral stream of the visual system could process natural input scenes and extract meaningful information, both rapidly and reliably. The first wave of spikes generated in the retina in response to a visual stimulation carries information explicitly in its spatio-temporal structure: the most salient information is represented by the first spikes over the population. This spike wave, propagating through a hierarchy of visual areas, is regenerated at each processing stage, where its temporal structure can be modified by (i). the selectivity of the cortical neurons, (ii). lateral interactions and (iii). top-down attentional influences from higher order cortical areas. The resulting model could account for the remarkable efficiency and rapidity of processing observed in the primate visual system.

Three Sorts of Naturalism

OpenAIRE

Fink, Hans

2006-01-01

In "Two sorts of Naturalism" John McDowell is sketching his own sort of naturalism in ethics as an alternative to "bald naturalism". In this paper I distinguish materialist, idealist and absolute conceptions of nature and of naturalism in order to provide a framework for a clearer understanding of what McDowell's own naturalism amounts to. I argue that nothing short of an absolute naturalism will do for a number of McDowell's own purposes, but that it is far from obvious that this is his posi...

Spike timing precision of neuronal circuits.

Science.gov (United States)

Kilinc, Deniz; Demir, Alper

2018-04-17

Spike timing is believed to be a key factor in sensory information encoding and computations performed by the neurons and neuronal circuits. However, the considerable noise and variability, arising from the inherently stochastic mechanisms that exist in the neurons and the synapses, degrade spike timing precision. Computational modeling can help decipher the mechanisms utilized by the neuronal circuits in order to regulate timing precision. In this paper, we utilize semi-analytical techniques, which were adapted from previously developed methods for electronic circuits, for the stochastic characterization of neuronal circuits. These techniques, which are orders of magnitude faster than traditional Monte Carlo type simulations, can be used to directly compute the spike timing jitter variance, power spectral densities, correlation functions, and other stochastic characterizations of neuronal circuit operation. We consider three distinct neuronal circuit motifs: Feedback inhibition, synaptic integration, and synaptic coupling. First, we show that both the spike timing precision and the energy efficiency of a spiking neuron are improved with feedback inhibition. We unveil the underlying mechanism through which this is achieved. Then, we demonstrate that a neuron can improve on the timing precision of its synaptic inputs, coming from multiple sources, via synaptic integration: The phase of the output spikes of the integrator neuron has the same variance as that of the sample average of the phases of its inputs. Finally, we reveal that weak synaptic coupling among neurons, in a fully connected network, enables them to behave like a single neuron with a larger membrane area, resulting in an improvement in the timing precision through cooperation.

Causal Inference and Explaining Away in a Spiking Network

Science.gov (United States)

Moreno-Bote, Rubén; Drugowitsch, Jan

2015-01-01

While the brain uses spiking neurons for communication, theoretical research on brain computations has mostly focused on non-spiking networks. The nature of spike-based algorithms that achieve complex computations, such as object probabilistic inference, is largely unknown. Here we demonstrate that a family of high-dimensional quadratic optimization problems with non-negativity constraints can be solved exactly and efficiently by a network of spiking neurons. The network naturally imposes the non-negativity of causal contributions that is fundamental to causal inference, and uses simple operations, such as linear synapses with realistic time constants, and neural spike generation and reset non-linearities. The network infers the set of most likely causes from an observation using explaining away, which is dynamically implemented by spike-based, tuned inhibition. The algorithm performs remarkably well even when the network intrinsically generates variable spike trains, the timing of spikes is scrambled by external sources of noise, or the network is mistuned. This type of network might underlie tasks such as odor identification and classification. PMID:26621426

Moisture movements in render on brick wall

DEFF Research Database (Denmark)

Hansen, Kurt Kielsgaard; Munch, Thomas Astrup; Thorsen, Peter Schjørmann

2003-01-01

A three-layer render on brick wall used for building facades is studied in the laboratory. The vertical render surface is held in contact with water for 24 hours simulating driving rain while it is measured with non-destructive X-ray equipment every hour in order to follow the moisture front...

Neuro-Inspired Spike-Based Motion: From Dynamic Vision Sensor to Robot Motor Open-Loop Control through Spike-VITE

Directory of Open Access Journals (Sweden)

Fernando Perez-Peña

2013-11-01

Full Text Available In this paper we present a complete spike-based architecture: from a Dynamic Vision Sensor (retina to a stereo head robotic platform. The aim of this research is to reproduce intended movements performed by humans taking into account as many features as possible from the biological point of view. This paper fills the gap between current spike silicon sensors and robotic actuators by applying a spike processing strategy to the data flows in real time. The architecture is divided into layers: the retina, visual information processing, the trajectory generator layer which uses a neuroinspired algorithm (SVITE that can be replicated into as many times as DoF the robot has; and finally the actuation layer to supply the spikes to the robot (using PFM. All the layers do their tasks in a spike-processing mode, and they communicate each other through the neuro-inspired AER protocol. The open-loop controller is implemented on FPGA using AER interfaces developed by RTC Lab. Experimental results reveal the viability of this spike-based controller. Two main advantages are: low hardware resources (2% of a Xilinx Spartan 6 and power requirements (3.4 W to control a robot with a high number of DoF (up to 100 for a Xilinx Spartan 6. It also evidences the suitable use of AER as a communication protocol between processing and actuation.

Neuro-Inspired Spike-Based Motion: From Dynamic Vision Sensor to Robot Motor Open-Loop Control through Spike-VITE

Science.gov (United States)

Perez-Peña, Fernando; Morgado-Estevez, Arturo; Linares-Barranco, Alejandro; Jimenez-Fernandez, Angel; Gomez-Rodriguez, Francisco; Jimenez-Moreno, Gabriel; Lopez-Coronado, Juan

2013-01-01

In this paper we present a complete spike-based architecture: from a Dynamic Vision Sensor (retina) to a stereo head robotic platform. The aim of this research is to reproduce intended movements performed by humans taking into account as many features as possible from the biological point of view. This paper fills the gap between current spike silicon sensors and robotic actuators by applying a spike processing strategy to the data flows in real time. The architecture is divided into layers: the retina, visual information processing, the trajectory generator layer which uses a neuroinspired algorithm (SVITE) that can be replicated into as many times as DoF the robot has; and finally the actuation layer to supply the spikes to the robot (using PFM). All the layers do their tasks in a spike-processing mode, and they communicate each other through the neuro-inspired AER protocol. The open-loop controller is implemented on FPGA using AER interfaces developed by RTC Lab. Experimental results reveal the viability of this spike-based controller. Two main advantages are: low hardware resources (2% of a Xilinx Spartan 6) and power requirements (3.4 W) to control a robot with a high number of DoF (up to 100 for a Xilinx Spartan 6). It also evidences the suitable use of AER as a communication protocol between processing and actuation. PMID:24264330

Application of radix sorting in high energy physics experiment

International Nuclear Information System (INIS)

Chen Xuan; Gu Minhao; Zhu Kejun

2012-01-01

In the high energy physics experiments, there are always requirements to sort the large scale of experiment data. To meet the demand, this paper introduces one radix sorting algorithms, whose sub-sort is counting sorting and time complex is O (n), based on the characteristic of high energy physics experiment data that is marked by time stamp. This paper gives the description, analysis, implementation and experimental result of the sorting algorithms. (authors)

Spike Pattern Structure Influences Synaptic Efficacy Variability Under STDP and Synaptic Homeostasis. II: Spike Shuffling Methods on LIF Networks

Directory of Open Access Journals (Sweden)

Zedong Bi

2016-08-01

Full Text Available Synapses may undergo variable changes during plasticity because of the variability of spike patterns such as temporal stochasticity and spatial randomness. Here, we call the variability of synaptic weight changes during plasticity to be efficacy variability. In this paper, we investigate how four aspects of spike pattern statistics (i.e., synchronous firing, burstiness/regularity, heterogeneity of rates and heterogeneity of cross-correlations influence the efficacy variability under pair-wise additive spike-timing dependent plasticity (STDP and synaptic homeostasis (the mean strength of plastic synapses into a neuron is bounded, by implementing spike shuffling methods onto spike patterns self-organized by a network of excitatory and inhibitory leaky integrate-and-fire (LIF neurons. With the increase of the decay time scale of the inhibitory synaptic currents, the LIF network undergoes a transition from asynchronous state to weak synchronous state and then to synchronous bursting state. We first shuffle these spike patterns using a variety of methods, each designed to evidently change a specific pattern statistics; and then investigate the change of efficacy variability of the synapses under STDP and synaptic homeostasis, when the neurons in the network fire according to the spike patterns before and after being treated by a shuffling method. In this way, we can understand how the change of pattern statistics may cause the change of efficacy variability. Our results are consistent with those of our previous study which implements spike-generating models on converging motifs. We also find that burstiness/regularity is important to determine the efficacy variability under asynchronous states, while heterogeneity of cross-correlations is the main factor to cause efficacy variability when the network moves into synchronous bursting states (the states observed in epilepsy.

Sketchy Rendering for Information Visualization.

Science.gov (United States)

Wood, J; Isenberg, P; Isenberg, T; Dykes, J; Boukhelifa, N; Slingsby, A

2012-12-01

We present and evaluate a framework for constructing sketchy style information visualizations that mimic data graphics drawn by hand. We provide an alternative renderer for the Processing graphics environment that redefines core drawing primitives including line, polygon and ellipse rendering. These primitives allow higher-level graphical features such as bar charts, line charts, treemaps and node-link diagrams to be drawn in a sketchy style with a specified degree of sketchiness. The framework is designed to be easily integrated into existing visualization implementations with minimal programming modification or design effort. We show examples of use for statistical graphics, conveying spatial imprecision and for enhancing aesthetic and narrative qualities of visualization. We evaluate user perception of sketchiness of areal features through a series of stimulus-response tests in order to assess users' ability to place sketchiness on a ratio scale, and to estimate area. Results suggest relative area judgment is compromised by sketchy rendering and that its influence is dependent on the shape being rendered. They show that degree of sketchiness may be judged on an ordinal scale but that its judgement varies strongly between individuals. We evaluate higher-level impacts of sketchiness through user testing of scenarios that encourage user engagement with data visualization and willingness to critique visualization design. Results suggest that where a visualization is clearly sketchy, engagement may be increased and that attitudes to participating in visualization annotation are more positive. The results of our work have implications for effective information visualization design that go beyond the traditional role of sketching as a tool for prototyping or its use for an indication of general uncertainty.

Local and Global Illumination in the Volume Rendering Integral

Energy Technology Data Exchange (ETDEWEB)

Max, N; Chen, M

2005-10-21

This article is intended as an update of the major survey by Max [1] on optical models for direct volume rendering. It provides a brief overview of the subject scope covered by [1], and brings recent developments, such as new shadow algorithms and refraction rendering, into the perspective. In particular, we examine three fundamentals aspects of direct volume rendering, namely the volume rendering integral, local illumination models and global illumination models, in a wavelength-independent manner. We review the developments on spectral volume rendering, in which visible light are considered as a form of electromagnetic radiation, optical models are implemented in conjunction with representations of spectral power distribution. This survey can provide a basis for, and encourage, new efforts for developing and using complex illumination models to achieve better realism and perception through optical correctness.

Joint Probability-Based Neuronal Spike Train Classification

Directory of Open Access Journals (Sweden)

Yan Chen

2009-01-01

Full Text Available Neuronal spike trains are used by the nervous system to encode and transmit information. Euclidean distance-based methods (EDBMs have been applied to quantify the similarity between temporally-discretized spike trains and model responses. In this study, using the same discretization procedure, we developed and applied a joint probability-based method (JPBM to classify individual spike trains of slowly adapting pulmonary stretch receptors (SARs. The activity of individual SARs was recorded in anaesthetized, paralysed adult male rabbits, which were artificially-ventilated at constant rate and one of three different volumes. Two-thirds of the responses to the 600 stimuli presented at each volume were used to construct three response models (one for each stimulus volume consisting of a series of time bins, each with spike probabilities. The remaining one-third of the responses where used as test responses to be classified into one of the three model responses. This was done by computing the joint probability of observing the same series of events (spikes or no spikes, dictated by the test response in a given model and determining which probability of the three was highest. The JPBM generally produced better classification accuracy than the EDBM, and both performed well above chance. Both methods were similarly affected by variations in discretization parameters, response epoch duration, and two different response alignment strategies. Increasing bin widths increased classification accuracy, which also improved with increased observation time, but primarily during periods of increasing lung inflation. Thus, the JPBM is a simple and effective method performing spike train classification.

Fitting neuron models to spike trains

Directory of Open Access Journals (Sweden)

Cyrille eRossant

2011-02-01

Full Text Available Computational modeling is increasingly used to understand the function of neural circuitsin systems neuroscience.These studies require models of individual neurons with realisticinput-output properties.Recently, it was found that spiking models can accurately predict theprecisely timed spike trains produced by cortical neurons in response tosomatically injected currents,if properly fitted. This requires fitting techniques that are efficientand flexible enough to easily test different candidate models.We present a generic solution, based on the Brian simulator(a neural network simulator in Python, which allowsthe user to define and fit arbitrary neuron models to electrophysiological recordings.It relies on vectorization and parallel computing techniques toachieve efficiency.We demonstrate its use on neural recordings in the barrel cortex andin the auditory brainstem, and confirm that simple adaptive spiking modelscan accurately predict the response of cortical neurons. Finally, we show how a complexmulticompartmental model can be reduced to a simple effective spiking model.

Engineering a Cache-Oblivious Sorting Algorithm

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Fagerberg, Rolf; Vinther, Kristoffer

2007-01-01

This paper is an algorithmic engineering study of cache-oblivious sorting. We investigate by empirical methods a number of implementation issues and parameter choices for the cache-oblivious sorting algorithm Lazy Funnelsort, and compare the final algorithm with Quicksort, the established standard...

Detection and Evaluation of Spatio-Temporal Spike Patterns in Massively Parallel Spike Train Data with SPADE

Directory of Open Access Journals (Sweden)

Pietro Quaglio

2017-05-01

Full Text Available Repeated, precise sequences of spikes are largely considered a signature of activation of cell assemblies. These repeated sequences are commonly known under the name of spatio-temporal patterns (STPs. STPs are hypothesized to play a role in the communication of information in the computational process operated by the cerebral cortex. A variety of statistical methods for the detection of STPs have been developed and applied to electrophysiological recordings, but such methods scale poorly with the current size of available parallel spike train recordings (more than 100 neurons. In this work, we introduce a novel method capable of overcoming the computational and statistical limits of existing analysis techniques in detecting repeating STPs within massively parallel spike trains (MPST. We employ advanced data mining techniques to efficiently extract repeating sequences of spikes from the data. Then, we introduce and compare two alternative approaches to distinguish statistically significant patterns from chance sequences. The first approach uses a measure known as conceptual stability, of which we investigate a computationally cheap approximation for applications to such large data sets. The second approach is based on the evaluation of pattern statistical significance. In particular, we provide an extension to STPs of a method we recently introduced for the evaluation of statistical significance of synchronous spike patterns. The performance of the two approaches is evaluated in terms of computational load and statistical power on a variety of artificial data sets that replicate specific features of experimental data. Both methods provide an effective and robust procedure for detection of STPs in MPST data. The method based on significance evaluation shows the best overall performance, although at a higher computational cost. We name the novel procedure the spatio-temporal Spike PAttern Detection and Evaluation (SPADE analysis.

Constructing Precisely Computing Networks with Biophysical Spiking Neurons.

Science.gov (United States)

Schwemmer, Michael A; Fairhall, Adrienne L; Denéve, Sophie; Shea-Brown, Eric T

2015-07-15

While spike timing has been shown to carry detailed stimulus information at the sensory periphery, its possible role in network computation is less clear. Most models of computation by neural networks are based on population firing rates. In equivalent spiking implementations, firing is assumed to be random such that averaging across populations of neurons recovers the rate-based approach. Recently, however, Denéve and colleagues have suggested that the spiking behavior of neurons may be fundamental to how neuronal networks compute, with precise spike timing determined by each neuron's contribution to producing the desired output (Boerlin and Denéve, 2011; Boerlin et al., 2013). By postulating that each neuron fires to reduce the error in the network's output, it was demonstrated that linear computations can be performed by networks of integrate-and-fire neurons that communicate through instantaneous synapses. This left open, however, the possibility that realistic networks, with conductance-based neurons with subthreshold nonlinearity and the slower timescales of biophysical synapses, may not fit into this framework. Here, we show how the spike-based approach can be extended to biophysically plausible networks. We then show that our network reproduces a number of key features of cortical networks including irregular and Poisson-like spike times and a tight balance between excitation and inhibition. Lastly, we discuss how the behavior of our model scales with network size or with the number of neurons "recorded" from a larger computing network. These results significantly increase the biological plausibility of the spike-based approach to network computation. We derive a network of neurons with standard spike-generating currents and synapses with realistic timescales that computes based upon the principle that the precise timing of each spike is important for the computation. We then show that our network reproduces a number of key features of cortical networks

Programmable neural processing on a smartdust for brain-computer interfaces.

Science.gov (United States)

Yuwen Sun; Shimeng Huang; Oresko, Joseph J; Cheng, Allen C

2010-10-01

Brain-computer interfaces (BCIs) offer tremendous promise for improving the quality of life for disabled individuals. BCIs use spike sorting to identify the source of each neural firing. To date, spike sorting has been performed by either using off-chip analysis, which requires a wired connection penetrating the skull to a bulky external power/processing unit, or via custom application-specific integrated circuits that lack the programmability to perform different algorithms and upgrades. In this research, we propose and test the feasibility of performing on-chip, real-time spike sorting on a programmable smartdust, including feature extraction, classification, compression, and wireless transmission. A detailed power/performance tradeoff analysis using DVFS is presented. Our experimental results show that the execution time and power density meet the requirements to perform real-time spike sorting and wireless transmission on a single neural channel.

Solving Constraint Satisfaction Problems with Networks of Spiking Neurons.

Science.gov (United States)

Jonke, Zeno; Habenschuss, Stefan; Maass, Wolfgang

2016-01-01

Network of neurons in the brain apply-unlike processors in our current generation of computer hardware-an event-based processing strategy, where short pulses (spikes) are emitted sparsely by neurons to signal the occurrence of an event at a particular point in time. Such spike-based computations promise to be substantially more power-efficient than traditional clocked processing schemes. However, it turns out to be surprisingly difficult to design networks of spiking neurons that can solve difficult computational problems on the level of single spikes, rather than rates of spikes. We present here a new method for designing networks of spiking neurons via an energy function. Furthermore, we show how the energy function of a network of stochastically firing neurons can be shaped in a transparent manner by composing the networks of simple stereotypical network motifs. We show that this design approach enables networks of spiking neurons to produce approximate solutions to difficult (NP-hard) constraint satisfaction problems from the domains of planning/optimization and verification/logical inference. The resulting networks employ noise as a computational resource. Nevertheless, the timing of spikes plays an essential role in their computations. Furthermore, networks of spiking neurons carry out for the Traveling Salesman Problem a more efficient stochastic search for good solutions compared with stochastic artificial neural networks (Boltzmann machines) and Gibbs sampling.

Standardized rendering from IR surveillance motion imagery

Science.gov (United States)

Prokoski, F. J.

2014-06-01

Government agencies, including defense and law enforcement, increasingly make use of video from surveillance systems and camera phones owned by non-government entities.Making advanced and standardized motion imaging technology available to private and commercial users at cost-effective prices would benefit all parties. In particular, incorporating thermal infrared into commercial surveillance systems offers substantial benefits beyond night vision capability. Face rendering is a process to facilitate exploitation of thermal infrared surveillance imagery from the general area of a crime scene, to assist investigations with and without cooperating eyewitnesses. Face rendering automatically generates greyscale representations similar to police artist sketches for faces in surveillance imagery collected from proximate locations and times to a crime under investigation. Near-realtime generation of face renderings can provide law enforcement with an investigation tool to assess witness memory and credibility, and integrate reports from multiple eyewitnesses, Renderings can be quickly disseminated through social media to warn of a person who may pose an immediate threat, and to solicit the public's help in identifying possible suspects and witnesses. Renderings are pose-standardized so as to not divulge the presence and location of eyewitnesses and surveillance cameras. Incorporation of thermal infrared imaging into commercial surveillance systems will significantly improve system performance, and reduce manual review times, at an incremental cost that will continue to decrease. Benefits to criminal justice would include improved reliability of eyewitness testimony and improved accuracy of distinguishing among minority groups in eyewitness and surveillance identifications.

Multineuron spike train analysis with R-convolution linear combination kernel.

Science.gov (United States)

Tezuka, Taro

2018-06-01

A spike train kernel provides an effective way of decoding information represented by a spike train. Some spike train kernels have been extended to multineuron spike trains, which are simultaneously recorded spike trains obtained from multiple neurons. However, most of these multineuron extensions were carried out in a kernel-specific manner. In this paper, a general framework is proposed for extending any single-neuron spike train kernel to multineuron spike trains, based on the R-convolution kernel. Special subclasses of the proposed R-convolution linear combination kernel are explored. These subclasses have a smaller number of parameters and make optimization tractable when the size of data is limited. The proposed kernel was evaluated using Gaussian process regression for multineuron spike trains recorded from an animal brain. It was compared with the sum kernel and the population Spikernel, which are existing ways of decoding multineuron spike trains using kernels. The results showed that the proposed approach performs better than these kernels and also other commonly used neural decoding methods. Copyright © 2018 Elsevier Ltd. All rights reserved.

On the Directly and Subdirectly Irreducible Many-Sorted Algebras

Directory of Open Access Journals (Sweden)

Climent Vidal J.

2015-03-01

Full Text Available A theorem of single-sorted universal algebra asserts that every finite algebra can be represented as a product of a finite family of finite directly irreducible algebras. In this article, we show that the many-sorted counterpart of the above theorem is also true, but under the condition of requiring, in the definition of directly reducible many-sorted algebra, that the supports of the factors should be included in the support of the many-sorted algebra. Moreover, we show that the theorem of Birkhoff, according to which every single-sorted algebra is isomorphic to a subdirect product of subdirectly irreducible algebras, is also true in the field of many-sorted algebras.

Remote volume rendering pipeline for mHealth applications

Science.gov (United States)

Gutenko, Ievgeniia; Petkov, Kaloian; Papadopoulos, Charilaos; Zhao, Xin; Park, Ji Hwan; Kaufman, Arie; Cha, Ronald

2014-03-01

We introduce a novel remote volume rendering pipeline for medical visualization targeted for mHealth (mobile health) applications. The necessity of such a pipeline stems from the large size of the medical imaging data produced by current CT and MRI scanners with respect to the complexity of the volumetric rendering algorithms. For example, the resolution of typical CT Angiography (CTA) data easily reaches 512^3 voxels and can exceed 6 gigabytes in size by spanning over the time domain while capturing a beating heart. This explosion in data size makes data transfers to mobile devices challenging, and even when the transfer problem is resolved the rendering performance of the device still remains a bottleneck. To deal with this issue, we propose a thin-client architecture, where the entirety of the data resides on a remote server where the image is rendered and then streamed to the client mobile device. We utilize the display and interaction capabilities of the mobile device, while performing interactive volume rendering on a server capable of handling large datasets. Specifically, upon user interaction the volume is rendered on the server and encoded into an H.264 video stream. H.264 is ubiquitously hardware accelerated, resulting in faster compression and lower power requirements. The choice of low-latency CPU- and GPU-based encoders is particularly important in enabling the interactive nature of our system. We demonstrate a prototype of our framework using various medical datasets on commodity tablet devices.

Comparison of electrodialytic removal of Cu from spiked kaolinite, spiked soil and industrially polluted soil

DEFF Research Database (Denmark)

Ottosen, Lisbeth M.; Lepkova, Katarina; Kubal, Martin

2006-01-01

Electrokinetic remediation methods for removal of heavy metals from polluted soils have been subjected for quite intense research during the past years since these methods are well suitable for fine-grained soils where other remediation methods fail. Electrodialytic remediation is an electrokinetic...... remediation method which is based on applying an electric DC field and the use of ion exchange membranes that ensures the main transport of heavy metals to be out of the pollutes soil. An experimental investigation was made with electrodialytic removal of Cu from spiked kaolinite, spiked soil and industrially...... polluted soil under the same operational conditions (constant current density 0.2 mA/cm2 and duration 28 days). The results of the present paper show that caution must be taken when generalising results obtained in spiked kaolinite to remediation of industrially polluted soils, as it was shown...

Order-sorted Algebraic Specifications with Higher-order Functions

DEFF Research Database (Denmark)

Haxthausen, Anne Elisabeth

1995-01-01

This paper gives a proposal for how order-sorted algebraic specification languages can be extended with higher-order functions. The approach taken is a generalisation to the order-sorted case of an approach given by Mller, Tarlecki and Wirsing for the many-sorted case. The main idea in the proposal...

Toxicity of nickel-spiked freshwater sediments to benthic invertebrates-Spiking methodology, species sensitivity, and nickel bioavailability

Science.gov (United States)

Besser, John M.; Brumbaugh, William G.; Kemble, Nile E.; Ivey, Chris D.; Kunz, James L.; Ingersoll, Christopher G.; Rudel, David

2011-01-01

This report summarizes data from studies of the toxicity and bioavailability of nickel in nickel-spiked freshwater sediments. The goal of these studies was to generate toxicity and chemistry data to support development of broadly applicable sediment quality guidelines for nickel. The studies were conducted as three tasks, which are presented here as three chapters: Task 1, Development of methods for preparation and toxicity testing of nickel-spiked freshwater sediments; Task 2, Sensitivity of benthic invertebrates to toxicity of nickel-spiked freshwater sediments; and Task 3, Effect of sediment characteristics on nickel bioavailability. Appendices with additional methodological details and raw chemistry and toxicity data for the three tasks are available online at http://pubs.usgs.gov/sir/2011/5225/downloads/.

GPU Pro 5 advanced rendering techniques

CERN Document Server

Engel, Wolfgang

2014-01-01

In GPU Pro5: Advanced Rendering Techniques, section editors Wolfgang Engel, Christopher Oat, Carsten Dachsbacher, Michal Valient, Wessam Bahnassi, and Marius Bjorge have once again assembled a high-quality collection of cutting-edge techniques for advanced graphics processing unit (GPU) programming. Divided into six sections, the book covers rendering, lighting, effects in image space, mobile devices, 3D engine design, and compute. It explores rasterization of liquids, ray tracing of art assets that would otherwise be used in a rasterized engine, physically based area lights, volumetric light

Sorting and sustaining cooperation

DEFF Research Database (Denmark)

Vikander, Nick

2013-01-01

This paper looks at cooperation in teams where some people are selfish and others are conditional cooperators, and where lay-offs will occur at a fixed future date. I show that the best way to sustain cooperation prior to the lay-offs is often in a sorting equilibrium, where conditional cooperators...... can identify and then work with one another. Changes to parameters that would seem to make cooperation more attractive, such as an increase in the discount factor or the fraction of conditional cooperators, can reduce equilibrium cooperation if they decrease a selfish player's incentive to sort....

Fast algorithm for the rendering of three-dimensional surfaces

Science.gov (United States)

Pritt, Mark D.

1994-02-01

It is often desirable to draw a detailed and realistic representation of surface data on a computer graphics display. One such representation is a 3D shaded surface. Conventional techniques for rendering shaded surfaces are slow, however, and require substantial computational power. Furthermore, many techniques suffer from aliasing effects, which appear as jagged lines and edges. This paper describes an algorithm for the fast rendering of shaded surfaces without aliasing effects. It is much faster than conventional ray tracing and polygon-based rendering techniques and is suitable for interactive use. On an IBM RISC System/6000TM workstation it renders a 1000 X 1000 surface in about 7 seconds.

Innovative Lime Pozzolana Renders for Reconstruction of Historical Buildings

International Nuclear Information System (INIS)

Vejmelkova, E.; Maca, P.; Konvalinka, P.; Cerny, R.

2011-01-01

Bulk density, matrix density, open porosity, compressive strength, bending strength, water sorptivity, moisture diffusivity, water vapor diffusion coefficient, thermal conductivity, specific heat capacity and thermal diffusivity of two innovative renovation renders on limepozzolana basis are analyzed. The obtained results are compared with reference lime plaster and two commercial renovation renders, and conclusions on the applicability of the particular renders in practical reconstruction works are drawn. (author)

Visually Evoked Spiking Evolves While Spontaneous Ongoing Dynamics Persist

DEFF Research Database (Denmark)

Huys, Raoul; Jirsa, Viktor K; Darokhan, Ziauddin

2016-01-01

attractor. Its existence guarantees that evoked spiking return to the spontaneous state. However, the spontaneous ongoing spiking state and the visual evoked spiking states are qualitatively different and are separated by a threshold (separatrix). The functional advantage of this organization...

Multichannel interictal spike activity detection using time-frequency entropy measure.

Science.gov (United States)

Thanaraj, Palani; Parvathavarthini, B

2017-06-01

Localization of interictal spikes is an important clinical step in the pre-surgical assessment of pharmacoresistant epileptic patients. The manual selection of interictal spike periods is cumbersome and involves a considerable amount of analysis workload for the physician. The primary focus of this paper is to automate the detection of interictal spikes for clinical applications in epilepsy localization. The epilepsy localization procedure involves detection of spikes in a multichannel EEG epoch. Therefore, a multichannel Time-Frequency (T-F) entropy measure is proposed to extract features related to the interictal spike activity. Least squares support vector machine is used to train the proposed feature to classify the EEG epochs as either normal or interictal spike period. The proposed T-F entropy measure, when validated with epilepsy dataset of 15 patients, shows an interictal spike classification accuracy of 91.20%, sensitivity of 100% and specificity of 84.23%. Moreover, the area under the curve of Receiver Operating Characteristics plot of 0.9339 shows the superior classification performance of the proposed T-F entropy measure. The results of this paper show a good spike detection accuracy without any prior information about the spike morphology.

Denni Algorithm An Enhanced Of SMS (Scan, Move and Sort) Algorithm

Science.gov (United States)

Aprilsyah Lubis, Denni; Salim Sitompul, Opim; Marwan; Tulus; Andri Budiman, M.

2017-12-01

Sorting has been a profound area for the algorithmic researchers, and many resources are invested to suggest a more working sorting algorithm. For this purpose many existing sorting algorithms were observed in terms of the efficiency of the algorithmic complexity. Efficient sorting is important to optimize the use of other algorithms that require sorted lists to work correctly. Sorting has been considered as a fundamental problem in the study of algorithms that due to many reasons namely, the necessary to sort information is inherent in many applications, algorithms often use sorting as a key subroutine, in algorithm design there are many essential techniques represented in the body of sorting algorithms, and many engineering issues come to the fore when implementing sorting algorithms., Many algorithms are very well known for sorting the unordered lists, and one of the well-known algorithms that make the process of sorting to be more economical and efficient is SMS (Scan, Move and Sort) algorithm, an enhancement of Quicksort invented Rami Mansi in 2010. This paper presents a new sorting algorithm called Denni-algorithm. The Denni algorithm is considered as an enhancement on the SMS algorithm in average, and worst cases. The Denni algorithm is compared with the SMS algorithm and the results were promising.

The solution space of sorting by DCJ.

Science.gov (United States)

Braga, Marília D V; Stoye, Jens

2010-09-01

In genome rearrangements, the double cut and join (DCJ) operation, introduced by Yancopoulos et al. in 2005, allows one to represent most rearrangement events that could happen in multichromosomal genomes, such as inversions, translocations, fusions, and fissions. No restriction on the genome structure considering linear and circular chromosomes is imposed. An advantage of this general model is that it leads to considerable algorithmic simplifications compared to other genome rearrangement models. Recently, several works concerning the DCJ operation have been published, and in particular, an algorithm was proposed to find an optimal DCJ sequence for sorting one genome into another one. Here we study the solution space of this problem and give an easy-to-compute formula that corresponds to the exact number of optimal DCJ sorting sequences for a particular subset of instances of the problem. We also give an algorithm to count the number of optimal sorting sequences for any instance of the problem. Another interesting result is the demonstration of the possibility of obtaining one optimal sorting sequence by properly replacing any pair of consecutive operations in another optimal sequence. As a consequence, any optimal sorting sequence can be obtained from one other by applying such replacements successively, but the problem of finding the shortest number of replacements between two sorting sequences is still open.

Training Deep Spiking Neural Networks Using Backpropagation.

Science.gov (United States)

Lee, Jun Haeng; Delbruck, Tobi; Pfeiffer, Michael

2016-01-01

Deep spiking neural networks (SNNs) hold the potential for improving the latency and energy efficiency of deep neural networks through data-driven event-based computation. However, training such networks is difficult due to the non-differentiable nature of spike events. In this paper, we introduce a novel technique, which treats the membrane potentials of spiking neurons as differentiable signals, where discontinuities at spike times are considered as noise. This enables an error backpropagation mechanism for deep SNNs that follows the same principles as in conventional deep networks, but works directly on spike signals and membrane potentials. Compared with previous methods relying on indirect training and conversion, our technique has the potential to capture the statistics of spikes more precisely. We evaluate the proposed framework on artificially generated events from the original MNIST handwritten digit benchmark, and also on the N-MNIST benchmark recorded with an event-based dynamic vision sensor, in which the proposed method reduces the error rate by a factor of more than three compared to the best previous SNN, and also achieves a higher accuracy than a conventional convolutional neural network (CNN) trained and tested on the same data. We demonstrate in the context of the MNIST task that thanks to their event-driven operation, deep SNNs (both fully connected and convolutional) trained with our method achieve accuracy equivalent with conventional neural networks. In the N-MNIST example, equivalent accuracy is achieved with about five times fewer computational operations.

Spike Code Flow in Cultured Neuronal Networks.

Science.gov (United States)

Tamura, Shinichi; Nishitani, Yoshi; Hosokawa, Chie; Miyoshi, Tomomitsu; Sawai, Hajime; Kamimura, Takuya; Yagi, Yasushi; Mizuno-Matsumoto, Yuko; Chen, Yen-Wei

2016-01-01

We observed spike trains produced by one-shot electrical stimulation with 8 × 8 multielectrodes in cultured neuronal networks. Each electrode accepted spikes from several neurons. We extracted the short codes from spike trains and obtained a code spectrum with a nominal time accuracy of 1%. We then constructed code flow maps as movies of the electrode array to observe the code flow of "1101" and "1011," which are typical pseudorandom sequence such as that we often encountered in a literature and our experiments. They seemed to flow from one electrode to the neighboring one and maintained their shape to some extent. To quantify the flow, we calculated the "maximum cross-correlations" among neighboring electrodes, to find the direction of maximum flow of the codes with lengths less than 8. Normalized maximum cross-correlations were almost constant irrespective of code. Furthermore, if the spike trains were shuffled in interval orders or in electrodes, they became significantly small. Thus, the analysis suggested that local codes of approximately constant shape propagated and conveyed information across the network. Hence, the codes can serve as visible and trackable marks of propagating spike waves as well as evaluating information flow in the neuronal network.

Grain price spikes and beggar-thy-neighbor policy responses

DEFF Research Database (Denmark)

Jensen, Hans Grinsted; Anderson, Kym

2017-01-01

When prices spike in international grain markets, national governments often reduce the extent to which that spike affects their domestic food markets. Those actions exacerbate the price spike and international welfare transfer associated with that terms of trade change. Several recent analyses...

Validation of a colour rendering index based on memory colours

OpenAIRE

Smet, Kevin; Jost-Boissard, Sophie; Ryckaert, Wouter; Deconinck, Geert; Hanselaer, Peter

2010-01-01

In this paper the performance of a colour rendering index based on memory colours is investigated in comparison with the current CIE Colour Rendering Index, the NIST Colour Quality Scale and visual appreciation results obtained at CNRS at Lyon University for a set of 3000K and 4000K LED light sources. The Pearson and Spearman correlation coefficients between each colour rendering metric and the two sets of visual results were calculated. It was found that the memory colour based colour render...

Media Presentation Synchronisation for Non-monolithic Rendering Architectures

NARCIS (Netherlands)

I. Vaishnavi (Ishan); D.C.A. Bulterman (Dick); P.S. Cesar Garcia (Pablo Santiago); B. Gao (Bo)

2007-01-01

htmlabstractNon-monolithic renderers are physically distributed media playback engines. Non-monolithic renderers may use a number of different underlying network connection types to transmit media items belonging to a presentation. There is therefore a need for a media based and inter-network- type

Particle Transport and Size Sorting in Bubble Microstreaming Flow

Science.gov (United States)

Thameem, Raqeeb; Rallabandi, Bhargav; Wang, Cheng; Hilgenfeldt, Sascha

2014-11-01

Ultrasonic driving of sessile semicylindrical bubbles results in powerful steady streaming flows that are robust over a wide range of driving frequencies. In a microchannel, this flow field pattern can be fine-tuned to achieve size-sensitive sorting and trapping of particles at scales much smaller than the bubble itself; the sorting mechanism has been successfully described based on simple geometrical considerations. We investigate the sorting process in more detail, both experimentally (using new parameter variations that allow greater control over the sorting) and theoretically (incorporating the device geometry as well as the superimposed channel flow into an asymptotic theory). This results in optimized criteria for size sorting and a theoretical description that closely matches the particle behavior close to the bubble, the crucial region for size sorting.

Introduction to spiking neural networks: Information processing, learning and applications.

Science.gov (United States)

Ponulak, Filip; Kasinski, Andrzej

2011-01-01

The concept that neural information is encoded in the firing rate of neurons has been the dominant paradigm in neurobiology for many years. This paradigm has also been adopted by the theory of artificial neural networks. Recent physiological experiments demonstrate, however, that in many parts of the nervous system, neural code is founded on the timing of individual action potentials. This finding has given rise to the emergence of a new class of neural models, called spiking neural networks. In this paper we summarize basic properties of spiking neurons and spiking networks. Our focus is, specifically, on models of spike-based information coding, synaptic plasticity and learning. We also survey real-life applications of spiking models. The paper is meant to be an introduction to spiking neural networks for scientists from various disciplines interested in spike-based neural processing.

Extreme simplification and rendering of point sets using algebraic multigrid

NARCIS (Netherlands)

Reniers, D.; Telea, A.C.

2009-01-01

We present a novel approach for extreme simplification of point set models, in the context of real-time rendering. Point sets are often rendered using simple point primitives, such as oriented discs. However, this requires using many primitives to render even moderately simple shapes. Often, one

Volume rendering in treatment planning for moving targets

Energy Technology Data Exchange (ETDEWEB)

Gemmel, Alexander [GSI-Biophysics, Darmstadt (Germany); Massachusetts General Hospital, Boston (United States); Wolfgang, John A.; Chen, George T.Y. [Massachusetts General Hospital, Boston (United States)

2009-07-01

Advances in computer technologies have facilitated the development of tools for 3-dimensional visualization of CT-data sets with volume rendering. The company Fovia has introduced a high definition volume rendering engine (HDVR trademark by Fovia Inc., Palo Alto, USA) that is capable of representing large CT data sets with high user interactivity even on standard PCs. Fovia provides a software development kit (SDK) that offers control of all the features of the rendering engine. We extended the SDK by functionalities specific to the task of treatment planning for moving tumors. This included navigation of the patient's anatomy in beam's eye view, fast point-and-click measurement of lung tumor trajectories as well as estimation of range perturbations due to motion by calculation of (differential) water equivalent path lengths for protons and carbon ions on 4D-CT data sets. We present patient examples to demonstrate the advantages and disadvantages of volume rendered images as compared to standard 2-dimensional axial plane images. Furthermore, we show an example of a range perturbation analysis. We conclude that volume rendering is a powerful technique for the representation and analysis of large time resolved data sets in treatment planning.

Spiking irregularity and frequency modulate the behavioral report of single-neuron stimulation.

Science.gov (United States)

Doron, Guy; von Heimendahl, Moritz; Schlattmann, Peter; Houweling, Arthur R; Brecht, Michael

2014-02-05

The action potential activity of single cortical neurons can evoke measurable sensory effects, but it is not known how spiking parameters and neuronal subtypes affect the evoked sensations. Here, we examined the effects of spike train irregularity, spike frequency, and spike number on the detectability of single-neuron stimulation in rat somatosensory cortex. For regular-spiking, putative excitatory neurons, detectability increased with spike train irregularity and decreasing spike frequencies but was not affected by spike number. Stimulation of single, fast-spiking, putative inhibitory neurons led to a larger sensory effect compared to regular-spiking neurons, and the effect size depended only on spike irregularity. An ideal-observer analysis suggests that, under our experimental conditions, rats were using integration windows of a few hundred milliseconds or more. Our data imply that the behaving animal is sensitive to single neurons' spikes and even to their temporal patterning. Copyright © 2014 Elsevier Inc. All rights reserved.

Error-backpropagation in temporally encoded networks of spiking neurons

NARCIS (Netherlands)

S.M. Bohte (Sander); J.A. La Poutré (Han); J.N. Kok (Joost)

2000-01-01

textabstractFor a network of spiking neurons that encodes information in the timing of individual spike-times, we derive a supervised learning rule, emph{SpikeProp, akin to traditional error-backpropagation and show how to overcome the discontinuities introduced by thresholding. With this algorithm,

Fast DRR splat rendering using common consumer graphics hardware

International Nuclear Information System (INIS)

Spoerk, Jakob; Bergmann, Helmar; Wanschitz, Felix; Dong, Shuo; Birkfellner, Wolfgang

2007-01-01

Digitally rendered radiographs (DRR) are a vital part of various medical image processing applications such as 2D/3D registration for patient pose determination in image-guided radiotherapy procedures. This paper presents a technique to accelerate DRR creation by using conventional graphics hardware for the rendering process. DRR computation itself is done by an efficient volume rendering method named wobbled splatting. For programming the graphics hardware, NVIDIAs C for Graphics (Cg) is used. The description of an algorithm used for rendering DRRs on the graphics hardware is presented, together with a benchmark comparing this technique to a CPU-based wobbled splatting program. Results show a reduction of rendering time by about 70%-90% depending on the amount of data. For instance, rendering a volume of 2x10 6 voxels is feasible at an update rate of 38 Hz compared to 6 Hz on a common Intel-based PC using the graphics processing unit (GPU) of a conventional graphics adapter. In addition, wobbled splatting using graphics hardware for DRR computation provides higher resolution DRRs with comparable image quality due to special processing characteristics of the GPU. We conclude that DRR generation on common graphics hardware using the freely available Cg environment is a major step toward 2D/3D registration in clinical routine

Spike Pattern Structure Influences Synaptic Efficacy Variability Under STDP and Synaptic Homeostasis. I: Spike Generating Models on Converging Motifs

Directory of Open Access Journals (Sweden)

Zedong eBi

2016-02-01

Full Text Available In neural systems, synaptic plasticity is usually driven by spike trains. Due to the inherent noises of neurons and synapses as well as the randomness of connection details, spike trains typically exhibit variability such as spatial randomness and temporal stochasticity, resulting in variability of synaptic changes under plasticity, which we call efficacy variability. How the variability of spike trains influences the efficacy variability of synapses remains unclear. In this paper, we try to understand this influence under pair-wise additive spike-timing dependent plasticity (STDP when the mean strength of plastic synapses into a neuron is bounded (synaptic homeostasis. Specifically, we systematically study, analytically and numerically, how four aspects of statistical features, i.e. synchronous firing, burstiness/regularity, heterogeneity of rates and heterogeneity of cross-correlations, as well as their interactions influence the efficacy variability in converging motifs (simple networks in which one neuron receives from many other neurons. Neurons (including the post-synaptic neuron in a converging motif generate spikes according to statistical models with tunable parameters. In this way, we can explicitly control the statistics of the spike patterns, and investigate their influence onto the efficacy variability, without worrying about the feedback from synaptic changes onto the dynamics of the post-synaptic neuron. We separate efficacy variability into two parts: the drift part (DriftV induced by the heterogeneity of change rates of different synapses, and the diffusion part (DiffV induced by weight diffusion caused by stochasticity of spike trains. Our main findings are: (1 synchronous firing and burstiness tend to increase DiffV, (2 heterogeneity of rates induces DriftV when potentiation and depression in STDP are not balanced, and (3 heterogeneity of cross-correlations induces DriftV together with heterogeneity of rates. We anticipate our

Mimickers of generalized spike and wave discharges.

Science.gov (United States)

Azzam, Raed; Bhatt, Amar B

2014-06-01

Overinterpretation of benign EEG variants is a common problem that can lead to the misdiagnosis of epilepsy. We review four normal patterns that mimic generalized spike and wave discharges: phantom spike-and-wave, hyperventilation hypersynchrony, hypnagogic/ hypnopompic hypersynchrony, and mitten patterns.

A Cross-Correlated Delay Shift Supervised Learning Method for Spiking Neurons with Application to Interictal Spike Detection in Epilepsy.

Science.gov (United States)

Guo, Lilin; Wang, Zhenzhong; Cabrerizo, Mercedes; Adjouadi, Malek

2017-05-01

This study introduces a novel learning algorithm for spiking neurons, called CCDS, which is able to learn and reproduce arbitrary spike patterns in a supervised fashion allowing the processing of spatiotemporal information encoded in the precise timing of spikes. Unlike the Remote Supervised Method (ReSuMe), synapse delays and axonal delays in CCDS are variants which are modulated together with weights during learning. The CCDS rule is both biologically plausible and computationally efficient. The properties of this learning rule are investigated extensively through experimental evaluations in terms of reliability, adaptive learning performance, generality to different neuron models, learning in the presence of noise, effects of its learning parameters and classification performance. Results presented show that the CCDS learning method achieves learning accuracy and learning speed comparable with ReSuMe, but improves classification accuracy when compared to both the Spike Pattern Association Neuron (SPAN) learning rule and the Tempotron learning rule. The merit of CCDS rule is further validated on a practical example involving the automated detection of interictal spikes in EEG records of patients with epilepsy. Results again show that with proper encoding, the CCDS rule achieves good recognition performance.

The Q sort theory and technique.

Science.gov (United States)

Nyatanga, L

1989-10-01

This paper is based on the author's experience of using the Q sort technique with BA Social Sciences (BASS) students, and the community psychiatric nursing (CPN, ENB No 811 course). The paper focuses on two main issues: 1. The theoretical assumptions underpinning the Q Sort technique. Carl Rogers' self theory and some of the values of humanistic psychology are summarised. 2. The actual technique procedure and meaning of results are highlighted. As the Q Sort technique is potentially useful in a variety of sittings some of which are listed in this paper, the emphasis has deliberately been placed in understanding the theoretical underpinning and the operationalisation (sensitive interpretation) of the theory to practice.

Event shape sorting

International Nuclear Information System (INIS)

Kopecna, Renata; Tomasik, Boris

2016-01-01

We propose a novel method for sorting events of multiparticle production according to the azimuthal anisotropy of their momentum distribution. Although the method is quite general, we advocate its use in analysis of ultra-relativistic heavy-ion collisions where a large number of hadrons is produced. The advantage of our method is that it can automatically sort out samples of events with histograms that indicate similar distributions of hadrons. It takes into account the whole measured histograms with all orders of anisotropy instead of a specific observable (e.g., v 2 , v 3 , q 2 ). It can be used for more exclusive experimental studies of flow anisotropies which are then more easily compared to theoretical calculations. It may also be useful in the construction of mixed-events background for correlation studies as it allows to select events with similar momentum distribution. (orig.)

Multiplexed Spike Coding and Adaptation in the Thalamus

Directory of Open Access Journals (Sweden)

Rebecca A. Mease

2017-05-01

Full Text Available High-frequency “burst” clusters of spikes are a generic output pattern of many neurons. While bursting is a ubiquitous computational feature of different nervous systems across animal species, the encoding of synaptic inputs by bursts is not well understood. We find that bursting neurons in the rodent thalamus employ “multiplexing” to differentially encode low- and high-frequency stimulus features associated with either T-type calcium “low-threshold” or fast sodium spiking events, respectively, and these events adapt differently. Thus, thalamic bursts encode disparate information in three channels: (1 burst size, (2 burst onset time, and (3 precise spike timing within bursts. Strikingly, this latter “intraburst” encoding channel shows millisecond-level feature selectivity and adapts across statistical contexts to maintain stable information encoded per spike. Consequently, calcium events both encode low-frequency stimuli and, in parallel, gate a transient window for high-frequency, adaptive stimulus encoding by sodium spike timing, allowing bursts to efficiently convey fine-scale temporal information.

Implementing Signature Neural Networks with Spiking Neurons.

Science.gov (United States)

Carrillo-Medina, José Luis; Latorre, Roberto

2016-01-01

Spiking Neural Networks constitute the most promising approach to develop realistic Artificial Neural Networks (ANNs). Unlike traditional firing rate-based paradigms, information coding in spiking models is based on the precise timing of individual spikes. It has been demonstrated that spiking ANNs can be successfully and efficiently applied to multiple realistic problems solvable with traditional strategies (e.g., data classification or pattern recognition). In recent years, major breakthroughs in neuroscience research have discovered new relevant computational principles in different living neural systems. Could ANNs benefit from some of these recent findings providing novel elements of inspiration? This is an intriguing question for the research community and the development of spiking ANNs including novel bio-inspired information coding and processing strategies is gaining attention. From this perspective, in this work, we adapt the core concepts of the recently proposed Signature Neural Network paradigm-i.e., neural signatures to identify each unit in the network, local information contextualization during the processing, and multicoding strategies for information propagation regarding the origin and the content of the data-to be employed in a spiking neural network. To the best of our knowledge, none of these mechanisms have been used yet in the context of ANNs of spiking neurons. This paper provides a proof-of-concept for their applicability in such networks. Computer simulations show that a simple network model like the discussed here exhibits complex self-organizing properties. The combination of multiple simultaneous encoding schemes allows the network to generate coexisting spatio-temporal patterns of activity encoding information in different spatio-temporal spaces. As a function of the network and/or intra-unit parameters shaping the corresponding encoding modality, different forms of competition among the evoked patterns can emerge even in the absence

Responses of Escherichia coli, Listeria monocytogenes, and Staphylococcus aureus to Simulated Food Processing Treatments, Determined Using Fluorescence-Activated Cell Sorting and Plate Counting▿

Science.gov (United States)

Kennedy, Deirdre; Cronin, Ultan P.; Wilkinson, Martin G.

2011-01-01

Three common food pathogenic microorganisms were exposed to treatments simulating those used in food processing. Treated cell suspensions were then analyzed for reduction in growth by plate counting. Flow cytometry (FCM) and fluorescence-activated cell sorting (FACS) were carried out on treated cells stained for membrane integrity (Syto 9/propidium iodide) or the presence of membrane potential [DiOC2(3)]. For each microbial species, representative cells from various subpopulations detected by FCM were sorted onto selective and nonselective agar and evaluated for growth and recovery rates. In general, treatments giving rise to the highest reductions in counts also had the greatest effects on cell membrane integrity and membrane potential. Overall, treatments that impacted cell membrane permeability did not necessarily have a comparable effect on membrane potential. In addition, some bacterial species with extensively damaged membranes, as detected by FCM, appeared to be able to replicate and grow after sorting. Growth of sorted cells from various subpopulations was not always reflected in plate counts, and in some cases the staining protocol may have rendered cells unculturable. Optimized FCM protocols generated a greater insight into the extent of the heterogeneous bacterial population responses to food control measures than did plate counts. This study underlined the requirement to use FACS to relate various cytometric profiles generated by various staining protocols with the ability of cells to grow on microbial agar plates. Such information is a prerequisite for more-widespread adoption of FCM as a routine microbiological analytical technique. PMID:21602370

Effect of heavy metals on pH buffering capacity and solubility of Ca, Mg, K, and P in non-spiked and heavy metal-spiked soils.

Science.gov (United States)

Najafi, Sarvenaz; Jalali, Mohsen

2016-06-01

In many parts of the world, soil acidification and heavy metal contamination has become a serious concern due to the adverse effects on chemical properties of soil and crop yield. The aim of this study was to investigate the effect of pH (in the range of 1 to 3 units above and below the native pH of soils) on calcium (Ca), magnesium (Mg), potassium (K), and phosphorus (P) solubility in non-spiked and heavy metal-spiked soil samples. Spiked samples were prepared by cadmium (Cd), copper (Cu), nickel (Ni), and zinc (Zn) as chloride salts and incubating soils for 40 days. The pH buffering capacity (pHBC) of each sample was determined by plotting the amount of H(+) or OH(-) added (mmol kg(-1)) versus the related pH value. The pHBC of soils ranged from 47.1 to 1302.5 mmol kg(-1) for non-spiked samples and from 45.0 to 1187.4 mmol kg(-1) for spiked soil samples. The pHBC values were higher in soil 2 (non-spiked and spiked) which had higher calcium carbonate content. The results indicated the presence of heavy metals in soils generally decreased the solution pH and pHBC values in spiked samples. In general, solubility of Ca, Mg, and K decreased with increasing equilibrium pH of non-spiked and spiked soil samples. In the case of P, increasing the pH to about 7, decreased the solubility in all soils but further increase of pH from 7, enhanced P solubility. The solubility trends and values for Ca, Mg, and K did not differed significantly in non-spiked and spiked samples. But in the case of P, a reduction in solubility was observed in heavy metal-spiked soils. The information obtained in this study can be useful to make better estimation of the effects of soil pollutants on anion and cation solubility from agricultural and environmental viewpoints.

3D rendering and interactive visualization technology in large industry CT

International Nuclear Information System (INIS)

Xiao Yongshun; Zhang Li; Chen Zhiqiang; Kang Kejun

2002-01-01

The author introduces the applications of interactive 3D rendering technology in the large ICT. It summarizes and comments on the iso-surfaces rendering and the direct volume rendering methods used in ICT. The author emphasizes on the technical analysis of the 3D rendering process of ICT volume data sets, and summarizes the difficulties of the inspection subsystem design in large ICT

3D rendering and interactive visualization technology in large industry CT

International Nuclear Information System (INIS)

Xiao Yongshun; Zhang Li; Chen Zhiqiang; Kang Kejun

2001-01-01

This paper introduces the applications of interactive 3D rendering technology in the large ICT. It summarizes and comments on the iso-surfaces rendering and the direct volume rendering methods used in ICT. The paper emphasizes on the technical analysis of the 3D rendering process of ICT volume data sets, and summarizes the difficulties of the inspection subsystem design in large ICT

The Mutation Frequency in Different Spike Categories in Barley

DEFF Research Database (Denmark)

Frydenberg, O.; Doll, Hans; Sandfær, J.

1964-01-01

After gamma irradiation of barley seeds, a comparison has been made between the chlorophyll-mutant frequencies in X1 spikes that had multicellular bud meristems in the seeds at the time of treatment (denoted as pre-formed spikes) and X1 spikes having no recognizable meristems at the time...

A Real-Time Sound Field Rendering Processor

Directory of Open Access Journals (Sweden)

Tan Yiyu

2017-12-01

Full Text Available Real-time sound field renderings are computationally intensive and memory-intensive. Traditional rendering systems based on computer simulations suffer from memory bandwidth and arithmetic units. The computation is time-consuming, and the sample rate of the output sound is low because of the long computation time at each time step. In this work, a processor with a hybrid architecture is proposed to speed up computation and improve the sample rate of the output sound, and an interface is developed for system scalability through simply cascading many chips to enlarge the simulated area. To render a three-minute Beethoven wave sound in a small shoe-box room with dimensions of 1.28 m × 1.28 m × 0.64 m, the field programming gate array (FPGA-based prototype machine with the proposed architecture carries out the sound rendering at run-time while the software simulation with the OpenMP parallelization takes about 12.70 min on a personal computer (PC with 32 GB random access memory (RAM and an Intel i7-6800K six-core processor running at 3.4 GHz. The throughput in the software simulation is about 194 M grids/s while it is 51.2 G grids/s in the prototype machine even if the clock frequency of the prototype machine is much lower than that of the PC. The rendering processor with a processing element (PE and interfaces consumes about 238,515 gates after fabricated by the 0.18 µm processing technology from the ROHM semiconductor Co., Ltd. (Kyoto Japan, and the power consumption is about 143.8 mW.

Simplification of Visual Rendering in Simulated Prosthetic Vision Facilitates Navigation.

Science.gov (United States)

Vergnieux, Victor; Macé, Marc J-M; Jouffrais, Christophe

2017-09-01

Visual neuroprostheses are still limited and simulated prosthetic vision (SPV) is used to evaluate potential and forthcoming functionality of these implants. SPV has been used to evaluate the minimum requirement on visual neuroprosthetic characteristics to restore various functions such as reading, objects and face recognition, object grasping, etc. Some of these studies focused on obstacle avoidance but only a few investigated orientation or navigation abilities with prosthetic vision. The resolution of current arrays of electrodes is not sufficient to allow navigation tasks without additional processing of the visual input. In this study, we simulated a low resolution array (15 × 18 electrodes, similar to a forthcoming generation of arrays) and evaluated the navigation abilities restored when visual information was processed with various computer vision algorithms to enhance the visual rendering. Three main visual rendering strategies were compared to a control rendering in a wayfinding task within an unknown environment. The control rendering corresponded to a resizing of the original image onto the electrode array size, according to the average brightness of the pixels. In the first rendering strategy, vision distance was limited to 3, 6, or 9 m, respectively. In the second strategy, the rendering was not based on the brightness of the image pixels, but on the distance between the user and the elements in the field of view. In the last rendering strategy, only the edges of the environments were displayed, similar to a wireframe rendering. All the tested renderings, except the 3 m limitation of the viewing distance, improved navigation performance and decreased cognitive load. Interestingly, the distance-based and wireframe renderings also improved the cognitive mapping of the unknown environment. These results show that low resolution implants are usable for wayfinding if specific computer vision algorithms are used to select and display appropriate

Orthobunyavirus ultrastructure and the curious tripodal glycoprotein spike.

Directory of Open Access Journals (Sweden)

Thomas A Bowden

Full Text Available The genus Orthobunyavirus within the family Bunyaviridae constitutes an expanding group of emerging viruses, which threaten human and animal health. Despite the medical importance, little is known about orthobunyavirus structure, a prerequisite for understanding virus assembly and entry. Here, using electron cryo-tomography, we report the ultrastructure of Bunyamwera virus, the prototypic member of this genus. Whilst Bunyamwera virions are pleomorphic in shape, they display a locally ordered lattice of glycoprotein spikes. Each spike protrudes 18 nm from the viral membrane and becomes disordered upon introduction to an acidic environment. Using sub-tomogram averaging, we derived a three-dimensional model of the trimeric pre-fusion glycoprotein spike to 3-nm resolution. The glycoprotein spike consists mainly of the putative class-II fusion glycoprotein and exhibits a unique tripod-like arrangement. Protein-protein contacts between neighbouring spikes occur at membrane-proximal regions and intra-spike contacts at membrane-distal regions. This trimeric assembly deviates from previously observed fusion glycoprotein arrangements, suggesting a greater than anticipated repertoire of viral fusion glycoprotein oligomerization. Our study provides evidence of a pH-dependent conformational change that occurs during orthobunyaviral entry into host cells and a blueprint for the structure of this group of emerging pathogens.

Independent component analysis separates spikes of different origin in the EEG.

Science.gov (United States)

Urrestarazu, Elena; Iriarte, Jorge; Artieda, Julio; Alegre, Manuel; Valencia, Miguel; Viteri, César

2006-02-01

Independent component analysis (ICA) is a novel system that finds independent sources in recorded signals. Its usefulness in separating epileptiform activity of different origin has not been determined. The goal of this study was to demonstrate that ICA is useful for separating different spikes using samples of EEG of patients with focal epilepsy. Digital EEG samples from four patients with focal epilepsy were included. The patients had temporal (n = 2), centrotemporal (n = 1) or frontal spikes (n = 1). Twenty-six samples with two (or more) spikes from two different patients were created. The selection of the two spikes for each mixed EEG was performed randomly, trying to have all the different combinations and rejecting the mixture of two spikes from the same patient. Two different examiners studied the EEGs using ICA with JADE paradigm in Matlab platform, trying to separate and to identify the spikes. They agreed in the correct separation of the spikes in 24 of the 26 samples, classifying the spikes as frontal, temporal or centrotemporal, left or right sided. The demonstration of the possibility of detecting different artificially mixed spikes confirms that ICA may be useful in separating spikes or other elements in real EEGs.

Development of sorting system control using LABVIEW

International Nuclear Information System (INIS)

Azraf Azman; Mohd Arif Hamzah; Noriah Mod Ali; John Konsoh; Mohd Idris Taib; Maslina Mohd Ibrahim; Nor Arymaswati Abdullah; Abu Bakar Mhd Ghazali

2005-01-01

The development of the Personnel Dosimeter Sorting System, proposed by the Secondary Standard Dosimetry Laboratory (SSDL) is to enhance the system or work flow in preparing the personnel dosimeter. The main objective of the system is to reduce stamping error, time and cost. The Personnel Dosimeter Sorting System is a semi-automatic system with an interfacing method using the Advantec 32 bit PCI interface card of 64 digital input and output. The system is integrated with the Labview version 7.1 programming language to control the sorting system and operation. (Author)

Blender cycles lighting and rendering cookbook

CERN Document Server

Iraci, Bernardo

2013-01-01

An in-depth guide full of step-by-step recipes to explore the concepts behind the usage of Cycles. Packed with illustrations, and lots of tips and tricks; the easy-to-understand nature of the book will help the reader understand even the most complex concepts with ease.If you are a digital artist who already knows your way around Blender, and you want to learn about the new Cycles' rendering engine, this is the book for you. Even experts will be able to pick up new tips and tricks to make the most of the rendering capabilities of Cycles.

Spiking and bursting patterns of fractional-order Izhikevich model

Science.gov (United States)

Teka, Wondimu W.; Upadhyay, Ranjit Kumar; Mondal, Argha

2018-03-01

Bursting and spiking oscillations play major roles in processing and transmitting information in the brain through cortical neurons that respond differently to the same signal. These oscillations display complex dynamics that might be produced by using neuronal models and varying many model parameters. Recent studies have shown that models with fractional order can produce several types of history-dependent neuronal activities without the adjustment of several parameters. We studied the fractional-order Izhikevich model and analyzed different kinds of oscillations that emerge from the fractional dynamics. The model produces a wide range of neuronal spike responses, including regular spiking, fast spiking, intrinsic bursting, mixed mode oscillations, regular bursting and chattering, by adjusting only the fractional order. Both the active and silent phase of the burst increase when the fractional-order model further deviates from the classical model. For smaller fractional order, the model produces memory dependent spiking activity after the pulse signal turned off. This special spiking activity and other properties of the fractional-order model are caused by the memory trace that emerges from the fractional-order dynamics and integrates all the past activities of the neuron. On the network level, the response of the neuronal network shifts from random to scale-free spiking. Our results suggest that the complex dynamics of spiking and bursting can be the result of the long-term dependence and interaction of intracellular and extracellular ionic currents.

Spike Bursts from an Excitable Optical System

Science.gov (United States)

Rios Leite, Jose R.; Rosero, Edison J.; Barbosa, Wendson A. S.; Tredicce, Jorge R.

Diode Lasers with double optical feedback are shown to present power drop spikes with statistical distribution controllable by the ratio of the two feedback times. The average time between spikes and the variance within long time series are studied. The system is shown to be excitable and present bursting of spikes created with specific feedback time ratios and strength. A rate equation model, extending the Lang-Kobayashi single feedback for semiconductor lasers proves to match the experimental observations. Potential applications to construct network to mimic neural systems having controlled bursting properties in each unit will be discussed. Brazilian Agency CNPQ.

Sorting and selection in posets

DEFF Research Database (Denmark)

Daskalakis, Constantinos; Karp, Richard M.; Mossel, Elchanan

2011-01-01

from two decades ago by Faigle and Turán. In particular, we present the first algorithm that sorts a width-$w$ poset of size $n$ with query complexity $O(n(w+\\log n))$ and prove that this query complexity is asymptotically optimal. We also describe a variant of Mergesort with query complexity $O......(wn\\log\\frac{n}{w})$ and total complexity $O(w^{2}n\\log\\frac{n}{w})$; an algorithm with the same query complexity was given by Faigle and Turán, but no efficient implementation of that algorithm is known. Both our sorting algorithms can be applied with negligible overhead to the more general problem of reconstructing transitive......Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study these problems in the context of partially ordered sets, in which some pairs of objects are incomparable. This generalization is interesting from a combinatorial...

Spike Code Flow in Cultured Neuronal Networks

Directory of Open Access Journals (Sweden)

Shinichi Tamura

2016-01-01

Full Text Available We observed spike trains produced by one-shot electrical stimulation with 8 × 8 multielectrodes in cultured neuronal networks. Each electrode accepted spikes from several neurons. We extracted the short codes from spike trains and obtained a code spectrum with a nominal time accuracy of 1%. We then constructed code flow maps as movies of the electrode array to observe the code flow of “1101” and “1011,” which are typical pseudorandom sequence such as that we often encountered in a literature and our experiments. They seemed to flow from one electrode to the neighboring one and maintained their shape to some extent. To quantify the flow, we calculated the “maximum cross-correlations” among neighboring electrodes, to find the direction of maximum flow of the codes with lengths less than 8. Normalized maximum cross-correlations were almost constant irrespective of code. Furthermore, if the spike trains were shuffled in interval orders or in electrodes, they became significantly small. Thus, the analysis suggested that local codes of approximately constant shape propagated and conveyed information across the network. Hence, the codes can serve as visible and trackable marks of propagating spike waves as well as evaluating information flow in the neuronal network.

Three-dimensional rendering of segmented object using matlab - biomed 2010.

Science.gov (United States)

Anderson, Jeffrey R; Barrett, Steven F

2010-01-01

The three-dimensional rendering of microscopic objects is a difficult and challenging task that often requires specialized image processing techniques. Previous work has been described of a semi-automatic segmentation process of fluorescently stained neurons collected as a sequence of slice images with a confocal laser scanning microscope. Once properly segmented, each individual object can be rendered and studied as a three-dimensional virtual object. This paper describes the work associated with the design and development of Matlab files to create three-dimensional images from the segmented object data previously mentioned. Part of the motivation for this work is to integrate both the segmentation and rendering processes into one software application, providing a seamless transition from the segmentation tasks to the rendering and visualization tasks. Previously these tasks were accomplished on two different computer systems, windows and Linux. This transition basically limits the usefulness of the segmentation and rendering applications to those who have both computer systems readily available. The focus of this work is to create custom Matlab image processing algorithms for object rendering and visualization, and merge these capabilities to the Matlab files that were developed especially for the image segmentation task. The completed Matlab application will contain both the segmentation and rendering processes in a single graphical user interface, or GUI. This process for rendering three-dimensional images in Matlab requires that a sequence of two-dimensional binary images, representing a cross-sectional slice of the object, be reassembled in a 3D space, and covered with a surface. Additional segmented objects can be rendered in the same 3D space. The surface properties of each object can be varied by the user to aid in the study and analysis of the objects. This inter-active process becomes a powerful visual tool to study and understand microscopic objects.

Real-Time Location-Based Rendering of Urban Underground Pipelines

Directory of Open Access Journals (Sweden)

Wei Li

2018-01-01

Full Text Available The concealment and complex spatial relationships of urban underground pipelines present challenges in managing them. Recently, augmented reality (AR has been a hot topic around the world, because it can enhance our perception of reality by overlaying information about the environment and its objects onto the real world. Using AR, underground pipelines can be displayed accurately, intuitively, and in real time. We analyzed the characteristics of AR and their application in underground pipeline management. We mainly focused on the AR pipeline rendering procedure based on the BeiDou Navigation Satellite System (BDS and simultaneous localization and mapping (SLAM technology. First, in aiming to improve the spatial accuracy of pipeline rendering, we used differential corrections received from the Ground-Based Augmentation System to compute the precise coordinates of users in real time, which helped us accurately retrieve and draw pipelines near the users, and by scene recognition the accuracy can be further improved. Second, in terms of pipeline rendering, we used Visual-Inertial Odometry (VIO to track the rendered objects and made some improvements to visual effects, which can provide steady dynamic tracking of pipelines even in relatively markerless environments and outdoors. Finally, we used the occlusion method based on real-time 3D reconstruction to realistically express the immersion effect of underground pipelines. We compared our methods to the existing methods and concluded that the method proposed in this research improves the spatial accuracy of pipeline rendering and the portability of the equipment. Moreover, the updating of our rendering procedure corresponded with the moving of the user’s location, thus we achieved a dynamic rendering of pipelines in the real environment.

MODELING WORK OF SORTING STATION USING UML

Directory of Open Access Journals (Sweden)

O. V. Gorbova

2014-12-01

Full Text Available Purpose. The purpose of this paper is the construction of methods and models for the graphical representation process of sorting station, using the unified modeling language (UML. Methodology. Methods of graph theory, finite automata and the representation theory of queuing systems were used as the methods of investigation. A graphical representation of the process was implemented with using the Unified Modeling Language UML. The sorting station process representation is implemented as a state diagram and actions through a set of IBM Rational Rose. Graphs can show parallel operation of sorting station, the parallel existence and influence of objects process and the transition from one state to another. The IBM Rational Rose complex allows developing a diagram of work sequence of varying degrees of detailing. Findings. The study has developed a graphical representation method of the process of sorting station of different kind of complexity. All graphical representations are made using the UML. They are represented as a directed graph with the states. It is clear enough in the study of the subject area. Applying the methodology of the representation process, it allows becoming friendly with the work of any automation object very fast, and exploring the process during algorithms construction of sorting stations and other railway facilities. This model is implemented with using the Unified Modeling Language (UML using a combination of IBM Rational Rose. Originality. The representation process of sorting station was developed by means of the Unified Modeling Language (UML use. Methodology of representation process allows creating the directed graphs based on the order of execution of the works chain, objects and performers of these works. The UML allows visualizing, specifying, constructing and documenting, formalizing the representation process of sorting station and developing sequence diagrams of works of varying degrees of detail. Practical

Cloning of Plasmodium falciparum by single-cell sorting.

Science.gov (United States)

Miao, Jun; Li, Xiaolian; Cui, Liwang

2010-10-01

Malaria parasite cloning is traditionally carried out mainly by using the limiting dilution method, which is laborious, imprecise, and unable to distinguish multiply-infected RBCs. In this study, we used a parasite engineered to express green fluorescent protein (GFP) to evaluate a single-cell sorting method for rapidly cloning Plasmodium falciparum. By dividing a two-dimensional scattergram from a cell sorter into 17 gates, we determined the parameters for isolating singly-infected erythrocytes and sorted them into individual cultures. Pre-gating of the engineered parasites for GFP allowed the isolation of almost 100% GFP-positive clones. Compared with the limiting dilution method, the number of parasite clones obtained by single-cell sorting was much higher. Molecular analyses showed that parasite isolates obtained by single-cell sorting were highly homogenous. This highly efficient single-cell sorting method should prove very useful for cloning both P. falciparum laboratory populations from genetic manipulation experiments and clinical samples. Copyright 2010 Elsevier Inc. All rights reserved.

Cloning of Plasmodium falciparum by single-cell sorting

Science.gov (United States)

Miao, Jun; Li, Xiaolian; Cui, Liwang

2010-01-01

Malaria parasite cloning is traditionally carried out mainly by using the limiting dilution method, which is laborious, imprecise, and unable to distinguish multiply-infected RBCs. In this study, we used a parasite engineered to express green fluorescent protein (GFP) to evaluate a single-cell sorting method for rapidly cloning Plasmodium falciparum. By dividing a two dimensional scattergram from a cell sorter into 17 gates, we determined the parameters for isolating singly-infected erythrocytes and sorted them into individual cultures. Pre-gating of the engineered parasites for GFP allowed the isolation of almost 100% GFP-positive clones. Compared with the limiting dilution method, the number of parasite clones obtained by single-cell sorting was much higher. Molecular analyses showed that parasite isolates obtained by single-cell sorting were highly homogenous. This highly efficient single-cell sorting method should prove very useful for cloning both P. falciparum laboratory populations from genetic manipulation experiments and clinical samples. PMID:20435038

Automatic fitting of spiking neuron models to electrophysiological recordings

Directory of Open Access Journals (Sweden)

Cyrille Rossant

2010-03-01

Full Text Available Spiking models can accurately predict the spike trains produced by cortical neurons in response to somatically injected currents. Since the specific characteristics of the model depend on the neuron, a computational method is required to fit models to electrophysiological recordings. The fitting procedure can be very time consuming both in terms of computer simulations and in terms of code writing. We present algorithms to fit spiking models to electrophysiological data (time-varying input and spike trains that can run in parallel on graphics processing units (GPUs. The model fitting library is interfaced with Brian, a neural network simulator in Python. If a GPU is present it uses just-in-time compilation to translate model equations into optimized code. Arbitrary models can then be defined at script level and run on the graphics card. This tool can be used to obtain empirically validated spiking models of neurons in various systems. We demonstrate its use on public data from the INCF Quantitative Single-Neuron Modeling 2009 competition by comparing the performance of a number of neuron spiking models.

Passive sorting of capsules by deformability

Science.gov (United States)

Haener, Edgar; Juel, Anne

We study passive sorting according to deformability of liquid-filled ovalbumin-alginate capsules. We present results for two sorting geometries: a straight channel with a half-cylindrical obstruction and a pinched flow fractioning device (PFF) adapted for use with capsules. In the half-cylinder device, the capsules deform as they encounter the obstruction, and travel around the half-cylinder. The distance from the capsule's centre of mass to the surface of the half-cylinder depends on deformability, and separation between capsules of different deformability is amplified by diverging streamlines in the channel expansion downstream of the obstruction. We show experimentally that capsules can be sorted according to deformability with their downstream position depending on capillary number only, and we establish the sensitivity of the device to experimental variability. In the PFF device, particles are compressed against a wall using a strong pinching flow. We show that capsule deformation increases with the intensity of the pinching flow, but that the downstream capsule position is not set by deformation in the device. However, when using the PFF device like a T-Junction, we achieve improved sorting resolution compared to the half-cylinder device.

Scaling of spiking and humping in keyhole welding

Energy Technology Data Exchange (ETDEWEB)

Wei, P S; Chuang, K C [Department of Mechanical and Electro-Mechanical Engineering, National Sun Yat-Sen University, Kaohsiung, Taiwan (China); DebRoy, T [Department of Materials Science and Engineering, The Pennsylvania State University, University Park, PA 16802 (United States); Ku, J S, E-mail: pswei@mail.nsysu.edu.tw, E-mail: cielo.zhuang@gmail.com, E-mail: rtd1@psu.edu, E-mail: jsku@mail.nsysu.edu.tw [Institute of Materials Science and Engineering, National Sun Yat-Sen University, Kaohsiung, Taiwan (China)

2011-06-22

Spiking, rippling and humping seriously reduce the strength of welds. The effects of beam focusing, volatile alloying element concentration and welding velocity on spiking, coarse rippling and humping in keyhole mode electron-beam welding are examined through scale analysis. Although these defects have been studied in the past, the mechanisms for their formation are not fully understood. This work relates the average amplitudes of spikes to fusion zone depth for the welding of Al 6061, SS 304 and carbon steel, and Al 5083. The scale analysis introduces welding and melting efficiencies and an appropriate power distribution to account for the focusing effects, and the energy which is reflected and escapes through the keyhole opening to the surroundings. The frequency of humping and spiking can also be predicted from the scale analysis. The analysis also reveals the interrelation between coarse rippling and humping. The data and the mechanistic findings reported in this study are useful for understanding and preventing spiking and humping during keyhole mode electron and laser beam welding.

A metric space approach to the information capacity of spike trains

OpenAIRE

HOUGHTON, CONOR JAMES; GILLESPIE, JAMES

2010-01-01

PUBLISHED Classical information theory can be either discrete or continuous, corresponding to discrete or continuous random variables. However, although spike times in a spike train are described by continuous variables, the information content is usually calculated using discrete information theory. This is because the number of spikes, and hence, the number of variables, varies from spike train to spike train, making the continuous theory difficult to apply.It is possible to avoid ...

Clustering predicts memory performance in networks of spiking and non-spiking neurons

Directory of Open Access Journals (Sweden)

Weiliang eChen

2011-03-01

Full Text Available The problem we address in this paper is that of finding effective and parsimonious patterns of connectivity in sparse associative memories. This problem must be addressed in real neuronal systems, so that results in artificial systems could throw light on real systems. We show that there are efficient patterns of connectivity and that these patterns are effective in models with either spiking or non-spiking neurons. This suggests that there may be some underlying general principles governing good connectivity in such networks. We also show that the clustering of the network, measured by Clustering Coefficient, has a strong linear correlation to the performance of associative memory. This result is important since a purely static measure of network connectivity appears to determine an important dynamic property of the network.

On Sorting Genomes with DCJ and Indels

Science.gov (United States)

Braga, Marília D. V.

A previous work of Braga, Willing and Stoye compared two genomes with unequal content, but without duplications, and presented a new linear time algorithm to compute the genomic distance, considering double cut and join (DCJ) operations, insertions and deletions. Here we derive from this approach an algorithm to sort one genome into another one also using DCJ, insertions and deletions. The optimal sorting scenarios can have different compositions and we compare two types of sorting scenarios: one that maximizes and one that minimizes the number of DCJ operations with respect to the number of insertions and deletions.

Voltage-spike analysis for a free-running parallel inverter

Science.gov (United States)

Lee, F. C. Y.; Wilson, T. G.

1974-01-01

Unwanted and sometimes damaging high-amplitude voltage spikes occur during each half cycle in many transistor saturable-core inverters at the moment when the core saturates and the transistors switch. The analysis shows that spikes are an intrinsic characteristic of certain types of inverters even with negligible leakage inductance and purely resistive load. The small but unavoidable after-saturation inductance of the saturable-core transformer plays an essential role in creating these undesired thigh-voltage spikes. State-plane analysis provides insight into the complex interaction between core and transistors, and shows the circuit parameters upon which the magnitude of these spikes depends.

In-reactor creep of zirconium alloys by thermal spikes

International Nuclear Information System (INIS)

Ibrahim, E.F.

1975-01-01

The size and duration of thermal spikes from fast neutrons have been calculated for zirconium alloys, showing that spikes up to 1.8 nm radius may exist for 2 x 10 -11 s at greater than melting point, at 570K ambient temperature. Creep rates have been calculated assuming that the elastic strain from the applied stress relaxes in the volume of the spikes (by preferential loop alignment or modification of an existing dislocation network). The calculated rates are consistent with strain rates observed in long term tests-in-reactor, if spike lifetimes are 2 to 2.5 x 10 -11 s. (Auth.)

Automated spike preparation system for Isotope Dilution Mass Spectrometry (IDMS)

International Nuclear Information System (INIS)

Maxwell, S.L. III; Clark, J.P.

1990-01-01

Isotope Dilution Mass Spectrometry (IDMS) is a method frequently employed to measure dissolved, irradiated nuclear materials. A known quantity of a unique isotope of the element to be measured (referred to as the ''spike'') is added to the solution containing the analyte. The resulting solution is chemically purified then analyzed by mass spectrometry. By measuring the magnitude of the response for each isotope and the response for the ''unique spike'' then relating this to the known quantity of the ''spike'', the quantity of the nuclear material can be determined. An automated spike preparation system was developed at the Savannah River Site (SRS) to dispense spikes for use in IDMS analytical methods. Prior to this development, technicians weighed each individual spike manually to achieve the accuracy required. This procedure was time-consuming and subjected the master stock solution to evaporation. The new system employs a high precision SMI Model 300 Unipump dispenser interfaced with an electronic balance and a portable Epson HX-20 notebook computer to automate spike preparation

Spike-threshold adaptation predicted by membrane potential dynamics in vivo.

Directory of Open Access Journals (Sweden)

Bertrand Fontaine

2014-04-01

Full Text Available Neurons encode information in sequences of spikes, which are triggered when their membrane potential crosses a threshold. In vivo, the spiking threshold displays large variability suggesting that threshold dynamics have a profound influence on how the combined input of a neuron is encoded in the spiking. Threshold variability could be explained by adaptation to the membrane potential. However, it could also be the case that most threshold variability reflects noise and processes other than threshold adaptation. Here, we investigated threshold variation in auditory neurons responses recorded in vivo in barn owls. We found that spike threshold is quantitatively predicted by a model in which the threshold adapts, tracking the membrane potential at a short timescale. As a result, in these neurons, slow voltage fluctuations do not contribute to spiking because they are filtered by threshold adaptation. More importantly, these neurons can only respond to input spikes arriving together on a millisecond timescale. These results demonstrate that fast adaptation to the membrane potential captures spike threshold variability in vivo.

Algorithm 426 : Merge sort algorithm [M1

NARCIS (Netherlands)

Bron, C.

1972-01-01

Sorting by means of a two-way merge has a reputation of requiring a clerically complicated and cumbersome program. This ALGOL 60 procedure demonstrates that, using recursion, an elegant and efficient algorithm can be designed, the correctness of which is easily proved [2]. Sorting n objects gives

Magnethophoretic sorting of fluid catalytic cracking particles

NARCIS (Netherlands)

Solsona, Miguel; Nieuwelink, A. E.; Odijk, Mathieu; Meirer, Florian; Abelmann, Leon; Olthuis, Wouter; Weckhuysen, Bert M.; van den Berg, Albert; Lee, Abraham; DeVoe, Don

2017-01-01

We demonstrate an on-chip particle activity sorter, focused on iron concentration and based on magnetophoresis. This device was used for fast sorting of stepwise homogenously distributed [Fe]s. The preliminary results are very encouraging. We show that we can sort particles on magnetic moment, with

Emergent dynamics of spiking neurons with fluctuating threshold

Science.gov (United States)

Bhattacharjee, Anindita; Das, M. K.

2017-05-01

Role of fluctuating threshold on neuronal dynamics is investigated. The threshold function is assumed to follow a normal probability distribution. Standard deviation of inter-spike interval of the response is computed as an indicator of irregularity in spike emission. It has been observed that, the irregularity in spiking is more if the threshold variation is more. A significant change in modal characteristics of Inter Spike Intervals (ISI) is seen to occur as a function of fluctuation parameter. Investigation is further carried out for coupled system of neurons. Cooperative dynamics of coupled neurons are discussed in view of synchronization. Total and partial synchronization regimes are depicted with the help of contour plots of synchrony measure under various conditions. Results of this investigation may provide a basis for exploring the complexities of neural communication and brain functioning.

Sorting Tubules Regulate Blood-Brain Barrier Transcytosis

Directory of Open Access Journals (Sweden)

Roberto Villaseñor

2017-12-01

Full Text Available Transcytosis across the blood-brain barrier (BBB regulates key processes of the brain, but the intracellular sorting mechanisms that determine successful receptor-mediated transcytosis in brain endothelial cells (BECs remain unidentified. Here, we used Transferrin receptor-based Brain Shuttle constructs to investigate intracellular transport in BECs, and we uncovered a pathway for the regulation of receptor-mediated transcytosis. By combining live-cell imaging and mathematical modeling in vitro with super-resolution microscopy of the BBB, we show that intracellular tubules promote transcytosis across the BBB. A monovalent construct (sFab sorted for transcytosis was localized to intracellular tubules, whereas a bivalent construct (dFab sorted for degradation formed clusters with impaired transport along tubules. Manipulating tubule biogenesis by overexpressing the small GTPase Rab17 increased dFab transport into tubules and induced its transcytosis in BECs. We propose that sorting tubules regulate transcytosis in BECs and may be a general mechanism for receptor-mediated transport across the BBB.

Single-trial estimation of stimulus and spike-history effects on time-varying ensemble spiking activity of multiple neurons: a simulation study

International Nuclear Information System (INIS)

Shimazaki, Hideaki

2013-01-01

Neurons in cortical circuits exhibit coordinated spiking activity, and can produce correlated synchronous spikes during behavior and cognition. We recently developed a method for estimating the dynamics of correlated ensemble activity by combining a model of simultaneous neuronal interactions (e.g., a spin-glass model) with a state-space method (Shimazaki et al. 2012 PLoS Comput Biol 8 e1002385). This method allows us to estimate stimulus-evoked dynamics of neuronal interactions which is reproducible in repeated trials under identical experimental conditions. However, the method may not be suitable for detecting stimulus responses if the neuronal dynamics exhibits significant variability across trials. In addition, the previous model does not include effects of past spiking activity of the neurons on the current state of ensemble activity. In this study, we develop a parametric method for simultaneously estimating the stimulus and spike-history effects on the ensemble activity from single-trial data even if the neurons exhibit dynamics that is largely unrelated to these effects. For this goal, we model ensemble neuronal activity as a latent process and include the stimulus and spike-history effects as exogenous inputs to the latent process. We develop an expectation-maximization algorithm that simultaneously achieves estimation of the latent process, stimulus responses, and spike-history effects. The proposed method is useful to analyze an interaction of internal cortical states and sensory evoked activity

A many-sorted calculus based on resolution and paramodulation

CERN Document Server

Walther, Christoph

1987-01-01

A Many-Sorted Calculus Based on Resolution and Paramodulation emphasizes the utilization of advantages and concepts of many-sorted logic for resolution and paramodulation based automated theorem proving.This book considers some first-order calculus that defines how theorems from given hypotheses by pure syntactic reasoning are obtained, shifting all the semantic and implicit argumentation to the syntactic and explicit level of formal first-order reasoning. This text discusses the efficiency of many-sorted reasoning, formal preliminaries for the RP- and ?RP-calculus, and many-sorted term rewrit

The electric potential of tripolar spikes

Energy Technology Data Exchange (ETDEWEB)

Nocera, L. [Theoretical Plasma Physics, IPCF-CNR, Via Moruzzi 1, I-56124 Pisa (Italy)

2010-02-22

We present an analytical formula for the waveform of the electric potential associated with a tripolar spike in a plasma. This formula is based on the construction and on the subsequent solution of a differential equation for the waveform. We work out this equation as a direct consequence of the morphological and functional properties of the observed waveform, without making any reference to the velocity distributions of the electrons and of the ions which sustain the spike. In the approximation of small potential amplitudes, we solve this equation by quadrature. In particular, in the second order approximation, the solution of this equation is given in terms of elementary functions. This analytical solution is able to reproduce the potential waveforms associated with electron holes, ion holes, monotonic and nonmonotonic double layers and tripolar spikes, in excellent agreement with observations.

The electric potential of tripolar spikes

International Nuclear Information System (INIS)

Nocera, L.

2010-01-01

We present an analytical formula for the waveform of the electric potential associated with a tripolar spike in a plasma. This formula is based on the construction and on the subsequent solution of a differential equation for the waveform. We work out this equation as a direct consequence of the morphological and functional properties of the observed waveform, without making any reference to the velocity distributions of the electrons and of the ions which sustain the spike. In the approximation of small potential amplitudes, we solve this equation by quadrature. In particular, in the second order approximation, the solution of this equation is given in terms of elementary functions. This analytical solution is able to reproduce the potential waveforms associated with electron holes, ion holes, monotonic and nonmonotonic double layers and tripolar spikes, in excellent agreement with observations.

Noisy Spiking in Visual Area V2 of Amblyopic Monkeys.

Science.gov (United States)

Wang, Ye; Zhang, Bin; Tao, Xiaofeng; Wensveen, Janice M; Smith, Earl L; Chino, Yuzo M

2017-01-25

Interocular decorrelation of input signals in developing visual cortex can cause impaired binocular vision and amblyopia. Although increased intrinsic noise is thought to be responsible for a range of perceptual deficits in amblyopic humans, the neural basis for the elevated perceptual noise in amblyopic primates is not known. Here, we tested the idea that perceptual noise is linked to the neuronal spiking noise (variability) resulting from developmental alterations in cortical circuitry. To assess spiking noise, we analyzed the contrast-dependent dynamics of spike counts and spiking irregularity by calculating the square of the coefficient of variation in interspike intervals (CV 2 ) and the trial-to-trial fluctuations in spiking, or mean matched Fano factor (m-FF) in visual area V2 of monkeys reared with chronic monocular defocus. In amblyopic neurons, the contrast versus response functions and the spike count dynamics exhibited significant deviations from comparable data for normal monkeys. The CV 2 was pronounced in amblyopic neurons for high-contrast stimuli and the m-FF was abnormally high in amblyopic neurons for low-contrast gratings. The spike count, CV 2 , and m-FF of spontaneous activity were also elevated in amblyopic neurons. These contrast-dependent spiking irregularities were correlated with the level of binocular suppression in these V2 neurons and with the severity of perceptual loss for individual monkeys. Our results suggest that the developmental alterations in normalization mechanisms resulting from early binocular suppression can explain much of these contrast-dependent spiking abnormalities in V2 neurons and the perceptual performance of our amblyopic monkeys. Amblyopia is a common developmental vision disorder in humans. Despite the extensive animal studies on how amblyopia emerges, we know surprisingly little about the neural basis of amblyopia in humans and nonhuman primates. Although the vision of amblyopic humans is often described as

An empirical study on SAJQ (Sorting Algorithm for Join Queries

Directory of Open Access Journals (Sweden)

Hassan I. Mathkour

2010-06-01

Full Text Available Most queries that applied on database management systems (DBMS depend heavily on the performance of the used sorting algorithm. In addition to have an efficient sorting algorithm, as a primary feature, stability of such algorithms is a major feature that is needed in performing DBMS queries. In this paper, we study a new Sorting Algorithm for Join Queries (SAJQ that has both advantages of being efficient and stable. The proposed algorithm takes the advantage of using the m-way-merge algorithm in enhancing its time complexity. SAJQ performs the sorting operation in a time complexity of O(nlogm, where n is the length of the input array and m is number of sub-arrays used in sorting. An unsorted input array of length n is arranged into m sorted sub-arrays. The m-way-merge algorithm merges the sorted m sub-arrays into the final output sorted array. The proposed algorithm keeps the stability of the keys intact. An analytical proof has been conducted to prove that, in the worst case, the proposed algorithm has a complexity of O(nlogm. Also, a set of experiments has been performed to investigate the performance of the proposed algorithm. The experimental results have shown that the proposed algorithm outperforms other Stable–Sorting algorithms that are designed for join-based queries.

Emission of VOC's from modified rendering process

International Nuclear Information System (INIS)

Bhatti, Z.A.; Raja, I.A.; Saddique, M.; Langenhove, H.V.

2005-01-01

Rendering technique for processing of dead animal and slaughterhouse wastes into valuable products. It involves cooking of raw material and later Sterilization was added to reduce the Bovine Spongiform Encephalopathy (BSE). Studies have been carried out on rendering emission, with the normal cooking process. Our study shows, that the sterilization step in rendering process increases the emission of volatile organic compounds (VOC's). Gas samples, containing VOC's, were analyzed by the GC/MS (Gas Chromatograph and Mass Spectrometry). The most important groups of compounds- alcohols and cyclic hydrocarbons were identified. In the group of alcohol; 1-butanol, l-pentanol and l-hexanol compounds were found while in the group of cyclic hydrocarbon; methyl cyclopentane and cyclohexane compounds were detected. Other groups like aldehyde, sulphur containing compounds, ketone and furan were also found. Some compounds, like l-pentanol, 2-methyl propanal, dimethyl disulfide and dimethyl trisulfide, which belong to these groups, cause malodor. It is important to know these compounds to treat odorous gasses. (author)

A kinesthetic washout filter for force-feedback rendering.

Science.gov (United States)

Danieau, Fabien; Lecuyer, Anatole; Guillotel, Philippe; Fleureau, Julien; Mollet, Nicolas; Christie, Marc

2015-01-01

Today haptic feedback can be designed and associated to audiovisual content (haptic-audiovisuals or HAV). Although there are multiple means to create individual haptic effects, the issue of how to properly adapt such effects on force-feedback devices has not been addressed and is mostly a manual endeavor. We propose a new approach for the haptic rendering of HAV, based on a washout filter for force-feedback devices. A body model and an inverse kinematics algorithm simulate the user's kinesthetic perception. Then, the haptic rendering is adapted in order to handle transitions between haptic effects and to optimize the amplitude of effects regarding the device capabilities. Results of a user study show that this new haptic rendering can successfully improve the HAV experience.

Science and technology of kernels and TRISO coated particle sorting

International Nuclear Information System (INIS)

Nothnagel, G.

2006-09-01

The ~1mm diameter TRISO coated particles, which form the elemental units of PBMR nuclear fuel, has to be close to spherical in order to best survive damage during sphere pressing. Spherical silicon carbide layers further provide the strongest miniature pressure vessels for fission product retention. To make sure that the final product contains particles of acceptable shape, 100% of kernels and coated particles have to be sorted on a surface-ground sorting table. Broken particles, twins, irregular (odd) shapes and extreme ellipsoids have to be separated from the final kernel and coated particle batches. Proper sorting of particles is an extremely important step in quality fuel production as the final failure fraction depends sensitively on the quality of sorting. After sorting a statistically significant sample of the sorted product is analysed for sphericity, which is defined as the ratio of maximum to minimum diameter, as part of a standard QC test to ensure conformance to German specifications. In addition a burn-leach test is done on coated particles (before pressing) and fuel spheres (after pressing) to ensure adherence to failure specifications. Because of the extreme importance of particle sorting for assurance of fuel quality it is essential to have an in-depth understanding of the capabilities and limitations of particle sorting. In this report a systematic scientific rationale is developed, from fundamental principles, to provide a basis for understanding the relationship between product quality and sorting parameters. The principles and concepts, developed in this report, will be of importance when future sorting tables (or equivalents) are to be designed. A number of new concepts and methodologies are developed to assist with equivalence validation of any two sorting tables. This is aimed in particular towards quantitative assessment of equivalence between current QC tables (closely based on the original NUKEM parameters, except for the driving mechanism

Synchronous spikes are necessary but not sufficient for a synchrony code in populations of spiking neurons.

Science.gov (United States)

Grewe, Jan; Kruscha, Alexandra; Lindner, Benjamin; Benda, Jan

2017-03-07

Synchronous activity in populations of neurons potentially encodes special stimulus features. Selective readout of either synchronous or asynchronous activity allows formation of two streams of information processing. Theoretical work predicts that such a synchrony code is a fundamental feature of populations of spiking neurons if they operate in specific noise and stimulus regimes. Here we experimentally test the theoretical predictions by quantifying and comparing neuronal response properties in tuberous and ampullary electroreceptor afferents of the weakly electric fish Apteronotus leptorhynchus These related systems show similar levels of synchronous activity, but only in the more irregularly firing tuberous afferents a synchrony code is established, whereas in the more regularly firing ampullary afferents it is not. The mere existence of synchronous activity is thus not sufficient for a synchrony code. Single-cell features such as the irregularity of spiking and the frequency dependence of the neuron's transfer function determine whether synchronous spikes possess a distinct meaning for the encoding of time-dependent signals.

Voltage spikes in Nb3Sn and NbTi strands

International Nuclear Information System (INIS)

Bordini, B.; Ambrosio, G.; Barzi, E.; Carcagno, R.; Feher, S.; Kashikhin, V.V.; Lamm, M.J.; Orris, D.; Tartaglia, M.; Tompkins, J.C.; Turrioni, D.; Yamada, R.; Zlobin, A.V.; Fermilab

2005-01-01

As part of the High Field Magnet program at Fermilab several NbTi and Nb 3 Sn strands were tested with particular emphasis on the study of voltage spikes and their relationship to superconductor instabilities. The voltage spikes were detected under various experimental conditions using voltage-current (V-I) and voltage-field (V-H) methods. Two types of spikes, designated ''magnetization'' and ''transport current'' spikes, have been identified. Their origin is most likely related to magnetization flux jump and transport current redistribution, respectively. Many of the signals observed appear to be a combination of these two types of spikes; the combination of these two instability mechanisms should play a dominant role in determining the minimum quench current

A supervised learning rule for classification of spatiotemporal spike patterns.

Science.gov (United States)

Lilin Guo; Zhenzhong Wang; Adjouadi, Malek

2016-08-01

This study introduces a novel supervised algorithm for spiking neurons that take into consideration synapse delays and axonal delays associated with weights. It can be utilized for both classification and association and uses several biologically influenced properties, such as axonal and synaptic delays. This algorithm also takes into consideration spike-timing-dependent plasticity as in Remote Supervised Method (ReSuMe). This paper focuses on the classification aspect alone. Spiked neurons trained according to this proposed learning rule are capable of classifying different categories by the associated sequences of precisely timed spikes. Simulation results have shown that the proposed learning method greatly improves classification accuracy when compared to the Spike Pattern Association Neuron (SPAN) and the Tempotron learning rule.

The Container Problem in Bubble-Sort Graphs

Science.gov (United States)

Suzuki, Yasuto; Kaneko, Keiichi

Bubble-sort graphs are variants of Cayley graphs. A bubble-sort graph is suitable as a topology for massively parallel systems because of its simple and regular structure. Therefore, in this study, we focus on n-bubble-sort graphs and propose an algorithm to obtain n-1 disjoint paths between two arbitrary nodes in time bounded by a polynomial in n, the degree of the graph plus one. We estimate the time complexity of the algorithm and the sum of the path lengths after proving the correctness of the algorithm. In addition, we report the results of computer experiments evaluating the average performance of the algorithm.

A Markovian event-based framework for stochastic spiking neural networks.

Science.gov (United States)

Touboul, Jonathan D; Faugeras, Olivier D

2011-11-01

In spiking neural networks, the information is conveyed by the spike times, that depend on the intrinsic dynamics of each neuron, the input they receive and on the connections between neurons. In this article we study the Markovian nature of the sequence of spike times in stochastic neural networks, and in particular the ability to deduce from a spike train the next spike time, and therefore produce a description of the network activity only based on the spike times regardless of the membrane potential process. To study this question in a rigorous manner, we introduce and study an event-based description of networks of noisy integrate-and-fire neurons, i.e. that is based on the computation of the spike times. We show that the firing times of the neurons in the networks constitute a Markov chain, whose transition probability is related to the probability distribution of the interspike interval of the neurons in the network. In the cases where the Markovian model can be developed, the transition probability is explicitly derived in such classical cases of neural networks as the linear integrate-and-fire neuron models with excitatory and inhibitory interactions, for different types of synapses, possibly featuring noisy synaptic integration, transmission delays and absolute and relative refractory period. This covers most of the cases that have been investigated in the event-based description of spiking deterministic neural networks.

Fast convergence of spike sequences to periodic patterns in recurrent networks

International Nuclear Information System (INIS)

Jin, Dezhe Z.

2002-01-01

The dynamical attractors are thought to underlie many biological functions of recurrent neural networks. Here we show that stable periodic spike sequences with precise timings are the attractors of the spiking dynamics of recurrent neural networks with global inhibition. Almost all spike sequences converge within a finite number of transient spikes to these attractors. The convergence is fast, especially when the global inhibition is strong. These results support the possibility that precise spatiotemporal sequences of spikes are useful for information encoding and processing in biological neural networks

Heuristic framework for parallel sorting computations | Nwanze ...

African Journals Online (AJOL)

Parallel sorting techniques have become of practical interest with the advent of new multiprocessor architectures. The decreasing cost of these processors will probably in the future, make the solutions that are derived thereof to be more appealing. Efficient algorithms for sorting scheme that are encountered in a number of ...

Noise-enhanced coding in phasic neuron spike trains.

Science.gov (United States)

Ly, Cheng; Doiron, Brent

2017-01-01

The stochastic nature of neuronal response has lead to conjectures about the impact of input fluctuations on the neural coding. For the most part, low pass membrane integration and spike threshold dynamics have been the primary features assumed in the transfer from synaptic input to output spiking. Phasic neurons are a common, but understudied, neuron class that are characterized by a subthreshold negative feedback that suppresses spike train responses to low frequency signals. Past work has shown that when a low frequency signal is accompanied by moderate intensity broadband noise, phasic neurons spike trains are well locked to the signal. We extend these results with a simple, reduced model of phasic activity that demonstrates that a non-Markovian spike train structure caused by the negative feedback produces a noise-enhanced coding. Further, this enhancement is sensitive to the timescales, as opposed to the intensity, of a driving signal. Reduced hazard function models show that noise-enhanced phasic codes are both novel and separate from classical stochastic resonance reported in non-phasic neurons. The general features of our theory suggest that noise-enhanced codes in excitable systems with subthreshold negative feedback are a particularly rich framework to study.

Financial time series prediction using spiking neural networks.

Science.gov (United States)

Reid, David; Hussain, Abir Jaafar; Tawfik, Hissam

2014-01-01

In this paper a novel application of a particular type of spiking neural network, a Polychronous Spiking Network, was used for financial time series prediction. It is argued that the inherent temporal capabilities of this type of network are suited to non-stationary data such as this. The performance of the spiking neural network was benchmarked against three systems: two "traditional", rate-encoded, neural networks; a Multi-Layer Perceptron neural network and a Dynamic Ridge Polynomial neural network, and a standard Linear Predictor Coefficients model. For this comparison three non-stationary and noisy time series were used: IBM stock data; US/Euro exchange rate data, and the price of Brent crude oil. The experiments demonstrated favourable prediction results for the Spiking Neural Network in terms of Annualised Return and prediction error for 5-Step ahead predictions. These results were also supported by other relevant metrics such as Maximum Drawdown and Signal-To-Noise ratio. This work demonstrated the applicability of the Polychronous Spiking Network to financial data forecasting and this in turn indicates the potential of using such networks over traditional systems in difficult to manage non-stationary environments.

Brainlab: A Python Toolkit to Aid in the Design, Simulation, and Analysis of Spiking Neural Networks with the NeoCortical Simulator.

Science.gov (United States)

Drewes, Rich; Zou, Quan; Goodman, Philip H

2009-01-01

Neuroscience modeling experiments often involve multiple complex neural network and cell model variants, complex input stimuli and input protocols, followed by complex data analysis. Coordinating all this complexity becomes a central difficulty for the experimenter. The Python programming language, along with its extensive library packages, has emerged as a leading "glue" tool for managing all sorts of complex programmatic tasks. This paper describes a toolkit called Brainlab, written in Python, that leverages Python's strengths for the task of managing the general complexity of neuroscience modeling experiments. Brainlab was also designed to overcome the major difficulties of working with the NCS (NeoCortical Simulator) environment in particular. Brainlab is an integrated model-building, experimentation, and data analysis environment for the powerful parallel spiking neural network simulator system NCS.

Processing-in-Memory Enabled Graphics Processors for 3D Rendering

Energy Technology Data Exchange (ETDEWEB)

Xie, Chenhao; Song, Shuaiwen; Wang, Jing; Zhang, Weigong; Fu, Xin

2017-02-06

The performance of 3D rendering of Graphics Processing Unit that convents 3D vector stream into 2D frame with 3D image effects significantly impact users’ gaming experience on modern computer systems. Due to the high texture throughput in 3D rendering, main memory bandwidth becomes a critical obstacle for improving the overall rendering performance. 3D stacked memory systems such as Hybrid Memory Cube (HMC) provide opportunities to significantly overcome the memory wall by directly connecting logic controllers to DRAM dies. Based on the observation that texel fetches significantly impact off-chip memory traffic, we propose two architectural designs to enable Processing-In-Memory based GPU for efficient 3D rendering.

Fruit Sorting Using Fuzzy Logic Techniques

Science.gov (United States)

Elamvazuthi, Irraivan; Sinnadurai, Rajendran; Aftab Ahmed Khan, Mohamed Khan; Vasant, Pandian

2009-08-01

Fruit and vegetables market is getting highly selective, requiring their suppliers to distribute the goods according to very strict standards of quality and presentation. In the last years, a number of fruit sorting and grading systems have appeared to fulfill the needs of the fruit processing industry. However, most of them are overly complex and too costly for the small and medium scale industry (SMIs) in Malaysia. In order to address these shortcomings, a prototype machine was developed by integrating the fruit sorting, labeling and packing processes. To realise the prototype, many design issues were dealt with. Special attention is paid to the electronic weighing sub-system for measuring weight, and the opto-electronic sub-system for determining the height and width of the fruits. Specifically, this paper discusses the application of fuzzy logic techniques in the sorting process.

Genes with a spike expression are clustered in chromosome (sub)bands and spike (sub)bands have a powerful prognostic value in patients with multiple myeloma

Science.gov (United States)

Kassambara, Alboukadel; Hose, Dirk; Moreaux, Jérôme; Walker, Brian A.; Protopopov, Alexei; Reme, Thierry; Pellestor, Franck; Pantesco, Véronique; Jauch, Anna; Morgan, Gareth; Goldschmidt, Hartmut; Klein, Bernard

2012-01-01

Background Genetic abnormalities are common in patients with multiple myeloma, and may deregulate gene products involved in tumor survival, proliferation, metabolism and drug resistance. In particular, translocations may result in a high expression of targeted genes (termed spike expression) in tumor cells. We identified spike genes in multiple myeloma cells of patients with newly-diagnosed myeloma and investigated their prognostic value. Design and Methods Genes with a spike expression in multiple myeloma cells were picked up using box plot probe set signal distribution and two selection filters. Results In a cohort of 206 newly diagnosed patients with multiple myeloma, 2587 genes/expressed sequence tags with a spike expression were identified. Some spike genes were associated with some transcription factors such as MAF or MMSET and with known recurrent translocations as expected. Spike genes were not associated with increased DNA copy number and for a majority of them, involved unknown mechanisms. Of spiked genes, 36.7% clustered significantly in 149 out of 862 documented chromosome (sub)bands, of which 53 had prognostic value (35 bad, 18 good). Their prognostic value was summarized with a spike band score that delineated 23.8% of patients with a poor median overall survival (27.4 months versus not reached, Pband score was independent of other gene expression profiling-based risk scores, t(4;14), or del17p in an independent validation cohort of 345 patients. Conclusions We present a new approach to identify spike genes and their relationship to patients’ survival. PMID:22102711

Predictive coding of dynamical variables in balanced spiking networks.

Science.gov (United States)

Boerlin, Martin; Machens, Christian K; Denève, Sophie

2013-01-01

Two observations about the cortex have puzzled neuroscientists for a long time. First, neural responses are highly variable. Second, the level of excitation and inhibition received by each neuron is tightly balanced at all times. Here, we demonstrate that both properties are necessary consequences of neural networks that represent information efficiently in their spikes. We illustrate this insight with spiking networks that represent dynamical variables. Our approach is based on two assumptions: We assume that information about dynamical variables can be read out linearly from neural spike trains, and we assume that neurons only fire a spike if that improves the representation of the dynamical variables. Based on these assumptions, we derive a network of leaky integrate-and-fire neurons that is able to implement arbitrary linear dynamical systems. We show that the membrane voltage of the neurons is equivalent to a prediction error about a common population-level signal. Among other things, our approach allows us to construct an integrator network of spiking neurons that is robust against many perturbations. Most importantly, neural variability in our networks cannot be equated to noise. Despite exhibiting the same single unit properties as widely used population code models (e.g. tuning curves, Poisson distributed spike trains), balanced networks are orders of magnitudes more reliable. Our approach suggests that spikes do matter when considering how the brain computes, and that the reliability of cortical representations could have been strongly underestimated.

A method for decoding the neurophysiological spike-response transform.

Science.gov (United States)

Stern, Estee; García-Crescioni, Keyla; Miller, Mark W; Peskin, Charles S; Brezina, Vladimir

2009-11-15

Many physiological responses elicited by neuronal spikes-intracellular calcium transients, synaptic potentials, muscle contractions-are built up of discrete, elementary responses to each spike. However, the spikes occur in trains of arbitrary temporal complexity, and each elementary response not only sums with previous ones, but can itself be modified by the previous history of the activity. A basic goal in system identification is to characterize the spike-response transform in terms of a small number of functions-the elementary response kernel and additional kernels or functions that describe the dependence on previous history-that will predict the response to any arbitrary spike train. Here we do this by developing further and generalizing the "synaptic decoding" approach of Sen et al. (1996). Given the spike times in a train and the observed overall response, we use least-squares minimization to construct the best estimated response and at the same time best estimates of the elementary response kernel and the other functions that characterize the spike-response transform. We avoid the need for any specific initial assumptions about these functions by using techniques of mathematical analysis and linear algebra that allow us to solve simultaneously for all of the numerical function values treated as independent parameters. The functions are such that they may be interpreted mechanistically. We examine the performance of the method as applied to synthetic data. We then use the method to decode real synaptic and muscle contraction transforms.

A spiking neuron circuit based on a carbon nanotube transistor

International Nuclear Information System (INIS)

Chen, C-L; Kim, K; Truong, Q; Shen, A; Li, Z; Chen, Y

2012-01-01

A spiking neuron circuit based on a carbon nanotube (CNT) transistor is presented in this paper. The spiking neuron circuit has a crossbar architecture in which the transistor gates are connected to its row electrodes and the transistor sources are connected to its column electrodes. An electrochemical cell is incorporated in the gate of the transistor by sandwiching a hydrogen-doped poly(ethylene glycol)methyl ether (PEG) electrolyte between the CNT channel and the top gate electrode. An input spike applied to the gate triggers a dynamic drift of the hydrogen ions in the PEG electrolyte, resulting in a post-synaptic current (PSC) through the CNT channel. Spikes input into the rows trigger PSCs through multiple CNT transistors, and PSCs cumulate in the columns and integrate into a ‘soma’ circuit to trigger output spikes based on an integrate-and-fire mechanism. The spiking neuron circuit can potentially emulate biological neuron networks and their intelligent functions. (paper)

RAY TRACING RENDER MENGGUNAKAN FRAGMENT ANTI ALIASING

Directory of Open Access Journals (Sweden)

Febriliyan Samopa

2008-07-01

Full Text Available Normal 0 false false false IN X-NONE X-NONE MicrosoftInternetExplorer4 /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-qformat:yes; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin-top:0cm; mso-para-margin-right:0cm; mso-para-margin-bottom:10.0pt; mso-para-margin-left:0cm; line-height:115%; mso-pagination:widow-orphan; font-size:11.0pt; font-family:"Calibri","sans-serif"; mso-ascii-font-family:Calibri; mso-ascii-theme-font:minor-latin; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast; mso-hansi-font-family:Calibri; mso-hansi-theme-font:minor-latin; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi;} Rendering is generating surface and three-dimensional effects on an object displayed on a monitor screen. Ray tracing as a rendering method that traces ray for each image pixel has a drawback, that is, aliasing (jaggies effect. There are some methods for executing anti aliasing. One of those methods is OGSS (Ordered Grid Super Sampling. OGSS is able to perform aliasing well. However, this method requires more computation time since sampling of all pixels in the image will be increased. Fragment Anti Aliasing (FAA is a new alternative method that can cope with the drawback. FAA will check the image when performing rendering to a scene. Jaggies effect is only happened at curve and gradient object. Therefore, only this part of object that will experience sampling magnification. After this sampling magnification and the pixel values are computed, then downsample is performed to retrieve the original pixel values. Experimental results show that the software can implement ray tracing well in order to form images, and it can implement FAA and OGSS technique to perform anti aliasing. In general, rendering using FAA is faster than using OGSS

Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Moruz, Gabriel

2005-01-01

Branch mispredictions is an important factor affecting the running time in practice. In this paper we consider tradeoffs between the number of branch mispredictions and the number of comparisons for sorting algorithms in the comparison model. We prove that a sorting algorithm using O(dnlog n......) comparisons performs Omega(nlogd n) branch mispredictions. We show that Multiway MergeSort achieves this tradeoff by adopting a multiway merger with a low number of branch mispredictions. For adaptive sorting algorithms we similarly obtain that an algorithm performing O(dn(1+log (1+Inv/n))) comparisons must...... perform Omega(nlogd (1+Inv/n)) branch mispredictions, where Inv is the number of inversions in the input. This tradeoff can be achieved by GenericSort by Estivill-Castro and Wood by adopting a multiway division protocol and a multiway merging algorithm with a low number of branch mispredictions....

Acoustic bubble sorting for ultrasound contrast agent enrichment.

Science.gov (United States)

Segers, Tim; Versluis, Michel

2014-05-21

An ultrasound contrast agent (UCA) suspension contains encapsulated microbubbles with a wide size distribution, with radii ranging from 1 to 10 μm. Medical transducers typically operate at a single frequency, therefore only a small selection of bubbles will resonate to the driving ultrasound pulse. Thus, the sensitivity can be improved by narrowing down the size distribution. Here, we present a simple lab-on-a-chip method to sort the population of microbubbles on-chip using a traveling ultrasound wave. First, we explore the physical parameter space of acoustic bubble sorting using well-defined bubble sizes formed in a flow-focusing device, then we demonstrate successful acoustic sorting of a commercial UCA. This novel sorting strategy may lead to an overall improvement of the sensitivity of contrast ultrasound by more than 10 dB.

An online supervised learning method based on gradient descent for spiking neurons.

Science.gov (United States)

Xu, Yan; Yang, Jing; Zhong, Shuiming

2017-09-01

The purpose of supervised learning with temporal encoding for spiking neurons is to make the neurons emit a specific spike train encoded by precise firing times of spikes. The gradient-descent-based (GDB) learning methods are widely used and verified in the current research. Although the existing GDB multi-spike learning (or spike sequence learning) methods have good performance, they work in an offline manner and still have some limitations. This paper proposes an online GDB spike sequence learning method for spiking neurons that is based on the online adjustment mechanism of real biological neuron synapses. The method constructs error function and calculates the adjustment of synaptic weights as soon as the neurons emit a spike during their running process. We analyze and synthesize desired and actual output spikes to select appropriate input spikes in the calculation of weight adjustment in this paper. The experimental results show that our method obviously improves learning performance compared with the offline learning manner and has certain advantage on learning accuracy compared with other learning methods. Stronger learning ability determines that the method has large pattern storage capacity. Copyright © 2017 Elsevier Ltd. All rights reserved.

Bistability induces episodic spike communication by inhibitory neurons in neuronal networks.

Science.gov (United States)

Kazantsev, V B; Asatryan, S Yu

2011-09-01

Bistability is one of the important features of nonlinear dynamical systems. In neurodynamics, bistability has been found in basic Hodgkin-Huxley equations describing the cell membrane dynamics. When the neuron is clamped near its threshold, the stable rest potential may coexist with the stable limit cycle describing periodic spiking. However, this effect is often neglected in network computations where the neurons are typically reduced to threshold firing units (e.g., integrate-and-fire models). We found that the bistability may induce spike communication by inhibitory coupled neurons in the spiking network. The communication is realized in the form of episodic discharges with synchronous (correlated) spikes during the episodes. A spiking phase map is constructed to describe the synchronization and to estimate basic spike phase locking modes.

Voltage spikes in Nb3Sn and NbTi strands

Energy Technology Data Exchange (ETDEWEB)

Bordini, B.; Ambrosio, G.; Barzi, E.; Carcagno, R.; Feher, S.; Kashikhin, V.V.; Lamm, M.J.; Orris, D.; Tartaglia, M.; Tompkins, J.C.; Turrioni, D.; Yamada, R.; Zlobin,; /Fermilab

2005-09-01

As part of the High Field Magnet program at Fermilab several NbTi and Nb{sub 3}Sn strands were tested with particular emphasis on the study of voltage spikes and their relationship to superconductor instabilities. The voltage spikes were detected under various experimental conditions using voltage-current (V-I) and voltage-field (V-H) methods. Two types of spikes, designated ''magnetization'' and ''transport current'' spikes, have been identified. Their origin is most likely related to magnetization flux jump and transport current redistribution, respectively. Many of the signals observed appear to be a combination of these two types of spikes; the combination of these two instability mechanisms should play a dominant role in determining the minimum quench current.

Pressurized water reactor iodine spiking behavior under power transient conditions

International Nuclear Information System (INIS)

Ho, J.C.

1992-01-01

The most accepted theory explaining the cause of pressurized water reactor iodine spiking is steam formation and condensation in damaged fuel rods. The phase transformation of the primary coolant from water to steam and back again is believed to cause the iodine spiking phenomenon. But due to the complex nature of the phenomenon, a comprehensive model of the behavior has not yet been successfully developed. This paper presents a new model based on an empirical approach, which gives a first-order estimation of the peak iodine spiking magnitude. Based on the proposed iodine spiking model, it is apparent that it is feasible to derive a correlation using the plant operating data base to monitor and control the peak iodine spiking magnitude

Automatic Color Sorting of Hardwood Edge-Glued Panel Parts

Science.gov (United States)

D. Earl Kline; Richard Conners; Qiang Lu; Philip A. Araman

1997-01-01

This paper describes an automatic color sorting system for red oak edge-glued panel parts. The color sorting system simultaneously examines both faces of a panel part and then determines which face has the "best" color, and sorts the part into one of a number of color classes at plant production speeds. Initial test results show that the system generated over...

Digital color acquisition, perception, coding and rendering

CERN Document Server

Fernandez-Maloigne, Christine; Macaire, Ludovic

2013-01-01

In this book the authors identify the basic concepts and recent advances in the acquisition, perception, coding and rendering of color. The fundamental aspects related to the science of colorimetry in relation to physiology (the human visual system) are addressed, as are constancy and color appearance. It also addresses the more technical aspects related to sensors and the color management screen. Particular attention is paid to the notion of color rendering in computer graphics. Beyond color, the authors also look at coding, compression, protection and quality of color images and videos.

Contamination spike simulation and measurement in a clean metal vapor laser

International Nuclear Information System (INIS)

Lin, C.E.; Yang, C.Y.

1990-01-01

This paper describes a new method for the generation of contamination-induced voltage spikes in a clean metal vapor laser. The method facilitates the study of the characteristics of this troublesome phenomenon in laser systems. Analysis of these artificially generated dirt spikes shows that the breakdown time of the laser tube is increased when these spike appear. The concept of a Townsend discharge is used to identify the parameter which changes the breakdown time of the discharges. The residual ionization control method is proposed to generate dirt spikes in a clean laser. Experimental results show that a wide range of dirt spike magnitudes can be obtained by using the proposed method. The method provides easy and accurate control of the magnitude of the dirt spike, and the laser tube does not become polluted. Results based on the measurements can be used in actual laser systems to monitor the appearance of dirt spikes and thus avoid the danger of thyratron failure

Three-dimensional spiral CT during arterial portography: comparison of three rendering techniques.

Science.gov (United States)

Heath, D G; Soyer, P A; Kuszyk, B S; Bliss, D F; Calhoun, P S; Bluemke, D A; Choti, M A; Fishman, E K

1995-07-01

The three most common techniques for three-dimensional reconstruction are surface rendering, maximum-intensity projection (MIP), and volume rendering. Surface-rendering algorithms model objects as collections of geometric primitives that are displayed with surface shading. The MIP algorithm renders an image by selecting the voxel with the maximum intensity signal along a line extended from the viewer's eye through the data volume. Volume-rendering algorithms sum the weighted contributions of all voxels along the line. Each technique has advantages and shortcomings that must be considered during selection of one for a specific clinical problem and during interpretation of the resulting images. With surface rendering, sharp-edged, clear three-dimensional reconstruction can be completed on modest computer systems; however, overlapping structures cannot be visualized and artifacts are a problem. MIP is computationally a fast technique, but it does not allow depiction of overlapping structures, and its images are three-dimensionally ambiguous unless depth cues are provided. Both surface rendering and MIP use less than 10% of the image data. In contrast, volume rendering uses nearly all of the data, allows demonstration of overlapping structures, and engenders few artifacts, but it requires substantially more computer power than the other techniques.

Automorphism group of the modified bubble-sort graph

OpenAIRE

Ganesan, Ashwin

2014-01-01

The modified bubble-sort graph of dimension $n$ is the Cayley graph of $S_n$ generated by $n$ cyclically adjacent transpositions. In the present paper, it is shown that the automorphism group of the modified bubble sort graph of dimension $n$ is $S_n \\times D_{2n}$, for all $n \\ge 5$. Thus, a complete structural description of the automorphism group of the modified bubble-sort graph is obtained. A similar direct product decomposition is seen to hold for arbitrary normal Cayley graphs generate...

Spike and burst coding in thalamocortical relay cells.

Directory of Open Access Journals (Sweden)

Fleur Zeldenrust

2018-02-01

Full Text Available Mammalian thalamocortical relay (TCR neurons switch their firing activity between a tonic spiking and a bursting regime. In a combined experimental and computational study, we investigated the features in the input signal that single spikes and bursts in the output spike train represent and how this code is influenced by the membrane voltage state of the neuron. Identical frozen Gaussian noise current traces were injected into TCR neurons in rat brain slices as well as in a validated three-compartment TCR model cell. The resulting membrane voltage traces and spike trains were analyzed by calculating the coherence and impedance. Reverse correlation techniques gave the Event-Triggered Average (ETA and the Event-Triggered Covariance (ETC. This demonstrated that the feature selectivity started relatively long before the events (up to 300 ms and showed a clear distinction between spikes (selective for fluctuations and bursts (selective for integration. The model cell was fine-tuned to mimic the frozen noise initiated spike and burst responses to within experimental accuracy, especially for the mixed mode regimes. The information content carried by the various types of events in the signal as well as by the whole signal was calculated. Bursts phase-lock to and transfer information at lower frequencies than single spikes. On depolarization the neuron transits smoothly from the predominantly bursting regime to a spiking regime, in which it is more sensitive to high-frequency fluctuations. The model was then used to elucidate properties that could not be assessed experimentally, in particular the role of two important subthreshold voltage-dependent currents: the low threshold activated calcium current (IT and the cyclic nucleotide modulated h current (Ih. The ETAs of those currents and their underlying activation/inactivation states not only explained the state dependence of the firing regime but also the long-lasting concerted dynamic action of the two

Sorting signed permutations by short operations.

Science.gov (United States)

Galvão, Gustavo Rodrigues; Lee, Orlando; Dias, Zanoni

2015-01-01

During evolution, global mutations may alter the order and the orientation of the genes in a genome. Such mutations are referred to as rearrangement events, or simply operations. In unichromosomal genomes, the most common operations are reversals, which are responsible for reversing the order and orientation of a sequence of genes, and transpositions, which are responsible for switching the location of two contiguous portions of a genome. The problem of computing the minimum sequence of operations that transforms one genome into another - which is equivalent to the problem of sorting a permutation into the identity permutation - is a well-studied problem that finds application in comparative genomics. There are a number of works concerning this problem in the literature, but they generally do not take into account the length of the operations (i.e. the number of genes affected by the operations). Since it has been observed that short operations are prevalent in the evolution of some species, algorithms that efficiently solve this problem in the special case of short operations are of interest. In this paper, we investigate the problem of sorting a signed permutation by short operations. More precisely, we study four flavors of this problem: (i) the problem of sorting a signed permutation by reversals of length at most 2; (ii) the problem of sorting a signed permutation by reversals of length at most 3; (iii) the problem of sorting a signed permutation by reversals and transpositions of length at most 2; and (iv) the problem of sorting a signed permutation by reversals and transpositions of length at most 3. We present polynomial-time solutions for problems (i) and (iii), a 5-approximation for problem (ii), and a 3-approximation for problem (iv). Moreover, we show that the expected approximation ratio of the 5-approximation algorithm is not greater than 3 for random signed permutations with more than 12 elements. Finally, we present experimental results that show

Real-World Sorting of RHIC Superconducting Magnets

International Nuclear Information System (INIS)

Wei, J.; Gupta, R.; Harrison, M.; Jain, A.; Peggs, S.; Thompson, P.; Trbojevic, D.; Wanderer, P.

1999-01-01

During the seven-year construction of the Relativistic Heavy Ion Collider (RHIC), more than 1700 superconducting dipoles, quadrupoles, sextupoles, and multi-layer correctors have been constructed and installed. These magnets have been sorted at several production stages to optimize their performance and reliability. For arc magnets, priorities have bene put first on quench performance and operational risk minimization, second on field transfer function and other first-order quantities, and finally on nonlinear field errors which were painstakingly optimized at design. For Interaction-Region (IR) magnets, sorting is applied to select the best possible combination of magnets for the low-β interaction points (IP). This paper summarizes the history of this real-world sorting process

Stochastic optimal control of single neuron spike trains

DEFF Research Database (Denmark)

Iolov, Alexandre; Ditlevsen, Susanne; Longtin, Andrë

2014-01-01

stimulation of a neuron to achieve a target spike train under the physiological constraint to not damage tissue. Approach. We pose a stochastic optimal control problem to precisely specify the spike times in a leaky integrate-and-fire (LIF) model of a neuron with noise assumed to be of intrinsic or synaptic...... origin. In particular, we allow for the noise to be of arbitrary intensity. The optimal control problem is solved using dynamic programming when the controller has access to the voltage (closed-loop control), and using a maximum principle for the transition density when the controller only has access...... to the spike times (open-loop control). Main results. We have developed a stochastic optimal control algorithm to obtain precise spike times. It is applicable in both the supra-threshold and sub-threshold regimes, under open-loop and closed-loop conditions and with an arbitrary noise intensity; the accuracy...

Anticipating Activity in Social Media Spikes

OpenAIRE

Higham, Desmond J.; Grindrod, Peter; Mantzaris, Alexander V.; Otley, Amanda; Laflin, Peter

2014-01-01

We propose a novel mathematical model for the activity of microbloggers during an external, event-driven spike. The model leads to a testable prediction of who would become most active if a spike were to take place. This type of information is of great interest to commercial organisations, governments and charities, as it identifies key players who can be targeted with information in real time when the network is most receptive. The model takes account of the fact that dynamic interactions ev...

Sorting Out Seasonal Allergies

Science.gov (United States)

... Close ‹ Back to Healthy Living Sorting Out Seasonal Allergies Sneezing, runny nose, nasal congestion. Symptoms of the ... How do I know if I have seasonal allergies? According to Dr. Georgeson, the best way to ...

Development of a reactor thermalhydraulic experiment databank(SORTED1)

International Nuclear Information System (INIS)

Bang, Young Seck; Kim, Eun Kyoung; Kim, Hho Jung; Lee, Sang Yong

1994-01-01

The recent trend in thermalhydraulic safety analysis of nuclear power plant shows the best-estimate and probabilistic approaches, therefore, the verification of the best-estimate code based on the applicable experiment data has been required. The present study focused on developing a simple databank, SORTED1, to be effectively used for code verification. The development of SORTED1 includes a data collection from the various sources including ENCOUNTER, which is the reactor safety data bank of U.S. Nuclear Regulatory Commission, a reorganization of collected resources suitable for requirements of SORTED1 database management system (DBMS), and a development of a simple DBMS. The SORTED1 is designed in Unix environment with graphic user interface to improve a user convenience and has a capability to provide the test related information. The currently registered data in SORTED1 cover 759 thermalhydraulic tests including LOFT, Semiscale, etc

Multimodal imaging of spike propagation: a technical case report.

Science.gov (United States)

Tanaka, N; Grant, P E; Suzuki, N; Madsen, J R; Bergin, A M; Hämäläinen, M S; Stufflebeam, S M

2012-06-01

We report an 11-year-old boy with intractable epilepsy, who had cortical dysplasia in the right superior frontal gyrus. Spatiotemporal source analysis of MEG and EEG spikes demonstrated a similar time course of spike propagation from the superior to inferior frontal gyri, as observed on intracranial EEG. The tractography reconstructed from DTI showed a fiber connection between these areas. Our multimodal approach demonstrates spike propagation and a white matter tract guiding the propagation.

The Analysis and Suppression of the spike noise in vibrator record

Science.gov (United States)

Jia, H.; Jiang, T.; Xu, X.; Ge, L.; Lin, J.; Yang, Z.

2013-12-01

During the seismic exploration with vibrator, seismic recording systems have often been affected by random spike noise in the background, which leads to strong data distortions as a result of the cross-correlation processing of the vibrator method. Partial or total loss of the desired seismic information is possible if no automatic spike reduction is available in the field prior to correlation of the field record. Generally speaking, original record of vibrator is uncorrelated data, in which the signal is non-wavelet form. In order to obtain the seismic record similar to explosive source, the signal of uncorrelated data needs to use the correlation algorithm to compress into wavelet form. The correlation process results in that the interference of spike in correlated data is not only being suppressed, but also being expanded. So the spike noise suppression of vibrator is indispensable. According to numerical simulation results, the effect of spike in the vibrator record is mainly affected by the amplitude and proportional points in the uncorrelated record. When the spike noise ratio in uncorrelated record reaches 1.5% and the average amplitude exceeds 200, it will make the SNR(signal-to-noise ratio) of the correlated record lower than 0dB, so that it is difficult to separate the signal. While the amplitude and ratio is determined by the intensity of background noise. Therefore, when the noise level is strong, in order to improve SNR of the seismic data, the uncorrelated record of vibrator need to take necessary steps to suppress spike noise. For the sake of reducing the influence of the spike noise, we need to make the detection and suppression of spike noise process for the uncorrelated record. Because vibrator works by inputting sweep signal into the underground long time, ideally, the peak and valley values of each trace have little change. On the basis of the peak and valley values, we can get a reference amplitude value. Then the spike can be detected and

Cytoplasmic tail of coronavirus spike protein has intracellular

Indian Academy of Sciences (India)

https://www.ias.ac.in/article/fulltext/jbsc/042/02/0231-0244. Keywords. Coronavirus spike protein trafficking; cytoplasmic tail signal; endoplasmic reticulum–Golgi intermediate complex; lysosome. Abstract. Intracellular trafficking and localization studies of spike protein from SARS and OC43 showed that SARS spikeprotein is ...

NeatSort - A practical adaptive algorithm

OpenAIRE

La Rocca, Marcello; Cantone, Domenico

2014-01-01

We present a new adaptive sorting algorithm which is optimal for most disorder metrics and, more important, has a simple and quick implementation. On input $X$, our algorithm has a theoretical $\\Omega (|X|)$ lower bound and a $\\mathcal{O}(|X|\\log|X|)$ upper bound, exhibiting amazing adaptive properties which makes it run closer to its lower bound as disorder (computed on different metrics) diminishes. From a practical point of view, \\textit{NeatSort} has proven itself competitive with (and of...

Queue and stack sorting algorithm optimization and performance analysis

Science.gov (United States)

Qian, Mingzhu; Wang, Xiaobao

2018-04-01

Sorting algorithm is one of the basic operation of a variety of software development, in data structures course specializes in all kinds of sort algorithm. The performance of the sorting algorithm is directly related to the efficiency of the software. A lot of excellent scientific research queue is constantly optimizing algorithm, algorithm efficiency better as far as possible, the author here further research queue combined with stacks of sorting algorithms, the algorithm is mainly used for alternating operation queue and stack storage properties, Thus avoiding the need for a large number of exchange or mobile operations in the traditional sort. Before the existing basis to continue research, improvement and optimization, the focus on the optimization of the time complexity of the proposed optimization and improvement, The experimental results show that the improved effectively, at the same time and the time complexity and space complexity of the algorithm, the stability study corresponding research. The improvement and optimization algorithm, improves the practicability.

Design and Implementation of High-Performance GIS Dynamic Objects Rendering Engine

Science.gov (United States)

Zhong, Y.; Wang, S.; Li, R.; Yun, W.; Song, G.

2017-12-01

Spatio-temporal dynamic visualization is more vivid than static visualization. It important to use dynamic visualization techniques to reveal the variation process and trend vividly and comprehensively for the geographical phenomenon. To deal with challenges caused by dynamic visualization of both 2D and 3D spatial dynamic targets, especially for different spatial data types require high-performance GIS dynamic objects rendering engine. The main approach for improving the rendering engine with vast dynamic targets relies on key technologies of high-performance GIS, including memory computing, parallel computing, GPU computing and high-performance algorisms. In this study, high-performance GIS dynamic objects rendering engine is designed and implemented for solving the problem based on hybrid accelerative techniques. The high-performance GIS rendering engine contains GPU computing, OpenGL technology, and high-performance algorism with the advantage of 64-bit memory computing. It processes 2D, 3D dynamic target data efficiently and runs smoothly with vast dynamic target data. The prototype system of high-performance GIS dynamic objects rendering engine is developed based SuperMap GIS iObjects. The experiments are designed for large-scale spatial data visualization, the results showed that the high-performance GIS dynamic objects rendering engine have the advantage of high performance. Rendering two-dimensional and three-dimensional dynamic objects achieve 20 times faster on GPU than on CPU.

SPIKY: a graphical user interface for monitoring spike train synchrony.

Science.gov (United States)

Kreuz, Thomas; Mulansky, Mario; Bozanic, Nebojsa

2015-05-01

Techniques for recording large-scale neuronal spiking activity are developing very fast. This leads to an increasing demand for algorithms capable of analyzing large amounts of experimental spike train data. One of the most crucial and demanding tasks is the identification of similarity patterns with a very high temporal resolution and across different spatial scales. To address this task, in recent years three time-resolved measures of spike train synchrony have been proposed, the ISI-distance, the SPIKE-distance, and event synchronization. The Matlab source codes for calculating and visualizing these measures have been made publicly available. However, due to the many different possible representations of the results the use of these codes is rather complicated and their application requires some basic knowledge of Matlab. Thus it became desirable to provide a more user-friendly and interactive interface. Here we address this need and present SPIKY, a graphical user interface that facilitates the application of time-resolved measures of spike train synchrony to both simulated and real data. SPIKY includes implementations of the ISI-distance, the SPIKE-distance, and the SPIKE-synchronization (an improved and simplified extension of event synchronization) that have been optimized with respect to computation speed and memory demand. It also comprises a spike train generator and an event detector that makes it capable of analyzing continuous data. Finally, the SPIKY package includes additional complementary programs aimed at the analysis of large numbers of datasets and the estimation of significance levels. Copyright © 2015 the American Physiological Society.

Femtosecond laser fabricated spike structures for selective control of cellular behavior.

Science.gov (United States)

Schlie, Sabrina; Fadeeva, Elena; Koch, Jürgen; Ngezahayo, Anaclet; Chichkov, Boris N

2010-09-01

In this study we investigate the potential of femtosecond laser generated micrometer sized spike structures as functional surfaces for selective cell controlling. The spike dimensions as well as the average spike to spike distance can be easily tuned by varying the process parameters. Moreover, negative replications in soft materials such as silicone elastomer can be produced. This allows tailoring of wetting properties of the spike structures and their negative replicas representing a reduced surface contact area. Furthermore, we investigated material effects on cellular behavior. By comparing human fibroblasts and SH-SY5Y neuroblastoma cells we found that the influence of the material was cell specific. The cells not only changed their morphology, but also the cell growth was affected. Whereas, neuroblastoma cells proliferated at the same rate on the spike structures as on the control surfaces, the proliferation of fibroblasts was reduced by the spike structures. These effects can result from the cell specific adhesion patterns as shown in this work. These findings show a possibility to design defined surface microstructures, which could control cellular behavior in a cell specific manner.

Transcriptional profiling of cells sorted by RNA abundance

NARCIS (Netherlands)

Klemm, Sandy; Semrau, Stefan; Wiebrands, Kay; Mooijman, Dylan; Faddah, Dina A; Jaenisch, Rudolf; van Oudenaarden, Alexander

We have developed a quantitative technique for sorting cells on the basis of endogenous RNA abundance, with a molecular resolution of 10-20 transcripts. We demonstrate efficient and unbiased RNA extraction from transcriptionally sorted cells and report a high-fidelity transcriptome measurement of

Haptic rendering for simulation of fine manipulation

CERN Document Server

Wang, Dangxiao; Zhang, Yuru

2014-01-01

This book introduces the latest progress in six degrees of freedom (6-DoF) haptic rendering with the focus on a new approach for simulating force/torque feedback in performing tasks that require dexterous manipulation skills. One of the major challenges in 6-DoF haptic rendering is to resolve the conflict between high speed and high fidelity requirements, especially in simulating a tool interacting with both rigid and deformable objects in a narrow space and with fine features. The book presents a configuration-based optimization approach to tackle this challenge. Addressing a key issue in man

Google Searches for "Cheap Cigarettes" Spike at Tax Increases: Evidence from an Algorithm to Detect Spikes in Time Series Data.

Science.gov (United States)

Caputi, Theodore L

2018-05-03

Online cigarette dealers have lower prices than brick-and-mortar retailers and advertise tax-free status.1-8 Previous studies show smokers search out these online alternatives at the time of a cigarette tax increase.9,10 However, these studies rely upon researchers' decision to consider a specific date and preclude the possibility that researchers focus on the wrong date. The purpose of this study is to introduce an unbiased methodology to the field of observing search patterns and to use this methodology to determine whether smokers search Google for "cheap cigarettes" at cigarette tax increases and, if so, whether the increased level of searches persists. Publicly available data from Google Trends is used to observe standardized search volumes for the term, "cheap cigarettes". Seasonal Hybrid Extreme Studentized Deviate and E-Divisive with Means tests were performed to observe spikes and mean level shifts in search volume. Of the twelve cigarette tax increases studied, ten showed spikes in searches for "cheap cigarettes" within two weeks of the tax increase. However, the mean level shifts did not occur for any cigarette tax increase. Searches for "cheap cigarettes" spike around the time of a cigarette tax increase, but the mean level of searches does not shift in response to a tax increase. The SHESD and EDM tests are unbiased methodologies that can be used to identify spikes and mean level shifts in time series data without an a priori date to be studied. SHESD and EDM affirm spikes in interest are related to tax increases. • Applies improved statistical techniques (SHESD and EDM) to Google search data related to cigarettes, reducing bias and increasing power • Contributes to the body of evidence that state and federal tax increases are associated with spikes in searches for cheap cigarettes and may be good dates for increased online health messaging related to tobacco.

Spike-timing theory of working memory.

Directory of Open Access Journals (Sweden)

Botond Szatmáry

Full Text Available Working memory (WM is the part of the brain's memory system that provides temporary storage and manipulation of information necessary for cognition. Although WM has limited capacity at any given time, it has vast memory content in the sense that it acts on the brain's nearly infinite repertoire of lifetime long-term memories. Using simulations, we show that large memory content and WM functionality emerge spontaneously if we take the spike-timing nature of neuronal processing into account. Here, memories are represented by extensively overlapping groups of neurons that exhibit stereotypical time-locked spatiotemporal spike-timing patterns, called polychronous patterns; and synapses forming such polychronous neuronal groups (PNGs are subject to associative synaptic plasticity in the form of both long-term and short-term spike-timing dependent plasticity. While long-term potentiation is essential in PNG formation, we show how short-term plasticity can temporarily strengthen the synapses of selected PNGs and lead to an increase in the spontaneous reactivation rate of these PNGs. This increased reactivation rate, consistent with in vivo recordings during WM tasks, results in high interspike interval variability and irregular, yet systematically changing, elevated firing rate profiles within the neurons of the selected PNGs. Additionally, our theory explains the relationship between such slowly changing firing rates and precisely timed spikes, and it reveals a novel relationship between WM and the perception of time on the order of seconds.

Dual roles for spike signaling in cortical neural populations

Directory of Open Access Journals (Sweden)

Dana eBallard

2011-06-01

Full Text Available A prominent feature of signaling in cortical neurons is that of randomness in the action potential. The output of a typical pyramidal cell can be well fit with a Poisson model, and variations in the Poisson rate repeatedly have been shown to be correlated with stimuli. However while the rate provides a very useful characterization of neural spike data, it may not be the most fundamental description of the signaling code. Recent data showing γ frequency range multi-cell action potential correlations, together with spike timing dependent plasticity, are spurring a re-examination of the classical model, since precise timing codes imply that the generation of spikes is essentially deterministic. Could the observed Poisson randomness and timing determinism reflect two separate modes of communication, or do they somehow derive from a single process? We investigate in a timing-based model whether the apparent incompatibility between these probabilistic and deterministic observations may be resolved by examining how spikes could be used in the underlying neural circuits. The crucial component of this model draws on dual roles for spike signaling. In learning receptive fields from ensembles of inputs, spikes need to behave probabilistically, whereas for fast signaling of individual stimuli, the spikes need to behave deterministically. Our simulations show that this combination is possible if deterministic signals using γ latency coding are probabilistically routed through different members of a cortical cell population at different times. This model exhibits standard features characteristic of Poisson models such as orientation tuning post-stimulus histograms and exponential interval histograms. In addition it makes testable predictions that follow from the γ latency coding.

GRAPHICS-IMAGE MIXED METHOD FOR LARGE-SCALE BUILDINGS RENDERING

Directory of Open Access Journals (Sweden)

Y. Zhou

2018-05-01

Full Text Available Urban 3D model data is huge and unstructured, LOD and Out-of-core algorithm are usually used to reduce the amount of data that drawn in each frame to improve the rendering efficiency. When the scene is large enough, even the complex optimization algorithm is difficult to achieve better results. Based on the traditional study, a novel idea was developed. We propose a graphics and image mixed method for large-scale buildings rendering. Firstly, the view field is divided into several regions, the graphics-image mixed method used to render the scene on both screen and FBO, then blending the FBO with scree. The algorithm is tested on the huge CityGML model data in the urban areas of New York which contained 188195 public building models, and compared with the Cesium platform. The experiment result shows the system was running smoothly. The experimental results confirm that the algorithm can achieve more massive building scene roaming under the same hardware conditions, and can rendering the scene without vision loss.

Model design and simulation of automatic sorting machine using proximity sensor

Directory of Open Access Journals (Sweden)

Bankole I. Oladapo

2016-09-01

Full Text Available The automatic sorting system has been reported to be complex and a global problem. This is because of the inability of sorting machines to incorporate flexibility in their design concept. This research therefore designed and developed an automated sorting object of a conveyor belt. The developed automated sorting machine is able to incorporate flexibility and separate species of non-ferrous metal objects and at the same time move objects automatically to the basket as defined by the regulation of the Programmable Logic Controllers (PLC with a capacitive proximity sensor to detect a value range of objects. The result obtained shows that plastic, wood, and steel were sorted into their respective and correct position with an average, sorting, time of 9.903 s, 14.072 s and 18.648 s respectively. The proposed developed model of this research could be adopted at any institution or industries, whose practices are based on mechatronics engineering systems. This is to guide the industrial sector in sorting of object and teaching aid to institutions and hence produce the list of classified materials according to the enabled sorting program commands.

Enhancement method for rendered images of home decoration based on SLIC superpixels

Science.gov (United States)

Dai, Yutong; Jiang, Xiaotong

2018-04-01

Rendering technology has been widely used in the home decoration industry in recent years for images of home decoration design. However, due to the fact that rendered images of home decoration design rely heavily on the parameters of renderer and the lights of scenes, most rendered images in this industry require further optimization afterwards. To reduce workload and enhance rendered images automatically, an algorithm utilizing neural networks is proposed in this manuscript. In addition, considering few extreme conditions such as strong sunlight and lights, SLIC superpixels based segmentation is used to choose out these bright areas of an image and enhance them independently. Finally, these chosen areas are merged with the entire image. Experimental results show that the proposed method effectively enhances the rendered images when compared with some existing algorithms. Besides, the proposed strategy is proven to be adaptable especially to those images with obvious bright parts.

Two-sorted Point-Interval Temporal Logics

DEFF Research Database (Denmark)

Balbiani, Philippe; Goranko, Valentin; Sciavicco, Guido

2011-01-01

There are two natural and well-studied approaches to temporal ontology and reasoning: point-based and interval-based. Usually, interval-based temporal reasoning deals with points as particular, duration-less intervals. Here we develop explicitly two-sorted point-interval temporal logical framework...... whereby time instants (points) and time periods (intervals) are considered on a par, and the perspective can shift between them within the formal discourse. We focus on fragments involving only modal operators that correspond to the inter-sort relations between points and intervals. We analyze...

Measures of spike train synchrony for data with multiple time scales

NARCIS (Netherlands)

Satuvuori, Eero; Mulansky, Mario; Bozanic, Nebojsa; Malvestio, Irene; Zeldenrust, Fleur; Lenk, Kerstin; Kreuz, Thomas

2017-01-01

Background Measures of spike train synchrony are widely used in both experimental and computational neuroscience. Time-scale independent and parameter-free measures, such as the ISI-distance, the SPIKE-distance and SPIKE-synchronization, are preferable to time scale parametric measures, since by

No WIMP mini-spikes in dwarf spheroidal galaxies

NARCIS (Netherlands)

Wanders, M.; Bertone, G.; Volonteri, M.; Weniger, C.

2015-01-01

The formation of black holes inevitably affects the distribution of dark and baryonic matter in their vicinity, leading to an enhancement of the dark matter density, called spike, and if dark matter is made of WIMPs, to a strong enhancement of the dark matter annihilation rate. Spikes at the center

The Mechanisms of Repetitive Spike Generation in an Axonless Retinal Interneuron

Directory of Open Access Journals (Sweden)

Mark S. Cembrowski

2012-02-01

Full Text Available Several types of retinal interneurons exhibit spikes but lack axons. One such neuron is the AII amacrine cell, in which spikes recorded at the soma exhibit small amplitudes (5 ms. Here, we used electrophysiological recordings and computational analysis to examine the mechanisms underlying this atypical spiking. We found that somatic spikes likely represent large, brief action potential-like events initiated in a single, electrotonically distal dendritic compartment. In this same compartment, spiking undergoes slow modulation, likely by an M-type K conductance. The structural correlate of this compartment is a thin neurite that extends from the primary dendritic tree: local application of TTX to this neurite, or excision of it, eliminates spiking. Thus, the physiology of the axonless AII is much more complex than would be anticipated from morphological descriptions and somatic recordings; in particular, the AII possesses a single dendritic structure that controls its firing pattern.

Building functional networks of spiking model neurons.

Science.gov (United States)

Abbott, L F; DePasquale, Brian; Memmesheimer, Raoul-Martin

2016-03-01

Most of the networks used by computer scientists and many of those studied by modelers in neuroscience represent unit activities as continuous variables. Neurons, however, communicate primarily through discontinuous spiking. We review methods for transferring our ability to construct interesting networks that perform relevant tasks from the artificial continuous domain to more realistic spiking network models. These methods raise a number of issues that warrant further theoretical and experimental study.

View compensated compression of volume rendered images for remote visualization.

Science.gov (United States)

Lalgudi, Hariharan G; Marcellin, Michael W; Bilgin, Ali; Oh, Han; Nadar, Mariappan S

2009-07-01

Remote visualization of volumetric images has gained importance over the past few years in medical and industrial applications. Volume visualization is a computationally intensive process, often requiring hardware acceleration to achieve a real time viewing experience. One remote visualization model that can accomplish this would transmit rendered images from a server, based on viewpoint requests from a client. For constrained server-client bandwidth, an efficient compression scheme is vital for transmitting high quality rendered images. In this paper, we present a new view compensation scheme that utilizes the geometric relationship between viewpoints to exploit the correlation between successive rendered images. The proposed method obviates motion estimation between rendered images, enabling significant reduction to the complexity of a compressor. Additionally, the view compensation scheme, in conjunction with JPEG2000 performs better than AVC, the state of the art video compression standard.

Spike morphology in blast-wave-driven instability experiments

International Nuclear Information System (INIS)

Kuranz, C. C.; Drake, R. P.; Grosskopf, M. J.; Fryxell, B.; Budde, A.; Hansen, J. F.; Miles, A. R.; Plewa, T.; Hearn, N.; Knauer, J.

2010-01-01

The laboratory experiments described in the present paper observe the blast-wave-driven Rayleigh-Taylor instability with three-dimensional (3D) initial conditions. About 5 kJ of energy from the Omega laser creates conditions similar to those of the He-H interface during the explosion phase of a supernova. The experimental target is a 150 μm thick plastic disk followed by a low-density foam. The plastic piece has an embedded, 3D perturbation. The basic structure of the pattern is two orthogonal sine waves where each sine wave has an amplitude of 2.5 μm and a wavelength of 71 μm. In some experiments, an additional wavelength is added to explore the interaction of modes. In experiments with 3D initial conditions the spike morphology differs from what has been observed in other Rayleigh-Taylor experiments and simulations. Under certain conditions, experimental radiographs show some mass extending from the interface to the shock front. Current simulations show neither the spike morphology nor the spike penetration observed in the experiments. The amount of mass reaching the shock front is analyzed and potential causes for the spike morphology and the spikes reaching the shock are discussed. One such hypothesis is that these phenomena may be caused by magnetic pressure, generated by an azimuthal magnetic field produced by the plasma dynamics.

Fast and Efficient Asynchronous Neural Computation with Adapting Spiking Neural Networks

NARCIS (Netherlands)

D. Zambrano (Davide); S.M. Bohte (Sander)

2016-01-01

textabstractBiological neurons communicate with a sparing exchange of pulses - spikes. It is an open question how real spiking neurons produce the kind of powerful neural computation that is possible with deep artificial neural networks, using only so very few spikes to communicate. Building on

Characterizing neural activities evoked by manual acupuncture through spiking irregularity measures

International Nuclear Information System (INIS)

Xue Ming; Wang Jiang; Deng Bin; Wei Xi-Le; Yu Hai-Tao; Chen Ying-Yuan

2013-01-01

The neural system characterizes information in external stimulations by different spiking patterns. In order to examine how neural spiking patterns are related to acupuncture manipulations, experiments are designed in such a way that different types of manual acupuncture (MA) manipulations are taken at the ‘Zusanli’ point of experimental rats, and the induced electrical signals in the spinal dorsal root ganglion are detected and recorded. The interspike interval (ISI) statistical histogram is fitted by the gamma distribution, which has two parameters: one is the time-dependent firing rate and the other is a shape parameter characterizing the spiking irregularities. The shape parameter is the measure of spiking irregularities and can be used to identify the type of MA manipulations. The coefficient of variation is mostly used to measure the spike time irregularity, but it overestimates the irregularity in the case of pronounced firing rate changes. However, experiments show that each acupuncture manipulation will lead to changes in the firing rate. So we combine four relatively rate-independent measures to study the irregularity of spike trains evoked by different types of MA manipulations. Results suggest that the MA manipulations possess unique spiking statistics and characteristics and can be distinguished according to the spiking irregularity measures. These studies have offered new insights into the coding processes and information transfer of acupuncture. (interdisciplinary physics and related areas of science and technology)

Coincidence Detection Using Spiking Neurons with Application to Face Recognition

Directory of Open Access Journals (Sweden)

Fadhlan Kamaruzaman

2015-01-01

Full Text Available We elucidate the practical implementation of Spiking Neural Network (SNN as local ensembles of classifiers. Synaptic time constant τs is used as learning parameter in representing the variations learned from a set of training data at classifier level. This classifier uses coincidence detection (CD strategy trained in supervised manner using a novel supervised learning method called τs Prediction which adjusts the precise timing of output spikes towards the desired spike timing through iterative adaptation of τs. This paper also discusses the approximation of spike timing in Spike Response Model (SRM for the purpose of coincidence detection. This process significantly speeds up the whole process of learning and classification. Performance evaluations with face datasets such as AR, FERET, JAFFE, and CK+ datasets show that the proposed method delivers better face classification performance than the network trained with Supervised Synaptic-Time Dependent Plasticity (STDP. We also found that the proposed method delivers better classification accuracy than k nearest neighbor, ensembles of kNN, and Support Vector Machines. Evaluation on several types of spike codings also reveals that latency coding delivers the best result for face classification as well as for classification of other multivariate datasets.

Adaptive coupling optimized spiking coherence and synchronization in Newman-Watts neuronal networks.

Science.gov (United States)

Gong, Yubing; Xu, Bo; Wu, Ya'nan

2013-09-01

In this paper, we have numerically studied the effect of adaptive coupling on the temporal coherence and synchronization of spiking activity in Newman-Watts Hodgkin-Huxley neuronal networks. It is found that random shortcuts can enhance the spiking synchronization more rapidly when the increment speed of adaptive coupling is increased and can optimize the temporal coherence of spikes only when the increment speed of adaptive coupling is appropriate. It is also found that adaptive coupling strength can enhance the synchronization of spikes and can optimize the temporal coherence of spikes when random shortcuts are appropriate. These results show that adaptive coupling has a big influence on random shortcuts related spiking activity and can enhance and optimize the temporal coherence and synchronization of spiking activity of the network. These findings can help better understand the roles of adaptive coupling for improving the information processing and transmission in neural systems.

Sorting on STAR. [CDC computer algorithm timing comparison

Science.gov (United States)

Stone, H. S.

1978-01-01

Timing comparisons are given for three sorting algorithms written for the CDC STAR computer. One algorithm is Hoare's (1962) Quicksort, which is the fastest or nearly the fastest sorting algorithm for most computers. A second algorithm is a vector version of Quicksort that takes advantage of the STAR's vector operations. The third algorithm is an adaptation of Batcher's (1968) sorting algorithm, which makes especially good use of vector operations but has a complexity of N(log N)-squared as compared with a complexity of N log N for the Quicksort algorithms. In spite of its worse complexity, Batcher's sorting algorithm is competitive with the serial version of Quicksort for vectors up to the largest that can be treated by STAR. Vector Quicksort outperforms the other two algorithms and is generally preferred. These results indicate that unusual instruction sets can introduce biases in program execution time that counter results predicted by worst-case asymptotic complexity analysis.

A Quality Sorting of Fruit Using a New Automatic Image Processing Method

Science.gov (United States)

Amenomori, Michihiro; Yokomizu, Nobuyuki

This paper presents an innovative approach for quality sorting of objects such as apples sorting in an agricultural factory, using an image processing algorithm. The objective of our approach are; firstly to sort the objects by their colors precisely; secondly to detect any irregularity of the colors surrounding the apples efficiently. An experiment has been conducted and the results have been obtained and compared with that has been preformed by human sorting process and by color sensor sorting devices. The results demonstrate that our approach is capable to sort the objects rapidly and the percentage of classification valid rate was 100 %.

Brainlab: a Python toolkit to aid in the design, simulation, and analysis of spiking neural networks with the NeoCortical Simulator

Directory of Open Access Journals (Sweden)

Richard P Drewes

2009-05-01

Full Text Available Neuroscience modeling experiments often involve multiple complex neural network and cell model variants, complex input stimuli and input protocols, followed by complex data analysis. Coordinating all this complexity becomes a central difficulty for the experimenter. The Python programming language, along with its extensive library packages, has emerged as a leading ``glue'' tool for managing all sorts of complex programmatictasks. This paper describes a toolkit called Brainlab, written in Python, that leverages Python's strengths for the task of managing the general complexity of neuroscience modeling experiments. Brainlab was also designed to overcome the major difficulties of working with the NCS environment in particular. Brainlab is an integrated model building, experimentation, and data analysis environment for the powerful parallel spiking neural network simulator system NCS (the NeoCortical Simulator.

Gender Sorting across K-12 Schools in the United States

Science.gov (United States)

Long, Mark C.; Conger, Dylan

2013-01-01

This article documents evidence of nonrandom gender sorting across K-12 schools in the United States. The sorting exists among coed schools and at all grade levels, and it is highest in the secondary school grades. We observe some gender sorting across school sectors and types: for instance, males are slightly underrepresented in private schools…

A matched-filter algorithm to detect amperometric spikes resulting from quantal secretion.

Science.gov (United States)

Balaji Ramachandran, Supriya; Gillis, Kevin D

2018-01-01

Electrochemical microelectrodes located immediately adjacent to the cell surface can detect spikes of amperometric current during exocytosis as the transmitter released from a single vesicle is oxidized on the electrode surface. Automated techniques to detect spikes are needed in order to quantify the spike rate as a measure of the rate of exocytosis. We have developed a Matched Filter (MF) detection algorithm that scans the data set with a library of prototype spike templates while performing a least-squares fit to determine the amplitude and standard error. The ratio of the fit amplitude to the standard error constitutes a criterion score that is assigned for each time point and for each template. A spike is detected when the criterion score exceeds a threshold and the highest-scoring template and the time of peak score is identified. The search for the next spike commences only after the score falls below a second, lower threshold to reduce false positives. The approach was extended to detect spikes with double-exponential decays with the sum of two templates. Receiver Operating Characteristic plots (ROCs) demonstrate that the algorithm detects >95% of manually identified spikes with a false-positive rate of ∼2%. ROCs demonstrate that the MF algorithm performs better than algorithms that detect spikes based on a derivative-threshold approach. The MF approach performs well and leads into approaches to identify spike parameters. Copyright © 2017 Elsevier B.V. All rights reserved.

Software information sorting code 'PLUTO-R'

International Nuclear Information System (INIS)

Tsunematsu, Toshihide; Naraoka, Kenitsu; Adachi, Masao; Takeda, Tatsuoki

1984-10-01

A software information sorting code PLUTO-R is developed as one of the supporting codes of the TRITON system for the fusion plasma analysis. The objective of the PLUTO-R code is to sort reference materials of the codes in the TRITON code system. The easiness in the registration of information is especially pursued. As experience and skill in the data registration are not required, this code is usable for construction of general small-scale information system. This report gives an overall description and the user's manual of the PLUTO-R code. (author)

Sorting signed permutations by inversions in O(nlogn) time.

Science.gov (United States)

Swenson, Krister M; Rajan, Vaibhav; Lin, Yu; Moret, Bernard M E

2010-03-01

The study of genomic inversions (or reversals) has been a mainstay of computational genomics for nearly 20 years. After the initial breakthrough of Hannenhalli and Pevzner, who gave the first polynomial-time algorithm for sorting signed permutations by inversions, improved algorithms have been designed, culminating with an optimal linear-time algorithm for computing the inversion distance and a subquadratic algorithm for providing a shortest sequence of inversions--also known as sorting by inversions. Remaining open was the question of whether sorting by inversions could be done in O(nlogn) time. In this article, we present a qualified answer to this question, by providing two new sorting algorithms, a simple and fast randomized algorithm and a deterministic refinement. The deterministic algorithm runs in time O(nlogn + kn), where k is a data-dependent parameter. We provide the results of extensive experiments showing that both the average and the standard deviation for k are small constants, independent of the size of the permutation. We conclude (but do not prove) that almost all signed permutations can be sorted by inversions in O(nlogn) time.

Method and system for rendering and interacting with an adaptable computing environment

Science.gov (United States)

Osbourn, Gordon Cecil [Albuquerque, NM; Bouchard, Ann Marie [Albuquerque, NM

2012-06-12

An adaptable computing environment is implemented with software entities termed "s-machines", which self-assemble into hierarchical data structures capable of rendering and interacting with the computing environment. A hierarchical data structure includes a first hierarchical s-machine bound to a second hierarchical s-machine. The first hierarchical s-machine is associated with a first layer of a rendering region on a display screen and the second hierarchical s-machine is associated with a second layer of the rendering region overlaying at least a portion of the first layer. A screen element s-machine is linked to the first hierarchical s-machine. The screen element s-machine manages data associated with a screen element rendered to the display screen within the rendering region at the first layer.

Integral image rendering procedure for aberration correction and size measurement.

Science.gov (United States)

Sommer, Holger; Ihrig, Andreas; Ebenau, Melanie; Flühs, Dirk; Spaan, Bernhard; Eichmann, Marion

2014-05-20

The challenge in rendering integral images is to use as much information preserved by the light field as possible to reconstruct a captured scene in a three-dimensional way. We propose a rendering algorithm based on the projection of rays through a detailed simulation of the optical path, considering all the physical properties and locations of the optical elements. The rendered images contain information about the correct size of imaged objects without the need to calibrate the imaging device. Additionally, aberrations of the optical system may be corrected, depending on the setup of the integral imaging device. We show simulation data that illustrates the aberration correction ability and experimental data from our plenoptic camera, which illustrates the capability of our proposed algorithm to measure size and distance. We believe this rendering procedure will be useful in the future for three-dimensional ophthalmic imaging of the human retina.

Thermal spike analysis of highly charged ion tracks

International Nuclear Information System (INIS)

Karlušić, M.; Jakšić, M.

2012-01-01

The irradiation of material using swift heavy ion or highly charged ion causes excitation of the electron subsystem at nanometer scale along the ion trajectory. According to the thermal spike model, energy deposited into the electron subsystem leads to temperature increase due to electron–phonon coupling. If ion-induced excitation is sufficiently intensive, then melting of the material can occur, and permanent damage (i.e., ion track) can be formed upon rapid cooling. We present an extension of the analytical thermal spike model of Szenes for the analysis of surface ion track produced after the impact of highly charged ion. By applying the model to existing experimental data, more than 60% of the potential energy of the highly charged ion was shown to be retained in the material during the impact and transformed into the energy of the thermal spike. This value is much higher than 20–40% of the transferred energy into the thermal spike by swift heavy ion. Thresholds for formation of highly charged ion track in different materials show uniform behavior depending only on few material parameters.

Inherently stochastic spiking neurons for probabilistic neural computation

KAUST Repository

Al-Shedivat, Maruan

2015-04-01

Neuromorphic engineering aims to design hardware that efficiently mimics neural circuitry and provides the means for emulating and studying neural systems. In this paper, we propose a new memristor-based neuron circuit that uniquely complements the scope of neuron implementations and follows the stochastic spike response model (SRM), which plays a cornerstone role in spike-based probabilistic algorithms. We demonstrate that the switching of the memristor is akin to the stochastic firing of the SRM. Our analysis and simulations show that the proposed neuron circuit satisfies a neural computability condition that enables probabilistic neural sampling and spike-based Bayesian learning and inference. Our findings constitute an important step towards memristive, scalable and efficient stochastic neuromorphic platforms. © 2015 IEEE.

Light Field Rendering for Head Mounted Displays using Pixel Reprojection

DEFF Research Database (Denmark)

Hansen, Anne Juhler; Klein, Jákup; Kraus, Martin

2017-01-01

Light field displays have advantages over traditional stereoscopic head mounted displays, for example, because they can overcome the vergence-accommodation conflict. However, rendering light fields can be a heavy task for computers due to the number of images that have to be rendered. Since much ...

Learning of Precise Spike Times with Homeostatic Membrane Potential Dependent Synaptic Plasticity.

Directory of Open Access Journals (Sweden)

Christian Albers

Full Text Available Precise spatio-temporal patterns of neuronal action potentials underly e.g. sensory representations and control of muscle activities. However, it is not known how the synaptic efficacies in the neuronal networks of the brain adapt such that they can reliably generate spikes at specific points in time. Existing activity-dependent plasticity rules like Spike-Timing-Dependent Plasticity are agnostic to the goal of learning spike times. On the other hand, the existing formal and supervised learning algorithms perform a temporally precise comparison of projected activity with the target, but there is no known biologically plausible implementation of this comparison. Here, we propose a simple and local unsupervised synaptic plasticity mechanism that is derived from the requirement of a balanced membrane potential. Since the relevant signal for synaptic change is the postsynaptic voltage rather than spike times, we call the plasticity rule Membrane Potential Dependent Plasticity (MPDP. Combining our plasticity mechanism with spike after-hyperpolarization causes a sensitivity of synaptic change to pre- and postsynaptic spike times which can reproduce Hebbian spike timing dependent plasticity for inhibitory synapses as was found in experiments. In addition, the sensitivity of MPDP to the time course of the voltage when generating a spike allows MPDP to distinguish between weak (spurious and strong (teacher spikes, which therefore provides a neuronal basis for the comparison of actual and target activity. For spatio-temporal input spike patterns our conceptually simple plasticity rule achieves a surprisingly high storage capacity for spike associations. The sensitivity of the MPDP to the subthreshold membrane potential during training allows robust memory retrieval after learning even in the presence of activity corrupted by noise. We propose that MPDP represents a biophysically plausible mechanism to learn temporal target activity patterns.

Learning of Precise Spike Times with Homeostatic Membrane Potential Dependent Synaptic Plasticity.

Science.gov (United States)

Albers, Christian; Westkott, Maren; Pawelzik, Klaus

2016-01-01

Precise spatio-temporal patterns of neuronal action potentials underly e.g. sensory representations and control of muscle activities. However, it is not known how the synaptic efficacies in the neuronal networks of the brain adapt such that they can reliably generate spikes at specific points in time. Existing activity-dependent plasticity rules like Spike-Timing-Dependent Plasticity are agnostic to the goal of learning spike times. On the other hand, the existing formal and supervised learning algorithms perform a temporally precise comparison of projected activity with the target, but there is no known biologically plausible implementation of this comparison. Here, we propose a simple and local unsupervised synaptic plasticity mechanism that is derived from the requirement of a balanced membrane potential. Since the relevant signal for synaptic change is the postsynaptic voltage rather than spike times, we call the plasticity rule Membrane Potential Dependent Plasticity (MPDP). Combining our plasticity mechanism with spike after-hyperpolarization causes a sensitivity of synaptic change to pre- and postsynaptic spike times which can reproduce Hebbian spike timing dependent plasticity for inhibitory synapses as was found in experiments. In addition, the sensitivity of MPDP to the time course of the voltage when generating a spike allows MPDP to distinguish between weak (spurious) and strong (teacher) spikes, which therefore provides a neuronal basis for the comparison of actual and target activity. For spatio-temporal input spike patterns our conceptually simple plasticity rule achieves a surprisingly high storage capacity for spike associations. The sensitivity of the MPDP to the subthreshold membrane potential during training allows robust memory retrieval after learning even in the presence of activity corrupted by noise. We propose that MPDP represents a biophysically plausible mechanism to learn temporal target activity patterns.

Light Field Rendering for Head Mounted Displays using Pixel Reprojection

DEFF Research Database (Denmark)

Hansen, Anne Juhler; Klein, Jákup; Kraus, Martin

2017-01-01

of the information of the different images is redundant, we use pixel reprojection from the corner cameras to compute the remaining images in the light field. We compare the reprojected images with directly rendered images in a user test. In most cases, the users were unable to distinguish the images. In extreme...... cases, the reprojection approach is not capable of creating the light field. We conclude that pixel reprojection is a feasible method for rendering light fields as far as quality of perspective and diffuse shading is concerned, but render time needs to be reduced to make the method practical....

A QR code identification technology in package auto-sorting system

Science.gov (United States)

di, Yi-Juan; Shi, Jian-Ping; Mao, Guo-Yong

2017-07-01

Traditional manual sorting operation is not suitable for the development of Chinese logistics. For better sorting packages, a QR code recognition technology is proposed to identify the QR code label on the packages in package auto-sorting system. The experimental results compared with other algorithms in literatures demonstrate that the proposed method is valid and its performance is superior to other algorithms.

Correlations decrease with propagation of spiking activity in the mouse barrel cortex

Directory of Open Access Journals (Sweden)

Gayathri Nattar Ranganathan

2011-05-01

Full Text Available Propagation of suprathreshold spiking activity through neuronal populations is important for the function of the central nervous system. Neural correlations have an impact on cortical function particularly on the signaling of information and propagation of spiking activity. Therefore we measured the change in correlations as suprathreshold spiking activity propagated between recurrent neuronal networks of the mammalian cerebral cortex. Using optical methods we recorded spiking activity from large samples of neurons from two neural populations simultaneously. The results indicate that correlations decreased as spiking activity propagated from layer 4 to layer 2/3 in the rodent barrel cortex.

Absolute Ca Isotopic Measurement Using an Improved Double Spike Technique

Directory of Open Access Journals (Sweden)

Jason Jiun-San Shen

2009-01-01

Full Text Available A new vector analytical method has been developed in order to obtain the true isotopic composition of the 42Ca-48Ca double spike. This is achieved by using two different sample-spike mixtures combined with the double spike and natural Ca data. Be cause the natural sample (two mixtures and the spike should all lie on a single mixing line, we are able to con strain the true isotopic composition of our double spike using this new approach. Once the isotopic composition of the Ca double spike is established, we are able to obtain the true Ca isotopic composition of the NIST Ca standard SRM915a, 40Ca/44Ca = 46.537 ± 2 (2sm, n = 55, 42Ca/44Ca = 0.31031 ± 1, 43Ca/44Ca = 0.06474 ± 1, and 48Ca/44Ca = 0.08956 ± 1. De spite an off set of 1.3% in 40Ca/44Ca between our result and the previously re ported value (Russell et al. 1978, our data indicate an off set of 1.89__in 40Ca/44Ca between SRM915a and seawater, entirely consistent with the published results.

Architecture for high performance stereoscopic game rendering on Android

Science.gov (United States)

Flack, Julien; Sanderson, Hugh; Shetty, Sampath

2014-03-01

Stereoscopic gaming is a popular source of content for consumer 3D display systems. There has been a significant shift in the gaming industry towards casual games for mobile devices running on the Android™ Operating System and driven by ARM™ and other low power processors. Such systems are now being integrated directly into the next generation of 3D TVs potentially removing the requirement for an external games console. Although native stereo support has been integrated into some high profile titles on established platforms like Windows PC and PS3 there is a lack of GPU independent 3D support for the emerging Android platform. We describe a framework for enabling stereoscopic 3D gaming on Android for applications on mobile devices, set top boxes and TVs. A core component of the architecture is a 3D game driver, which is integrated into the Android OpenGL™ ES graphics stack to convert existing 2D graphics applications into stereoscopic 3D in real-time. The architecture includes a method of analyzing 2D games and using rule based Artificial Intelligence (AI) to position separate objects in 3D space. We describe an innovative stereo 3D rendering technique to separate the views in the depth domain and render directly into the display buffer. The advantages of the stereo renderer are demonstrated by characterizing the performance in comparison to more traditional render techniques, including depth based image rendering, both in terms of frame rates and impact on battery consumption.

BayesMotif: de novo protein sorting motif discovery from impure datasets.

Science.gov (United States)

Hu, Jianjun; Zhang, Fan

2010-01-18

Protein sorting is the process that newly synthesized proteins are transported to their target locations within or outside of the cell. This process is precisely regulated by protein sorting signals in different forms. A major category of sorting signals are amino acid sub-sequences usually located at the N-terminals or C-terminals of protein sequences. Genome-wide experimental identification of protein sorting signals is extremely time-consuming and costly. Effective computational algorithms for de novo discovery of protein sorting signals is needed to improve the understanding of protein sorting mechanisms. We formulated the protein sorting motif discovery problem as a classification problem and proposed a Bayesian classifier based algorithm (BayesMotif) for de novo identification of a common type of protein sorting motifs in which a highly conserved anchor is present along with a less conserved motif regions. A false positive removal procedure is developed to iteratively remove sequences that are unlikely to contain true motifs so that the algorithm can identify motifs from impure input sequences. Experiments on both implanted motif datasets and real-world datasets showed that the enhanced BayesMotif algorithm can identify anchored sorting motifs from pure or impure protein sequence dataset. It also shows that the false positive removal procedure can help to identify true motifs even when there is only 20% of the input sequences containing true motif instances. We proposed BayesMotif, a novel Bayesian classification based algorithm for de novo discovery of a special category of anchored protein sorting motifs from impure datasets. Compared to conventional motif discovery algorithms such as MEME, our algorithm can find less-conserved motifs with short highly conserved anchors. Our algorithm also has the advantage of easy incorporation of additional meta-sequence features such as hydrophobicity or charge of the motifs which may help to overcome the limitations of

Extreme Simplification and Rendering of Point Sets using Algebraic Multigrid

NARCIS (Netherlands)

Reniers, Dennie; Telea, Alexandru

2005-01-01

We present a novel approach for extreme simplification of point set models in the context of real-time rendering. Point sets are often rendered using simple point primitives, such as oriented discs. However efficient, simple primitives are less effective in approximating large surface areas. A large

A Model Vision of Sorting System Application Using Robotic Manipulator

Directory of Open Access Journals (Sweden)

Maralo Sinaga

2010-08-01

Full Text Available Image processing in today’s world grabs massive attentions as it leads to possibilities of broaden application in many fields of high technology. The real challenge is how to improve existing sorting system in the Moduler Processing System (MPS laboratory which consists of four integrated stations of distribution, testing, processing and handling with a new image processing feature. Existing sorting method uses a set of inductive, capacitive and optical sensors do differentiate object color. This paper presents a mechatronics color sorting system solution with the application of image processing. Supported by OpenCV, image processing procedure senses the circular objects in an image captured in realtime by a webcam and then extracts color and position information out of it. This information is passed as a sequence of sorting commands to the manipulator (Mitsubishi Movemaster RV-M1 that does pick-and-place mechanism. Extensive testing proves that this color based object sorting system works 100% accurate under ideal condition in term of adequate illumination, circular objects’ shape and color. The circular objects tested for sorting are silver, red and black. For non-ideal condition, such as unspecified color the accuracy reduces to 80%.

The Nature of Power Spikes: a regime-switch approach

NARCIS (Netherlands)

C.M. de Jong (Cyriel)

2005-01-01

textabstractDue to its non-storable nature, electricity is a commodity with probably the most volatile spot prices, exemplified by occasional spikes. Appropriate pricing, portfolio, and risk management models have to incorporate these characteristics, and the spikes in particular. We investigate the

Transcriptome Analysis for Abnormal Spike Development of the Wheat Mutant dms.

Science.gov (United States)

Zhu, Xin-Xin; Li, Qiao-Yun; Shen, Chun-Cai; Duan, Zong-Biao; Yu, Dong-Yan; Niu, Ji-Shan; Ni, Yong-Jing; Jiang, Yu-Mei

2016-01-01

Wheat (Triticum aestivum L.) spike development is the foundation for grain yield. We obtained a novel wheat mutant, dms, characterized as dwarf, multi-pistil and sterility. Although the genetic changes are not clear, the heredity of traits suggests that a recessive gene locus controls the two traits of multi-pistil and sterility in self-pollinating populations of the medium plants (M), such that the dwarf genotype (D) and tall genotype (T) in the progeny of the mutant are ideal lines for studies regarding wheat spike development. The objective of this study was to explore the molecular basis for spike abnormalities of dwarf genotype. Four unigene libraries were assembled by sequencing the mRNAs of the super-bulked differentiating spikes and stem tips of the D and T plants. Using integrative analysis, we identified 419 genes highly expressed in spikes, including nine typical homeotic genes of the MADS-box family and the genes TaAP2, TaFL and TaDL. We also identified 143 genes that were significantly different between young spikes of T and D, and 26 genes that were putatively involved in spike differentiation. The result showed that the expression levels of TaAP1-2, TaAP2, and other genes involved in the majority of biological processes such as transcription, translation, cell division, photosynthesis, carbohydrate transport and metabolism, and energy production and conversion were significantly lower in D than in T. We identified a set of genes related to wheat floral organ differentiation, including typical homeotic genes. Our results showed that the major causal factors resulting in the spike abnormalities of dms were the lower expression homeotic genes, hormonal imbalance, repressed biological processes, and deficiency of construction materials and energy. We performed a series of studies on the homeotic genes, however the other three causal factors for spike abnormal phenotype of dms need further study.

Sorting live stem cells based on Sox2 mRNA expression.

Directory of Open Access Journals (Sweden)

Hans M Larsson

Full Text Available While cell sorting usually relies on cell-surface protein markers, molecular beacons (MBs offer the potential to sort cells based on the presence of any expressed mRNA and in principle could be extremely useful to sort rare cell populations from primary isolates. We show here how stem cells can be purified from mixed cell populations by sorting based on MBs. Specifically, we designed molecular beacons targeting Sox2, a well-known stem cell marker for murine embryonic (mES and neural stem cells (NSC. One of our designed molecular beacons displayed an increase in fluorescence compared to a nonspecific molecular beacon both in vitro and in vivo when tested in mES and NSCs. We sorted Sox2-MB(+SSEA1(+ cells from a mixed population of 4-day retinoic acid-treated mES cells and effectively isolated live undifferentiated stem cells. Additionally, Sox2-MB(+ cells isolated from primary mouse brains were sorted and generated neurospheres with higher efficiency than Sox2-MB(- cells. These results demonstrate the utility of MBs for stem cell sorting in an mRNA-specific manner.

Axonal propagation of simple and complex spikes in cerebellar Purkinje neurons.

Science.gov (United States)

Khaliq, Zayd M; Raman, Indira M

2005-01-12

In cerebellar Purkinje neurons, the reliability of propagation of high-frequency simple spikes and spikelets of complex spikes is likely to regulate inhibition of Purkinje target neurons. To test the extent to which a one-to-one correspondence exists between somatic and axonal spikes, we made dual somatic and axonal recordings from Purkinje neurons in mouse cerebellar slices. Somatic action potentials were recorded with a whole-cell pipette, and the corresponding axonal signals were recorded extracellularly with a loose-patch pipette. Propagation of spontaneous and evoked simple spikes was highly reliable. At somatic firing rates of approximately 200 spikes/sec, 375 Hz during somatic hyperpolarizations that silenced spontaneous firing to approximately 150 Hz during spontaneous activity. The probability of propagation of individual spikelets could be described quantitatively as a saturating function of spikelet amplitude, rate of rise, or preceding interspike interval. The results suggest that ion channels of Purkinje axons are adapted to produce extremely short refractory periods and that brief bursts of forward-propagating action potentials generated by complex spikes may contribute transiently to inhibition of postsynaptic neurons.

Fluid-thermal analysis of aerodynamic heating over spiked blunt body configurations

Science.gov (United States)

Qin, Qihao; Xu, Jinglei; Guo, Shuai

2017-03-01

When flying at hypersonic speeds, the spiked blunt body is constantly subjected to severe aerodynamic heating. To illustrate the thermal response of different configurations and the relevant flow field variation, a loosely-coupled fluid-thermal analysis is performed in this paper. The Mesh-based parallel Code Coupling Interface (MpCCI) is adopted to implement the data exchange between the fluid solver and the thermal solver. The results indicate that increases in spike diameter and length will result in a sharp decline of the wall temperature along the spike, and the overall heat flux is remarkably reduced to less than 300 W/cm2 with the aerodome mounted at the spike tip. Moreover, the presence and evolution of small vortices within the recirculation zone are observed and proved to be induced by the stagnation effect of reattachment points on the spike. In addition, the drag coefficient of the configuration with a doubled spike length presents a maximum drop of 4.59% due to the elevated wall temperature. And the growing difference of the drag coefficient is further increased during the accelerating process.

The chronotron: a neuron that learns to fire temporally precise spike patterns.

Directory of Open Access Journals (Sweden)

Răzvan V Florian

Full Text Available In many cases, neurons process information carried by the precise timings of spikes. Here we show how neurons can learn to generate specific temporally precise output spikes in response to input patterns of spikes having precise timings, thus processing and memorizing information that is entirely temporally coded, both as input and as output. We introduce two new supervised learning rules for spiking neurons with temporal coding of information (chronotrons, one that provides high memory capacity (E-learning, and one that has a higher biological plausibility (I-learning. With I-learning, the neuron learns to fire the target spike trains through synaptic changes that are proportional to the synaptic currents at the timings of real and target output spikes. We study these learning rules in computer simulations where we train integrate-and-fire neurons. Both learning rules allow neurons to fire at the desired timings, with sub-millisecond precision. We show how chronotrons can learn to classify their inputs, by firing identical, temporally precise spike trains for different inputs belonging to the same class. When the input is noisy, the classification also leads to noise reduction. We compute lower bounds for the memory capacity of chronotrons and explore the influence of various parameters on chronotrons' performance. The chronotrons can model neurons that encode information in the time of the first spike relative to the onset of salient stimuli or neurons in oscillatory networks that encode information in the phases of spikes relative to the background oscillation. Our results show that firing one spike per cycle optimizes memory capacity in neurons encoding information in the phase of firing relative to a background rhythm.

Accelerated spike resampling for accurate multiple testing controls.

Science.gov (United States)

Harrison, Matthew T

2013-02-01

Controlling for multiple hypothesis tests using standard spike resampling techniques often requires prohibitive amounts of computation. Importance sampling techniques can be used to accelerate the computation. The general theory is presented, along with specific examples for testing differences across conditions using permutation tests and for testing pairwise synchrony and precise lagged-correlation between many simultaneously recorded spike trains using interval jitter.

Perceptron learning rule derived from spike-frequency adaptation and spike-time-dependent plasticity.

Science.gov (United States)

D'Souza, Prashanth; Liu, Shih-Chii; Hahnloser, Richard H R

2010-03-09

It is widely believed that sensory and motor processing in the brain is based on simple computational primitives rooted in cellular and synaptic physiology. However, many gaps remain in our understanding of the connections between neural computations and biophysical properties of neurons. Here, we show that synaptic spike-time-dependent plasticity (STDP) combined with spike-frequency adaptation (SFA) in a single neuron together approximate the well-known perceptron learning rule. Our calculations and integrate-and-fire simulations reveal that delayed inputs to a neuron endowed with STDP and SFA precisely instruct neural responses to earlier arriving inputs. We demonstrate this mechanism on a developmental example of auditory map formation guided by visual inputs, as observed in the external nucleus of the inferior colliculus (ICX) of barn owls. The interplay of SFA and STDP in model ICX neurons precisely transfers the tuning curve from the visual modality onto the auditory modality, demonstrating a useful computation for multimodal and sensory-guided processing.

Design and analysis on sorting blade for automated size-based sorting device

Science.gov (United States)

Razali, Zol Bahri; Kader, Mohamed Mydin M. Abdul; Samsudin, Yasser Suhaimi; Daud, Mohd Hisam

2017-09-01

Nowadays rubbish separating or recycling is a main problem of nation, where peoples dumped their rubbish into dumpsite without caring the value of the rubbish if it can be recycled and reused. Thus the author proposed an automated segregating device, purposely to teach people to separate their rubbish and value the rubbish that can be reused. The automated size-based mechanical segregating device provides significant improvements in terms of efficiency and consistency in this segregating process. This device is designed to make recycling easier, user friendly, in the hope that more people will take responsibility if it is less of an expense of time and effort. This paper discussed about redesign a blade for the sorting device which is to develop an efficient automated mechanical sorting device for the similar material but in different size. The machine is able to identify the size of waste and it depends to the coil inside the container to separate it out. The detail design and methodology is described in detail in this paper.

Real-time computing platform for spiking neurons (RT-spike).

Science.gov (United States)

Ros, Eduardo; Ortigosa, Eva M; Agís, Rodrigo; Carrillo, Richard; Arnold, Michael

2006-07-01

A computing platform is described for simulating arbitrary networks of spiking neurons in real time. A hybrid computing scheme is adopted that uses both software and hardware components to manage the tradeoff between flexibility and computational power; the neuron model is implemented in hardware and the network model and the learning are implemented in software. The incremental transition of the software components into hardware is supported. We focus on a spike response model (SRM) for a neuron where the synapses are modeled as input-driven conductances. The temporal dynamics of the synaptic integration process are modeled with a synaptic time constant that results in a gradual injection of charge. This type of model is computationally expensive and is not easily amenable to existing software-based event-driven approaches. As an alternative we have designed an efficient time-based computing architecture in hardware, where the different stages of the neuron model are processed in parallel. Further improvements occur by computing multiple neurons in parallel using multiple processing units. This design is tested using reconfigurable hardware and its scalability and performance evaluated. Our overall goal is to investigate biologically realistic models for the real-time control of robots operating within closed action-perception loops, and so we evaluate the performance of the system on simulating a model of the cerebellum where the emulation of the temporal dynamics of the synaptic integration process is important.

SPAN: spike pattern association neuron for learning spatio-temporal sequences

OpenAIRE

Mohemmed, A; Schliebs, S; Matsuda, S; Kasabov, N

2012-01-01

Spiking Neural Networks (SNN) were shown to be suitable tools for the processing of spatio-temporal information. However, due to their inherent complexity, the formulation of efficient supervised learning algorithms for SNN is difficult and remains an important problem in the research area. This article presents SPAN — a spiking neuron that is able to learn associations of arbitrary spike trains in a supervised fashion allowing the processing of spatio-temporal information encoded in the prec...

Standard practice for cell sorting in a BSL-3 facility.

Science.gov (United States)

Perfetto, Stephen P; Ambrozak, David R; Nguyen, Richard; Roederer, Mario; Koup, Richard A; Holmes, Kevin L

2011-01-01

Over the past decade, there has been a rapid growth in the number of BSL-3 and BSL-4 laboratories in the USA and an increase in demand for infectious cell sorting in BSL-3 laboratories. In 2007, the International Society for Advancement of Cytometry (ISAC) Biosafety Committee published standards for the sorting of unfixed cells and is an important resource for biosafety procedures when performing infectious cell sorting. Following a careful risk assessment, if it is determined that a cell sorter must be located within a BSL-3 laboratory, there are a variety of factors to be considered prior to the establishment of the laboratory. This chapter outlines procedures for infectious cell sorting in a BSL-3 environment to facilitate the establishment and safe operation of a BSL-3 cell sorting laboratory. Subjects covered include containment verification, remote operation, disinfection, personal protective equipment (PPE), and instrument-specific modifications for enhanced aerosol evacuation.

Color-coded volume rendering for three-dimensional reconstructions of CT data

International Nuclear Information System (INIS)

Rieker, O.; Mildenberger, P.; Thelen, M.

1999-01-01

Purpose: To evaluate a technique of colored three-dimensional reconstructions without segmentation. Material and methods: Color-coded volume rendered images were reconstructed from the volume data of 25 thoracic, abdominal, musculoskeletal, and vascular helical CT scans using commercial software. The CT volume rendered voxels were encoded with color in the following manner. Opacity, hue, lightness, and chroma were assigned to each of four classes defined by CT number. Color-coded reconstructions were compared to the corresponding grey-scale coded reconstructions. Results: Color-coded volume rendering enabled realistic visualization of pathologic findings when there was sufficient difference in CT density. Segmentation was necessary in some cases to demonstrate small details in a complex volume. Conclusion: Color-coded volume rendering allowed lifelike visualisation of CT volumes without the need of segmentation in most cases. (orig.) [de

Physically-Based Rendering of Particle-Based Fluids with Light Transport Effects

Science.gov (United States)

Beddiaf, Ali; Babahenini, Mohamed Chaouki

2018-03-01

Recent interactive rendering approaches aim to efficiently produce images. However, time constraints deeply affect their output accuracy and realism (many light phenomena are poorly or not supported at all). To remedy this issue, in this paper, we propose a physically-based fluid rendering approach. First, while state-of-the-art methods focus on isosurface rendering with only two refractions, our proposal (1) considers the fluid as a heterogeneous participating medium with refractive boundaries, and (2) supports both multiple refractions and scattering. Second, the proposed solution is fully particle-based in the sense that no particles transformation into a grid is required. This interesting feature makes it able to handle many particle types (water, bubble, foam, and sand). On top of that, a medium with different fluids (color, phase function, etc.) can also be rendered.

Impact of substance P on the correlation of spike train evoked by electro acupuncture

International Nuclear Information System (INIS)

Jin, Chen; Zhang, Xuan; Wang, Jiang; Guo, Yi; Zhao, Xue; Guo, Yong-Ming

2016-01-01

Highlights: • We analyze spike trains induced by EA before and after inhibiting SP in PC6 area. • Inhibiting SP leads to an increase of spiking rate of median nerve. • SP may modulate membrane potential to affect the spiking rate. • SP has an influence on long-range correlation of spike train evoked by EA. • SP play an important role in EA-induced neural spiking and encoding. - Abstract: Substance P (SP) participates in the neural signal transmission evoked by electro-acupuncture (EA). This paper investigates the impact of SP on the correlation of spike train in the median nerve evoked by EA at 'Neiguan' acupoint (PC6). It shows that the spiking rate and interspike interval (ISI) distribution change obviously after inhibiting SP. This variation of spiking activity indicates that SP affects the temporal structure of spike train through modulating the action potential on median nerve filaments. Furtherly, the correlation coefficient and scaling exponent are considered to measure the correlation of spike train. Scaled Windowed Variance (SWV) method is applied to calculate scaling exponent which quantifies the long-range correlation of the neural electrical signals. It is found that the correlation coefficients of ISI increase after inhibiting SP released. In addition, the scaling exponents of neuronal spike train have significant differences between before and after inhibiting SP. These findings demonstrate that SP has an influence on the long-range correlation of spike train. Our results indicate that SP may play an important role in EA-induced neural spiking and encoding.

Cochlear spike synchronization and neuron coincidence detection model

Science.gov (United States)

Bader, Rolf

2018-02-01

Coincidence detection of a spike pattern fed from the cochlea into a single neuron is investigated using a physical Finite-Difference model of the cochlea and a physiologically motivated neuron model. Previous studies have shown experimental evidence of increased spike synchronization in the nucleus cochlearis and the trapezoid body [Joris et al., J. Neurophysiol. 71(3), 1022-1036 and 1037-1051 (1994)] and models show tone partial phase synchronization at the transition from mechanical waves on the basilar membrane into spike patterns [Ch. F. Babbs, J. Biophys. 2011, 435135]. Still the traveling speed of waves on the basilar membrane cause a frequency-dependent time delay of simultaneously incoming sound wavefronts up to 10 ms. The present model shows nearly perfect synchronization of multiple spike inputs as neuron outputs with interspike intervals (ISI) at the periodicity of the incoming sound for frequencies from about 30 to 300 Hz for two different amounts of afferent nerve fiber neuron inputs. Coincidence detection serves here as a fusion of multiple inputs into one single event enhancing pitch periodicity detection for low frequencies, impulse detection, or increased sound or speech intelligibility due to dereverberation.

The variational spiked oscillator

International Nuclear Information System (INIS)

Aguilera-Navarro, V.C.; Ullah, N.

1992-08-01

A variational analysis of the spiked harmonic oscillator Hamiltonian -d 2 / d x 2 + x 2 + δ/ x 5/2 , δ > 0, is reported in this work. A trial function satisfying Dirichlet boundary conditions is suggested. The results are excellent for a large range of values of the coupling parameter. (author)

Trace element ink spiking for signature authentication

International Nuclear Information System (INIS)

Hatzistavros, V.S.; Kallithrakas-Kontos, N.G.

2008-01-01

Signature authentication is a critical question in forensic document examination. Last years the evolution of personal computers made signature copying a quite easy task, so the development of new ways for signature authentication is crucial. In the present work a commercial ink was spiked with many trace elements in various concentrations. Inorganic and organometallic ink soluble compounds were used as spiking agents, whilst ink retained its initial properties. The spiked inks were used for paper writing and the documents were analyzed by a non destructive method, the energy dispersive X-ray fluorescence. The thin target model was proved right for quantitative analysis and a very good linear relationship of the intensity (X-ray signal) against concentration was estimated for all used elements. Intensity ratios between different elements in the same ink gave very stable results, independent on the writing alterations. The impact of time both to written document and prepared inks was also investigated. (author)

Parallel sort with a ranged, partitioned key-value store in a high perfomance computing environment

Science.gov (United States)

Bent, John M.; Faibish, Sorin; Grider, Gary; Torres, Aaron; Poole, Stephen W.

2016-01-26

Improved sorting techniques are provided that perform a parallel sort using a ranged, partitioned key-value store in a high performance computing (HPC) environment. A plurality of input data files comprising unsorted key-value data in a partitioned key-value store are sorted. The partitioned key-value store comprises a range server for each of a plurality of ranges. Each input data file has an associated reader thread. Each reader thread reads the unsorted key-value data in the corresponding input data file and performs a local sort of the unsorted key-value data to generate sorted key-value data. A plurality of sorted, ranged subsets of each of the sorted key-value data are generated based on the plurality of ranges. Each sorted, ranged subset corresponds to a given one of the ranges and is provided to one of the range servers corresponding to the range of the sorted, ranged subset. Each range server sorts the received sorted, ranged subsets and provides a sorted range. A plurality of the sorted ranges are concatenated to obtain a globally sorted result.

A case-control study of wicket spikes using video-EEG monitoring.

Science.gov (United States)

Vallabhaneni, Maya; Baldassari, Laura E; Scribner, James T; Cho, Yong Won; Motamedi, Gholam K

2013-01-01

To investigate clinical characteristics associated with wicket spikes in patients undergoing long-term video-EEG monitoring. A case-control study was performed in 479 patients undergoing video-EEG monitoring, with 3 age- (±3 years) and gender-matched controls per patient with wicket spikes. Logistic regression was utilized to investigate the association between wicket spikes and other factors, including conditions that have been previously associated with wicket spikes. Wicket spikes were recorded in 48 patients. There was a significantly higher prevalence of dizziness/vertigo (p=0.002), headaches (p=0.005), migraine (p=0.015), and seizures (p=0.016) in patients with wickets. The majority of patients with wicket spikes did not exhibit epileptiform activity on EEG; however, patients with history of seizures were more likely to have wickets (p=0.017). There was no significant difference in the prevalence of psychogenic non-epileptic seizures between the groups. Wickets were more common on the left, during sleep, and more likely to be first recorded on day 1-2 of monitoring. Patients with wicket spikes are more likely to have dizziness/vertigo, headaches, migraine, and seizures. Patients with history of seizures are more likely to have wickets. The prevalence of psychogenic non-epileptic seizures is not significantly higher in patients with wickets. Copyright © 2012 British Epilepsy Association. Published by Elsevier Ltd. All rights reserved.

Sorting Real Numbers in $O(n\\sqrt{\\log n})$ Time and Linear Space

OpenAIRE

Han, Yijie

2017-01-01

We present an $O(n\\sqrt{\\log n})$ time and linear space algorithm for sorting real numbers. This breaks the long time illusion that real numbers have to be sorted by comparison sorting and take $\\Omega (n\\log n)$ time to be sorted.

4D CT sorting based on patient internal anatomy

Science.gov (United States)

Li, Ruijiang; Lewis, John H.; Cerviño, Laura I.; Jiang, Steve B.

2009-08-01

Respiratory motion during free-breathing computed tomography (CT) scan may cause significant errors in target definition for tumors in the thorax and upper abdomen. A four-dimensional (4D) CT technique has been widely used for treatment simulation of thoracic and abdominal cancer radiotherapy. The current 4D CT techniques require retrospective sorting of the reconstructed CT slices oversampled at the same couch position. Most sorting methods depend on external surrogates of respiratory motion recorded by extra instruments. However, respiratory signals obtained from these external surrogates may not always accurately represent the internal target motion, especially when irregular breathing patterns occur. We have proposed a new sorting method based on multiple internal anatomical features for multi-slice CT scan acquired in the cine mode. Four features are analyzed in this study, including the air content, lung area, lung density and body area. We use a measure called spatial coherence to select the optimal internal feature at each couch position and to generate the respiratory signals for 4D CT sorting. The proposed method has been evaluated for ten cancer patients (eight with thoracic cancer and two with abdominal cancer). For nine patients, the respiratory signals generated from the combined internal features are well correlated to those from external surrogates recorded by the real-time position management (RPM) system (average correlation: 0.95 ± 0.02), which is better than any individual internal measures at 95% confidence level. For these nine patients, the 4D CT images sorted by the combined internal features are almost identical to those sorted by the RPM signal. For one patient with an irregular breathing pattern, the respiratory signals given by the combined internal features do not correlate well with those from RPM (correlation: 0.68 ± 0.42). In this case, the 4D CT image sorted by our method presents fewer artifacts than that from the RPM signal. Our

On the Spike Train Variability Characterized by Variance-to-Mean Power Relationship.

Science.gov (United States)

Koyama, Shinsuke

2015-07-01

We propose a statistical method for modeling the non-Poisson variability of spike trains observed in a wide range of brain regions. Central to our approach is the assumption that the variance and the mean of interspike intervals are related by a power function characterized by two parameters: the scale factor and exponent. It is shown that this single assumption allows the variability of spike trains to have an arbitrary scale and various dependencies on the firing rate in the spike count statistics, as well as in the interval statistics, depending on the two parameters of the power function. We also propose a statistical model for spike trains that exhibits the variance-to-mean power relationship. Based on this, a maximum likelihood method is developed for inferring the parameters from rate-modulated spike trains. The proposed method is illustrated on simulated and experimental spike trains.

Predicting Spike Occurrence and Neuronal Responsiveness from LFPs in Primary Somatosensory Cortex

Science.gov (United States)

Storchi, Riccardo; Zippo, Antonio G.; Caramenti, Gian Carlo; Valente, Maurizio; Biella, Gabriele E. M.

2012-01-01

Local Field Potentials (LFPs) integrate multiple neuronal events like synaptic inputs and intracellular potentials. LFP spatiotemporal features are particularly relevant in view of their applications both in research (e.g. for understanding brain rhythms, inter-areal neural communication and neronal coding) and in the clinics (e.g. for improving invasive Brain-Machine Interface devices). However the relation between LFPs and spikes is complex and not fully understood. As spikes represent the fundamental currency of neuronal communication this gap in knowledge strongly limits our comprehension of neuronal phenomena underlying LFPs. We investigated the LFP-spike relation during tactile stimulation in primary somatosensory (S-I) cortex in the rat. First we quantified how reliably LFPs and spikes code for a stimulus occurrence. Then we used the information obtained from our analyses to design a predictive model for spike occurrence based on LFP inputs. The model was endowed with a flexible meta-structure whose exact form, both in parameters and structure, was estimated by using a multi-objective optimization strategy. Our method provided a set of nonlinear simple equations that maximized the match between models and true neurons in terms of spike timings and Peri Stimulus Time Histograms. We found that both LFPs and spikes can code for stimulus occurrence with millisecond precision, showing, however, high variability. Spike patterns were predicted significantly above chance for 75% of the neurons analysed. Crucially, the level of prediction accuracy depended on the reliability in coding for the stimulus occurrence. The best predictions were obtained when both spikes and LFPs were highly responsive to the stimuli. Spike reliability is known to depend on neuron intrinsic properties (i.e. on channel noise) and on spontaneous local network fluctuations. Our results suggest that the latter, measured through the LFP response variability, play a dominant role. PMID:22586452

Multiple pathways for vacuolar sorting of yeast proteinase A

DEFF Research Database (Denmark)

Westphal, V; Marcusson, E G; Winther, Jakob R.

1996-01-01

The sorting of the yeast proteases proteinase A and carboxypeptidase Y to the vacuole is a saturable, receptor-mediated process. Information sufficient for vacuolar sorting of the normally secreted protein invertase has in fusion constructs previously been found to reside in the propeptide...

An Efficient Supervised Training Algorithm for Multilayer Spiking Neural Networks.

Science.gov (United States)

Xie, Xiurui; Qu, Hong; Liu, Guisong; Zhang, Malu; Kurths, Jürgen

2016-01-01

The spiking neural networks (SNNs) are the third generation of neural networks and perform remarkably well in cognitive tasks such as pattern recognition. The spike emitting and information processing mechanisms found in biological cognitive systems motivate the application of the hierarchical structure and temporal encoding mechanism in spiking neural networks, which have exhibited strong computational capability. However, the hierarchical structure and temporal encoding approach require neurons to process information serially in space and time respectively, which reduce the training efficiency significantly. For training the hierarchical SNNs, most existing methods are based on the traditional back-propagation algorithm, inheriting its drawbacks of the gradient diffusion and the sensitivity on parameters. To keep the powerful computation capability of the hierarchical structure and temporal encoding mechanism, but to overcome the low efficiency of the existing algorithms, a new training algorithm, the Normalized Spiking Error Back Propagation (NSEBP) is proposed in this paper. In the feedforward calculation, the output spike times are calculated by solving the quadratic function in the spike response model instead of detecting postsynaptic voltage states at all time points in traditional algorithms. Besides, in the feedback weight modification, the computational error is propagated to previous layers by the presynaptic spike jitter instead of the gradient decent rule, which realizes the layer-wised training. Furthermore, our algorithm investigates the mathematical relation between the weight variation and voltage error change, which makes the normalization in the weight modification applicable. Adopting these strategies, our algorithm outperforms the traditional SNN multi-layer algorithms in terms of learning efficiency and parameter sensitivity, that are also demonstrated by the comprehensive experimental results in this paper.

An improved method of continuous LOD based on fractal theory in terrain rendering

Science.gov (United States)

Lin, Lan; Li, Lijun

2007-11-01

With the improvement of computer graphic hardware capability, the algorithm of 3D terrain rendering is going into the hot topic of real-time visualization. In order to solve conflict between the rendering speed and reality of rendering, this paper gives an improved method of terrain rendering which improves the traditional continuous level of detail technique based on fractal theory. This method proposes that the program needn't to operate the memory repeatedly to obtain different resolution terrain model, instead, obtains the fractal characteristic parameters of different region according to the movement of the viewpoint. Experimental results show that the method guarantees the authenticity of landscape, and increases the real-time 3D terrain rendering speed.

Reducing 4D CT artifacts using optimized sorting based on anatomic similarity.

Science.gov (United States)

Johnston, Eric; Diehn, Maximilian; Murphy, James D; Loo, Billy W; Maxim, Peter G

2011-05-01

Four-dimensional (4D) computed tomography (CT) has been widely used as a tool to characterize respiratory motion in radiotherapy. The two most commonly used 4D CT algorithms sort images by the associated respiratory phase or displacement into a predefined number of bins, and are prone to image artifacts at transitions between bed positions. The purpose of this work is to demonstrate a method of reducing motion artifacts in 4D CT by incorporating anatomic similarity into phase or displacement based sorting protocols. Ten patient datasets were retrospectively sorted using both the displacement and phase based sorting algorithms. Conventional sorting methods allow selection of only the nearest-neighbor image in time or displacement within each bin. In our method, for each bed position either the displacement or the phase defines the center of a bin range about which several candidate images are selected. The two dimensional correlation coefficients between slices bordering the interface between adjacent couch positions are then calculated for all candidate pairings. Two slices have a high correlation if they are anatomically similar. Candidates from each bin are then selected to maximize the slice correlation over the entire data set using the Dijkstra's shortest path algorithm. To assess the reduction of artifacts, two thoracic radiation oncologists independently compared the resorted 4D datasets pairwise with conventionally sorted datasets, blinded to the sorting method, to choose which had the least motion artifacts. Agreement between reviewers was evaluated using the weighted kappa score. Anatomically based image selection resulted in 4D CT datasets with significantly reduced motion artifacts with both displacement (P = 0.0063) and phase sorting (P = 0.00022). There was good agreement between the two reviewers, with complete agreement 34 times and complete disagreement 6 times. Optimized sorting using anatomic similarity significantly reduces 4D CT motion

Flow cytogenetics and chromosome sorting.

Science.gov (United States)

Cram, L S

1990-06-01

This review of flow cytogenetics and chromosome sorting provides an overview of general information in the field and describes recent developments in more detail. From the early developments of chromosome analysis involving single parameter or one color analysis to the latest developments in slit scanning of single chromosomes in a flow stream, the field has progressed rapidly and most importantly has served as an important enabling technology for the human genome project. Technological innovations that advanced flow cytogenetics are described and referenced. Applications in basic cell biology, molecular biology, and clinical investigations are presented. The necessary characteristics for large number chromosome sorting are highlighted. References to recent review articles are provided as a starting point for locating individual references that provide more detail. Specific references are provided for recent developments.

Isotope and Patient Age Predict for PSA Spikes After Permanent Prostate Brachytherapy

International Nuclear Information System (INIS)

Bostancic, Chelsea; Merrick, Gregory S.; Butler, Wayne M.; Wallner, Kent E.; Allen, Zachariah; Galbreath, Robert; Lief, Jonathan; Gutman, Sarah E.

2007-01-01

Purpose: To evaluate prostate-specific antigen (PSA) spikes after permanent prostate brachytherapy in low-risk patients. Methods and Materials: The study population consisted of 164 prostate cancer patients who were part of a prospective randomized trial comparing 103 Pd and 125 I for low-risk disease. Of the 164 patients, 61 (37.2%) received short-course androgen deprivation therapy. The median follow-up was 5.4 years. On average, 11.1 post-treatment PSA measurements were obtained per patient. Biochemical disease-free survival was defined as a PSA level of ≤0.40 ng/mL after nadir. A PSA spike was defined as an increase of ≥0.2 ng/mL, followed by a durable decline to prespike levels. Multiple parameters were evaluated as predictors for a PSA spike. Results: Of the 164 patients, 44 (26.9%) developed a PSA spike. Of the 46 hormone-naive 125 I patients and 57 hormone-naive 103 Pd patients, 21 (45.7%) and 8 (14.0%) developed a PSA spike. In the hormone-naive patients, the mean time between implantation and the spike was 22.6 months and 18.7 months for 125 I and 103 Pd, respectively. In patients receiving neoadjuvant androgen deprivation therapy, the incidence of spikes was comparable between isotopes ( 125 I 28.1% and 103 Pd 20.7%). The incidence of spikes was substantially different in patients 125 I and/or <65 years of age. Differences in isotope-related spikes are most pronounced in hormone-naive patients

Boobs, Boxing, and Bombs: Problematizing the Entertainment of Spike TV

OpenAIRE

Walton, Gerald; Potvin, L.

2009-01-01

Spike is the only television network in North America “for men.” Its motto, “Get more action,” is suggestive of pursuits of various forms of violence. We conceptualize Spike not as trivial entertainment, but rather as a form of pop culture that erodes the gains of feminists who have challenged the prevalence of normalized hegemonic masculinity (HM). Our paper highlights themes of Spike content, and connects those themes to the literature on HM. Moreover, we validate the identities and lives ...

High Fidelity Haptic Rendering

CERN Document Server

Otaduy, Miguel A

2006-01-01

The human haptic system, among all senses, provides unique and bidirectional communication between humans and their physical environment. Yet, to date, most human-computer interactive systems have focused primarily on the graphical rendering of visual information and, to a lesser extent, on the display of auditory information. Extending the frontier of visual computing, haptic interfaces, or force feedback devices, have the potential to increase the quality of human-computer interaction by accommodating the sense of touch. They provide an attractive augmentation to visual display and enhance t

Numerical simulation on current spike behaviour of JT-60U disruptive plasmas

International Nuclear Information System (INIS)

Takei, N; Nakamura, Y; Tsutsui, H; Yoshino, R; Kawano, Y; Ozeki, T; Tobita, K; Tsuji-Iio, S; Shimada, R; Jardin, S C

2004-01-01

Characteristics and underlying mechanisms for plasma current spikes, which have been frequently observed during the thermal quench of JT-60U disruptions, were investigated through tokamak simulation code simulations including the passive shell effects of the vacuum vessel. Positive shear and reversed shear (PS and RS) plasmas were shown to have various current spike features in the experiments, e.g. an impulsive increase in the plasma current (positive spike) in the majority of thermal quenches, and a sudden decrease (negative spike), that has been excluded from past consideration, as an exception. It was first clarified that the shell effects, which become significant especially at a strong pressure drop due to the thermal quench of high β p plasmas, play an important role in the current spike in accordance with the initial relation of the radial location between the plasma equilibria and the vacuum vessel. As a consequence, a negative current spike may appear at thermal quench when the plasma is positioned further out from the geometric centre of the vacuum vessel. It was also pointed out that a further lowering in the internal inductance, in contradiction to previous interpretation in the past, is a plausible candidate for the mechanism for positive current spikes observed even in RS plasmas. The new interpretation enables us to reason out the whole character of current spikes of JT-60U disruptions

Statistical characteristics of climbing fiber spikes necessary for efficient cerebellar learning.

Science.gov (United States)

Kuroda, S; Yamamoto, K; Miyamoto, H; Doya, K; Kawat, M

2001-03-01

Mean firing rates (MFRs), with analogue values, have thus far been used as information carriers of neurons in most brain theories of learning. However, the neurons transmit the signal by spikes, which are discrete events. The climbing fibers (CFs), which are known to be essential for cerebellar motor learning, fire at the ultra-low firing rates (around 1 Hz), and it is not yet understood theoretically how high-frequency information can be conveyed and how learning of smooth and fast movements can be achieved. Here we address whether cerebellar learning can be achieved by CF spikes instead of conventional MFR in an eye movement task, such as the ocular following response (OFR), and an arm movement task. There are two major afferents into cerebellar Purkinje cells: parallel fiber (PF) and CF, and the synaptic weights between PFs and Purkinje cells have been shown to be modulated by the stimulation of both types of fiber. The modulation of the synaptic weights is regulated by the cerebellar synaptic plasticity. In this study we simulated cerebellar learning using CF signals as spikes instead of conventional MFR. To generate the spikes we used the following four spike generation models: (1) a Poisson model in which the spike interval probability follows a Poisson distribution, (2) a gamma model in which the spike interval probability follows the gamma distribution, (3) a max model in which a spike is generated when a synaptic input reaches maximum, and (4) a threshold model in which a spike is generated when the input crosses a certain small threshold. We found that, in an OFR task with a constant visual velocity, learning was successful with stochastic models, such as Poisson and gamma models, but not in the deterministic models, such as max and threshold models. In an OFR with a stepwise velocity change and an arm movement task, learning could be achieved only in the Poisson model. In addition, for efficient cerebellar learning, the distribution of CF spike

On the design of a real-time volume rendering engine

NARCIS (Netherlands)

Smit, Jaap; Wessels, H.L.F.; van der Horst, A.; Bentum, Marinus Jan

1992-01-01

An architecture for a Real-Time Volume Rendering Engine (RT-VRE) is given, capable of computing 750 × 750 × 512 samples from a 3D dataset at a rate of 25 images per second. The RT-VRE uses for this purpose 64 dedicated rendering chips, cooperating with 16 RISC-processors. A plane interpolator

On the design of a real-time volume rendering engine

NARCIS (Netherlands)

Smit, Jaap; Wessels, H.J.; van der Horst, A.; Bentum, Marinus Jan

1995-01-01

An architecture for a Real-Time Volume Rendering Engine (RT-VRE) is given, capable of computing 750 × 750 × 512 samples from a 3D dataset at a rate of 25 images per second. The RT-VRE uses for this purpose 64 dedicated rendering chips, cooperating with 16 RISC-processors. A plane interpolator

Computational investigations of blunt body drag-reduction spikes in hypersonic flows

International Nuclear Information System (INIS)

Kamran, N.; Zahir, S.; Khan, M.A.

2003-01-01

Drag is an important parameter in the designing of high-speed vehicles. Such vehicles include hypervelocity projectiles, reentry modules, and hypersonic aircrafts. Therefore, there exists an active or passive technique to reduce drag due to the high pressures at nosetip region of the vehicle. Drag can be reduced by attaching a forward facing spike on the nose of the vehicle. The present study reviews and deals with the CFD analysis made on a standard blunt body to reduce aerodynamic drag due to the attachment of forward facing spikes for High-Speed vehicles. Different spike lengths have been examined to study the forebody flowfield. The investigation concludes that spikes are an effective way to reduce the aerodynamic drag due to reduced dynamic pressure on the nose caused by the separated flow on the spikes. With the accomplishment of confidence on computational data, study was extended in hypersonic Mach range with a drag prediction accuracy of ± 10%. In the present work, viscous fluid dynamics studies were performed for a complete freestream Mach number range of 5.0, 6.0, 7.0 and 8.0 for different spike lengths and zero degree angle of attack. (author)

Transient reduction in theta power caused by interictal spikes in human temporal lobe epilepsy.

Science.gov (United States)

Manling Ge; Jundan Guo; Yangyang Xing; Zhiguo Feng; Weide Lu; Xinxin Ma; Yuehua Geng; Xin Zhang

2017-07-01

The inhibitory impacts of spikes on LFP theta rhythms(4-8Hz) are investigated around sporadic spikes(SSs) based on intracerebral EEG of 4 REM sleep patients with temporal lobe epilepsy(TLE) under the pre-surgical monitoring. Sequential interictal spikes in both genesis area and extended propagation pathway are collected, that, SSs genesis only in anterior hippocampus(aH)(possible propagation pathway in Entorhinal cortex(EC)), only in EC(possible propagation pathway in aH), and in both aH and EC synchronously. Instantaneous theta power was estimated by using Gabor wavelet transform, and theta power level was estimated by averaged over time and frequency before SSs(350ms pre-spike) and after SSs(350ms post-spike). The inhibitory effect around spikes was evaluated by the ratio of theta power level difference between pre-spike and post-spike to pre-spike theta power level. The findings were that theta power level was reduced across SSs, and the effects were more sever in the case of SSs in both aH and EC synchronously than either SSs only in EC or SSs only in aH. It is concluded that interictal spikes impair LFP theta rhythms transiently and directly. The work suggests that the reduction of theta power after the interictal spike might be an evaluation indicator of damage of epilepsy to human cognitive rhythms.

Machine Vision System for Color Sorting Wood Edge-Glued Panel Parts

Science.gov (United States)

Qiang Lu; S. Srikanteswara; W. King; T. Drayer; Richard Conners; D. Earl Kline; Philip A. Araman

1997-01-01

This paper describes an automatic color sorting system for hardwood edge-glued panel parts. The color sorting system simultaneously examines both faces of a panel part and then determines which face has the "better" color given specified color uniformity and priority defined by management. The real-time color sorting system software and hardware are briefly...

Spectral components of cytosolic [Ca2+] spiking in neurons

DEFF Research Database (Denmark)

Kardos, J; Szilágyi, N; Juhász, G

1998-01-01

. Delayed complex responses of large [Ca2+]c spiking observed in cells from a different set of cultures were synthesized by a set of frequencies within the range 0.018-0.117 Hz. Differential frequency patterns are suggested as characteristics of the [Ca2+]c spiking responses of neurons under different...

Unsupervised clustering with spiking neurons by sparse temporal coding and multi-layer RBF networks

NARCIS (Netherlands)

S.M. Bohte (Sander); J.A. La Poutré (Han); J.N. Kok (Joost)

2000-01-01

textabstractWe demonstrate that spiking neural networks encoding information in spike times are capable of computing and learning clusters from realistic data. We show how a spiking neural network based on spike-time coding and Hebbian learning can successfully perform unsupervised clustering on

Spike-timing-based computation in sound localization.

Directory of Open Access Journals (Sweden)

Dan F M Goodman

2010-11-01

Full Text Available Spike timing is precise in the auditory system and it has been argued that it conveys information about auditory stimuli, in particular about the location of a sound source. However, beyond simple time differences, the way in which neurons might extract this information is unclear and the potential computational advantages are unknown. The computational difficulty of this task for an animal is to locate the source of an unexpected sound from two monaural signals that are highly dependent on the unknown source signal. In neuron models consisting of spectro-temporal filtering and spiking nonlinearity, we found that the binaural structure induced by spatialized sounds is mapped to synchrony patterns that depend on source location rather than on source signal. Location-specific synchrony patterns would then result in the activation of location-specific assemblies of postsynaptic neurons. We designed a spiking neuron model which exploited this principle to locate a variety of sound sources in a virtual acoustic environment using measured human head-related transfer functions. The model was able to accurately estimate the location of previously unknown sounds in both azimuth and elevation (including front/back discrimination in a known acoustic environment. We found that multiple representations of different acoustic environments could coexist as sets of overlapping neural assemblies which could be associated with spatial locations by Hebbian learning. The model demonstrates the computational relevance of relative spike timing to extract spatial information about sources independently of the source signal.

Neural Spike Train Synchronisation Indices: Definitions, Interpretations and Applications.

Science.gov (United States)

Halliday, D M; Rosenberg, J R

2017-04-24

A comparison of previously defined spike train syncrhonization indices is undertaken within a stochastic point process framework. The second order cumulant density (covariance density) is shown to be common to all the indices. Simulation studies were used to investigate the sampling variability of a single index based on the second order cumulant. The simulations used a paired motoneurone model and a paired regular spiking cortical neurone model. The sampling variability of spike trains generated under identical conditions from the paired motoneurone model varied from 50% { 160% of the estimated value. On theoretical grounds, and on the basis of simulated data a rate dependence is present in all synchronization indices. The application of coherence and pooled coherence estimates to the issue of synchronization indices is considered. This alternative frequency domain approach allows an arbitrary number of spike train pairs to be evaluated for statistically significant differences, and combined into a single population measure. The pooled coherence framework allows pooled time domain measures to be derived, application of this to the simulated data is illustrated. Data from the cortical neurone model is generated over a wide range of firing rates (1 - 250 spikes/sec). The pooled coherence framework correctly characterizes the sampling variability as not significant over this wide operating range. The broader applicability of this approach to multi electrode array data is briefly discussed.