柔性制造系统的托盘优化

本文讨论Job-shop型柔性制造系统的托盘优化问题,给出了求最小托盘数的算法,把托 盘优化问题化成了求解线性整数规划问题.     

Integrating integer programming and probabilistic deduction graphs for probabilistic reasoning

Optimal solutions of several variants of the probabilistic reasoning problem were found by a new technique that integrates integer programming and probabilistic deduction graphs (PDG). PDGs are extended from deduction graphs of the and-type via normal deduction graphs. The foregoing variants to be solved can involve multiple hypotheses and multiple evidences where the former is given and the latter is unknown and being found or vice versa. The relationship among these hypotheses and evidences with possible intermediaries is represented by a causal graph. The proposed method can handle a large causal graph of any type and find an optimal solution by invoking a linear integer programming package. In addition, formulating the reasoning problem to fit integer programming takes a polynomial time. H.-L. Li was visiting the Department of Computer Sciences, University of North Texas in 1988–1989. He is with the Institute of Information Management, National Chiao Tung University, Hsinchu, Taiwan, R.O.C.     

关于正整数的k次根的整部

对于给定的自然数m，令口α（m)为m的是的次根的整部。即：α(m)=[m^1/k]。研究了α(m)的渐近性质，并给出了一个有趣的渐近公式。     

整体毡纤维体积分数对CVD增密的影响

将3组不同纤维体积分数的整体毡采用等温CVD进行沉积热解炭增密,结合CVD沉积过程中整体毡内气体传质数学模型,研究了整体毡的纤维体积分数对CVD增密过程的影响,研究结果表明:纤维体积低的整体毡沉积时增重率高;纤维体积分数高的整体毡容易获得较高密度的C/C复合材料;纤维体积分数超过35％的整体毡经过300 h的化学气相沉积,坯体的体积密度能达到1.52 g/cm~3。     

On modeling the design of cellular manufacturing systems

A new optimization model is discussed for the design of cellular manufacturing systems. It is based on an integer programming formulation that updates some other models by eliminating redundant machine assignment and cost coefficients dependent on cell configuration. To reduce computational burdens, a simplified integer programming model and a decomposition algorithm are proposed. Several computer solutions were performed to evaluate the performance of the new model. The computational results are discussed.     

An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks

Formulating the minimum concave cost capacitated network flow problem as an integer concave minimization problem, we establish finite branch and bound algorithms, in which the branching operation is the so–called integral rectangular partition and the bounding procedure is performed by the classical minimum linear cost flow problem on subnetworks. For the special case that the flow cost function is concave on a fixed number of arcs and linear on the others, an upper bound of the running time is given. Received: 19 July 1996 / Accepted: 8 July 1997     

数字水印攻击及对策分析

数字水印技术作为数字媒体版权保护的重要手段越来越引起人们的重视。文章讨论了数字水印的概念、特征,重点介绍了数字水印的鲁棒性及影响数字水印鲁棒性的因素,总结和分析了数字水印主要攻击方式并提出相应的应对措施。     

Semantic analysis in XTRA,an English — Chinese machine translation system

This paper concerns the resolution of lexical ambiguity in a machine translation environment. We describe the integration of principles of selection restrictions. Preference Semantics, and intelligent relaxation of constraints in handling lexical ambiguity. The approach differs from many previous MT systems in that it is more powerful than brute force systems, while more realistic than systems that assume a large degree of coded encyclopedia information for full understanding.     

小波域最小嵌入失真函数设计及其在隐写中的应用

为了提高隐写方案的安全性,提出一种基于最小嵌入失真原理和网格码的图像隐写算法。首先在离散小波域结合人眼视觉特性和整数提升小波变换设计了失真测度函数,主要考虑了亮度、频率和纹理掩蔽因子对载体失真的影响。然后结合网格码设计了隐写算法,将嵌入信息对载体的修改最小化并且集中在人眼不敏感区域。实验结果显示,方案具有良好的视觉不可见性,且能抵抗空域、小波域等隐写分析的攻击,安全容量达到0.4 bits/pixel。