Most learning systems applied to problem solving have the goal of learning knowledge for solving problems more eeciently. However, very few systems have focused on the acquisition of planning operator descriptions. In this paper, we present a system that learns operator deenitions from the interaction with a completely unknown environment. In order to achieve better learning convergence, severa...

A robotic intelligent wheelchair system based on obstacle avoidance and navigation functions Mohammed Alshraideh, Basel A. Mahafzah, Saleh Al-Sharaeh & Ziad M. Hawamdeh a Department of Computer Science, King Abdullah II School for Information Technology, The University of Jordan, Amman 11942, Jordan b Department of Special Surgery, Faculty of Medicine, The University of Jordan, Amman 11942, Jor...

Analysis and Identification of Malicious JavaScript Code Mohammad Fraiwan a , Rami Al-Salman a , Natheer Khasawneh b & Stefan Conrad c a Department of Computer Engineering, Jordan University of Science and Technology, Irbid, Jordan b Department of Software Engineering, Jordan University of Science and Technology, Irbid, Jordan c Institute of Computer Science, Heinrich-Heine University, Düesseld...

This lecture introduces the Jordan canonical form of a matrix — we prove that every square matrix is equivalent to a (essentially) unique Jordan matrix and we give a method to derive the latter. We also introduce the notion of minimal polynomial and we point out how to obtain it from the Jordan canonical form. Finally, we make an encounter with companion matrices. 1 Jordan form and an applicati...

In this paper, we study and analyze the algebraic structure of the circular cone. We establish a new efficient spectral decomposition, set up the Jordan algebra associated with the circular cone, and prove that this algebra forms a Euclidean Jordan algebra with a certain inner product. We then show that the cone of squares of this Euclidean Jordan algebra is indeed the circular cone itself. The...

Let K be a field of characteristic zero. For integers n,D≥1, let Jn(D) the degree n component free Jordan algebra J(D) over D generators. A conjecture for character (in particular dimension) GL(D)-module is proposed. sl2J(D) Tits-Allison-Gao construction J(D). Two natural conjectures homology Lie are stated, and each them implies previous conjecture. The cyclicity structures, namely that symmet...

background: the control of spread of hiv takes concerted efforts at both national and international levels. education is an important component of preventing the spread of hiv. this study aimed to assess the attitudes of parents, teachers and students towards informing children about hiv/aids, attitudes concerning 'proper' age to learn about hiv/aids, possible differences in attitudes relating ...

We take an algorithmic and computational approach to a basic problem in abstract algebra: determining the correct generalization to dialgebras of a given variety of nonassociative algebras. We give a simplified statement of the KP algorithm introduced by Kolesnikov and Pozhidaev for extending polynomial identities for algebras to corresponding identities for dialgebras. We apply the KP algorith...

A Novel High Quality High Capacity Image Hiding Scheme Based on Image Compression and an Optical Pixel Adjustment Process Lo'ai A. Tawalbeh a , Omar Banimelhem b & Mohammed Al-Batati b a Department of Computer Engineering, Jordan University of Science and Technology (JUST), Irbid, Jordan b Department of Network Engineering and Security, Jordan University of Science and Technology (JUST), Irbid,...

A commutative loop is Jordan if it satisfies the identity x2(yx) = (x2y)x. Using an amalgam construction and its generalizations, we prove that a nonassociative Jordan loop of order n exists if and only if n ≥ 6 and n 6= 9. We also consider whether powers of elements in Jordan loops are well-defined, and we construct an infinite family of finite simple nonassociative Jordan loops.