T T T—This paper focuses on the problem of data clustering in wireless sensor networks (WSNs). The data time window is a landmark window, from the time WSN starts working up to the current time. The objective is to group sensory data generated by sensor nodes deployed in a two-dimensional physical space by the similarity of sensory data in the multi-dimensional sensory data space. To perform in...

introduction central vein catheterization (cvc) is an important procedure for emergency departments (ed). despite the existence of ultrasonography (us) devices in every ed, cvc was accomplished by anatomical landmarks in many eds in iran. objective this study was designed for the evaluation of us-guided cvcs, anatomical landmark cvcs, and the promotion of us-guided cvc in iran. methods and mate...

Associative classification (AC) which is based on association rules has shown great promise over many other classification techniques on static dataset. Meanwhile, a new challenge have been proposed in that the increasing prominence of data streams arising in a wide range of advanced application. This paper describes and evaluates a new associative classification algorithm for data streams AC-D...

An automatic mechanism that gives verbal navigation instructions to pedestrians in situ needs to take into account a number of factors. Besides giving the instruction at the right time and place, the information needs to be as unambiguous as possible for the user to both choose the correct path and be confident in doing so. Humans make extensive use of landmarks when describing the way to other...

This paper contributes to the literature on divided government and legislative productivity. We begin by reexamining Mayhew's data on landmark enactments. We show that Mayhew's claim that divided government does not affect legislative productivity is a consequence of aggregating time series that exhibit different behavior. We then extend Mayhew's analysis by broadening the concept of significan...

This note describes a Sliding Window Filter that is an on-line constanttime approximation to the feature-based 6-degree-of-freedom full Batch Least Squares Simultaneous Localization and Mapping (SLAM) problem. We contend that for SLAM to be useful in large environments and over extensive run-times, its computational time complexity must be constant, and its memory requirements should be at most...