发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
Clustering homogeneous XML documents using weighted similarities on XML attributes 使用XML属性的加权相似度对同构XML文档进行聚类
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5422926
N. K. Nagwani, A. Bhansali
{"title":"Clustering homogeneous XML documents using weighted similarities on XML attributes","authors":"N. K. Nagwani, A. Bhansali","doi":"10.1109/IADCC.2010.5422926","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422926","url":null,"abstract":"XML (eXtensible Markup Language) have been adopted by number of software vendors today, it became the standard for data interchange over the web and is platform and application independent also. A XML document is consists of number of attributes like document data, structure and style sheet etc. Clustering is method of creating groups of similar objects. In this paper a weighted similarity measurement approach for detecting the similarity between the homogeneous xml documents is suggested. Using this similarity measurement a new clustering technique is also proposed. The method of calculating similarity of document's structure and styling is given by number of researchers, mostly which are based on tree edit distances. And for calculating the distance between document's contents there are number of text and other similarity techniques like cosine, jaccord, tf-idf etc. In this paper both of the similarity techniques are combined to propose a new distance measurement technique for calculating the distance between a pair of homogeneous XML documents. The proposed clustering model is implemened using open source technology java and is validated experimentally. Given a collection of XML documents distances between documents is calculated and stored in the java collections, and then these distances are used to cluster the XML documents.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"110 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":"129282185","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
Statistical evaluation of image segmentation 图像分割的统计评价
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423030
Nitin Kumar Sharma, S. Ronak, M. Nema, S. Rakshit
{"title":"Statistical evaluation of image segmentation","authors":"Nitin Kumar Sharma, S. Ronak, M. Nema, S. Rakshit","doi":"10.1109/IADCC.2010.5423030","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423030","url":null,"abstract":"Image segmentation form an important preliminary step in many high level image processing and computer vision applications. Its importance necessitates the quantitative evaluation of image segmentation results. A few methods have been developed, based on the general principals. In this paper, we propose a novel segmentation evaluation method based on region cardinality ratio and variance. It addresses the limitations in the prior methods and attempts to remove them. The results of our method are superior to the prior quantitative segmentation evaluation techniques due to the explicit usage of inter-cluster relation.","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":"130943695","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
Mining changes in purchase behavior in retail sale with products as conditional part 挖掘以产品为条件部分的零售中购买行为的变化
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423033
P. Bala
{"title":"Mining changes in purchase behavior in retail sale with products as conditional part","authors":"P. Bala","doi":"10.1109/IADCC.2010.5423033","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423033","url":null,"abstract":"Change mining gives an insight to the retailers on the changing purchase patterns of the shoppers. Purchase pattern of shoppers sometimes depends on other products purchased. Hence, conditional part of a pattern in the form of an association rule contains products. The research paper proposes an approach for change mining where conditional part may contain products or items.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"17 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":"117283977","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}
引用次数: 7
Predictive data mining model for software bug estimation using average weighted similarity 基于平均加权相似度的软件bug预测数据挖掘模型
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5422923
N. K. Nagwani, Shrish Verma
{"title":"Predictive data mining model for software bug estimation using average weighted similarity","authors":"N. K. Nagwani, Shrish Verma","doi":"10.1109/IADCC.2010.5422923","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422923","url":null,"abstract":"Software bug estimation is a very essential activity for effective and proper software project planning. All the software bug related data are kept in software bug repositories. Software bug (defect) repositories contains lot of useful informaton related to the development of a project. Data mining techniques can be applied on these repositories to discover useful intersting patterns. In this paper a prediction data mining technique is proposed to predict the software bug estimation from a software bug repository. A two step prediction model is proposed In the first step bug for which estimation is required, its summary and description is matched against the summary and description of bugs available in bug repositories. A weighted similarity model is suggested to match the summary and description for a pair of software bugs. In the second step the fix duration of all the similar bugs are calculated and stored and its average is calculated, which indicates the precicted estimation of a bug. The proposed model is implemented using open source technologies and is exaplained with the help of illustrative example.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"198 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":"115238339","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}
引用次数: 19
Fault Tolerance and energy efficient protocol for cluster communication in sensor networks 传感器网络中集群通信的容错与节能协议
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423032
A. Narendra Kumar, K. Thyagarajah, J. Anbu
{"title":"Fault Tolerance and energy efficient protocol for cluster communication in sensor networks","authors":"A. Narendra Kumar, K. Thyagarajah, J. Anbu","doi":"10.1109/IADCC.2010.5423032","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423032","url":null,"abstract":"This paper presents a clustering routing protocol for event-driven WSNs with Reduction of Reporting node in each cluster. We demonstrate that decreasing the number of reporting nodes in each cluster; increase the number of reports that need to be sent to the sink in order to achieve the energy efficient and desired information reliability. The algorithm also aims at even energy dissipation among the nodes in the network by alternating the possible routes to the Sink and autonomous selection of energy efficient cluster head. This helps to balance the load on sensor nodes while avoiding congested links at the same time. Moreover, the algorithm proposes using an energy efficient approach by choosing high energy values of a node stored in buffer table for each round. We discuss the implementation of our protocol, and present its performance evaluation through Network Simulator.","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":"130967667","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}
引用次数: 1
An extended secure data communication using blind source separation and HC-128 使用盲源分离和HC-128的扩展安全数据通信
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423009
Anil Kumar, M. Ghose, K. V. Singh
{"title":"An extended secure data communication using blind source separation and HC-128","authors":"Anil Kumar, M. Ghose, K. V. Singh","doi":"10.1109/IADCC.2010.5423009","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423009","url":null,"abstract":"This paper proposes an extended secure data communication [1] by using the concept of underdetermined BSS problem and HC-128. The purpose of the HC-128 is to generate the pseudorandom sequence, which in turn is used for encryption and specific mixing. The proposed method has high security performance. The experimental results illustrate that performance of this is highly secured.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"22 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":"129360255","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
CCAM: A comprehensive cost analysis model for Video-on-Demand system CCAM:视频点播系统的综合成本分析模型
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423020
D. Sujatha, K. Girish, Kumar Sunil, K. Venugopal, L. Patnaik
{"title":"CCAM: A comprehensive cost analysis model for Video-on-Demand system","authors":"D. Sujatha, K. Girish, Kumar Sunil, K. Venugopal, L. Patnaik","doi":"10.1109/IADCC.2010.5423020","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423020","url":null,"abstract":"This paper presents the study on the cost analysis for the Video-on-Demand (VoD) system exploiting the advantages of the Peer-to-Peer (P2P) architecture. Our objective is to tackle the problems in analyzing cost and to come up with efficient cost analysis model (CCAM) thereby enhancing the revenue to the system. We adopt a partially decentralized P2P architecture with a cluster based approach to find the probability of the requests for the videos in that cluster and to place the videos closer to the customers. The results of the simulation experiment demonstrates that most of the video requests are delivered to the customers almost immediately with a faster response-time. The results also indicate that our approach accomplishes maximum revenue with less rejection ratio and a moderate peer-load when compared to the conventional approach which uses random arrival pattern contributing a substantial revenue to the VoD system.","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":"129458851","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}
引用次数: 1
An encounter with Strong Association Rules 遇到强关联规则
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5422929
G. Bhamra, A. Verma, R. B. Patel
{"title":"An encounter with Strong Association Rules","authors":"G. Bhamra, A. Verma, R. B. Patel","doi":"10.1109/IADCC.2010.5422929","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422929","url":null,"abstract":"Data Mining (DM) is the process of automated extraction of interesting data patterns representing knowledge, from the large data sets. Frequent itemsets are the itemsets that appear in a data set frequently. Finding such frequent itemsets plays an essential role in mining associations, correlations, and many other interesting relationships among itemsets in transactional database. In this paper an algorithm, SAR (Strong Association Rule), is designed and implemented to check whether an Association Rule (AR) is strong enough or not. Apriori algorithm is also implemented to generate Frequent k-itemsets. A Binary Transactional Dataset is used for implementing the algorithm in java language.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"193 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":"131894083","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
Implementation of branch delay in Superscalar processors by reducing branch penalties 通过减少分支惩罚在超标量处理器中实现分支延迟
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423045
Rubina Khanna, S. Verma, R. Biswas, J. Singh
{"title":"Implementation of branch delay in Superscalar processors by reducing branch penalties","authors":"Rubina Khanna, S. Verma, R. Biswas, J. Singh","doi":"10.1109/IADCC.2010.5423045","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423045","url":null,"abstract":"Branch prediction is crucial to maintaining high performance in modern Superscalar processor. Today's Superscalar processors achieve high performance by executing multiple independent instructions in parallel. One of the most impedement to the performance of wide-issue superscalar processor is the presence of conditional branches. Conditional branches can occur as frequently as one in every 5 or 6 instructions, leading to heavy misprediction penalties in superscalar architectures. Ideal speed-up in superscalar processor is seldom achieved due to stalls and breaks in the execution stream. These interrupts are caused by data and control hazards which deteroits the superscalar processor performance. Branch target buffer (BTB) can reduces the performance penalty of branches in superscalar processor by predicting the path of the branch and caching information used by the branch. No stalls will be encountered if the branch entry is found in the BTB and prediction is correct. Otherwise, the penalty will be of atleast ‘2’ cycles. This paper proposes an algorithm for superscalar processor based on changing the BTB structure to eliminate the misprediction penalty. It also highlights a problem in the previous BTB algorithm (nested branches problem) and proposes a solution to it.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"68 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":"114536366","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
An agent-oriented approach to requirements engineering 面向代理的需求工程方法
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5422878
Vibha Gaur, Anuja Soni, Punam Bedi
{"title":"An agent-oriented approach to requirements engineering","authors":"Vibha Gaur, Anuja Soni, Punam Bedi","doi":"10.1109/IADCC.2010.5422878","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422878","url":null,"abstract":"The chaos all through the development of requirements evolves due to disparity between users and developers resulting in project devastations and terminations. Business and product requirements often change as development proceeds, making a straight-line path to requirements engineering impracticable. Considering the adaptable nature of requirements and multi-dimensional concerns of stakeholders, spiral model based proposed framework bridges the gap between users and developers by extending an agent oriented approach to requirements engineering. Requirements encapsulated in the form of User Story Cards signify user oriented view of requirements, whilst Agent Cards facilitate developers in observing the requirements of a system in terms of software agents. Negotiation process obtains an integrated view of all stakeholders over conflicting requirements that leads to ascertain correct, prioritized and comprehensive list of requirements.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"33 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":"114991343","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}
引用次数: 27
首页 上一页 下一页 尾页
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学术官方微信