一类基于小波基函数插值的有限元方法

在分析具有大的梯度问题中,将具有紧支集的小波基函数引入到传统的有限元插值函数的构造中,对传统的插值方法进行修正。对新的插值模式进行了数值稳定性（解的唯一存在性）分析并通过分片分析讨论了解的收敛性,新的插值模式所引入的附加自由度通过静力凝聚法来消除,最后得到了基于变分原理的小波有限元列式。     

一种构造正交小波基的新方法

本文给出了构造正交小波基的一种新的方法,主要是通过改造钟形函数来构造有具体表达式的小波母函数,在光滑性,局部性等性质上优于一般的构造方法,其收敛于零的阶数可达到O(|t|~(-N)),N≥4。而且更进一步在S空间上构造出收敛更快的小波母函数。     

一种有实用价值的小波包的构造

小波分析是八十年代发展起来的新数学分支,小波基和小波包的构造不但在理论上,而且在应用中具有实际意义上,本文构造了一个具有较快衰减性,较好光滑性及对称性且能实现数值计算的正交小波包。     

构造正交小波基的基本方法之一

本文不仅给出一种构造局部性好的正交小波基的方法,并且给出了构造各种优良性质的正交小波基的一般思想方法。其特点:使构造的小波母函数有具体的表达式,既有较好的光滑性,又有很好的局部性,并且其收敛速度与│t│~（-（3k 1））同阶,其中k为任意自然数。这种方法不需要每次重新构造函数,只要改变k的值,就能满足不同实际问题的需要。     

Correlation Wavelet and its Applications

§１．　ＤａｕｂｅｃｈｉｅｓＷａｖｅｌｅｔｓａｎｄＣｏｒｒｅｌａｔｉｏｎＷａｖｅｌｅｔｓＡｓｗｅｋｎｏｗ,Ｄａｕｂｅｃｈｉｅｓｓｃａｌｉｎｇｆｕｎｃｔｉｏｎφ（ｘ）ａｎｄｗａｖｅｌｅｔｆｕｎｃｔｉｏｎψ（ｘ）ｈａｖｅｔｈｅｆｏｌ－ｌｏｗｉｎｇｐｒｏｐｅｒｔｉｅｓ：１．φ（ｘ）ｉｓａｇｅｎｅｒａｔｉｎｇｅｌｅｍｅｎｔｆｏｒａｍｕｌｔｉｒｅｓｏｌｕｔｉｏｎａｎａｌｙｓｉｓ（ＭＲＡ）,ｓｕｐｐφ（ｘ）＝［０,２Ｎ－１］,ｏｒｔｈｏｇｏｎａｌｗｉｔｈｉｎｔｅｇｅｒｔｒａｎｓｌａｔｉｏｎｓ．Ｇｅｎｅｒａｌ…     

小波包变换及代价函数设计综述

小波包是小波理论的重要组成部分,在非平稳信号特征检测和故障诊断中具有广泛的应用。小波包教学是小波分析教学的一个难点,也是一个较容易忽视的知识点。本文分析了小波包理论,归纳总结了小波包目标函数,以及它们适用的领域,并提出了新的目标函数。本文可以对小波包的教学提供一些新的思路。     

小波函数值的计算

由于Fourier分析的局限性,小波分析已成为数据压缩、信号分析和图象处理等领域中强有力的工具,小波分析与Fourier分析相比,具有下面两方面的优势:(a)小波分析具有良好的局部性;(b)小波是大多数已知Banach空间的无条件基,而Fourier变换的基函数e~(ikx)仅是L~2(R)空间的无条件基.     

一类二元半正交小波包的构造

本文给出伸缩矩阵行列式为2的一类二元半正交小波包的构造算法.该小波包是以频域给出的,随着用于小波包分裂的滤波器选取的不同会得到L2(R2)中形态各异的Riesz基,这样使得L2(R2)中小波基的选择更灵活.     

小波在股市数据分析中的应用

本文把股票日收益率时间序列看作一维时间信号 ,构造了新的小波母函数作为滤波器 ,对此时间信号做滤波处理 ,消除了数据的奇异性 ,从而可以宏观地预测股票日收益率走势 .     

与小波相关的一个非线性算子

HuangY.在1996年定义并研究了一个非线性算子T,每一个尺度函数都是T的不动点.本文对任意f∈L     

Formulation of linear problems and solution by a universal machine

