Optimal Forest Harvesting with Ordered Site Access

A long-standing problem in forestry management is the optimal harvesting of a growing population of trees to maximize the resulting discounted aggregate net revenue. For an ongoing forest, the trees are harvested and replanted repeatedly; for a once-and-for-all forest, there is no replanting after a single harvest. In this paper, we outline a new formulation for the optimal-harvest problem which avoids difficulties associated with functional-differential equations or partial differential equations of state in the relevant optimal-control problem encountered in recent studies of the ongoing-forest problem. Our new formulation is based on the observation that tree logging is necessarily ordered by practical and/or regulatory considerations (e.g., it is illegal to cut the younger trees first in some jurisdictions); random access to tree sites does not occur in practice. The new formulation is described here for the simpler problem of a once-and-for-all forest. New results for nonuniform initial age distributions and variable unit harvest costs for this simpler problem are reported herein; results for an ongoing forest will be reported in [10]. The new model is also of interest from a control-theoretic viewpoint, as it exhibits the unique feature of having time as a state variable, in contrast to its usual role as an independent variable in conventional control problems.     

不同规模单水平样本轮换最优轮换率的确定

在单水平样本轮换抽样调查中,我们假设每期调查的规模不一定相等,分别在给定总的费用和给定精度要求的条件下,求出了使得估计量的方差达到最小的最优轮换率以及最优样本容量。     

顺序和顺序哈密顿有向图

A digraph D is k-ordered if for every sequence S:v 1,v 2,…,v k of k distinct vertices,there exists a cycle C such that C encounters the vertices of S in the specified order.In particular,we say that D is k-ordered hamiltonian if for every sequence S:v 1,v 2,…,v k of k distinct vertices,there exists a hamiltonian cycle C such that the vertices of S are encountered on C in the specified order.In this paper,sufficient conditions for digraphs to be ordered and ordered hamiltonian have been given.     

林木生长影响模型及其在人工林林地质量评价中的应用

本文基于对立地因子影响林木生长的系统分析，采用途径分析等方法建立了林木生长影响模型，并将其应用于我国长白山林区红松人工林林地质量的评价。     

An Optimal Algorithm to Find the Jump Number of Partially Ordered Sets

The jump number of a partially ordered set (poset) P isthe minimum number of incomparable adjacent pairs (jumps) in some linearextension of P. The problem of finding a linear extension of Pwith minimum number of jumps (jump number problem) is known to beNP-hard in general and, at the best of our knowledge, no exactalgorithm for general posets has been developed. In this paper, wegive examples of applications of this problem and propose for thegeneral case a new heuristic algorithm and an exactalgorithm. Performances of both algorithms are experimentallyevaluated on a set of randomly generated test problems.     

Bi-Ideals in Ordered Semigroups and Ordered Groups

It is shown that an ordered semigroup is right and left simple if and only if it does not contain proper bi-ideals. An example showing that an ordered semigroup without proper bi-ideals need not be an ordered group is constructed. Bibliography: 7 titles.     

On Optimal Rotation of a Rigid Body by Applying Internal Forces

Doklady Mathematics - The article describes results obtained for the problem of maximum rotation of a rigid body in a given time interval by moving an internal mass. The mass moves by applying a...     

Fibrations of Ordered Groupoids and the Factorization of Ordered Functors

We investigate canonical factorizations of ordered functors of ordered groupoids through star-surjective functors. Our main construction is a quotient ordered groupoid, depending on an ordered version of the notion of normal subgroupoid, that results in the factorization of an ordered functor as a star-surjective functor followed by a star-injective functor. Any star-injective functor possesses a universal factorization through a covering, by Ehresmann’s Maximum Enlargement Theorem. We also show that any ordered functor has a canonical factorization through a functor with the ordered homotopy lifting property.     

A Comparison of Optimal Methods for Local Access Uncapacitated Network Design

We compare some optimal methods addressed to a problem of local access network design. We see this problem arising in telecommunication as a flow extension of the Steiner problem in directed graphs, thus including as particular cases some alternative approaches based on the spanning tree problem. We work with two equivalent flow formulations for the problem, the first referring to a single commodity and the second being a multicommodity flow model. The objective in both cases is the cost minimization of the sum of the fixed (structural) and variable (operational) costs of all the arcs composing an arborescence that links the origin node (switching center) to every demand node. The weak single commodity flow formulation is solved by a branch-and-bound strategy that applies Lagrangian relaxation for computing the bounds. The strong multicommodity flow model is solved by a branch-and-cut algorithm and by Benders decomposition. The use of a linear programming solver to address both the single commodity and the multicommodity models has also been investigated. Our experience suggests that a certain number of these modeling and solution strategies can be applied to the frequently occurring problems where basic optimal solutions to the linear program are automatically integral, so it also solves the combinatorial optimization problem right away. On the other hand, our main conclusion is that a well tailored Benders partitioning approach emerges as a robust method to cope with that fabricated cases where the linear programming relaxation exhibits a gap between the continuous and the integral optimal values.     

