High cost and low efficiency problem has been bothering NC teaching.To lower the cost of practical teaching of higher speed numerical control manufacturing along with improvement in processing efficiency, a multi-objective scheme for optimization of process parameters has been developed here. Various constraint conditions were set and a complex algorithm was employed for optimization. To achiev...

English & Dansk....................................................................................9 General introduction......................................................................................13 1. Model organisms........................................................................................17 1.1. Leaf-cutting ants...........................................................

Knowledge of tree age-size relationships is essential towards evaluating the sustainability of harvest regulations that include minimum diameter cutting limits and fixed-length cutting cycles. Although many tropical trees form annual growth rings and can be aged from discs or cores, destructive sampling is not always an option for valuable or threatened species. We used an individual-based popu...

We present a generalization of the Steiner problem in a directed graph. Given nonnegative weights on the arcs, the problem is to find a minimum weight subset F of the arc set such that the subgraph induced by F contains a given number of arc-disjoint directed paths from a certain root node to each given terminal node. Some applications of the problem are discussed and properties of associated p...

In this paper we continue the investigations in GMW92a] for the Stei-ner tree packing polyhedron. We present several new classes of valid inequalities and give suucient (and necessary) conditions for these inequalities to be facet-deening. It is intended to incorporate these inequalities into an existing cutting plane algorithm that is applicable to practical problems arising in the design of e...

Content-based image retrieval (CBIR) for documents has been studied for a long time [3]. It focuses on indexing and retrieval capabilities in a large set of document images and provides a convenient way for people to access the information in these images, which means retrieving document images by their visual features (color,shape,texture,etc) so converting them to electronic formats can be av...

Using a notion of real communication complexity recently introduced by J. Kraj cek, we prove a lower bound on the depth of monotone real circuits and the size of monotone real formulas for st-connectivity. This implies a super-polynomial speed-up of dag-like over tree-like Cutting Planes proofs.

Modeling of bevel gear cutting processes requires highly flexible data structures and algorithms. We compare OpenMP3.0 tasks with previously applied approaches like nesting parallel sections and stack based algorithms when parallelizing recursive procedures written in Fortran 95 working on binary tree structures.

experimental units. Cognizant of these limitations, our objectives were: (1) to determine whether partial cutting reduces stand-level spruce beetle-caused mortality; (2) to compare postoutbreak stand characteristics between partially cut and unthinned stands; and (3) to examine the relationship between beetle-caused tree mortality and stand characteristics.

Two-group classification is a key task in decision making and data mining applications. We introduce two new mixed integer programming formulations that make use of multiple separating hyperplanes. They represent a generalization of previous piecewise-linear models that embed rules having the form of hyperplanes, which are used to successively separate the two groups. In fact, the classifiers o...