Since storing and accessing a digital data is becoming cheaper, the amount of data in multimedia format is continuously increasing. Indexing and organizing of this data is quite important. There is a blended amount of...
详细信息
A graph-theoretic approach for non-redundant gene marker selection from microarray gene expression data has been presented in this article. The sample versus gene data presented by microarray data is first converted i...
详细信息
ISBN:
(纸本)9781467329255
A graph-theoretic approach for non-redundant gene marker selection from microarray gene expression data has been presented in this article. The sample versus gene data presented by microarray data is first converted into a weighted undirected complete feature-graph where the nodes represent the genes having gene's relevance as node weights and the edges are weighted according to the similarity value (correlation) among the genes. Then the densest subgraph having minimum average edge weight (similarity) and maximum average node weight (snr value) is identified from the original feature-graph. To find the densest subgraph, binary particle swarm optimization has been applied for minimizing the average edge weight and maximizing the average node weigh through a single objective function. Thus an optimized reduced sub graph is found which contains final selected genes for which average correlation is very less and average gene relevance is very high. The proposed method is compared with SFS, T-test and Ranksum test in terms of sensitivity, specificity, accuracy, fscore, Area Under ROC Curve (AUC) and average correlation on several real-life data sets.
The advent of cloud is drastically changing the H igh Performance computing (HPC) application scenarios. Current virtual machine-based IaaS architectures are not designed for HPC applications. This paper presents a ne...
详细信息
cloudcomputing provides a new paradigm for industries to meet the emerging business needs by accessing distributedcomputing resources such as infrastructure, hardware and software applications on-demand over the int...
详细信息
cloudcomputing provides a new paradigm for industries to meet the emerging business needs by accessing distributedcomputing resources such as infrastructure, hardware and software applications on-demand over the internet as services. As the technology and the need is growing very fast, in future there may be multiple vendors offering different services with different Quality of Services (QoS) and at various prices. This would lead to development of new methods and tools for the performance evaluation of the system to meet the offerings and requirements. In this paper, we present an analytical finite population model for performance evaluation of a private cloudcomputing system. Various performance measures of the cloud system for finite population environment indicate that the proposed provisioning technique helps the cloud operators in tuning the resources accordingly to improve the QoS targets.
cloudcomputing is Internet - connected mode of supercomputing. In cloudcomputing all the resources are provided as service that causes high traffic on cloud. So an efficient traffic management mechanism is required ...
详细信息
Virtualization enables data centers to share physical resources between virtual private servers (VPS) cost-effectively. Live migration of virtual machines (VM) is one of the most important capabilities that have been ...
详细信息
A mobile ad hoc network is much more assailable to attacks than a wired network due to its limited physical security, high mobility and lack of centralized administration. Jellyfish is a new denial of service attack. ...
详细信息
ISBN:
(纸本)9781467329255;9781467329224
A mobile ad hoc network is much more assailable to attacks than a wired network due to its limited physical security, high mobility and lack of centralized administration. Jellyfish is a new denial of service attack. There are three kinds of JellyFish attacks i. e. JF Reorder Attack, JF Periodic Dropping Attack, JF Delay Variance Attack. In JF delay variance attack, intruder node needs to intrude into forwarding group and then it delays data packets for some amount of time before forwarding. Due to JF delay variance attack, high end- to- end delay takes place in the network and performance of the network (i. e. throughput etc) becomes worse. In our paper we have done a comparative performance analysis of three reactive routing protocols i. e. AODV, DSR and TORA used in mobile ad hoc network under JF delay variance attack with increasing node density. If we have a mobile ad hoc network in which probability of occurrence of JF attack is high and also if it requires time efficient network service for information exchange with increasing number of nodes then we have to choose DSR protocol. If it requires high throughput and consistent service in the network with increasing node density then TORA protocol is recommended.
In this paper, we propose a distributed fault localization protocol for localizing multi-link failures in EPC global networks. the protocol is based on a parallel limited-perimeter vector matching (P-LVM) mechanism, w...
详细信息
P2P systems have shown useful to many types of distributed systems due to their features of efficient direct communication among peers. Although initially motivated by the need for efficient file sharing among large a...
详细信息
This paper presents a distributed platform based on cloudcomputing for management of pervasive healthcare data. Pervasive applications through continuous monitoring of patients and their context generate a vast amoun...
详细信息
暂无评论