2011 International Conference on Communication Systems and Network Technologies最新文献

筛选
英文 中文
Managing Security in Aspect Oriented Recommender System 面向方面推荐系统中的安全管理
Punam Bedi, Sumit Agarwal
{"title":"Managing Security in Aspect Oriented Recommender System","authors":"Punam Bedi, Sumit Agarwal","doi":"10.1109/CSNT.2011.151","DOIUrl":"https://doi.org/10.1109/CSNT.2011.151","url":null,"abstract":"Recommender systems are widely used in intelligent applications which assist users in a decision-making process to choose one item amongst a potentially overwhelming set of alternative products or services. A recommender system compares the user's profile to some reference characteristics. These characteristics may be from the information item (the content-based approach) or the user's social environment (the collaborative filtering approach) or a combination of both (Hybrid-filtering approach). Recent research shows that collaborative recommender systems are highly vulnerable to profiles injection attacks. Therefore, security mechanisms are needed for protecting the recommender systems against these attacks. Aspect Oriented Recommender System (AORS) is a proposed multi agent system (MAS) that uses the concept of Aspect Oriented Programming (AOP) for building security aspect. Implementing the security in recommender system using a conventional agent oriented approach results not only with the problem of code scattering and code tangling, but also results in weaker enforcement of security concern. In this paper, security crosscutting is handled as aspect in AORS in a modular way to remove scattering and tangling problems. The prototype of AORS has been designed and developed for a book recommender system.","PeriodicalId":294850,"journal":{"name":"2011 International Conference on Communication Systems and Network Technologies","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114117015","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}
引用次数: 18
Unsupervised Abnormal Nodes Detection in Semantic Graphs 语义图中的无监督异常节点检测
Priya S. Sajane, S. Sonavane
{"title":"Unsupervised Abnormal Nodes Detection in Semantic Graphs","authors":"Priya S. Sajane, S. Sonavane","doi":"10.1109/CSNT.2011.138","DOIUrl":"https://doi.org/10.1109/CSNT.2011.138","url":null,"abstract":"Now a days, homeland security is the most concerned issue for every country. But identification of abnormal entities in large dataset is an important problem in case of homeland security. Though there exist methods of data mining and social network analysis which focus on finding pattern or central nodes from networks or numerical datasets. But none of them make use of semantic information associated with the network. In this paper we describe an unsupervised framework to identify abnormal instances.","PeriodicalId":294850,"journal":{"name":"2011 International Conference on Communication Systems and Network Technologies","volume":"46 23","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120812539","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
Innovative Cost Effective Approach for Cell Phone Based Remote Controlled Embedded System for Irrigation 基于手机的嵌入式灌溉远程控制系统的创新方法
V. Ahmed, S. Ladhake
{"title":"Innovative Cost Effective Approach for Cell Phone Based Remote Controlled Embedded System for Irrigation","authors":"V. Ahmed, S. Ladhake","doi":"10.1109/CSNT.2011.93","DOIUrl":"https://doi.org/10.1109/CSNT.2011.93","url":null,"abstract":"This work describes the development of innovative low cost cell phone based remote control application for induction motor-pump based irrigation in agriculture. Rural areas in many states of India are plagued by frequent power cuts and abnormal voltage conditions. The developed system ensures that water is distributed to field whenever normal conditions exist based on task specified. A novel concept of miscall for specified duration has been used to reduce the operational cost of the system and for the convenience of farmers facing difficulty in typing messages. Information is exchanged in form of miscalls / message between the system and the user cell phones. The system is based on AVR ATMega32 micro-controller and includes protection against single phasing, over-current, dry running and other desirable features. DS1307 and DS18S20 are used for time and temperature measurement respectively. It is expected that system will relieve hardships of farmers relating water distribution to a great extent.","PeriodicalId":294850,"journal":{"name":"2011 International Conference on Communication Systems and Network Technologies","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115139845","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}
引用次数: 31
Comparision of Hierarchial Mixed-Size Placement Algorithms for VLSI Physical Synthesis VLSI物理合成中分层混合尺寸放置算法的比较
B. Sekhara, Babu R V C E, Rajine Swetha, Devi K A Sumithra, Dept R V
{"title":"Comparision of Hierarchial Mixed-Size Placement Algorithms for VLSI Physical Synthesis","authors":"B. Sekhara, Babu R V C E, Rajine Swetha, Devi K A Sumithra, Dept R V","doi":"10.1109/CSNT.2011.95","DOIUrl":"https://doi.org/10.1109/CSNT.2011.95","url":null,"abstract":"Placement is a physical synthesis task that transforms a block/gate/transistor-level net list into an actual layout for timing convergence. It is a crucial step that assembles the basic building blocks of logic net list and establishes the overall timing characteristic of a design by determining exact locations of circuit elements within a given region. If a design is placed poorly, it is virtually impossible to close timing, no matter how much other physical synthesis and routing optimizations are applied to it. The algorithms for solving the mixed size placement problem fall into two categories, flat and hierarchical. The strategy of flat algorithm is to view both standard cells and macro blocks as the same placement components, whose advantage is that low complexity placement algorithm, such as quadratic-based algorithm, can be used to do the placement with very high speed. The strategy of hierarchical algorithm is to do the placement through block level and cell level, and the overlaps involving macro blocks are eliminated in block level. In both levels, the number of placement components reduces considerably.","PeriodicalId":294850,"journal":{"name":"2011 International Conference on Communication Systems and Network Technologies","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123603335","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
Clustering the Data Points to Obtain Optimum Backbones for the Bounded Diameter Minimum Spanning Trees 基于数据点聚类的有界直径最小生成树的最优主干
Sakshi Arora, M. L. Garg
{"title":"Clustering the Data Points to Obtain Optimum Backbones for the Bounded Diameter Minimum Spanning Trees","authors":"Sakshi Arora, M. L. Garg","doi":"10.1109/CSNT.2011.164","DOIUrl":"https://doi.org/10.1109/CSNT.2011.164","url":null,"abstract":"Given a connected, weighted, undirected graph G containing V vertices and a bound D, the bounded diameter minimum spanning tree (BDMST) problem seeks a spanning tree on G of minimum weight among the trees in which no path between two vertices contains more than D edges. This problem is NP-hard for 4≤ D ≤ |v| -1. The current approaches that can be applied to very large instances such as OTTC and CTBC work reasonably well on instances with random edge costs, but on Euclidean instances this leads to a backbone of relatively short edges and the majority of the nodes have to be connected to this backbone via rather long edges. On the contrary, a reasonable solution for this instance, demands that the backbone should consist of a few longer edges to span the whole area to allow the large number of remaining nodes to be connected as leaves by much cheaper edges. In the present paper we introduce a new construction heuristic for the BDMST problem which is especially suited for very large Euclidean instances. It is based on modified k-means clustering that guides the Discriminatory-Randomized Greedy Heuristic (D-RGH) algorithm to find a good backbone. It maintains the diameter bound and always generates valid offspring trees besides scaling well to larger problem instances. On 25 Euclidean instances of up to 1000 vertices, the suggestedheuristic improved substantially on solutions found by the DRGH. This approach is then further refined by a local improvement method.","PeriodicalId":294850,"journal":{"name":"2011 International Conference on Communication Systems and Network Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130094104","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
Power Aware and Signal Strength Based Routing Algorithm for Mobile Ad Hoc Networks 基于功率感知和信号强度的移动Ad Hoc网络路由算法
G. Varaprasad
{"title":"Power Aware and Signal Strength Based Routing Algorithm for Mobile Ad Hoc Networks","authors":"G. Varaprasad","doi":"10.1109/CSNT.2011.34","DOIUrl":"https://doi.org/10.1109/CSNT.2011.34","url":null,"abstract":"A mobile ad hoc network is collection of mobile nodes. The mobile nodes can move freely from one place to another. In this paper, we propose a new routing algorithm for the mobile ad hoc networks to route the data packets to the destination based on the residual battery capacity and signal strength. The proposed model has simulated with the help of network simulator and has compared with the algorithms namely, MTPR and CMMBCR. The simulation results are shown that the proposed model has reached top position in terms of the network lifetime, network throughput and percentage of path reconstructions as compared to MTPR and CMMBCR models. In MTPR model, 7th node dies around 25.96% earlier than the proposed model and 4.95% before CMMBCR model. At 11th node in MTPR model will die around 96.32% prior to the proposed model and 93% against to CMMBCR model. In fact, the proposed model has reduced the number of route reconstructions by 83.86% as compared to CMMBCR model whereas MTPR model, it takes more number of path reconstructions(81.82%) than CMMBCR model if the node mobility is 10 m/sec.","PeriodicalId":294850,"journal":{"name":"2011 International Conference on Communication Systems and Network Technologies","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130099093","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
Illumination Reduction for Camera Captured Documents Using Block Processing and Homomorphic Filtering Technique 用块处理和同态滤波技术减少相机捕获文档的照度
H. Chethan, R. Scholar, G. Hemantha Kumar
{"title":"Illumination Reduction for Camera Captured Documents Using Block Processing and Homomorphic Filtering Technique","authors":"H. Chethan, R. Scholar, G. Hemantha Kumar","doi":"10.1109/CSNT.2011.79","DOIUrl":"https://doi.org/10.1109/CSNT.2011.79","url":null,"abstract":"When acquiring document image using portable camera like mobile and other devices like HIDs in uncontrolled environment often, exhibits various forms of distortions to captured image, Which in turn degrades the quality of the image. Data quality of the image is highly affected by illumination. Therefore removal of such illumination and increase of data quality is necessary for human perception and machine recognition. In this paper, We propose a novel methodology for Illumination correction and data quality improvement for camera captured documents. The proposed methodology uses Homomorphic and Morphological filtering techniques to reduce illumination and some efficient binarization and enhancement techniques to improve data quality. Experimental results on camera captured documents shows that results obtained are encouragingly reliable, effective and efficient compared with the existing proven methods.","PeriodicalId":294850,"journal":{"name":"2011 International Conference on Communication Systems and Network Technologies","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128484644","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
Enhanced Bangla Character Recognition Using ANN 利用人工神经网络增强孟加拉语字符识别
Piu Upadhyay, Sumana Barman, D. Bhattacharyya, M. Dixit
{"title":"Enhanced Bangla Character Recognition Using ANN","authors":"Piu Upadhyay, Sumana Barman, D. Bhattacharyya, M. Dixit","doi":"10.1109/CSNT.2011.48","DOIUrl":"https://doi.org/10.1109/CSNT.2011.48","url":null,"abstract":"This paper describes how the Bangla characters are processed, trained and then recognized with the use of a neural network. The size and the font used for the characters are similar in both training and classification of the network. The images are first converted into grayscale and then to binary images. These images are then scaled to fit a pre-defined area. By extracting the characteristics points we get the feature vectors, which is simply a series of 0s and 1s of fixed length. Finally, an Artificial Neural Network is chosen for the training and classification process. It has been noticed that recognition decreases due to presence of touching characters in the text. So recognition is done here with isolated printed characters.","PeriodicalId":294850,"journal":{"name":"2011 International Conference on Communication Systems and Network Technologies","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128605557","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
A Spectrally Efficient ML Estimation Method for OFDM Systems over Sparse Multipath Channels 稀疏多径OFDM系统的频谱高效ML估计方法
Rekha Gupta, A. Trivedi
{"title":"A Spectrally Efficient ML Estimation Method for OFDM Systems over Sparse Multipath Channels","authors":"Rekha Gupta, A. Trivedi","doi":"10.1109/CSNT.2011.129","DOIUrl":"https://doi.org/10.1109/CSNT.2011.129","url":null,"abstract":"For getting satisfactory error rate performance, channel estimation is required at receiver. Maximum likelihood (ML) estimation method is preferred due to its low complexity. The conventional ML estimation for sparse multipath channels requires a large number of pilot symbols and thus increases the spectral inefficiency. This paper investigates an efficient way to apply pilot aided ML estimation technique in orthogonal frequency division multiplexing (OFDM) systems to estimate the channel impulse response (CIR) of sparse multipath channels. An algorithm which exploits channel sparsity is proposed to carry out the ML estimation using lesser number of pilot symbols as compared to the conventional method. The symbol error rate performance (SER) of OFDM system assisted by the proposed scheme is analyzed. Simulation results show that significant reduction in spectral efficiency loss can be achieved with small increase in required SNR.","PeriodicalId":294850,"journal":{"name":"2011 International Conference on Communication Systems and Network Technologies","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130248788","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
Microstrip Low-Pass Filter Using Hexagonal Patch with Wide Stopband 宽阻带六边形贴片微带低通滤波器
K. R. Jha, G. Singh
{"title":"Microstrip Low-Pass Filter Using Hexagonal Patch with Wide Stopband","authors":"K. R. Jha, G. Singh","doi":"10.1109/CSNT.2011.61","DOIUrl":"https://doi.org/10.1109/CSNT.2011.61","url":null,"abstract":"In this present paper, a micro strip low-pass filter using hexagonal capacitive patch with the upper cut-off frequency equal to 2 GHz is analyzed and designed. The proposed filter shows significant reduction in the effective area on the substrate along with an improved pass-band performance and a wide stop-band. To verify the analysis, the structure has been simulated using two popular software packages: a) IE3D and b) Sonnet Lite both based on the method of moments technique and the performance of the filter is in the good agreement","PeriodicalId":294850,"journal":{"name":"2011 International Conference on Communication Systems and Network Technologies","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127920242","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
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学术官方微信