哈萨克文脱机手写字符识别系统的研究与实现

由于手写哈萨克字符结构的特殊性,仅提取几种单一的字符特征进行识别时正确率较低,识别效果较差。由此采用改进的PCA方法定位单词基线位置,对每个字符提取包括笔画密度特征、投影特征、轮廓特征等在内的36种特征,使用K-W检验对各特征的分类能力进行比较,并采用线性判别函数进行分类,取得了较高的识别精度。实验结果表明,该系统针对脱机字符识别率达到94％以上。     

汉维统计机器翻译中的形态学处理

针对汉语和维吾尔语语序差别(前者是主-谓-宾结构,后者是主-宾-谓结构)及形态差别较大的问题,通过编写调序规则将汉语调整为主-宾-谓结构,将维吾尔语单词切分为词干、词缀等更小的词素单元来训练统计模型,同时测试词素的切分粒度对翻译性能的影响.实验结果表明,对汉语句法结构的调整及以词干、词缀等更小的词素形式参与训练可以有效...     

实时微控制器与20-SIM仿真模型的共同仿真实现

基于单片机实时控制是嵌入式控制系统的主要部分。讨论如何在20-SIM平台上建立用户自己的目标模板。内容包括系统模型的建立、模型的结构和目标模板的调整。重点讨论模型模板结构和在具体装置中对模型模板的调整过程。最后给出一个测试实验。     

DEEP—differential evolution entirely parallel method for gene regulatory networks

The Differential Evolution Entirely Parallel (DEEP) method is applied to the biological data fitting problem. We introduce a new migration scheme, in which the best member of the branch substitutes the oldest member of the next branch that provides a high speed of the algorithm convergence. We analyze the performance and efficiency of the developed algorithm on a test problem of finding the regulatory interactions within the network of gap genes that control the development of early Drosophila embryo. The parameters of a set of nonlinear differential equations are determined by minimizing the total error between the model behavior and experimental observations. The age of the individuum is defined by the number of iterations this individuum survived without changes. We used a ring topology for the network of computational nodes. The computer codes are available upon request.     

Principles and typical computational limitations of sparse speaker separation based on deterministic speech features

The separation of mixed auditory signals into their sources is an eminent neuroscience and engineering challenge. We reveal the principles underlying a deterministic, neural network-like solution to this problem. This approach is orthogonal to ICA/PCA that views the signal constituents as independent realizations of random processes. We demonstrate exemplarily that in the absence of salient frequency modulations, the decomposition of speech signals into local cosine packets allows for a sparse, noise-robust speaker separation. As the main result, we present analytical limitations inherent in the approach, where we propose strategies of how to deal with this situation. Our results offer new perspectives toward efficient noise cleaning and auditory signal separation and provide a new perspective of how the brain might achieve these tasks.     

Hidden Markov models for the stimulus-response relationships of multistate neural systems

Given recent experimental results suggesting that neural circuits may evolve through multiple firing states, we develop a framework for estimating state-dependent neural response properties from spike train data. We modify the traditional hidden Markov model (HMM) framework to incorporate stimulus-driven, non-Poisson point-process observations. For maximal flexibility, we allow external, time-varying stimuli and the neurons' own spike histories to drive both the spiking behavior in each state and the transitioning behavior between states. We employ an appropriately modified expectation-maximization algorithm to estimate the model parameters. The expectation step is solved by the standard forward-backward algorithm for HMMs. The maximization step reduces to a set of separable concave optimization problems if the model is restricted slightly. We first test our algorithm on simulated data and are able to fully recover the parameters used to generate the data and accurately recapitulate the sequence of hidden states. We then apply our algorithm to a recently published data set in which the observed neuronal ensembles displayed multistate behavior and show that inclusion of spike history information significantly improves the fit of the model. Additionally, we show that a simple reformulation of the state space of the underlying Markov chain allows us to implement a hybrid half-multistate, half-histogram model that may be more appropriate for capturing the complexity of certain data sets than either a simple HMM or a simple peristimulus time histogram model alone.     

Insights from a simple expression for linear fisher information in a recurrently connected population of spiking neurons

A simple expression for a lower bound of Fisher information is derived for a network of recurrently connected spiking neurons that have been driven to a noise-perturbed steady state. We call this lower bound linear Fisher information, as it corresponds to the Fisher information that can be recovered by a locally optimal linear estimator. Unlike recent similar calculations, the approach used here includes the effects of nonlinear gain functions and correlated input noise and yields a surprisingly simple and intuitive expression that offers substantial insight into the sources of information degradation across successive layers of a neural network. Here, this expression is used to (1) compute the optimal (i.e., information-maximizing) firing rate of a neuron, (2) demonstrate why sharpening tuning curves by either thresholding or the action of recurrent connectivity is generally a bad idea, (3) show how a single cortical expansion is sufficient to instantiate a redundant population code that can propagate across multiple cortical layers with minimal information loss, and (4) show that optimal recurrent connectivity strongly depends on the covariance structure of the inputs to the network.     

基于词缀库的非监督维吾尔语词切分方法

在维吾尔语中,词缀的数量有限且构词具有一定的规律性。为了提高维吾尔语词切分算法的性能,在一个词缀库的基础上,通过分析维吾尔语的基本构词规则,提出了一种改进的非监督维吾尔语词切分方法。该方法对词进行规则切分,采用MAP切分评价模型对规则切分打分,选取得分最高的规则切分作为该词的最终切分形式。在一个5000词的测试语料上进行了实验,实验结果表明,使用该方法进行维吾尔语词切分具有更高的准确率。     

基于信息势能的鲁棒估计器及其在同时定位与地图构建问题中的应用

提出了一种基于信息势能鲁棒估计器来解决机器人室内的同时定位与地图构建（SLAM）问题．结构化的室内环境可以用线段近似表示．然而动态环境中,测距传感器测得的数据通常湮没在大量的噪声信号中．本文采用“分割与合并”（split—and．merge）方法进行线段的分类,根据信息势能的性能指标衡量每个采样数据对该线段的信息贡献量．按照信息优化理论设计估计器,选择信息量贡献大的样本点作为信息内点提取线段参数,构建局部地图．采用粒子滤波器进行地图及机器人路径的更新．采用递推的方法估计信息势能,降低了对样本点的信息量贡献做估计时的复杂度．仿真和实验结果证明,本文所提出的方法具有较强的鲁棒性,提高了SLAM策略的准确性和实时性．