图书馆读者细分模型的分析与建立

由于单一的读者属性细分方式很难满足个性化服务的需要,提出了4种不同的细分方式,利用系统聚类算法建立了图书馆读者细分模型,并通过大量图书馆流通数据的训练,验证了模型的有效性和实用性.     

论实践教学在应用型经济人才培养中的作用

经济学专业为我国培养了大批高素质人才,但是绝大部分高校重视理论型人才的培养而忽视应用型人才的培养,使得人才的培养与实际需要相脱离。为此,必须对我国经济学培养目标、课程体系和教学方法进行改革,实行通识教育和专识教育,开展实践教学和实验教学,以培养大量适应社会需要的经济类人才。     

危险货物零担运输多目标配装问题及遗传算法求解

零担货物具有运量零星、批数较多的特点,而危险货物又有混装的限制,所以危险货物零担运输配装问题一直是铁路部门复杂而急需解决的实际问题.在给出其数学模型的基础上,先对待装货物进行预处理,然后运用遗传算法对问题进行了求解,最后通过实例证明该方法的可行性和有效性.     

基于层次模型数据库的算法设计

层次模型是DBMS所支持的三大数据模型之一，本文述了如何利用关系模型表达层次模型的一种方法，具体给出了插入和修改的算法，此算法简便，可行，有效，不需对数据库进行规范化处理，此算法已在Delphi 3.0中实现，效果显著，具有友好，快捷的操作界面。     

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

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算法所得到的结果;将网络层次状况控制在合理范围内就能有效地调节和优化交通网络资源配置。