Z域与S域的直接变换方法

Ｚ域分析和Ｓ域分析都是线性信号与系统分析处理中的重要方法。本文给出Ｚ域与Ｓ域直接变换公式,以满足实陆应用的需要。     

聚焦能打胜仗增强思想政治教育的感召力

聚焦能打仗、打胜仗,增强思想政治教育的感召力,应坚持晓之以理,深化理论灌输,着力夯实能打胜仗的思想根基;动之以情,提升情感体验,着力激发能打胜仗的精神动力;行之以实,加强军事历练,着力塑造能打胜仗的战斗意志;示之以范,展现人格魅力,着力强化能打胜仗的榜样力量.     

混合尺寸目标电磁计算的时域伪谱/有限体积混合方法

针对单一算法对混合尺寸目标进行时域电磁分析的困难,提出一种时域伪谱(PSTD)同时域有限体积(FVTD)混合方法。FVTD可方便地分析复杂的几何结构和材料,但是难以计算电大尺寸的目标,PSTD则特别适合计算电大尺寸的规则结构,但在模拟复杂的几何结构尤其是带有曲边结构以及电大、电小共存结构时存在困难。混合方法克服了单独算法的缺点,融合各自的优势,提高了算法的求解能力和应用范围。为了减小两种算法连接边界带来的反射,采用了FVTD计算面均值的二次函数重构方法,给出了交叠网格和非交叠网格两种混合方案。数值试验表明,混合方法有较高的精度,具有时域分析混合尺寸目标电磁问题的能力。     

利用二次函数图像展示物理问题情景

二次函数y=ax2 bx c,当a>0时,图象开口向上,顶点坐标为(-b2a,4ac-b24a),如图1所示,表明:y随着x增大,先减小后增大;当a<0时,图象开口向下,顶点坐标为(-b2a,4ac-b24a)如图2所示,表明:y随x的增加,先增大后减小图1图2物理问题是研究物理量之间的关系,数学中的二次函数关系及图象,反     

范梅南现象学教育学思想及方法探析

本文通过解读范梅南的现象学教育学著作及相关文献,揭示了现象学教育学的思想和方法.范梅南现象学教育学思想的核心是智慧教育学,它具有规范性、经验性、实践性和人文性,它的主要范畴包括教育意向、教育情景、教育时机、教育行动、教育关系、教育机智等.范梅南的现象学教育学方法涉及现象学问题的提出,生活体验数据的收集,现象学分析,现象学写作以及现象的教育学意义.范梅南的现象学教育学展现了一幅充满魅力的教育景观,为教育、教学、教师教育和教育研究提供了新的路向.     

侵华日军的坦克兵

坦克兵（战车兵、装甲兵）是以坦克、装甲输送车等为基本单位的战斗兵种,具有火力、机动力和装甲防护力相结合的特点,是现代陆军的重要突击力量。     

求解分层介质结构空域格林函数的固定实镜像法

空域格林函数的求解是矩量法分析分层介质结构的主要困难 ,也是关键所在。在离散复镜像技术的基础上 ,注意到逆问题解的不唯一性 ,提出了一种新方法———固定实镜像法 (FRIM ) ,即在用一组空域复镜像 (表示为复指数级数和 )来拟合谱域格林函数时 ,根据经典镜像理论给定镜像的实位置 ,然后用简单的点匹配法来求出相应实镜像的复幅度。该方法避免了复镜像法中用Prony法或广义函数束法 (GPOF)拟合的复杂计算过程 ,提高了计算速度 ,且物理含义也更加明确。文中给出了该方法的基本原理 ,给出一组数值模拟结果 ,与复镜像法吻合得很好 ,证实了该方法的有效性     

围绕两个适应 深化调整改革——总参动员部部长范晓光少将对本刊记者谈新年度的民兵预备役工作

新年伊始,本刊记者采访了总参谋部动员部范晓光部长,请范部长就新年度的民兵、预备役工作发表了谈话。 范部长首先肯定了过去一年的工作。他说,过去的一年,各级地方党委、政府和军事机关,认真贯彻党中央、国务院、中央军委关于国防后备力量建设的     

班务会故事

班务会是军队最小的行政会议,虽小却是构成军队的基本单位,是大家思想交流的园地。     

范维澄院士来院讲学

3月19日，中国工程院院士范维澄教授（武警学院兼职教授）来院讲学。学院院长杨隽、副院长张佩芳会见范院士。科研部副部长谢德兴等参加会见。会见结束后，范院士为消防两系师生作了题为《公共安全科技创新与应急平台》的学术报告，受到热烈欢迎。报告会由张副院长主持。     

Quadratic programming with quadratic constraints

A program with a quadratic objective function and quadratic constraints is considered. Two duals to such programs are provided, and an algorithm is presented based upon approximations to the duals. The algorithm consists of a sequence of linear programs and programs involving the optimization of a quadratic function either unconstrained or constrained to the nonnegative orthant. An example involving production planning is presented.     

minimax问题的广义共轭向量法

本文按照共轭向量法的理论,针对非奇异对称矩阵提出了广义共轭向量的概念,并论述了它的三个重要性质(线性独立性、可寻驻点和可扩展性)。在此基础上,构造了极小极大(minimax)问题的广义共轭向量法。理论分析表明,该算法具有二次终止性质,且在每一维搜索时具有确定的寻优特征(求极小或求极大)。该算法为用拉格朗日乘子法求解数学规划提供了一个可能的途径。计算实例表明该算法是有效的。     

