Open Access. Powered by Scholars. Published by Universities.®

OS and Networks Commons

Open Access. Powered by Scholars. Published by Universities.®

2009

Discipline
Institution
Keyword
Publication
Publication Type

Articles 61 - 65 of 65

Full-Text Articles in OS and Networks

Characterization Of 1h Nmr Spectroscopic Data And The Generation Of Synthetic Validation Sets, Paul E. Anderson, Michael L. Raymer, Benjamin J. Kelly, Nicholas V. Reo, Nicholas J. Delraso, Travis E. Doom Jan 2009

Characterization Of 1h Nmr Spectroscopic Data And The Generation Of Synthetic Validation Sets, Paul E. Anderson, Michael L. Raymer, Benjamin J. Kelly, Nicholas V. Reo, Nicholas J. Delraso, Travis E. Doom

Kno.e.sis Publications

Motivation: Common contemporary practice within the nuclear magnetic resonance (NMR) metabolomics community is to evaluate and validate novel algorithms on empirical data or simplified simulated data. Empirical data captures the complex characteristics of experimental data, but the optimal or most correct analysis is unknown a priori; therefore, researchers are forced to rely on indirect performance metrics, which are of limited value. In order to achieve fair and complete analysis of competing techniques more exacting metrics are required. Thus, metabolomics researchers often evaluate their algorithms on simplified simulated data with a known answer. Unfortunately, the conclusions obtained on simulated data are …


User Interface Design, Moritz Stefaner, Sebastien Ferre, Saverio Perugini, Jonathan Koren, Yi Zhang Jan 2009

User Interface Design, Moritz Stefaner, Sebastien Ferre, Saverio Perugini, Jonathan Koren, Yi Zhang

Computer Science Faculty Publications

As detailed in Chap. 1, system implementations for dynamic taxonomies and faceted search allow a wide range of query possibilities on the data. Only when these are made accessible by appropriate user interfaces, the resulting applications can support a variety of search, browsing and analysis tasks. User interface design in this area is confronted with specific challenges. This chapter presents an overview of both established and novel principles and solutions.


Service Level Agreement In Cloud Computing, Pankesh Patel, Ajith H. Ranabahu, Amit P. Sheth Jan 2009

Service Level Agreement In Cloud Computing, Pankesh Patel, Ajith H. Ranabahu, Amit P. Sheth

Kno.e.sis Publications

Cloud computing that provides cheap and pay-as-you-go computing resources is rapidly gaining momentum as an alternative to traditional IT Infrastructure. As more and more consumers delegate their tasks to cloud providers, Service Level Agreements(SLA) between consumers and providers emerge as a key aspect. Due to the dynamic nature of the cloud, continuous monitoring on Quality of Service (QoS) attributes is necessary to enforce SLAs. Also numerous other factors such as trust (on the cloud provider) come into consideration, particularly for enterprise customers that may outsource its critical data. This complex nature of the cloud landscape warrants a sophisticated means of …


Determining The Best K For Clustering Transactional Datasets: A Coverage Density-Based Approach, Hua Yan, Keke Chen, Ling Liu Jan 2009

Determining The Best K For Clustering Transactional Datasets: A Coverage Density-Based Approach, Hua Yan, Keke Chen, Ling Liu

Kno.e.sis Publications

The problem of determining the optimal number of clusters is important but mysterious in cluster analysis. In this paper, we propose a novel method to find a set of candidate optimal number Ks of clusters in transactional datasets. Concretely, we propose Transactional-cluster-modes Dissimilarity based on the concept of coverage density as an intuitive transactional inter-cluster dissimilarity measure. Based on the above measure, an agglomerative hierachical clustering algorithm is developed and the Merge Dissimilarity Indexes, which are generated in hierachical cluster merging processes, are used to find the candidate optimal number Ks of clusters of transactional data. Our experimental results on …


Dynamic Adaptation Of Joint Transmission Power And Contention Window In Vanet, Danda B. Rawat, Gongjun Yan, Dimitrie C. Popescu, Michele C. Weigle, Stephan Olariu Jan 2009

Dynamic Adaptation Of Joint Transmission Power And Contention Window In Vanet, Danda B. Rawat, Gongjun Yan, Dimitrie C. Popescu, Michele C. Weigle, Stephan Olariu

Electrical & Computer Engineering Faculty Publications

In this paper, we propose an algorithm for joint adaptation of transmission power and contention window to improve the performance of vehicular network in a cross layer approach. The high mobility of vehicles in vehicular communication results in the change in topology of the Vehicular Ad-hoc Network (VANET) dynamically, and the communication link between two vehicles might remain active only for short duration of time. In order for VANET to make a connection for long time and to mitigate adverse effects due to high and fixed transmission power, the proposed algorithm adapts transmission power dynamically based on estimated local traffic …