指路标志对人们的出行有着非常良好的指引作用,良好的指路标志设计可提高驾驶人的通行效率。路网中节点处标志信息量的多少会影响驾驶员对标志信息的识读,进而影响到整个路网的通行效率。因此,通过引入节点的指路标志信息量作为惩罚系数...指路标志对人们的出行有着非常良好的指引作用,良好的指路标志设计可提高驾驶人的通行效率。路网中节点处标志信息量的多少会影响驾驶员对标志信息的识读,进而影响到整个路网的通行效率。因此,通过引入节点的指路标志信息量作为惩罚系数,计算得出路段成本,建立起讫点(origin to destination,OD)间指引路径规划模型,结合A算法,遍历整个路网,最后得出OD间的最优指引路径,通过在指引路径上增设指路信息,从而完善OD间指路标志信息的连贯性,更好地引导驾驶员做路径选择,降低路网中的交通压力。并选取甘肃省庆阳市的火车站(O点)到人民医院(D点)的区域进行实际应用与分析。展开更多
In this paper, we present a novel and efficient method for the design of a sharp, two dimensional (2D) wideband, circularly symmetric, FIR filter. First of all, a sharp one dimensional (1D) infinite precision FIR filt...In this paper, we present a novel and efficient method for the design of a sharp, two dimensional (2D) wideband, circularly symmetric, FIR filter. First of all, a sharp one dimensional (1D) infinite precision FIR filter is designed using the Frequency Response Masking (FRM) technique. This filter is converted into a multiplier-less filter by representing it in the Canonic Signed Digit (CSD) space. The design of the FRM filter in the CSD space calls for the use of a discrete optimization technique. To this end, a new optimization approach is proposed using a modified Harmony Search Algorithm (HSA). HSA is modified in such a way that, in every exploitation and exploration phase, the candidate solutions turns out to be integers. The 1D FRM multiplier-less filter, is in turn transformed to the 2D equivalent using the recently proposed multiplier-less transformations namely, T1 and T2. These transformations are successful in generating circular contours even for wideband filters. Since multipliers are the most power consuming elements in a 2D filter, the multiplier-less realization calls for reduced power consumption as well as computation time. Significant reduction in the computational complexity and computation time are the highlights of our proposed design technique. Besides, the proposed discrete optimization using modified HSA can be used to solve optimization problems in other engineering disciplines, where the search space consists of integers.展开更多
The sign algorithm has been extensively investigated for digital echo cancellation application and other adaptive filtering applications. In this paper, we use the blind averaging Sign-regressor (SR) algorithm for ada...The sign algorithm has been extensively investigated for digital echo cancellation application and other adaptive filtering applications. In this paper, we use the blind averaging Sign-regressor (SR) algorithm for adaptive multiuser detection. It is another least mean square (LMS) algorithm and eliminates the need for multiplication in the adaptive algorithm. The new algorithm not only reduces the calculation complexity but also has good convergence character. Simulations indicate that this algorithm can adapt to the changes of the environment quickly and improve the stability of the SIR.展开更多
本文以提高道路交通标志检测的准确率为目标,以解决目前YOLOv5模型在复杂场景下识别准确率较低的问题,拟采用改进的BoTNet结构来提高图像的整体感知能力,并通过对C3GBneckv2结构的优化,提高特征融合的效率。在此基础上,本文提出了一种...本文以提高道路交通标志检测的准确率为目标,以解决目前YOLOv5模型在复杂场景下识别准确率较低的问题,拟采用改进的BoTNet结构来提高图像的整体感知能力,并通过对C3GBneckv2结构的优化,提高特征融合的效率。在此基础上,本文提出了一种改进的MPDIoU损耗函数,使其更好地实现对交通标志的定位与形态的准确识别。实验表明,该方法能够较好地解决多个问题:准确率提升3.9%,召回率提升5.4%,F1得分与平均精确度(mean Average Precision,mAP)提升4.7%和4.6%。通过对各个模块的单独测试,发现每个模块都对系统的总体性能提高起到了非常重要的作用。本文为自动驾驶和智能交通系统中的交通标志自动检测技术提供了强有力的支持,并为视觉识别领域的应用开辟了新的路径。展开更多
针对航空母舰飞行甲板上舰载机弹药保障面临的调度效率不高的问题,提出了一种改进灰狼优化(grey wolf optimizer, GWO)算法。根据甲板上多升降机多运输车的场景特点,建立了由多车场出发、向多目标转运的问题模型。融合遗传算法算子交叉...针对航空母舰飞行甲板上舰载机弹药保障面临的调度效率不高的问题,提出了一种改进灰狼优化(grey wolf optimizer, GWO)算法。根据甲板上多升降机多运输车的场景特点,建立了由多车场出发、向多目标转运的问题模型。融合遗传算法算子交叉思想实现了对灰狼种群初始解的初步优化,并通过直线转运路径中间点定义、整数编码、负整数标志分组等方法实现了对GWO算法求解过程的改进。同时,增加了灰狼个体自由狩猎流程,有效克服了结果陷入局部最优和早熟的问题。最终,通过对场景实例的优化求解,验证了所提方法的有效性和可行性。展开更多
This paper is motivated by the concept of the signed k-domination problem and dedicated to the complexity of the problem on graphs. For any fixed nonnegative integer k, we show that the signed k-domination problem is ...This paper is motivated by the concept of the signed k-domination problem and dedicated to the complexity of the problem on graphs. For any fixed nonnegative integer k, we show that the signed k-domination problem is NP-complete for doubly chordal graphs. For strongly chordal graphs and distance-hereditary graphs, we show that the signed k-domination problem can be solved in polynomial time. We also show that the problem is linear-time solvable for trees, interval graphs, and chordal comparability graphs.展开更多
文摘指路标志对人们的出行有着非常良好的指引作用,良好的指路标志设计可提高驾驶人的通行效率。路网中节点处标志信息量的多少会影响驾驶员对标志信息的识读,进而影响到整个路网的通行效率。因此,通过引入节点的指路标志信息量作为惩罚系数,计算得出路段成本,建立起讫点(origin to destination,OD)间指引路径规划模型,结合A算法,遍历整个路网,最后得出OD间的最优指引路径,通过在指引路径上增设指路信息,从而完善OD间指路标志信息的连贯性,更好地引导驾驶员做路径选择,降低路网中的交通压力。并选取甘肃省庆阳市的火车站(O点)到人民医院(D点)的区域进行实际应用与分析。
文摘In this paper, we present a novel and efficient method for the design of a sharp, two dimensional (2D) wideband, circularly symmetric, FIR filter. First of all, a sharp one dimensional (1D) infinite precision FIR filter is designed using the Frequency Response Masking (FRM) technique. This filter is converted into a multiplier-less filter by representing it in the Canonic Signed Digit (CSD) space. The design of the FRM filter in the CSD space calls for the use of a discrete optimization technique. To this end, a new optimization approach is proposed using a modified Harmony Search Algorithm (HSA). HSA is modified in such a way that, in every exploitation and exploration phase, the candidate solutions turns out to be integers. The 1D FRM multiplier-less filter, is in turn transformed to the 2D equivalent using the recently proposed multiplier-less transformations namely, T1 and T2. These transformations are successful in generating circular contours even for wideband filters. Since multipliers are the most power consuming elements in a 2D filter, the multiplier-less realization calls for reduced power consumption as well as computation time. Significant reduction in the computational complexity and computation time are the highlights of our proposed design technique. Besides, the proposed discrete optimization using modified HSA can be used to solve optimization problems in other engineering disciplines, where the search space consists of integers.
文摘The sign algorithm has been extensively investigated for digital echo cancellation application and other adaptive filtering applications. In this paper, we use the blind averaging Sign-regressor (SR) algorithm for adaptive multiuser detection. It is another least mean square (LMS) algorithm and eliminates the need for multiplication in the adaptive algorithm. The new algorithm not only reduces the calculation complexity but also has good convergence character. Simulations indicate that this algorithm can adapt to the changes of the environment quickly and improve the stability of the SIR.
文摘本文以提高道路交通标志检测的准确率为目标,以解决目前YOLOv5模型在复杂场景下识别准确率较低的问题,拟采用改进的BoTNet结构来提高图像的整体感知能力,并通过对C3GBneckv2结构的优化,提高特征融合的效率。在此基础上,本文提出了一种改进的MPDIoU损耗函数,使其更好地实现对交通标志的定位与形态的准确识别。实验表明,该方法能够较好地解决多个问题:准确率提升3.9%,召回率提升5.4%,F1得分与平均精确度(mean Average Precision,mAP)提升4.7%和4.6%。通过对各个模块的单独测试,发现每个模块都对系统的总体性能提高起到了非常重要的作用。本文为自动驾驶和智能交通系统中的交通标志自动检测技术提供了强有力的支持,并为视觉识别领域的应用开辟了新的路径。
文摘针对航空母舰飞行甲板上舰载机弹药保障面临的调度效率不高的问题,提出了一种改进灰狼优化(grey wolf optimizer, GWO)算法。根据甲板上多升降机多运输车的场景特点,建立了由多车场出发、向多目标转运的问题模型。融合遗传算法算子交叉思想实现了对灰狼种群初始解的初步优化,并通过直线转运路径中间点定义、整数编码、负整数标志分组等方法实现了对GWO算法求解过程的改进。同时,增加了灰狼个体自由狩猎流程,有效克服了结果陷入局部最优和早熟的问题。最终,通过对场景实例的优化求解,验证了所提方法的有效性和可行性。
文摘This paper is motivated by the concept of the signed k-domination problem and dedicated to the complexity of the problem on graphs. For any fixed nonnegative integer k, we show that the signed k-domination problem is NP-complete for doubly chordal graphs. For strongly chordal graphs and distance-hereditary graphs, we show that the signed k-domination problem can be solved in polynomial time. We also show that the problem is linear-time solvable for trees, interval graphs, and chordal comparability graphs.
