COVERAGE PROBLEMS IN THE TREATMENT OF WRINGER INJURIES

1954 ◽  
Vol 36 (2) ◽  
pp. 292-298 ◽  
Author(s):  
Creighton A. Hardin ◽  
David W. Robinson
Keyword(s):  
1974 ◽  
Vol 11 (02) ◽  
pp. 281-293 ◽  
Author(s):  
Peter J. Cooke

This paper discusses general bounds for coverage probabilities and moments of stopping rules for sequential coverage problems in geometrical probability. An approach to the study of the asymptotic behaviour of these moments is also presented.


Author(s):  
John D. Schulman ◽  
Ken Goldberg ◽  
Pieter Abbeel
Keyword(s):  

Author(s):  
Ted Brown ◽  
Peter Brass ◽  
Matthew P. Johnson ◽  
Simon Shamoun

Covering an area with sensors has been an active research area in recent years. Coverage problems for sensors include the positioning of the sensors in order to cover much or all of a region, once or many times, and using sensors whose coverage abilities vary. Certain problem extensions arise in security applications and when sensors are deployed in hostile environments: it may not be possible to safely enter the area, in which case sensors may be distributed randomly from a distance; even if the positions can be chosen, there may be some minimal placement error which must be compensated for; it may not be possible to provide complete coverage, in which case we may settle for partial coverage or only barrier coverage and position sensors for improved intrusion detection. Another factor to consider when parties are acting in a coalition is that differing types of sensors may be deployed by the different parties, which must be taken into account when choosing positions. This short survey deals with some recent results that are especially applicable to such settings.


Author(s):  
Mischa Dohler ◽  
Djamal-Eddine Meddour ◽  
Sidi-Mohammed Senouci ◽  
Hassnaa Moustafa

An ever-growing demand for higher data-rates has facilitated the growth of wireless networks in the past decades. These networks, however, are known to exhibit capacity and coverage problems, hence jeopardizing the promised quality of service towards the end-user. To overcome these problems, prohibitive investment costs in terms of base station or access point rollouts would be required if traditional, non-scalable, cell-splitting, and micro-cell capacity dimension procedures were applied. The prime aim of current R&D initiatives is, hence, to develop innovative network solutions that decrease the cost per bit/s/Hz over the wireless link. To this end, cooperative networks have emerged as an efficient and promising solution. We discuss in this chapter some key research and deployment issues, with emphasis on cooperative architectures, networking, and security solutions. We expose some motivations to use such networks, as well as latest state-of-the-art developments, open research challenges, and business models.


Sign in / Sign up

Export Citation Format

Share Document