给定抽样调查费用时最优轮换率及样本容量的确定

建立了前期和现期总的调查规模即样本容量不一定相等时的样本轮换模型,并求出了给定费用时的最优样本容量及最优轮换率,并分析了3种特殊情况,其中第3种特殊情况正是[1,2]中的有关结果.     

基于改进灰色关联度的IOWA算子最优组合预测模型

通过引进诱导有序加权平均(IOWA)算子和改进灰色关联度的计算式,提出了新的基于改进灰色关联度的IOWA算子的组合预测模型.方法可以克服传统的组合预测方法赋予不变的加权平均系数和以单一误差指标作为预测精度衡量的缺陷.定义基于改进灰色关联度的IOWA算子的优性组合预测的概念,最后给出实例分析表明了新模型能有效地提高组合预测精度.     

Ordered groups and ordered geometries

The article studies the relationship between ordered groups and ordered geometries. To this end we consider metric planes of a very general kind (without any assumptions about order, continuity, free mobility and the existence or uniqueness of a joining line) which are singular (the set of translations forms a group) and show that the geometric concept of an ordered plane corresponds on the group-theoretical side to an order structure of the group of translations. This correspondence shows that not only Euclidean planes but also Minkowskian and Galilean planes are orderable if and only if the associated coordinate field is orderable. The article closes with some implications for the foundations of ordered geometry which include an axiomatic analysis of the Pasch axiom and some remarks on the relationship of the notions of incidence and order.     

Ordered sets and their inf-endomorphisms

From the semigroup of all transformations of an ordered set is selected the class of subsets such that the structure of each of them, as a partially ordered groupoid, comprehensively characterizes the degree of order of the given set, with the exception of the case when it consists of two elements.Translated from Matematicheskie Zametki, Vol. 7, No. 3, pp. 339–347, March, 1970.The author wishes to express his sincere gratitude to L. N. Shevrin for his attention during the preparation of this paper.     

基于最大——最小贴近度的IOWA算子最优组合预测模型

将最大一最小贴近度与IOWA算子相结合,建立了基于最大一最小贴近度的IOWA算子最优组合预测模型,并且定义了在最大一最小贴近度下非劣性组合预测、预测方法优超等概念.在此模型下,研究了模型的非劣性组合预测及优性组合预测存在的充分条件.最后给出实例分析,表明该组合预测方法的有效性.     

Rotation Numbers and Isometries

Using the notion of rotation set for homeomorphisms of compact manifolds, we define the rotation homomorphism of a connected compact orientable Riemannian manifold and apply it to prove that the dimension of the isometry group of a connected compact orientable Riemannian 3-manifold without conjugate points is not greater than its first Betti number. In higher dimensions the same is true under the additional assumption that the fundamental cohomology class of the manifold is a cup product of integral 1-dimensional classes.     

Ordered Groupoids and Left Cancellative Categories

We generalise work by Leech and Loganathan to obtain a correspondence between left cancellative categories and ordered groupoids. In particular, we prove that up to equivalence every category of monics can be obtained from an ordered groupoid.     

On Pseudocomplemented and Stone Ordered Sets

The aim of this paper is to characterize both the pseudocomplemented and Stone ordered sets in a manner similar to that used previously for Boolean and distributive ordered sets. The sublattice G(A) of the Dedekind–Mac Neille completion DM(A) of an ordered set A generated by A is said to be the characteristic lattice of A. We will show that there are distributive pseudocomplemented ordered sets whose characteristic lattices are not pseudocomplemented. We can define a stronger notion of pseudocomplementedness by demanding that both A and G(A) be pseudocomplemented. It turns out that the two concepts are the same for finite and Stone ordered sets.     

Ordered sets,pagenumbers and planarity

General bounds for the pagenumber of an ordered set are developed. One bound is derived by first showing that the maximum number of edges in the diagram of a planar ordered setP is 2v(P)-2-ht(P). A construction is given to show that the pagenumber of the product ofn chains is no more than 2n-2. Lastly, some open questions are discussed.Supported in part by NSERC of Canada.Supported by an NSERC Summer Scholarship.