网络安全产品研究

本文在研究了网络安全的国内外有关情况后对网络安全技术进行了探讨 ,介绍了一种简单而实用的网络安全产品 ,添补了这方面的空白 ,而且本文介绍的产品已经应用到了许多部门 ,为网络安全做出了贡献     

探究两个一次函数图像的对称规律

在学习了反比例函数后,老师带大家总结了两个点及函数图像的对称性.对于两个一次函数对称的情况,我自己进行了探索,发现了     

系统动力学在城市污水再生回用系统中的应用

用系统动力学方法研究了城市污水回用系统.首先分析了影响城市污水回用系统的诸多因素以及它们之间的相互关系,探讨了污水再生回用系统行为和结构的特点,确定了系统中因素之间的定量关系,建立了城市污水回用系统动力学(SD)模型,并介绍了模型的检验方法.同时给出了SD模型的具体应用实例,对西北地区的某一城市的污水回用进行了预测和分析,提出了符合该城市发展的污水回用方案.     

分数阶抛物方程控制系统最优控制的稳定性

本文研究了一类分数阶抛物方程的最优控制问题,主要讨论了其最优控制与最优值的稳定性.利用了凸方法获得了获得了这类问题最优控制的稳定性结果,并且推广了在参考文献[3]中的最优控制稳定性结论.     

分数阶Chen-like系统混沌性态分析及控制

提出了一类Chen-like系统,研究了该系统奇点稳定性、混沌等动力学性态.讨论了Chen-like系中参数与阶数对系统混沌性态的影响,并给出了Chem-like系统出现混沌性态的阶次范围.与分数阶Chen系统相比,系统出现混沌性态的阶次范围增大了.根据分数阶系统稳定性理论及线性反馈控制,对系统进行了混沌控制,得出了混沌系统在平衡点处的稳定性条件.数值模拟验证了理论分析的正确性.     

数学教辅书中的一类极值问题解答错误及修正

指出了一些微积分教辅书中一类极值问题的解答错误,分析了产生错误的原因,仔细研究了变量之间的关系,从而给出了正确的答案.     

一种积分数据的函数重构及其误差估计

本文考虑了一种基于函数积分平均值的函数重构方法,在定义了一个插值算子之后建立了误差估计.从理论分析结果可以看出这种方法得到的解是适定的,因此我们不需要选择正则化参数,这样就简化了算法,而且最后一系列的数值结果很好的验证了这种方法的有效性.     

交通运输系统协调发展理论与模型研究

提出了交通运输系统协调度的评价分析模型.从系统论的观点出发,提出了交通运输系统协调理论的概念,探讨了交通运输系统随时间而不断演化变迁的规律,给出了交通运输系统协调发展基本步骤;并根据协调学原理,讨论了交通运输系统的协调性问题,提出了系统协调发展模型,对交通运输子系统内部及子系统之间及系统整体的协调发展问题进行了研究,探讨了交通运输可持续发展的系统协调管理过程,为进一步研究交通运输系统的可持续发展奠定了基础.     

对称阵的最小多项式及其应用

本文研究了对称阵的最小多项式的存在唯一性,利用对称阵的正交分解的基本思想,获得了对称阵的最小多项式的具体表示形式,改进了Hamilton-Caylay定理.并且给出了对称阵最小多项式的几个应用.     

一个函数不等式的加强与延伸

从一个常见的不等式谈起,分析了多种证明方法,运用该不等式推导出了多个重要结论,对不等式进行了扩充和加强,解释了蕴含的意义,显示了该不等式的重要性和深刻性.     

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.     

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.

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

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

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.     

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

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

互连网络的向量图模型

n-超立方体,环网,k元n超立方体,Star网络,煎饼(pancake)网络,冒泡排序(bubble sort)网络,对换树的Cayley图,De Bruijn图,Kautz图,Consecutive-d有向图,循环图以及有向环图等已被广泛的应用做处理机或通信互连网络.这些网络的性能通常通过它们的度,直径,连通度,hamiltonian性,容错度以及路由选择算法等来度量.在本文中,首先,我们提出了有向向量图和向量图的概念;其次,我们开发了有向向量图模型和向量图模型来更好地设计,分析,改良互连网络;我们进一步证明了上述各类著名互连网络都可表示为有向向量图模型或向量图模型;更重要的是该模型能够使我们设计出了新的互连网络---双星网络和三角形网络.     

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]$).