囿于控制多边形的NURBS拐点分析与控制

从变形的观点出发,首先研究了一般平面参数曲线变形过程中产生拐点的充分必要条件以及判定拐点的一个泛函方程。在此基础上,给出了研究非凸控制多边形NURBS曲线拐点的方法,特别研究了正则单拐、双拐多边形NURBS曲线拐点的分布问题,得到了分析与控制相应曲线拐点的条件和判据。本文的结果可应用于调节与控制曲线形状的算法设计,也可指导CAD造型工程师的交互设计。     

大型舰船电力系统网络重构研究

大型舰船电力系统的出现使供电方式由原来的辐射状向环形发展,其网络重构是一个崭新的问题.文中给出了大型舰船电力系统的网络拓扑结构并综合考虑了线路容量限制、节点电压约束及供电负荷优先性的重构数学模型,保证了各种情况下最大限度地给负荷供电.将规划遗传算法应用于所建模型的求解,并应用算例验证了此解法的可行性.     

船用堆物理启动外推临界曲线优化研究

外推临界监督是反应堆物理启动过程中的重要安全保证,控制棒积分价值的非线性和反应堆内的中子泄漏都对外推的准确性有重要影响.针对这种情况提出了一种综合考虑控制棒价值与堆芯泄漏的外推方法,提高了外推的准确性.     

非饱和土与特殊土力学的理论与实践

对非饱和土与特殊土(包括填土、黄土、膨胀土、膨润土等)开展了持久深入的研究,取得了系统的创造性成果:在国内率先研制成非饱和土固结仪、直剪仪、渗气仪、小型三轴仪、温控三轴仪、多功能三轴仪和土工CT-三轴仪等一系列仪器设备,揭示了非饱和土与特殊土的水气运动规律、变形、强度、屈服、水量变化、细观结构演化、温度效应等许多重要力...     

具有集值H-半-伪单调映射的广义向量变分不等式解的存在性

首先推广向量集值半一单调映射到向量集值H-半-伪单调映射,然后利用Kakutani—Fan—Glicksberg不动点定理,研究了具有集值H-半-伪单调映射的广义向量t变分不等式问题,在自反Banach空间中得到了两个存在性结果。     

基于北斗短报文的远海实时精密单点定位

针对远海精密导航与定位费用高昂的问题,提出利用北斗短报文传输多模全球导航卫星系统的实时服务数据,实现远海实时精密单点定位。为了降低通信成本和硬件成本,本研究对实时服务数据进行简化,弥补了北斗短报文带宽的不足;为了克服北斗短报文频率低的缺点,采取了实时精密星历预报的方法,来获取分钟间隔以外时刻的卫星轨道位置和钟差改正。对基于北斗短报文的远海实时精密单点定位的数据处理过程进行了仿真模拟。后期处理实测海洋观测数据,对定位性能进行测试,可实现水平方向厘米级定位,竖直方向精度为10~20 cm。该方法为低成本的远海实时定位提供了技术参考。     

A method to determine the shell layout scheme for equipment battlefield damage tests under artillery fire

In this paper,a new method for determining the shell layout scheme is proposed,which can make the equipment damage data by the battlefield damage test resemble as close as possible the actual combat data.This method is based on the analysis of the impact point distribution and effective damage area of equipment.In order to obtain the position of the impact points,an impact point distribution model under artillery fire was established.Similarly,in order to obtain the effective damage area of equipment,the concepts of generalized damage area and task-based equipment functional damage probability were demonstrated,and the corresponding calculation model was established.Through case analysis,the shell layout scheme was effectively obtained,verifying the correctness of the proposed method.     

Essentially Non-Oscillatory插值的分析与方法

在科学研究与工程计算中对插值的分析与方法理论已有很重要的应用,而对于ENO插值的方法与理论在大多教科书中却很少涉及,本文介绍ENO插值的应用及算法,为大学生们学习数值分析中的插值计算提供参考。     

Algorithms for solving the conditional covering problem on paths

Consider the conditional covering problem on an undirected graph, where each node represents a site that must be covered by a facility, and facilities may only be established at these nodes. Each facility can cover all sites that lie within some common covering radius, except the site at which it is located. Although this problem is difficult to solve on general graphs, there exist special structures on which the problem is easily solvable. In this paper, we consider the special case in which the graph is a simple path. For the case in which facility location costs do not vary based on the site, we derive characteristics of the problem that lead to a linear‐time shortest path algorithm for solving the problem. When the facility location costs vary according to the site, we provide a more complex, but still polynomial‐time, dynamic programming algorithm to find the optimal solution. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

On parallel machine replacement problems with general replacement cost functions and stochastic deterioration

The parallel machine replacement problem consists of finding a minimum cost replacement policy for a finite population of economically interdependent machines. In this paper, we formulate a stochastic version of the problem and analyze the structure of optimal policies under general classes of replacement cost functions. We prove that for problems with arbitrary cost functions, there can be optimal policies where a machine is replaced only if all machines in worse states are replaced (Worse Cluster Replacement Rule). We then show that, for problems with replacement cost functions exhibiting nonincreasing marginal costs, there are optimal policies such that, in any stage, machines in the same state are either all kept or all replaced (No‐Splitting Rule). We also present an example that shows that economies of scale in replacement costs do not guarantee optimal policies that satisfy the No‐Splitting Rule. These results lead to the fundamental insight that replacement decisions are driven by marginal costs, and not by economies of scale as suggested in the literature. Finally, we describe how the optimal policy structure, i.e., the No‐Splitting and Worse Cluster Replacement Rules, can be used to reduce the computational effort required to obtain optimal replacement policies. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005