幂函数型完全非线性函数原像分布的特征

完全非线性函数是特征为奇数的有限域上抗差分密码攻击最优的函数,目前已有的六类完全非线性函数都是2-1的。当Π(x)为Fqm上的Dembowski-Ostrom函数或者Coulter-Matthews函数时,从Fqm到Fq的完全非线性函数tr(aΠ(x))的原像分布恰有两种取值,其中一种取值对应Fqm所有平方剩余元,另一种取值对应Fqm所有非平方剩余元。该结论在文中得到了证明。     

星载双站SAR采用距离-多普勒算法的保相成像

星载双站合成孔径雷达(SAR)的成像可以采用距离-多普勒(RD)算法.算法的距离模型可使用二次模型和直线模型,针对系统双站的特点,讨论了高精度距离模型参数的求取方法.传统RD算法采用二次模型,在斜视情况下,二次模型可能会有较大误差,主要是会影响方位向压缩,因此讨论采用直线模型对应的方位压缩因子进行成像,从而改善方位向旁瓣.成像中为了使算法能够保相,需采用合适的方位向压缩因子,使其不破坏所成像的相位信息.     

Quadratic bottleneck problems

We study the quadratic bottleneck problem (QBP) which generalizes several well‐studied optimization problems. A weak duality theorem is introduced along with a general purpose algorithm to solve QBP. An example is given which illustrates duality gap in the weak duality theorem. It is shown that the special case of QBP where feasible solutions are subsets of a finite set having the same cardinality is NP‐hard. Likewise the quadratic bottleneck spanning tree problem (QBST) is shown to be NP‐hard on a bipartite graph even if the cost function takes 0–1 values only. Two lower bounds for QBST are derived and compared. Efficient heuristic algorithms are presented for QBST along with computational results. When the cost function is decomposable, we show that QBP is solvable in polynomial time whenever an associated linear bottleneck problem can be solved in polynomial time. As a consequence, QBP with feasible solutions form spanning trees, s‐t paths, matchings, etc., of a graph are solvable in polynomial time with a decomposable cost function. We also show that QBP can be formulated as a quadratic minsum problem and establish some asymptotic results. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem

In this paper we present a new formulation of the quadratic assignment problem. This is done by transforming the quadratic objective function into a linear objective function by introducing a number of new variables and constraints. The resulting problem is a 0-1 linear integer program with a highly specialized structure. This permits the use of the partitioning scheme of Benders where only the original variables need be considered. The algorithm described thus iterates between two problems. The master problem is a pure 0-1 integer program, and the subproblem is a transportation problem whose optimal solution is shown to be readily available from the master problem in closed form. Computational experience on problems available in the literature is provided.     

On the solution of some approximate continuous review inventory models

This article compares two types of approximating strategies for solving some continuous review inventory models noniteratively. One of these strategies is to approximate the normalized loss integral by an exponential function whereas the other strategy is to estimate the loss integral as a quadratic function of the right-tail probability. It is found that the latter method is significantly more accurate and versatile than the former method. Theoretical arguments are given to emphasize that both the right-tail probability and the loss integral are key functions involved in those models. Therefore, a good strategy should be not only to estimate these two functions, but also to retain the interrelationships between them. The quadratic method is better than the exponential method primarily because of the latter property.     

Optimal state-dependent pricing policies for a class of stochastic multiunit service systems

This paper models a k-unit service system (e.g., a repair, maintenance, or rental facility) with Poisson arrivals, exponential service times, and no queue. If we denote the number of units that are busy as the state of the system, the state-dependent pricing model formalizes the intuitive notion that when most units are idle, the price (i.e., the service charge per unit time) should be low, and when most units are busy, the price should be higher than the average. A computationally efficient algorithm based on a nonlinear programming formulation of the problem is provided for determination of the optimal state-dependent prices. The procedure ultimately reduces to the search on a single variable in an interval to determine the unique intersection point of a concave increasing function and a linear decreasing function. The algorithm takes, on the average, only about 1/2 second per problem on the IBM 360/65 (FORTRAN G Compiler). A discrete optimal-control approach to the problem is shown to result in essentially the same procedure as the nonlinear-programming formulation. Several properties of the optimal state-dependent prices are given. Comparisons of the optimal values of the objective function for the state-dependent and state-independent pricing policies show that the former is on the average, only about 0.7% better than the latter, which may explain partly why state-dependent pricing is not prevalent in many service systems. Potential generalizations of the model are discussed.     

保形插值的样条函数方法

对于给定的任何型值数组,本文通过插入新结点构造了Ｃ１连续的保形插值二次和三次样条函数Ｓ（ｘ）,最后还讨论了单调保形的插值样条函数。     

三角域上带多个形状参数的二次Bézier曲面片

对于三角域上二次Bézier曲面的形状调整问题,给出了带6个形状参数的拟二次Bernstein基函数。分析了该组基函数的性质,并由此组基函数定义了三角域上带形状参数的二次Bézier曲面片,该曲面片不仅具有三角域上二次Bézier曲面片的性质,而且在控制网格保持不变的条件下,具有形状可调性。形状参数具有明确的几何意义。实例表明：构造的曲面为几何造型中的曲面设计提供了有效的方法。