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

文章在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.     

利用回归分析拟合Duncan-Chang双曲线E-γ模型的材料参数

介绍了回归分析的基本概念及求解回归系数的方法,并分析了利用回归分析Duncan-Chang双曲线E-γ土力学模型时所建立起的方程组的特点.而基于方程组的这些特点及材料参数的数值限制,提出了在求解之前需先设定其中一个材料参数R_f的值.最后,通过一个例子的分析,总结了回归分析计算结果的特点,并对R_f值之设定作出了说明及探讨.     

决策树分类模型在工程项目评标风险预警中的应用

本文将数据挖掘中的决策树分类方法运用到工程项目评标数据分析,从200多个天津市工程项目招投标打分数据中,随机抽取15个招投标项目中的67个承包商的评标专家打分数据进行分析,得到中标承包商技术和商务评分分界点,进而得到工程项目潜在风险的预警阈值,然后借助因子分析辨识出风险来源并进行预警。     

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

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

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

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

Iterative solutions to coupled Sylvester-transpose matrix equations

This note studies the iterative solutions to the coupled Sylvester-transpose matrix equation with a unique solution. By using the hierarchical identification principle, an iterative algorithm is presented for solving this class of coupled matrix equations. It is proved that the iterative solution consistently converges to the exact solution for any initial values. Meanwhile, sufficient conditions are derived to guarantee that the iterative solutions given by the proposed algorithm converge to the exact solution for any initial matrices. Finally, a numerical example is given to illustrate the efficiency of the proposed approach.     

Path-following interior point algorithms for the Cartesian <Emphasis Type="Italic">P</Emphasis><Subscript>*</Subscript>(κ)-LCP over symmetric cones

In this paper, we establish a theoretical framework of path-following interior point algorithms for the linear complementarity problems over symmetric cones (SCLCP) with the Cartesian P _*(κ)-property, a weaker condition than the monotonicity. Based on the Nesterov-Todd, xy and yx directions employed as commutative search directions for semidefinite programming, we extend the variants of the short-, semilong-, and long-step path-following algorithms for symmetric conic linear programming proposed by Schmieta and Alizadeh to the Cartesian P _*(κ)-SCLCP, and particularly show the global convergence and the iteration complexities of the proposed algorithms. This work was supported by National Natural Science Foundation of China (Grant Nos. 10671010, 70841008)     

基于PLC-200的大功率直流电动机调速系统的设计

以大功率直流电动机调速系统为研究对象,采用西门子PLC-200作为主要控制器件,西门子6RA70作为执行单元,罗升触摸屏作为上位机,同时采用增量式PID控制算法实现大功率直流电动机自动直流调速系统的设计.