2011 International Conference on Communication Systems and Network Technologies最新文献_第8页

Managing Security in Aspect Oriented Recommender System 面向方面推荐系统中的安全管理

2011 International Conference on Communication Systems and Network Technologies Pub Date : 2011-06-03 DOI: 10.1109/CSNT.2011.151

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 语义图中的无监督异常节点检测

2011 International Conference on Communication Systems and Network Technologies Pub Date : 2011-06-03 DOI: 10.1109/CSNT.2011.138

Priya S. Sajane, S. Sonavane

引用次数: 0

Innovative Cost Effective Approach for Cell Phone Based Remote Controlled Embedded System for Irrigation 基于手机的嵌入式灌溉远程控制系统的创新方法

2011 International Conference on Communication Systems and Network Technologies Pub Date : 2011-06-03 DOI: 10.1109/CSNT.2011.93

V. Ahmed, S. Ladhake

引用次数: 31

Comparision of Hierarchial Mixed-Size Placement Algorithms for VLSI Physical Synthesis VLSI物理合成中分层混合尺寸放置算法的比较

2011 International Conference on Communication Systems and Network Technologies Pub Date : 2011-06-03 DOI: 10.1109/CSNT.2011.95

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 基于数据点聚类的有界直径最小生成树的最优主干

2011 International Conference on Communication Systems and Network Technologies Pub Date : 2011-06-03 DOI: 10.1109/CSNT.2011.164

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网络路由算法

2011 International Conference on Communication Systems and Network Technologies Pub Date : 2011-06-03 DOI: 10.1109/CSNT.2011.34

G. Varaprasad

引用次数: 6

Illumination Reduction for Camera Captured Documents Using Block Processing and Homomorphic Filtering Technique 用块处理和同态滤波技术减少相机捕获文档的照度

2011 International Conference on Communication Systems and Network Technologies Pub Date : 2011-06-03 DOI: 10.1109/CSNT.2011.79

H. Chethan, R. Scholar, G. Hemantha Kumar

引用次数: 8

Enhanced Bangla Character Recognition Using ANN 利用人工神经网络增强孟加拉语字符识别

2011 International Conference on Communication Systems and Network Technologies Pub Date : 2011-06-03 DOI: 10.1109/CSNT.2011.48

Piu Upadhyay, Sumana Barman, D. Bhattacharyya, M. Dixit

引用次数: 4

A Spectrally Efficient ML Estimation Method for OFDM Systems over Sparse Multipath Channels 稀疏多径OFDM系统的频谱高效ML估计方法

2011 International Conference on Communication Systems and Network Technologies Pub Date : 2011-06-03 DOI: 10.1109/CSNT.2011.129

Rekha Gupta, A. Trivedi

引用次数: 0

Microstrip Low-Pass Filter Using Hexagonal Patch with Wide Stopband 宽阻带六边形贴片微带低通滤波器

2011 International Conference on Communication Systems and Network Technologies Pub Date : 2011-06-03 DOI: 10.1109/CSNT.2011.61

K. R. Jha, G. Singh

引用次数: 1