Classifying mental tasks based on features of higher-order statistics from EEG signals in brain-computer interface

In order to characterize the non-Gaussian information contained within the EEG signals, a new feature extraction method based on bispectrum is proposed and applied to the classification of right and left motor imagery for developing EEG-based brain-computer interface systems. The experimental results on the Graz BCI data set have shown that based on the proposed features, a LDA classifier, SVM classifier and NN classifier outperform the winner of the BCI 2003 competition on the same data set in terms of either the mutual information, the competition criterion, or misclassification rate.     

Unifying some higher-order statistic-based methods for errors-in-variables model identification

In this paper, the problem of identifying linear discrete-time systems from noisy input and output data is addressed. Several existing methods based on higher-order statistics are presented. It is shown that they stem from the same set of equations and can thus be united from the viewpoint of extended instrumental variable methods. A numerical example is presented which confirms the theoretical results. Some possible extensions of the methods are then given.     

Order statistics and probabilistic robust control

Order statistics theory is applied in this paper to probabilistic robust control theory to compute the minimum sample size needed to come up with a reliable estimate of an uncertain quantity under continuity assumption of the related probability distribution. Also, the concept of distribution-free tolerance intervals is applied to estimate the range of an uncertain quantity and extract the information about its distribution. To overcome the limitations imposed by the continuity assumption in the existing order statistics theory, we have derived a cumulative distribution function of the order statistics without the continuity assumption and developed an inequality showing that this distribution has an upper bound which equals to the corresponding distribution when the continuity assumption is satisfied. By applying this inequality, we investigate the minimum computational effort needed to come up with an reliable estimate for the upper bound (or the lower bound) and the range of a quantity. We also give conditions, which are much weaker than the absolute continuity assumption, for the existence of such minimum sample size. Furthermore, the issue of making tradeoff between performance level and risk is addressed and a guideline for making this kind of tradeoff is established. This guideline can be applied in general without continuity assumption.     

On connections and higher-order logic

This is an expository introduction to an approach to theorem proving in higher-order logic based on establishing appropriate connections between subformulas of an expanded form of the theorem to be proved. Expansion trees and expansion proofs play key roles.This is an extended version of a lecture presented to the 8th International Conference on Automated Deduction in Oxford, England on 27 July 1986. This material is based upon work supported by the National Science Foundation under grants DCR-8402532 and CCR-8702699.     

On the expressiveness and decidability of higher-order process calculi

In higher-order process calculi, the values exchanged in communications may contain processes. A core calculus of higher-order concurrency is studied; it has only the operators necessary to express higher-order communications: input prefix, process output, and parallel composition. By exhibiting a deterministic encoding of Minsky machines, the calculus is shown to be Turing complete. Therefore its termination problem is undecidable. Strong bisimilarity, however, is shown to be decidable. Furthermore, the main forms of strong bisimilarity for higher-order processes (higher-order bisimilarity, context bisimilarity, normal bisimilarity, barbed congruence) coincide. They also coincide with their asynchronous versions. A sound and complete axiomatization of bisimilarity is given. Finally, bisimilarity is shown to become undecidable if at least four static (i.e., top-level) restrictions are added to the calculus.     

Monolithic and modular termination analyses for higher-order attribute grammars

In this paper we describe a sound, but not complete, analysis to prove the termination of higher-order attribute grammar evaluation caused by the creation of an unbounded number of (finite) trees as local tree-valued attributes, which are then themselves decorated with attributes. The analysis extracts a set of term-rewriting rules from the grammar that model creation of new syntax trees during the evaluation of higher-order attributes. If this term rewriting system terminates, then only a finite number of trees will be created during attribute grammar evaluation. The analysis places an ordering on nonterminals to handle the cases in which higher-order inherited attributes are used to ensure that a finite number of trees are created using such attributes. When paired with the traditional completeness and circularity analyses for attribute grammars and the assumption that each attribute equation defines a terminating computation, this analysis can be used to show that attribute grammar evaluation will terminate normally. This analysis can be applied to a wide range of common attribute grammar idioms and has been used to show that evaluation of our specification of Java 1.4 terminates. We also describe a modular version of the analysis that is performed on independently developed language extension grammars and the host language being extended. If the extensions individually pass the modular analysis then their composition is also guaranteed to terminate.     

