2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing最新文献_第10页

Undiagnosed samples aided rough set feature selection for medical data 未诊断样本辅助粗糙集特征选择医学数据

2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing Pub Date : 2012-12-01 DOI: 10.1109/PDGC.2012.6449895

D. Guan, Weiwei Yuan, Zilong Jin, Sungyoung Lee

{"title":"Undiagnosed samples aided rough set feature selection for medical data","authors":"D. Guan, Weiwei Yuan, Zilong Jin, Sungyoung Lee","doi":"10.1109/PDGC.2012.6449895","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449895","url":null,"abstract":"Medical data often consists of a large number of disease markers. For medical data analysis, some disease markers are not helpful and sometimes even have negative effects. Therefore, applying feature selection is necessary as it can remove those unimportant disease markers. Among many feature selection methods, rough set based feature selection (RSFS) has been widely used. Unlike other methods, RSFS is completely data-driven. It does not require any other information like probability distributions. Traditional RSFS methods extract the information only from the diagnosed samples. Therefore, they usually require a large number of diagnosed samples to achieve the good feature selection performance. However, in many real medical applications, diagnosed samples are limited, yet the number of undiagnosed samples is large. Motivated by semi-supervised learning methodology, in this paper, we propose a novel RSFS method which can learn from both diagnosed and undiagnosed samples. This method is called undiagnosed samples aided rough set feature selection (USA-RSFS). Its main benefit is to reduce the requirement on diagnosed samples by the help of undiagnosed ones. Finally, the promising performance of USA-RSFS is validated through a set of experiments on medical datasets.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123732887","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}

引用次数: 4

Parallel algorithm for binomial series(special cases) using mesh architecture 基于网格结构的二项式序列(特殊情况)并行算法

2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing Pub Date : 2012-12-01 DOI: 10.1109/PDGC.2012.6449808

A. Gupta

引用次数: 1

Optimization algorithm of neural network on RF MEMS switch for wireless and mobile reconfigurable antenna applications 无线和移动可重构天线射频MEMS开关的神经网络优化算法

2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing Pub Date : 2012-12-01 DOI: 10.1109/PDGC.2012.6449913

P. Chawla, R. Khanna

{"title":"Optimization algorithm of neural network on RF MEMS switch for wireless and mobile reconfigurable antenna applications","authors":"P. Chawla, R. Khanna","doi":"10.1109/PDGC.2012.6449913","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449913","url":null,"abstract":"A neural network based feed-forward back-propagation multi layered-perceptron algorithm is presented for the validation of changing the width of upper beam, dielectric and anchor arm length of RF switch designed specifically for reconfigurable antenna. These physical dimensions are varied and design structure is optimizing for low power consumption and to achieve acceptable level of isolation and insertion loss. The algorithm takes these new data samples during training from finite element method (FEM) based simulation tool Ansoft-HFSS. Results of the artificial neural network (ANN) are compared with those of the electromagnetic solver. The developed procedures allows the optimisation solutions of the design to be carried out by replacing repeated electromagnetic simulations whilst still retaining an excellent accuracy as compared with finite element modelling. This procedure requires less simulation time especially for the designing problem, where there is a need of reliable and fully functional methods. The calculated insertion loss and isolation results are in very good agreement with the experimental results reported elsewhere.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128799126","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}

引用次数: 11

Reduction of blockage node and hidden terminal problem of CSMA/CA MAC protocol using directional antenna 利用定向天线减少CSMA/CA MAC协议的阻塞节点和隐藏终端问题

2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing Pub Date : 2012-12-01 DOI: 10.1109/PDGC.2012.6449914

Milan Kumar Dholey, Asrofi Khatun

{"title":"Reduction of blockage node and hidden terminal problem of CSMA/CA MAC protocol using directional antenna","authors":"Milan Kumar Dholey, Asrofi Khatun","doi":"10.1109/PDGC.2012.6449914","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449914","url":null,"abstract":"Avoidance of collision in wireless ad-hoc network is important and CSMA/CA MAC protocol is playing a major role to avoid collision. CSMA/CA MAC protocol handle it using sort RTS/CTS control message. Though reliability of data transmission increase, it blocks some nodes unnecessarily due to RTS and CTS control message and also makes existence of hidden-terminal (HT) problem which reduces the network performance. In wireless Ad-hoc network the nodes are mobile, infrastructure less and communicate through their radio range. If we can reduce the number of blockage nodes the network performance will increase by utilizing those nodes as other communication's source, destination or relay. In this paper, we propose two methods by which wireless ad-hoc network performance will increase. First we propose a method for enhancement of CSMA/CA MAC protocol by unblocking the nodes using directional antenna and setting up NAV values of RTS/CTS control message considering directional antenna and modified the CSMA/CA timing diagram accordingly. The second method shows how the hidden-terminal problem is reduced by the proposed method. The analytical model explains the performance of CSMA/CA protocol with reduction of HT problem.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"166 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127557264","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

The movement of sensors within cluster in WSN is Elliptic in nature 无线传感器网络簇内传感器的运动本质上是椭圆的

2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing Pub Date : 2012-12-01 DOI: 10.1109/PDGC.2012.6449875

R. Dutta, S. Gupta, M. Das

{"title":"The movement of sensors within cluster in WSN is Elliptic in nature","authors":"R. Dutta, S. Gupta, M. Das","doi":"10.1109/PDGC.2012.6449875","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449875","url":null,"abstract":"A wireless sensor network (WSN) has to maintain a desirable sensing area of coverage and periodically report sensed data to the administrative center (i.e., base station, router etc.). Then the coverage area of the movement of sensors and lifetime are two important problems in a WSN due to constraint of limited battery energy. Sensors are usually deployed randomly in coverage area of interest and therefore the sensor tracking become one of the biggest challenge in Wireless Sensor Networks (WSNs). Many works done to track the sensor nodes in WSNs and all previous theoretical analyses on the coverage area and lifetime are primarily focused on the random uniform distribution of sensors. Here is depicting a real analysis in WSNs, In this paper, we try to find out the coverage area of sensors and best of our knowledge we first provide a mathematical and analytical framework for the coverage area of the deployment sensor nodes in a WSN that follows a multivariable normal distribution or Gaussian distribution. The multivariate normal distribution is often used to describe correlated real-valued random variables each of which clusters around a mean value which gives the monitored region. We determine the randomly deployed sensor nodes, follows an Elliptic area in wireless sensor network.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121346732","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}

引用次数: 0

Tool for calculating reusability of object oriented programs 计算面向对象程序可重用性的工具

2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing Pub Date : 2012-12-01 DOI: 10.1109/PDGC.2012.6449930

S. Kumar, R. Chaudhary, A. Sharma, A. Punhani

{"title":"Tool for calculating reusability of object oriented programs","authors":"S. Kumar, R. Chaudhary, A. Sharma, A. Punhani","doi":"10.1109/PDGC.2012.6449930","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449930","url":null,"abstract":"Software reuse increases the productivity and reduces the cost and improves the Quality of the software development. Reusability is one of the most important quality characteristic. Therefore it is necessary to measure the reusability of the module in order to realize the reuse of module effectively. By reuse the module of existing software has increased in past recent year which impact more on the software quality. Many measuring reusability methods have been propose for estimating the reusability of module. If any software system using the reusable component from existing System it save the lot of time for developing the software and also cost of the software development. It also increases the performance of the software and aim of the any software organization is giving the product with good quality and low cost as soon as possible. If we reuse the oldest module which is already develop in new system it increase the productivity because effort of the programmer is reduce and it correctness is also increase because exist system already tested. Problem is that which module or component is more suitable in oldest software for reuse. In this thesis we developing the tool which is calculating the reusability for the object oriented program and display existing module is acceptable for reuse or not.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"340 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115982916","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}

引用次数: 0

Unconstrained handwritten numeral recognition using majority voting classifier 使用多数投票分类器的无约束手写数字识别

2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing Pub Date : 2012-12-01 DOI: 10.1109/PDGC.2012.6449833

R. Kumar, M. Goyal, P. Ahmed, A. Kumar

{"title":"Unconstrained handwritten numeral recognition using majority voting classifier","authors":"R. Kumar, M. Goyal, P. Ahmed, A. Kumar","doi":"10.1109/PDGC.2012.6449833","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449833","url":null,"abstract":"Unconstrained offline handwritten numeral recognition is a challenging problem. It is very difficult to find high recognition results using a single classifier. This paper presents a simple profile, combined local & global features and majority voting scheme classifier for unconstrained handwritten numeral recognition. The simple profile feature is computed by using the left, right, top and bottom profile of an image. A feature vector of length 112 is formed by combining all the profiles. The local feature vector is extracted by applying Daubechies wavelet transform on the four images that were obtained by applying the Kirsch operator, and the global features that are obtained by applying the same Daubechies wavelet transform on the original image. A feature vector of length 80 is formed by combining the 64 local and 16 global features. The feature vectors are the intensity of a pixel in the third level approximation component of an image. In this experiment four neural network classifiers: Multilayer feed forward, Pattern recognition, Cascade forward, Function fitting neural network classifiers & two statistical classifiers: Linear discriminant analysis and KNN classifiers are used for classifying these features. A majority voting scheme has been performed with three neural network classifier and KNN classifier. The performance is tested on MNIST dataset. The network was trained on 60,000 and tested on 10,000 numeral samples of which 98.05% test samples are correctly recognized.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126527756","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}

引用次数: 12

Periodic knowledge discovery through parallel paradigm 通过并行范式进行周期性知识发现

2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing Pub Date : 2012-12-01 DOI: 10.1109/PDGC.2012.6449932

K. Rani, V. K. Prasad, C. R. Rao

引用次数: 0

Energy optimizations for mobile terminals via computation offloading 基于计算卸载的移动终端能源优化

2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing Pub Date : 2012-12-01 DOI: 10.1109/PDGC.2012.6449824

Xiao Ma, Yong Cui, Lian Wang, I. Stojmenovic

引用次数: 30

Credit based routing in Delay Tolerant Networks 时延容忍网络中基于信用的路由

2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing Pub Date : 2012-12-01 DOI: 10.1109/PDGC.2012.6449809

P. Das, Kalka Dubey, T. De

引用次数: 7