This paper presents the development of a knowledge-based system for selection of cutting tools and conditions of turning Ž operations. The system developed can be used to select the toolholder, insert and cutting conditions feed, speed and depth . of cut . It is able to analyse and optimise cutting tools and condition selection. In addition, the user or tool supplier is able to modify and enhan...

The paper deals with the problem of proper selection of tools and cutting parameters for a given task in external turning on the basis of catalogue recommendation. The described method takes into account, in its algorithms, various factors influencing machining operation like an actual machine tool and properties of workpiece material. The architecture of the CAPP system including a module for ...

Proportional basal area (Pro-B) was developed as an accurate, easy-to-use method for making uneven-aged silviculture a practical management option. Following less than 3 h of training, forest staff from a range of professional backgrounds used Pro-B in an operational-scale field study to apply single-tree selection and group selection systems in longleaf pine (Pinus palustris Mill.) stands. Fie...

As a measure of the extent to which the removal of a node disconnects a graph, the cutting number c(v) of a node v in a connected graph G has been defined to be the number of pairs of nodes in different components of G {v}. We present a linear algorithm for determining c(v) for all nodes of a tree, and hence for identifying the cutting center, which consists of the nodes v at which c(v) is maxi...

In this paper we study the complexity of Cutting Planes (CP) refutations, and tree-like CP refutations. Tree-like CP proofs are natural and still quite powerful. In particular, the propositional pigeonhole principle (PHP) has been shown to have polynomial-sized tree-like CP proofs. Our main result shows that a family of tautologies, introduced in this paper requires exponential-sized tree-like ...

Random records and cuttings in trees Svante Janson We consider random cutting down of rooted trees, defined as follows [6]. If T is a rooted tree with number of vertices |T | ≥ 2, we make a random cut by choosing one edge at random. Delete this edge so that the tree separates into two parts, and keep only the part containing the root. Continue recusively until only the root is left. We let X(T ...

We present new asymptotically tight bounds on cuttings, a fundamental data structure in computational geometry. For n objects in space and a parameter r ∈ N, an 1r -cutting is a covering of the space with simplices such that the interior of each simplex intersects at most n/r objects. For n pairwise disjoint disks in R and a parameter r ∈ N, we construct a 1r -cutting of size O(r). For n axis-a...