地方高校研究机构绩效评估指标权重的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.     

四维时空中场方程表述形式的推导方法

场方程的推导在量子场论中占有很重要的地位。鉴于在大多数理论物理教程中都是仅仅给出场方程的形式,而鲜有得出场方程的具体推导过程。从物质场的作用量S(其中拉格朗日函数具有对称性)和四维平直时空、四维弯曲时空的度规出发,应用变分原理及数学知识,分别给出了四维平直时空和四维弯曲时空中物质场场方程的具体推导过程,供广大理论物理学习者和爱好者参考。     

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.     

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

利用交通网络层次性这一基本特征,研究随机交通配流算法与交通网络资源优化配置方法。在分析算法的设计基础上,定义层次因子,并提出利用复杂网络拓扑特征或交通关联度来确定交通网络的层次数目和层次因子,在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.     

自旋相干态法解Dicke模型的基态解析解

文章采用了自旋相干态的三种表达方式,利用了变分原理,求解了Dicke模型的相变点和基态能量解析表达式,这三种方法所得的结论与Holstein-Primakoff(HP)变换方法所得结论完全一致,而这三种方法有一定的普适性和优越性.     

大学考试时间表问题的混合遗传算法求解

考试时间表问题是一类典型的组合优化问题,也是NP难问题。分析了大学考试时间表编排的特点,给出了一种解决考试时间冲突的自动生成考试时间表的可行时段-查找算法。为进一步解决时间间隔问题,将可行时段-查找算法嵌入到遗传算法中形成混合遗传算法。实验结果表明,本文提出的混合遗传算法能快速、有效的解决大学考试时间表问题。     

基于单粒子的量子投票方案

提出了一个量子投票方案。投票者利用局域幺正操作进行投票，计票员可根据测量的结果计算出投票的结果。通过对方案的正确性和秘密性进行分析，表明该方案是安全的。而且，与采用Ⅳ维量子纠缠态的量子投票方案相比，该方案只涉及二维量子态，测量较为简单，这在现有的技术条件下是更易于实现的。