The most common radiographic manifestation of bacterial pulmonary infections are foci of consolidation which are visible as bright shadows interfering with the interior lung intensity. In critically-ill patients this ...
详细信息
The most common radiographic manifestation of bacterial pulmonary infections are foci of consolidation which are visible as bright shadows interfering with the interior lung intensity. In critically-ill patients this interference can be severe leading to vague or invisible lung field boundaries which are difficultly distinguished even by experienced physicians. This problem is amplified if the radiographs are of low quality as obtained with a portable x-ray device, routinely used in intensive care units. This paper proposes a pioneering methodology that copes with lung field detection in both stationary and portable chest radiographs by combining statistical grey-level intensity information and directional edge maps. The boundaries of the lung fields are approximated by consecutive intuitively manipulated parametric curves. Conventional and state of the art lung field detection approaches address only stationary radiography, and only a few of them cope with pulmonary infections. The proposed methodology features unsupervised operation, it is not iterative, it is not limited by the patientspsila positioning, and it is tolerant to the presence of consolidations and boundary discontinuities of the lung fields. Its performance is validated on various stationary radiographs and on a set of portable radiographs obtained from patients with bacterial pulmonary infections.
This paper introduces a network architecture called Vehicular Wireless Burst Switching (VWBS). The main objective of this architecture is to provide low-cost connectivity solution for isolated and dispersed regions wi...
详细信息
In the design process of a reconfigurable accelerator employing in an embedded system, multitude parameters may result in remarkable complexity and a large design space. Design space exploration as an alternative to t...
详细信息
We propose QoS-aware scheduling algorithms for grid networks that are capable of optimally or near-optimally assigning computation and communication tasks to grid resources. The routing and scheduling algorithms to be...
详细信息
We propose QoS-aware scheduling algorithms for grid networks that are capable of optimally or near-optimally assigning computation and communication tasks to grid resources. The routing and scheduling algorithms to be presented take as input the resource utilization profiles and the task characteristics and QoS requirements, and co-allocate resources while accounting for the dependencies between communication and computation tasks.
In this paper we introduce an equation-based smooth multicast congestion control for adaptive multimedia transmission over best-effort wired networks. Target of the proposed schema is (a) smooth transmission rate, in ...
详细信息
In this paper we introduce an equation-based smooth multicast congestion control for adaptive multimedia transmission over best-effort wired networks. Target of the proposed schema is (a) smooth transmission rate, in order to minimize the audio-video (AV) encoding and decoding distortion and (b) TCP friendly transmission. The "smoothness" lays in the way the TCP-friendly transmission rate is filtered. We integrate the congestion control functions in the RTP protocol and use the RTCP sender and receiver reports to provide the necessary feedback information for the sender's adaptive transmission rate. The performance evaluation of the smooth adaptation and TCP-friendliness is conducted through a number of simulations with the network simulator software (ns2). Our intention is to use this congestion control in the context of a proposed framework for multimedia transmission over wired and wireless networks.
Designing wireless sensor networks is inherently complex; many aspects such as energy efficiency, limited resources, decentralized collaboration, fault tolerance have to be tackled. To be effective and to produce appl...
详细信息
ISBN:
(纸本)9781424433643
Designing wireless sensor networks is inherently complex; many aspects such as energy efficiency, limited resources, decentralized collaboration, fault tolerance have to be tackled. To be effective and to produce applicable results, fundamental research has to be tested, at least as a proof-of-concept, in large scale environments, so as to assess the feasibility of the new concepts, verb their large scale effects (not only at technological level, but also as for their foreseeable implications on users, society and economy) and derive further requirements, orientations and inputs for the research. In this paper we focus on the problems of interconnecting existing testbed environments via the Internet and providing a virtual unifying laboratory that will support academia, research centers and industry in their research on networks and services. In such a facility important issues of trust, security, confidentiality and integrity of data may arise especially for commercial (or not) organizations. In this paper we investigate such issues and present the design of a secure and robust architectural model for interconnecting testbeds of wireless sensor networks.
A key problem in networks that support advance reservations is the routing and time scheduling of connections with flexible starting time. In this paper we present a multicost routing and scheduling algorithm for sele...
详细信息
A key problem in networks that support advance reservations is the routing and time scheduling of connections with flexible starting time. In this paper we present a multicost routing and scheduling algorithm for selecting the path to be followed by such a connection and the time the data should start so as to minimize the reception time at the destination, or some other QoS requirement. The utilization profiles of the network links, the link propagation delays, and the parameters of the connection to be scheduled form the inputs to the algorithm. We initially present a scheme of non-polynomial complexity to compute a set of so-called non-dominated candidate paths, from which the optimal path can be found. By appropriately pruning the set of candidate paths using path pseudo-domination relationships, we also find multicost routing and scheduling algorithms of polynomial complexity. We examine the performance of the algorithms in the special case of an Optical Burst Switched network. Our results indicate that the proposed polynomial time algorithms have performance that it is very close to that of the optimal algorithm.
One of the key objectives of Universal Mobile Telecommunications System (UMTS) is the realization of enhanced end-user experience through the provision of rich multimedia services, ensuring in parallel an economical d...
详细信息
暂无评论