Artists in new media arts explore the possibilities offered by digital technologies to create adaptive and interactive new media artworks integrating audio and video. In this paper, we are interested in adaptation mechanisms for such artworks and we focus on the design and implementation of adaptation scenarios. We formalize adaptation scenarios by using the event-condition-action paradigm and we introduce the concept of adaptation policy. We present the adaptation engine we have designed and prototyped to manage and execute adaptation scenarios

We consider a model for communications network design that includes the optimal location of switches (of which there are several types) and the design of the access and backbone networks. The model is of the integer programming variety, and in order to find its solution, we propose a greedy heuristic that yields a good starting solution and a more sophisticated heuristic based on tabu search. Finally we present numerical results for problems including as much as 200 user sites and 20 potential switch sites.

Given a set P of $2n$ points on the boundary of a polygon, consider the complete graph whose vertex set is P, and whose edges are assigned weights equal to the Euclidean distance between their endpoints if the endpoints see each other in the polygon and $ + \infty $ otherwise. The problem of finding a minimum-weightperfect matching is investigated in this graph, and an $O(n\log (n))$ time algorithm is obtained if the polygon is convex; an $O(n\log ^2 (n))$ time algorithm is obtained if the polygon is simple but not convex. Similar results are obtained for the assignment problem and the maximum-weight problem.

An Ο(n3/2√α(n)) time algorithm is presented for finding a minimum-weight matching of a set of 2n points lying on the boundary of a convex polygon, where α(n) is the functional inverse of the Ackerman's function. Generalizing this result, we obtain an Ο(n3/2 logn√α(n)) time algorithm for the minimum-weight matching of points lying on the boundary of a simple nonconvex polygon, where we require that the line segments joining the matched pairs be contained within the polygon. We also consider the maximum-weight matching problem, and obtain algorithms of complexities Ο(n) and Ο(n log n) for the convex and the nonconvex case, respectively. By contrast, finding a weighted matching of an arbitrary set of points takes Ο(n5/2 log4 n) time [Vaidya 1987].

The complete graph induced by a set of 2n points on the boundary of a polygon is considered. The edges are assigned weights equal to the Euclidean distance between their endpoints if the endpoints see each other in the polygon, and + infinity otherwise. An O(n log n)-time algorithm is obtained for finding a minimum-weight perfect matching in this graph if the polygon is convex, and an O(n log/sup 2/n)-time algorithm if the polygon is simple but nonconvex. The assignment problem for a convex polygon is solved in time O(n log n), and O(n alpha (n)) and O(n alpha (n) log n) time bounds are obtained for the verification problem on convex and nonconvex polygons, respectively, where alpha (n) is the functional inverse of the Ackermann function.>