极小相关组的Matlab实现及其在编码中的应用

纠错码技术是通信技术中不可或缺的一项技术,并在当今的通信技术发展中占有很高的地位,线性分组码是常用的一种纠错码,其纠错能力的计算需要以线性分组码最小码距的计算为基础。向量组极小相关组的提出,引入了向量组的距的定义,为线性分组码纠错能力的计算提供了新思路,极小相关组的有效而且快速求解方法研究将是一个新课题,针对计算机通信科学发展的需求,基于遍历法的思想,运用Matlab软件编写程序求解向量组的极小相关组,并将程序简单应用于具体向量组极小相关组的计算以及线性分组码纠错能力的计算。     

Enlargement of the Wiener filtration by an absolutely continuous random variable via Malliavin’s calculus

Summary. The analytic treatment of problems related to the asymptotic behaviour of random dynamical systems generated by stochastic differential equations suffers from the presence of non-adapted random invariant measures. Semimartingale theory becomes accessible if the underlying Wiener filtration is enlarged by the information carried by the orthogonal projectors on the Oseledets spaces of the (linearized) system. We study the corresponding problem of preservation of the semimartingale property and the validity of a priori inequalities between the norms of stochastic integrals in the enlarged filtration and norms of their quadratic variations in case the random element F enlarging the filtration is real valued and possesses an absolutely continuous law. Applying the tools of Malliavin’s calculus, we give smoothness conditions on F under which the semimartingale property is preserved and a priori martingale inequalities are valid. Received: 12 April 1995 / In revised form: 7 March 1996     

工艺规划系统中动态模式分类的研究

提出了工艺规划系统中动态模式分类（pattern classification）的概念，介绍了模式分类判定树和动态模式分类的基本原理，并对动态模式分类的聚类质量标准进行了研究。动态模式分类是基于实例归纳（case based reasoning,CBR)的自动分类过程，具有自学习和自完善的功能。     

A new family of proximity graphs: Class cover catch digraphs

Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs—class cover catch digraphs (CCCDs). CCCDs are a special case of catch digraphs. Solving the underlying CCP is equivalent to finding a smallest cardinality dominating set for the associated CCCD, which in turn provides regularization for statistical pattern classification. Some relevant properties of CCCDs are studied and a characterization of a family of CCCDs is given.     

Projection of Markov Measures May Be Gibbsian

We study the induced measure obtained from a 1-step Markov measure, supported by a topological Markov chain, after the mapping of the original alphabet onto another one. We give sufficient conditions for the induced measure to be a Gibbs measure (in the sense of Bowen) when the factor system is again a topological Markov chain. This amounts to constructing, when it does exist, the induced potential and proving its Hölder continuity. This is achieved through a matrix method. We provide examples and counterexamples to illustrate our results.     

一种小波域音频信息隐藏方法

提出了一种基于量化的小波域音频隐藏算法，将保密语音隐藏到载体音频中．为提高隐藏重和保密语音传输的安全性，对保密语音进行了小波域压缩编码和m序列的扩频调制，生成待隐藏的比特序列；通过量化方法，将编码和调制后的保密语音隐藏到载体音频的小波系数中；保密语音的恢复过程不需要使用原始音频、仿真结果表明，隐藏有保密语音的载体音频听觉质量没有明显下降，提取的保密语音感知质量较好；该算法对重量化、加噪、低通滤波等攻击均有良好的鲁棒性．     

There are infinitely many limit points of the fractional parts of powers

Suppose that α > 1 is an algebraic number and ξ > 0 is a real number. We prove that the sequence of fractional partsξα ⁿ , n = 1, 2, 3, …, has infinitely many limit points except when α is a PV-number and ξ ∈ ℚ(α). For ξ = 1 and α being a rational non-integer number, this result was proved by Vijayaraghavan.