The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Distance measurement between nodes in wireless sensor networks is a prerequisite for a variety of applications and algorithms. However, special hardware allowing such measurements is expensive, especially if dealing with hundreds or thousands of nodes. Fekete et al. presented an approach on distance estimation based on only the neighborhood information available to all nodes in the network. We improve...
The non-coherent time-of-arrival (TOA) estimations are applied in impulse location for its simplicity. However, the multipath propagation of the narrow pulse results in complicated performance analysis. By fitting the output envelope of energy detection into a exponential decay, we approximately deduce the closed-form Cramer-Rao low bound (CRLB) of TOA estimation. Simulations with non-coherent TOA...
Geographic routing, an attractive routing solution for wireless ad hoc networks, has been studied extensively in two-dimensional environments. However, three-dimensional space has proven to be much more challenging, with only a few existing proposals. In this paper, we present Slab Routing - a novel projection based method that adapts two-dimensional geographic face routing techniques to three-dimensional...
Simulated annealing (SA) is adopted to detect the parameters of line, circle, ellipse, and hyperbola. The equation of pattern is defined under translation and rotation. The distance from all points to all patterns is defined as the system error. Also we use the minimum error to determine the number of patterns. The parameters of the pattern are learned with probability in SA. The proposed SA parameter...
This paper presents a multi-resolution masks based pattern matching method for person identification. The system is commenced with the construction of multi-resolution mask cluster pyramid, where the mask size is chosen depending on the distance between two eyes, computed from the detected face. Experimental results show the effectiveness of the system with significantly higher precision, recall rates...
This paper considers the following network computation problem: n nodes are placed on a radic(n)timesradic(n) grid, each node in the network is connected to every other node within distance r(n) of itself, and is given an arbitrary input bit. Connected nodes communicate with each other over independent binary symmetric channels of a given transition probability epsiv ges 0, and an arbitrarily designated...
Semantic relatedness measures provide a means to determine how closely related two concepts may or may not be. In the area of ontology alignment, many lexical-based relatedness measures have been successfully applied within the realm of domain ontologies. The alignment initiative, however, has not included all measures of relatedness. More generic measures of relatedness, such as meronomy-based, have...
Motion planning is an important step in any complex robotic motion task. Many algorithms deal with this problem and a lot of effective approaches makes use of random generation of roadmaps or motion commands. In this paper, a novel algorithm for random roadmap generation is proposed. This approach, which addresses the planning problem with a resilience philosophy, relies on a network model with some...
We describe a novel geometric localized routing (GLR) protocol in disruption (delay) tolerant network (DTN). Although DTNs do not guarantee the connectivity of the network all the time, geometric location information still could be used to make routing decisions in a store and forward way. Geometric planar spanners, especially local Delaunay triangulation can also be used in DTN to provide a good...
The LEACH algorithm for selecting cluster heads is a probabilistic method which produces clusters with a large variation of link distances and uneven energy consumption during the data transmission phase. To address this issue, a RF signal strength algorithm based on link quality is presented. Using a competitive distributed algorithm, nodes attempt to reduce the overall energy required for transmission...
People in densely populated environments typically form groups that split and merge. In this paper we track groups of people so as to reflect this formation process and gain efficiency in situations where maintaining the state of individual people would be intractable. We pose the group tracking problem as a recursive multi-hypothesis model selection problem in which we hypothesize over both, the...
This paper proposes a hybrid recommender system that utilizes latent features. The main problem discussed in this paper is the cold start problem. To handle this problem, the proposed system first extracts latent features from items represented by a multi-attributed record using a probabilistic model. Then, it calculates the similarity of users from their ratings. Both similarities between items and...
In the former papers[1][2], we presented research information on a ldquoVehicle-to-roadside system using RFIDs for detecting road shouldersrdquo. As a result, we found that RFIDs can be used for road-shoulder avoidance systems. This paper argues about the extensibility for pedestrian avoidance systems. The basic concept is the consideration of the relative velocity between a vehicle and a pedestrian...
Erroneous local geometric realizations in some parts of the network due to their sensitivity to certain distance measurement errors is a major problem in wireless sensor network localization. This may in turn affect the localization of either the entire network or a large portion of it. This phenomenon is well-described using the notion of "flip ambiguity" in rigid graph theory. In this...
This paper describes a new scheme for generating paths that are optimized for faster execution while keeping a certain amount of clearance away from obstacles. An optimized path is first extracted from multiple query PRM using a Lazy A* algorithm with a weighted Linfin norm, this latter is post-processed to correct its clearance to over a desired threshold in regions where it is geometrically possible...
We propose a novel graph-based transductive learning approach for interactive image segmentation. Here the term ldquotransductiverdquo indicates a process that iteratively propagates information from user-labeled regions to unlabeled image pixels. For the application of interactive image segmentation, transductive approach has several advantages compared with traditional color probabilistic model...
Tracking of movements such as that of people, animals, vehicles, or of phenomena such as fire, can be achieved by deploying a wireless sensor network. So far only prototype systems have been deployed and hence the issue of scale has not become critical. Real-life deployments, however, will be at large scale and achieving this scale will become prohibitively expensive if we require every point in the...
In this paper, we study the problem of recognizing an unknown probability density function from one of its sample which is of interest in signal and image processing or telecommunication applications. By opposition with the classical Kolmogorov-Smirnov method based on empirical cumulative functions, we consider histogram estimators of the density itself built from our data. Those histograms are generated...
Clustering techniques have been used by many intelligent software agents in order to retrieve, filter, and categorize documents available on the World Wide Web. Clustering is also useful in extracting salient features of related Web documents to automatically formulate queries and search for other similar documents on the Web. Traditional clustering algorithms either use a priori knowledge of document...
The strong limit theorems is one of the central questions for studying in the international probability theory. The purpose of this paper is to give a strong limit theorem for functions of two-ordered Markov chains indexed by a kind of non-homogenous tree.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.