Standard fluorescence in-situ hybridization (FISH) technique requires a hybridization time of 12 hours or greater, thus amounting to a turn-around time (TAT) of 24 hours or greater for result reporting. To improve the TAT for the FISH tests, a new Vysis IntelliFISH Hybridization Buffer has been recently developed by Abbott Molecular. It was evaluated in 20 pairs of matched bone marrow samples a...

1 The reader collision problem occurs when the signal from one reader interferes with the signal from other readers. Solutions like RTS-CTS are not applicable because a reader may communicate with multiple tags simultaneously. In this paper, we describe Pulse, a distributed protocol to reduce reader collisions. The operation of the Pulse protocol is based on periodic beaconing on a separate con...

The fixed-time flocking of multi-agent systems with a virtual leader is investigated in this paper. motion dynamics the agents are assumed to be unknown and only satisfy boundedness, which does not need modelled by Lipschitz condition. To achieve collision avoidance for all fixed time, control protocol high-dimensional space developed using graph theory theoretical properties differential equat...

background: bone sarcomas are the most common malignancies of bone tissues in children, and are classified intotwo groups as osteosarcoma and ewing’s sarcoma. treatment and prognosis depend on the subtype and grade ofthe tumor. the goal of this study was to evaluate the features bone sarcoma in patients referred to mahak childrenhospital since 2007 to 2009.materials and methods: this was a retr...

This paper presents a new approach for energetic analyses of traffic accidents against fixed road elements using close-range photogrammetry. The main contributions of the developed approach are related to the quality of the 3D photogrammetric models, which enable objective and accurate energetic analyses through the in-house tool CRASHMAP. As a result, security forces can reconstruct the accide...

This work presents a novel fixed-delay broadcasting protocol for near video-on-demand service. Consider a film S is divided into n equal parts {S1, S2, ..., Sn} and played through k channels. Each segment Si must appear at least once every i+c-1 segments rather than i segments. The value of parameter c means that the users have to wait the time of c segments. Each channel of k channels is first...

This paper considers the convergence speed of multi-agent systems with discrete-time double-integrator dynamics. The communication topology is assumed to be fixed and undirected. First the speed of convergence of the associated average consensus protocol is analyzed, and the problem of maximizing the convergence speed over the free parameters in the consensus protocol is considered under the as...

This article is concerned with the bipartite flocking problem in multi-agent systems. Our contributions can be summarized as follows. Firstly, a class of preassigned-time consensus protocols proposed to solve issue Secondly, aid symmetric properties graph theory and Lyapunov stability theorem, we prove that agents divided into two disjointed clusters finite time, they move opposite directions a...

This paper proposes a novel and simple MAC protocol called beforehand bandwidth reservation (BBR) to reserve the empty slots in the next big-slot cycle for OBS ring networks by control channel. The node architecture uses one tunable transmitter and one fixed receiver to add or drop data channels and a fixed transmitter/receiver pair to transmit and receive on the control channel. Each node poss...