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

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

筛选
英文 中文
Arabic spotted words recognition system based on HMM approach to control a didactic manipulator 基于HMM方法的阿拉伯语点词识别系统控制教学机械手
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493648
M. Fezari, H. Attoui, M. Bedda
{"title":"Arabic spotted words recognition system based on HMM approach to control a didactic manipulator","authors":"M. Fezari, H. Attoui, M. Bedda","doi":"10.1109/AICCSA.2008.4493648","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493648","url":null,"abstract":"A voice command system for a robot arm is designed as a part of a research project. The methodology adopted is based on a spotted words recognition system based on a robust HMM (Hidden Markove Model) technique with cepstral coefficients as parameters used in automatic speech recognition system. To implement the approach on a real-time application, a Personal Computer parallel port interface was designed to control the movement of a set of stepper motors. The user can control the movements of five degree of freedom (DOF) for a robot arm using a vocal phrase containing spotted words. Other applications are proposed.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"53 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":"124614416","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
Supervised texture classification using several features extraction techniques based on ANN and SVM 基于神经网络和支持向量机的几种特征提取技术的监督纹理分类
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493588
M. Ashour, M. F. Hussin, K. Mahar
{"title":"Supervised texture classification using several features extraction techniques based on ANN and SVM","authors":"M. Ashour, M. F. Hussin, K. Mahar","doi":"10.1109/AICCSA.2008.4493588","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493588","url":null,"abstract":"Texture classification is one of the most important clues of visual processing applications .In this paper, we present a comparison between the most two popular supervised texture classification methods based on the feed forward Artificial Neural Network (ANN) and the multi-class Support Vector Machine (SVM). Five of the most common used features extraction approaches were chosen in order to extract input vectors of different sizes for both classifiers. These approaches are namely gray level histogram, edge detection, and co-occurrence matrices, besides Gabor and Biorthogonal wavelet transformations. Experiments are conducted on two different datasets the first one is engineering surface textures produced by different machining processes, and the second was taken from Brodatz (1966) textures album. The classification accuracy rate is calculated for ANN and SVM in order to measure the efficiency of each technique based on the several features extraction methods. The results show that SVM with its linear and polynomial kernels is higher in classification accuracy and faster in training time.","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":"116425216","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 fair scheduling algorithm for video transmission over wireless packet networks 一种无线分组网络视频传输的公平调度算法
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493655
Mohamed S. Hassan, T. Landolsi, M. El-Tarhuni
{"title":"A fair scheduling algorithm for video transmission over wireless packet networks","authors":"Mohamed S. Hassan, T. Landolsi, M. El-Tarhuni","doi":"10.1109/AICCSA.2008.4493655","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493655","url":null,"abstract":"In this paper we propose a fair-scheduling algorithm for the transmission of video frames over wireless links. The scheme is based on the occupancy of the video decoder buffer. When the occupancy of the decoder buffer of a given video client becomes increasingly small and approaches a starvation threshold, it gets treated with a higher priority and gets serviced more frequently than other clients who may not be approaching the starvation point. When compared to other commonly-used scheduling algorithms, ours shows a better performance in terms of the end-to-end delay experienced by the video frames.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"65 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":"121695382","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
Extracting Kerberos passwords through RC4-HMAC encryption type analysis 通过RC4-HMAC加密类型分析提取Kerberos密码
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493602
Ahmed Alazzawe, A. Nawaz, D. Wijesekera
{"title":"Extracting Kerberos passwords through RC4-HMAC encryption type analysis","authors":"Ahmed Alazzawe, A. Nawaz, D. Wijesekera","doi":"10.1109/AICCSA.2008.4493602","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493602","url":null,"abstract":"In this paper, we propose a system and method for obtaining Kerberos passwords by capturing a single packet, encrypted using the RC4-HMAC encryption type. We present two methods that when combined together, can reduce the time needed to crack a password by 60.2% over brute force. The first method uses known text in the preauthentication phase to skip the verification section of the decryption process. The second method precomputes some of the steps of the RC4-HMAC decryption process. We also present a novel method of eliminating the amount of space needed to store passwords in memory by using a counter to map hashes to their password.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"27 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":"116313579","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
SLA-based dynamic resource management in wireless environments 无线环境中基于sla的动态资源管理
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1504/IJIPT.2008.019292
Badis Tebbani, I. Aib, G. Pujolle
{"title":"SLA-based dynamic resource management in wireless environments","authors":"Badis Tebbani, I. Aib, G. Pujolle","doi":"10.1504/IJIPT.2008.019292","DOIUrl":"https://doi.org/10.1504/IJIPT.2008.019292","url":null,"abstract":"In this article, we focus on the service-driven management of quality of service and user access in wireless corporate networks. We propose a service-level agreement (SLA) oriented nomadism management architecture with a top-down vision starting by the specification of company objectives and going down to device-level configurations. We define an algorithm for the automatic translation of application-level quality assurance parameters into network-level configuration parameters. The description of the prototype implementation of our solution to the SLA-driven enterprise nomadism management is given and preliminary results on the self-adaptive capabilities of our mapping algorithm are given.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"10 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":"126783037","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
Practical inter-stock dependency indicators using time series and derivatives 使用时间序列和衍生工具的实际存量依赖指标
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493533
A. Dattasharma, P. Tripathi
{"title":"Practical inter-stock dependency indicators using time series and derivatives","authors":"A. Dattasharma, P. Tripathi","doi":"10.1109/AICCSA.2008.4493533","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493533","url":null,"abstract":"Prediction of stock prices is a difficult but extremely important problem that demands the development of algorithms for predicting trading opportunities by detecting patterns from past data. A related problem is the task of identifying inter-dependencies between different stocks, so that investment in one stock can be done when a related stock is performing well. The work till date on this problem seems mostly focused on theory or database techniques. We define three very simple indicators derived from stock data for this purpose, and show how they can be used in practice to successfully identify investor thumb rules in a quantitative manner.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"6 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":"126112313","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
Intelligent virtual archiving for accessing news article repositories 用于访问新闻文章存储库的智能虚拟归档
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493640
Wadha K. Lebda, Noura Fetais, S. A. Hussaini, Sahar smail, Q. Malluhi
{"title":"Intelligent virtual archiving for accessing news article repositories","authors":"Wadha K. Lebda, Noura Fetais, S. A. Hussaini, Sahar smail, Q. Malluhi","doi":"10.1109/AICCSA.2008.4493640","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493640","url":null,"abstract":"This paper proposes a news article archiving solution that addresses many of today's systems limitations for effective storage and management of unstructured data items. The proposed system employs formal concept analysis as a means to generate concept lattices. The system is based on a new breed of file systems called content-based file systems. This system provides a flexible way of managing data by employing a mechanism for creating, storing, organizing, searching, and browsing huge libraries of news articles.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"11 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":"125490424","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
Electing a leader in the local computation model using mobile agents 基于移动代理的局部计算模型中领导者的选择
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493575
Med Amine Haddar, A. Kacem, Y. Métivier, M. Mosbah, M. Jmaiel
{"title":"Electing a leader in the local computation model using mobile agents","authors":"Med Amine Haddar, A. Kacem, Y. Métivier, M. Mosbah, M. Jmaiel","doi":"10.1109/AICCSA.2008.4493575","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493575","url":null,"abstract":"Needless to say, distributed algorithms are usually hard to design mush harder to prove and to use in real distributed systems. In these systems, local computations theory has proved its power to formalize and prove in an intuitive way distributed algorithms. This paper uses this formalism to present solutions to the election problem in several network topologies using mobile agents at the design and the implementation levels. We formalized the proposed solutions in the local computations model using transition systems [11]. This facilitates the proof of the proposed solutions using the mathematical tool-box provided by the local computation theory. Using mobile agents, the proposed solutions get rid of synchronization and do not need continuous use of all machines computational resources. Proposed solutions are also simulated within the VISIDIA [3] platform.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"13 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":"127294670","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}
引用次数: 24
A modular state exploration and compatibility checking of UML dynamic diagrams UML动态图的模块化状态探索和兼容性检查
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493617
Y. Hammal
{"title":"A modular state exploration and compatibility checking of UML dynamic diagrams","authors":"Y. Hammal","doi":"10.1109/AICCSA.2008.4493617","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493617","url":null,"abstract":"Although UML is a suited language for modeling complex systems, the consistency and compatibility checking of designed UML artifacts remains a difficult task because of both the imprecise semantics of UML diagrams and the expressiveness gaps between them. In this setting, this paper uses a modular approach of state exploration to achieve the compatibility checking of the various components depicted by StateCharts and to check that their behavioral models fulfill the scenario-based specifications depicted by interaction diagrams. The main advantages of this approach is to avoid the state explosion problem by achieving the consistency checking in a modular and parallelizable way and by alleviating the handling of component substitutivity without a complete exploration of the whole system.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"41 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":"131420984","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
Proposing an efficient method to estimate and reduce crosstalk after placement in VLSI circuits 提出了一种有效的估计和减少VLSI电路放置后串扰的方法
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493517
Arash Mehdizadeh, M. S. Zamani
{"title":"Proposing an efficient method to estimate and reduce crosstalk after placement in VLSI circuits","authors":"Arash Mehdizadeh, M. S. Zamani","doi":"10.1109/AICCSA.2008.4493517","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493517","url":null,"abstract":"Due to the increasing number of elements on a single chip area and the growing complexity of routing, existing methods to reduce crosstalk at the routing or post-routing stage do not seem efficient anymore. So crosstalk estimation should be considered in earlier design stages such as placement. To estimate crosstalk after placement information about the topology of a net and adjacency of its wire-segments should be available. Yet it is not because of the lack of routing information. In this paper, we propose a probabilistic method to estimate intra-grid wirelength of nets after placement and global routing. Results of incorporating this method with the previous crosstalk estimation schemes and our proposed crosstalk reduction method show its efficiency in detecting failing noisy nets before having detailed information of wire adjacency. Our general method improved the number of correctly detected failing noisy nets by 15% on average. In a second improvement, the directed version of this method increased the number of correct detections by 19%. It also decreased the number of false detections considerably.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"9 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":"134378776","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学术官方微信