网络安全产品研究

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

高阶数值微分的积分方法

本文研究了高阶数值微分问题,利用Groetsch的思想,获得了可以稳定逼近近似已知函数的任意阶导数的积分方法,并在一定条件下,给出了收敛率.给出了二阶、三阶和四阶数值微分问题的数值实验,实验结果表明了方法的有效性.     

秩为1矩阵的性质及应用

给出了秩1矩阵的结构,讨论了这类矩阵在矩阵运算、对角化、标准型等方面的性质,推广和改进了文[1]的一些相关结果,并指出了它的若干应用,重点讨论了一类矩阵,得到了有关结论和方法.     

老歪的礼物

放暑假了,庄库欢天喜地地和爸爸妈妈旅游去了,贝卡在Q岛上乐不思蜀,卡卡西被她朋友拉去逛街,正好遂了她的意,柯西探长视休息为无聊。只有老歪,学生不用上课了,看着空荡荡的教室和空荡荡的校园,他突然不知道该干啥了。     

具有时延和乱序网络化系统的动态矩阵控制北大核心CSCD

研究了具有时延和数据包乱序的网络化系统的动态矩阵控制问题.首先,通过时序分析,给出了控制器端和执行器端处理乱序的方法,建立了包含时延和乱序的网络化系统模型.然后,针对所建立的模型,提出了改进的动态矩阵控制算法,给出了控制器的设计方法.进一步,通过对系统的稳定性分析,导出了保证闭环系统稳定的充分条件.最后,通过仿真验证了所提方法的有效性.     

基于概率论的防空武器系统对集群敌机的服务效能研究

论述了防空武器系统服务效能的概念,提出了服务效能的评估指标,做出了符合防空作战一般规律的假设,据此,通过概率论的方法分析了对抗系统的各种状态,论证了系统统计平衡状态的存在,进而建立了数学解析模型,最后得出了对防空武器系统服务效能的定量评估指标.     

分层教学的Bayes分析

对学校分层教学进行了初步探索 ,提出了分层分班的 Bayes决策 ,介绍了分层分班方法 ,获得了一些结论 ,并完成了对这些结论的证明 ,从理论上论述了分层教学是实施“因材施教”教育原则和素质教育的有效途径 ,给出了应用实例 .     

区间数的绝对值与区间值函数的极限

研究了区间数的绝对值和区间值函数的极限问题.首先,讨论了区间数的H-差的性质,得到了H-差的两个运算法则;然后,给出了区间数的绝对值概念,并讨论了区间数绝对值的性质;最后,借助区间数的H-差和绝对值的概念,建立了区间值函数极限概念的一种新的表达方式,给出了极限存在的充分必要条件,证明了极限值的唯一性及对加法运算和数乘运算的封闭性.     

轴向弹塑性应力波作用下直杆中的分叉问题

考虑了一个弹塑性直杆的动力屈曲问题,将其归结为轴向阶跃应力波的传播导致的分叉问题,分析了横向惯性效应的影响,并考虑了应力波反射的作用,给出了相应的屈曲条件,最后进行了数值分析,从中得到了一些有益的结论。     

赏析2011年湖北高考理科立几题

2011年高考已经落幕,笔者有意关注了湖北数学试卷,解读理科数学试卷,两道立体几何试题给我留下了很深的印象.小题的背景和问题设置让人耳目一新;大题的解法入口宽,方法多,涉及的知识面广,打破了单纯考查立体几何的常规,建立了立体几何与函数、三角、向量、解几的密切联系.这两道试题充分体现了源于教材,略高于教     

The zero-one knapsack problem with equality constraint

The zero-one knapsack problem is a linear zero-one programming problem with a single inequality constraint. This problem has been extensively studied and many applications and efficient algorithms have been published. In this paper we consider a similar problem, one with an equality instead of the inequality constraint. By replacing the equality by two inequalities one of which is placed in the economic function, a Lagrangean relaxation of the problem is obtained. The relation between the relaxed problem and the original problem is examined and it is shown how the optimal value of the relaxed problem varies with increasing values of the Lagrangean multiplier. Using these results an algorithm for solving the problem is proposed.The paper concludes with a discussion of computational experience.     

The complexity of recursive constraint satisfaction problems

We investigate the complexity of finding solutions to infinite recursive constraint satisfaction problems. We show that, in general, the problem of finding a solution to an infinite recursive constraint satisfaction problem is equivalent to the problem of finding an infinite path through a recursive tree. We also identify natural classes of infinite recursive constraint satisfaction problems where the problem of finding a solution to the infinite recursive constraint satisfaction problem is equivalent to the problem of finding an infinite path through finitely branching recursive trees or recursive binary trees. There are a large number of results in the literature on the complexity of the problem of finding an infinite path through a recursive tree. Our main result allows us to automatically transfer such results to give equivalent results about the complexity of the problem of finding a solution to a recursive constraint satisfaction problem.     

