2010 IEEE 2nd International Advance Computing Conference (IACC)最新文献

筛选
英文 中文
A new approach on co-ordinate based routing protocol for mobile networks 移动网络中基于坐标路由协议的一种新方法
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423016
P. Thakurta, R. Poddar, Subhansu Bandyopadhyay
{"title":"A new approach on co-ordinate based routing protocol for mobile networks","authors":"P. Thakurta, R. Poddar, Subhansu Bandyopadhyay","doi":"10.1109/IADCC.2010.5423016","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423016","url":null,"abstract":"A new dynamic routing protocol (CSTR) for mobile networks is proposed in this paper. The rules for mapping between cell number and corresponding co-ordinates are discussed. The routing protocol has been formulated with the help of a tree structure generated inter-alia. All possible routing paths could also be enumerated in a simple manner. This method is simpler than other techniques reported so far. The simulation study confirms routing path analysis for destination nodes.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"480 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129733599","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
Improved k-medoids clustering based on cluster validity index and object density 基于聚类有效性指标和目标密度的改进k-medoids聚类
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5422924
B. Pardeshi, Durga Toshniwal
{"title":"Improved k-medoids clustering based on cluster validity index and object density","authors":"B. Pardeshi, Durga Toshniwal","doi":"10.1109/IADCC.2010.5422924","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422924","url":null,"abstract":"Clustering is the process of classifying objects in to different groups by partitioning sets of data into a series of subsets called clusters. Clustering has taken its roots from algorithms like k-means and k-medoids. However conventional k-medoids clustering algorithm suffers from many limitations. Firstly, it needs to have prior knowledge about the number of cluster parameter k. Secondly, it also initially needs to make random selection of k representative objects and if these initial k medoids are not selected properly then natural cluster may not be obtained. Thirdly, it is also sensitive to the order of input dataset. First limitation was removed by using cluster validity index. Aiming at the second and third limitations of conventional k-medoids, we have proposed an improved k-medoids algorithm. In this work instead of random selection of initial k objects as medoids we have proposed a new technique for the initial representative object selection. The approach is based on density of objects. We find out set of objects which are densely populated and choose medoids from each of this obtained set. These k data objects selected as initial medoids are further used in clustering process. The validity of the proposed algorithm has been proved using iris and diet structure dataset to find the natural clusters in this datasets.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129001378","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}
引用次数: 21
Tamperproof watermarking of 3D models using hausdorff distance 基于豪斯多夫距离的三维模型防篡改水印
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423040
M. Motwani, B. Sridharan, R. Motwani, F. Harris
{"title":"Tamperproof watermarking of 3D models using hausdorff distance","authors":"M. Motwani, B. Sridharan, R. Motwani, F. Harris","doi":"10.1109/IADCC.2010.5423040","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423040","url":null,"abstract":"This paper describes a novel algorithm for tamperproof watermarking of 3D models. Fragile watermarking is used to detect any kind of tamper i.e. unauthorized modifications in the model. The best and the simplest way to do this is by inserting a watermark at each and every vertex of the model. This poses as a challenge as insertion of watermark in every vertex can cause perceptible distortion and inserting such a watermark is computationally expensive. The challenge of perceptible distortion is overcome by using a measure that controls perceptible distortional called the hausdorff distance. Thus, the objective of the Genetic Algorithm is to minimize the hausdorff distance between the 2 ring neighbourhood of the original and the watermarked vertex. The other challenge of time complexity is overcome by running the Genetic Algorithm for just 20 generations and causing it to converge prematurely. This significantly reduces the computational cost. The experimental results indicate that the algorithm effectively detects any distortion in model.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124009608","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
A mathematical model for crawler revisit frequency 爬虫重访频率的数学模型
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5422936
A. Dixit, A. Sharma
{"title":"A mathematical model for crawler revisit frequency","authors":"A. Dixit, A. Sharma","doi":"10.1109/IADCC.2010.5422936","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422936","url":null,"abstract":"WWW's expansion coupled with high change frequency of web pages poses a challenge for maintaining and fetching up-to-date information. The traditional crawling methods are no longer catch up with this updating and growing web. Alternative distributed crawling scheme that uses migrating crawlers try to maximize the network utilization by minimizing the network load but are hampered due to the deficiency in their web page refresh techniques. The absence of effective measures to verify whether a web page has been changed or not is another challenge. In this paper, an efficient approach for computing revisit frequency is being proposed. Web pages which frequently undergo up-dation are detected and accordingly revisit frequency for the pages is dynamically computed.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114554288","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}
引用次数: 15
Fuzzy logic based effective bidding range computation and bidder's behavior estimation in keyword auctions 基于模糊逻辑的关键词拍卖有效竞价范围计算与竞价人行为估计
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5422937
Madhu Kumari, K. K. Bharadwaj
{"title":"Fuzzy logic based effective bidding range computation and bidder's behavior estimation in keyword auctions","authors":"Madhu Kumari, K. K. Bharadwaj","doi":"10.1109/IADCC.2010.5422937","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422937","url":null,"abstract":"Keyword auctions are being used to sell the positions along the side of organic results shown by search engine when user types a keyword or a query related to keyword in a search engine. It has been a huge revenue generating arena for search engines since last decade. Irrespective of the great success of these types of auctions there are certain research issues which are still in inchoate state and needs urgent attention of research communities e.g. how much a naive bidder should bid without referring to any complex agents, how much he/she will be minimally charged for the participation etc. In this paper we propose a novel scheme to compute effective bidding range based on fuzzy logic which has threefold advantages. Firstly, it provides bidders with the information of his effective range of bids which can ensure his chances of participation and winning. Secondly, it provides auctioneer with the information about bidders bidding behavior which can help in predicting their revenues and lastly it can enforce the minimum reservation prices in natural way. Experimental results are presented to illustrate working of the proposed scheme.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116263364","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
Handling imprecision in inputs using fuzzy logic to predict effort in software development 使用模糊逻辑来处理输入中的不精确,以预测软件开发中的工作量
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5422889
H. Verma, Vishal Sharma
{"title":"Handling imprecision in inputs using fuzzy logic to predict effort in software development","authors":"H. Verma, Vishal Sharma","doi":"10.1109/IADCC.2010.5422889","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422889","url":null,"abstract":"Accurate, precise and reliable estimates of effort at early stages of project development holds great significance for the industry to meet the competitive demands of today's world. The inherent imprecision present in the inputs of the algorithmic models like Constructive Cost Model (COCOMO) yields imprecision in the output, resulting in erroneous effort estimation. The development of software is characterized by parameters that possess certain level of fuzziness which requires that some degree of uncertainty be introduced in the models, in order to make the models realistic. Fuzzy logic based cost estimation models enable linguistic representation of the input and output of a model to address the vagueness and imprecision in the inputs, to make reliable and accurate estimates of effort. In this paper, we present an enhanced fuzzy logic based framework for software development effort prediction. The intermediate COCOMO is extended in the proposed study by incorporating the concept of fuzziness into the measurements of size, mode of development for projects and the cost drivers contributing to the overall development effort. The said framework tolerates imprecision, incorporates experts knowledge, explains prediction rationale through rules, offers transparency in the prediction system, and could adapt to changing environments with the availability of new data.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134085378","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}
引用次数: 28
Untyped Aspect Calculus : Formal theory of aspect-oriented programming languages 无类型方面演算:面向方面编程语言的形式化理论
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423012
D. Gopalani, Mahesh Chandra Govil
{"title":"Untyped Aspect Calculus : Formal theory of aspect-oriented programming languages","authors":"D. Gopalani, Mahesh Chandra Govil","doi":"10.1109/IADCC.2010.5423012","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423012","url":null,"abstract":"The Object Calculi proposed by Abadi and Cardelli, treat objects as primitive constructs and define operations on these objects directly. This approach used by the object calculi overcomes the problem of complex encoding of objects as functions. The object calculi do not provide the direct support for aspects and its related concepts. We propose a calculus which provides direct support for aspects and other construct of Aspect-oriented programming paradigm. Our proposed calculus is an extension to the Untyped Imperative Object Calculus which is a part of the family of object calculi. We have worked upon the syntax and operational semantics of the proposed Untyped Aspect Calculus. The paper discusses the syntax and operational semantics of the calculus. Interpreter for the calculus is also designed and implemented and the same is discussed in the paper.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130823697","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}
引用次数: 2
A revitalized interprocedural slicing in the presence of derived and user defined data types 在存在派生数据类型和用户定义数据类型的情况下,重新启用了过程间切片
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423038
S. Pani, M. Mohanty
{"title":"A revitalized interprocedural slicing in the presence of derived and user defined data types","authors":"S. Pani, M. Mohanty","doi":"10.1109/IADCC.2010.5423038","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423038","url":null,"abstract":"We propose an innovative approach for handling dynamic memory, arrays, pointers, structures and union by interprocedural dynamic slicing technique which combines the basic techniques from past and current trends of dynamic interprocedural slicing. At first an improved algorithm for interprocedural dynamic slicing in the presence of derived and user defined data type is given. Secondly the dynamic slices for different derived and user defined data types used in the respective programs are obtained. The proposed extended interprocedural dynamic slicing algorithm is more efficient then the existing algorithm as it gives a detailed idea about the slices that can be obtained for one dimensional pointers, two dimensional pointer, pointer and arrays, dynamic memory allocation, structures and union. The illustrations are given with the programs for the proof of correctness of the proposed algorithm.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131664954","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
Impact of coordinator mobility on the throughput in a ZigBee mesh networks ZigBee网状网络中协调器移动性对吞吐量的影响
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5422995
Harsh Dhaka, Atishay Jain, Karun Verma
{"title":"Impact of coordinator mobility on the throughput in a ZigBee mesh networks","authors":"Harsh Dhaka, Atishay Jain, Karun Verma","doi":"10.1109/IADCC.2010.5422995","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422995","url":null,"abstract":"Zigbee (IEEE 802.15.4) standard interconnects simple, low power and low processing capability wireless devices. The Zigbee devices facilitate numerous applications such as pervasive computing, national security, monitoring and control etc. An effective positioning of nodes in a ZigBee network is particularly important in improving the performance (e.g., throughput) of ZigBee networks. In the wireless sensor network (WSN) literature, the use of a mobile sink is often recommended as an effective defense against the so-called hot-spot phenomenon. But the effects of mobile coordinator on the performance of the network are not given due consideration. In this paper, we perform extensive evaluation, using OPNET Modeler, to study the impact of coordinator mobility on ZigBee mesh network. The results show that the ZigBee mesh routing algorithm exhibits significant performance difference when the router are placed at different locations and the trajectories of coordinator are varied. We also show that the status of ACK in the packet also plays a critical role in deciding network performances.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"228 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133734014","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}
引用次数: 38
Out-of-core assessment of clustering tendency for large data sets 大型数据集聚类倾向的核外评估
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423044
M. K. Pakhira
{"title":"Out-of-core assessment of clustering tendency for large data sets","authors":"M. K. Pakhira","doi":"10.1109/IADCC.2010.5423044","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423044","url":null,"abstract":"Determining the number of clusters present in a data set automatically is a very important problem. Conventional clustering techniques assume a certain number of clusters, and then try to find out the possible cluster structure associated to the above number. For very large and complex data sets it is not easy to guess this number of clusters. There exists validity based clustering techniques, which measure a certain cluster validity measure of a certain clustering result by varying the number of clusters. After doing this for a broad range of possible number of clusters, this method selects the number for which the validity measure is optimum. This method is, however, awkward and may not always be applicable for very large data sets. Recently an interesting visual technique for determining clustering tendency has been developed. This new technique is called VAT in abbreviation. The original VAT and its different versions are found to determine the number of clusters, before actually applying any clustering algorithm, very satisfactorily. In this paper, we have proposed an out-of-core VAT algorithm (o-VAT) for very large data sets.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129558529","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信