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

ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010最新文献

筛选
英文 中文
A component based testing technique for a MANET routing protocol 基于组件的MANET路由协议测试技术
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5587040
Fatiha Zaïdi, M. Lallali, S. Maag
{"title":"A component based testing technique for a MANET routing protocol","authors":"Fatiha Zaïdi, M. Lallali, S. Maag","doi":"10.1109/AICCSA.2010.5587040","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5587040","url":null,"abstract":"This paper deals with the crucial challenging issue of testing the conformance of the MANET routing protocols. Indeed, because of the inherent constraints of such networks such as a dynamic topology, to formally test these protocols becomes a tough problem. Most of the studies taking into account a formal model of the protocol is faced to the combinatorial state space explosion issue when deploying and analyzing that model. In our work we present how to cope with that problem by drawing inspiration of the model-checker research domain and an integration of a component-based testing algorithm dedicated to the automatic generation of OLSR test sequences from a formal model written in Promela.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125127921","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
Path computation with multiple constraints QoS in multi-domain 多域多约束QoS路径计算
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5587037
Wajih Amari, Ridha Gadhgadhi, Asma BEN LETAIFA, S. Tabbane
{"title":"Path computation with multiple constraints QoS in multi-domain","authors":"Wajih Amari, Ridha Gadhgadhi, Asma BEN LETAIFA, S. Tabbane","doi":"10.1109/AICCSA.2010.5587037","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5587037","url":null,"abstract":"The interest for providing services with performance guarantees across different connected networks has given new technical solutions allowing the computation of constrained inter-domain paths. Thus, the present paper treats the problem of computing inter-domain paths subject to multiple constraints. We study here existing algorithms for inter-domain computations, and describe new approach approximating exact solutions. Some previous study proposed an exact solution, named pID-MCP, allowing the pre computation of path segments in the domains. We propose a novel algorithm named ID-MCPAA that treats the computational complexity of the problem, can find a feasible path not found by previous solutions and ameliorate existing techniques. Our algorithm is compatible with existing techniques and fulfills the multi constraints requirements after proving the correctness and the complexity of exact solutions, we evaluate by simulation the performance of the algorithm.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121257309","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 GPU-based iterated tabu search for solving the quadratic 3-dimensional assignment problem 基于gpu的二次三维分配问题迭代禁忌搜索
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5587019
Thé Van Luong, Lakhdar Loukil, N. Melab, E. Talbi
{"title":"A GPU-based iterated tabu search for solving the quadratic 3-dimensional assignment problem","authors":"Thé Van Luong, Lakhdar Loukil, N. Melab, E. Talbi","doi":"10.1109/AICCSA.2010.5587019","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5587019","url":null,"abstract":"The quadratic 3-dimensional assignment problem (Q3AP) is an extension of the well-known NP-hard quadratic assignment problem. It has been proved to be one of the most difficult combinatorial optimization problems. Local search (LS) algorithms are a class of heuristics which have been successfully applied to solve such hard optimization problem. These methods handle with a single solution iteratively improved by exploring its neighborhood in the solution space. In this paper, we propose an iterated tabu search for solving the Q3AP. The design of this algorithm is essentially based on a new large neighborhood structure. Indeed, in LS heuristics, designing operators to explore large promising regions of the search space may improve the quality of the obtained solutions. However, designing such neighborhood is at the expense of a highly computationally process. Therefore, the use of graphics processing units (GPUs) provides an efficient complementary way to speed up the search. The proposed GPU-based iterated tabu search has been experimented on 5 different Q3AP instances. The obtained results are convincing both in terms of efficiency, quality and robustness of the provided solutions at run time.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132037269","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}
引用次数: 29
Towards ISO interface protocol for interactive multimedia intelligent terminals 面向交互式多媒体智能终端的ISO接口协议
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5586992
H. El-Gendy
{"title":"Towards ISO interface protocol for interactive multimedia intelligent terminals","authors":"H. El-Gendy","doi":"10.1109/AICCSA.2010.5586992","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586992","url":null,"abstract":"A multimedia-“ISO-Application Layer” Interface for interactions, via services called Input/Output Services, between desktop applications and voice terminals is presented in this paper. Input/Output services allow computer applications to provide users with enhanced services by exploitation of the characteristics of a variety of telephony device types. This is by interacting with a switch-based software object, called Information-Path, associated with the device that allows input to be received from the device and output to be sent to the device. A Standard specification for such an interface may be developed by ANSI (American National Standards Institute) Tl Committee, ECMA (European Computer Manufacturers Association) TC32-TG11, or ITU/TSS (formerly CCITT) IN (Intelligent Networks) Group.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"1642 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132323831","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
QLT: A flow control strategy for wormhole network-on-chip 片上虫洞网络的流量控制策略
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5586950
Minghua Tang, X. Lin
{"title":"QLT: A flow control strategy for wormhole network-on-chip","authors":"Minghua Tang, X. Lin","doi":"10.1109/AICCSA.2010.5586950","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586950","url":null,"abstract":"The fact that the on-chip network will suddenly get saturated indicates that it is necessary to devise an effective flow control strategy. Through tracing the status of the network buffer space we found that the payload of the on-chip network can not get beyond an upper bound to avoid vicious congestion. Specifically, quarter of the total network buffer space is such a threshold, which is termed Quarter Load Threshold (QLT). Based on this fact we present the Quarter Load Threshold (QLT) flow control strategy. The performance of the proposed strategy is evaluated by the open source simulator Noxim [2]. Simulation results show that the on-chip network runs smoothly and no serious congestion is encountered any more.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132467164","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
Parallelization of the dynamic programming algorithm for solving the longest common subsequence problem 求解最长公共子序列问题的并行化动态规划算法
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5587006
Bchira Ben Mabrouk, Hamadi Hasni, Z. Mahjoub
{"title":"Parallelization of the dynamic programming algorithm for solving the longest common subsequence problem","authors":"Bchira Ben Mabrouk, Hamadi Hasni, Z. Mahjoub","doi":"10.1109/AICCSA.2010.5587006","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5587006","url":null,"abstract":"We address in this paper the design and analysis of cost-optimal parallel algorithms for solving the problem of the longest common subsequence. Starting from the standard sequential dynamic programming algorithm which has the structure of a perfect nest of two embedded loops, we make use of a specific three-step parallelization approach consisting in (i) a dependence analysis within the nest ; (ii) the determination of a particular unimodular transformation leading to a new nest whose second loop is parallel ; (iii) the design of two linear time schedulings for the derived parallel algorithm when a given number of processors is available. The first scheduling is fitted to the nest structure while the second is greedy oriented and optimal. The makespans of the two schedulings are explicitly determined. This permits to establish a comparison showing their respective efficiencies.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133770882","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
On proving languages non-regular 关于证明语言是非正则的
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5586960
Fouad B. Chedid
{"title":"On proving languages non-regular","authors":"Fouad B. Chedid","doi":"10.1109/AICCSA.2010.5586960","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586960","url":null,"abstract":"A well known characterization of regular languages is provided by Nerode's Theorem. However, the pumping lemma is often a more useful tool in demonstrating properties of regular languages. In this paper, we rewrite an early pumping characterization of regular languages due to Stanat and Weiss so that some extra condition is made explicit in the theorem. This should allow for writing simpler proofs. Also, we present two new variations of the non-pumping lemma of Zhang and Canfield. These are necessary conditions only for regularity. Still, a non-pumping lemma uses a simpler logic compared to the standard pumping lemma. Finally, we present a generalization of the non-pumping lemma that is applicable to our variations as well. Our generalization allows for simpler proofs.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121316207","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
Design and experimental validation of a sound source model for engine of vehicles 汽车发动机声源模型的设计与实验验证
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5586956
M. Redel-Macias, A. Cubero-Atienza, D. Berckmans
{"title":"Design and experimental validation of a sound source model for engine of vehicles","authors":"M. Redel-Macias, A. Cubero-Atienza, D. Berckmans","doi":"10.1109/AICCSA.2010.5586956","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586956","url":null,"abstract":"Community noise regulations put stringent requirements on the exterior noise emission of vehicles. Noise from engines and tyres is the main contribution to noise pollution caused by traffic. It is imperative that automotive manufactures invest a lot of effort and money to improve the vibro-acoustics performance of their products. The enhancement effort may be very difficult and time-consuming if one relies only on trial and error' method without prior knowledge about the sources itself. The implementation of sound source models is much faster than the trial and error' methods. The purpose of this paper is to develop simple source models for engine noise using a mock-up panel of loudspeakers set up following the substituted monopole technique. The number and quantification of the sub-source factors is established here by the different cases under study. The real-life experience of listening to this sound is assessed by the implementation of DIN 45631/ISO 532B Loudness representation and the evaluation of the related sound quality, together with the annoyance level, are determined in a quick and economical manner.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116874093","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 Record to Record Travel metaheuristic to minimize total dispersion in food industry 一个记录到记录的旅行元启发式，以减少食品工业的总分散
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5587021
Saima Dhouib, M. Benaissa, H. Chabchoub
{"title":"A Record to Record Travel metaheuristic to minimize total dispersion in food industry","authors":"Saima Dhouib, M. Benaissa, H. Chabchoub","doi":"10.1109/AICCSA.2010.5587021","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5587021","url":null,"abstract":"In this paper a Record to Record Travel (RRT) metaheuristic is proposed to minimize the manufacturing batch dispersion in order to optimise traceability in food industry. Computational results on sausage manufacturing in a French food company sets show the effectiveness and the high performance of the proposed RRT approach. In comparison to the performance of previous genetic algorithm, the proposed one was found superior. Furthermore, it requires very few user-defined parameters.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114832755","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
3D building modeling based on 3D line grouping using centroid neural network 基于质心神经网络的三维线分组三维建筑建模
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5586952
Dong-Min Woo, Hai-Nguyen Ho, Dong-Chul Park
{"title":"3D building modeling based on 3D line grouping using centroid neural network","authors":"Dong-Min Woo, Hai-Nguyen Ho, Dong-Chul Park","doi":"10.1109/AICCSA.2010.5586952","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586952","url":null,"abstract":"Building reconstruction from aerial image data has been studied in this paper. 3D line segments generated by using stereo image analysis are usually fragmented, and it is very hard to reconstruct building rooftop from segmented 3D lines. Centroid neural network algorithm is employed to classify 3D lines into groups of lines. With this grouping technology, the grouped 3D lines are easily clustered into rooftop, and the 3D building model is reconstructed. The proposed approach is evaluated on the Avenches dataset of Ascona aerial images. This experimental results indicate that the grouped 3D lines can be efficiently used for the construction of 3D site models, and prove the efficiency of the proposed approach in dealing with the building reconstruction problem from complicated images.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"15 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115491251","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学术官方微信