Den systematiske bekæmpelse af smitsom kalvekastning.

Den systematiske bekæmpelse af smitsom kalvekastning

A heuristic algorithm for finding attractive fixed-length circuits in street maps

In this paper we consider the problem of determining fixed-length routes on a street map that start and end at the same location. We propose a heuristic for this problem based on finding pairs of edge-disjoint shortest paths, which can then be combined into a circuit. Various heuristics and filtering techniques are also proposed for improving the algorithm’s performance

Energy Efficient Survivable IP over WDM Networks with Network Coding

In this work we investigate the use of network coding in 1+1 survivable IP over WDM networks by encoding the protection paths of multiple flow with each other at intermediate nodes. We study the energy efficiency of this scheme through MILP, and a heuristic with five operating options. We evaluate the MILP and the heuristics on typical and regular network topologies. Our results show that implementing network coding can produce savings up to 37% on the ring topology and 23% considering typical topologies. We also study the impact of varying the demand volumes on the network coding performanc

Re-Identification for Improved People Tracking

Re-identification is usually defined as the problem of deciding whether a person currently in the field of view of a camera has been seen earlier either by that camera or another. However, a different version of the problem arises even when people are seen by multiple cameras with overlapping fields of view. Current tracking algorithms can easily get confused when people come close to each other and merge trajectory fragments into trajectories that include erroneous identity switches. Preventing this means re-identifying people across trajectory fragments. In this chapter, we show that this can be done very effectively by formulating the problem as a minimum-cost maximum-flow linear program. This version of the re-identification problem can be solved in real-time and produces trajectories without identity switches. We demonstrate the power of our approach both in single- and multi-camera setups to track pedestrians, soccer players, and basketball players

Den systematiske bekæmpelse af smitsom kalvekastning. (afslutning.)

Den systematiske bekæmpelse af smitsom kalvekastning.  (afslutning.

An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs

Routing optimisation in some types of networks requires the calculation of the minimal cost pair of disjoint paths such that the cost functions associated with the arcs in the two paths are different. An exact algorithm for solving this NP-complete problem is proposed, based on a condition which guarantees that the optimal path pair cost has been obtained. This optimality condition is based on the calculation of upper and lower bounds on the optimal cost. A formal proof of the correctness of the algorithm is described. Extensive experimentation is presented to show the effectiveness of the algorithm, including a comparison with an integer linear programming formulation.http://www.sciencedirect.com/science/article/B6VC5-4S7BDKX-2/1/f8493f6260218c44c9894cdd5745551