Web Usage mining, also known as Web Log mining, is an application of data mining algorithms to Web access logs to find trends and regularities in Web users' traversal patterns. The results of Web Usage Mining have been used in improving Web site design, business and marketing decision support, user profiling, and Web server system performance. Web page prediction technique is a very important research area in web technologies. Mining is useful for web path traversal pattern from web logs. This paper presents an efficient algorithm for web page prediction from large web logs visited by a user. We assign a significant weight to each page based on time spent by user on each page, visiting frequency and click event done on each page.
Web Usage mining，又称Web Log mining，是将数据挖掘算法应用到Web访问日志中，以发现Web用户遍历模式的趋势和规律。Web Usage Mining的结果已用于改进Web站点设计、业务和营销决策支持、用户分析和Web服务器系统性能。网页预测技术是Web技术中一个非常重要的研究领域。从web日志中挖掘web路径遍历模式是非常有用的。本文提出了一种从用户访问的大量网页日志中进行网页预测的有效算法。我们根据用户在每个页面上花费的时间、访问频率和在每个页面上完成的点击事件为每个页面分配重要的权重。
{"title":"An Efficient Weighted Algorithm for Web Information Retrieval System","authors":"R. Agarwal, K. Arya, S. Shekhar, Rakesh Kumar","doi":"10.1109/CICN.2011.25","DOIUrl":"https://doi.org/10.1109/CICN.2011.25","url":null,"abstract":"Web Usage mining, also known as Web Log mining, is an application of data mining algorithms to Web access logs to find trends and regularities in Web users' traversal patterns. The results of Web Usage Mining have been used in improving Web site design, business and marketing decision support, user profiling, and Web server system performance. Web page prediction technique is a very important research area in web technologies. Mining is useful for web path traversal pattern from web logs. This paper presents an efficient algorithm for web page prediction from large web logs visited by a user. We assign a significant weight to each page based on time spent by user on each page, visiting frequency and click event done on each page.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116981757","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}
Information Gain Clustering through Roulette Wheel Genetic Algorithm (IGCRWGA) is a novel heuristic used in Recommender System (RS) for solving personalization problems. In a bid to generate information on the behavior and effects of Roulette Wheel Genetic Algorithm (RWGA) in Recommender System (RS) used in personalization of cold start problem, IGCRWGA is developed and experimented upon in this work / paper. A comparison with other heuristics for personalization of cold start problem - such as Information Gain Clustering Neighbor through Bisecting K-Mean Algorithm (IGCN), Information Gain Clustering through Genetic Algorithm (GCEGA), among others -- showed that IGCRWGA produced the best recommendation for large recommendation size (i.e. greater than 30 items) since it is associated with the least Mean Absolute Error (MAE), the evaluation metric used in this work.
{"title":"Information Gain Clustering through Roulette Wheel Genetic Algorithm (IGCRWGA): A Novel Heuristic Approach for Personalisation of Cold Start Problem","authors":"Mohd Abdul Hameed, S. Ramachandram, O. Jadaan","doi":"10.1109/CICN.2011.98","DOIUrl":"https://doi.org/10.1109/CICN.2011.98","url":null,"abstract":"Information Gain Clustering through Roulette Wheel Genetic Algorithm (IGCRWGA) is a novel heuristic used in Recommender System (RS) for solving personalization problems. In a bid to generate information on the behavior and effects of Roulette Wheel Genetic Algorithm (RWGA) in Recommender System (RS) used in personalization of cold start problem, IGCRWGA is developed and experimented upon in this work / paper. A comparison with other heuristics for personalization of cold start problem - such as Information Gain Clustering Neighbor through Bisecting K-Mean Algorithm (IGCN), Information Gain Clustering through Genetic Algorithm (GCEGA), among others -- showed that IGCRWGA produced the best recommendation for large recommendation size (i.e. greater than 30 items) since it is associated with the least Mean Absolute Error (MAE), the evaluation metric used in this work.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115773119","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}
OFDM has been successfully deployed in many different radio communications systems, one of the main problems is OFDM synchronization that needs to be overcome. OFDM has many advantages in terms of resilience to fading, reflections etc. The correct OFDM synchronization enables the error rates to be kept to a minimum, whereas if the system is not accurately synchronized, then errors will result and the system will become less effective. This present Schmidl and Cox algorithm as a symbol timing synchronization algorithm for an Orthogonal Frequency Division Multiplexing (OFDM) system is implemented to make OFDM as a complete synchronization system. This algorithm is based on the preamble structure defined in IEEE 802.16d. The algorithm improves the characteristic of timing metric by adding the preamble's structure. In this method the sequences of the receiver and the second OFDM sign sequence of the long preamble are made cross-correlation. Finally the peak value is observed. Simulation results show that the timing will be more accurate when compared with other conventional approaches.
{"title":"A Symbol Timing Synchronization Algorithm for WiMAX OFDM","authors":"Smita Patil, R. Upadhyay","doi":"10.1109/CICN.2011.16","DOIUrl":"https://doi.org/10.1109/CICN.2011.16","url":null,"abstract":"OFDM has been successfully deployed in many different radio communications systems, one of the main problems is OFDM synchronization that needs to be overcome. OFDM has many advantages in terms of resilience to fading, reflections etc. The correct OFDM synchronization enables the error rates to be kept to a minimum, whereas if the system is not accurately synchronized, then errors will result and the system will become less effective. This present Schmidl and Cox algorithm as a symbol timing synchronization algorithm for an Orthogonal Frequency Division Multiplexing (OFDM) system is implemented to make OFDM as a complete synchronization system. This algorithm is based on the preamble structure defined in IEEE 802.16d. The algorithm improves the characteristic of timing metric by adding the preamble's structure. In this method the sequences of the receiver and the second OFDM sign sequence of the long preamble are made cross-correlation. Finally the peak value is observed. Simulation results show that the timing will be more accurate when compared with other conventional approaches.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114792984","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}
A node in an ad hoc network is accountable for routing the packets to neighboring nodes. This evolves trust factor among nodes on the basis of which packets are forwarded to other nodes if it is trusted and thereby furnishes a secure & reliable communication. This trust can be defined by several approaches which are based on node's behaviour, monitoring, reputation etc. In this paper, an approach is proposed to establish trust among nodes which can be evaluated by monitoring the nodes for their behaviour. The values are defined for trust is dynamic in nature and depends on the behaviour of nodes. Moreover, a table of trust is maintained by all the nodes.
{"title":"Establishment of Dynamic Trust among Nodes in Mobile Ad-Hoc Network","authors":"Radhika Saini, R. K. Gautam","doi":"10.1109/CICN.2011.73","DOIUrl":"https://doi.org/10.1109/CICN.2011.73","url":null,"abstract":"A node in an ad hoc network is accountable for routing the packets to neighboring nodes. This evolves trust factor among nodes on the basis of which packets are forwarded to other nodes if it is trusted and thereby furnishes a secure & reliable communication. This trust can be defined by several approaches which are based on node's behaviour, monitoring, reputation etc. In this paper, an approach is proposed to establish trust among nodes which can be evaluated by monitoring the nodes for their behaviour. The values are defined for trust is dynamic in nature and depends on the behaviour of nodes. Moreover, a table of trust is maintained by all the nodes.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114881358","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}
This paper presents a watermarking scheme, which is robust and can sustain almost all attack on audio file. In the proposed watermarking scheme use a robust watermark which can resist all attacks. The feature of the proposed scheme is to resist minimum mean square error (MMSE) estimation attack. In audio samples an energy efficient watermark is embedded which satisfies the power spectrum condition (PSC). In PSC compliant technique watermark's power spectrum is directly proportional to that of the original signal. The watermark satisfying PSC are proven to be most robust. Energy efficient watermarking scheme resist MMSE as much as possible. Experiments justify that the proposed scheme is inaudible and robust against various attack such as noise adding, resampling, requantization, random cropping and MP3 compression.
{"title":"Application of Energy Efficient Watermark on Audio Signal for Authentication","authors":"J. Panda, Manish Kumar","doi":"10.1109/CICN.2011.40","DOIUrl":"https://doi.org/10.1109/CICN.2011.40","url":null,"abstract":"This paper presents a watermarking scheme, which is robust and can sustain almost all attack on audio file. In the proposed watermarking scheme use a robust watermark which can resist all attacks. The feature of the proposed scheme is to resist minimum mean square error (MMSE) estimation attack. In audio samples an energy efficient watermark is embedded which satisfies the power spectrum condition (PSC). In PSC compliant technique watermark's power spectrum is directly proportional to that of the original signal. The watermark satisfying PSC are proven to be most robust. Energy efficient watermarking scheme resist MMSE as much as possible. Experiments justify that the proposed scheme is inaudible and robust against various attack such as noise adding, resampling, requantization, random cropping and MP3 compression.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126633016","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}
The bit error rate (BER) performance of the Code Division Multiple Access (CDMA) cellular system based on IS-95 standard in the presence of an additive white Gaussian noise (AWGN) and interference has been investigated in this paper. The performance is evaluated under noise and interference for the CDMA forward link. Rake receiver is used in CDMA-based (Code Division Multiple Access) systems and can combine multipath components, which are time-delayed versions of the original signal transmission. Combining is done in order to improve the signal to noise ratio at the receiver and so reduced the BER.
{"title":"BER Performance Analysis of CDMA Forward Link","authors":"T. Doshi, K. Zalawadia, U. Dalal","doi":"10.1109/CICN.2011.46","DOIUrl":"https://doi.org/10.1109/CICN.2011.46","url":null,"abstract":"The bit error rate (BER) performance of the Code Division Multiple Access (CDMA) cellular system based on IS-95 standard in the presence of an additive white Gaussian noise (AWGN) and interference has been investigated in this paper. The performance is evaluated under noise and interference for the CDMA forward link. Rake receiver is used in CDMA-based (Code Division Multiple Access) systems and can combine multipath components, which are time-delayed versions of the original signal transmission. Combining is done in order to improve the signal to noise ratio at the receiver and so reduced the BER.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123661397","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}
Owing to their inherent security problems, migrants have limited applications especially when they are more prone to misuse by some other applications, resulting in increase in the scale of threats. Nevertheless migrants are potential contributors for implementation of migrating crawlers because of their capability to move to the information resource itself. In this paper, general security objectives for migrants are identified and corresponding mechanisms for facing the identified threats have been designed.
{"title":"Security System for Migrating Crawlers","authors":"A. Dixit, A. Sharma","doi":"10.1109/CICN.2011.145","DOIUrl":"https://doi.org/10.1109/CICN.2011.145","url":null,"abstract":"Owing to their inherent security problems, migrants have limited applications especially when they are more prone to misuse by some other applications, resulting in increase in the scale of threats. Nevertheless migrants are potential contributors for implementation of migrating crawlers because of their capability to move to the information resource itself. In this paper, general security objectives for migrants are identified and corresponding mechanisms for facing the identified threats have been designed.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115049908","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}
This paper manly focus on enhancing speed performance of signed multiplication using radix-32 modified Booth algorithm and Wallace Structure. It is designed for fixed length 64x64 bit operands. 3:2and 4:2 Compressor used in Wallace tree structure accumulate partial products. Using both compressor, No. of levels has been reduced that also causes enhancing the speed of multiplier. An efficient VHDL code has been written and successfully synthesized and simulated using Xilinx ISE 9.2i and Model Sim PE Student Edition 10.2c. Proposed pipelined signed 64x64 bit multiplier using radix-32 Booth algorithm and Wallace tree structure provides less delay 1.4 ns and required 87% less number of levels in Wallace tree structure, 76% less total number of Compressor, 70% less generated partial products as compared to conventional multipliers.
本文主要研究利用改进的基数-32的Booth算法和Wallace结构来提高有符号乘法的速度性能。它是为固定长度的64x64位操作数设计的。3:2和4:2压缩机采用华莱士树形结构积累部分产品。双压缩机使用时，No。等级的降低也会导致速度倍增器的提高。利用Xilinx ISE 9.2i和Model Sim PE Student Edition 10.2c编写了高效的VHDL代码，并成功地进行了合成和仿真。与传统乘法器相比，采用基数32 Booth算法和Wallace树结构的流水线带符号64x64位乘法器的延迟减少了1.4 ns，所需的Wallace树结构层数减少了87%，压缩器总数减少了76%，生成的部分乘积减少了70%。
{"title":"High Performance Pipelined Signed 64x64-Bit Multiplier Using Radix-32 Modified Booth Algorithm and Wallace Structure","authors":"Manish Bansal, Sangeeta Nakhate, A. Somkuwar","doi":"10.1109/CICN.2011.86","DOIUrl":"https://doi.org/10.1109/CICN.2011.86","url":null,"abstract":"This paper manly focus on enhancing speed performance of signed multiplication using radix-32 modified Booth algorithm and Wallace Structure. It is designed for fixed length 64x64 bit operands. 3:2and 4:2 Compressor used in Wallace tree structure accumulate partial products. Using both compressor, No. of levels has been reduced that also causes enhancing the speed of multiplier. An efficient VHDL code has been written and successfully synthesized and simulated using Xilinx ISE 9.2i and Model Sim PE Student Edition 10.2c. Proposed pipelined signed 64x64 bit multiplier using radix-32 Booth algorithm and Wallace tree structure provides less delay 1.4 ns and required 87% less number of levels in Wallace tree structure, 76% less total number of Compressor, 70% less generated partial products as compared to conventional multipliers.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129558673","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}
Surveillance systems are aimed at providing security and for keeping a vigilant eye on all events. Such systems can be enhanced if they have the capability to capture surrounding sound and motion. Also, these systems can be made more efficient by implementing such ideas on a robot which can move from one place to another. Such a system can be used for implementing voice recognition and face recognition processes simultaneously. A limiting factor for such an embedded approach is the power consumption and cost factor. This paper introduces one such technique which is cost and power efficient and continuously captures sound and video from any system i.e. a laptop, PDA, mobile phone, desktop computer and transfers it simultaneously to any other Bluetooth enabled system in its vicinity. This paper makes use of an OMAP chip, embedded in Beagle Board to implement a live audio and video streaming approach. The Beagle Board can be attached to a line follower robot to design a moving surveillance system.
{"title":"BlueARMStreamer: A Real Time Streaming Approach","authors":"Suyash Gupta, Purshotam Chauhan, Indona Vinita Barua, Luv Shorey, Bhawna Ahuja","doi":"10.1109/CICN.2011.49","DOIUrl":"https://doi.org/10.1109/CICN.2011.49","url":null,"abstract":"Surveillance systems are aimed at providing security and for keeping a vigilant eye on all events. Such systems can be enhanced if they have the capability to capture surrounding sound and motion. Also, these systems can be made more efficient by implementing such ideas on a robot which can move from one place to another. Such a system can be used for implementing voice recognition and face recognition processes simultaneously. A limiting factor for such an embedded approach is the power consumption and cost factor. This paper introduces one such technique which is cost and power efficient and continuously captures sound and video from any system i.e. a laptop, PDA, mobile phone, desktop computer and transfers it simultaneously to any other Bluetooth enabled system in its vicinity. This paper makes use of an OMAP chip, embedded in Beagle Board to implement a live audio and video streaming approach. The Beagle Board can be attached to a line follower robot to design a moving surveillance system.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128386961","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}
We present simulation results for 192 Gb/s (16 ×12) OTDM transmission with different time delays over standard fiber G.652. The optical 192 Gb/s to 12 Gb/s demultiplexing (OTDM) is used and the results compared with 160 Gb/s to 10 Gb/s OTDM demultiplexing. The observations show the feasibility of an error free 192 Gb/s OTDM transmission with a minimum time delay of 1 ps which yields BER as low as 3.38E-89 while the minimum BER obtained at 1 ps time delay for 160 Gb/s OTDM is 1.21E-244, which is practically error free.
{"title":"192 Gb/s Transmission over 30 Km G.652 Standard Fiber Using 192-to-12 Gb/s Demultiplexer","authors":"Yugnanda Malhotra, S. Shreya","doi":"10.1109/CICN.2011.1","DOIUrl":"https://doi.org/10.1109/CICN.2011.1","url":null,"abstract":"We present simulation results for 192 Gb/s (16 ×12) OTDM transmission with different time delays over standard fiber G.652. The optical 192 Gb/s to 12 Gb/s demultiplexing (OTDM) is used and the results compared with 160 Gb/s to 10 Gb/s OTDM demultiplexing. The observations show the feasibility of an error free 192 Gb/s OTDM transmission with a minimum time delay of 1 ps which yields BER as low as 3.38E-89 while the minimum BER obtained at 1 ps time delay for 160 Gb/s OTDM is 1.21E-244, which is practically error free.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127623877","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：