Multi-level pedagogical model for the personalization of pedagogical strategies in intelligent tutoring systems

Pedagogic strategies are action plans designed to manage issues related to sequencing and content organization, specifying learning activities, and deciding how to deliver content and activities in teaching processes. In this paper, we present an approach to personalization of pedagogical strategies in Intelligent Tutoring Systems using pedagogical knowledge rules in a Web environment. The adaptation of pedagogical strategies is made based on a multilevel pedagogical model. An Intelligent Tutoring Systems called FUNPRO was developed to validate the multilevel pedagogical model. The results of empirical tests show that the multilevel pedagogical model enables FUNPRO to improve the process of personalization of pedagogical strategies, due to the reduction of inappropriate recommendations

Information technology applications in construction safety assurance

Through analysis of articles published from 2006 to July 2014 this paper summarizes the topics of research and the institutions where research was conducted in the field of computer-based construction safety engineering management. One hundred and thirty-six articles published during this time focused on Information Technology (IT) applications in this field were selected for analysis. The underlying research topics and their related IT implementations are discussed, and research trends in allied specialties are identified

Real-Time Evaluation of Breast Self-Examination Using Computer Vision

Breast cancer is the most common cancer among women worldwide and breast self-examination (BSE) is considered as the most cost-effective approach for early breast cancer detection. The general objective of this paper is to design and develop a computer vision algorithm to evaluate the BSE performance in real-time. The first stage of the algorithm presents a method for detecting and tracking the nipples in frames while a woman performs BSE; the second stage presents amethod for localizing the breast region and blocks of pixels related to palpation of the breast, and the third stage focuses on detecting the palpated blocks in the breast region. The palpated blocks are highlighted at the time of BSE performance. In a correct BSE performance, all blocks must be palpated, checked, and highlighted, respectively. If any abnormality, such as masses, is detected, then this must be reported to a doctor to confirm the presence of this abnormality and proceed to perform other confirmatory tests. The experimental results have shown that the BSE evaluation algorithm presented in this paper provides robust performance

Real-Time Evaluation of Breast Self-Examination Using Computer Vision

Breast cancer is the most common cancer among women worldwide and breast self-examination (BSE) is considered as the most cost-effective approach for early breast cancer detection. The general objective of this paper is to design and develop a computer vision algorithm to evaluate the BSE performance in real-time. The first stage of the algorithm presents a method for detecting and tracking the nipples in frames while a woman performs BSE; the second stage presents amethod for localizing the breast region and blocks of pixels related to palpation of the breast, and the third stage focuses on detecting the palpated blocks in the breast region. The palpated blocks are highlighted at the time of BSE performance. In a correct BSE performance, all blocks must be palpated, checked, and highlighted, respectively. If any abnormality, such as masses, is detected, then this must be reported to a doctor to confirm the presence of this abnormality and proceed to perform other confirmatory tests. The experimental results have shown that the BSE evaluation algorithm presented in this paper provides robust performance

Assessment of the worthwhileness of efficient driving in railway systems with high-receptivity power supplies

Eco-driving is one of the most important strategies for significantly reducing the energy consumption of railways with low investments. It consists of designing a way of driving a train to fulfil a target running time, consuming the minimum amount of energy. Most eco-driving energy savings come from the substitution of some braking periods with coasting periods. Nowadays, modern trains can use regenerative braking to recover the kinetic energy during deceleration phases. Therefore, if the receptivity of the railway system to regenerate energy is high, a question arises: is it worth designing eco-driving speed profiles? This paper assesses the energy benefits that eco-driving can provide in different scenarios to answer this question. Eco-driving is obtained by means of a multi-objective particle swarm optimization algorithm, combined with a detailed train simulator, to obtain realistic results. Eco-driving speed profiles are compared with a standard driving that performs the same running time. Real data from Spanish high-speed lines have been used to analyze the results in two case studies. Stretches fed by 1 × 25 kV and 2 × 25 kV AC power supply systems have been considered, as they present high receptivity to regenerate energy. Furthermore, the variations of the two most important factors that affect the regenerative energy usage have been studied: train motors efficiency ratio and catenary resistance. Results indicate that the greater the catenary resistance, the more advantageous eco-driving is. Similarly, the lower the motor efficiency, the greater the energy savings provided by efficient driving. Despite the differences observed in energy savings, the main conclusion is that eco-driving always provides significant energy savings, even in the case of the most receptive power supply network. Therefore, this paper has demonstrated that efforts in improving regenerated energy usage must not neglect the role of eco-driving in railway efficiency

Composition of Web Services Using Markov Decision Processes and Dynamic Programming

We propose a Markov decision process model for solving the Web service composition (WSC) problem. Iterative policy evaluation, value iteration, and policy iteration algorithms are used to experimentally validate our approach, with artificial and real data. The experimental results show the reliability of the model and the methods employed, with policy iteration being the best one in terms of the minimum number of iterations needed to estimate an optimal policy, with the highest Quality of Service attributes. Our experimental work shows how the solution of a WSC problem involving a set of 100,000 individual Web services and where a valid composition requiring the selection of 1,000 services from the available set can be computed in the worst case in less than 200 seconds, using an Intel Core i5 computer with 6 GB RAM. Moreover, a real WSC problem involving only 7 individual Web services requires less than 0.08 seconds, using the same computational power. Finally, a comparison with two popular reinforcement learning algorithms, sarsa and Q-learning, shows that these algorithms require one or two orders of magnitude and more time than policy iteration, iterative policy evaluation, and value iteration to handle WSC problems of the same complexity