Complexities and algorithms for synchronized scheduling of parallel machine assembly and air transportation in consumer electronics supply chain

In this paper, we study the problem of synchronized scheduling of assembly and air transportation to achieve accurate delivery with minimized cost in consumer electronics supply chain. This problem was motivated by a major PC manufacturer in consumer electronics industry. The overall problem is decomposed into two sub-problems, which consist of an air transportation allocation problem and an assembly scheduling problem. The air transportation allocation problem is formulated as an integer linear programming problem with the objective of minimizing transportation cost and delivery earliness tardiness penalties. The assembly scheduling problem seeks to determine a schedule ensuring that the orders are completed on time and catch the flights such that the waiting penalties between assembly and transportation is minimized. The problem is formulated as a parallel machine scheduling problem with earliness penalties. The computational complexities of the two sub-problems are investigated. The air transportation allocation problem with split delivery is shown to be solvable. The parallel machine assembly scheduling problem is shown to be NP-complete. Simulated annealing based heuristic algorithms are presented to solve the parallel machine problem.     

Solving Inverse Problems for Hyperbolic Equations via the Regularization Method

In the paper, we first deduce an optimization problem from an inverse problem for a general operator equation and prove that the optimization problem possesses a unique, stable solution that converges to the solution of the original inverse problem, if it exists, as a regularization factor goes to zero. Secondly, we apply the above results to an inverse problem determining the spatially varying coefficients of a second order hyperbolic equation and obtain a necessary condition, which can be used to get an approximate solution to the inverse problem.     

An integrated cutting stock and sequencing problem

In this paper an integrated problem formulated as an integer linear programming problem is presented to find an optimal solution to the cutting stock problem under particular pattern sequencing constraints. The solution uses a Lagrangian approach. The dual problem is solved using a modified subgradient method. A heuristic for the integrated problem is also presented. The computational results obtained from a set of unidimensional instances that use these procedures are reported.     

Algebra complexity problems involving graph homomorphism,semigroups and the constraint satisfaction problem

In this paper, we connect the constraint satisfaction problem with other complexity problems, like the polynomial equivalence problem for combinatorial 0-simple semigroups, the graph retraction problem and the geometry problem. We show that every constraint satisfaction problem is polynomially equivalent to an easily formulated algebra complexity problem. As an application we prove that the polynomial equivalence problem (word problem) for the 2×2 matrices over the two element field is co-NP-complete.     

On an optimal shape design problem to control a thermoelastic deformation under a prescribed thermal treatment

A shape optimization problem concerned with thermal deformation of elastic bodies is considered. In this article, measure theory approach in function space is derived, resulting in an effective algorithm for the discretized optimization problem. First the problem is expressed as an optimal control problem governed by variational forms on a fixed domain. Then by using an embedding method, the class of admissible shapes is replaced by a class of positive Borel measures. The optimization problem in measure space is then approximated by a linear programming problem. The optimal measure representing optimal shape is approximated by the solution of this finite-dimensional linear programming problem. Numerical examples are also given.     

The existence results for optimal control problems governed by a variational inequality

In this paper, we establish the existence of the optimal control for an optimal control problem where the state of the system is defined by a variational inequality problem with monotone type mappings. Moreover, as an application, we get several existence results of an optimal control for the optimal control problem where the system is defined by a quasilinear elliptic variational inequality problem with an obstacle.     

Recovery of the unknown coefficients in a two-dimensional hyperbolic equation

In this paper, an inverse boundary value problem for a two-dimensional hyperbolic equation with overdetermination conditions is studied. To investigate the solvability of the original problem, we first consider an auxiliary inverse boundary value problem and prove its equivalence to the original problem in a certain sense. We then use the Fourier method to reduce such an equivalent problem to a system of integral equations. Furthermore, we prove the existence and uniqueness theorem for the auxiliary problem by the contraction mappings principle. Based on the equivalency of these problems, the existence and uniqueness theorem for the classical solution of the original inverse problem is proved. Some discussions on the numerical solutions for this inverse problem are presented including some numerical examples.     

Solution of Finite-Dimensional Variational Inequalities Using Smooth Optimization with Simple Bounds

The variational inequality problem is reduced to an optimization problem with a differentiable objective function and simple bounds. Theoretical results are proved, relating stationary points of the minimization problem to solutions of the variational inequality problem. Perturbations of the original problem are studied and an algorithm that uses the smooth minimization approach for solving monotone problems is defined.