Arabic Cooperative Answer Generation via Wikipedia Article Infoboxes

[EN] The typical question-answering system is facing many challenges related to the processing of questions and information resources in the extraction and generation of adequate answers. These challenges increase when the requested answer is cooperative and its language is Arabic. In this paper, we propose an original approach to generate cooperative answers for user-definitional questions designed to be integrated in a question-answering system. This approach is mainly based on the exploitation of the semi-structured Web knowledge which consists in using features derived from Wikipedia article infoboxes to generate cooperative answers. It is globally independent of a particular language, which gives it the ability to be integrated in any definitional question-answering system. We have chosen to integrate and experiment it in a definitional question-answering system dealing with the Arabic language entitled DefArabicQA. The results showed that this system has a significant impact on the approach efficiency regarding the improvement of the quality of the answer.The work of the third author was partially funded by the Spanish Ministry of Economy, Industry and Competitiveness (MINECO) under the SomEMBED research project (TIN2015-71147-C2-1-P) and by the Generalitat Valenciana under the grant ALMAMATER (PrometeoII/2014/030).Trigui, O.; Belguith, L.; Rosso, P. (2017). Arabic Cooperative Answer Generation via Wikipedia Article Infoboxes. Research in Computing Science. 132:129-153. http://hdl.handle.net/10251/103731S12915313

Arabic QA4MRE at CLEF 2012: Arabic Question Answering for Machine Reading Evaluation

This paper presents the work carried out at ANLP Research Group for the CLEF-QA4MRE 2012 competition. This year, the Arabic language was introduced for the first time on QA4MRE lab at CLEF whose intention was to ask questions which require a deep knowledge of individual short texts and in which systems were required to choose one answer from multiple answer choices, by analyzing the corresponding test document in conjunction with background collections. In our participation, we have proposed an approach which can answer questions with multiple answer choices from short Arabic texts. This approach is constituted essentially of shallow information retrieval methods. The evaluation results of the running submitted has given the following scores: accuracy calculated overall all questions is 0.19 (i.e., 31 correct questions answered correctly among 160), while overall c@1 measure is also 0.19. The overall results obtained are not enough satisfactory comparing to the top works realized last year in QA4MRE lab. But as a first step at the roadmap of the evolution of the QA to Machine Reading (MR) systems in Arabic language and with the lack of researches investigated in the MR and deep knowledge reasoning in Arabic language, it is an encouraging step. Our proposed approach with its shallow criterion has succeeded to obtain the goal fixed at the beginning which is: select answers to questions from short texts without required enough external knowledge and complex inference.Trigui, O.; Hadrich Belguith, L.; Rosso, P.; Ben Amor, H.; Gafsaoui, B. (2012). Arabic QA4MRE at CLEF 2012: Arabic Question Answering for Machine Reading Evaluation. CELCT. http://hdl.handle.net/10251/46315

Automated Attendance System

The Automated Attendance System will automatically capture students’ attendance using RFID and face recognition technology. The system is consisted of a camera, a RFID reader and tags, as well as a software system. The camera will capture the image of the user when he/she passes the RFID card by the reader. The RFID reader will collect the information from the tag, digitize it, and transmit it to the computer. The software will then retrieve the student information associated with the RFID tag, check whether the student is enrolled in the class and compare the student’s photo with the image captured by the camera. With our Automated Attendance System, the lecturer can easily and automatically keep track of student attendance and can check that the student themselves are taking the exam

SSVEP Enhancement Using Moving Average Filter Controlled by Phase Features

Brain-computer interface (BCI) systems translate the human neurophysiological activities into commands through EEG analysis. Improving the BCI performances leads to faster and easier use and less fatigue. In this study, we proposed a new prepossessing approach to increase the robustness of a steady-state visual evoked potential (SSVEP) based BCI. Inspiring from the known properties of the SSVEP frequency components, the goal was to enhance the signal quality by making it more convenient to be interpreted by the decision-making step. We first investigated the potential to detect the deteriorating periods based on the physiological properties of the SSVEP. The proposed system localizes the intervals which can obscure the SSVEP frequencies by a new algorithm founded on the processing and the analysis of the instantaneous phase. The piecewise linear regression allows a sampler comprehension of the phase signal. Then, these intervals are filtered by the moving average filter to enhance the SSVEP quality. Finally, the decision making is made by the canonical correlation analysis (CCA) algorithm. The results of experiments, using real EEG signals from five subjects, show that the proposed approach significantly increases the performances in terms of accuracy and information transfer rate by about 7.3% and 3.85 bits/min, respectively, in case of 2 s segment length. On the other hand, the spatial filtering methods of the literature weaken the system performances

FL-MTSP: a fuzzy logic approach to solve the multi-objective multiple traveling salesman problem for multi-robot systems

