A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing

We address in this paper the problem of finding an optimal strategy for dealing with bottleneck machines and bottleneck parts in the cell formation process in group technology. Three types of economic decisions are considered: subcontracting, machine duplication and intercell moves. The problem is formulated as a minimum weighted node covering problem in a hypergraph, and we show that it can be solved in polynomial time by finding a maximum weighted stable set in a bipartite graph. We extend this result to cellular manufacturing systems in which the sequence of operations of each part is known in advance.     

High Speed Cutting Inconel 718 with Coated Carbide and Ceramic Inserts

High speed machining (HSM) technology is one of important aspects of advanced manufacturing technology. Nickel-based superalloys have been widely used in the aircraft and nuclear industry due to their exceptional thermal resistance and the ability to retain mechanical properties at elevated temperatures of service environment over 700 ℃. However, they are classified as difficult-to-cut materials due to their high shear strength, work hardening tendency, highly abrasive carbide particles in the microstructur...     

Simulation and Experimental Analysis of Super High-Speed Grinding of Ductile Material

This study aims to reduce the work-affected layer of the machined surface by carrying out the grinding at the speed over static pr o pagation speed of plastic wave of ductile materials and also aims to clarify suc h super high-speed machining mechanism.This paper reports on the result obtain ed through the molecular dynamics simulations and experiments on the super-spee d grinding below and beyond static propagation speed of aluminum.From the simul ation results,it is verified that the plastic deformation ...     

Refraction of light in media

The roles of the magnetic field and electric field of the light are investigated when the light is refracted in the medium. The model of the electron cloud conductor is presented. Electron cloud in a molecule is treated as a conductor and the Faraday’s Law is applied to this conductor that is in the alternating magnetic field of the light. dB _M/dt of the light gives rise to an alternating induced current on the electron cloud conductor, and the light exchanges energy, i.e. the refractive energy, with the electron cloud conductor. Formulas of refractive index, which is the ratio of light speed in vacuum to that in the medium, are derived with this model. These formulas are tested with several mediums and Langevin’s diamagnetic susceptibility of helium gas, and the results are in good agreement with the measured data. The anisotropy and the nonlinearity of the refractive index are explained with the theory described in this work. Supported by Beijing Science and Technology New Star Program (Grant No. 952870400), the Beijing Municipal Commission of Education and the Excellent Young Teachers Program of Ministry of Education of China     

基于离差最大化原理的灰色综合评判方法及其应用

在灰色综合隶属度评价方法基础上,按照离差最大化原理,提出了一种品种区域试验的新的确定权重的方法.应用这种方法,对2002-2003年度国家黄淮南片小麦冬水组区域试验进行了分析.结果表明,这种分析方法克服了通常专家调查法和层次分析法主观随意性强的缺点,因而其分析结果更加客观、可靠.大面积生产实践也表明该方法具有一定可行性和有效性.     

ON THE OPTIIMAL REACTIONS ASSEMBLAGE OF COMPLEX REACTION SYSTEMS

In this paper, the author analyzes distinguishing features of complex reaction systems and single reversible reaction, and optimizes complex reaction systems starting from set theory.The method of constructing the optimal reactions assemblage and calculating the potential maximum equilibrium yield (PMEY) of objective products is proposed here. This paper points out clearly that the euqilibrium yield of objective products calculated by means of conventional method is the global equilibrium yield (GEY).It is not the thermodynamic constraint, and could be exceeded by observed yield of objective products; only PMEY is the thermodynamic constraint. It gives information on potential and possible optimal yield and thereby improving production. This paper also points out the way in which the real complex reaction system approached the optimal reactions assemblage. The new concept of PMEY and optimal reaction assemblage proposed by this Paper is universally applicable for the important complex reaction systems, such as the pyrolysis of alkane to produce ethylene, steam reforming of methane to produce syngas, production of formaldehyde from methanol, epoxidation of ethylene to produce ethylene oxide, hydrogenation of benzene to produce cyclohexane.     

On a generalization of Pólya’s theorem

We consider generalizations of Pólya’s theorem to the case of entire functions taking algebraic values at natural or integer points.     

Structure of minimizers in linear-quadratic Bolza problems of optimal control

In this paper, we study intersections of extremals in a linear-quadratic Bolza problem of optimal control. The structure of the inter-sections is described. We show that this structure implies the semipositive definiteness of the quadratic cost functional. In addition, we derive necessary and sufficient conditions for the existence of minimizers.     

火工品可靠性试验数据的综合分析方法

升降法试验数据和固定刺激量下的成败型试验数据,是两种最常见的火工品可靠性试验数据．我们应用Markov链,研究了升降法试验数据下,感度分布参数的极大似然估计的特性．在此基础上,应用Bootstrap方法和Bayes方法,给出了综合分析两种试验数据的方法．最后,将该方法应用于520底火的可靠性鉴定,得出了有益的结论．     

On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function

We study the maximum stable set problem. For a given graph, we establish several transformations among feasible solutions of different formulations of Lovász's theta function. We propose reductions from feasible solutions corresponding to a graph to those corresponding to its induced subgraphs. We develop an efficient, polynomial-time algorithm to extract a maximum stable set in a perfect graph using the theta function. Our algorithm iteratively transforms an approximate solution of the semidefinite formulation of the theta function into an approximate solution of another formulation, which is then used to identify a vertex that belongs to a maximum stable set. The subgraph induced by that vertex and its neighbors is removed and the same procedure is repeated on successively smaller graphs. We establish that solving the theta problem up to an adaptively chosen, fairly rough accuracy suffices in order for the algorithm to work properly. Furthermore, our algorithm successfully employs a warm-start strategy to recompute the theta function on smaller subgraphs. Computational results demonstrate that our algorithm can efficiently extract maximum stable sets in comparable time it takes to solve the theta problem on the original graph to optimality. This work was supported in part by NSF through CAREER Grant DMI-0237415. Part of this work was performed while the first author was at the Department of Applied Mathematics and Statisticsat Stony Brook University, Stony Brook, NY, USA.