基于梯度方向二进制模式的空间金字塔模型方法

空间金字塔模型由于其优势在当前图像分类中得到了广泛应用。然而,其码本生成和特征量化这两个环节具有较高的计算复杂度。为了解决这个问题,提出了一种新的局部特征表述———梯度方向二进制模式,首先对图像稠密采样得到多个子图像块,再将每个子图像块均匀划分为2×2个网格,计算每个网格的梯度直方图,然后对所有网格的梯度主方向进行二进制编码并连接为二进制串值,该二进制串值转换的十进制数即为子图像块的特征表述,最后将该特征表述嵌入到SPM模型中。在标准分类数据库上的实验结果证明了本方法在算法耗时和分类精度上均优于基于SIFT的SPM方法。     

设备的一种计划维修策略

本文根据设备在全寿命内有事后修理、计划修理和最后报废的实际情况,以全寿命内单位时间的更新维修期望费用最少为目标函数,建立一种数学模型,寻求设备在全寿命内最佳计划修理次数N和最佳的一组计划维修时间间隔集T。     

并联TBCC动力对高超声速飞行器性能的影响

针对马赫数为6的一级高超声速巡航飞行器的动力需求,提出涡轮/亚燃冲压/双模态超燃冲压组合动力（T/RJ/DMSJ）和射流预冷涡轮/亚燃冲压/双模态超燃冲压组合动力(PCT/RJ/DMSJ)两种方案。在给定的飞行任务下,分析起飞推重比分别为0.8和1.0时,飞行器完成任务时的航程和飞行时间,并对比了PCT/RJ/DMSJ在两种工作模态下的性能。研究结果表明：在相同的起飞推重比下,两种组合动力方案的航程和飞行时间相差不大。当起飞推重比为0.8时,采用PCT/RJ/DMSJ组合动力方案比T/RJ/DMSJ组合动力方案的航程高出3.6%,飞行时间高出3.8%;当起飞推重比为1.0时,PCT/RJ/DMSJ的航程和飞行时间比T/RJ/DMSJ的分别高出4.6%和4.8%。在小推重比下,跨声速段的燃料消耗和飞行时间占整个加速爬升段的比例较大,随着推重比的增加,这个比例减小,巡航可用的燃料比例增大,巡航距离增加,提高起飞推重比可以提高超声速飞行器的航程并缩短飞行时间。     

马尔可夫过程的k/N系统使用任务完成能力分析

研究了任务期间允许换件维修和备件供应时k/N系统的任务完成能力.首先,利用马尔可夫过程分析了k/N系统的状态转移过程,研究了k/N系统在特定维修保障策略下的运行过程.然后,以k/N系统固定任务时间内在正常状态停留时间的分布函数作为其任务完成概率模型,并通过全概率分解和更新过程的分析方法对任务完成概率进行求解.最后,利用任务完成概率模型在Matlab中绘制了任务完成概率随任务时间、任务量、备件携行数量以及备件平均供应时间的变化曲线,讨论并分析了对任务完成概率的影响.     

Monotone optimal preventive maintenance policies for stochastically failing equipment

This paper examines various models for maintenance of a machine operating subject to stochastic deterioration. Three alternative models are presented for the deterioration process. For each model, in addition to the replacement decision, the option exists of performing preventive maintenance. The effect of this maintenance is to “slow” the deterioration process. With an appropriate reward structure imposed on the processes, the models are formulated as continuous time Markov decision processes. the optimality criterion being the maximization of expected discounted reward earned over an infinite time horizon. For each model conditions are presented under which the optimal maintenance policy exhibits the following monotonic structure. First, there exists a control limit rule for replacement. That is, there exists a number i* such that if the state of machine deterioration exceeds i* the optimal policy replaces the machine by a new machine. Secondly, prior to replacement the optimal level of preventive maintenance is a nonincreasing function of the state of machine deterioration. The conditions which guarantee this result have a cost/benefit interpretation.     

基于A*算法的实时航迹规划方法研究

根据巡航导弹实时航迹规划时效性强、弹载计算设备的运算速度和内存容量有限等特点,将巡航导弹的机动性能约束与规划空间的划分结合起来,构造了一个较小的搜索空间,然后在此缩小了的搜索空间内利用A*算法具有的启发式特点,可在有效时间内搜索到满足要求的可行航迹.最后,通过一个例子对A*算法进行了验证.     

The relationship between decision variables and penalty cost parameter in (Q,R) inventory models

This paper is concerned with the optimum decision variables found using order quantity, reorder point (Q, R) inventory models. It examines whether the optimum variables (Q* and R*) are necessarily monotonic functions of the backorder cost parameter (or equivalently of the performance objective). For a general class of models it is proved that R* must increase as the performance objective is raised, and an inequality condition is derived which governs how Q* will change. Probability distributions of lead time demand are cited or found for which Q* increases, Q* decreases, and Q* is independent of increases in performance objectives or backorder cost parameter.     

一体化联合作战指挥决策节点提前工作时间研究

分布式联合决策可缩短系统决策时间,提高决策质量.运用分布式联合决策,其关键点之一是确定各流程节点的工作开始时刻.依据影响分布式联合决策各节点开始工作时刻的主要因素是上下节点间传递的信息的特点,引入了信息熵的概念,通过一定的阈值来确立分布式联合决策系统中各节点的开始决策时刻.利用Bernstein多项式建立了分布式联合决策开始时刻数学模型,给出了求解该数学模型的方法,指出了该模型应用于实践的思路.     

使用三个数域的数域筛算法

