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

{"title":"Vulnerabilities in social networking sites","authors":"P. Jagnere","doi":"10.1109/PDGC.2012.6449865","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449865","url":null,"abstract":"In this paper, we show that social networking web sites are vulnerable to be used as a bot. This transforms a social network into an antisocial network which can be used for network attacks. Remote code execution, manipulating victim's browsers through legitimate web control functionality such as image-loading HTML tags, JavaScript instructions, and Java applets are few examples of how an adversary can hack into another user's session. Apart from controlling social network users and driving them to launch attacks against third parties, an adversary can also harm the users themselves. In this report we explore these properties, develop real exploits, and analyze their impact. We will explore other possible misuses of online Social Network web sites.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"33 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":"134128670","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}

{"title":"Patent services CRM with integrated docket system","authors":"S. Bidarahalli, S. Palani, R. Sadanand, O. N. Sringeri","doi":"10.1109/PDGC.2012.6449818","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449818","url":null,"abstract":"Client Relationship Management (CRM) system is used to manage the services provided by a company to its customers. CRM is a multi-disciplinary concept. Its successful implementation involves many aspects. CRM systems have been developed for various fields such as sales management, product management etc., but has not evidently been adopted for providing patent services, where a person or a company manage their work related to patent services in an organized manner. Current companies providing patent services, have their own interfaces, which have few limitations. As a result, CRM system for patent servicing is developed where a separate database is maintained for each client, enabling to check previous works, review service being rendered, anytime and anywhere. And at the service provider end, CRM system helps organize work making it clutter free. Few of the patent services are time critical and are required to comply with legal procedures. Such patent services are further rendered using a docket system, complying with the legal patent procedures of the country to which the patent application belongs to. The docket system maintains a centralized calendar/rule engine and initiates actions as per applicable laws, rules and procedures of the target country. The generation of notifications that are sent to clients to remind them of pending actions towards the docket, is based upon a rule engine. Hence a CRM system with integrated docket system for patent procedures is a complete solution for all patent related services.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"22 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":"134227475","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}

{"title":"Wavelets based decomposition and classification of diseased fMRI brain images for inter racial disease types of Alzheimer's Vs tumors using SOFM and enhancement by LVQ neural networks","authors":"N. V. Manokar, Vigneshwar Manoharan, R. Rinesh, K. P. Sridhar, L. Patnaik","doi":"10.1109/PDGC.2012.6449929","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449929","url":null,"abstract":"This research addresses to the problem of establishment patterns, training of the optimal desired network, classification and accuracy prediction. Once the accuracy issue had been addressed, the issue of efficiency detection and maintenance is normally introduced and experimented in most of the scenarios. The later stage of development is dealt with the inter racial classification of diseases which gets over lapped. The problem of detection of brain images into corresponding diseased and Non-Diseased syndrome types for functional Magnetic Resonance Images. The classification problem gets intensified when there comes the inter lapped diseased contents. Among such, overlapped problems occur when there are significant inter-related similar symptoms, similar types of traditional symptoms, common symptoms, where there needs to be minute differences in disease identification. A case occurs with relevance to the shrinking of the frontal lobes and expansion of the back lobes. When a Tumor or a cyst starts protruding, pain occurs followed blurred vision and nausea, unbearable pain and others symptoms. Some of the Alzheimer's symptoms are the shrinking of the frontal lobes and expansion of the behind lobes, followed by memory loss, abnormal behaviour and etc., The process involves the classification among Tumour Vs Alzheimers' classification. The images differ with capturing intensity and noise content. This happens during motion capturing. The choosing up of the images for featuring detection, feature vector calculation and subjecting to training and testing is all carried out from fMRI images. The reason being the functional magnetic Resonance Image properties gets inducted in the fMRI images compared to the other types of images like the PET, CT images etc., A Daubechies Wavelet Transform acting as a smoothening filter was applied playing a dual role in denoising, Decomposition and extraction of frequency feature components for feature vector calculation. A modified median filter removes random noises better which has been induced. A fourth level order of Daubechies Discrete Wavelet decomposition was used for feature vector formation. This was performed because of the blurring results of the images due to the wavelet implication. This naturally destroy the feature coefficients but yet another prominent and effective way in order the classification of the brain images into diseased and non - diseased brain images. The approximated sub - band images were chosen from the input images to train the network. In designing a network using a competitive neural network as a subclass to classify the normal and abnormal image type into corresponding diseased and non - disease types. Initially subjecting to a Competitive Learning, Self - Organized Maps are enhanced to Self - Organized Feature Maps and finally enhanced to Linear Vector Quantization. On comparing to the earlier competitive network, the network of Competitive Learning, SOM and SOFM, and invoking Linear","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"616 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":"133059614","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}

{"title":"Monte Carlo optimisation auto-tuning on a multi-GPU cluster","authors":"Andrius Paukste","doi":"10.1109/PDGC.2012.6449942","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449942","url":null,"abstract":"In this paper we investigate Monte Carlo optimisation of the fitness function on a multi-GPU cluster. Our main goal is to develop auto-tuning techniques for the GPU cluster. Monte Carlo or random sampling is a technique to optimise a fitness function by giving random values to function parameters. When execution of the fitness function requires a high amount of computational power Monte Carlo sampling becomes both very time and computational power consuming. A developer who is not familiar with the application, hardware, and the CUBA runtime cannot determine the optimal execution parameters. This makes GPU auto-tuning well suited to achieving better performance and reducing computing time.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"143 2 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":"115177734","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}