Using the predicate language for ordered fields a class of problems referred to aslinear problems is defined. This class contains, for example, all systems of linear equations and inequalities, all linear programming problems, all integer programming problems with bounded variables, all linear complementarity problems, the testing of whether sets that are defined by linear inequalities are semilattices, all satisfiability problems in sentenial logic, the rank-computation of matrices, the computation of row-reduced echelon forms of matrices, and all quadratic programming problems with bounded variables. A single, one, algorithm, to which we refer as theUniversal Linear Machine, is described. It solves any instance of any linear problem. The Universal Linear Machine runs in two phases. Given a linear problem, in the first phase a Compiler running on a Turing Machine generates alinear algorithm for the problem. Then, given an instance of the linear problem, in the second phase the linear algorithm solves the particular instance of the linear problem. The linear algorithm is finite, deterministic, loopless and executes only the five ordered field operations — additions, multiplications, subtractions, divisions and comparisons. Conversely, we show that for each linear algorithm there is a linear problem which the linear algorithm solves uniquely. Finally, it is shown that with a linear algorithm for a linear problem, one can solve certain parametric instances of the linear problem.Research was supported in part by the National Science Foundation Grant DMS 92-07409, by the Department of Energy Grant DE-FG03-87-ER-25028, by the United States—Israel Binational Science Foundation Grant 90-00434 and by ONR Grant N00014-92-J1142.Corresponding author.     

并行分批排序综述

并行分批排序起源于半导体芯片制造过程。在并行分批排序中,工件可成批加工,批加工机器最多可同时加工B个工件,批的加工时间为批中所有工件的最大工时。首先根据传统的机器环境和目标函数对并行分批排序已有成果进行分类介绍,主要为单机和平行机的机器环境,以及极小化最大完工时间、极小化总完工时间、极小化最大延迟、极小化误工工件数、极小化总延误和极小化最大延误的目标函数;然后梳理了由基本问题所衍生出来的具有新特点的16类新型并行分批排序,包括差异尺寸工件、多目标、工件加工时间或顺序存在限制、考虑费用和具有特殊机制等情况;最后展望未来的研究方向。     

A double-stage piecewise recursive filter for real-time applications

This paper examines the basic problem of estimating the state of a system described by a set of dynamical equations. The state estimation is performed by means of optimal filtering techniques in which the state observation is given by a set of nonlinear equations.The basic issue encountered in most engineering problems is the availability of more observable information than the processor can effectively process in real-time, while performing full optimal filtering on all available observable data. To alleviate this deficiency, an algorithm is developed in which the rate of information processing is kept at a high value, while the system statistics are evaluated at a much slower rate.The method utilizes a combination of fast and slow filtering loops, in which the observable data are processed at a high rate during the fast loop, while the system error covariance, gain computations, and all other system statistics are processed at a lower rate in the slow loop. Methods are provided to resolve any incompatibility in the system statistics resulting from this fast-loop/slow-loop processing combination.Applications describing problems pertaining to aircraft navigation are presented. Specifically, applications to aircraft navigation through a satellite network are studied. Appropriate simulation results from the above studies are shown.This work was performed under contract with the Department of the Air Force, Space and Missile Organization (SAMSO), Los Angeles, California, Contract No. F04-701-75-C-0180.The authors are indebted to Dr. C. Johnson, GPS System Engineer, Mr. G. Consolver, GPS Software Manager, and Mr. W. Riley, Communications/Navigation Department, Texas Instruments for their continuous encouragement in the course of this work. Also, they are indebted to Major M. Birnbaum, SAMSO, for his constructive criticism on the conceptual design of this work, and to Mr. A. Bierman, Aerospace Corporation, for kindly providing simulation data of aircraft trajectories. Finally, the authors would like to express their gratitude to Dr. N. Carlson, Intermetrics, for valuable consultation during the progress of this work.Portions of this paper were presented by the senior author at the GSP Conference, Plan 76, IEEE Position, Location, and Navigation Symposium, San Diego, California, 1976.     

基于模糊FNN-ELECTRE法的国有商业银行竞争力评价

随着金融业全方位开放,国有商业银行已成为国家经济命脉的核心,其竞争力强弱关系着国家经济的繁荣与衰退。本文基于模糊FNN-ELECTRE方法建立国有商业银行竞争力评价模型,以因素神经网络理论(FNN)与ELECTRE融合方法为基础,以现有商业银行竞争力评价指标为着眼,把国有商业银行竞争力的评价体系从现实竞争力和潜在竞争力两个因素抽取为一级指标,以规模、质量、业务结构、效率、成长性五个因素设为二级指标。从实证的角度对银行A、银行B、银行C、银行D、银行E五大国有银行进行分析验证,对其属性值进行和谐性与非和谐性检验得出,银行B竞争能力最强,银行E竞争能力最弱,五大国有银行均有改进空间。     

Generalized symmetry of graphs — A survey

Symmetry of graphs has been extensively studied over the past fifty years by using automorphisms of graphs and group theory which have played and still play an important role for graph theory, and promising and interesting results have been obtained, see for examples, [L.W. Beineke, R.J. Wilson, Topics in Algebraic Graph Theory, Cambridge University Press, London, 2004; N. Biggs, Algebraic Graph Theory, Cambridge University Press, London, 1993; C. Godsil, C. Royle, Algebraic graph theory, Springer-Verlag, London, 2001; G. Hahn, G. Sabidussi, Graph Symmetry: Algebraic Methods and Application, in: NATO ASI Series C, vol. 497, Kluwer Academic Publishers, Dordrecht, 1997]. We introduced generalized symmetry of graphs and investigated it by using endomorphisms of graphs and semigroup theory. In this paper, we will survey some results we have achieved in recent years. The paper consists of the following sections.

