The effects of burning cycles and pine basal area levels were assessed on natural pine regeneration and hardwood development in uneven-aged stands of loblolly andshortleafpines (Pinw taeda L. and P. echinata Mill.). The treatments included an unburned control and prescribed winter burrs at 3-, 6-, and 9-yr intervals. Basal area treatments were 9, 14, 18, and 23 m2 ha-’ for the merchantable-pine...

BACKGROUND Migration flows of women from Female Genital Mutilation/Cutting practicing countries have generated a need for data on women potentially affected by Female Genital Mutilation/Cutting. This paper presents enhanced estimates for foreign-born women and asylum seekers in Italy in 2016, with the aim of supporting resource planning and policy making, and advancing the methodological debate...

We present worst-case lower bounds on the minimum size of a binary space partition (BSP) tree as a function of its height, for a set S of n axis-parallel line segments in the plane. We assume that the BSP uses only axis-parallel cutting lines. These lower bounds imply that, in the worst case, a BSP tree of height O(log n) must have size (n log n) and a BSP tree of size O(n) must have height (n)...

Separating text lines in handwritten documents remains a challenge because the text lines are often ununiformly skewed and curved. In this paper, we propose a novel text line segmentation algorithm based on Minimal Spanning Tree (MST) clustering with distance metric learning. Given a distance metric, the connected components of document image are grouped into a tree structure. Text lines are ex...

This work studies the problem of optimally locating sensors for monitoring chemical processes, formally known as the sensor network design and upgrade problem. This problem is an integer programming problem and has been solved to global optimality only using tree search methods using depth-first strategy. In this article, we exploit certain cost properties of the different nodes in the tree to ...

We present worst-case lower bounds on the minimum size of a binary space partition (BSP) tree as a function of its height, for a set S of n axis-parallel line segments in the plane. We assume that the BSP uses only axis-parallel cutting lines. These lower bounds imply that, in the worst case, a BSP tree of height O(log n) must have size Ω(n logn) and a BSP tree of size O(n) must have height Ω(n...

This paper discusses the selection of tools and cutting parameters in milling operations. To carry out this research, an expert system has been developed based on numerical methods of performance evaluation. The knowledge base is given by limitations in process variables, which let us to define the allowable cutting parameter space. The mentioned limitations are instabilities due to tool-work-p...

We evaluate the performance of weakestlink pruning of decision trees using crossvalidation. This technique maps tree pruning into a problem of tree selection: Find the best (i.e. the right-sized) tree, from a set of trees ranging in size from the unpruned tree to a null tree. For samples with at least 200 cases, extensive empirical evidence supports the following conclusions relative to tree se...