基于小波的信噪分离方法

本文在 Ｄｏｎｏｈｏ 提出的从噪声中恢复信号的非线性小波方法的基本原理的基础上, 并针对非线性小波方法的核心问题——浮动阈值的设定提出了新的算法。通过算例证明, 所设计的浮动阈值在实际应用中效果较好, 特别在低信噪比时信号恢复效果明显优于现常用的浮动阈值设计方法。     

介电谱快速测定汽油研究法辛烷值

根据汽油的介电性质与其组成、结构之间存在的相关关系,研制了用介电谱快速测定汽油研究法辛烷值的专用检测装置,采用偏最小二乘法建立数学模型,用全交互验证法对68个不同汽油样品的研究法辛烷值进行了分析。研究结果表明,汽油研究法辛烷值分析结果能够满足国家标准的再现性和重复性误差要求。该方法具有快速、简便的特点,适用于现场快速检测。     

Ku波段低噪声放大器的设计

运用ADS仿真设计工具,应用Fujitsu公司的FHX04X管芯,分析设计了一个Ku波段的二级平衡式低噪声放大器,在14 GHz～16 GHz的频率范围内获得了低于2 dB的噪声系数,大于16 dB的增益,同时满足输入输出驻波比小于2,输出1 dB压缩功率点大于8 dBm.并和单端电路形式的设计结果进行了比较.     

基于Agent技术的战术互联网动态频谱管理系统

动态频谱管理是提升战术互联网作战效能的主要手段之一.首先分析了战术互联网以及动态频率管理工作特点的基础上,设计了一种基于Agent技术的动态频谱管理系统,并详细介绍了动态频谱管理的实现方法.     

海洋环境监测平行系统优化融合

多个海洋环境监测系统之间存在的功能冗余导致资源浪费和不必要的资金投入,因此应将各个系统优化融合成有机整体来节约海洋环境监测的资源和成本。将海洋环境监测系统按照功能划分为不同的模块,在线性规划融合的基础上引入熵方法,以成本和效能指标为主要对象,通过合理分配,在确保系统优化融合后监测能力不降低的同时,尽量减少建设成本。     

On the reduction of total‐cost and average‐cost MDPs to discounted MDPs

This article provides conditions under which total‐cost and average‐cost Markov decision processes (MDPs) can be reduced to discounted ones. Results are given for transient total‐cost MDPs with transition rates whose values may be greater than one, as well as for average‐cost MDPs with transition probabilities satisfying the condition that there is a state such that the expected time to reach it is uniformly bounded for all initial states and stationary policies. In particular, these reductions imply sufficient conditions for the validity of optimality equations and the existence of stationary optimal policies for MDPs with undiscounted total cost and average‐cost criteria. When the state and action sets are finite, these reductions lead to linear programming formulations and complexity estimates for MDPs under the aforementioned criteria.© 2017 Wiley Periodicals, Inc. Naval Research Logistics 66:38–56, 2019     

基于深度学习的MPSK信号调制识别

为了有效实现信号调制方式的智能识别,提出基于深度学习的多进制相移键控(Multiple Phase Shift Keying, MPSK)信号调制识别方法。分析接收MPSK信号的循环谱,并通过提取MPSK信号循环谱的等高图获得二维特征信息,利用深度学习中的卷积神经网络对二维特征进行训练,使用测试样本对所设计的调制识别方法的有效性进行验证。仿真结果表明,所提方法具有良好的识别性能。     

Optimizing barge utilization in hinterland container transportation

In hinterland container transportation the use of barges is getting more and more important. We propose a real‐life operational planning problem model from an inland terminal operating company, in which the number of containers shipped per barge is maximized and the number of terminals visited per barge is minimized. This problem is solved with an integer linear program (ILP), yielding strong cost reductions, about 20%, compared to the method used currently in practice. Besides, we develop a heuristic that solves the ILP in two stages. First, it decides for each barge which terminals to visit and second it assigns containers to the barges. This heuristic produces almost always optimal solutions and otherwise near‐optimal solutions. Moreover, the heuristic runs much faster than the ILP, especially for large‐sized instances.     

Mathematical formulation and heuristic algorithm for the block relocation and loading problem

This study considers the block relocation and loading problem in container terminals. The optimal loading sequence and relocation location are simultaneously decided on the basis of the desired ship‐bay and initial yard space configuration. An integer linear programming model is developed to minimize the number of relocations in the yard space on the basis of no shifts in the ship bay. The accuracy of the model is tested on small‐scale scenarios by using CPLEX. Considering the problem size in the real world, we present a rule‐based heuristic method that is combined with a mathematical model for the removal, loading, and relocation operations. The influence of rules on algorithm performance is also analyzed, and the heuristic algorithm is compared with different types of algorithms in the literature. The extensive numerical experiments show the efficiency of the proposed heuristic algorithm.     

A refined deterministic linear program for the network revenue management problem with customer choice behavior

We present a new deterministic linear program for the network revenue management problem with customer choice behavior. The novel aspect of our linear program is that it naturally generates bid prices that depend on how much time is left until the time of departure. Similar to the earlier linear program used by van Ryzin and Liu (2004), the optimal objective value of our linear program provides an upper bound on the optimal total expected revenue over the planning horizon. In addition, the percent gap between the optimal objective value of our linear program and the optimal total expected revenue diminishes in an asymptotic regime where the leg capacities and the number of time periods in the planning horizon increase linearly with the same rate. Computational experiments indicate that when compared with the linear program that appears in the existing literature, our linear program can provide tighter upper bounds, and the control policies that are based on our linear program can obtain higher total expected revenues. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008