What can spike train distances tell us about the neural code?

Time scale parametric spike train distances like the Victor and the van Rossum distancesare often applied to study the neural code based on neural stimuli discrimination.Different neural coding hypotheses, such as rate or coincidence coding,can be assessed by combining a time scale parametric spike train distance with aclassifier in order to obtain the optimal discrimination performance. The time scalefor which the responses to different stimuli are distinguished best is assumed to bethe discriminative precision of the neural code. The relevance of temporal codingis evaluated by comparing the optimal discrimination performance with the oneachieved when assuming a rate code.We here characterize the measures quantifying the discrimination performance,the discriminative precision, and the relevance of temporal coding. Furthermore,we evaluate the information these quantities provide about the neural code. Weshow that the discriminative precision is too unspecific to be interpreted in termsof the time scales relevant for encoding. Accordingly, the time scale parametricnature of the distances is mainly an advantage because it allows maximizing thediscrimination performance across a whole set of measures with different sensitivitiesdetermined by the time scale parameter, but not due to the possibility toexamine the temporal properties of the neural code.

A systolic array for linear MIMO detection based on an all-swap lattice reduction algorithm

A systolic array to implement lattice-reduction-aided lineardetection is proposed for a MIMO receiver. The lattice reductionalgorithm and the ensuing linear detections are operated in the same array, which can be hardware-efficient. All-swap lattice reduction algorithm (ASLR) is considered for the systolic design.ASLR is a variant of the LLL algorithm, which processes all lattice basis vectors within one iteration. Lattice-reduction-aided linear detection based on ASLR and LLL algorithms have very similarbit-error-rate performance, while ASLR is more time efficient inthe systolic array, especially for systems with a large number ofantennas.

Wavelet analysis residual kriging vs. neural network residual kriging

This paper deals with the problem of spatial data mapping. A new method based on wavelet interpolation and geostatistical prediction (kriging) is proposed. The method - wavelet analysis residual kriging (WARK) - is developed in order to assess the problems rising for highly variable data in presence of spatial trends. In these cases stationary prediction models have very limited application. Wavelet analysis is used to model large-scale structures and kriging of the remaining residuals focuses on small-scale peculiarities. WARK is able to model spatial pattern which features multiscale structure. In the present work WARK is applied to the rainfall data and the results of validation are compared with the ones obtained from neural network residual kriging (NNRK). NNRK is also a residual-based method, which uses artificial neural network to model large-scale non-linear trends. The comparison of the results demonstrates the high quality performance of WARK in predicting hot spots, reproducing global statistical characteristics of the distribution and spatial correlation structure.

ILS-ESP An efficient, simple, and parameter-free algorithm for solving the permutation flow-shop problem

From a managerial point of view, the more effcient, simple, and parameter-free (ESP) an algorithm is, the more likely it will be used in practice for solving real-life problems. Following this principle, an ESP algorithm for solving the Permutation Flowshop Sequencing Problem (PFSP) is proposed in this article. Using an Iterated Local Search (ILS) framework, the so-called ILS-ESP algorithm is able to compete in performance with other well-known ILS-based approaches, which are considered among the most effcient algorithms for the PFSP. However, while other similar approaches still employ several parameters that can affect their performance if not properly chosen, our algorithm does not require any particular fine-tuning process since it uses basic "common sense" rules for the local search, perturbation, and acceptance criterion stages of the ILS metaheuristic. Our approach defines a new operator for the ILS perturbation process, a new acceptance criterion based on extremely simple and transparent rules, and a biased randomization process of the initial solution to randomly generate different alternative initial solutions of similar quality -which is attained by applying a biased randomization to a classical PFSP heuristic. This diversification of the initial solution aims at avoiding poorly designed starting points and, thus, allows the methodology to take advantage of current trends in parallel and distributed computing. A set of extensive tests, based on literature benchmarks, has been carried out in order to validate our algorithm and compare it against other approaches. These tests show that our parameter-free algorithm is able to compete with state-of-the-art metaheuristics for the PFSP. Also, the experiments show that, when using parallel computing, it is possible to improve the top ILS-based metaheuristic by just incorporating to it our biased randomization process with a high-quality pseudo-random number generator.

Dual functions of DP1 promote biphasic Wnt-on and Wnt-off states during anteroposterior neural patterning.

DP1, a dimerization partner protein of the transcription factor E2F, is known to inhibit Wnt/β-catenin signalling along with E2F, although the function of DP1 itself was not well characterized. Here, we present a novel dual regulatory mechanism of Wnt/β-catenin signalling by DP1 independent from E2F. DP1 negatively regulates Wnt/β-catenin signalling by inhibiting Dvl-Axin interaction and by enhancing poly-ubiquitination of β-catenin. In contrast, DP1 positively modulates the signalling upon Wnt stimulation, via increasing cytosolic β-catenin and antagonizing the kinase activity of NLK. In Xenopus embryos, DP1 exerts both positive and negative roles in Wnt/β-catenin signalling during anteroposterior neural patterning. From subcellular localization analyses, we suggest that the dual roles of DP1 in Wnt/β-catenin signalling are endowed by differential nucleocytoplasmic localizations. We propose that these dual functions of DP1 can promote and stabilize biphasic Wnt-on and Wnt-off states in response to a gradual gradient of Wnt/β-catenin signalling to determine differential cell fates.

Neuronal autophagy as a mediator of life and death: contrasting roles in chronic neurodegenerative and acute neural disorders.