Order statistics and probabilistic robust control

Order statistics theory is applied in this paper to probabilistic robust control theory to compute the minimum sample size needed to come up with a reliable estimate of an uncertain quantity under continuity assumption of the related probability distribution. Also, the concept of distribution-free tolerance intervals is applied to estimate the range of an uncertain quantity and extract the information about its distribution. To overcome the limitations imposed by the continuity assumption in the existing order statistics theory, we have derived a cumulative distribution function of the order statistics without the continuity assumption and developed an inequality showing that this distribution has an upper bound which equals to the corresponding distribution when the continuity assumption is satisfied. By applying this inequality, we investigate the minimum computational effort needed to come up with an reliable estimate for the upper bound (or the lower bound) and the range of a quantity. We also give conditions, which are much weaker than the absolute continuity assumption, for the existence of such minimum sample size. Furthermore, the issue of making tradeoff between performance level and risk is addressed and a guideline for making this kind of tradeoff is established. This guideline can be applied in general without continuity assumption.     

A higher-order active contour model of a ‘gas of circles’ and its application to tree crown extraction

We present a model of a ‘gas of circles’: regions in the image domain composed of a unknown number of circles of approximately the same radius. The model has applications to medical, biological, nanotechnological, and remote sensing imaging. The model is constructed using higher-order active contours (HOACs) in order to include non-trivial prior knowledge about region shape without constraining topology. The main theoretical contribution is an analysis of the local minima of the HOAC energy that allows us to guarantee stable circles, fix one of the model parameters, and constrain the rest. We apply the model to tree crown extraction from aerial images of plantations. Numerical experiments both confirm the theoretical analysis and show the empirical importance of the prior shape information.     

Simple forms of higher-order linear differential systems and their applications in computing regular solutions

We propose a direct algorithm for computing regular formal solutions of a given higher-order linear differential system near a singular point. With such a system, we associate a matrix polynomial and we say that the system is simple if the determinant of this matrix polynomial does not identically vanish. In this case, we show that the algorithm developed in Barkatou et al. (2009) can be applied to compute a basis of the regular formal solutions space. Otherwise, we develop an algorithm which, given a non-simple system, computes an auxiliary simple one from which the regular formal solutions space of the original system can be recovered. We also give the arithmetic complexity of our algorithms.     

行业统计报表处理系统SRAFT的设计与实现

分析了行业统计工作中报表制度编制和报表数据处理的特点,给出了一个计算及审核公式的描述方法,设计并实现了一个由报表框架设计器、计算及审核公式管理器、数据汇总项目管理器、填报单位管理器、报表数据处理器等5个部分组成的统计报表处理系统SRAFT。     

基于JDBC的网络管理系统流量统计研究

JDBC是当前Internet上数据库应用开发的首选解决方案．从应用程序开发的角度出发,结合网络管理系统中的流量统计模块,针对JBuilder的开发环境,详细介绍了JDBC的分层次结构特点和应用方法,并阐明了如何用JDBC开发数据库应用程序．     

浅析电脑统计学与社区警务

现代警务是与现代经济社会和法律制度相适应的一种新型警务,而信息系统是当今警察机构的核心电路系统,通常能决定问题的定义和过程的评估。社区警务的变革,以及类似电脑统计学等警务新方法包含了复杂信息技术的发展。在社区警务运动进行之前,信息技术被广泛运用于高科技行业,与警务部门的日常运作相分离。信息技术已经在扮演着一个更新,更重要的角色。     

The influence of higher-order effects on the transmission performances of the ultra-short soliton pulses and its suppression method

