地方高校研究机构绩效评估指标权重的AHP算法

根据地方高校研究机构的科研特点，探讨了运用AHP理论确定高校研究机构绩效评估指标权重的方法。     

关于广义非线性隐似变分包含问题

文章在Hilbert空间中引入了一类新的涉及（A，η）单调映射的非线性集值隐似变分包含问题，基于与（A，η）单调性相关的广义预解算子技巧，用一种迭代算法研究了解的近似可解性，所得结果改进了许多近期结果．     

Strategic Robust Mixed Model Assembly Line Balancing Based on Scenario Planning

Assembly line balancing involves assigning a series of task elements to uniform sequential stations with certain restrictions. Decision makers often discover that a task assignment which is optimal with respect to a deterministic or stochastic/fuzzy model yields quite poor performance in reality. In real environments, assembly line balancing robustness is a more appropriate decision selection guide. A robust model based on the α worst case scenario is developed to compensate for the drawbacks of traditional robust criteria. A robust genetic algorithm is used to solve the problem. Comprehensive computational experiments to study the effect of the solution procedure show that the model generates more flexible robust solutions. Careful tuning the value of α allows the decision maker to balance robustness and conservativeness of as- sembly line task element assignments.     

稳定核素线性7核素的分布

在坐标单位是氘氚结团的正方形核素图中分析了稳定核素区线性7核分布.稳定区的下、中、上区域中各有7列线性7核,这些核素列的分布具有系统性.跨区域的3类参量S-2H,3S-2H,3S-H的核素列各有3列的始点联系在坐标S轴上,这些点在S轴上排列成(10,0),(12,0),…,(26,0)的9个坐标.通过坐标变换可看出下区的系列7核素列随参量逐层分布.     

New Voronoi Diagram Algorithm of Multiply-Connected Planar Areas in the Selective Laser Melting

This paper studies the practical generation of Voronoi diagrams for multiply-connected planar areas bounded by line segments. The core of the algorithm was calculating Voronoi polygon of every Voronoi object in planar areas independently. The main approach had two steps. The first step was calculating all relevant bisectors of every Voronoi object. The second was combining obtained bisectors into completed Voronoi polygons individually. All code was implemented in Visual C++ platform. The resulting code was extensively tested in real-world data and its practical running time grew only linearly. Three statistical CPU-consumption charts had been drawn with the Voronoi diagrams computation data, and compared with other published codes for computing Voronoi diagrams. The algorithm was applied to compute offsetting of slice area consisting of large-scale line segments for the selective laser melting (SLM) trajectory scanning technology which is a kind of rapid prototyping (RP). The experimental results of offsetting for slice area based on Voronoi diagrams show that the approach is effective and simple for polygon offsetting problems. The method is helpful to those offsetting work and can provide more effective offsetting solution.     

王熙凤与傅彩云的艺术形象比较

作为小说《红楼梦》和《孽海花》中的重要女性形象,王熙凤与傅彩云既有美丽容貌、泼辣性情、爱财贪财及富于心计等诸多相似之处,又不乏人生追求与最终归宿方面的迥然之异,从而映照出她们细微的内心矛盾与情感困顿,彰显出其较为丰满立体的"圆形人物"形象特质,散发出独有的艺术魅力。     

图示法在对外汉语教学中的运用及作用

利用图示法来考察学生对课文的理解程度，训练学生的表达能力以及培养学生的综合交际能力是在汉语学习中很常见也是很实用的教学方法。本文通过对图示法运用的分析，来探讨图示法在对外汉语教学中的作用。     

CBERS-02IRMSS热红外数据及UTAE算法在城市热岛研究中的应用

文中使用城市热异常信息提取算法(urban thermal anomaly extraction,UTAE)提取城市热岛信息.该算法使用不同大小的滑动窗口来探测整幅图像,根据稳健估计的方法设定地表温度高于全部像元以及窗口内像元温度统计均值加标准差的像元为热异常像元,并将滑动窗口的范围设置在3×3至9×9个像元之间,根据像元被记为热岛像元的次数是否为0来区别热岛区与非热岛区,在热岛区域内根据次数的多少来决定热岛强度,具有动态阈值的特点和无偏特性.研究结果表明,在城市热岛范围的提取上,2004年2月13日长沙市热岛面积在27.21—33.98km2之间;在城市热岛强度和尺度效应分析上,宏观尺度的研究应选用较大的窗口来体现城—郊热岛关系以及热岛发展的总体趋势,而小窗口在微观分析城区内热岛的具体分布、与下垫面的关系以及驱动因子方面较有优势.最后,对UTAE算法在中巴地球资源卫星后继星数据上的应用做出了展望.     

基于层次性的交通网络资源优化配置方法

利用交通网络层次性这一基本特征,研究随机交通配流算法与交通网络资源优化配置方法。在分析算法的设计基础上,定义层次因子,并提出利用复杂网络拓扑特征或交通关联度来确定交通网络的层次数目和层次因子,在Dial算法的基础上利用层次性设计层次随机交通分配算法(HSTAA);通过算例验证与分析HSTAA算法,提出基于层次性的交通网络资源的优化配置方法。研究结果表明:由HSTAA算法得到的交通网络总阻抗在层次因子的某一合理取值范围内小于Dial算法所得的总阻抗,且交通网络的总阻抗随较高层次路段层次的提高而减小,但交通网络的尾气排放总量却随较高层次路段层次的提高而增大,但它始终小于由Dial算法所得到的结果;将网络层次状况控制在合理范围内就能有效地调节和优化交通网络资源配置。     

Construction of protograph LDPC codes with circular generator matrices

The application of protograph low density parity check(LDPC) codes involves the encoding complexity problem.Since the generator matrices are dense,and if the positions of "1" s are irregularity,the encoder needs to store every "1" of the generator matrices by using huge chip area.In order to solve this problem,we need to design the protograph LDPC codes with circular generator matrices.A theorem concerning the circulating property of generator matrices of nonsingular protograph LDPC codes is proposed.The circulating property of generator matrix of nonsingular protograph LDPC codes can be obtained from the corresponding quasi-cyclic parity check matrix.This paper gives a scheme of constructing protograph LDPC codes with circulating generator matrices,and it reveals that the fast encoding algorithm of protograph LDPC codes has lower encoding complexity under the condition of the proposed theorem.Simulation results in additive white Gaussian noise(AWGN) channels show that the bit error rate(BER) performance of the designed codes based on the proposed theorem is much better than that of GB20600 LDPC codes and Tanner LDPC codes.