Autophagy is a cellular mechanism for degrading proteins and organelles. It was first described as a physiological process essential for cellular health and survival, and this is its role in most cells. However, it can also be a mediator of cell death, either by the triggering of apoptosis or by an independent "autophagic" cell death mechanism. This duality is important in the central nervous system, where the activation of autophagy has recently been shown to be protective in certain chronic neurodegenerative diseases but deleterious in acute neural disorders such as stroke and hypoxic/ischemic injury. The authors here discuss these distinct roles of autophagy in the nervous system with a focus on the role of autophagy in mediating neuronal death. The development of new therapeutic strategies based on the manipulation of autophagy will need to take into account these opposing roles of autophagy.

Time Series Input Selection using Multiple Kernel Learning

In this paper we study the relevance of multiple kernel learning (MKL) for the automatic selection of time series inputs. Recently, MKL has gained great attention in the machine learning community due to its flexibility in modelling complex patterns and performing feature selection. In general, MKL constructs the kernel as a weighted linear combination of basis kernels, exploiting different sources of information. An efficient algorithm wrapping a Support Vector Regression model for optimizing the MKL weights, named SimpleMKL, is used for the analysis. In this sense, MKL performs feature selection by discarding inputs/kernels with low or null weights. The approach proposed is tested with simulated linear and nonlinear time series (AutoRegressive, Henon and Lorenz series).

A polynomial algorithm for special case of the one-machine scheduling problem with time-lags

The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine which can handle only one job at atime, minimizing the maximum lateness. Each job is available forprocessing at its release date, requires a known processing timeand after finishing the processing, it is delivery after a certaintime. There also can exists precedence constraints between pairsof jobs, requiring that the first jobs must be completed beforethe second job can start. An extension of this problem consistsin assigning a time interval between the processing of the jobsassociated with the precedence constrains, known by finish-starttime-lags. In presence of this constraints, the problem is NP-hardeven if preemption is allowed. In this work, we consider a specialcase of the one-machine preemption scheduling problem with time-lags, where the time-lags have a chain form, and propose apolynomial algorithm to solve it. The algorithm consist in apolynomial number of calls of the preemption version of the LongestTail Heuristic. One of the applicability of the method is to obtainlower bounds for NP-hard one-machine and job-shop schedulingproblems. We present some computational results of thisapplication, followed by some conclusions.

Morphometric shape analysis using learning vector quantization neural networks - an example distinguishing two microtine vole species

Closely related species may be very difficult to distinguish morphologically, yet sometimes morphology is the only reasonable possibility for taxonomic classification. Here we present learning-vector-quantization artificial neural networks as a powerful tool to classify specimens on the basis of geometric morphometric shape measurements. As an example, we trained a neural network to distinguish between field and root voles from Procrustes transformed landmark coordinates on the dorsal side of the skull, which is so similar in these two species that the human eye cannot make this distinction. Properly trained neural networks misclassified only 3% of specimens. Therefore, we conclude that the capacity of learning vector quantization neural networks to analyse spatial coordinates is a powerful tool among the range of pattern recognition procedures that is available to employ the information content of geometric morphometrics.

On the efficiency and sensitivity of a pyramidal classification algorithm

In this paper we propose a Pyramidal Classification Algorithm,which together with an appropriate aggregation index producesan indexed pseudo-hierarchy (in the strict sense) withoutinversions nor crossings. The computer implementation of thealgorithm makes it possible to carry out some simulation testsby Monte Carlo methods in order to study the efficiency andsensitivity of the pyramidal methods of the Maximum, Minimumand UPGMA. The results shown in this paper may help to choosebetween the three classification methods proposed, in order toobtain the classification that best fits the original structureof the population, provided we have an a priori informationconcerning this structure.

Neural control of vascular reactions: impact of emotion and attention.

This study investigated the neural regions involved in blood pressure reactions to negative stimuli and their possible modulation by attention. Twenty-four healthy human subjects (11 females; age = 24.75 ± 2.49 years) participated in an affective perceptual load task that manipulated attention to negative/neutral distractor pictures. fMRI data were collected simultaneously with continuous recording of peripheral arterial blood pressure. A parametric modulation analysis examined the impact of attention and emotion on the relation between neural activation and blood pressure reactivity during the task. When attention was available for processing the distractor pictures, negative pictures resulted in behavioral interference, neural activation in brain regions previously related to emotion, a transient decrease of blood pressure, and a positive correlation between blood pressure response and activation in a network including prefrontal and parietal regions, the amygdala, caudate, and mid-brain. These effects were modulated by attention; behavioral and neural responses to highly negative distractor pictures (compared with neutral pictures) were smaller or diminished, as was the negative blood pressure response when the central task involved high perceptual load. Furthermore, comparing high and low load revealed enhanced activation in frontoparietal regions implicated in attention control. Our results fit theories emphasizing the role of attention in the control of behavioral and neural reactions to irrelevant emotional distracting information. Our findings furthermore extend the function of attention to the control of autonomous reactions associated with negative emotions by showing altered blood pressure reactions to emotional stimuli, the latter being of potential clinical relevance.

A simple randomized algorithm for consistent sequential prediction of ergodic time series

We present a simple randomized procedure for the prediction of a binary sequence. The algorithm uses ideas from recent developments of the theory of the prediction of individual sequences. We show that if thesequence is a realization of a stationary and ergodic random process then the average number of mistakes converges, almost surely, to that of the optimum, given by the Bayes predictor.