Under the condition of the higher order effects, a propagation equation is established to investigate the way to suppress the soliton self frequency shift and timing jitter in the picosecond and femtosecond soliton communication system using a combined control method of time domain and frequency domain. By the use of the variational approach, the evolution of the chirping Gaussian quasi-soliton pulse is analyzed in the presence of the effects including third order dispersion, intrapulse Raman scattering (IR...     

Steganalytic method based on short and repeated sequence distance statistics

According to the distribution characteristics of short and repeated sequence （SRS）, a steganaiytic method based on the correlation of image bit planes is proposed. Firstly, we provide the conception of SRS distance statistics and deduce its statistical distribution. Because the SRS distance statistics can effectively reflect the correlation of the sequence, SRS has statistical features when the image bit plane sequence equals the image width. Using this characteristic, the steganalytic method is fulfilled by the distinct test of Poisson distribution. Experimental results show a good performance for detecting LSB matching steganographic method in still images. By the way, the proposed method is not designed for specific steganographic algorithms and has good generality.     

Mathematical statistics and computer vision

In this discussion paper, I present my views on the role on mathematical statistics for solving computer vision problems.     

规则与统计相结合的介词用法自动识别研究

对介词用法自动识别的研究是现代汉语虚词用法知识库建设的重要组成部分.在已有工作的基础上,分析对比了规则方法与统计方法的优劣,提出一种规则与条件随机场统计模型相结合的介词用法自动识别算法.该算法在2000年2月-5月《人民日报》语料的介词用法自动识别测试中,准确率比单独使用规则方法和统计方法分别提高了14.64％及5.22％.     

Limits, discovery and cut optimization for a Poisson process with uncertainty in background and signal efficiency: TRolke 2.0

A C++ class was written for the calculation of frequentist confidence intervals using the profile likelihood method. Seven combinations of Binomial, Gaussian, Poissonian and Binomial uncertainties are implemented. The package provides routines for the calculation of upper and lower limits, sensitivity and related properties. It also supports hypothesis tests which take uncertainties into account. It can be used in compiled C++ code, in Python or interactively via the ROOT analysis framework.

Program summary

Program title: TRolke version 2.0Catalogue identifier: AEFT_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEFT_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: MIT licenseNo. of lines in distributed program, including test data, etc.: 3431No. of bytes in distributed program, including test data, etc.: 21 789Distribution format: tar.gzProgramming language: ISO C++.Computer: Unix, GNU/Linux, Mac.Operating system: Linux 2.6 (Scientific Linux 4 and 5, Ubuntu 8.10), Darwin 9.0 (Mac-OS X 10.5.8).RAM:∼20 MBClassification: 14.13.External routines: ROOT (http://root.cern.ch/drupal/)Nature of problem: The problem is to calculate a frequentist confidence interval on the parameter of a Poisson process with statistical or systematic uncertainties in signal efficiency or background.Solution method: Profile likelihood method, AnalyticalRunning time:<¹⁰−4 seconds per extracted limit.     

基于光照补偿和颜色统计的汽车牌照定位方法

基于车牌颜色相对固定,亮度易受光照条件影响的特点,提出一种车牌定位方法.把车辆图像从RGB空间转换到HSV空间,利用同态滤波对亮度分量进行光照补偿,保持色度和饱和度不变;转换回RGB空间,基于颜色统计进行车牌定位.实验结果表明,对于常见的蓝底车牌,该方法不仅能够实现光照不佳、背景复杂车辆的准确车牌定位,而且还能实现包括接近车牌颜色的各色车体的准确车牌定位.     

聚氧乙烯尾形链构象统计的Monte Carlo模拟

本文采用聚氧乙烯链的实际键长、键角和θ条件下每一链段处于不同旋转异构态的条件概率生成样本链分子,讨论了聚氧乙烯尾形链的构象性质,计算了尾形链的均方末端矩及其分量、用完全计算法及理论推导作了检验。讨论了样本库内均方末端矩的构象分布。结果表明,该方法能较精确地重现尾形链在平衡态时的真实构象分布,适用于尾形链的构象统计研究。