{"title":"Towards XML schema extraction from deep web","authors":"Yasser Saissi, A. Zellou, A. Idri","doi":"10.1109/CIST.2016.7805022","DOIUrl":"https://doi.org/10.1109/CIST.2016.7805022","url":null,"abstract":"Today, not all the web is fully accessible by the Web search engines. There is a hidden and inaccessible part of the web called the deep web. Many methods exist in the literature to access and to integrate the huge structured data contained in the deep web. In this paper, we propose our approach to extract the XML schema describing a selected deep web source. Our approach is based on the static and the dynamic analysis of the HTML forms giving access to the selected deep web source. Our approach uses two knowledge database during its process: our proprietary identification tables and Wordnet. The XML schema extracted will be used to integrate the associated deep web source into a mediation system without extracting all its information.","PeriodicalId":196827,"journal":{"name":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116350554","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}
Elhoussaine Ouabida, Abdelaziz Essadike, A. Bouzid
{"title":"Optical approach for iris segmentation and tracking","authors":"Elhoussaine Ouabida, Abdelaziz Essadike, A. Bouzid","doi":"10.1109/CIST.2016.7805095","DOIUrl":"https://doi.org/10.1109/CIST.2016.7805095","url":null,"abstract":"In this paper, an autonomous active contour model based on the optical correlation algorithm is proposed. Optical correlation is used to calculate iris and pupil areas with a digital simulation of the Vander Lugt correlator. This area term computation assists the model to define an initial contour and at a later stage, to calculate terms in the energy expression. In the proposed model, several reference images called filters of iris and pupil have been introduced. Applied to three iris database and iris motion video, the proposed model enables us to reach better segmentation and tracking accuracy performance of irises.","PeriodicalId":196827,"journal":{"name":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126511041","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":"State of art of optimisation and meta heuristic a comparative study of the Harmony Search Algorithm","authors":"Mounia Aarich, H. Hachimi, N. Hmina","doi":"10.1109/CIST.2016.7804985","DOIUrl":"https://doi.org/10.1109/CIST.2016.7804985","url":null,"abstract":"Over the years the science has developed rapidly. And the Optimization science also has been developed to solve the difficult problems. Now the optimization science is the tendency to solve several problems by applying algorithms and optimization methods (Meta heuristics Algorithms). In the previous decades, the researchers have worked and solved their problems with limited optimization methods (deterministic methods), that provide exact solution. But now these methods are not effective for the very complex problems, and this obstacle push the researchers to build other methods. In this paper a big state of art, and a very important comparative study are proposed. We talk about the state of art to more understand the methods and algorithms of optimization, also their procedure. For the comparative study we propose some algorithms of optimization next to the Harmony Search Algorithm (HS), we applied this algorithms on some tests functions to prove why Harmony search is successful.","PeriodicalId":196827,"journal":{"name":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125842608","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}
F. R. Zakani, K. Arhid, Mohcine Bouksim, M. Aboulfatah, T. Gadi
{"title":"New measure for objective evaluation of mesh segmentation algorithms","authors":"F. R. Zakani, K. Arhid, Mohcine Bouksim, M. Aboulfatah, T. Gadi","doi":"10.1109/CIST.2016.7805083","DOIUrl":"https://doi.org/10.1109/CIST.2016.7805083","url":null,"abstract":"3D segmentation methods and their evaluation are important problems in computer graphics. Many 3D segmentation techniques are available in the literature, how to efficiently evaluate these methods is an important issue. In this paper we propose a new objective evaluation metric suitable for the evaluation of 3D segmentation methods, based on the Dice Coefficient (DC). Dice Coefficient is a similarity coefficient, designed to compute the degree of similarity between sample data sets. We extend this approach to mesh segmentation evaluation, since the regions of a segmented mesh can be seen as sample data sets. Many of the existing metrics does not take into consideration the irregularity of the 3D meshes, our proposal integrate the surface of faces in the adaptation of the Dice Coefficient to evaluate the segmentation of both regular and irregular meshes. Experimental results confirm the potential of the proposed metric.","PeriodicalId":196827,"journal":{"name":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131387157","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 cooperative traffic control for the vehicles in the intersection based on the Genetic Algorithm","authors":"Jinjian Li, M. Dridi, A. E. Moudni","doi":"10.1109/CIST.2016.7804962","DOIUrl":"https://doi.org/10.1109/CIST.2016.7804962","url":null,"abstract":"In this paper, a new cooperative control aiming at reducing the time delay is proposed in an isolated intersection without the traffic light. First of all, the control center receives the time range of arriving at the intersection from the vehicle by the communication of vehicle-to-infrastructure. Then a passing sequence is optimized by the Genetic Algorithm based on this range and sent to each vehicle individually, where the compatible streams are dynamically combined. At last, the vehicle plans its speed profile based on the given sequence. The simulation results prove the effectiveness of the proposed method by comparing with an exact algorithm and other papers.","PeriodicalId":196827,"journal":{"name":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126587041","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":"Improvement of information system security risk management","authors":"W. Abbass, Amine Baïna, M. Bellafkih","doi":"10.1109/CIST.2016.7805039","DOIUrl":"https://doi.org/10.1109/CIST.2016.7805039","url":null,"abstract":"The Information System Security Risk management (ISSRM) in organizations is ultimate for business success. ISSRM protects information availability, integrity, and privacy. However, this latter remains a difficult area to establish and maintain, especially in the environment of today's organizations where operations are conducted in a complex and interconnected context. The aim of this paper is to highlight the contribution of Enterprise Architecture Management (EAM) in order to improve ISSRM. When organization business services and strategic planning are aligned with proactive ISSRM activities, a well-defined strategy to reach business value is achieved. For this purpose, we will first explore risk management methods and security modeling languages to understand why EAM would be benefic. The contribution of this paper is an ISSRM model described by the constructs of ArchiMate, a well-known EAM modeling language.","PeriodicalId":196827,"journal":{"name":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132993210","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":"Sequencing optimization of products with high diversity","authors":"Akhrif Asmae, A. Lyhyaoui, A. Sedqui","doi":"10.1109/CIST.2016.7804976","DOIUrl":"https://doi.org/10.1109/CIST.2016.7804976","url":null,"abstract":"The article is about the sequencing optimization of products with high diversity in a production line to ensure a saving of time. The optimal sequencing aims at realizing products according to an order which assures a minimal change of tools. So and by exploiting the Group Technology methods. The similar products pass successively in the production. An industrial case is presented in a context where the supplier has to provide without delay to the customer a wide diversity of products. The study gives solutions of optimal sequencing; this depends on the level of knowledge or the type of used data (Number of common parts, tool changing time, and root product). For it and by using methods stemming from the graph theory, we shall propose measures of resemblance which will serve to find the Hamiltonian cycle of optimal length bound to a complete graph, in three cases. The optimal sequencing is presented by the optimal Hamiltonian cycle. Additional constraints on the priority and/or the urgency of products will be studied to reflect the industrial reality. Solutions adapted for each constraint will be given by modifying the optimal Hamiltonian obtained.","PeriodicalId":196827,"journal":{"name":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124222647","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}
G. Lancioni, Raoul Villano, Francesca Romana Romani
{"title":"The self-similar Qur'an project: Automatic detection of internal similarity in classical Arabic texts","authors":"G. Lancioni, Raoul Villano, Francesca Romana Romani","doi":"10.1109/CIST.2016.7805071","DOIUrl":"https://doi.org/10.1109/CIST.2016.7805071","url":null,"abstract":"A historically important tradition in exegesis, rooted in a number of scriptural passages, considers the Qur'an to be a self-similar text. This claim, while being sharply debated in literature, has never been independently tested. This paper proposes a strategy to measure self-similarity in classical Arabic texts, based on Leven-shtein distance, within the Self-Similar Qur'an (SSQ) project. The significance of self-similarity is checked against two tests: the similarity found in another religious text written in classical Arabic (the Arabic translation of the Diatessaron) and blind similarity judgments of uniformed readers on the translations of pairs of verses.","PeriodicalId":196827,"journal":{"name":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124433906","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":"Towards a generic framework for requirements traceability management for SysML language","authors":"Saida Haidrar, A. Anwar, O. Roudiès","doi":"10.1109/CIST.2016.7805044","DOIUrl":"https://doi.org/10.1109/CIST.2016.7805044","url":null,"abstract":"Requirements traceability provides support to check that the final system meets stakeholders' requirements. Although the important role of requirements traceability is widely recognized, the application of traceability methods remains limited and varies from one development team to another. In this work, we aim at providing a common approach for requirements traceability in case of complex system development. A generic framework has been devised to manage requirement traceability along system development process. We propose a metamodel in order to define trace models and give a representation for all system artifacts and trace links. We have then included a Trace generation activity based on an algorithm to automate the trace models extraction. We use a Temperature Control System in order to apply our traceability framework.","PeriodicalId":196827,"journal":{"name":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128264180","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}
Mohcine Bouksim, F. R. Zakani, K. Arhid, M. Aboulfatah, T. Gadi
{"title":"New evaluation method for 3D mesh segmentation","authors":"Mohcine Bouksim, F. R. Zakani, K. Arhid, M. Aboulfatah, T. Gadi","doi":"10.1109/CIST.2016.7805087","DOIUrl":"https://doi.org/10.1109/CIST.2016.7805087","url":null,"abstract":"Segmentation of 3D models plays a major role in many computer vision applications. Over the last few decades, extensive research has been done to propose many different segmentation algorithms. However, comparing the segmentation quality of multiple algorithms still a difficult task. Recently, many works have been proposed to solve this problem by comparing the segmentation resulting from an automatic algorithm, with a reference segmentation generally called a ground truth segmentation. As a result of this comparison a score of similarity/dissimilarity is extracted which represent the quality of the segmentation. Nevertheless, almost every 3D model has many reference segmentations, and comparing with just one ground truth cannot give a real representative score of the segmentation. In this paper we propose a new evaluation method inspired by the Jaro distance, which we adapt to evaluate 3D segmentation algorithms and to compare an automatic segmentation with a set of reference segmentations. Experimental results are reported in the last section of this paper to validate the proposed measure and compare it with others well-known measures.","PeriodicalId":196827,"journal":{"name":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129622746","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}