{"title":"A system's approach towards domain identification of web pages","authors":"S. Gupta, K. Bhatia","doi":"10.1109/PDGC.2012.6449938","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449938","url":null,"abstract":"With the proliferation of the document corpora (commonly called as HTML documents or web pages) on the WWW, efficient ways of exploring relevant documents are of increasing importance [4, 8]. The key challenge lies in tackling the sheer volume of documents on the Web and evaluating relevancy for such a huge number. Efficient exploration needs a web crawler that can semantically understand and predict the domain of the web page through analytical processing. This will not only facilitate efficient exploration but also help in the better organization of the web content. As a search engine classifies the Search results by keyword matches, link analysis and other such mechanisms, the paper proposes a solution to the domain identification problem by finding keywords or key terms that are representative of the page's content through the elements like <;META>; and <;TITLE>; in the HTML structure of the webpage [11]. This paper proposes a two-step framework that automatically first identifies the domain of the specified web page and with the thus obtained domain information, classifies the web content according to the different prespecified categories. The former uses the various HTML elements present in the web page while the latter is achieved using Artificial Neural Networks (ANN).","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"78 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":"114793087","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}

{"title":"On challenges and opportunities in second wave of ICT revolution for south Asian countries","authors":"S. Aggarwal, S. K. Tomar, A. Aggarwal","doi":"10.1109/PDGC.2012.6449888","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449888","url":null,"abstract":"During the last three decades Information and Communication Technology (ICT) has expended itself in an exponential manner and made it possible to access right information at right time by an individual organization or culture. Structure of ICT market has been changed completely by digitization and competition. Third generation cellular, WiMAX, cable and fiber infrastructure etc. are passing through rapid technological innovations. Further Asian countries hold only two percent of world's income but accommodates about one fourth of the world's population out of which about half are below poverty level. ICT revolution in these countries has gained momentum but still many communities have almost nil access to the value added information. In this paper challenges and opportunities in ICT implementation to various field in south Asian countries have been investigated with an emphasis on ICT revolution and its applications in agriculture, Health care and Medical, Traffic Management, Electricity and Power management, School Education and Police force.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"85 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":"116733225","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}

{"title":"Comparative performance analysis of routing protocols in mobile ad hoc networks under JellyFish attack","authors":"M. Wazid, V. Kumar, R. Goudar","doi":"10.1109/PDGC.2012.6449807","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449807","url":null,"abstract":"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.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"90 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":"115857441","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}

{"title":"A complete, efficient and lightweight cryptography solution for resource contrainst Mobile Ad-Hoc Networks","authors":"A. Kumar, K. Gopal, A. Aggarwal","doi":"10.1109/PDGC.2012.6449935","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449935","url":null,"abstract":"This paper examines the lightweight cryptography primitives and proposes a novel integration mechanism of primitives to provide complete cryptography services for resource constraint Mobile Ad-Hoc Networks (MANETs). In this work, Tseng's protocol is modified to integrate primitives [30]. In order to evaluate the performance of secure MANETs, software; throughput, jitter & end to end delay; and hardware parameters; area consumption in terms of gate equivalents (GE); are taken into consideration. An integration proposal of these cryptography primitives has been proposed and it has been observed that these primitives can be clubbed with hardware cost of 36.5% of the total GE with maximum through and minimum delay using Destination Sequenced Distance Vector (DSDV) protocol.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"17 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":"116086154","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}

{"title":"High throughput compression of floating point numbers on graphical processing units","authors":"A. Padyana, C. D. Sudheer, P. K. Baruah, A. Srinivasan","doi":"10.1109/PDGC.2012.6449838","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449838","url":null,"abstract":"Compute-intensive tasks in high-end high performance computing (HPC) systems often generate large amounts of data, especially floating-point data, that need to be transmitted over the network. Although computation speeds are very high, the overall performance of these applications is affected by the data transfer overhead. Moreover, as data sets are growing in size rapidly, bandwidth limitations pose a serious bottleneck in several scientific applications. Fast floating point compression can ameliorate the bandwidth limitations. If data is compressed well, then the amount of data transfer is reduced. This reduction in data transfer time comes at the expense of the increased computation required by compression and decompression. It is important for compression and decompression rates to be greater than the network bandwidth; otherwise, it will be faster to transmit uncompressed data directly. Accelerators such as Graphics Processing Units (GPU) provide much computational power. In this paper, we show that the computational power of GPUs can be harnessed to provide sufficiently fast compression and decompression for this approach to be effective for data produced by many practical applications. In particularly, we use Holt's Exponential smoothing algorithm from time series analysis, and encode the difference between its predictions and the actual data. This yields a lossless compression scheme. We show that it can be implemented efficiently on GPUs to provide an effective compression scheme for the purpose of saving on data transfer overheads. The primary contribution of this work lies in demonstrating the potential of floating point compression in reducing the I/O bandwidth bottleneck on modern hardware for important classes of scientific applications.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"140 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":"123316171","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}

{"title":"Adaptive Lagrangean Clustering Protocol","authors":"R. Tandon, B. Dey, Sukumar Nandi","doi":"10.1109/PDGC.2012.6449798","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449798","url":null,"abstract":"A Wireless Sensor Network is a distributed network of sensor nodes deployed in order to monitor physical or environmental conditions. One of the major challenges in the deployment of wireless sensor networks is the efficient usage of the sensor nodes' limited energy. In this paper we propose a novel clustering protocol for homogeneous wireless sensor networks. The clustering protocol, Adaptive Lagrangean Clustering Protocol (ALCP), is a hybrid scheme. The protocol consists of a centralized and a distributed phase for cluster formation. It considers residual energy of sensor nodes for the election of cluster heads. The problem of cluster head election is modeled as a facility location problem. Lagrangean Surrogate heuristic is used as a solution to the problem. For energy efficient propagation of messages to Base Station hierarchical clustering is done. ALCP outperforms existing protocols in terms of network lifetime and energy distribution.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"72 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":"121612511","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}