A detailed discussion of the point in polygon problem for arbitrary polygons is given. Two concepts for solving this problem are known in literature: the even-odd rule and the winding number, the former leading to ray-crossing, the latter to angle summation algorithms. First we show by mathematical means that both concepts are very closely related, thereby developing a first version of an algor...

A number of strategies have been advocated to increase the number of lung donors including: 1) improvement in donor resuscitation; 2) better methods of lung preservation; 3) extension of the lung donor selection criteria; 4) development of a living-related lung donor programme; and 5) utilisation of nonheart beating donors. Other strategies such as the split-lung technique and techniques of lun...

This paper presents a probabilistic model for studying the question: given n search resources, where in the search tree should they be ezpended? Specifically, a least-cost root-to-leaf path is sought in a random tree. The tree is known to be binary and complete to depth N. Arc costs are independently set either to 1 (with probability p ) or to 0 (with probability l-p ). The cost of a leaf is th...

In this paper we propose strategies for estimating performance of a classifier when labels cannot be obtained for the whole test set. The number of test instances which can be labeled is very small compared to the whole test data size. The goal then is to obtain a precise estimate of classifier performance using as little labeling resource as possible. Specifically, we try to answer, how to sel...

In this paper, we define a framework for media resources manipulation in an adaptive content delivery system. We discuss the media resources manipulation in an adaptation and negotiation architecture in terms of binary relationship definition using a so-called "related resources" approach, resources extraction, adaptation and delivery. We show how different resources can be related by predefine...

We consider a simple restriction of the PRAM model (called PPRAM), where the input is arbitrarily partitioned between a xed set of p processors and the shared memory is restricted to m cells. This model allows for investigating the tradeoos/ bottlenecks with respect to the communication bandwidth (modeled by the shared memory size m) and the number of processors p. The model is quite simple and...