基于多元智能理论的网络学习资源设计

阐述了多元智能理论,分析了多元智能理论对网络学习资源设计的启示,并通过案例对多元智能理论指导下的网络学习资源设计进行了研究．     

求解多项式重零点的并行迭代方法

建立了一种至少4阶收敛的求解多项式重零点的并行迭代方法，分析并证明了相应的收敛性定理。     

A NEW DESCRIPA NEW DESCRIPTOR OF AMINO ACIDS BASED ON THE THREEDIMENSIONAL VECTOR OF ATOMIC INTERACTION FIELD

QUANTITATIVE STRUCTURE ACTIVITY RELATIONSHIP (QSAR) IS A VERY IMPORTANT TOPIC FOR MANY SCIENTIFIC FIELDS AND CAN BE TERMED AS QUANTITATIVE SEQUENCE ACTIVITY MODELS(QSAM)[1] WHEN REFERRED TO THE RESEARCH ON RELATION- SHIPS BETWEEN STRUCTURES AND ACTIVITIES OF BIOLOGICAL MOLECULES, SUCH AS PROTEINS, AND NUCLEIC ACIDS. HOW- EVER, IT IS VERY DIFFICULT TO ESTABLISH A QSAM MODEL,…     

生料配料系统的回归-校正控制方法研究

针对通常生料配料系统所出现的问题,提出了对生料配料过程进行多目标综合控制的基本思想,在这一基础上,给出了控制生料饱和参数、生料成分的系统控制结构,并着重论述了饱和系数回归分析与回归控制及成分校正控制的原理、模型与方法。     

欧氏空间上的随机覆盖及其应用

运用Borel—Cantelli引理，改进并推广了Jean-Pierre Kahane在单位圆周上关于随机覆盖的结果，得到了在高维欧氏空间上关于随机覆盖的类似结果。且运用这些结果研究了多指标复Fourier-Redemacher级数与某些函数空间的关系，得到了多指标复Fourier—Redemacher级数几乎处处属于L^∞及几乎处处属于C的等价性。     

二硅烯及其相关分子的量子化学计算研究

使用密度泛函法、MP2法和考虑组态相关作用的QCISD和CCD法,对重主族双键化合物二硅烯、二锗烯等进行了优化构型的量子化学计算.计算结果表明,H2X=XH2(X=Si,Ge,Sn,Pb)型分子均为非平面反式弯曲几何构型,亚甲基XH2的基态为单线态.利用计算的"单线态-三线态"能量差ΔEST和双键键能Eσ π分析并解释了非平面反式弯曲几何构型的形成条件和标题物中双键的相对强度.     

用遗传算法解决一类模糊流水车间调度问题

对同时考虑模糊加工时间和模糊交货期的模糊流水车间调度问题进行了研究 ,模糊加工时间用三角模糊数来表示 ,模糊交货期用梯形模糊数来表示。应用遗传算法搜索最优排序 ,在适应度函数处理中引入模糊数处理方法 ,以平均满意度最大作为优化目标。最后给出了实验结果和结论     

LOGISTICS SCHEDULING： ANALYSIS OFTWO-STAGE PROBLEMS

This paper studies the coordination effects between stages for scheduling problems where decision-making is a two-stage process. Two stages are considered as one system. The system can be a supply chain that links two stages, one stage representing a manufacturer; and the other, a distributor It also can represent a single manufacturer, while each stage represents a different department responsible for a part of operations. A problem that jointly considers both stages in order to achieve ideal overall system performance is defined as a system problem. In practice, at times, it might not be feasible for the two stages to make coordinated decisions due to (i) the lack of channels that allow decision makers at the two stages to cooperate, and/or (ii) the optimal solution to the system problem is too difficult (or costly) to achieve.Two practical approaches are applied to solve a variant of two-stage logistic scheduling problems. The Forward Approach is defined as a solution procedure by which the first sta     

输出/输入比值优势与DEA有效

进一步讨论了多目标规划模型 ( vp)中的 Pareto有效与 DEA有效的关系 ,得到两个重要结论 ,藉此无须求解 DEA模型就能判断某些 Pareto有效 DMU的 DEA有效性。     

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