visualization is an important part of the dataanalysis process. Many researchers, however, do not have access to the resources required to do visualization effectively for largedatasets. this problem is illustrated ...
详细信息
visualization is an important part of the dataanalysis process. Many researchers, however, do not have access to the resources required to do visualization effectively for largedatasets. this problem is illustrated through several user scenarios. To remedy this problem, we propose a visualization Gateway that provides simplified access to such resources to a broad population of users. the current implementation of this gateway is described, including the technology used and the services made available. In particular, a detailed description of a ParaView portlet is included. A proposed design for enabling access to community users is discussed. Technology as well as policy issues that were raised, including security and data management, are covered, as are methods for providing additional services, scaling to include additional resources, and other areas of future development. the paper concludes with a summary of the topics covered. Copyright (c) 2006 John Wiley & Sons, Ltd.
Node-link diagrams are widely used in information visualization to show relationships among data. However, when the size of data becomes very large, node-link diagrams will become cluttered and visually confusing for ...
详细信息
ISBN:
(纸本)9783540709039
Node-link diagrams are widely used in information visualization to show relationships among data. However, when the size of data becomes very large, node-link diagrams will become cluttered and visually confusing for users. In this paper, we propose a novel controllable edge clustering method based on Delaunay triangulation to reduce visual clutter for node-link diagrams. Our method uses curves instead of straight lines to represent links and these curves can be grouped together according to their relative positions and directions. We further introduce progressive edge clustering to achieve continuous level-of-details for large networks.
We present WCTAnalyze, a novel tool for accessing and visually analyzing huge collections of temporally indexed textual data. It is motivated by applications such as media resonance analysis, business intelligence etc...
详细信息
We present WCTAnalyze, a novel tool for accessing and visually analyzing huge collections of temporally indexed textual data. It is motivated by applications such as media resonance analysis, business intelligence etc. that need to perform high level analytics on top of linguistically and statistically processed unstructured textual data.
the novelty of this work lies in using the E&M algorithm for analyzing multi-censored mixture distribution EM data. Furthermore, the Akaike Information Criterion (AIC) will be used to determine the number of failu...
详细信息
the novelty of this work lies in using the E&M algorithm for analyzing multi-censored mixture distribution EM data. Furthermore, the Akaike Information Criterion (AIC) will be used to determine the number of failure mechanisms in a given set of failure data and the Bayes' posterior probability theory is applied to determine the probability of each failure data belonging to the different failure mechanisms. All these useful information are further validated by performing failure analysis on selected test units.
Ultra-wideband (UWB) systems possess several distinct features such as very high data rate, large multipath or frequency diversity and improved ranging precision while requiring low-power low-complexity transceivers. ...
详细信息
Ultra-wideband (UWB) systems possess several distinct features such as very high data rate, large multipath or frequency diversity and improved ranging precision while requiring low-power low-complexity transceivers. Among the different modulation schemes, differential PSK is an attractive option because it does not require channel estimation, and hence reduces implementation complexity. this paper investigates an OFDM UWB receiver based on both time and frequency-domain differential PSK modulation and compares the performances of single and double differential schemes in the presence of frequency offset.
We present a new method for analyzing classifiers by visualization, which we call visual nonlinear discriminant analysis. Classifiers that output posterior probabilities are visualized by embedding samples and classes...
详细信息
In this study, a method for hierarchical examination and visualization of GSM data using the Self-Organizing Map (SOM) is described. the data is examined in few phases. At first temporally averaged data is used and th...
详细信息
the visualization of continuous multi-dimensional data based on their projection in a 2-dimensional space is a way to detect visually interesting patterns, as far as the projection provides a faithful image of the ori...
详细信息
the proceedings contain 39 papers. the topics discussed include: incorporating goal analysis in database design: a case study from biological data management;prioritized active integrity constraints for database maint...
the proceedings contain 39 papers. the topics discussed include: incorporating goal analysis in database design: a case study from biological data management;prioritized active integrity constraints for database maintenance;can integrity tolerate inconsistency?;the spicy project: a new approach to data matching;context integration for mobile data tailoring;top-down parameter-free clustering of high-dimensional categorical data;effective incremental clustering for duplicate detection in largedatabases;classifying aggregated data: a symbolic dataanalysis approach;containment of conjunctive queries under access limitations;distributed aggregation strategies for preference queries;progresses on tree-based approaches to improving histogram accuracy;towards a semantic information extraction approach from unstructured documents;and agent-based web services supporting semantic negotiation.
the cells of flash memories can only endure a limited number of write cycles, usually between 10,000 and 1,000,000. Furthermore, cells containing data must be erased before they can store new data, and erasure operati...
详细信息
ISBN:
(纸本)3540388753
the cells of flash memories can only endure a limited number of write cycles, usually between 10,000 and 1,000,000. Furthermore, cells containing data must be erased before they can store new data, and erasure operations erase large blocks of memory, not individual cells. To maximize the endurance of the device (the amount of useful datathat can be written to it before one of its cells wears out), flash-based systems move data around in an attempt to reduce the total number of erasures and to level the wear of the different erase blocks. this data movement introduces interesting online problems called wear-leveling problems. We show that a simple randomized algorithm for one problem is essentially optimal. For a more difficult problem, we show that clever offline algorithms can
暂无评论