2013 3rd IEEE International Advance Computing Conference (IACC)最新文献_第2页

EMPPC-an evolutionary model based privacy preserving technique for cloud digital data storage emppc——一种基于进化模型的云数字数据存储隐私保护技术

2013 3rd IEEE International Advance Computing Conference (IACC) Pub Date : 2013-05-13 DOI: 10.1109/IADCC.2013.6514200

D. Chandramohan, T. Vengattaraman, D. Rajaguru, R. Baskaran, P. Dhavachelvan

引用次数: 2

A novel approach for feature selection method TF-IDF in document clustering 一种新的文档聚类特征选择方法TF-IDF

2013 3rd IEEE International Advance Computing Conference (IACC) Pub Date : 2013-05-13 DOI: 10.1109/IADCC.2013.6514339

L. Patil, M. Atique

{"title":"A novel approach for feature selection method TF-IDF in document clustering","authors":"L. Patil, M. Atique","doi":"10.1109/IADCC.2013.6514339","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514339","url":null,"abstract":"Now a day, the text document is spontaneously increasing over the internet, e-mail and web pages and they are stored in the electronic database format. To arrange and browse the document it becomes difficult. To overcome such problem the document preprocessing, term selection, attribute reduction and maintaining the relationship between the important terms using background knowledge, WordNet, becomes an important parameters in data mining. In these paper the different stages are formed, firstly the document preprocessing is done by removing stop words, stemming is performed using porter stemmer algorithm, word net thesaurus is applied for maintaining relationship between the important terms, global unique words, and frequent word sets get generated, Secondly, data matrix is formed, and thirdly terms are extracted from the documents by using term selection approaches tf-idf, tf-df, and tf2 based on their minimum threshold value. Further each and every document terms gets preprocessed, where the frequency of each term within the document is counted for representation. The purpose of this approach is to reduce the attributes and find the effective term selection method using WordNet for better clustering accuracy. Experiments are evaluated on Reuters Transcription Subsets, wheat, trade, money grain, and ship.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"679 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122975028","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}

引用次数: 42

A noise robust edge detector for color images using Hilbert Transform 基于希尔伯特变换的彩色图像噪声鲁棒边缘检测器

2013 3rd IEEE International Advance Computing Conference (IACC) Pub Date : 2013-05-13 DOI: 10.1109/IADCC.2013.6514399

A. Gupta, A. Ganguly, V. Bhateja

引用次数: 19

Learning algorithms For intelligent agents based e-learning system 基于智能代理的电子学习系统的学习算法

2013 3rd IEEE International Advance Computing Conference (IACC) Pub Date : 2013-05-13 DOI: 10.1109/IADCC.2013.6514369

N. Pandey, Shashank Sahu, R. K. Tyagi, A. Dwivedi

引用次数: 10

E-business strategies to cut back cost of business enterprise 降低企业成本的电子商务策略

2013 3rd IEEE International Advance Computing Conference (IACC) Pub Date : 2013-05-13 DOI: 10.1109/IADCC.2013.6514280

A. Siddiqui, A. F. Basha

引用次数: 2

Clustering analysis in social network using Covering Based Rough Set 基于覆盖粗糙集的社交网络聚类分析

2013 3rd IEEE International Advance Computing Conference (IACC) Pub Date : 2013-05-13 DOI: 10.1109/IADCC.2013.6514272

A. Mitra, S. R. Satapathy, S. Paul

