基于梯度直方图的交叉点检测方法

提出基于梯度直方图的交叉点检测方法:统计像素点邻域梯度信息生成特征描述子,通过判定准则筛选候选交叉点,基于欧氏距离对候选交叉点进行聚类后,利用灰度加权法定位图像交叉点坐标.仿真实验验证了算法的正确性与可行性,结果表明:该方法适用于交叉角为65°～90°范围内的交叉点检测,定位精度优于0.6像素,检测率大于90％;该方法...     

基于规则的域间路由系统异常检测

随着Internet的爆炸性增长,域间路由系统变得越来越复杂并难以控制,许多与域间路由安全相关的事件广泛引起了人们的关注。提出一个基于规则的域间路由监测框架,其中的规则可分为常规异常检测规则和特殊异常检测规则,它们能有效用于检测异常路由和可能的攻击行为,这两种规则的不同在于特殊异常检测规则是由大量路由得到的Internet模型来定义。研究了Internet层次模型与ISP商业关系模型的构造,基于这个框架实现了一个原型系统———ISP-Health,最后给出了检测能力结果。     

汉语语音识别中的一种音节分割方法

汉语语音识别研究中,识别单元的选取是很重要的。随着大词汇量连续语音识别研究的发展,越来越多汉语语音识别研究中选取次音节单位作为识别单元。结合汉语发音声学特性,提出了音节的重叠音素分割策略,并利用小波方法实现了音节的分割,实验证明该方法分割准确可靠。     

任意分散布阵通信干扰机空间功率合成方法

针对小型化通信干扰机功率不足的问题,提出了一种任意分散布阵通信干扰机空间功率合成方法,采用无线的方式控制各单元的发射时间和发射相位,在不破坏单个干扰机结构完整性和独立性的前提下进行空间功率合成。分析了相位同步误差、定位误差和导向误差对功率合成效率的影响,给出了合成效率为0.8时系统对相位同步精度、定位精度和导向精度的要求。结果表明,随着各项误差的增加,合成效率不断减小并趋于下限;干扰机群分布半径越大,合成效率对导向误差越敏感。     

自适应逆控制FXLMS算法有源噪声控制仿真研究

前馈有源噪声控制方法可在较宽的频带有效,使之获得了广泛的应用.在前馈有源噪声控制中,直接使用传统的FXLMS算法时,由于次级通道传递函数往往是非最小相位系统,导致系统的性能下降.文中提出一种基于非最小相位系统逆控制的自适应前馈有源噪声控制FXLMS算法,用带宽随机噪声信号和实测风机通风管道噪声信号进行仿真实验研究,结果表明,较传统的FXLMS算法有明显的改进.     

喷水推进装置及其在舰艇上的应用

船舶喷水推进装置具有推进效率高、噪音小、操作性能好以及适合浅水航行等特点,其军事价值将越来越受到世界各国海军的重视.分析了喷水推进装置的优、缺点,简要介绍了其基本原理和结构,并总结了其在潜艇和水面舰艇上的应用,对其今后的应用与发展趋势作了简要分析.     

加强重点学科建设促进高校可持续发展

学科建设是高等教育工作的核心任务,针对高校重点学科建设目标、学术带头人的培养及资源配备等,实现高等教育可持续发展.本文从对如何加强重点学科建设,推动教育改革,提高办学质量水平进行探讨.     

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     

Price and capacity decisions of service systems with boundedly rational customers

We consider price and capacity decisions for a profit‐maximizing service provider in a single server queueing system, in which customers are boundedly rational and decide whether to join the service according to a multinomial logit model. We find two potential price‐capacity pair solutions for the first‐order condition of the profit‐maximizing problem. Profit is maximized at the solution with a larger capacity, but minimized at the smaller one. We then consider a dynamically adjusting capacity system to mimic a real‐life situation and find that the maximum can be reached only when the initial service rate is larger than a certain threshold; otherwise, the system capacity and demand shrink to zero. We also find that a higher level of customers’ bounded rationality does not necessarily benefit a firm, nor does it necessarily allow service to be sustained. We extend our analysis to a setting in which customers’ bounded rationality level is related to historical demand and find that such a setting makes service easier to sustain. Finally we find that bounded rationality always harms social welfare.