Sökresultat

Filtyp

Din sökning på "*" gav 536582 sökträffar

Exercise testing using a cycle or treadmill: a review of various protocols.

Abstract: In order to evaluate physical capacity it is neccesary to choose an appropriate method depending on the condition of the subject being tested and on the purpose of testing. A review has been carried out in order to present some of the protocols for evaluating exercise capacity which are in practical use. Twenty different test protocols for evaluating exercise capacity; 12 cycle protocols

Debatt på låtsas

En invandrare blev brutalt misshandlad och förnedrad av fem svenska poliser medan han hölls i förvar i cell 48 på Centrumhäktet i Polishuset i Malmö i strid mot invandrarverkets beslut att han skulle släppas fri. Poliserna polisanmäldes för misshandel och olaga frihetsberövande och händelsen utlöste en offentlig debatt. Debatten som började intensivt neutraliserades emellertid snabbt av välmenande

On the Bijectivity of Thin-plate Splines

The thin-plate spline (TPS) has been widely used in a number of areas such as image warping, shape analysis and scattered data interpolation. Introduced by Bookstein[1], it is a natural interpolating function in two dimensions, parameterized by a finite numb er of landmarks. However, even though the thin-plate spline has a very elegant intuitive interpretation as well as mathematical formulation i

Exploring wireless mesh networks for collaborative augmented reality environments

Augmented Reality (AR) has emerged as a technology able to greatly support the interaction between people and digital information by merging virtual objects with the real environment. So far, research in this field has been mainly focused on single-user scenarios with pre-stored digital data whose visualization needs to be appropriately and promptly aligned with physical objects. Instead, latest d

Failure disjoint paths

Given a set of commodities and a network where some arcs can fail while others are reliable, we first consider the problem of computing a minimum-cost pair of paths not sharing failing links. If a reliable link belongs to both paths then its cost is counted only once. We show that this problem can be solved in strongly polynomial time. Second, we consider a routing problem where each commodity can