用修正的Mann迭代算法求解分裂可行性问题

在Hilbert框架下借助于度量投影修正Mann迭代程序,证明了关于无限族非扩张映射的强收敛定理,并用于求解分裂可行性问题SFP.研究成果在很大程度上推广和改进了现有的结果.     

真三维成像系统结构设计及GR空间模型分析

本文提出了一种基于下投影的真三维立体成像显示系统。讨论了一种基于空间和时间的三维模型体素构造的新方法——体素铸模法,并推导了四维局部状态空间模型Givone-Roessor,此模型利用状态矢量和输入矢量计算和表征体素变量,模型在某时刻计算的各变量只与相邻的体素或前一时刻有关,减少了计算量。系统机械结构简单轻便,成本低,功耗小;视场角大,除天顶点外,在整个x-y平面以上的半球空间均可成立体像;Givone-Roessor模型计算量小,便于微控制器实现,为真三维立体成像显示提供了一种新方法。     

SMT建模仿真研究现状及发展

概述了SMT再流焊工艺过程、所用组装件以及形成的焊点3方面的仿真进展，充分展现了计算机模拟在再流焊研究中的重要作用。     

ZL114铝合金激光--龟弧的复合焊接

设计了一种激光-电弧复合热源焊接ZL114合金的新工艺，并对焊后的试件进行了X光检测、抗拉强度和全相组织等实验。结果表明，该种新工艺对铝合全有良好的适应性和可行性，是焊接领域的一个趋势。     

沙坪二级水电站取消厂房冲沙孔的可行性研究

沙坪二级水电站位于大渡河干流,采用河床式厂房布置.随着可研阶段勘测设计工作的深入,通过论证分析,并经过水工模型试验验证后,决定取消厂房冲沙孔布置.取消厂房冲沙孔后,厂房长度可缩短13.5 m,同时降低了厂房边坡支护难度,减少了工程投资.     

管线穿越建筑物采用预应力钢筒混凝土顶管技术方案可行性分析

预应力钢筒混凝土(PCCP)顶管是在PCCP管道基础上研制的一种新型管材,是压力管线穿越建筑物的理想管材,可直接作为压力管道代替传统的大直径钢筋混凝土顶管内穿压力管道方案。文中结合禹门口提水东扩工程建设实践,对PCCP顶管的可行性进行了分析研究,认为压力输水管线穿越建筑物采用PCCP顶管方案具有很强的针对性和明显优势,包括成本低、施工周期短、技术合理等,通过增加PCCP顶管接头处理措施,还具有很好的安全性能,是一项值得研究推广的新技术。     

深厚覆盖层坝基防渗及风积砂筑坝可行性探讨

以黄河干流上某水利枢纽基本资料为依托,在分析坝基基本地质条件、坝基土体工程性质的基础上,从坝基土体组成及工程特性、水库运行期的淤积效应两方面,对深厚覆盖层坝基防渗进行了探讨。此外,坝区风积沙广泛分布,依据现行水利水电行业规程,结合场区风积沙的特性,对风积沙作为筑坝材料的可行性进行了初步分析。     

A new scaling algorithm for the maximum mean cut problem

We present a new scaling algorithm for the maximum mean cut problem. The mean of a cut is defined by the cut capacity divided by the number of arcs crossing the cut. The algorithm uses an approximate binary search and solves the circulation feasibility problem with relaxed capacity bounds. The maximum mean cut problem has recently been studied as a dual analogue of the minimum mean cycle problem in the framework of the minimum cost flow problem by Ervolina and McCormick. A networkN=(G, lower, upper) with lower and upper arc capacities is said to be -feasible ifN has a feasible circulation when we relax the capacity bounds by ; that is, we use (lower(a)- , upper(a)+) bounds instead of (lower(a), upper(a)) bounds for each arca A. During an approximate binary search we maintain two bounds,LB andUB, such thatN is LB-infeasible andUB-feasible, and we reduce the interval size (LB, UB) by at least one-third at each iteration. For a graph withn vertices, m arcs, and integer capacities bounded byU, the running time of this algorithm is O(mn log(nU). This time bound is better than the time achieved by McCormick and Ervolina under thesimilarity condition (that is,U=O(n^o(1))). Our algorithm can be naturally used for the circulation feasibility problem, and thus provides a new scaling algorithm for the minimum cut problem.Research supported by a grant-in-aid of the Ministry of Education, Science and Culture of Japan.     

大庆HDPE装置改扩建可行性分析

大庆石化总厂规划在“九五”期间将30万t/a乙烯装置扩建到48万t/a,HDPE装置是主要的乙烯使用装置。根据该装置几年来的生产实践及与日本三井油化同类装置生产情况的对比,并经过对主要操作单元的详细计算,对该装置设计能力由14万t/a扩建到24万t/a进行了可行性分析,提出了通过对部分设备进行改造后,产量提高10万t/a是可行的。     

A revised particle swarm optimization based discrete Lagrange multipliers method for nonlinear programming problems

In this paper, a new algorithm for solving constrained nonlinear programming problems is presented. The basis of our proposed algorithm is none other than the necessary and sufficient conditions that one deals within a discrete constrained local optimum in the context of the discrete Lagrange multipliers theory. We adopt a revised particle swarm optimization algorithm and extend it toward solving nonlinear programming problems with continuous decision variables. To measure the merits of our algorithm, we provide numerical experiments for several renowned benchmark problems and compare the outcome against the best results reported in the literature. The empirical assessments demonstrate that our algorithm is efficient and robust.