{"title":"Exploring the temporal placement for partially reconfigurable device","authors":"Ramzi Ayadi, B. Ouni, A. Mtibaa","doi":"10.1109/CCCA.2011.6031482","DOIUrl":"https://doi.org/10.1109/CCCA.2011.6031482","url":null,"abstract":"In this paper, we examine the temporal placement, showing how it can be decomposed into a number of distinct but not independent subtasks. Then, we detail the early algorithms that have been developed for solving the temporal placement problem. Next we introduced a new temporal placement algorithm that aims to reduce the routing cast between modules. And finally, experiments are conducted in order to evaluate the complexity and design performances of the proposed algorithm versus others temporal placement algorithms.","PeriodicalId":259067,"journal":{"name":"2011 International Conference on Communications, Computing and Control Applications (CCCA)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133230706","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}
{"title":"SHMP solution for surface treatment line using an hybrid constraints satisfaction algorithm","authors":"I. Mhedhbi, H. Camus, E. Craye, M. Benrejeb","doi":"10.1109/CCCA.2011.6031222","DOIUrl":"https://doi.org/10.1109/CCCA.2011.6031222","url":null,"abstract":"For single-hoist multi-products job shop scheduling problems, a constraints satisfaction algorithm CSA is successfully applied in this paper to find the optimal move sequence of the hoist that minimize the cycle period. Then, the CSA is hybridized with two classical heuristics to impose a criterion of selection of tasks according to their processing times. This hybridization generates better quality of solution. A real surface treatment line is studied with consideration of the minimization of the cycle time obtained by applying different algorithms. Comparative study is then presented to show the efficiency of the three proposed approaches and the preferment one is then selected.","PeriodicalId":259067,"journal":{"name":"2011 International Conference on Communications, Computing and Control Applications (CCCA)","volume":"1224 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116081648","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}
{"title":"Uplink ergodic capacity of a cognitive radio network","authors":"Mariem Mhiri, K. Cheikhrouhou, A. Samet","doi":"10.1109/CCCA.2011.6031476","DOIUrl":"https://doi.org/10.1109/CCCA.2011.6031476","url":null,"abstract":"In this paper, we study the transmission performances of a cognitive radio (CR) system which coexists with a primary system. We focus at first, on the power control of the CR network. We define then, the maximum allowable power for a cognitive transmitter whose modelisation is related to a flat reflecting surface. This model contributes also to establish a closed-form expression of the tolerated minimum distance between a CR transmitter and its nearest primary user. Finally, we study the impact of this modelisation on the uplink ergodic capacity of a cognitive transmitter communicating with a CR base station (CR BS). The implementation results prove that our work offers, at the same time, an accurate power control and a precise localization to the cognitive transmitter.","PeriodicalId":259067,"journal":{"name":"2011 International Conference on Communications, Computing and Control Applications (CCCA)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116405152","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}
{"title":"Environmentally constrained economic dispatch via quadratic programming","authors":"F. Z. Gherbi, F. Lakdja","doi":"10.1109/CCCA.2011.6031418","DOIUrl":"https://doi.org/10.1109/CCCA.2011.6031418","url":null,"abstract":"This paper presents a quadratic programming to solve the economic and emission dispatch problems, with two objective functions is given. The modern power system has become very complex in nature with conflicting requirements. Heavy load demands and distributed generation compromise the cost of generation. Also the pollution hazards and inherent losses contribute towards an inefficient system. The solution technique gives the minimum total cost rate (total thermal cost rate plus total emission cost rate) under the electric constraints. The algorithm is tested on two tests systems and compared with different methods.","PeriodicalId":259067,"journal":{"name":"2011 International Conference on Communications, Computing and Control Applications (CCCA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125846312","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}
{"title":"Online identification of nonlinear system in the Reproducing Kernel Hilbert Space using SVDKPCA method","authors":"O. Taouali, I. Elaissi, H. Messaoud","doi":"10.1109/CCCA.2011.6031191","DOIUrl":"https://doi.org/10.1109/CCCA.2011.6031191","url":null,"abstract":"This paper proposes a new method for online identification of a nonlinear system modelled on Reproducing Kernel Hilbert Space (RKHS). The proposed SVD-KPCA method uses the SVD technique to update the principal components. Then we use the Reduced Kernel Principal Component Analysis (RKPCA) to approach the principal components which represent the observations selected by the KPCA method.","PeriodicalId":259067,"journal":{"name":"2011 International Conference on Communications, Computing and Control Applications (CCCA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125868139","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}
{"title":"Proposal of an automatic tool for guidelines validation to aid for interactive systems ergonomic quality assessment","authors":"Selem Charfi, H. Ezzedine","doi":"10.1109/CCCA.2011.6031487","DOIUrl":"https://doi.org/10.1109/CCCA.2011.6031487","url":null,"abstract":"This paper is related to the Human-Computer Interaction (HCI) field and more specifically to the interactive systems ergonomic quality evaluation. This article involves the realization and the test of a tool for guidelines validation in interactive systems in order to aid in the ergonomic quality assessment process. It consists on the selection of ergonomic guidelines among a bunch of ergonomic rules. Then the presented Guidelines Inspector is assigned to inspect the degree of compliance of these rules in the evaluated Interactive Systems. This analysis helps to identify the different conception errors in order to obtain coherent Graphic User Interface (GUI). The developed Guidelines Inspector is validated by the evaluation of traffic supervision system in Valenciennes (France).","PeriodicalId":259067,"journal":{"name":"2011 International Conference on Communications, Computing and Control Applications (CCCA)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124779062","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}
{"title":"A parallel processing architecture for FSS block-matching motion estimation","authors":"S. Dhahri, A. Zitouni, R. Tourki","doi":"10.1109/CCCA.2011.6031442","DOIUrl":"https://doi.org/10.1109/CCCA.2011.6031442","url":null,"abstract":"Motion Estimation (ME) is a key factor for achieving enhanced compression ratio. However, ME involves high computational complexity. The main goal is to reduce the execution time without reducing image quality. In this paper, a proposed high parallel processing architecture is presented for four-step search block-matching motion estimation. The proposed method develops an architecture which using 9 processing-elements (PE) and processes them in parallel. The architecture has been simulated and synthesized with VHDL and ASIC (CMOS 45nm). Synthesize results show that the proposed architecture achieves a high performance for real time motion estimation.","PeriodicalId":259067,"journal":{"name":"2011 International Conference on Communications, Computing and Control Applications (CCCA)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125638148","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}
A. Waadt, Shangbo Wang, C. Kocks, G. Bruck, P. Jung
{"title":"Location and tracking applications for high data rate UWB systems","authors":"A. Waadt, Shangbo Wang, C. Kocks, G. Bruck, P. Jung","doi":"10.1109/CCCA.2011.6031520","DOIUrl":"https://doi.org/10.1109/CCCA.2011.6031520","url":null,"abstract":"This paper discusses a maximum likelihood (ML) estimator for the localization of mobile nodes in communication networks. The derived estimator is optimized for ranging measurements exploiting the received signal strength (RSS). For this purpose, the bias and uncertainties of the RSS based ranging procedure are analyzed, considering a path loss model of an indoor ultra-wideband (UWB) network under line of sight (LOS) conditions. The nonlinearity of the path loss model is first taken into account before the statistics of the observed RSS are approximated by a Taylor sequence of first order. The so found metrics describe a weighted least squares (WLS) method. The metrics of the estimator are analytically derived in closed-form. The performance of the derived estimator is investigated in Monte-Carlo simulations and compared with a simple least squares (LS) method and another method exploiting RSS fingerprints.","PeriodicalId":259067,"journal":{"name":"2011 International Conference on Communications, Computing and Control Applications (CCCA)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130444592","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}
{"title":"Solution of Lur'e equations via deflating subspaces","authors":"Timo Reis","doi":"10.1109/CCCA.2011.6031202","DOIUrl":"https://doi.org/10.1109/CCCA.2011.6031202","url":null,"abstract":"We consider the so-called Lur'e matrix equations that arise e.g. in linear-quadratic infinite time horizon optimal control. We characterize the set of solutions in terms of deflating subspaces of even matrix pencils. In particular, it is shown that there exist solutions which are extremal in terms of definiteness. It is shown how these special solutions can be constructed deflating subspaces of even matrix pencils.","PeriodicalId":259067,"journal":{"name":"2011 International Conference on Communications, Computing and Control Applications (CCCA)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126359976","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}
{"title":"Dynamic scheduling of maintenance tasks under competence constraints in a distributed environment","authors":"Y. Bella, S. Latreche, M. Mostefai","doi":"10.1109/CCCA.2011.6031392","DOIUrl":"https://doi.org/10.1109/CCCA.2011.6031392","url":null,"abstract":"In this article, we study the dynamic scheduling problem of maintenance tasks in a distributed environment. This environment is presented as a center of competence related to several sites. The human resources have not the same qualification, and then, the assignment decision has to take care of several parameters principally with particular competences. Our contribution concerns the optimal insertion of a new task in an existing scheduling. The proposed method is based on a combination of a local decent algorithm and the Kangaroo methodology. The objective function is to minimize the following criteria: the total weighted tardiness, the standard deviation between resources and the number of task which could have a new assignment (assigned to a new resource). The main of the algorithm is to disturb as less as possible the existing scheduling. The obtained results are validated and compared to the results obtained by static scheduling.","PeriodicalId":259067,"journal":{"name":"2011 International Conference on Communications, Computing and Control Applications (CCCA)","volume":"39 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121009182","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}