We follow the rules: i, j, m, n, k denote natural numbers, K denotes a field, and a, λ denote elements of K. Let us consider K, λ, n. The Jordan block of λ and n yields a matrix over K and is defined by the conditions (Def. 1). (Def. 1)(i) len (the Jordan block of λ and n) = n, (ii) width (the Jordan block of λ and n) = n, and (iii) for all i, j such that 〈i, j〉 ∈ the indices of the Jordan bloc...

A simple model for the instanton ensemble at finite temperature T is proposed, including “random” and strongly correlated “molecular” component. T-dependence of fermionic zero modes naturally leads to chiral symmetry restoration, without instanton suppression. Moreover, at T = (1− 2)Tc the non-perturbative effects due to “molecules” are so strong, that they even dominate the global thermodynami...

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...

In this paper, we investigate a distributed Nash equilibrium seeking problem for a timevarying multi-agent network consisting of two subnetworks. We propose a subgradientbased distributed algorithm to seek a Nash equilibrium of a zero-sum game, where the two subnetworks share the same sum objective function. We show that the proposed distributed algorithm with homogenous stepsize can achieve a ...

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...