in this study, the application of gray relational analysis (gra) and taguchi method in multi-criteria process parameters selection of turning operation has been investigated. the process responses under study are material removal rate (mrr) and surface roughness (sr); in turn, the input parameters include cutting speed, feed rate, depth of cut and nose radius of the cutting tool. the proposed a...

The structure of Galton-Watson trees conditioned to be of a given size is wellunderstood. We provide yet another embedding theorem that permits us to obtain asymptotic probabilities of events that are determined by what happens near the root of these trees. As an example, we derive the probability that a Galton-Watson tree is cut when each node is independently removed with probability p, where...

We present an interface for quickly and easily modeling 3D trees from freehand sketch. The system generates a 3D geometry from 2D sketch on the basis of our observation that trees spread their branches uniformly. Our system also supports several interfaces for editing the 3D tree by drawing additional strokes. These editing operations include adding a branch, cutting a branch and erasing a bran...

In this paper we describe a cutting plane algorithm for the Steiner tree packing problem. We use our algorithm to solve some switchbox routing problems of VLSI-design and report on our computational experience. This includes a brief discussion of separation algorithms, a new LP-based primal heuristic and implementation details. The paper is based on the polyhedral theory for the Steiner tree pa...

This vignette shows the use of HCsnip package for extracting clusters from the Hierarchical Clustering (HC) tree in semi-supervised way. Rather than cutting the HC tree at a fixed highest (as existing methods do), it snips the tree at variable heights to extract hidden clusters. Cluster extraction process uses both the data matrix from which HC tree is derived and the available follow-up inform...

Given a tree with nonnegative edge cost and nonnegative vertex weight, and a number k ≥ 0, we consider the following four cut problems: cutting vertices of weight at most or at least k from the tree by deleting some edges such that the remaining part of the graph is still a tree and the total cost of the edges being deleted is minimized or maximized. The MinMstCut problem (cut vertices of weigh...

The 2D string approaches provide a natural way of constructing iconic indexing for images. The 2D C-string representation with an efficient cutting mechanism is more characteristic of spatial knowledge and efficient in the representation of iconic images. However, the computation of object ranks in a 2D C-string might make the inference of spatial reasoning somewhat complicated. This shortcomin...

To construct a multicast tree is the basis of multicast data transmission. The prime problem concerning the construction of a shared multicast tree is to determine the position of the root of the shared tree, which is the center selection problem. The selection of the center directly affects the structure of the tree, and affects the performance of multicast accordingly. The center selection pr...

In this letter, we propose a coding mode selection method for the AMR-WB+ audio coder based on a decision tree. In order to reduce computation while maintaining good performance, decision tree classifier is adopted with the closed loop mode selection results as the target classification labels. The size of the decision tree is controlled by pruning, so the proposed method does not increase the ...

Two univariate split methods and one linear combination split method are proposed for the construction of classification trees with multiway splits. Examples are given where the trees are more compact and hence easier to interpret than binary trees. A major strength of the univariate split methods is that they have negligible bias in variable selection, both when the variables differ in the num...