2014 International Conference on Parallel, Distributed and Grid Computing最新文献_第5页

Real-time codebook-based speech enhancement with GPUs 基于gpu的实时码本语音增强

2014 International Conference on Parallel, Distributed and Grid Computing Pub Date : 2014-12-01 DOI: 10.1109/PDGC.2014.7030761

A. S. Sai Prasanna, Iyer Chandrashekaran Gurumurthy, D. H. R. Naidu, P. K. Baruah

{"title":"Real-time codebook-based speech enhancement with GPUs","authors":"A. S. Sai Prasanna, Iyer Chandrashekaran Gurumurthy, D. H. R. Naidu, P. K. Baruah","doi":"10.1109/PDGC.2014.7030761","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030761","url":null,"abstract":"The advent of ubiquitous mobile communication has posed a lot of challenges, one of the prominent being suppression of background noise, especially in non-stationary noisy environments. In literature, several speech enhancement techniques have been proposed to tackle this problem of noise reduction. Codebook-based speech enhancement (CBSE) employing trained speech and noise codebooks, is one of the most effective noise reduction technique for handling non-stationary noise. However, the high compute intensive nature of this technique renders it inapplicable in real-time speech enhancement scenarios by introducing a significant delay in speech transmission. In this paper, this problem is addressed by providing an efficient, parallel CBSE algorithm. The proposed parallel CBSE algorithm achieves significant speedup and reduced execution time, resulting in a speech transmission delay which is well within the limits of realizing real-time speech enhancement. The proposed parallel CBSE algorithm is then used as a basis to provide a novel cloud based framework to achieve real-time speech enhancement in mobile communication as a proof-of-concept. The proposed parallel implementation can also be used in a variety of applications which demand real-time speech enhancement such as teleconferencing systems, digital hearing aid devices and speech recognition systems.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126472467","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Student oriented mobile based examination process 面向学生的基于移动的考试流程

2014 International Conference on Parallel, Distributed and Grid Computing Pub Date : 2014-12-01 DOI: 10.1109/PDGC.2014.7030756

Prashant K. Gupta, M. Madan, Kajal Puri, Abhishek Gulati

{"title":"Student oriented mobile based examination process","authors":"Prashant K. Gupta, M. Madan, Kajal Puri, Abhishek Gulati","doi":"10.1109/PDGC.2014.7030756","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030756","url":null,"abstract":"The industry that has been benefitted the most by the developments in VLSI technology is that of mobile phones. Modern day mobile handsets are referred to as smartphones and have reached to the hands of every person even in the remote corners of the world. Yet another revolutionary research was the development of the Android open source mobile OS which has made the mobile phones smarter. So, we decided to develop a mobile based examination system to reach the population even at the most remote areas. An Android driven examination system that we have designed and implemented is made with an intent to serve the education industry and provide efficient and reliable result along with powerful user interface. Our system aims at making the examination system a lot more convenient for the students as well as the faculty members and reducing the manual headache required in the traditional process. Google's Android is the most popular OS globally including India [2]. Android being so popular can be considered an OS that the masses have used in their smart phones; hence our system is designed considering the convenience of the faculty and the student taking the examination. Using the impeccable UI functionalities that have been provided using the Android Development Kit we have designed and implemented our system.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124461863","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

VLKM: Virtual location-based key management scheme for Wireless Sensor Networks VLKM:基于虚拟位置的无线传感器网络密钥管理方案

2014 International Conference on Parallel, Distributed and Grid Computing Pub Date : 2014-12-01 DOI: 10.1109/PDGC.2014.7030715

R. Vaid, V. Katiyar

{"title":"VLKM: Virtual location-based key management scheme for Wireless Sensor Networks","authors":"R. Vaid, V. Katiyar","doi":"10.1109/PDGC.2014.7030715","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030715","url":null,"abstract":"Designing an energy efficient key management scheme to secure Wireless Sensor Networks is a challenging task because sensor nodes in the network are resource constrained. If an initial key is used in the network lifetime, a key stolen by an unauthorized node will results in data compromised that is generated in the network. So a re-keying is necessary after a specified number of rounds to avoid the side effect of stale key in the network. In clustering environment, a number of keys are needed for every sensor. If the role of sensor is cluster head, then one key is required to collect data from all cluster members. This key is shared between the cluster head sensor and all the sensors which are members of that cluster. The different key is required to transfer the aggregated data to base station this key is only shared between the sensor node which is cluster head and the base station. But if the role of cluster head is changed from one sensor to different sensor randomly, a new key will be require that is share between sensor node and new cluster head and also a new key will be required that is shared between this new cluster head and the base station. If the scheme is followed then re-keying after every round is a bottleneck of the network as more than one re-keying is require for every sensor. In this paper, we have presented a new virtual location based key management scheme (VLKM). This scheme used virtual location to generate a round key for every sensor. Simulation results show that proposed scheme performs better than other comparable schemes in the literature without increasing the communication overheads.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"51 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122422351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

Performance enhancement of distributed network system by phase-wise dynamic task allocation 基于分阶段动态任务分配的分布式网络系统性能增强

2014 International Conference on Parallel, Distributed and Grid Computing Pub Date : 2014-12-01 DOI: 10.1109/PDGC.2014.7030775

Faizul Navi Khan, K. Govil, A. Agarwal

{"title":"Performance enhancement of distributed network system by phase-wise dynamic task allocation","authors":"Faizul Navi Khan, K. Govil, A. Agarwal","doi":"10.1109/PDGC.2014.7030775","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030775","url":null,"abstract":"A Distributed NetworkSystem (DNS) is a set of application and system programs, and data exchanges across a number of independent personal computers connected by a communication network. Task allocation in distributed network system is always a challenging task and also very helpful in order to enhance the performance of DNS. Although there are two types of approaches for task allocation and these are dynamic and static. Dynamic approach of task allocation is much appropriate manner and it also makes the best use of available computational power in DNS. Task allocation problem can be explained as `m' number tasks are required to execute on `n' number of processors where number tasks (m) is always greater than number of processors (n) (m>n). This research paper proposed a dynamic task allocation model to allocate the `m' number of tasks on `n' number of processors in distributed network system and execution completes in k number of phases. Proposed dynamic model will help to reduce the cost of task allocation. Phase wise execution cost, inter task communication cost, residing cost of each task on different processors, and reallocation cost for each task also have taken into the consideration to design a dynamic task allocation model.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"219 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122772140","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Combinational feature selection approach for network intrusion detection system 网络入侵检测系统的组合特征选择方法

2014 International Conference on Parallel, Distributed and Grid Computing Pub Date : 2014-12-01 DOI: 10.1109/PDGC.2014.7030720

Tanya Garg, Y. Kumar

{"title":"Combinational feature selection approach for network intrusion detection system","authors":"Tanya Garg, Y. Kumar","doi":"10.1109/PDGC.2014.7030720","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030720","url":null,"abstract":"In the era of digital world, the computer networks are receiving multidimensional advancements. Due to these advancements more and more services are available for malicious exploitation. New vulnerabilities are found from common programs and even on vulnerability in a single computer might compromise the network of an entire company. There are two parallel ways to address this threat. The first way is to ensure that a computer doesn't have any known security vulnerabilities, before allowing it to the network it has access rights. The other way, is to use an Intrusion Detection System. IDSs concentrate on detecting malicious network traffic, such as packets that would exploit known security vulnerability. Generally the intrusions are detected by analyzing 41 attributes from the intrusion detection dataset. In this work we tried to reduce the number of attributes by using various ranking based feature selection techniques and evaluation has been done using ten classification algorithms that I have evaluated most important. So that the intrusions can be detected accurately in short period of time. Then the combinations of the six reduced feature sets have been made using Boolean AND operator. Then their performance has been analyzed using 10 classification algorithms. Finally the top ten combinations of feature selection have been evaluated among 1585 unique combinations. Combination of Symmetric and Gain Ratio while considering top 15 attributes has highest performance.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122814385","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 14

Utilizing materialized views to formulate business intelligence 利用物化视图来制定商业智能

2014 International Conference on Parallel, Distributed and Grid Computing Pub Date : 2014-12-01 DOI: 10.1109/PDGC.2014.7030709

Anil Sharma, M. Sood

引用次数: 1

Software defined network — Architectures 软件定义的网络。体系结构

2014 International Conference on Parallel, Distributed and Grid Computing Pub Date : 2014-12-01 DOI: 10.1109/PDGC.2014.7030788

Nishtha, M. Sood

引用次数: 24

Heavy weight ontology learning using text documents 利用文本文档进行重型本体学习

2014 International Conference on Parallel, Distributed and Grid Computing Pub Date : 2014-12-01 DOI: 10.1109/PDGC.2014.7030725

Vikas Kumar, S. Chaudhary

引用次数: 1

Enhanced 2ACK scheme for reducing routing overhead in MANETs 增强的2ACK方案，减少了在manet中的路由开销

2014 International Conference on Parallel, Distributed and Grid Computing Pub Date : 2014-12-01 DOI: 10.1109/PDGC.2014.7030727

Deepika Dhiman, N. Sood

引用次数: 3

An efficient permission-cum-cluster based distributed mutual exclusion algorithm for mobile adhoc networks 一种高效的基于权限和集群的移动自组网分布式互斥算法

2014 International Conference on Parallel, Distributed and Grid Computing Pub Date : 2014-12-01 DOI: 10.1109/PDGC.2014.7030731

Anchal, P. Saini, C. Krishna

{"title":"An efficient permission-cum-cluster based distributed mutual exclusion algorithm for mobile adhoc networks","authors":"Anchal, P. Saini, C. Krishna","doi":"10.1109/PDGC.2014.7030731","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030731","url":null,"abstract":"Mutual exclusion (Mutex) is a major coordination problem in distributed systems. To handle Mutex, the corresponding solutions are mainly classified into permission-based, token-based and quorum-based protocols. Mobile Ad-hoc Networks referred as MANETs introduce new obstacles for designing algorithms that help in solving distributed mutual exclusion problem. To our knowledge, few algorithms have been proposed in the literature which follows token-based or permission-based approach. In this paper, we propose an efficient permission-cum-cluster based distributed mutual exclusion algorithm for mobile adhoc networks. The significant motivation for our algorithm is to ensure that every node should transmit the lowest number of effective messages in the underlying network. Moreover, it will lead to reduced communication delay in order to retrieve the required permissions. We observed that the proposed algorithm outperforms the Mobile_RA algorithm in performance parameters such as synchronization delay, response time as well as message complexity. The results have been substantiated by simulation experiments.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124362152","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3