METHOD FOR SUPPRESSING CUTTING CHATTER IN NUMERICAL CONTROL MACHINE TOOLS

A new method for suppressing cutting chatter is studied by adjusting servo parameters of the numerical control （NC） machine tool and controlling the limited cutting width. A model of the cutting system of the NC machine tool is established. It includes the mechanical system, the servo system and the cutting chatter system. Interactions between every two systems are shown in the model. The cutting system stability is simulated and relation curves between the limited cutting width and servo system parameters are described in the experiment. Simulation and experimental results show that there is a mapping relation between the limited cutting width and servo parameters of the NC machine tool, and the method is applicable and credible to suppress chatter.

Application Research of Oil Development Costs in Reservoir Management

Based on oil development costs, the application research in the technical and economic limits calculation of oil development and the production optimal allocation to all the oilfields, was finished. At the same time, according to the regression of real development costs, a new method for oil well economic water cut and oil well economic rate are set up, the production optimal allocation is developed with satisfactory results.

An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance

We consider the design of semidefinite programming （SDP） based approximation algorithm for the problem Max Hypergraph Cut with Limited Unbalance （MHC-LU）： Find a partition of the vertices of a weighted hypergraph H = （V, E） into two subsets V1, V2 with ｜｜V2｜ - ｜1/1 ｜｜ ≤ u for some given u and maximizing the total weight of the edges meeting both V1 and V2. The problem MHC-LU generalizes several other combinatorial optimization problems including Max Cut, Max Cut with Limited Unbalance （MC-LU）, Max Set Splitting, Max Ek-Set Splitting and Max Hypergraph Bisection. By generalizing several earlier ideas, we present an SDP randomized approximation algorithm for MHC-LU with guaranteed worst-case performance ratios for various unbalance parameters τ = u/｜V｜. We also give the worst-case performance ratio of the SDP-algorithm for approximating MHC-LU regardless of the value of τ. Our strengthened SDP relaxation and rounding method improve a result of Ageev and Sviridenko （2000） on Max Hypergraph Bisection （MHC-LU with u = 0）, and results of Andersson and Engebretsen （1999）, Gaur and Krishnamurti （2001） and Zhang et al. （2004） on Max Set Splitting （MHC-LU with u = ｜V｜）. Furthermore, our new formula for the performance ratio by a tighter analysis compared with that in Galbiati and Maffioli （2007） is responsible for the improvement of a result of Galbiati and Maffioli （2007） on MC-LU for some range of τ.