本质流形上的自适应运动估计

分析了计算机视觉中一种新的运动估计模型,将运动估计作为一个参数定义在"本质流形"上的非线性系统参数辨识问题。针对基于离散处理和连续处理方法得到的"本质流形",提出了一种新的、统一的自适应推广卡尔曼滤波算法,在"本质流形"的局部坐标系上进行运动估计。仿真结果验证了该算法的正确性。     

空间电磁环境计算机仿真

本文在建立了地面雷达数据库的基础上,对空间平台所处的雷达信号环境进行了仿真研究。文中给出了部分仿真数学模型和仿真软件模块结构,并利用仿真软件对空间平台位置处的雷达信号功率流密度和各种分布特性等进行了仿真试验研究,给出了有意义的仿真试验结果     

Dynamic pricing in a trade-in program with replacement and new customers

Trade-in programs have been widely adopted to enhance repeat purchase from replacement customers. Considering that a market consists of replacement and new segments, we study the joint and dynamic decisions on the selling price of new product (hereafter, “selling price”) and the trade-in price involved in the program. By adopting a vertical product differentiation choice model, we investigate two scenarios in this paper. In the base model, the manufacturer has sufficiently large production capacity to fulfill the customer demand. We characterize the structural properties of the joint pricing decisions and compare them with the optimal pricing policy under regular selling. We further propose a semi-dynamic trade-in program, under which the new product is sold at a fixed price and the trade-in price can be adjusted dynamically. Numerical experiments are conducted to evaluate the performance of the dynamic and semi-dynamic trade-in programs. In an extended model, we consider the scenario in which the manufacturer stocks a batch of new products in the beginning of the selling horizon and the inventory cannot be replenished. Following a revenue management framework, we characterize the structural properties with respect to time period and inventory level of new products.     

Inventory transshipment game with limited supply: Trap or treat

Inventory transshipment is generally shown to be beneficial to retailers by matching their excess demand with surplus inventory. We investigate an inventory transshipment game with two newsvendor-type retailers under limited total supply and check whether the retailers are better off than the case without transshipment. We derive the ordering strategies for the retailers and show that unlike the unlimited supply case, a pure Nash equilibrium only exists under certain conditions. Furthermore, contrary to the conventional wisdom, we show that inventory transshipment may not always benefit both retailers. Although one of the retailers is guaranteed to be better off, the other could be worse off. The decision criteria are then provided for the retailers to determine if they will benefit from the exercise of inventory transshipment. Numerical study indicates that the carefully chosen transshipment prices play an important role in keeping inventory transshipment beneficial to both retailers. Subsequently, a coordinating mechanism is designed for the retailers to negotiate transshipment prices that maximize the total profit of the two retailers while keeping each of them in a beneficial position.     

A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times

We investigate a single‐machine scheduling problem for which both the job processing times and due windows are decision variables to be determined by the decision maker. The job processing times are controllable as a linear or convex function of the amount of a common continuously divisible resource allocated to the jobs, where the resource allocated to the jobs can be used in discrete or continuous quantities. We use the common flow allowances due window assignment method to assign due windows to the jobs. We consider two performance criteria: (i) the total weighted number of early and tardy jobs plus the weighted due window assignment cost, and (ii) the resource consumption cost. For each resource consumption function, the objective is to minimize the first criterion, while keeping the value of the second criterion no greater than a given limit. We analyze the computational complexity, devise pseudo‐polynomial dynamic programming solution algorithms, and provide fully polynomial‐time approximation schemes and an enhanced volume algorithm to find high‐quality solutions quickly for the considered problems. We conduct extensive numerical studies to assess the performance of the algorithms. The computational results show that the proposed algorithms are very efficient in finding optimal or near‐optimal solutions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 41–63, 2017     

Does military spending promote social welfare? A comparative analysis of the BRICS and G7 countries

Whether military spending is capable of promoting social welfare is currently a controversial issue. The aim of this paper is to investigate how military spending affects the input and output of social welfare (i.e. social welfare expenditures and social welfare index). A panel cointegration analysis and an impulse response function are conducted with multi-country panel data, over two time periods, 1998–2011 and 1993–2007. In addition, to extend a comparative analysis over different economies, BRICS (i.e. Brazil, Russia, India, China, South Africa) and G7 (i.e. the US, Japan, Germany, the UK, France, Italy, Canada) countries are selected as representatives of emerging economies and developed countries, respectively. The empirical results show that military spending enhances social welfare expenditures in developed countries, while the effect is ambiguous in emerging economies. Also, military spending is capable of promoting the social welfare index based on the FMOLS estimation. The comparative analyses indicate that unlike in the G7, the effect of the growth of military spending on the growth of social welfare expenditures is negative and shorter in the BRICS.     

Strategic spectrum occupancy for secondary users in cognitive radio networks with retrials

This article investigates joining strategies and admission control policy for secondary users (SUs) with retrial behavior in a cognitive radio (CR) system where a single primary user (PU) coexists with multiple SUs. Under a certain reward‐cost structure, SUs opportunistically access the PU band when it is not occupied by the PU. If the band is available upon arrival, an SU decides with a probability either to use the band immediately or to balk the system. If the band is occupied, the SU must decide whether to enter the system as a retrial customer or to leave the system. Once the PU requests for service, the service of SU being served, if any, will be interrupted, and the interrupted SU leaves the band and retries for service after a random amount of time. In this article, we study the equilibrium behavior of non‐cooperative SUs who want to maximize their benefit in a selfish, distributed manner with delay‐sensitive utility function. The socially optimal strategies of SUs are also derived. To utilize the PU band more efficiently and rationally, an admission control policy is proposed to regulate SUs who enter the system in order to eliminate the gap between the individually and socially optimal strategies.     

预燃室内气氢气氧射流燃烧过程数值分析

建立了液体火箭发动机预燃室内气氢气氧射流燃烧过程的数学模型,包括燃烧过程控制守恒方程、湍流流动方程和湍流燃烧模型,以及求解控制方程所需的辅助关系式;给出了模拟射流燃烧过程的数值方法。对于给定的预燃室结构型式和尺寸,研究了喷嘴构型和氧的喷射方式对化学反应流场和燃烧性能的影响规律。结果表明,喷嘴构型和氧的喷射方式对流动过程和燃烧性能都有影响,且喷嘴结构的影响较为明显。     

图形式火警救援C3系统

图形式火警救援C~3系统是一个先进的在国内首次实现的以微型机为主处理机,达到实用水平的火警救援C~3系统。系统设计以C~3I理论和技术为基础,以地图和图形为背景,以很低的投资获取了较高的技术性能和系统功能。本文概要地介绍了该系统的总体设计思想和若干主要技术问题。     

一种求解飞行器廓线间断处超音速复杂流场的方法

用有限体积法求解三维完全气体的Ｎａｖｉｅｒ－Ｓｔｏｋｅｓ方程,并将通量守恒的分区计算方法和Ｂ－Ｌ湍流模型修正结合在一起,捕捉到了间断处的分离涡、激波、膨胀波等流场信息