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

2008 IEEE/ACS International Conference on Computer Systems and Applications最新文献

筛选
英文 中文
Rapid and robust ranking of text documents in a dynamically changing corpus 在动态变化的语料库中对文本文档进行快速和稳健的排序
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493529
Byung-Hoon Park, N. Samatova, Rajesh Munavalli, R. Krishnamurthy, H. Kettani, A. Geist
{"title":"Rapid and robust ranking of text documents in a dynamically changing corpus","authors":"Byung-Hoon Park, N. Samatova, Rajesh Munavalli, R. Krishnamurthy, H. Kettani, A. Geist","doi":"10.1109/AICCSA.2008.4493529","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493529","url":null,"abstract":"Ranking documents in a selected corpus plays an important role in information retrieval systems. Despite notable advances in this direction, with continuously accumulating text documents, maintaining up-to-date ordering among documents in the domains of interest is a challenging task. Conventional approaches can produce an ordering that is only valid within a given corpus. Thus, with such approaches, ordering should be completely redone as documents are added to or deleted from the corpus. In this paper, we introduce a corpus- independent framework for rapid ordering of documents in a dynamically changing corpus. Like in many practical approaches, our framework suggests utilizing a similarity measure in some metric space indicating the degree of relevance of a document to the domain of interest. However, unlike in corpus- dependent approaches, the relevance score of a document remains valid with changes being introduced into the corpus (insertion of new documents, for example), thus allowing a rapid ordering within the corpus. This paper particularly details a statistical approach to compute such relevance scores.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"286 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114493179","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
Compression of the images of ancient Arab manuscript documents based on segmentation 基于分割的阿拉伯古代手稿图像压缩
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493634
Walid Elloumi, M. Chakroun, Moncef Charfi, A. Alimi
{"title":"Compression of the images of ancient Arab manuscript documents based on segmentation","authors":"Walid Elloumi, M. Chakroun, Moncef Charfi, A. Alimi","doi":"10.1109/AICCSA.2008.4493634","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493634","url":null,"abstract":"This paper presents our contribution for the compression of images of old Arabic manuscripts. Our method of compression is based on the segmentation of the images in three blocks: text, graphics and background, then each block will undergo a different compression method. We present two parts: first, while developing a characteristic extractor based on the wavelet transform and statistical characteristics, we propose an algorithm of segmentation based on the classification of old documents images. Second, we present the education and the implementation of a compression method by using the wavelet transform. This method comprises three steps: the compression of the text blocks, the background blocks, and the graphics blocks.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132116927","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}
引用次数: 3
Different approaches for probability of common cause failure on demand calculations for safety integrity systems 安全完整性系统按需计算共因失效概率的不同方法
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493677
J. Börcsök, P. Holub
{"title":"Different approaches for probability of common cause failure on demand calculations for safety integrity systems","authors":"J. Börcsök, P. Holub","doi":"10.1109/AICCSA.2008.4493677","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493677","url":null,"abstract":"The common cause failures (ccf) are the biggest part when calculating the probability of failure for redundant safety integrity systems. A ccf can occur, when a random hardware failure leads to a failure of several components. There are several methods to calculate the probability of ccf. Three models will be shown in this paper, with the help of which the beta-factor will be calculated. The ccf ratio for the calculation of the overall probability of failure is defined with the beta-factor.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132209811","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
Forensic handwritten document management system 法医手写文件管理系统
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493649
S. Al-Maadeed, Fatima Amire, Sara Khalily Hamza, Wadha Al-lebda
{"title":"Forensic handwritten document management system","authors":"S. Al-Maadeed, Fatima Amire, Sara Khalily Hamza, Wadha Al-lebda","doi":"10.1109/AICCSA.2008.4493649","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493649","url":null,"abstract":"Forensic handwriting analysis is an important task in crime investigation. Writers of documents are sometimes unknown or disputed so it is difficult for the forensic detectives to identity of those writers. Currently, forensic professionals perform the analysis of these documents manually. Document management system for forensic document identification, verification and analysis are described. The system is designed to assist forensic document examiner with identifying and comparing Arabic handwriting and its characteristics with a graphical user interface. The same system also provides the examiner with functionalities for retrieving information about documents, region of interest, words, and writers. The system has been implemented using Oracle Database 6i. Our forensic document management system (FDMS) prompts its users with a graphical user interface (GUI) for forensic handwritten document database exploration and management.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122232965","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
Optimizing Fuzzy K-means for network anomaly detection using PSO 基于粒子群算法的网络异常检测模糊k均值优化
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493603
Roya Ensafi, Soheila Dehghanzadeh, M. Akbarzadeh-Totonchi
{"title":"Optimizing Fuzzy K-means for network anomaly detection using PSO","authors":"Roya Ensafi, Soheila Dehghanzadeh, M. Akbarzadeh-Totonchi","doi":"10.1109/AICCSA.2008.4493603","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493603","url":null,"abstract":"Intrusion detection has become an indispensable defense line in the information security infrastructure. The existing signature-based intrusion detection mechanisms are often not sufficient in detecting many types of attacks. K-means is a popular anomaly intrusion detection method to classify unlabeled data into different categories. However, it suffers from the local convergence and high false alarms. In this paper, two soft computing techniques, fuzzy logic and swarm intelligence, are used to solve these problems. We proposed SFK-means approach which inherits the advantages of K-means, Fuzzy K-means and Swarm K- means, simultaneously we improve the deficiencies. The most advantages of our SFK-means algorithm are solving the local convergence problem in Fuzzy K- means and the sharp boundary problem in Swarm K- means. The experimental results on dataset KDDCup99 show that our proposed method can be effective in detecting various attacks.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125955842","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}
引用次数: 39
Test of preemptive real-time systems 抢占式实时系统的测试
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493609
Noureddine Adjir, Pierre de Saqui-Sannes, K. Rahmouni
{"title":"Test of preemptive real-time systems","authors":"Noureddine Adjir, Pierre de Saqui-Sannes, K. Rahmouni","doi":"10.1109/AICCSA.2008.4493609","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493609","url":null,"abstract":"Time Petri nets with stopwatches not only model system/environment interactions and time constraints. They further enable modeling of suspend/resume operations in real-time systems. Assuming the modelled systems are non deterministic and partially observable, the paper proposes a test generation approach which implements an online testing policy and outputs test results that are valid for the (part of the) selected environment. A relativized conformance relation named rswtioco is defined and a test generation algorithm is presented. The proposed approach is illustrated on an example.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129876630","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
TCPBridge: A software approach to establish direct communications for NAT hosts TCPBridge:一种为NAT主机建立直接通信的软件方法
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493542
Sanmin Liu, Hai Jin, Xiaofei Liao, Hong Yao, Deze Zeng
{"title":"TCPBridge: A software approach to establish direct communications for NAT hosts","authors":"Sanmin Liu, Hai Jin, Xiaofei Liao, Hong Yao, Deze Zeng","doi":"10.1109/AICCSA.2008.4493542","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493542","url":null,"abstract":"Traversing network address translation (NAT) for peer-to-peer (P2P) communication has become a hot topic recently. Compared to UDP, establishing TCP connections for hosts behind different NATs is more complex. Thus, many TCP-based applications do not address TCP traversal through NATs. Some solutions suggest using delegates to relay all communications, or tunneling TCP over UDP. However, they require a big reform to network architecture, or using a nonstandard TCP/IP stack. In this paper, we present a novel idea called TCPBridge. TCPBridge converts TCP traversal to UDP traversal without modifying any binaries of the TCP-based applications. Our design can be integrated with those P2P applications which have not solved TCP traversal problem, and extends them to support direct communications between NAT hosts. It deals with the problem of TCP traversal, so as to improve the usability of applications. We have implemented TCPBridge in several existing P2P systems. Statistics prove that TCPBridge is scalable and robust, and we believe it will benefit many other existing P2P applications.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124473388","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
A connectionist system approach for learning logic programs 一种学习逻辑程序的联结主义系统方法
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493628
M. Mashinchi, S. Shamsuddin
{"title":"A connectionist system approach for learning logic programs","authors":"M. Mashinchi, S. Shamsuddin","doi":"10.1109/AICCSA.2008.4493628","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493628","url":null,"abstract":"In this paper, we show that temporal logic can be learnt effectively by a connectionist system. In contrast with other connectionist approaches in this context, we focus more on learning rather than knowledge representation. In order to learn from temporal logic values, the paper proposes a general three-layer connectionist system regardless of the number of logic rules, a condition which must have been satisfied in previous approaches. A mapping function is proposed to convert logic rules to the proper connectionist system's inputs. Then a simulation study is carried out for muddy children puzzle. The results of the study suggest that an agent embedded with a connectionist system can learn temporal logic efficiently. It is observed that the connectionist system can increase its performance and make fewer mistakes while encountering with more produced cases of given logical rules.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122512550","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
Analysis of the latency-lifetime tradeoff in wireless sensor networks 无线传感器网络延迟寿命权衡分析
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493681
Fatma Bouabdallah, N. Bouabdallah, R. Boutaba
{"title":"Analysis of the latency-lifetime tradeoff in wireless sensor networks","authors":"Fatma Bouabdallah, N. Bouabdallah, R. Boutaba","doi":"10.1109/AICCSA.2008.4493681","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493681","url":null,"abstract":"Energy conservation is a primary concern in wireless sensor networks due to the limited capacity of the sensor nodes' batteries. In this paper, we study the relationship between sensor networks performance, particularly its lifetime, and the number of reporting nodes N by using both analytical and simulation approaches. We first show that decreasing N increases considerably the network lifetime. Moreover, we demonstrate that the average time required to report an event is a convex function of N. Based on these results, and as a main contribution, we prove that the optimal number of reporting nodes enabling the shortest latency to report reliably an event does not really lead to the most efficient way of energy consumption. In this paper, we analyze the tradeoff between these two requirements. We provide a simple methodology to achieve this tradeoff which is specific to each sensor application, depending on its particular needs.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"8 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120898730","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
Optimizing resources utilization in heterogeneous wireless networks 异构无线网络资源利用优化
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493665
Amir Djouama, M. Abdennebi, S. Tohmé
{"title":"Optimizing resources utilization in heterogeneous wireless networks","authors":"Amir Djouama, M. Abdennebi, S. Tohmé","doi":"10.1109/AICCSA.2008.4493665","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493665","url":null,"abstract":"With popularity and pervasiveness increase of mobile wireless networks, combining various numbers of wireless networks becomes an important challenge. The fourth generation of wireless communications is expected to integrate a potentially large number of heterogeneous wireless technologies in what could be considered a huge step toward universal seamless access. One of the main challenges for these networks is to control the topology. Efficient topology control enhances quality of service and provides less congested cells. This paper proposes an approach to topology control for the fourth generation networks. This approach is based on periodic measurements and forced handover techniques with a control layout. A seamless protocol for forced handover techniques is also presented. Performance testing highlights the interest of such techniques.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130763213","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
首页 上一页 下一页 尾页
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学术官方微信
小红书