大整数分解难题是RSA密码的数学安全基础.目前数域筛算法是分解365比特以上大整数的最有效方法,然而它的时间复杂度仍然是亚指数的.对于目前普遍使用的1024比特以上大整数,数域筛算法还不能分解,所以研究数域筛算法具有重要的意义.现有的一般数域筛算法普遍使用两个数域,对多个数域的研究极少.一般数域筛算法经过修改可以使用三个数域,即两个代数数域和一个有理数域.分析表明:修改后的数域筛算法与原来的一般数域筛算法在时间复杂度上处于同一量级.但修改后的数域筛算法有更多地方可以合并计算,所以计算速度更快了.通过两个实验也验证了这一结论.     

任意长二维 DFT 的多项式变换算法及其并行算法

本文给出任意长二维ＤＰＴ的ＦＰＴ算法及其并行算法,详细地讨论了Ｎ＝ｐ￣ｅ的情况（ｐ为素数）。与通常二维ＤＦＴ的行列算法比较,乘法量减少约５０％,加法量略有增加。     

分析电路的改进节点法

本文针对含有理想电压源支路的电路,提出了改进节点法,其解变量为电路真正的独立节点电压(N-M-1),较之混合法(N+M-1)少(因其求解变量为节点电压和理想电压源支路的电流,其中 N 为节点数目,M 为独立电压源支路数)。文中还举例说明了这种方法的应用,并验证了它的正确性.     

海洋能驱动航行器的能源最优航迹规划研究

无人水面航行器在航行过程中受到尺寸限制,只能携带有限的能源,而海洋中蕴含大量的能源,如果无人水面航行器在航行过程中能利用广泛分布的海洋能源,那么其续航能力将会显著提升.研究一种海洋能驱动航行器的能源最优航迹规划方法,使海洋能驱动航行器在航行过程中尽可能少地消耗能源,并尽可能多地利用海洋能.首先,选取我国南海部分海域作为...     

Optimal policies for M/M/m queue with two different kinds of (N,T)‐policies

In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000     

A periodic maintenance model with used equipment and random minimal repair

The maintenance strategy considered in this article is in the class of block replacement policies. The working unit is replaced by new ones at instants T,2T,3T,… independently of the age and state of the unit. If a failure occurs between these instants, the random repair cost is evaluated. If it is smaller than a predetermined control limit then a minimal repair is carried out. Otherwise the unit is replaced by a used unit. The performance of this maintenance strategy is evaluated in terms of average total cost per time unit over an infinite time span. The mathematical model is defined and several analytical results are obtained. A computer program has been written, which solves the mathematical problem, and some examples are given for the cases where the underlying life distribution is gamma, Weibull or truncated normal.     

Optimal scheduling of objects in circulating systems

A “circulating system” is a finite collection of objects, each of which is oscillaling between two states. The prototype system is that of ships on patrcl,each subject to a quasi-regular “duty-service” cycle. There are various restrictions on the time spent in either state by an object and on the number of objects in a state at any one time. Schedules are sought in which the total number in one state is as large and as constant as possible. The maximal average number in one state is calculated, and a necessary and sufficient condition is given for a schedule to achieve it. Procedures are developed for constructing a schedule which achieves the maximal average in the most constant manner.     

A duel complicated by false targets and uncertainty as to opponent type

An attacker, being one of two types, initiates an attack at some time in the interval [-T, 0]. The a priori probabilities of each type are known. As time elapses the defender encounters false targets which occur according to a known Poisson process and which can be properly classified with known probability. The detection and classification probabilities for each type attacker are given. If the defender responds with a weapon at the time of attack, he survives with a probability which depends on the number of weapons in his possession and on attacker type. If he does not respond, his survival probability is smaller. These probabilities are known, as well as the current number of weapons in the defender's possession. They decrease as the number of weapons decreases. The payoff is the defender's survival probability. An iterative system of first-order differential equations is derived whose unique solution V₁(t),V₂(t),…,V_k(t) is shown to be the value of the game at time t, when the defender has 1, 2,…, k,… weapons, respectively. The optimal strategies are determined. Limiting results are obtained as t→-∞, while the ratio of the number of weapons to the expected number of false targets remaining is held constant.     

双正常算子及其性质

讨论Hilbert空间上具有A A与AA可交换的算子类的性质及其刻画,考察这类算子与其它算子类的关系,并给出了一些例子,用以说明有关算子类的包含关系.     

基于A~*算法的虚拟士兵城市作战路径规划

针对虚拟士兵在城市作战仿真领域的需求,重点研究了虚拟士兵在城市环境中路径规划问题。通过对三维城市虚拟环境空间进行分层信息处理,生成虚拟士兵能够感知的虚拟信息层。用A*算法求出虚拟士兵从初始位置到达目标位置的最佳路径,并给出算法的具体设计与实现。     

离散 Hartley 变换的 MIMD 并行算法

本文把长为N=N_1N_2(N_1为奇数)的离散Hartley变换(DHT)分解成N_1个长N_2的DHT及一些附加运算,附加运算也可以变成N_2个长N_1的DHT。由此得到计算它的一种MIMD并行算法,若用N_1台处理机并行计算,只需(?)个乘法步和(?)个加法步,这里M(N_2)和A(N_2)分别表示计算一个长N_2的DHT所需的乘法数及加法数。并行机的有效利用率接近于1。     

Availability of an operating system during a given time interval: A dynamic programming approach

We consider the problem of running a one-unit failure system such that the probability that the system is operating over an entire prespecified time interval (or at least at some time instant during the interval) is maximized. A fixed number of unused units having identically distributed random operating times are at the controller's disposal. Simple assumptions are made on the stochastic failure mechanism. In particular, the time required to activate a unit for the system is supposed to be constant. Analyzing the associated dynamic programming equations yields closed-form solutions. © 1996 John Wiley & Sons, Inc.