发布求助
文献互助 智能选刊 最新文献

2010 IEEE 2nd International Advance Computing Conference (IACC)最新文献

筛选
英文 中文
Multi-packet & multi-session signature detection using state based model 基于状态模型的多包多会话签名检测
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423011
P. Pawar, M. Singh, S. Narayanan
{"title":"Multi-packet & multi-session signature detection using state based model","authors":"P. Pawar, M. Singh, S. Narayanan","doi":"10.1109/IADCC.2010.5423011","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423011","url":null,"abstract":"Signature Detection modules in IDS/IPS though accurate in pattern matching, yet it leads to false positives. This is due to the incompleteness of the signatures which lacks or has very little information about when, where and how to match these signatures. The signatures enriched with this information significantly brings down the false positives and at the same time enhances the performance of the signature detection module. In this paper we propose a state base signature detection model which leverages on our state aware signatures with sufficiently complete information to match these signatures. The proposed model keeps track of the state of the connection and matches the signatures within appropriate packets. We further classify our signatures that span across multiple packet and across multiple sessions. We also provide the notion of virtual signatures which represents patterns within packets in a distributed form. In this paper we demonstrate the capabilities of our proposed model to detect these virtual patterns, multi-packet and multi-session leveraging on our state aware signatures.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117298705","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
A Formal Framework for verification and validation of external behavioral models of Embedded Systems represented through Black Box Structures 通过黑盒结构表示的嵌入式系统外部行为模型的正式验证框架
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5422902
J. Sastry, P. V. Chandra
{"title":"A Formal Framework for verification and validation of external behavioral models of Embedded Systems represented through Black Box Structures","authors":"J. Sastry, P. V. Chandra","doi":"10.1109/IADCC.2010.5422902","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422902","url":null,"abstract":"Embedded Systems can be engineered using Cleanroom Software Engineering (CRSE) methodology as it considers all the quality issues as an integral part of the CRSE Life cycle model and lays stress on the reduced size and effort of testing through statistical use testing. Both CRSE and Embedded systems development methodology are based on stimulus-response models. The stimulus-response models are used for designing the external behavioral requirements. Thus, CRSE in a revised form can conveniently be used for the development of reliable embedded systems.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115546153","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
Defect detection and identification in textile fabrics using Multi Resolution Combined Statistical and Spatial Frequency Method 基于多分辨率统计与空间频率相结合的纺织织物缺陷检测与识别
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423017
R. S. Sabeenian, M. Paramasivam
{"title":"Defect detection and identification in textile fabrics using Multi Resolution Combined Statistical and Spatial Frequency Method","authors":"R. S. Sabeenian, M. Paramasivam","doi":"10.1109/IADCC.2010.5423017","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423017","url":null,"abstract":"In textile industry, reliable and accurate quality control and inspection becomes an important element. Presently, this is still accomplished by human experience, which is more time consuming and is also prone to errors. Hence automated visual inspection systems become mandatory in textile industries. This Paper presents a novel algorithm of fabric defect detection by making use of Multi Resolution Combined Statistical and Spatial Frequency Method. Defect detection consists of two phases, first is the training and next is the testing phase. In the training phase, the reference fabric images are cropped into non-overlapping sub-windows. By applying MRCSF the features of the textile fabrics are extracted and stored in the database. During the testing phase the same procedure is applied for test fabric and the features are compared with database information. Based on the comparison results, each sub-window is categorized as defective or non-defective. The classification rate obtained by the process of simulation using MATLAB was found to be 99%.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130984566","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
Implementing web data extraction and making Mashup with Xtractorz 使用Xtractorz实现web数据提取和Mashup
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5422921
R. A. Gultom, R. F. Sari, B. Budiardjo
{"title":"Implementing web data extraction and making Mashup with Xtractorz","authors":"R. A. Gultom, R. F. Sari, B. Budiardjo","doi":"10.1109/IADCC.2010.5422921","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422921","url":null,"abstract":"Implementing web data extraction means we can directly extract data from various web pages, where they mostly formed in an unstructured HTML format, into a new structured format such as XML or XHTML. In this paper we review the implementation of web data extraction and stages in making a Mashup. We implement web data extraction by visually extract targeted data from data sources (web pages). Afterward, we combined web data extraction with the stages of making a Mashup, e.g. data retrieval, data source modeling, data cleaning/ filtering, data integration and data visualization. Problems arise in querying data sources due to unstructured contents of web pages (HTML), we cannot directly extract data into a new structured form. To address this problem, we propose a system, called Xtractorz, that can perform web data extraction in a Mashup format. We provide a fully visual and interactive user interface with new technique and approach using PHP and AJAX as the programming languages, and MySQL as the Data Repository. Furthermore, Xtractorz enables the user to conduct their job without the need to write a script or program or even without any knowledge of computer programming. The test results shows that Xtractorz requires less number of steps in making a Mashup compared with RoboMaker and Karma.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116895778","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}
引用次数: 15
A heuristic algorithm for delay delay-variation bounded least cost multicast routing 时延变化有界最小代价组播路由的启发式算法
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423000
M. R. Kabat, M. Patel, C. Tripathy
{"title":"A heuristic algorithm for delay delay-variation bounded least cost multicast routing","authors":"M. R. Kabat, M. Patel, C. Tripathy","doi":"10.1109/IADCC.2010.5423000","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423000","url":null,"abstract":"Many multimedia communication applications require a source to transmit messages to multiple destinations subject to delay and delay-variation constraints. To support delay constrained multicast communications, computer networks have to guarantee an upper bound end-to-end delay from the source node to each of the destination nodes. On the other hand, if the same message fails to arrive at each destination node at the same time, there will probably arise inconsistency and unfairness problem among users. The problem to find a minimum cost multicast tree with delay and delay variation constraints has been proven to be NP-Complete. In this paper, we present a more efficient heuristic algorithm, namely, Economic Delay and Delay Variation Bounded Multicast Algorithm (EDVBMA), based on a novel heuristic function, to construct a least cost delay and delay variation bounded multicast tree. A noteworthy feature of this algorithm is that it has very high probability of finding the optimal solution in polynomial time with low computational complexity.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115050622","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
Mining association rules using fast algorithm 使用快速算法挖掘关联规则
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5422920
M. Anandhavalli, Sandip Jain, A. Chakraborti, N. Roy, M. Ghose
{"title":"Mining association rules using fast algorithm","authors":"M. Anandhavalli, Sandip Jain, A. Chakraborti, N. Roy, M. Ghose","doi":"10.1109/IADCC.2010.5422920","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422920","url":null,"abstract":"The most time consuming operation in Priori-like algorithms for association rule mining is the computation of the frequency of the occurrences of itemsets (called candidates) in the database. In this paper, a fast algorithm has been proposed for generating frequent itemsets without generating candidate itemsets and association rules with multiple consequents. The proposed algorithm uses Boolean vector with relational AND operation to discover frequent itemsets. Experimental results shows that combining Boolean Vector and relational AND operation results in quickly discovering of frequent itemsets and association rules as compared to general Apriori algorithm.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115284441","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
Capturing interactions in architectural patterns 在体系结构模式中捕获交互
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5422893
D. Yadav, R. Joshi
{"title":"Capturing interactions in architectural patterns","authors":"D. Yadav, R. Joshi","doi":"10.1109/IADCC.2010.5422893","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422893","url":null,"abstract":"Patterns of software architecture help in describing structural and functional properties of a system in terms of smaller components. The emphasis of this work is on capturing the aspects of pattern descriptions and the properties of inter-component interactions including non-deterministic behavior. Through these descriptions we, capture structural and behavioral specifications as well as properties against which the specifications are verified. The patterns covered in this paper are variants of Proxy, Chain, MVC, Acceptor-Connector, Publisher-Subscriber and Dinning Philosopher patterns. While the machines are CCS-based, the properties have been described in Modal μ-Calculus. The approach serves as a framework for precise architectural descriptions.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122661816","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
Network forensic system for port scanning attack 针对端口扫描攻击的网络取证系统
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5422935
A. Kaushik, E. Pilli, R. Joshi
{"title":"Network forensic system for port scanning attack","authors":"A. Kaushik, E. Pilli, R. Joshi","doi":"10.1109/IADCC.2010.5422935","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422935","url":null,"abstract":"Internet is facilitating numerous services while being the most commonly attacked environment. Hackers attack the vulnerabilities in the protocols used and there is a serious need to prevent, detect, mitigate and identify the source of the attacks. Network forensics involves monitoring network traffic and determining if the anomaly in the traffic indicates an attack. The network forensic techniques enable investigators to trace and prosecute the attackers. This paper proposes a simple architecture for network forensics to overcome the problem of handling large volumes of network data and the resource intensive processing required for analysis. It uses open source network security tools to collect and store the data. The system is tested against various port scanning attacks and the results obtained illustrate the effectiveness in its storage and processing capabilities. The model can be extended to add detection and investigation of various attacks.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128333294","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}
引用次数: 27
Feature selection using bag-of-visual-words representation 使用视觉词袋表示的特征选择
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423019
A. Faheema, S. Rakshit
{"title":"Feature selection using bag-of-visual-words representation","authors":"A. Faheema, S. Rakshit","doi":"10.1109/IADCC.2010.5423019","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423019","url":null,"abstract":"In this paper, we introduce an efficient method to substantially increase the recognition performance of object recognition by employing feature selection method using bag-of-visual-word representation. The proposed method generates visual vocabulary from a large set of images using visual vocabulary tree. Images are represented by a vector of weighted word frequencies. We have introduced on-line feature selection method, which for a given query image selects the relevant features from a large weighted word vector. The learned database image vectors are also reduced using the selected features. This will improve the classification accuracy and also reduce the overall computational complexity by dimensionality reduction of the classification problem. In addition, it will help us in discarding the irrelevant features, which if selected will deteriorate the classification results. We have demonstrated the efficiency our method on the Caltech dataset.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"418 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122481991","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}
引用次数: 22
On QoS aspects with different coding and channel conditions for a WiMAX based network 基于WiMAX的网络在不同编码和信道条件下的QoS问题
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423013
Vinit Grewal, A. Sharma
{"title":"On QoS aspects with different coding and channel conditions for a WiMAX based network","authors":"Vinit Grewal, A. Sharma","doi":"10.1109/IADCC.2010.5423013","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423013","url":null,"abstract":"The WiMAX forum has adopted IEEE 802.16 Orthogonal Frequency Division Multiplexing (OFDM) based adaptive Physical Layer (PHY) layer due to its robust performance and provision of various mechanisms to improve Quality of Service (QoS). This paper evaluates the performance of PHY layer with various QoS aspects for different coding schemes and channel conditions. A robust PHY layer with improved QoS performance is developed from the investigations.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126766496","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
首页 上一页 下一页 尾页
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学术官方微信