It’s worth noting that the present paper lies within the range of modeling the learner in adaptive educational system as a conceptual modeling of the learner. Thought they are several methods that deal with the learner model; like stereotypes methods or learner profile…, but they are likely unable to handle the uncertainty embedded in the dynamic modeling of the learner. The present paper aims at studding different models and approaches to model the learner in an adaptive educational systems, and coming up with the most appropriate method based on the dynamic aspect of this model.
The aim of this study is the argue that the learner model cannot be completely modeled based on one single method through the entire development process, but it needs a combination between several methods that will help for a complete modeling.

In this paper, a high-speed and low-cost image processing framework based on MATLAB-FPGA interface is proposed that can be used in researches aiming at developing wide variety of not only image processing tasks but also many signal processing applications. In addition, this new framework could be exploited for several other tasks such as on-chip verification, using PC as an enormous external RAM for FPGA while preserving high speed data access, developing hardware-software co-designs, etc. The communication between FPGA and MATLAB is via 1Gbs Ethernet based on UDP/IP protocol which is very promising for high speed data transmission in point-to-point communications. UDP stack is efficiently designed in FPGA based on a fully pipelined architecture with minimum level of logic in order to reach high performance.. Dynamic data transmission between the UDP stack, memory and an arbitrary image processing module makes it possible to practically simulate, debug and implement most relevant applications. The hardware system is relatively low-cost and it consumes a negligible area of a Spartan-6 LXT45 Xilinx FPGA. Operating at 1 Gb/s, theoretically, the system is capable of processing 132 frames of 640*480 color images in a second. The effectiveness of the system is evaluated by means of both place and route simulation and practical implementation of a skin detection algorithm and a motion detector.

On the basis of power-cycle nested network graph, the edge-balanced index sets of circle union graph F(3,n) graph were investigated. A new method of changing index is provided, simplifying the proving process. It reduced the difficulty of circle union graph F(3,n) graph labeling because of the novel design of the basic graph and single-point sector subgraph. The results show that the edge-balanced index sets of circle union graph F(3,n) graph. This paper has proved the existence of the edge-balanced index sets of one class of circle union graph, the computational formulas and the construction of the corresponding graphs are also provided.

Personal name ambiguity in the web arises when more than one person shares the same name. Personal name disambiguation involves disambiguating the name by clustering web page collection such that each cluster represents a person having the ambiguous name. In this paper, a personal name disambiguation technique that makes use of rich set of features like Nouns, Noun phrases, and frequent keywords as features is proposed. The proposed method consists of two phases namely clustering seed pages and then clustering the actual web page collection. In the first phase, seed pages representing different namesakes are clustered and in the second phase, web pages in the collection are clustered with the similar seed page clusters. The usage of seed pages increases the accuracy of clustering process. Since it is difficult to predict the number of clusters need to be formed beforehand, the proposed technique uses Elbow method to calculate the number of clusters. The efficiency of the proposed name disambiguation technique is tested using both synthetic and organic datasets. Experimental result shows the proposed method achieves robust results across different datasets and outperforms many existing methods.

Massive increase in usage of World Wide Web makes it affective in every domain of life. Billions of people from different corners of world use internet for diverse purposes on daily bases. Quality acts as important key factor for web applications. Various methodologies have been proposed and many techniques have been deployed but, quality still lags behind. Our study in-focuses a detailed survey based on methodologies, metrics and architecture that are used in modeling of web application. We carried out analysis and comparisons between techniques and evaluate major quality characteristics. Study at conclusion illustrates that beside functional requirements, non-functional requirements are also essential and acts as backbone for quality in web based applications.

Smart world needs intelligent system for effective and timely decision making. This is achieved only through a knowledge based system with functional knowledge representation units. In this paper, two models are proposed for representing knowledge. This process involves in getting the data and placing the information in the correct location. Logical notations are used for taking the clauses and graph is used for putting the entities. In Model one, the data is translated into logical statements using predicate logics, later the knowledge is stored in conceptual graph and retrieved. Whereas in Model two, the given information is translated using First Order Logic (FOL), by applying description logic concept rules are defined and as a result reasoning is done. Storage is done by using concept-relation graph. The main aims of our models are to have easy and simple access over the information. These models return the required exact answer, for the higher order query posted by the end user to the intelligent system.

The present paper proposes a new approach for the effective weighted association rule mining. The proposed approach utilizes the power of Rough Set Theory for obtaining reduct of the targeted dataset. Additionally, approach takes the benefit for weighted measures and the Genetic Algorithm for the generation of the desired set of rules. Enough analysis of proposed approach has been done and observed that the approach works as per the expectation and will be beneficial in situation when there is a requirement for the consideration of hidden rules(maximizing generated rules) in decision-making process.

Cloud computing has proposed a new perspective for provisioning the large-scale computing resources by using virtualization technology and a pay-per-use cost model. Load balancing is taken into account as a vital part for parallel and distributed systems. It helps cloud computing systems by improving the general performance, better computing resources utilization, energy consumption management, enhancing the cloud services' QoS, avoiding SLA violation and maintaining system stability through distribution, controlling and managing the system workloads. In this paper we study the necessary requirements and considerations for designing and implementing a suitable load balancer for cloud environments. In addition we represent a complete survey of current proposed cloud load balancing solutions which according to our classification, they can be classified into three categories: General Algorithm-based, Architectural-based and Artificial Intelligence-based load balancing mechanisms. Finally, we propose our evaluation of these solutions based on suitable metrics and discuss their pros and cons.