1. Introduction

2. End-regular graphs

3. End-transitive graphs

4. Unretractive graphs

5. Graphs and their endomorphism monoids.

Moment information for probability distributions,without solving the moment problem,II: Main-mass,tails and shape approximation

How much information does a small number of moments carry about the unknown distribution function? Is it possible to explicitly obtain from these moments some useful information, e.g., about the support, the modality, the general shape, or the tails of a distribution, without going into a detailed numerical solution of the moment problem? In this, previous and subsequent papers, clear and easy to implement answers will be given to some questions of this type. First, the question of how to distinguish between the main-mass interval and the tail regions, in the case we know only a number of moments of the target distribution function, will be addressed. The answer to this question is based on a version of the Chebyshev–Stieltjes–Markov inequality, which provides us with upper and lower, moment-based, bounds for the target distribution. Then, exploiting existing asymptotic results in the main-mass region, an explicit, moment-based approximation of the target probability density function is provided. Although the latter cannot be considered, in general, as a satisfactory solution, it can always serve as an initial approximation in any iterative scheme for the numerical solution of the moment problem. Numerical results illustrating all the theoretical statements are also presented.     

On the weakening of the convergence of Newton’s method using recurrent functions

We use Newton’s method to approximate a locally unique solution of an equation in a Banach space setting. We introduce recurrent functions to provide a weaker semilocal convergence analysis for Newton’s method than before [J. Appell, E. De Pascale, J.V. Lysenko, P.P. Zabrejko, New results on Newton–Kantorovich approximations with applications to nonlinear integral equations, Numer. Funct. Anal. Optim. 18 (1997) 1–17; I.K. Argyros, The theory and application of abstract polynomial equations, in: Mathematics Series, St. Lucie/CRC/Lewis Publ., Boca Raton, Florida, USA, 1998; I.K. Argyros, Concerning the “terra incognita” between convergence regions of two Newton methods, Nonlinear Anal. 62 (2005) 179–194; I.K. Argyros, Convergence and Applications of Newton-Type Iterations, Springer-Verlag Publ., New York, 2008; S. Chandrasekhar, Radiative Transfer, Dover Publ., New York, 1960; F. Cianciaruso, E. De Pascale, Newton–Kantorovich approximations when the derivative is Hölderian: Old and new results, Numer. Funct. Anal. Optim. 24 (2003) 713–723; N.T. Demidovich, P.P. Zabrejko, Ju.V. Lysenko, Some remarks on the Newton–Kantorovich method for nonlinear equations with Hölder continuous linearizations, Izv. Akad. Nauk Belorus 3 (1993) 22–26. (in Russian); E. De Pascale, P.P. Zabrejko, Convergence of the Newton–Kantorovich method under Vertgeim conditions: A new improvement, Z. Anal. Anwendvugen 17 (1998) 271–280; L.V. Kantorovich, G.P. Akilov, Functional Analysis, Pergamon Press, Oxford, 1982; J.V. Lysenko, Conditions for the convergence of the Newton–Kantorovich method for nonlinear equations with Hölder linearizations, Dokl. Akad. Nauk BSSR 38 (1994) 20–24. (in Russian); B.A. Vertgeim, On conditions for the applicability of Newton’s method, (Russian), Dokl. Akad. Nauk., SSSR 110 (1956) 719–722; B.A. Vertgeim, On some methods for the approximate solution of nonlinear functional equations in Banach spaces, Uspekhi Mat. Nauk 12 (1957) 166–169. (in Russian); English transl.:; Amer. Math. Soc. Transl. 16 (1960) 378–382] provided that the Fréchet-derivative of the operator involved is p$p$-Hölder continuous (p∈(0,1]$p\in (0,1]$).     

泛系分析:数学·方法论·相对论·辩证思维

基于对广义系统、泛导、泛对称、泛箱原理、泛系相对性提出了新的分析模式与新的相对数学化的简化强化的定义,发展了泛系方法论与泛系相对论的框架与理法,具体内容涉及:相对普适的数学化的泛系,200类对偶,对偶转化,泛对称转化,泛系辩证,八畴方法,泛系数学方法,广义量化,逼近转化原则,泛等价定理,供求分析,思维实验,广义灰色系统,等等.     

Holomorphic manifolds on locally convex spaces

Based on locally compact perturbations of the identity map similar to the Fredholm structures on real Banach manifolds, complex manifolds with inverse mapping theorem as part of the defintion are proposed. Standard topics including holomorphic maps, morphisms, derivatives, tangent bundles, product manifolds and submanifolds are presented. Although this framework is elementary, it lays the necessary foundation for all subsequent developments.