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

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

化学方程式配平的矩阵解法

基于矩阵解方程的理论，定义出了一个化学元素矩阵，从而找到了一种配平化学方程式的新方法，称之为矩阵解法。     

也谈分段函数的初等性

主要讨论一类能表示成最大值函数、最小值函数的分段函数的初等性。证明了只要能表示成最大值函数或最小值函数的分段函数一定是初等函数。     

集成有源负载放大器的研究

本文重点介绍了集成有源负载放大器的分析方法,并以镜像电流源为例详细介绍、对比了两种方法(图解分析法和微变等效电路分析法)。此外,介绍了用厄雷电压计算 Av 的简便方法。     

Partially isometric dilations of noncommuting -tuples of operators

Given a row contraction of operators on a Hilbert space and a family of projections on the space that stabilizes the operators, we show there is a unique minimal joint dilation to a row contraction of partial isometries that satisfy natural relations. For a fixed row contraction the set of all dilations forms a partially ordered set with a largest and smallest element. A key technical device in our analysis is a connection with directed graphs. We use a Wold decomposition for partial isometries to describe the models for these dilations, and we discuss how the basic properties of a dilation depend on the row contraction.

     

Variational Derivative for Buckling Loads of Beams and Frames

The finite-difference method is a numerical technique for obtaining approximate solutions to differential equations. The main objective of the present study is to give a new aspect to the finite-difference method by using a variational derivative. By applying this formulation, accurate values of the buckling loads of beams and frames with various end supports are obtained. The performance of this formulation is verified by comparison with numerical examples in the literature __________ Published in Prikladnaya Mekhanika, Vol. 41, No. 7, pp. 139–144, July 2005.     

A remark on divisibility of definable groups

We show that if G is a definably compact, definably connected definable group defined in an arbitrary o‐minimal structure, then G is divisible. Furthermore, if G is defined in an o‐minimal expansion of a field, k ∈ ? and p_k : G → G is the definable map given by p_k (x ) = x^k for all x ∈ G , then we have |(p_k )^–1(x )| ≥ k^r for all x ∈ G , where r > 0 is the maximal dimension of abelian definable subgroups of G . (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)