2014 Seventh International Conference on Contemporary Computing (IC3)最新文献_第7页

Learning domain-specific and domain-independent opinion oriented lexicons using multiple domain knowledge 使用多个领域知识学习特定于领域和独立于领域的面向意见的词汇

2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897193

K. S. Vishnu, T. Apoorva, Deepa Gupta

引用次数: 11

A free and open source framework for rural education 免费开源的农村教育框架

2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897147

V. Rekha, V. Adinarayanan

引用次数: 3

Selecting and formalizing an architectural style: A comparative study 建筑风格的选择和形式化:比较研究

2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897201

A. Dwivedi, S. K. Rath

引用次数: 8

Performance evaluation of long integer multiplication using OpenMP and MPI on shared memory architecture 基于OpenMP和MPI的长整数乘法在共享内存架构下的性能评价

2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897187

Jitendra V. Tembhurne, S. Sathe

{"title":"Performance evaluation of long integer multiplication using OpenMP and MPI on shared memory architecture","authors":"Jitendra V. Tembhurne, S. Sathe","doi":"10.1109/IC3.2014.6897187","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897187","url":null,"abstract":"Multiplying long integers is an operation that has many applications in Computational Science and arbitrary arithmetic computation. Many cryptographic algorithms such as Diffe-Hellman key exchange [1], RSA, ECC and etc. require operations on very large subsets of the integer numbers. These algorithms use security key size of 1024 bits and more for secure message encryption, decryption and, key exchange. To perform encryption, decryption and key exchange we are required to perform a series of exponentiation and multiplication operations. In this paper, we propose the parallel multiplication algorithms for long integers on multiple core processors using parallel programming languages such as OpenMP and MPI. The OpenMP and MPI are most common parallel languages for programming and provide different performances characteristics. We also target to analyze and compare the OpenMP and MPI implementations on multi-core processors. The new proposed parallel algorithm achieves better performance than the basic serial implementations. The achieved speedup by OpenMP and MPI on serial implementation are 12.62x and 10.72x using school-book, 49.95x and 37.26x using Karatsuba on school-book, 66.11x and 31.47x using Toom-Cook on school-book. We have observed, as bit-length are increased the parallel algorithms exhibits better speedup performance on utilizing more cores available.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126645538","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}

引用次数: 6

A high payload audio watermarking algorithm robust against Mp3 compression 一种抗Mp3压缩的高有效载荷音频水印算法

2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897229

A. Kaur, M. Dutta, K. M. Soni, Nidhi Taneja

引用次数: 16

Selecting a set of appropriate metrics for detecting code clones 选择一组适当的度量来检测代码克隆

2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897221

Geetika Bansal, Rajkumar Tekchandani

引用次数: 8

Automatic construction of process template from business rule 从业务规则自动构造流程模板

2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897210

D. Sharma, N. Prakash, H. Sharma, Dheerendra Singh

引用次数: 5

A two warehouse inventory model with non- instantaneous deterioration and partial backlogging 具有非瞬时劣化和部分积压的两仓库库存模型

2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897212

S. Singh, H. Rathore

引用次数: 2

Reference broadcast synchronization-based prevention to DoS attacks in VANET 参考VANET中基于广播同步的DoS攻击防护

2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897185

K. Verma, H. Hasbullah, Hemant Kumar Saini

{"title":"Reference broadcast synchronization-based prevention to DoS attacks in VANET","authors":"K. Verma, H. Hasbullah, Hemant Kumar Saini","doi":"10.1109/IC3.2014.6897185","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897185","url":null,"abstract":"Vehicular Ad-hoc Networks (VANET) has suffered from many risks in the past, like security privilege and mode of authentication by many attackers/hackers because they were trying to disturb the network and break communication services for their personal interest. The series of attacks that have broken the secured communication are network jammer, source sink attackand these attacks are called as denial of service (DoS) attacks. A novel model for prevention of DoS attacks in VANET is proposed and named as RBS protocol. The proposed model is based on the master chock filter concept for filtration of packets during busy traffic and other attacks. The protocol was also evaluated by the other two methods, which are blocking the source IP originator by the DoS attacks and checking the prevention of TCP/UDP flooding and IP sniffing attacks. The evaluation of the protocol was based on the mobility node's interaction and utilization of bandwidth. The experimental results were performed on the highway transportation condition. The RBS protocol results showed that the packet delivery ratio, throughput, time delayhas improved as compared to IP-trackback protocol.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116869348","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

Hierarchical map-based location service for VANETs in urban environments 城市环境中VANETs的分层地图定位服务

2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-08-01 DOI: 10.1109/IC3.2014.6897173

A. Garg, Kavita Pandey, Buddha Singh

{"title":"Hierarchical map-based location service for VANETs in urban environments","authors":"A. Garg, Kavita Pandey, Buddha Singh","doi":"10.1109/IC3.2014.6897173","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897173","url":null,"abstract":"Vehicular Ad-hoc Network is gaining the attention of researchers because of the technological advancements for developing an Intelligent Transportation System (ITS). The dynamic nature of vehicles (nodes) leads to frequent path breaks and network fragmentation. Therefore, routing has become a critical issue in inter-vehicle communication. Location management in VANETs is considered as a critical issue in position based routing protocol. For this purpose we have proposed novel distributed map-based location service scheme that uses mobility pattern and density of the vehicles in the region. In the proposed location service mechanism, the geographical region is divided into segments and each segment is further fragmented into cells. For exchanging the routing information among vehicles across network, the location of destination node should be discovered within the cell. In case the destination is not discovered in the cell, the request for location search migrates to the segment. The information extracts from the digital map database helps to select location server in high traffic point regions in the entire area. The location service uses minimum speed aware policy to select location server at high traffic density waypoint and dynamic location updates are sent to location server based on threshold distance. In order to reduce the location discovery delay, adjacent level hierarchy is used for location query sent by the location servers. Simulation results obtained with different scenarios are used to demonstrate the performance of HLS, EMBL and HMLS in terms of location query answer and location update strategy. Simulation results show that HMLS achieve outperforms others in urban environments.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123305873","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}

引用次数: 13