凸六边形的相对长边与相对短边

就Doliwaka和Lassak提出的凸n－边形的相对边问题，讨论n＝6的情形，将凸六边形嵌入到平等四边形内（边可重叠），利用对应边的边长比的关系可证任意凸六边形均有相对长边，有平行对边的凸六边形必有相对短边。     

磷酸钙催化剂上二异丁基乙缩醛裂解法合成乙烯基异丁醚的研究

研究了在磷酸钙催化剂上二异丁基乙缩醛裂解制乙烯基异丁醚反应的活性和选择性，其中较好的催化剂是在500度焙烧的Ca3(PO4)2(1)。考察了工艺条件对反应结果的影响，表明在反应温度约300度，缩醛的LHSV＝1．0h^-1时得到最佳反应结果：转化率约98．6％，选择性接近100％，用TPD法测定了催化剂表面的酸度和碱度，并与活性和选择性进行了关联。     

关于凸函数和凹函数的幂平均不等式的一个注记

文 [1]讨论了凸函数和凹函数的幂平均不等式 ,在更弱的条件下 ,证明了文 [1]中的不等式     

对模糊随机向量凸集的定义及探讨

在模糊随机变量的基础上引入了模糊随机向量凸集的概念,给出了几个模糊随机凸集的例子.     

小波多尺度分解及其在SAR图象目标检测中的应用

合成孔径雷达图象的目标检测是最重要的任务之一.目前用于目标检测的现有方法速度较慢、准确率较低、精度较差.作者提出小波分解的方法用于目标检测.同尺度目标检测采用二维离散二进小波分解方法,提高检测速度.不同尺度的目标检测采用多尺度二维离散小波分解方法,提高检测准确率.图象匹配采用灰度归一化的灰度相关匹配方法,提高匹配精度.实验证明,采用该法进行目标检测能获得较好的效果.     

A ROBUST DECOMPOSITION OF LINEAR PROGRAMMING USING A GOAL-PARTITIONING METHOD

The Dantzig/Wolfe linear programming decomposition algorithm has had important economicinterpretations as well as a widespread impact on solving large scale linear programming problem.Inthis paper we consider a similar underlying structure,where however there is only one couplinginequality or equation.With this simplification,we demonstrate how to achieve an equitable partitionof the overall coupling resource to individual subproblem constraints through a simple iterationprocedure which appears to be very efficient.     

拥挤型网络的路流组合及模型求解的搜索法

证明了一个路流组合定理并由此而给出了一个求解网络选址两级模型的算法，讨论了网络的Ｂｒａｅｓｓ性及其在网络规划中的应用前景。     

FROM MANUFACTURING SCHEDULING TO SUPPLY CHAIN COORDINATION：THE CONTROL OF COMPLEXITY AND UNCERTAINTY

With time-based competition and rapid technology advancements, effective manufacturingscheduling and supply chain coordination are critical to quickly respond to changing marketconditions. These problems, however, are difficult in view of inherent complexity and variousuncertainties involved. Based on a series of results by the authors, decomposition and coordination byusing Lagrangian relaxation is identified in this paper as an effective way to control complexity anduncertainty.A manufacturing scheduling problem is first formulated within the job shop context withuncertain order arrivals, processing times, due dates, and part priorities as a separable optimizationproblem. A solution methodology that combines Lagrangian relaxation, stochastic dynamicprogramming, and heuristics is developed. Method improvements to effectively solve large problemsare also highlighted. To extend manufacturing scheduling within a factory to coordinate autonomicmembers across chains of suppliers, a decentralized supply chai     

广义De Bruijn图分解问题的一些结果

广义DeBruijn图是最近提出的一种具有良好性质的网络拓扑结构，文中对这类图的分解问题作了初步的分析，构造了一类基本模块，并得出了一些关于模块效率的数值结果。     

关于凸模糊子集的研究

给出了强凸模糊子集和严格凸模糊子集的定义．研究了强凸模糊子集与凸模糊子集的关系，及严格凸模糊子集与凸模糊子集的关系．将Yang的一些结论推广到凸模糊子集上．