网络安全产品研究

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Modulus‐based synchronous multisplitting methods for solving horizontal linear complementarity problems on parallel computers

In this article, we generalize modulus‐based synchronous multisplitting methods to horizontal linear complementarity problems. In particular, first we define the methods of our concern and prove their convergence under suitable smoothness assumptions. Particular attention is devoted also to modulus‐based multisplitting accelerated overrelaxation methods. Then, as multisplitting methods are well‐suited for parallel computations, we analyze the parallel behavior of the proposed procedures. In particular, we do so by solving various test problems by a parallel implementation of our multisplitting methods. In this context, we carry out parallel computations on GPU with CUDA.     

A review of open queueing network models of manufacturing systems

In this paper we review open queueing network models of manufacturing systems. The paper consists of two parts. In the first part we discuss design and planning problems arising in manufacturing. In doing so we focus on those problems that are best addressed by queueing network models. In the second part of the paper we describe developments in queueing network methodology. We are primarily concerned with features such as general service times, deterministic product routings, and machine failures — features that are prevalent in manufacturing settings. Since these features have eluded exact analysis, approximation procedures have been proposed. In the second part of this paper we review the developments in approximation procedures and highlight the assumptions that underlie these approaches.     

Summatory Functions of Digital Sums Occurring in Cryptography

Morain and Olivos gave two algorithms that allow fast exponentiation in elliptic curve cryptosystems. These algorithms are based on representations of integers in certain redundant binary number systems. In this paper we consider the weight and the sum of digits function of these representations. In particular, we give formulas for their summatory functions. In the proofs we use the Mellin-Perron formula. In order to apply this formula, we have to compute the analytic continuation of a class of Dirichlet series.     

ISOMORPHISMS OF CIRCULANT DIGRAPHS OF DEGREE 3

Abstract. In this paper, we introduce a new approach to characterize the isomor-phisms of circulant digraphs. In terms of this method, we completely determine the isomorphic classes of circulant digraphs of degree 3. In psrticular, we characterize those circulant digraphs of degree 3 which don‘‘t satisfy JkdAm‘‘s conjectttre.     

Existence and asymptotic properties of aerotaxis model with the Fokker–Planck type diffusion

In this paper, we consider Fokker–Planck type diffusion aerotaxis equations which resemble the usual aerotaxis equations. In view of well-posedness, its own special diffusion structure enables us to take advantage. In two dimensions, we show the existence of global classical solutions under some appropriate conditions. In addition, the stabilization property of the solution is studied, as time approaches infinity. In three dimensions, we prove the existence of global weak solutions.     

Endomorphism monoids of free acts and O-wreath products of monoids

Monoids and acts which may have zero elements are considered. In Section 1 we construct a O-wreath product of monoids. In 2 we prove the theorem that the endomorphism monoid of a free act over a monoid with zero can be represented as a O-wreath product. Considering monoids with tero we are interested in their annihilator properties. In 3 we give necessary and sufficient conditions for a O-wreath product of monoids to be a right (left) Baer (Rickart) monoid. In 4 we obtain as a consequence corresponding conditions for the endomorphism monoid of a free act over a monoid with zero.     

Synthesis of fixed-order compensators

In classical design, a low-order compensator is applied to a given plant. In this paper, we present an algebric construction of low (or fixed)-order compensators. Using the theory of root clustering, we achieve the following design requirements: closed-loop relative stability, relative stable compensators, and compensator's zero inclusion. In addition, we present a general robust analysis for real parameters. To reduce the computational difficulties, we suggest the use of low-order compensators.     

Cache Oblivious Algorithms for the RMQ and the RMSQ Problems

In the Range Minimum/Maximum Query (RMQ) and Range Maximum-Sum Segment Query (RMSQ) problems, we are given an array which we can preprocess in order to answer subsequent queries. In the RMQ query, we are given a range on the array and we need to find the maximum/minimum element within that range. On the other hand, in RMSQ query, we need to return the segment within the given query range that gives the maximum sum. In this paper, we present cache oblivious optimal algorithms for both of the above problems. In particular, for both the problems, we have presented linear time data structures having optimal cache miss. The data structures can answer the corresponding queries in constant time with constant cache miss.     

某些算子代数的可加导子

本文主要研究非Ｉｎ型因子ＶｏｎＮｅｕｍａｎｎ代数的Ｎｅｓｔ子代数及两元生成格自反代数的可加导子的自动线性性和连续性问题．通过给出一个含无限维交换ＶｏｎＮｅｕｍａｎｎ子代数的代数上可加导子定理，证明了非Ｉｎ型因子ＶｏｎＮｅｕｍａｎｎ代数的Ｎｅｓｔ子代数上的可加导子是线性的，从而是自动连续的．这推广并简化证明了作者［１］中的主要结果．对于在非自伴算子代数研究中起重要的两元生成格自反代数，给出了所有可加导子是线性导子的充分必要条件．     

Archimedean copulae and positive dependence

In this paper, we consider different issues related to Archimedean copulae and positive dependence. In the first part, we characterize Archimedean copulae that possess positive dependence properties such as multivariate total positivity of order 2 (MTP₂) and conditionally increasingness in sequence. In the second part, we investigate conditions for exchangeable binary sequences to admit an Archimedean copula, and we show that they depend on the extendibility of the sequence, and therefore on its positive-dependence properties.