Innovative Techniques for the Implementation of Adaptive Mobile Learning Using the Semantic Web

Adaptive Mobile Learning has constantly faced many challenges in order to make course learning more adaptive. This research presents a conceptual framework for using the Semantic Web to obtain students’ data from other educational institutions, enabling the educational institutions to communicate and exchange students’ data. We then can use this information to adjust the students’ profiles and modify their learning paths. Semantic Web will create a more personalized dynamic course for each student according to his/her ability, educational level, and experience. Through the Semantic Web, our goal is to create an adaptive learning system that takes into consideration previously completed courses, to count the completed topics, and then adjust the leaning path graph accordingly to get a new shortest path. We have applied the developed model on our system. Then, we tested the students on our system and a control system to measure the improvements in the students’ learning. We also have analyzed the results collected from the AML Group and the Control Group. The AML system provided a 44.80% improvement over the Control System. The experimental results demonstrate that Semantic Web can be used with adaptive mobile learning system (AML) in order to enhance the students’ learning experience and improve their academic performance

Using string-matching to analyze hypertext navigation

A method of using string-matching to analyze hypertext navigation was developed, and evaluated using two weeks of website logfile data. The method is divided into phases that use: (i) exact string-matching to calculate subsequences of links that were repeated in different navigation sessions (common trails through the website), and then (ii) inexact matching to find other similar sessions (a community of users with a similar interest). The evaluation showed how subsequences could be used to understand the information pathways users chose to follow within a website, and that exact and inexact matching provided complementary ways of identifying information that may have been of interest to a whole community of users, but which was only found by a minority. This illustrates how string-matching could be used to improve the structure of hypertext collections

Thin-Wall Machining of Light Alloys: A Review of Models and Industrial Approaches

Thin-wall parts are common in the aeronautical sector. However, their machining presents serious challenges such as vibrations and part deflections. To deal with these challenges, di erent approaches have been followed in recent years. This work presents the state of the art of thin-wall light-alloy machining, analyzing the problems related to each type of thin-wall parts, exposing the causes of both instability and deformation through analytical models, summarizing the computational techniques used, and presenting the solutions proposed by di erent authors from an industrial point of view. Finally, some further research lines are proposed

Use of implicit graph for recommending relevant videos: a simulated evaluation

In this paper, we propose a model for exploiting community based usage information for video retrieval. Implicit usage information from a pool of past users could be a valuable source to address the difficulties caused due to the semantic gap problem. We propose a graph-based implicit feedback model in which all the usage information can be represented. A number of recommendation algorithms were suggested and experimented. A simulated user evaluation is conducted on the TREC VID collection and the results are presented. Analyzing the results we found some common characteristics on the best performing algorithms, which could indicate the best way of exploiting this type of usage information

eCMT-SCTP: Improving Performance of Multipath SCTP with Erasure Coding Over Lossy Links

Performance of transport protocols on lossy links is a well-researched topic, however there are only a few proposals making use of the opportunities of erasure coding within the multipath transport protocol context. In this paper, we investigate performance improvements of multipath CMT-SCTP with the novel integration of the on-the-fly erasure code within congestion control and reliability mechanisms. Our contributions include: integration of transport protocol and erasure codes with regards to congestion control; proposal for a variable retransmission delay parameter (aRTX) adjustment; performance evaluation of CMT-SCTP with erasure coding with simulations. We have implemented the explicit congestion notification (ECN) and erasure coding schemes in NS-2, evaluated and demonstrated results of improvement both for application goodput and decline of spurious retransmission. Our results show that we can achieve from 10% to 80% improvements in goodput under lossy network conditions without a significant penalty and minimal overhead due to the encoding-decoding process

Using Markov Chains for link prediction in adaptive web sites

The large number of Web pages on many Web sites has raised navigational problems. Markov chains have recently been used to model user navigational behavior on the World Wide Web (WWW). In this paper, we propose a method for constructing a Markov model of a Web site based on past visitor behavior. We use the Markov model to make link predictions that assist new users to navigate the Web site. An algorithm for transition probability matrix compression has been used to cluster Web pages with similar transition behaviors and compress the transition matrix to an optimal size for efficient probability calculation in link prediction. A maximal forward path method is used to further improve the efficiency of link prediction. Link prediction has been implemented in an online system called ONE (Online Navigation Explorer) to assist users' navigation in the adaptive Web site