This paper considers the problem of assigning target locations to be visited by mobile robots. We formulate the problem as a multiple-depot multiple traveling salesman problem (MD-MTSP), an NP-Hard problem instance of the MTSP. In contrast to most previous works, we seek to optimize multiple performance criteria, namely the maximum traveled distance and the total traveled distance, simultaneously. To address this problem, we propose, FL-MTSP, a new fuzzy logic approach that combines both metrics into a single fuzzy metric, reducing the problem to a single-objective optimization problem. Extensive simulations show that the proposed fuzzy logic approach outperforms an existing centralized Genetic Algorithm (MDMTSP_GA) in terms of providing a good trade-off of the two performance metrics of interest. In addition, the execution time of FL-MTSP was shown to be always faster than that of the MDMTSP_GA approach, with a ratio of 89 %.info:eu-repo/semantics/publishedVersio

A clustering market-based approach for multi-robot emergency response applications

In this paper, we address the problem of multi-robot systems in emergency response applications, where a team of robots/drones has to visit affected locations to provide rescue services. In the literature, the most common approach is to assign target locations individually to robots using centralized or distributed techniques. The problem is that the computation complexity increases significantly with the number of robots and target locations. In addition, target locations may not be assigned uniformly among the robots. In this paper, we propose, CMMTSP, a clustering market-based approach that first groups locations into clusters, then assigns clusters to robots using a market-based approach. We formulate the problem as multipledepot MTSP and address the multi-objective optimization of three objectives namely, the total traveled distance, the maximum traveled distance and the mission time. Simulations show that CM-MTSP provides a better balance among the three objectives as compared to a single objective optimization, in particular an enhancement of the mission time, and reduces the execution time to at least 80% as compared to a greedy approach.info:eu-repo/semantics/publishedVersio

FL-MTSP: a fuzzy logic approach to solve the multi-objective multiple traveling salesman problem for multi-robot systems

This paper considers the problem of assigning target locations to be visited by mobile robots. We formulate the problem as a multiple-depot multiple traveling salesman problem (MD-MTSP), an NP-Hard problem instance of the MTSP. In contrast to most previous works, we seek to optimize multiple performance criteria, namely the maximum traveled distance and the total traveled distance, simultaneously. To address this problem, we propose, FL-MTSP, a new fuzzy logic approach that combines both metrics into a single fuzzy metric, reducing the problem to a single-objective optimization problem. Extensive simulations show that the proposed fuzzy logic approach outperforms an existing centralized Genetic Algorithm (MDMTSP_GA) in terms of providing a good trade-off of the two performance metrics of interest. In addition, the execution time of FL-MTSP was shown to be always faster than that of the MDMTSP_GA approach, with a ratio of 89 %.info:eu-repo/semantics/publishedVersio

An Analytical Hierarchy Process-Based Approach to Solve the Multi-Objective Multiple Traveling Salesman Problem

We consider the problem of assigning a team of autonomous robots to target locations in the context of a disaster management scenario while optimizing several objectives. This problem can be cast as a multiple traveling salesman problem, where several robots must visit designated locations. This paper provides an analytical hierarchy process (AHP)-based approach to this problem, while minimizing three objectives: the total traveled distance, the maximum tour, and the deviation rate. The AHP-based approach involves three phases. In the first phase, we use the AHP process to define a specific weight for each objective. The second phase consists in allocating the available targets, wherein we define and use three approaches: market-based, robot and task mean allocation-based, and balanced-based. Finally, the third phase involves the improvement in the solutions generated in the second phase. To validate the efficiency of the AHP-based approach, we used MATLAB to conduct an extensive comparative simulation study with other algorithms reported in the literature. The performance comparison of the three approaches shows a gap between the market-based approach and the other two approaches of up to 30%. Further, the results show that the AHP-based approach provides a better balance between the objectives, as compared to other state-of-the-art approaches. In particular, we observed an improvement in the total traveled distance when using the AHP-based approach in comparison with the distance traveled when using a clustering-based approach.info:eu-repo/semantics/publishedVersio

Foundations, Algorithms and Experimentations

This book presents extensive research on two main problems in robotics: the path planning problem and the multi-robot task allocation problem. It is the first book to provide a comprehensive solution for using these techniques in large-scale environments containing randomly scattered obstacles. The research conducted resulted in tangible results both in theory and in practice. For path planning, new algorithms for large-scale problems are devised and implemented and integrated into the Robot Operating System (ROS). The book also discusses the parallelism advantage of cloud computing techniques to solve the path planning problem, and, for multi-robot task allocation, it addresses the task assignment problem and the multiple traveling salesman problem for mobile robots applications. In addition, four new algorithms have been devised to investigate the cooperation issues with extensive simulations and comparative performance evaluation. The algorithms are implemented and simulated in MATLAB and Webots.info:eu-repo/semantics/publishedVersio