Fully utilizing the carbon sequestration potential of forests will help to further mitigate aggravation greenhouse effect. In this paper, five typical tree species in Xiaoxing’anling are used as research objects. Based on differences dioxide capacity different at growth cycles, a mathematical model annual benefits is established, optimal cutting rates calculated, and after ten years economic fo...

We examine the history of cake cutting mechanisms and discuss the efficiency of their allocations. In the case of piecewise uniform preferences, we define a game that in the presence of strategic agents has equilibria that are not dominated by the allocations of any mechanism. We identify that the equilibria of this game coincide with the allocations of an existing cake cutting mechanism.

We examined tree rings from Douglas-fir (Pseudotsuga menziesii var. glauca (Beissn.) Franco) timbers in the Salt Lake Tabernacle, constructed from 1863–1867 in Salt Lake City, Utah. A seismic upgrade to the Tabernacle initiated in 2005 required the replacement of wooden timbers with steel beams. Our objectives were to 1) determine cutting dates for the timbers to identify logs that may have bee...

The d-dimensional bin packing problem (OBPP-d) is the problem of finding the minimum number of containers needed to contain a set of orthogonally packed d-dimensional rectangular boxes. In OBPP-d solvers two subproblems are crucial: Calculating lower bounds and solving the decision problem (OPP-d) of determining if a set of boxes can be orthogonally packed into a single container. This thesis f...

Thinnings, improvement cuttings, and other partial cuttings in southern bottomland hardwood forests are generally designed to enhance the growth and development of those species favored for management objectives. Hardwood tree classes and stocking guides can be used as tools to aid in planning and conducting partial cuttings in hardwood forests. Two disadvantages associated with any partial cut...

An admittedly simplistic view of undergraduate algorithms covers 2-3 decades perhaps to the nineties. It introduces analytical tools, basic algorithmic techniques, tends to cover cleanly stated problems such as minimum spanning trees, shortest paths, and maximum flow and with clever solutions. 1 The techniques tend to be combinatorial in nature. In this course, we will cover ideas from the last...

In this paper we describe a top-down approach to the segmentation and representation of documents containing tabular structures. Examples of these documents are invoices and technical papers with tables. The segmentation is based on an extension of X-Y trees, where the regions are split by means of cuts along separators (e.g. lines), in addition to cuts along white spaces. The leaves describe r...

Interaction networks are generally much less homophilic than affiliation networks, accommodating for many more cross-cutting links. By statistically assigning a political valence to users from their follower ties, and by further contrasting interaction on Twitter (quotes retweets) within specific discursive events, namely quote trees, we describe variety of patterns which significantly nuance t...