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.
In wireless networks, the nodes are generally distributed in a field randomly. The topological information about the nodes is only supported from the distances between each node. This distance information may not be available due to the imperfect conditions among nodes. The positions of the distributed nodes on the field by using available distance data is called node localization problem. One of...
While many methods like multidimensional scaling (MDS) are exploited to represent and visualize symmetric distance matrices on 2-dimensional spaces, asymmetric proximity matrices such as an importing/exporting matrix from/to countries cannot be perfectly represented on metric spaces, since the methods assume a symmetric distance matrix. To overcome such an intrinsic limitation, in this paper, we propose...
In this paper, we consider the problem of analysis and visualization of online conversations (chat histories, email archives, etc.). We present a dynamic graph drawing algorithm based on modification of multidimensional scaling. The algorithm builds a layout of sequence of graphs and produces a slice view of the evolution of online communications. The method have been applied for visualization of...
This paper presents a new algorithm called “Population” that is an efficient and high speed method of performing Multi Dimensional Scaling based only on the calculation of a local fitness. Population is not bound to a specific Cost Function but is possible to define its in relation to the considered objective. The motivation for its creation was for use in the elaboration of datasets of great dimensions...
We study the stochastic behavior of the eigenspectrum of time-varying Euclidean-Gramian matrices typically associated with the MDS algorithm using the Gershgorin theorem. Relying on an empirical model, we quantify the probability that premultiplying the kernel at instant k by the eigenvectors of the kernel at instant k-1 preserves the principal component structure of the kernel. The study, which shows...
In this paper we propose a low-complex non-parametric pre-filtering technique for Time of Arrival (TOA) based target tracking systems. The output of a wavelet transform computed on each one of the anchor-to-target links is used to estimate the noise and the dynamic for the corresponding link. Subsequently this information is used to adaptively decide on the reliability of pre-filtered data. To take...
This paper proposes a localization algorithm that can be used to track and locate multiple mobile subjects in a wireless ad hoc network. An algorithm called adaptive dynamic localization is proposed. It is based on a dynamic multidimensional scaling (DMDS) method which reduces the localization error by adding virtual nodes till the network turns adequately dense and connected. The shortcomings which...
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.