二部图的(g,f)匹配

本文证明了二部图存在(g,f)匹配和f 因子的充要条件以及有关的几个结果,并且给出了求二部图的最大(g,f)匹配、最小(g,f)匹配和最小权最大f 匹配、最小权(g,f)匹配、最大权(g,f)匹配的算法。     

基于卷积神经网络的卫星网络协调态势评估方法

为充分发掘利用海量卫星网络数据,提高决策效率,加强空间频轨资源获取与储备的分析手段,尤其是对地球静止轨道资源的协调获取问题,提出基于机器学习算法的卫星网络态势评估策略。通过对卫星网络协调因素进行特征分析,选择卷积神经网络(Convolution Neural Network, CNN)为目标算法模型,并建立算法模型的训练数据集及Label规则,采用分裂信息增益度量方法对数据进行降维处理,建立CNN评估模型,并进行了验证分析。结果表明,CNN模型对卫星网络协调态势评估问题测试的正确率高达80%以上,具有较高的评估效能。随着数据量的增多,CNN评估效果逐步提升,是一种在卫星网络协调态势分析、资源储备的有效评估方法。     

混响背景下基于高阶统计量的动目标检测方法

针对混响背景中的动目标检测问题,根据基阵接收数据经过波束形成与匹配滤波后的输出结果计算高阶统计量,并将其视作观测空间。基于此空间中混响和目标回波的差异,利用多ping的高阶统计量构造特征向量,计算特征向量之间的马氏距离作为混响和目标差异的量化标准,再依据最大一致条件功效检测准则选择门限检测方法。波形数据仿真与海上实录数据检验均表明该方法的检测性能优于单ping波束形成及匹配滤波方法。通过蒙特卡洛仿真获得不同信混比下的ROC曲线,与单ping检测相比,在保证虚警概率小于0.01,检测概率大于0.5的条件下,最小可检测信混比降低约6dB。     

深度神经网络指导下的无线覆盖预测算法

为保证新一代移动无线网络能够根据实时覆盖情况动态地调节小区天线参数,需要实现高效且准确的无线覆盖预测。传统的求解方法通过精确的场强预测判断天线参数的优劣,虽然精度很高但需要大量的计算资源,无法满足5G和后5G移动网络通过实时覆盖预测进行射频参数动态调整的实际需求。现采用基于深度神经网络的算法对给定天线参数的覆盖效果进行预测,以取代对目标区域的精确场强预测。数值结果表明:该方法能够在保持计算准确性的同时显著减少计算量,为5G动态网络规划提供基础性参考数据。     

5G安全及网络监管问题探析

5G作为当今先进的通信技术,其广泛应用将给整个社会生产生活带来全新变革,相关技术和应用的安全问题,事关社会公共安全和军事利益安全,应纳入总体国家安全观视角下重点考量。本文主要梳理5G关键技术可能带来的网络安全风险,以及相关应用可能给网络监管带来的挑战,并从牢牢把控核心知识产权、综合构建安全保障体系、紧跟推进行业法律规范以及着力完善高效应急措施这四方面探讨相关的应对措施。     

Gabor-CNN for object detection based on small samples

Object detection models based on convolutional neural networks (CNN) have achieved state-of-the-art performance by heavily rely on large-scale training samples. They are insufficient when used in specific applications, such as the detection of military objects, as in these instances, a large number of samples is hard to obtain. In order to solve this problem, this paper proposes the use of Gabor-CNN for object detection based on a small number of samples. First of all, a feature extraction convolution kernel library composed of multi-shape Gabor and color Gabor is constructed, and the optimal Gabor convolution kernel group is obtained by means of training and screening, which is convolved with the input image to obtain feature information of objects with strong auxiliary function. Then, the k-means clustering algorithm is adopted to construct several different sizes of anchor boxes, which improves the quality of the regional proposals. We call this regional proposal process the Gabor-assisted Region Proposal Network (Gabor-assisted RPN). Finally, the Deeply-Utilized Feature Pyramid Network (DU-FPN) method is proposed to strengthen the feature expression of objects in the image. A bottom-up and a top-down feature pyramid is constructed in ResNet-50 and feature information of objects is deeply utilized through the transverse connection and integration of features at various scales. Experimental results show that the method proposed in this paper achieves better results than the state-of-art contrast models on data sets with small samples in terms of accuracy and recall rate, and thus has a strong application prospect.     

A novel facial emotion recognition scheme based on graph mining

Recent years have seen an explosion in graph data from a variety of scientific, social and technological fields. From these fields, emotion recognition is an interesting research area because it finds many applications in real life such as in effective social robotics to increase the interactivity of the robot with human, driver safety during driving, pain monitoring during surgery etc. A novel facial emotion recognition based on graph mining has been proposed in this paper to make a paradigm shift in the way of representing the face region, where the face region is represented as a graph of nodes and edges and the gSpan frequent sub-graphs mining algorithm is used to find the frequent sub-structures in the graph database of each emotion. To reduce the number of generated sub-graphs, overlap ratio metric is utilized for this purpose. After encoding the final selected sub-graphs, binary classification is then applied to classify the emotion of the queried input facial image using six levels of classification. Binary cat swarm intelligence is applied within each level of classification to select proper sub-graphs that give the highest accuracy in that level. Different experiments have been conducted using Surrey Audio-Visual Expressed Emotion (SAVEE) database and the final system accuracy was 90.00%. The results show significant accuracy improvements (about 2%) by the proposed system in comparison to current published works in SAVEE database.     

Sojourn times in G/M/1 fork‐join networks

We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

What you should know about simulation and derivatives

Derivatives (or gradients) are important for both sensitivity analysis and optimization, and in simulation models, these can often be estimated efficiently using various methods other than brute‐force finite differences. This article briefly summarizes the main approaches and discusses areas in which the approaches can most fruitfully be applied: queueing, inventory, and finance. In finance, the focus is on derivatives of another sort. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

The logistic–exponential survival distribution

For various parameter combinations, the logistic–exponential survival distribution belongs to four common classes of survival distributions: increasing failure rate, decreasing failure rate, bathtub‐shaped failure rate, and upside‐down bathtub‐shaped failure rate. Graphical comparison of this new distribution with other common survival distributions is seen in a plot of the skewness versus the coefficient of variation. The distribution can be used as a survival model or as a device to determine the distribution class from which a particular data set is drawn. As the three‐parameter version is less mathematically tractable, our major results concern the two‐parameter version. Boundaries for the maximum likelihood estimators of the parameters are derived in this article. Also, a fixed‐point method to find the maximum likelihood estimators for complete and censored data sets has been developed. The two‐parameter and the three‐parameter versions of the logistic–exponential distribution are applied to two real‐life data sets. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008