网络安全产品研究

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

分层教学的Bayes分析

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

高阶数值微分的积分方法

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

基于质量控制的供应链计划问题研究

为了研究基于质量控制的供应链计划问题,采用了优化建模的方法,分析了易腐物品生命周期函数的选用及拟合原则,建立起了质量衰减成本与时间之间的关系,考虑了涉及交通及天气情况的运输风险,最终建立了优化模型,以实现供应链运行总成本最小。最后,提出了动态规划的求解方法,并通过仿真实验证明了算法的有效性。     

秩为1矩阵的性质及应用

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

VaR的统计检验

根据VaR的基本原理,对VaR的有效性进行了讨论.关于VaR提出了一个基于二点分布的检验模型,证明了存在一致最优检验,并给出了检验的表达式和拒绝域,同时鉴于金融数据的庞大性,又提出了基于渐近正态分布的检验模型,给出了检验的表达式和拒绝域.     

依靠自己站起来

以前,在西方的一个国家里,有一个经理,他把所有积蓄全部投资在了一个项目上,但由于世界大战的爆发,他破产了.他认为是他把家人害得没有了一切,于是就离开家人,成了一名流浪汉.他心情非常沮丧,对往事难以释怀,不肯为以后的日子打算,甚至想要自杀.一天,他偶然看到了一本名为《自信心》的书,这本书的内容讲的是人在生活、工作上崩溃了以后,如何重新恢复信心的事.他看后心里又有了一丝希望,想找到作者,请作者帮他再度站起来.     

基于干扰管理理论的航空备件模型参量扰动性分析

概述了干扰管理理论的内涵、意义以及目标,依据未来不确定因素引起飞机备件需求量变化以及备件供应时限性增强的实际情况,创建了时限一致度算子,优化了备件需求泊松分布模型,提高了备件供应的精确度,并选取了优化后的模型中的多个参量,进行了多因素的扰动性分析,最后构造了算例,验证了本方法的科学性和有效性.     

以研促教 教研相长——一次集体教研活动纪实

在一次集体教研活动中,通过对一道试题的探究、引申、延展,不仅深化了教师的思维,提升了“四基”“四能”,强化了学科素养的渗透,提高了教学站位,更难能可贵的是激发了教师们的教研热情,唤醒了他们的专业自觉,充分彰显了集体智慧和集体力量的伟大.     

改进的PROMETHEE方法在招标中的应用研究

针对 PROMETHEE方法的局限性 ,对 PROMETHEE方法进行了改进 ,用效用函数取代了优先函数 ,提出了属性权重的确定方法 .应用改进的 PROMETHEE方法 ,对某装备招标中的 6个方案进行了评价 ,取得了较好的效果     

Tanaka prolongation of free Lie algebras

With the exception of the three step real free Lie algebra on two generators, all real free Lie algebras of step at least three are shown to have trivial Tanaka prolongation. This result, together with the known results concerning the step two real free Lie algebras and the step three real free Lie algebra on two generators, gives a complete list of Tanaka prolongations for real free Lie algebras.      

Two‐step Newton‐type methods for solving inverse eigenvalue problems

In this paper, we apply the two‐step Newton method to solve inverse eigenvalue problems, including exact Newton, Newton‐like, and inexact Newton‐like versions. Our results show that both two‐step Newton and two‐step Newton‐like methods converge cubically, and the two‐step inexact Newton‐like method is super quadratically convergent. Numerical implementations demonstrate the effectiveness of new algorithms.     

认股权证隐含波动率迭代算法的改进

为了有效估计认股权证的隐含波动率,以及有利于观测权证的市场风险,对常用的迭代算法进行改进可加快计算速度.利用认股权证的Delta、Vega和Theta值以及多元泰勒公式导出认股权证隐含波动率变化与权证价格变化关系的不等式.根据导出的这个不等式给出了具体算法.实证结果说明这一算法改进了原有的算法,从而这个算法解决了原来的随意给定一个价格后不断修正的算法.     

Optimization-based simulation of nonsmooth rigid multibody dynamics

We present a time-stepping method to simulate rigid multibody dynamics with inelastic collision, contact, and friction. The method progresses with fixed time step without backtracking for collision and solves at every step a strictly convex quadratic program. We prove that a solution sequence of the method converges to the solution of a measure differential inclusion. We present numerical results for a few examples, and we illustrate the difference between the results from our scheme and previous, linear-complementarity-based time-stepping schemes.     

Time step selection for the numerical solution of boundary value problems for parabolic equations

An algorithm is proposed for selecting a time step for the numerical solution of boundary value problems for parabolic equations. The solution is found by applying unconditionally stable implicit schemes, while the time step is selected using the solution produced by an explicit scheme. Explicit computational formulas are based on truncation error estimation at a new time level. Numerical results for a model parabolic boundary value problem are presented, which demonstrate the performance of the time step selection algorithm.     

An efficient step size control for continuation methods

In solving a nonlinear equation by the use of a continuation method one of the crucial problems is the choice of the step sizes. We present a model for the total computational cost of a standard numerical continuation process and solve the problem of optimal step size control for this model. Using the theoretical results as a basis, we develop an adaptive step size algorithm for Newton's method. This procedure is computationally inexpensive and it gives quite satisfactory results compared to some other numerical experiments found in the literature.     

Prediction-correction method with BB step sizes

In the prediction-correction method for variational inequality (VI) problems, the step size selection plays an important role for its performance. In this paper, we employ the Barzilai-Borwein (BB) strategy in the prediction step, which is efficient for many optimization problems from a computational point of view. To guarantee the convergence, we adopt the line search technique, and relax the conditions to accept the BB step sizes as large as possible. In the correction step, we utilize a longer step length to calculate the next iteration point. Finally, we present some preliminary numerical results to show the efficiency of the algorithms.     

Subgradient algorithms on Riemannian manifolds of lower bounded curvatures

The subgradient algorithms for convex optimizations on Riemannian Manifolds of sectional curvatures bounded from below are studied; and the convergence results of the algorithms (employing diminishing step sizes and dynamic step sizes) are established. Some numerical experiments are provided to illustrate the convergence performances of the algorithms.     

A Study on CFL Conditions for the DG Solution of Conservation Laws on Adaptive Moving Meshes

The selection of time step plays a crucial role in improving stability and efficiency in the Discontinuous Galerkin (DG) solution of hyperbolic conservation laws on adaptive moving meshes that typically employs explicit stepping. A commonly used selection of time step is a direct extension based on Courant-Friedrichs-Levy (CFL) conditions established for fixed and uniform meshes. In this work, we provide a mathematical justification for those time step selection strategies used in practical adaptive DG computations. A stability analysis is presented for a moving mesh DG method for linear scalar conservation laws. Based on the analysis, a new selection strategy of the time step is proposed, which takes into consideration the coupling of the $α$-function (that is related to the eigenvalues of the Jacobian matrix of the flux and the mesh movement velocity) and the heights of the mesh elements. The analysis also suggests several stable combinations of the choices of the $α$-function in the numerical scheme and in the time step selection. Numerical results obtained with a moving mesh DG method for Burgers' and Euler equations are presented. For comparison purpose, numerical results obtained with an error-based time step-size selection strategy are also given.     

一个关于凸集强分离的充分必要条件及其应用

该文首先给出了关于两个非紧凸集可被强分离的充分必要条件，它是[1，2]中一个定理的改进，然后利用它改进了[4-7]中一些定理和[8]中的一个结果．