基于前四阶矩的非高斯响应概率密度函数逼近方法研究

基于响应前四阶统计矩研究了在偏态系数和峰度系数取值范围不同时Gram-Charlier渐进展式、Edgeworth渐进展式和Fleishman多项式3种非高斯概率密度函数,指出3种方法的适用条件。结果表明与Gram-Charlier和Edgeworth渐进展式相比,Fleishman多项式对峰度系数的变化不敏感,该方法只有在峰度系数与高斯分布一致时拟合的结果才有可能是合理的;Gram-Charlier和Edgeworth渐进展式在中、高度偏态情况下易出现负的概率,二者在低等偏态情况下拟合的结果是比较合理的。两算例表明在高等偏态、尖峰和对称、扁平分布情况下,Gram-Charlier和Edgeworth渐进展式拟合结果优于Fleishman多项式,但Gram-Charlier渐进展式易于出现负的概率,在应用时应引起注意。     

具有全局收敛性的盲均衡算法

为了解决传统的自适应均衡技术需发送训练序列的问题,采用盲均衡技术,利用接收信号本身的特征使均衡器收敛。提出了一种新的盲均衡算法(C&D算法),该算法将CRIMNO算法和判决引导(Decision Directed,DD)算法相结合,利用信号序列间的互不相关特性,从而使其具有全局收敛性能。实验结果表明:与CRIMNO算法相比,在相同的信噪比下,该算法具有收敛快速、运算量少和残留误差小的特点。     

两类白化权函数的比较

分别根据三角形白化权函数和梯形白化权函数对长江流域各站点的水污染现状进行灰色评价,对评价结果进行比较,发现三角形白化权函数和梯形白化权函数的使用在灰色评价中利用最大隶属度原理得到的结果是一样的,这与灰色理论及模糊数学理论是一致的。若要精确到求出评价值进行排序,结果不完全相同,但差别不大。与其他方法比较利用梯形白化权函数计算尽管复杂但效果更好些。     

谈高校校报思想政治教育的作用

高校校报既是高校思想宣传工作的重要阵地,又是高校进行思想政治教育的重要平台。深入分析、挖掘校报的思想政治教育作用,对校报提高办报质量,有针对性地为高校发展提供舆论支持具有深远意义。只有充分发挥高校校报在思想政治工作中的作用,才能稳固校园主流媒体的地位。     

思想政治教育对高校突发事件的防范功能研究

为维持高校和社会的和谐稳定,必须防范高校突发事件的发生。思想政治教育对高校突发事件有着特殊而重大的防范功能,它不但能为防范突发事件提供可靠的思想保证和精神动力,而且其本身就是防范突发事件的重要手段。思想政治教育在思想引导、心理干预、利益协调、情绪宣泄、预防文化教育和预警等方面都具有对高校突发事件的防范功能。     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Single‐machine scheduling with deadlines to minimize the total weighted late work

We consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable.     

目标宽频带RCS的快速算法研究

目标宽带RCS预估算法一直是计算电磁学的一个研究热点,本文分别研究了渐近波形估计技术（AWE）与最佳一致逼近技术在宽频带RCS预估领域内的应用。首先,介绍了传统矩量法计算RCS的原理,并分析了两种快速算法的计算过程。然后,采用这两种技术,分别计算了简易飞机模型的RCS值,并对这两种方法进行比较。计算结果表明相比传统的矩量法,这两种方法在不影响精度的前提下大大提高了计算效率。同时,相比渐近波形估计技术,最佳一致逼近技术在节省内存,节约时间方面更具优势。最后,采用最佳一致逼近理论,结合电磁计算软件,实现较大尺寸目标的宽频带RCS的计算。     

A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity

In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017     

基于连分式的简化拉普拉斯函数递推算法

根据简化拉普拉斯函数级数展开和将级数展开为连分式的方法,将简化拉普拉斯函数化为连分式形式。推导出基于连分式的简化拉普拉斯函数渐近分数的递推计算公式,讨论了递推计算中误差控制的方法。计算结果表明,该算法简单实用,在炮兵及防空兵火力毁伤概率计算中有应用价值。