Ismail Ghrab, Mounir Ketata, Zied Loukil, F. Gargouri
{"title":"Using constraint programming techniques to improve incident management process in ITIL","authors":"Ismail Ghrab, Mounir Ketata, Zied Loukil, F. Gargouri","doi":"10.1109/ICAIPR.2016.7585231","DOIUrl":"https://doi.org/10.1109/ICAIPR.2016.7585231","url":null,"abstract":"ITIL is a large collection of best practices, tools and methods used in the management and handling of IT services. It's composed of five books related to the most important IT management fields. In this paper, we will place the emphasis on the Service Operation field in ITIL and more precisely, on the incident management process used for managing the life cycle of IT incidents. The main idea is to find a solution for an automated optimal planning of interventions in the incident management process. Indeed, despite the number of software solutions for incident management process, intervention planning is still a manual task due to the high complexity of its automation. In this paper, we propose two solutions for automated optimal planning of interventions in the incident management. The first is inspired by the vehicle routing problems and the second is inspired by the constraint-based problems. Eventually, we will compare between the results of these two solution.","PeriodicalId":127231,"journal":{"name":"2016 Third International Conference on Artificial Intelligence and Pattern Recognition (AIPR)","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130040051","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":"Latent fingerprint wavelet transform image enhancement technique for optical coherence tomography","authors":"Sisanda Makinana, Portia Khanyile, R. Khutlang","doi":"10.1109/ICAIPR.2016.7585203","DOIUrl":"https://doi.org/10.1109/ICAIPR.2016.7585203","url":null,"abstract":"In crime investigation, fingerprint identification plays a major role in identifying culprits. However, traditional procedure of acquiring latent fingerprint tends to be destructive and leads to a limitation of not being able to do further analyses like DNA. Being able to acquire latent fingerprints without physical contact with the surface could be advantageous. These advantages are as follows; being able to acquire the imprint multiple times, there is no physical or chemical processing of a substrate, the substrate can be concurrently analysed for DNA and can provide a non-destructive lifting of the fingerprint. An Optical Coherence Tomography machine is one of the promising technology that may be used for imaging latent fingerprint without contacting or destructing the fingerprint impression left on a substrate. However, owing to the coherent nature of the image formation process, OCT images suffer from speckle noise which limits the contrast of OCT images. In this paper, an algorithm that enhances this OCT latent fingerprint image to ensure reliable extraction of features is proposed. To test the proposed algorithm latent prints were collected and stored as a database. Two statistical and biometric system measurement namely False Match Rate (FMR) and Equal Error Rate (EER) were used. The results of these two measures gives the FMR of 3% and EER of 1.9% for denoised images which is better than non-denoised images where the EER is 8.7%.","PeriodicalId":127231,"journal":{"name":"2016 Third International Conference on Artificial Intelligence and Pattern Recognition (AIPR)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116087123","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}
Maciej Soltysiak, P. Kolendo, Michal Szuca, Tomasz Ogryczak
{"title":"Adaptive algorithm of generator reactive power control range expansion in national grid system","authors":"Maciej Soltysiak, P. Kolendo, Michal Szuca, Tomasz Ogryczak","doi":"10.1109/ICAIPR.2016.7585221","DOIUrl":"https://doi.org/10.1109/ICAIPR.2016.7585221","url":null,"abstract":"Aim of this work was to create an adaptive method allowing effective use of generator reactive power in coordinated voltage control system independently of its parameters and Automatic Voltage Controller (AVR) type. Two methods were tested, one based on artificial neural networks classification and second based on modifying voltage limiter curve constructed on base of domain experts knowledge.","PeriodicalId":127231,"journal":{"name":"2016 Third International Conference on Artificial Intelligence and Pattern Recognition (AIPR)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123669342","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":"Building of hardware-in-the-loop simulation platform based on vehicle-infrastructure cooperation environment","authors":"Shuoji Feng, Z. Guan, F. Du","doi":"10.1109/ICAIPR.2016.7585218","DOIUrl":"https://doi.org/10.1109/ICAIPR.2016.7585218","url":null,"abstract":"Intelligent transport systems make the structure of the road traffic more smoothly, and reduce traffic accidents. In the future the development of intelligent transport systems, the core of the research is the vehicle-infrastructure cooperation system. The cooperative vehicle infrastructure system environment is a comprehensive system including advanced information technology, communication technology, and sensor technology etc. Based on the hardware in the loop technology, a miniature vehicle-infrastructure cooperation system has been developed independently after demand analysis to simulation and test. Some simulation tests of multiple road conditions have been carried out in this platform, the test results show this integrated test platform is effective and reliable in simulating real traffic environment. Therefore, this constructed simulation platform can be used to research vehicle-infrastructure cooperation technology.","PeriodicalId":127231,"journal":{"name":"2016 Third International Conference on Artificial Intelligence and Pattern Recognition (AIPR)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134448458","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 detection method for network security based on the combination of support vector machine","authors":"Xiaoqi Gu, Xiaoyong Li","doi":"10.1109/ICAIPR.2016.7585222","DOIUrl":"https://doi.org/10.1109/ICAIPR.2016.7585222","url":null,"abstract":"In this paper, we use a combination of support vector machine to improve the Standard SVM, which combine different kernel functions to improve the SVM' learning ability and generalization ability, thereby improving the performance of a combination SVM kernel function, and avoiding the assertiveness of the single prediction model. Combination forecasting model to make joint decisions on the results, making predictions more accurate. At the same time, taking advantage of Particle swarm optimization algorithm to overcome existing problems: the poor randomness and global of support vector machine parameters. And the particle swarm because of its global search capability, simple model, fast convergence, has a great advantage in dealing with the problem of high dimension, and the Particle swarm optimization in this paper is an improved Particle swarm optimization algorithm.","PeriodicalId":127231,"journal":{"name":"2016 Third International Conference on Artificial Intelligence and Pattern Recognition (AIPR)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121554351","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. Soliman, Mohamed Fares, M. Elhefnawi, Mahmoud Al-Hefnawy
{"title":"Features selection for building an early diagnosis machine learning model for Parkinson's disease","authors":"A. Soliman, Mohamed Fares, M. Elhefnawi, Mahmoud Al-Hefnawy","doi":"10.1109/ICAIPR.2016.7585225","DOIUrl":"https://doi.org/10.1109/ICAIPR.2016.7585225","url":null,"abstract":"In this work, different approaches were evaluated to optimize building machine learning classification models for the early diagnosis of the Parkinson disease. The goal was to sort the medical measurements and select the most relevant parameters to build a faster and more accurate model using feature selection techniques. Decreasing the number of features to build a model could lead to more efficient machine learning algorithm and help doctors to focus on what are the most important measurements to take into account. For feature selection we compared the Filter and Wrapper techniques. Then we selected a good machine learning algorithm to detect which technique could help us by calculate the crossover scores for each technique. This research is based on a dataset which was created by Athanasius Tsanas and Max Little of the University of Oxford, in collaboration with 10 medical centers in the US and Intel Corporation. This target of these medical measurements is to find the Unified Parkinson's disease rating scale (UPDRS) which is the most commonly used scale for clinical studies of Parkinson's disease.","PeriodicalId":127231,"journal":{"name":"2016 Third International Conference on Artificial Intelligence and Pattern Recognition (AIPR)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115652761","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":"Motion background modeling based on context-encoder","authors":"Zhenshen Qu, Shuanghui Yu, Mengyu Fu","doi":"10.1109/ICAIPR.2016.7585207","DOIUrl":"https://doi.org/10.1109/ICAIPR.2016.7585207","url":null,"abstract":"A background modeling method for motion-based background of a video made by moving camera is proposed in this paper. We utilize the recently proposed context-encoder to model the motion-based background from a dynamic foreground. This method aims to restore the overall scene of a video by removing the moving foreground objects and learning the feature of its context. An advantage of this method is that the performance of background modeling will not be affected when the camera is moving fast.","PeriodicalId":127231,"journal":{"name":"2016 Third International Conference on Artificial Intelligence and Pattern Recognition (AIPR)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130351684","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. Panayotova, G. Dimitrov, Pavel Petrov, Bychkov Os
{"title":"Modeling and data processing of information systems","authors":"G. Panayotova, G. Dimitrov, Pavel Petrov, Bychkov Os","doi":"10.1109/ICAIPR.2016.7585229","DOIUrl":"https://doi.org/10.1109/ICAIPR.2016.7585229","url":null,"abstract":"This paper analyses data modeling and approaches for finding regularities in large sets of data, as well as their application. The applications of the presented approaches are based on data derived from a relatively large information system (University of Library Studies and Information Technologies, Sofia, Bulgaria). This paper presents models and techniques to determine optimal speed of data processing and define critical points. The results are also analyzed and discussed. At the end of the paper we provide an instance with a large sample of the real observations and all results are illustrated with examples.","PeriodicalId":127231,"journal":{"name":"2016 Third International Conference on Artificial Intelligence and Pattern Recognition (AIPR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116321642","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":"Multi-view matching points extraction algorithm based on union find sets","authors":"Jun Lu, Baoming Zhang, Haitao Guo, Chuan Zhao","doi":"10.1109/ICAIPR.2016.7585209","DOIUrl":"https://doi.org/10.1109/ICAIPR.2016.7585209","url":null,"abstract":"The extraction of multi-view matching points is one of the key elements in 3D reconstruction of multi-view image scene, because the extraction results will directly affect the accuracy of 3D reconstruction. With the conversion from the extraction of multi-view matching points to dynamic connectivity, a solution based on the Union Find algorithm was designed. The efficient tree structure with parent-link was used to organize the nodes in the Union Find sets, so that it was only needed to modify the addressing parameter of a single node in each process of adding the matching points pair, which avoided the computational process of the traversal array to compare with addressing parameter and improved the efficiency to find and modify. At the same time, the weighted method was applied to optimize the algorithm and the weighted encoding method was used to replace the commonly used hard encoding, which can balance the dendrogram structure and reduce the average depth of nodes in the tree. Experimental results of multiple groups of image sets showed that, compared with the traditional breadth-first search algorithm, the algorithm based on Union Find had higher reliability and computational efficiency.","PeriodicalId":127231,"journal":{"name":"2016 Third International Conference on Artificial Intelligence and Pattern Recognition (AIPR)","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115814052","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. Dimitrov, G. Panayotova, I. Garvanov, Bychkov Os, Pavel Petrov, Angel Angelov
{"title":"Performance analysis of the method for social search of information in university information systems","authors":"G. Dimitrov, G. Panayotova, I. Garvanov, Bychkov Os, Pavel Petrov, Angel Angelov","doi":"10.1109/ICAIPR.2016.7585228","DOIUrl":"https://doi.org/10.1109/ICAIPR.2016.7585228","url":null,"abstract":"In this article the effectiveness of one of the main methods for assisting the information search in large data sets is analyzed, namely the method based on the social approach. This method analyzes the behavior of multiple users when searching for information, particularly the keywords they use. Based on the obtained results, the relevant algorithms in the searching engines of the organizations can be optimized. The studies are based on data extracted from the databases of two relatively large information systems based at the University in Library Studies and Information Technologies in Sofia, Bulgaria and University of Economics in Varna, Bulgaria. The numerical and experimental results are analyzed and discussed.","PeriodicalId":127231,"journal":{"name":"2016 Third International Conference on Artificial Intelligence and Pattern Recognition (AIPR)","volume":"593 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116557593","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}