网络安全产品研究

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

On a class of Riemann surfaces

It is considered the class of Riemann surfaces with dimT1 = 0, where T1 is a subclass of exact harmonic forms which is one of the factors in the orthogonal decomposition of the spaceΩH of harmonic forms of the surface, namely The surfaces in the class OHD and the class of planar surfaces satisfy dimT1 = 0. A.Pfluger posed the question whether there might exist other surfaces outside those two classes. Here it is shown that in the case of finite genus g, we should look for a surface S with dimT1 = 0 among the surfaces of the form Sg\K , where Sg is a closed surface of genus g and K a compact set of positive harmonic measure with perfect components and very irregular boundary.     

Best approximation by downward sets with applications

We develop a theory of downward sets for a class of normed ordered spaces. We study best approximation in a normed ordered space X by elements of downward sets, and give necessary and sufficient conditions for any element of best approximation by a closed downward subset of X. We also characterize strictly downward subsets of X, and prove that a downward subset of X is strictly downward if and only if each its boundary point is Chebyshev. The results obtained are used for examination of some Chebyshev pairs （W,x）, where ∈ X and W is a closed downward subset of X     

The use of phase portraits to visualize and investigate isolated singular points of complex functions

ABSTRACT

Undergraduate students usually study Laurent series in a standard course of Complex Analysis. One of the major applications of Laurent series is the classification of isolated singular points of complex functions. Although students are able to find series representations of functions, they may struggle to understand the meaning of the behaviour of the function near isolated singularities. In this paper, I briefly describe the method of domain colouring to create enhanced phase portraits to visualize and study isolated singularities of complex functions. Ultimately this method for plotting complex functions might help to enhance students' insight, in the spirit of learning by experimentation. By analysing the representations of singularities and the behaviour of the functions near their singularities, students can make conjectures and test them mathematically, which can help to create significant connections between visual representations, algebraic calculations and abstract mathematical concepts.     

Comparison principle and analogues of the phragmen—lindelöf theorem for solutions of parabolic inequalities

It is well known that a Monotonicity Condition and a Coerciveness Condition principally lie in the basis of most results of the Theory of PDE's. The necessity of these important assumptions for the validity of a comparison principle and analogues of the Phragmen-Lindelöf theorem for solutions of quasilinear parabolic inequalities is discussed in the paper. In the first part of the work we introduce a new concept of monotonicity for nonlinear differential operators-nonlinear monotonicity concept-and on its basis we obtain new phenomena for solutions, subsolutions and supersolutions of the well-known quasilinear differential equations. In the second part we omit the current coerciveness condition and change it by a weaker one. In spite of this we obtain a series of new qualitative properties of solutions for wide classes of quasilinear parabolic inequalities. Most of these properties are also new for solutions of the well-known equations, which we consider in the paper.     

Nonexistence in power and gamma density regression, sum of nonnegative terms

When we use the power function α(c x)^b and gamma density αx^be^-cx to fit the data by the least squares method, we have to address the question of existence. The closure of the set of each type of these functions defined on a finite domain is determined. We derive a way to determine the closure of a sum of nonnegative functions if the closures of the summands are available.     

Schreier rewriting beyond the classical setting Dedicated to our teacher Alfred Lvovich Shmelkin on his 70th birthday

Using actions of free monoids and free associative algebras, we establish some Schreier-type formulas involving ranks of actions and ranks of subactions in free actions or Grassmann-type relations for the ranks of intersections of subactions of free actions. The coset action of the free group is used to establish a generalization of the Schreier formula in the case of subgroups of infinite index. We also study and apply large modules over free associative and free group algebras.     

A quantum spin system with random interactions I

We study a quantum spin glass as a quantum spin system with random interactions and establish the existence of a family of evolution groups {τ_t(ω)}_ω∈/Ω of the spin system. The notion of ergodicity of a measure preserving group of automorphisms of the probability space Ω, is used to prove the almost sure independence of the Arveson spectrum Sp(τ(ω)) of τ_t(ε). As a consequence, for any family of (τ(ω),β) — KMS states {ρ(ω)}, the spectrum of the generator of the group of unitaries which implement τ(ω) in the GNS representation is also almost surely independent of ω.     

Sur l'existence, l'unicité, la stabilité et les propriétés de grandes déviations des solutions d'équations différentielles stochastiques rétrogrades à horizon aléatoire. Application à des problèmes de perturbations singulières

We study the existence, uniqueness and stability of solutions of backward stochastic differential equations with random terminal time under new assumptions; then we establish a large deviation principle for the solutions of such equations, related to a family of Markov processes, the diffusion coefficient of which tends to zero. Finally we apply these results to the analysis of some singular perturbation problems for a class of nonlinear partial differential equations.     

Boundary-Value Problems of the Theory of Thin and Nonthin Orthotropic Shells with Account of Nonlinearly Elastic Properties and Low Shear Rigidity of Composite Materials

The basic geometric and physical relations and resolving equations of the theory of thin and nonthin orthotropic composite shells with account of nonlinear properties and low shear rigidity of their materials are presented. They are derived based on two theories, namely the theory of anisotropic shells employing the Timoshenko or Kirchhoff-Love hypothesis and the nonlinear theory of elasticity and plasticity of anisotropic media in combination with the Lagrange variational principle. The procedure and algorithm for the numerical solution of nonlinear (linear) problems are based on the method of successive approximations, the difference-variational method, and the Lagrange multiplier method. Calculations of the stress-strain state for a spherical shell with a circular opening loaded with internal pressure are presented. The effect of transverse shear strains and physical nonlinearity of the material on the distribution of maximum deflections and circumferential stresses in the shell, obtained according to two variants of the shell theories, is studied. A comparison of the results of the problem solution in linear and nonlinear statements with and without account of the shell shear strains is given. The numerical data obtained for thin and nonthin (medium thick) composite shells are analyzed.     

Clustering Methods in Microarrays

Summary DCT Given a finite set of points in an Euclidean space the \emph{spanning tree} is a tree of minimal length having the given points as vertices. The length of the tree is the sum of the distances of all connected point pairs of the tree. The clustering tree with a given length of a given finite set of points is the spanning tree of an appropriately chosen other set of points approximating the given set of points with minimal sum of square distances among all spanning trees with the given length. DCM A matrix of real numbers is said to be column monotone orderable if there exists an ordering of columns of the matrix such that all rows of the matrix become monotone after ordering. The {\emph{monotone sum of squares of a matrix}} is the minimum of sum of squares of differences of the elements of the matrix and a column monotone orderable matrix where the minimum is taken on the set of all column monotone orderable matrices. Decomposition clusters of monotone orderings of a matrix is a clustering ofthe rows of the matrix into given number of clusters such that thesum of monotone sum of squares of the matrices formed by the rowsof the same cluster is minimal.DCP A matrix of real numbers is said to be column partitionable if there exists a partition of the columns such that the elements belonging to the same subset of the partition are equal in each row. Given a partition of the columns of a matrix the partition sum of squares of the matrix is the minimum of the sum of square of differences of the elements of the matrix and a column partitionable matrix where the minimum is taken on the set of all column partitionable matrices. Decomposition of the rows of a matrix into clusters of partitions is the minimization of the corresponding partition sum of squares given the number of clusters and the sizes of the subsets of the partitions.