To contribute to an understanding of forest management on secondary forest succession, we conducted vegetation surveys in a chronosequence of pine stands ranging in age from 1 to 59 years. Adjacent areas were compared at 1, 7, 12, and 17 years following two reproduction cutting methods (clearcuts or pine seed-tree cuts); a 59-year-old pine stand that was periodically thinned was also included t...

Three-dimensional planning tools will enable the use of minimally-invasive distraction osteogenesis for the correction of craniomaxillofacial deformities by simulating treatment, precisely quantifying movement vectors, and aiding pre and post-treatment evaluation. Current techniques extrapolate 3D surgical movements and outcomes based on standard 2D radiographs. Surgical planning and outcome ev...

Packet classification is one of the fundamental techniques required by various network management functionalities. As the state-of-the-art of software packet classification, decision-tree algorithms employ various geometrical cutting schemes to build optimized decision trees. However, existing cutting schemes cannot meet the desired performance on large rulesets because they sacrifice either cl...

In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We propose a finitely convergent convex hull tree algorithm which constructs a linear program that has the same optimal solution as the associated MILP. In addition, we combine the standard notion of sequential cutting planes...

We study in this paper the problem of jumper insertion on general routing (Steiner/spanning) trees with obstacles for antenna avoidance/fixing at the routing and/or postlayout stages. We formulate the jumper insertion for antenna avoidance/fixing as a tree-cutting problem and present the first optimal algorithm for the general tree-cutting problem. We show that the tree-cutting problem exhibits...

We consider the total cost of cutting down a random rooted tree chosen from a family of so-called very simple trees (which include ordered trees, d-ary trees, and Cayley trees); these form a subfamily of simply generated trees. At each stage of the process an edge is chose at random from the tree and cut, separating the tree into two components. In the one-sided variant of the process the compo...

Natural forests in the humid tropics differ from temperate and plantation forests in several ways: there may be many tree species; many of these may occur infrequently; there may be a large range of tree sizes and shapes present; tree ages may be unknown and indeterminate; and despite the luxuriant appearance some rainforests, growth rates may be relatively low. This has many implications for t...

We compared indices of total hard mast production (oak and hickory combined) in 20, secondgrowth, pine-hardwood stands under five treatments to determine the effects of different reproduction treatments on mast production in the Ouachita Mountains. We evaluated mast production in mature unharvested controls and stands under four reproduction cutting methods (single-tree selection, group selecti...

We study the query complexity of cake cutting and give lower bounds for computing approximately envy-free, perfect, and equitable allocations with the minimum number of cuts. These lower bounds are tight for three players in the case of envy-free allocations and for two players in the case of perfect and equitable allocations. We also formalize moving knife procedures and show that a large subc...