{"title":"Clustering analysis in social network using Covering Based Rough Set","authors":"A. Mitra, S. R. Satapathy, S. Paul","doi":"10.1109/IADCC.2013.6514272","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514272","url":null,"abstract":"This paper focuses on solving the problem of classification and clustering in social network by using Rough Set. When the data set consists of missing or uncertain data then the Rough set is proved to be an efficient tool. To solve a problem under the domain of social network, the problem must satisfy the fundamental property of rough set i.e., the attribute of the problem must holds true for equivalence relation. Hence, before implementing rough set to the specific problem of social network, it must be redefined in a way that properties of transitive, symmetric and reflexive should holds true. In this paper, we have studied on the concept of Fiksel's societal network and used it for redefining the social network problem in terms of equivalence relationships. Further, we had defined the Social network in terms of graph theory and mathematical relations. We had proceeded further in defining the Fiksel's societal network and social network with respect to rough set. Fiksel had defined the social network in terms of structural equivalence. We have discussed on the limitation of Rough set and observed that use of Covering Based Rough Set as an extension of Pawlak's rough set seems to be a better alternative. There are six types of covering based rough set. To keep continuity in this paper, we have mentioned about Covering based rough sets. Covering based rough set extends from partitioning in rough sets to covering of the universe and is flexible, when compared with rigid equivalence relation.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128384839","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

Write stability analysis of 8-T novel SRAM cell for high speed application 高速应用新型8-T SRAM单元的写入稳定性分析

2013 3rd IEEE International Advance Computing Conference (IACC) Pub Date : 2013-05-13 DOI: 10.1109/IADCC.2013.6514460

P. Upadhyay, S. Chhotray, R. Kar, D. Mandal, S. Ghoshal

引用次数: 5

Deterministic compressed-sensing matrix from grassmannian matrix: Application to speech processing 基于格拉斯曼矩阵的确定性压缩感知矩阵:在语音处理中的应用

2013 3rd IEEE International Advance Computing Conference (IACC) Pub Date : 2013-05-13 DOI: 10.1109/IADCC.2013.6514392

V. Abrol, Pulkit Sharma, S. Budhiraja

引用次数: 9

Finding zeros for linear phase FIR filters 寻找线性相位FIR滤波器的零点

2013 3rd IEEE International Advance Computing Conference (IACC) Pub Date : 2013-05-13 DOI: 10.1109/IADCC.2013.6514381

Priyanka, Brishbhan Singh, Panwar Shiv, Dutt Joshi, Iit Delhi

引用次数: 1

Tumbling Multilevel Channel Conflicts in Mobile Ad Hoc Networks 移动自组织网络中翻滚的多层信道冲突

2013 3rd IEEE International Advance Computing Conference (IACC) Pub Date : 2013-05-13 DOI: 10.1109/IADCC.2013.6514216

Mohamed Abd Elhamid Abbas, Husain Shahnawaz

{"title":"Tumbling Multilevel Channel Conflicts in Mobile Ad Hoc Networks","authors":"Mohamed Abd Elhamid Abbas, Husain Shahnawaz","doi":"10.1109/IADCC.2013.6514216","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514216","url":null,"abstract":"Due to the huge compulsion in which collective wireless technologies should act below an abstinent awning. Mobile Ad Hoc Networks are leaving to accomplish this mandate. Wireless technologies are abstruse in itself along with we are going to adhere them in an abstinent awning they inherited the clashes form their parental technologies and frequent additional confrontations will broaden. WiMax / UMTS infrastructure is observing for expediency of Mobile Ad Hoc Networks. The core analysis challenge in WiMax is about the anode allowance. additionally destined to deficient anode affiliate and bulky amplification in mobile consumers, the difficulty of contest free channels allocation dovetails very arrogant. Hence, the main objective of this paper is to reduce the Multilevel Channel Conflicts in Mobile Ad Hoc Networks .Channel allowance is an elementary affair of resource activity that aggregates the comprehension and extent of attendants. As dormant channel apportionment misses the heuristic applications to allot the channels to the cages. headed channel assignment behaves beneficially inferior leaden traffic. assiduous channel allowance apprise behaves inferior brightness as well as alleviated traffic. To advance the benefit of the channel chunk we try an alloyed application for channel allowance in which FCA and DCA apprises coupled will work concomitantly. The results depict that the proposed mechanism is able to allot the conflict free channels to all enclosures according to the constraint of the enclosures. This allocation is able to reduce the conflicts in multi level channels in ad hock networks. For replication we apprise only four cells clusters architecture and seven cells cluster arrangement and consequences arises that allocated channels are conflict free and based on the compatibility matrix which is allocation methodology.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"251 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121170767","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