A proposal for student modeling based on ontologies and diagnosis rules

The advances in the educational field and the high complexity of student modeling have provoked it to be one of the aspects more investigated in Intelligent Tutoring Systems (ITSs). The Student Models (SMs) should not only represent the student’s knowledge, but rather they should reflect, as faithfully as possible, the student’s reasoning process. To facilitate this goal, in this article a new approach to student modeling is proposed that benefits from the advantages of Ontological Engineering, advancing in the pursue of a more granular and complete knowledge representation. It’s focused, mainly, on the SM cognitive diagnosis process, and we present a method providing a rich diagnosis about the student’s knowledge state – especially, about the state of learning objectives reached or not. The main goal is to achieve SMs with a good adaptability to the student’s features and a high flexibility for its integration in varied ITSs.     

Numerical identification of a nonlinear diffusion coefficient by discrete mollification

The discrete mollification method is a convolution-based filtering procedure suitable for the regularization of ill-posed problems. Combined with explicit space-marching finite difference schemes, it provides stability and convergence for a variety of coefficient identification problems in linear parabolic equations. In this paper, we extend such a technique to identify some nonlinear diffusion coefficients depending on an unknown space dependent function in one dimensional parabolic models. For the coefficient recovery process, we present detailed error estimates and to illustrate the performance of the algorithms, several numerical examples are included.     

Broadband system to increase bitrate in train communication networks

MVB (Multifunction Vehicle Bus), defined in IEC 61375, has been broadly adopted as the communication standard between embedded control systems on-board modern trains. In this work a new method to take advantage of the full bandwidth of the channel using an OFDM technique is described. With this new method it is possible to share the physical medium between standard MVB traffic and new OFDM traffic. A 90 Mbps theoretical bitrate can be achieved. The results of this work have been validated in a test bench including standard MVB nodes transmitting on a line similar to a real vehicle bus.     

Differential evolution solution to the SLAM problem

A new solution to the Simultaneous Localization and Modelling problem is presented in this paper. The algorithm is based on the stochastic search for solutions in the state space to the global localization problem by means of a differential evolution algorithm. This non linear evolutive filter, called Evolutive Localization Filter (ELF), searches stochastically along the state space for the best robot pose estimate. The set of pose solutions (the population) focuses on the most likely areas according to the perception and up to date motion information. The population evolves using the log-likelihood of each candidate pose according to the observation and the motion errors derived from the comparison between observed and predicted data obtained from the probabilistic perception and motion model.The proposed SLAM algorithm operates in two steps: in the first step the ELF filter is used at local level to re-localize the robot based on the robot odometry, the laser scan at a given position and a local map where only a low number of the last scans have been integrated. In the second step, the aligned laser measures and the corrected robot poses are used to detect whether the robot is revisiting a previously crossed area (i.e., a cycle in the robot trajectory exists). Once a cycle is detected, the Evolutive Localization Filter is used again to estimate the accumulated residual drift in the detected loop and then to re-estimate the robot poses in order to integrate the sensor measures in the global map of the environment.The algorithm has been tested in different environments to demonstrate the effectiveness, robustness and computational efficiency of the proposed approach.     

A revision of recent approaches for two-dimensional strip-packing problems

In this paper, we present a review of the recent approaches proposed in the literature for strip-packing problems. Many of them have been concurrently published, given some similar results for the same set of benchmarks. Due to the quantity of published papers, it is difficult to ascertain the level of current research in this area.     

Aerodynamic optimization via multi-objective micro-genetic algorithm with range adaptation,knowledge-based reinitialization,crowding and ε-dominance

In this study, an optimization of the airfoil of a sailplane is carried out by a recently developed multi-objective genetic algorithm based on microevolution, containing crowding, range adaptation, knowledge-based reinitialization and ε-dominance. Its efficiency was tested on a set of test problems. The results are encouraging, suggesting that very small populations can be used effectively to solve real-world multi-objective optimization problems in many cases of interest.     

Resilient overlay network for real-time interactive multimedia sessions in corporate networks

Real-time interactive multimedia communications are becoming increasingly useful for education, business, e-commerce and e-government, providing an enriched user experience in teleconferencing, e-meetings, distance training and product demonstrations. Large corporations are usually located at several sites, so real-time multipoint sessions within corporations are especially difficult. IP multicast is available or feasible within each site of an organization. Thus, corporate networks can be considered as various multicast-capable networks interconnected through a wide area network without multicast connectivity. This paper proposes a resilient self-managed overlay network to support real-time multipoint interactive sessions within corporate networks. The proposed overlay takes advantage of the configuration of corporate networks to self-organize and provide an efficient media delivery service, making use of multicast communications wherever available. Various self-healing techniques are implemented allowing for the continuity of ongoing sessions in spite of network disruptions and entity failures. Extensive simulations and tests have been carried out to assess the performance and resilience of the overlay facing several types of disruptions.     

A framework for virtual organization requirements

Virtual organizations (VOs) are formed by an alliance of organizations linked by a partnership for dealing with emerging challenges. Information and communication technologies play a fundamental role facilitating cooperation, communication and collaboration among the VO members. The formal identification and representation of Requirements Engineering (RE) for one organization have been researched to a large extent along with several elicitation techniques. However, these techniques are not adequate for covering the major challenges of RE for VO. We explore the work done in the management and RE fields to propose a model-based framework for eliciting VOs’ requirements. The goal is to analyze the VO from two points of view: border (intra-organizational, inter-organizational and extra-organizational) and abstract (intentional, organizational and operational). This article includes the framework validation with a case study and a transformation process to develop partial Business Process Diagram from the intentional models.     

The joint movement of pebbles in solving the ($$N^2-1$$)-puzzle suboptimally and its applications in rule-based cooperative path-finding

The present paper deals with the problem of solving the (\(n^2 - 1\))-puzzle and cooperative path-finding (CPF) problems sub-optimally by rule-based algorithms. To solve the puzzle, we need to rearrange \(n^2 - 1\) pebbles in the \(n \times n\)-sized square grid using one vacant position to achieve the goal configuration. An improvement to the existing polynomial-time algorithm is proposed and experimentally analyzed. The improved algorithm represents an attempt to move pebbles in a more efficient way compared to the original algorithm by grouping them into so-called snakes and moving them together as part of a snake formation. An experimental evaluation has shown that the snakeenhanced algorithm produces solutions which are 8–9 % shorter than the solutions generated by the original algorithm. Snake-like movement has also been integrated into the rule-based algorithms used in solving CPF problems sub-optimally, which is a closely related task. The task in CPF consists in moving a group of abstract robots on an undirected graph to specific vertices. The robots can move to unoccupied neighboring vertices; no more than one robot can be placed in each vertex. The (\(n^2 - 1\))-puzzle is a special case of CPF where the underlying graph is a 4-connected grid and only one vertex is vacant. Two major rule-based algorithms for solving CPF problems were included in our study—BIBOX and PUSH-and-SWAP (PUSH-and-ROTATE). The use of snakes in the BIBOX algorithm led to consistent efficiency gains of around 30 % for the (\(n^2 - 1\))-puzzle and up to 50 % in for CPF problems on biconnected graphs with various ear decompositions and multiple vacant vertices. For the PUSH-and-SWAP algorithm, the efficiency gain achieved from the use of snakes was around 5–8 %. However, the efficiency gain was unstable and hardly predictable for PUSH-and-SWAP.