Factoring wavelet transforms into lifting steps

This article is essentially tutorial in nature. We show how any discrete wavelet transform or two band subband filtering with finite filters can be decomposed into a finite sequence of simple filtering steps, which we call lifting steps but that are also known as ladder structures. This decomposition corresponds to a factorization of the polyphase matrix of the wavelet or subband filters into elementary matrices. That such a factorization is possible is well-known to algebraists (and expressed by the formulaSL(n;R[z, z⁻¹])=E(n;R[z, z⁻¹])); it is also used in linear systems theory in the electrical engineering community. We present here a self-contained derivation, building the decomposition from basic principles such as the Euclidean algorithm, with a focus on applying it to wavelet filtering. This factorization provides an alternative for the lattice factorization, with the advantage that it can also be used in the biorthogonal, i.e., non-unitary case. Like the lattice factorization, the decomposition presented here asymptotically reduces the computational complexity of the transform by a factor two. It has other applications, such as the possibility of defining a wavelet-like transform that maps integers to integers. Research Tutorial Acknowledgements and Notes. Page 264.  

Ranking fuzzy numbers with integral value

Ranking fuzzy numbers is important in decision making. Since very often the alternatives are evaluated by fuzzy numbers in a vague environment, a comparison between these fuzzy numbers is indeed a comparison between alternatives. This paper proposes a method of ranking fuzzy numbers with integral value. The method, which is independent of the type of membership functions used and the normality of the functions, can rank more than two fuzzy numbers simultaneously. It is relatively simple in computation, especially in ranking triangular and trapezoidal fuzzy numbers. Further, an index of optimism is used to reflect the decision maker's optimistic attitude. Discussion on comparative advantages is included.  

逻辑度量空间

取赋值格为［０，１］，用积分工具引入了公式的真度和相似度的概念，并从而在公式集Ｆ上建立了伪距离，为近似推理提供了一种可能的框架．  

非奇H矩阵的简捷判据

非奇H矩阵在计算数学和矩阵理论的研究中很重要,但简便实用的判定条件较少见。本文给出几个简捷判据。[1,2,3]的主要结果是本文定理1的特例。 记M_n(C)为n阶复阵集合,M_n(R)为n阶实阵集合。设A=(a_(ij))∈M_n(C),记Λ_i(A)=sum from j≠i to |a_(ij)|,i,j∈N≡{1,2,…,n}。若|a_(ii)|>Λ_i(A),i∈N,则称A  

多层先验分布的构造及其应用

本文综述了先验分布的研究进展情况，给出了构造多层先验分布的方法——增减函数法，并给出了它们在无失效数据可靠性中的应用。  

两两NQD列的收敛性质

本文首先给出两两 ＮＱＤ列的 Ｋｏｌｍｏｇｏｒｏｖ型不等式，进而讨论两两 ＮＱＤ列的收敛性质，获得了与独立情形一样的Ｂａｕｍ和Ｋａｔｚ完全收敛定理，几乎达到独立惰形著名的Ｍａｒｃｉｎｋｉｅｗｉｃｚ强大数定律、三级数定理等结果．  

非线性波方程准确孤立波解的符号计算

该文将机械化数学方法应用于偏微分方程领域，建立了构造一类非线性发展方程孤立波解的一种统一算法，并在计算机数学系统上加以实现，推导出了一批非线性发展方程的精确孤立波解．算法的基本原理是利用非线性发展方程孤立波解的局部性特点，将孤立波表示为双曲正切函数的多项式．从而将非线性发展方程（组）的求解问题转化为非线性代数方程组的求解问题．利用吴文俊消元法在计算机代数系统上求解非线性代数方程组，最终获得非线性发展方程（组）的准确孤立波解.  

The ergodic theory of Markov chains in random environments

Summary A general formulation of the stochastic model for a Markov chain in a random environment is given, including an analysis of the dependence relations between the environmental process and the controlled Markov chain, in particular the problem of feedback. Assuming stationary environments, the ergodic theory of Markov processes is applied to give conditions for the existence of finite invariant measure (equilibrium distributions) and to obtain ergodic theorems, which provide results on convergence of products of random stochastic matrices. Coupling theory is used to obtain results on direct convergence of these products and the structure of the tail -field. State properties including classification and communication properties are discussed.  

奇异二阶边值问题的正解

本文分别在f超线性和次线性的情形研究非线性边值问题。u″＋a（t）f（u）＝0；αu（0）－βu′（0）＝0，γu（1）＋δu′（1）＝0的正解的存在性．其中a在端点可以具有奇性．  

A nonsmooth version of Newton's method

Newton's method for solving a nonlinear equation of several variables is extended to a nonsmooth case by using the generalized Jacobian instead of the derivative. This extension includes the B-derivative version of Newton's method as a special case. Convergence theorems are proved under the condition of semismoothness. It is shown that the gradient function of the augmented Lagrangian forC ²-nonlinear programming is semismooth. Thus, the extended Newton's method can be used in the augmented Lagrangian method for solving nonlinear programs.This author's work is supported in part by the Australian Research Council.This author's work is supported in part by the National Science Foundation under grant DDM-8721709.