2010 International Conference on Advances in Recent Technologies in Communication and Computing最新文献

筛选
英文 中文
An Efficient Hybrid Predictive Model to Analyze the Visiting Characteristics of Web User Using Web Usage Mining 基于Web使用挖掘的Web用户访问特征分析混合预测模型
V. Rao, V. Kumari
{"title":"An Efficient Hybrid Predictive Model to Analyze the Visiting Characteristics of Web User Using Web Usage Mining","authors":"V. Rao, V. Kumari","doi":"10.1109/ARTCOM.2010.42","DOIUrl":"https://doi.org/10.1109/ARTCOM.2010.42","url":null,"abstract":"The Web has become the world's largest knowledge repository. Web usage mining focuses on discovering the potential knowledge from the browsing patterns of users and to find the correlation between the pages. With exponential growth of web log, the conventional data mining techniques were proved to be inefficient. As web log is incremental in nature, it becomes a crucial issue to predict exactly the ways how users browse websites. It is necessary for web miners to use predictive mining techniques to extract the usage patterns and study the visiting characteristics of user. The data on the web log is heterogeneous and non scalable, hence to reduce the operation scope and increase the accuracy precision significantly an improved hybrid model is required. This paper introduces an efficient hybrid predictive model, which is a combination of Markov model and Bayesian theorem. This two stage predictive model to enables the web miner to identify and analyze web user navigation patterns. In this model, the Markov model helps to reduce the operations scope by filtering possible categories and Bayesian theorem improves accuracy in predicting the web pages in identified category. To validate the proposed prediction model, several experiments were conducted and results proven this are claimed in this paper.","PeriodicalId":398854,"journal":{"name":"2010 International Conference on Advances in Recent Technologies in Communication and Computing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126875490","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
Image Encryption Using Discrete Fractional Transforms 使用离散分数阶变换的图像加密
N. Jindal, Kulbir Singh
{"title":"Image Encryption Using Discrete Fractional Transforms","authors":"N. Jindal, Kulbir Singh","doi":"10.1109/ARTCOM.2010.9","DOIUrl":"https://doi.org/10.1109/ARTCOM.2010.9","url":null,"abstract":"Digital images play an important role, both in daily life applications such as satellite television, magnetic resonance imaging, computer tomography as well as in the areas of engineering, research and technology. So, image security is an important part and issue in information exchange. In this paper, we present encryption of images using discrete fractional transform techniques, discrete fractional fourier transform (DFrFT), discrete fractional cosine transform (DFrCT). These techniques uses cascaded multi stages of discrete fractional fourier transforms with a random phase mask (RPM) at each stage. In decryption, at receiver all the keys and RPM should correctly known to user. Numerical simulations are presented for sensitivity of keys and their effect on mean square error (MSE).","PeriodicalId":398854,"journal":{"name":"2010 International Conference on Advances in Recent Technologies in Communication and Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126109730","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}
引用次数: 8
Segmentation and Characterization of Breast Tumor in Mammograms 乳腺肿瘤在乳房x光片上的分割与表征
Laxman Singh, Z. Jaffery, Z. Zaheeruddin, R. Singh
{"title":"Segmentation and Characterization of Breast Tumor in Mammograms","authors":"Laxman Singh, Z. Jaffery, Z. Zaheeruddin, R. Singh","doi":"10.1109/ARTCOM.2010.60","DOIUrl":"https://doi.org/10.1109/ARTCOM.2010.60","url":null,"abstract":"The objective of this paper is to present a novel approach for the segmentation and characterization of breast tumor. The authors have developed an efficient tumor segmentation technique using conventional Ostu thresholding method aided by morphological reconstruction filtering technique. The parameters extracted are area, major and minor axis length, eccentricity, solidity, average gray level, standard deviation, and entropy. This method is simple, fast and versatile. This can be applied for the segmentation of all types of breast tumor irrespective of their size. The proposed technique has been implemented on MATLAB 7.3 and results are compared with the existing techniques such as standard Ostu thresholding method and region growing method proposed by Zucker. The simulated result shows that the performance of the proposed technique is better than that of existing techniques.","PeriodicalId":398854,"journal":{"name":"2010 International Conference on Advances in Recent Technologies in Communication and Computing","volume":"2004 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125803810","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
Performance Measurements and Analysis of M/M/c Queuing Model Based SIP Proxy Servers in Local and Wide Area Networks 基于M/M/c排队模型的局域和广域网SIP代理服务器性能测量与分析
Sureshkumar V. Subramanian, R. Dutta
{"title":"Performance Measurements and Analysis of M/M/c Queuing Model Based SIP Proxy Servers in Local and Wide Area Networks","authors":"Sureshkumar V. Subramanian, R. Dutta","doi":"10.1109/ARTCOM.2010.91","DOIUrl":"https://doi.org/10.1109/ARTCOM.2010.91","url":null,"abstract":"In recent years, Internet Protocol (IP) telephony is becoming popular because it offers more flexibility in the implementation of new features and services. Session Initiation Protocol (SIP) is a peer-to-peer, multimedia signaling protocol standardized by the Internet Engineering Task Force (IETF) plays a vital role in providing services to IP telephony. SIP is ASCII-based, resembling HTTP, and reuses existing IP protocols such as Domain Name Service (DNS), Real Time Protocol (RTP), Session Description Protocol (SDP) etc. to provide media setup and teardown. The SIP Proxy Server (SPS) is a software application that provides call routing services for the SIP based IP telephony network. The efficiency of this process can create large scale, highly reliable packet voice networks for service providers and enterprises. We established that the efficient design and implementation of the SPS architecture can enhance the performance characteristics of a SPS significantly. In this paper, we studied the SPS performance that can be characterized by its transaction states of each SIP session of a $M/M/c$ based SIP proxy server performance model in Local and Wide Area Networks.","PeriodicalId":398854,"journal":{"name":"2010 International Conference on Advances in Recent Technologies in Communication and Computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130189229","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
Asymmetrical Positive Feedback Adiabatic Logic for Low Power and Higher Frequency 低功率高频非对称正反馈绝热逻辑
V. S. K. Bhaaskaran
{"title":"Asymmetrical Positive Feedback Adiabatic Logic for Low Power and Higher Frequency","authors":"V. S. K. Bhaaskaran","doi":"10.1109/ARTCOM.2010.74","DOIUrl":"https://doi.org/10.1109/ARTCOM.2010.74","url":null,"abstract":"This paper presents the quasi-adiabatic Asymmetrical Positive Feedback Adiabatic Logic (APFAL) for low power operation through energy recovery technique. The topology of a logic gate defines the logic effort and it determines the gate sensitivity. The APFAL strives to reduce the logic effort of one arm of the 2N2P latch which results in reduced values of adiabatic and non-adiabatic power components. The use of asymmetric complementary functional blocks in the sense-amplifier structure achieves this. Furthermore, the APFAL incurs reduced transients and minimized floating node problems. It is a diode-free and dual rail logic offering both the true and complementary outputs. It achieves significant reduction in switched capacitance resulting in faster response. Efficient energy recovery is achieved for frequency range of up to 500 MHz. The need for reduced interconnects and realization of less leakage are the added advantages. Validation is done through full-custom designed arithmetic circuits. Comparison with static CMOS and PFAL circuits are made to validate the design. In post-layout simulations, the 8-bit APFAL multiplier achieves an adiabatic gain of 14.91 at 100 MHz to 6.45 at 500 MHz against the static CMOS counterpart. Energy savings of 27% and 22.5% are achieved against the optimized PFAL 4-bit CLA and 8-bit multiplier equivalent circuits respectively, at 500 MHz.","PeriodicalId":398854,"journal":{"name":"2010 International Conference on Advances in Recent Technologies in Communication and Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121960796","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
Image Compression Using PCA and Improved Technique with MLP Neural Network 基于PCA和MLP神经网络改进技术的图像压缩
Vilas H. Gaidhane, Vijander Singh, Mahendra Kumar
{"title":"Image Compression Using PCA and Improved Technique with MLP Neural Network","authors":"Vilas H. Gaidhane, Vijander Singh, Mahendra Kumar","doi":"10.1109/ARTCOM.2010.15","DOIUrl":"https://doi.org/10.1109/ARTCOM.2010.15","url":null,"abstract":"Computer images consist of large data and hence require more space to store in the memory. The compressed image requires less storing space of memory and less time to transmit. In this paper, feed forward back propagation neural network method with PCA technique is used for image compression. It is found that the results using PCA techniques are not satisfactory. To improve these results author suggest another technique which has better results. The Artificial Neural Network (ANN) used in these technique is trained by considering the different numbers of hidden neurons, epoch and reconstructed image compared with original image.","PeriodicalId":398854,"journal":{"name":"2010 International Conference on Advances in Recent Technologies in Communication and Computing","volume":"63 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113977262","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}
引用次数: 32
Performance Analysis of UMTS and WLAN Interworking with Multi-service Load 多业务负载下UMTS与WLAN互通的性能分析
K. Saravanan, G. Sivaradje
{"title":"Performance Analysis of UMTS and WLAN Interworking with Multi-service Load","authors":"K. Saravanan, G. Sivaradje","doi":"10.1109/ARTCOM.2010.46","DOIUrl":"https://doi.org/10.1109/ARTCOM.2010.46","url":null,"abstract":"Future generation wireless networks are expected to support multiple wireless access technologies, each with different access bandwidth and coverage range. Two of these technologies include Universal Mobile Telecommunications System (UMTS) and IEEE 802.11 Wireless Local Area Networks (WLANs). The internetworking architectures that enable interoperability between 3G (UMTS) and WLAN networks was done by connecting them at the Gateway GPRS Supporting Node (GGSN) node and evaluated via simulations using OPNET. In the GGSN integration, whenever a MN in a WLAN network wants to communicate with User Equipment (UE) in the UMTS network, it does so through the GGSN node. The UE in the UMTS network first activates the Packet Data Protocol (PDP) context that it wants to use. This operation makes the UE known to its GGSN and to external data networks, in this case, the WLAN network. Various simulations are done to measure the various application delays involved when users directly communicate across the UMTS-WLAN networks without actually accessing any external data networks. The performance evaluations on the various interworking architectures are done and the delays and other parameters involved when user data is exchanged across the UMTS and WLAN will be compared. The application types used included: FTP, HTTP and VOIP. The parameters measured include load, throughput end-to-end packet delay, file download response time, HTTP page response time.","PeriodicalId":398854,"journal":{"name":"2010 International Conference on Advances in Recent Technologies in Communication and Computing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114316203","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
Sign-Regressor Wilcoxon and Sign-Sign Wilcoxon Sign-Regressor Wilcoxon和Sign-Sign Wilcoxon
U. K. Sahoo, G. Panda, B. Mulgrew
{"title":"Sign-Regressor Wilcoxon and Sign-Sign Wilcoxon","authors":"U. K. Sahoo, G. Panda, B. Mulgrew","doi":"10.1109/ARTCOM.2010.37","DOIUrl":"https://doi.org/10.1109/ARTCOM.2010.37","url":null,"abstract":"It is known that sign LMS and sign regressor LMS are faster than LMS. Inspiring from this idea we have proposed sign regressor Wilcoxon and sign-sign wilcoxon which are robust against the outlier present in the desired data and also faster than Wilcoxon and sign Wilcoxon norm. It had applied to varities of linear and nonlinear system identification problems with Gaussian noise and impulse noise present in the desired. The simulation results are compared among Wilcoxon, sign Wilcoxon and proposed sign-sign Wilcoxon and sign-regressor Wilcoxon. From simulation results it has proved that the proposed techniques are robust against outlier in the desired data","PeriodicalId":398854,"journal":{"name":"2010 International Conference on Advances in Recent Technologies in Communication and Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114678694","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}
引用次数: 8
Social Semantic Retrieval and Ranking of eResources 社会语义检索与资源排序
Punam Bedi, H. Banati, Anjali Thukral
{"title":"Social Semantic Retrieval and Ranking of eResources","authors":"Punam Bedi, H. Banati, Anjali Thukral","doi":"10.1109/ARTCOM.2010.8","DOIUrl":"https://doi.org/10.1109/ARTCOM.2010.8","url":null,"abstract":"World Wide Web provides a huge collection of learning resources. However, as traditional retrieval algorithms lack the use of semantics to retrieve relevant documents, voluminous information is retrieved most of which may be irrelevant to the posted query. Due to which the learning process of a learner is slowed down. Hence, a need is felt to develop a retrieval and ranking method that produces semantically relevant web resources with information need. For this reason, the paper proposes semantically relevant retrieval and ranking of web resources that uses top N resource links returned from a search engine as seed, domain ontologies to compute semantic relevance, and data from Social Bookmarking System (SBS) to retrieve additional semantically relevant resources. Finally all retrieved resources are ranked according to the query relevancy using Vector Space Model (VSM). The proposed approach presented in this paper is elucidated in three parts: (i) a method that expands a posted query using semantic relevance by using ontologies, (ii) an algorithm to retrieve semantically relevant web resources by simulating human cognition using SBS, and (iii) a new approach to compute social semantic ranking of retrieved web resources. Thus it utilizes collective advantages of Social Bookmark Tagging System and Semantic technologies. Improvement in results obtained by the proposed approach in contrast to the existing results retrieved by search engine is apparent from empirical evaluation.","PeriodicalId":398854,"journal":{"name":"2010 International Conference on Advances in Recent Technologies in Communication and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128793349","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
MPG-TAR: Mobile Process Groups Based Trust Aware Routing Protocol for MANETs 基于移动进程组的manet信任感知路由协议
V. Aakanksha, Pumam Bedi
{"title":"MPG-TAR: Mobile Process Groups Based Trust Aware Routing Protocol for MANETs","authors":"V. Aakanksha, Pumam Bedi","doi":"10.1109/ARTCOM.2010.18","DOIUrl":"https://doi.org/10.1109/ARTCOM.2010.18","url":null,"abstract":"Routing in mobile ad-hoc networks is a challenging task. This paper proposes MPG-TAR, trust-aware routing protocol based on the formation of trusted Mobile Process groups(MPG). MPG is a collection of processes or mobile nodes present in defined vicinity where they all lie within each other’s radio transmission range. The trusted MPG groups formed in MPGTAR calculate trust based on the mobility rate, membership time within a local group and the number of overlapping groups of a node. The proposed protocol continuously computes and updates the reliability, trustworthiness of a node and finds the confidence level in that node. If the node is trustworthy and reliable, the confidence in that node will be increased to trust the node for forwarding a data packet. Simulation of MPG-TAR was done using Glomosim simulator.","PeriodicalId":398854,"journal":{"name":"2010 International Conference on Advances in Recent Technologies in Communication and Computing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133661951","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
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学术官方微信