加强成人高校领导干部廉政建设的新途径

成人高校领导干部廉政建设在新的形势下要立足改革。思想上要端正认识 ,加强教育。在权利运作上进行规范化和制约。要健全监督机制 ,提高监督的整体效能 ,做到制度约束、职能部门监督与群众监督相结合 ,同时严格考核 ,实行责任追究制度 ,并把考核与干部使用、晋升、收入挂钩     

幂方根不等式的推广及应用

给出并证明了幂方根不等式的推广及其推论 ,利用此推广简证了几个重要不等式 ,利用其推论完善了一类初等代数问题     

对光的半波损失的探讨

本文根据光的电磁波理论 ,对光的半波损失产生的条件及本质进行了深入的探讨 ,并对几个光学实验进行了分析。证明了光只有在特定的角度入射时才会发生半波损失 ,在一般斜入射时 ,反射光并没有半波损失 ,但有相位的突变     

教考结合 教学相长——公关文秘专业考核方式改革初探

本文论述了公关文秘专业深化改革考核方法的指导思想、具体做法、配套措施和实施效果。结合具体课程重点阐述了案例讨论、情景模拟、实地调查、卷面考试等多种方式结合的考核方法     

论实现现代法治的基本途径

不同国家依各自传统 ,有不同的法治之路 ,中国的法治建设应立足传统 ,走有中国特色的法治之路 ,即社会演进型与政府推进型相结合的道路     

论建国以来高师公共课《教育学》教材建设历程

中国高等师范教育公共课《教育学》教材建设分为四个时期：一、以引进为主,创建中国化的时期;二、 教材的政治化、政策化的时期;三、恢复教育学的学科体系时期;四、《教育学》教材科学化的进程与困惑时期。《教 育学》教材的建设随着教育理论研究几经周折,发展至今逐步走向科学化。     

微分算子插值样条解析性质的一种新证法

讨论带线性泛函约束的微分算子插值样条 ,在空间Wm2 中给出了由约束泛函和微分算子构造再生核的普遍方法 ,利用微分算子及其共轭微分算子零空间基底之间的关系得到了微分算子插值样条解析性质新的推导方法。     

The multivariate Polya distribution in combat modeling

This paper investigates the multivariate Polya distribution (MPD) for application in combat models for which enemy targets must be randomly assigned to fighting units. Six sets of actual combat data motivate the allocation model. Scenarios include air‐to‐air combat, tank, and submarine warfare. Goodness of fit tests are derived which verify the validity of the MPD, and reinforce the notion that multinomial allocation is too simplistic for such combat models. Simulations to determine optimal allocations for minimal combat cost are applied in order to illustrate the role of the MPD in combat modeling. © 2001 John Wiley & Sons,Inc. Naval Research Logistics 48: 1–17, 2001     

相对论带电粒子与电磁波包之间的相互作用

研究了相对论带电粒子与电磁波包之间的相互作用,给出了带电粒子运动方程的严格解,得出了粒子的位置、速度和能量的显示表达式。本文结果对基础等离子体物理、自由电子激光、高功率微波和粒子加速器等领域具有一定的参考意义。     

Solution algorithms for the parallel replacement problem under economy of scale

We consider the parallel replacement problem in which machine investment costs exhibit economy of scale which is modeled through associating both fixed and variable costs with machine investment costs. Both finite- and infinite-horizon cases are investigated. Under the three assumptions made in the literature on the problem parameters, we show that the finite-horizon problem with time-varying parameters is equivalent to a shortest path problem and hence can be solved very efficiently, and give a very simple and fast algorithm for the infinite-horizon problem with time-invariant parameters. For the general finite-horizon problem without any assumption on the problem parameters, we formulate it as a zero-one integer program and propose an algorithm for solving it exactly based on Benders' decomposition. Computational results show that this solution algorithm is efficient, i.e., it is capable of solving large scale problems within a reasonable cpu time, and robust, i.e., the number of iterations needed to solve a problem does not increase quickly with the problem size. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 279–295, 1998