Cloud computing (CC) has become a strategic trend for online government services around the world, and Jordan is no exception. However, the acceptance and use of this novel technology face a number of barriers and challenges, including technological, human-aspects, social, and financial issues which need to be considered carefully by governments contemplating the implementation of cloud-based services. Drawing on the literature review on the acceptance and use of cloud-based e government services, it is evident that there is still a lack of explanatory power due to the following reasons: 1) focusing on the adoption and implementation of cloud-based e-government systems from the supply-side perspective, and therefore there are no enough studies on the integration between the supply-side and the demand-side as a single phenomenon. 2) while most of the e-government literature discussed the acceptance and adoption of traditional e-government services, there has been relatively little research on the distinguishing characteristics of cloud technology (e.g. security and trust). In addition, although Jordan made significant efforts in implementing cloud-based e-government systems since 2014, Jordan still has an unsatisfied rank with respect to the E-Government Development Index (EGDI) and E Participation Index (EPI). Many researchers state that security is one of the main determinates to the successful implementation of e-government services, without investigating this issue in depth. This thesis aims to bridge these gaps in an empirical manner through introducing a comprehensive investigation to provide a thorough understanding of cloud services adoption stemming from multiple perspectives, using an amended theoretical model based on the second version of the Unified Theory of Acceptance and Use of Technology (UTAUT2). To achieve this research aim, a mixed-methods approach for data collection was used. The first stage employed an online questionnaire (220 valid responses and 27 questions) to identify that some e-government challenges still affect the acceptance of cloud-based public services (e.g. lack of awareness and security). Also, to determine some of the security concerns relevant to the research context. In the second stage, a grounded theory approach (18 semi-structured interviews and five questions as an interview guide) was adopted to explore factors affecting users’ (i.e. citizens’) perceptions regarding the security of cloud-based e-government services. The results show five factors influencing perceived security: intangible and tangible characteristics (ITCS), information security awareness (ISA), interface design quality (IDQ), law and regulations, and security culture (SC). The third stage applied an online questionnaire to validate the proposed theoretical framework which integrated the findings of the second stage with the UTAUT2 constructs, trust and perceived security. In this stage, the theoretical model was evaluated through an online survey (57 Likert five-point scale questions), and a total of 669 validated responses were analysed with the Structural Equation Modelling (SEM) technique using Analysis of Moment Structures (AMOS) version 25.0. The results indicated that performance expectancy (PE), effort expectancy (EE), social influence (SI), facilitating conditions (FC) and trust (ToEG) of e-government were found to significantly and positively influence the individuals’ behavioural intention to use cloud-based e-government services. Moreover, perceived security (PS) significantly influenced trust (ToEG) of e-government. In addition, intangible and tangible characteristics (ITCS), information security awareness (ISA), interface design quality (IDQ), law and regulations, and security culture (SC) had a positive effect on the perceived security of cloud-based public services. The outcome of this research presents a theoretical framework for studying the acceptance of cloud services in the Jordanian public sector. Additionally, eighteen action guidelines corresponding to the eleven factors of this study have been suggested and five of which have been already implemented or are planned to be implemented by the Jordanian government. The results of this study will provide empirical findings for the e-government professionals around the world, especially in developing countries with a similar context to the Hashemite Kingdom of Jordan, facing similar obstacles for the acceptance and adoption of cloud-based e-government services, and aspiring to enhance such services in their countries. The practical implications, implementation guidelines, theoretical contributions, and limitations of this work are discussed in the context of providing key directions for future research. / Mutah University in Jordan

Les modèles sur réseau comme ceux de la percolation, d’Ising et de Potts servent à décrire les transitions de phase en deux dimensions. La recherche de leur solution analytique passe par le calcul de la fonction de partition et la diagonalisation de matrices de transfert. Au point critique, ces modèles statistiques bidimensionnels sont invariants sous les transformations conformes et la construction de théories des champs conformes rationnelles, limites continues des modèles statistiques, permet un calcul de la fonction de partition au point critique. Plusieurs chercheurs pensent cependant que le paradigme des théories des champs conformes rationnelles peut être élargi pour inclure les modèles statistiques avec des matrices de transfert non diagonalisables. Ces modèles seraient alors décrits, dans la limite d’échelle, par des théories des champs logarithmiques et les représentations de l’algèbre de Virasoro intervenant dans la description des observables physiques seraient indécomposables. La matrice de transfert de boucles D_N(λ, u), un élément de l’algèbre de Temperley- Lieb, se manifeste dans les théories physiques à l’aide des représentations de connectivités ρ (link modules). L’espace vectoriel sur lequel agit cette représentation se décompose en secteurs étiquetés par un paramètre physique, le nombre d de défauts. L’action de cette représentation ne peut que diminuer ce nombre ou le laisser constant. La thèse est consacrée à l’identification de la structure de Jordan de D_N(λ, u) dans ces représentations. Le paramètre β = 2 cos λ = −(q + 1/q) fixe la théorie : β = 1 pour la percolation et √2 pour le modèle d’Ising, par exemple. Sur la géométrie du ruban, nous montrons que D_N(λ, u) possède les mêmes blocs de Jordan que F_N, son plus haut coefficient de Fourier. Nous étudions la non diagonalisabilité de F_N à l’aide des divergences de certaines composantes de ses vecteurs propres, qui apparaissent aux valeurs critiques de λ. Nous prouvons dans ρ(D_N(λ, u)) l’existence de cellules de Jordan intersectorielles, de rang 2 et couplant des secteurs d, d′ lorsque certaines contraintes sur λ, d, d′ et N sont satisfaites. Pour le modèle de polymères denses critique (β = 0) sur le ruban, les valeurs propres de ρ(D_N(λ, u)) étaient connues, mais les dégénérescences conjecturées. En construisant un isomorphisme entre les modules de connectivités et un sous-espace des modules de spins du modèle XXZ en q = i, nous prouvons cette conjecture. Nous montrons aussi que la restriction de l’hamiltonien de boucles à un secteur donné est diagonalisable et trouvons la forme de Jordan exacte de l’hamiltonien XX, non triviale pour N pair seulement. Enfin nous étudions la structure de Jordan de la matrice de transfert T_N(λ, ν) pour des conditions aux frontières périodiques. La matrice T_N(λ, ν) a des blocs de Jordan intrasectoriels et intersectoriels lorsque λ = πa/b, et a, b ∈ Z×. L’approche par F_N admet une généralisation qui permet de diagnostiquer des cellules intersectorielles dont le rang excède 2 dans certains cas et peut croître indéfiniment avec N. Pour les blocs de Jordan intrasectoriels, nous montrons que les représentations de connectivités sur le cylindre et celles du modèle XXZ sont isomorphes sauf pour certaines valeurs précises de q et du paramètre de torsion v. En utilisant le comportement de la transformation i_N^d dans un voisinage des valeurs critiques (q_c, v_c), nous construisons explicitement des vecteurs généralisés de Jordan de rang 2 et discutons l’existence de blocs de Jordan intrasectoriels de plus haut rang. / Lattice models such as percolation, the Ising model and the Potts model are useful for the description of phase transitions in two dimensions. Finding analytical solutions is done by calculating the partition function, which in turn requires finding eigenvalues of transfer matrices. At the critical point, the two dimensional statistical models are invariant under conformal transformations and the construction of rational conformal field theories, as the continuum limit of these lattice models, allows one to compute the partition function at the critical point. Many researchers think however that the paradigm of rational conformal conformal field theories can be extended to include models with non diagonalizable transfer matrices. These models would then be described, in the scaling limit, by logarithmic conformal field theories and the representations of the Virasoro algebra coming into play would be indecomposable. We recall the construction of the double-row transfer matrix D_N(λ, u) of the Fortuin-Kasteleyn model, seen as an element of the Temperley-Lieb algebra. This transfer matrix comes into play in physical theories through its representation in link modules (or standard modules). The vector space on which this representation acts decomposes into sectors labelled by a physical parameter d, the number of defects, which remains constant or decreases in the link representations. This thesis is devoted to the identification of the Jordan structure of D_N(λ, u) in the link representations. The parameter β = 2 cos λ = −(q + 1/q) fixes the theory : for instance β = 1 for percolation and √2 for the Ising model. On the geometry of the strip with open boundary conditions, we show that D_N(λ, u) has the same Jordan blocks as its highest Fourier coefficient, F_N. We study the non-diagonalizability of F_N through the divergences of some of the eigenstates of ρ(F_N) that appear at the critical values of λ. The Jordan cells we find in ρ(D_N(λ, u)) have rank 2 and couple sectors d and d′ when specific constraints on λ, d, d′ and N are satisfied. For the model of critical dense polymers (β = 0) on the strip, the eigenvalues of ρ(D_N(λ, u)) were known, but their degeneracies only conjectured. By constructing an isomorphism between the link modules on the strip and a subspace of spin modules of the XXZ model at q = i, we prove this conjecture. We also show that the restriction of the Hamiltonian to any sector d is diagonalizable, and that the XX Hamiltonian has rank 2 Jordan cells when N is even. Finally, we study the Jordan structure of the transfer matrix T_N(λ, ν) for periodic boundary conditions. When λ = πa/b and a, b ∈ Z×, the matrix T_N(λ, ν) has Jordan blocks between sectors, but also within sectors. The approach using F_N admits a generalization to the present case and allows us to probe the Jordan cells that tie different sectors. The rank of these cells exceeds 2 in some cases and can grow indefinitely with N. For the Jordan blocks within a sector, we show that the link modules on the cylinder and the XXZ spin modules are isomorphic except for specific curves in the (q, v) plane. By using the behavior of the transformation i_N^d in a neighborhood of the critical values (q_c, v_c), we explicitly build Jordan partners of rank 2 and discuss the existence of Jordan cells with higher rank.

Ce mémoire présente un point de vue basé sur la théorie des algèbres de Jordan pour faire une étude analytique, géométrique et topologique de certains espaces homogènes : espaces hermitiens symétriques, leurs frontières de Shilov et espaces symétriques causaux de type Cayley. <br />En particulier, nous passons en revue des résultats sur l'indice de Maslov, de Souriau et d'Arnold-Leray. Nous étudions aussi certaines propriétés de contractions et de compressions de ces espaces.<br />Le prolongement de la série discrète holomorphe est une partie importante du programme de Gelfand-Gindikin. Dans ce contexte, nous étudions les espaces de Hardy des fonctions holomorphes sur certains domaines Stein. Nous donnons en particulier le lien qui existe entre ces espaces de Hardy et les espaces de Hardy classiques des fonctions holomorphes sur les espaces hermitiens symétriques.<br />En dernier lieu, nous étudions la conjecture de Helgason pour la frontière de Shilov des espaces hermitiens symétriques. Plus précisément, nous caractérisons l'image par de la transformation de Poisson des hyperfonctions et des fonctions $L^p$ sur la frontière de Shilov.

Les modèles sur réseau comme ceux de la percolation, d’Ising et de Potts servent à décrire les transitions de phase en deux dimensions. La recherche de leur solution analytique passe par le calcul de la fonction de partition et la diagonalisation de matrices de transfert. Au point critique, ces modèles statistiques bidimensionnels sont invariants sous les transformations conformes et la construction de théories des champs conformes rationnelles, limites continues des modèles statistiques, permet un calcul de la fonction de partition au point critique. Plusieurs chercheurs pensent cependant que le paradigme des théories des champs conformes rationnelles peut être élargi pour inclure les modèles statistiques avec des matrices de transfert non diagonalisables. Ces modèles seraient alors décrits, dans la limite d’échelle, par des théories des champs logarithmiques et les représentations de l’algèbre de Virasoro intervenant dans la description des observables physiques seraient indécomposables. La matrice de transfert de boucles D_N(λ, u), un élément de l’algèbre de Temperley- Lieb, se manifeste dans les théories physiques à l’aide des représentations de connectivités ρ (link modules). L’espace vectoriel sur lequel agit cette représentation se décompose en secteurs étiquetés par un paramètre physique, le nombre d de défauts. L’action de cette représentation ne peut que diminuer ce nombre ou le laisser constant. La thèse est consacrée à l’identification de la structure de Jordan de D_N(λ, u) dans ces représentations. Le paramètre β = 2 cos λ = −(q + 1/q) fixe la théorie : β = 1 pour la percolation et √2 pour le modèle d’Ising, par exemple. Sur la géométrie du ruban, nous montrons que D_N(λ, u) possède les mêmes blocs de Jordan que F_N, son plus haut coefficient de Fourier. Nous étudions la non diagonalisabilité de F_N à l’aide des divergences de certaines composantes de ses vecteurs propres, qui apparaissent aux valeurs critiques de λ. Nous prouvons dans ρ(D_N(λ, u)) l’existence de cellules de Jordan intersectorielles, de rang 2 et couplant des secteurs d, d′ lorsque certaines contraintes sur λ, d, d′ et N sont satisfaites. Pour le modèle de polymères denses critique (β = 0) sur le ruban, les valeurs propres de ρ(D_N(λ, u)) étaient connues, mais les dégénérescences conjecturées. En construisant un isomorphisme entre les modules de connectivités et un sous-espace des modules de spins du modèle XXZ en q = i, nous prouvons cette conjecture. Nous montrons aussi que la restriction de l’hamiltonien de boucles à un secteur donné est diagonalisable et trouvons la forme de Jordan exacte de l’hamiltonien XX, non triviale pour N pair seulement. Enfin nous étudions la structure de Jordan de la matrice de transfert T_N(λ, ν) pour des conditions aux frontières périodiques. La matrice T_N(λ, ν) a des blocs de Jordan intrasectoriels et intersectoriels lorsque λ = πa/b, et a, b ∈ Z×. L’approche par F_N admet une généralisation qui permet de diagnostiquer des cellules intersectorielles dont le rang excède 2 dans certains cas et peut croître indéfiniment avec N. Pour les blocs de Jordan intrasectoriels, nous montrons que les représentations de connectivités sur le cylindre et celles du modèle XXZ sont isomorphes sauf pour certaines valeurs précises de q et du paramètre de torsion v. En utilisant le comportement de la transformation i_N^d dans un voisinage des valeurs critiques (q_c, v_c), nous construisons explicitement des vecteurs généralisés de Jordan de rang 2 et discutons l’existence de blocs de Jordan intrasectoriels de plus haut rang. / Lattice models such as percolation, the Ising model and the Potts model are useful for the description of phase transitions in two dimensions. Finding analytical solutions is done by calculating the partition function, which in turn requires finding eigenvalues of transfer matrices. At the critical point, the two dimensional statistical models are invariant under conformal transformations and the construction of rational conformal field theories, as the continuum limit of these lattice models, allows one to compute the partition function at the critical point. Many researchers think however that the paradigm of rational conformal conformal field theories can be extended to include models with non diagonalizable transfer matrices. These models would then be described, in the scaling limit, by logarithmic conformal field theories and the representations of the Virasoro algebra coming into play would be indecomposable. We recall the construction of the double-row transfer matrix D_N(λ, u) of the Fortuin-Kasteleyn model, seen as an element of the Temperley-Lieb algebra. This transfer matrix comes into play in physical theories through its representation in link modules (or standard modules). The vector space on which this representation acts decomposes into sectors labelled by a physical parameter d, the number of defects, which remains constant or decreases in the link representations. This thesis is devoted to the identification of the Jordan structure of D_N(λ, u) in the link representations. The parameter β = 2 cos λ = −(q + 1/q) fixes the theory : for instance β = 1 for percolation and √2 for the Ising model. On the geometry of the strip with open boundary conditions, we show that D_N(λ, u) has the same Jordan blocks as its highest Fourier coefficient, F_N. We study the non-diagonalizability of F_N through the divergences of some of the eigenstates of ρ(F_N) that appear at the critical values of λ. The Jordan cells we find in ρ(D_N(λ, u)) have rank 2 and couple sectors d and d′ when specific constraints on λ, d, d′ and N are satisfied. For the model of critical dense polymers (β = 0) on the strip, the eigenvalues of ρ(D_N(λ, u)) were known, but their degeneracies only conjectured. By constructing an isomorphism between the link modules on the strip and a subspace of spin modules of the XXZ model at q = i, we prove this conjecture. We also show that the restriction of the Hamiltonian to any sector d is diagonalizable, and that the XX Hamiltonian has rank 2 Jordan cells when N is even. Finally, we study the Jordan structure of the transfer matrix T_N(λ, ν) for periodic boundary conditions. When λ = πa/b and a, b ∈ Z×, the matrix T_N(λ, ν) has Jordan blocks between sectors, but also within sectors. The approach using F_N admits a generalization to the present case and allows us to probe the Jordan cells that tie different sectors. The rank of these cells exceeds 2 in some cases and can grow indefinitely with N. For the Jordan blocks within a sector, we show that the link modules on the cylinder and the XXZ spin modules are isomorphic except for specific curves in the (q, v) plane. By using the behavior of the transformation i_N^d in a neighborhood of the critical values (q_c, v_c), we explicitly build Jordan partners of rank 2 and discuss the existence of Jordan cells with higher rank.

In this thesis, we defind a new invariant of quadratic Lie algebras and quadratic Lie superalgebras and give a complete study and classification of singular quadratic Lie algebras and singular quadratic Lie superalgebras, i.e. those for which the invariant does not vanish. The classification is related to adjoint orbits of Lie algebras o(m) and sp(2n). Also, we give an isomorphic characterization of 2-step nilpotent quadratic Lie algebras and quasi-singular quadratic Lie superalgebras for the purpose of completeness. We study pseudo-Euclidean Jordan algebras obtained as double extensions of a quadratic vector space by a one-dimensional algebra and 2-step nilpotent pseudo-Euclidean Jordan algebras, in the same manner as it was done for singular quadratic Lie algebras and 2-step nilpotent quadratic Lie algebras. Finally, we focus on the case of a symmetric Novikov algebra and study it up to dimension 7.

No description available.

We present several methods that allow the exact computation of the exponential matrix etA. Methods that include computation of eigenvectors or Laplace transform are very well-known, and they are mentioned herefor completeness. We also present other methods, not well-known inthe literature, that do not need the computation of eigenvectors, and are easy to introduce in a classroom, thus providing us with general formulas that can be applied to any matrix. / Presentamos varios métodos que permiten el calculo exacto de la matriz exponencial etA. Los métodos que incluyen el calculo de autovectores y la transformada de Laplace son bien conocidos, y son mencionados aquí por completitud. Se mencionan otros métodos, no tan conocidos en la literatura, que no incluyen el calculo de autovectores, y que proveen de fórmulas genéricas aplicables a cualquier matriz.

Dans cette thèse, nous définissons un nouvel invariant des algèbres de Lie quadratiques et des superalgèbres de Lie quadratiques et donnons une étude et classification complète des algèbres de Lie quadratiques singulières et des superalgèbres de Lie quadratiques singulières, i.e. celles pour lesquelles l’invariant n’est pas nul. La classification est en relation avec les orbites adjointes des algèbres de Lie o(m) et sp(2n). Aussi, nous donnons une caractérisation isomorphe des algèbres de Lie quadratiques 2-nilpotentes et des superalgèbres de Lie quadratiques quasi-singulières pour le but d’exhaustivité. Nous étudions les algèbres de Jordan pseudoeuclidiennes qui sont obtenues des extensions doubles d’un espace vectoriel quadratique par une algèbre d’une dimension et les algèbres de Jordan pseudo-euclidienne 2-nilpotentes, de la même manière que cela a été fait pour les algèbres de Lie quadratiques singulières et des algèbres de Lie quadratiques 2-nilpotentes. Enfin, nous nous concentrons sur le cas d’une algèbre de Novikov symétrique et l’étudions à dimension 7. / In this thesis, we defind a new invariant of quadratic Lie algebras and quadratic Lie superalgebras and give a complete study and classification of singular quadratic Lie algebras and singular quadratic Lie superalgebras, i.e. those for which the invariant does not vanish. The classification is related to adjoint orbits of Lie algebras o(m) and sp(2n). Also, we give an isomorphic characterization of 2-step nilpotent quadratic Lie algebras and quasi-singular quadratic Lie superalgebras for the purpose of completeness. We study pseudo-Euclidean Jordan algebras obtained as double extensions of a quadratic vector space by a one-dimensional algebra and 2-step nilpotent pseudo-Euclidean Jordan algebras, in the same manner as it was done for singular quadratic Lie algebras and 2-step nilpotent quadratic Lie algebras. Finally, we focus on the case of a symmetric Novikov algebra and study it up to dimension 7.

In this thesis I argue that Jordan of Saxony (d. 1237), Master of the Order of Preachers, fostered a culture of openness toward the participation of women in the religious life of the Dominican order. This is demonstrated, in part, through the study of the nature of Jordan's support for Diana d'Andalò (d. 1236) and her convent of Sant'Agnese and his presentation of female pastoral care in the Libellus, his history of the order. The argument is also developed by means of a chronologically-informed reading of Jordan's letters, which explores his use of familial language, his employment of the topoi of spiritual friendship, and the significance he attributes to the role of religious women's prayer in the order's evangelical mission. Jordan's friendship with Diana d'Andalò and her convent of Sant'Agnese is well-known, if not necessarily well-explored. It is usually treated as a case apart from the order's increasing hostility to the pastoral care of religious and devout women, which gained momentum over the course of Jordan's tenure. This thesis seeks to break down this compartmentalized view by articulating not only the close parallels between Jordan's perception of friars and nuns within the order, but also the way in which he extended bonds of mutual religious commitment to religious women outside the order. As such, this study also intends to contribute to a growing historiography that explores the various ways in which medieval men and women participated together in religious life.

Time synchronization is a process of ensuring all the time difference between the clocks of network components(like base stations, boundary clocks, grandmasters, etc.) in the mobile network is zero or negligible. It is one of the important factors responsible for ensuring effective communication between two user-equipments in a mobile network. Nevertheless, the presence of asymmetries can lead to faults, making the detection of these errors indispensable, especially in technologies demanding ultra-low latency, such as 5G technology. Developing methods to ensure time-synchronized mobile networks, would not only improve the network performance, and contribute towards cost-effective telecommunication infrastructure. A rulebased simulator to simulate the mobile network was built, using the rules provided by the domain experts, in order to generate more data for further studies. The possibility of using Reinforcement Learning to perform fault detection in the mobile network was explored. In addition to the simulator dataset, an unlabelled customer dataset, which consists of time error differences between the base stations, and additional features for each of its network components was provided. Classification algorithms to label the customer dataset were designed, and a comparative analysis of each of them has been presented. Mathematical algorithm and Graph Neural Network models were built to detect error, for both the simulator and customer dataset, for the faulty node detection task. The approach of using a Mathematical algorithm and Graph Neural Network architectures provided an accuracy of 95% for potential fault node detection. The feature importance of the additional features of the network components was analyzed using the best Graph Neural Network model which was used to train for the node classification task (to classify the base stations as faulty and non-faulty). Additionally, an attempt was made to predict the individual time error value for each of the links using Graph Neural Network, however, it failed potentially due to the presence of fewer features to train from. / Tidssynkronisering är en process för att säkerställa att all tidsskillnad mellan klockorna för nätverkskomponenter (som basstationer, gränsklockor, stormästare, etc.) i mobilnätet är noll eller försumbar. Det är en av de viktiga faktorerna som är ansvariga för att säkerställa effektiv kommunikation mellan två användarutrustningar i ett mobilnät. Icke desto mindre kan närvaron av asymmetrier leda till fel, vilket gör upptäckten av dessa fel oumbärlig, särskilt i tekniker som kräver ultralåg latens, som 5G-teknik. En regelbaserad simulator för att simulera mobilnätet byggdes, med hjälp av reglerna från domänexperterna, för att generera mer data för vidare studier. Möjligheten att använda RL för att utföra feldetektering i mobilnätet undersöktes. Utöver simulatordataset tillhandahölls en omärkt kunddatauppsättning, som består av tidsfelsskillnader mellan basstationerna och ytterligare funktioner för var och en av dess nätverkskomponenter. Klassificeringsalgoritmer för att märka kunddataset utformades, och en jämförande analys av var och en av dem har presenterats. Matematisk algoritm och GNN-modeller byggdes för att upptäcka fel, för både simulatorn och kunddatauppsättningen, för uppgiften att detektera felaktig nod. Metoden att använda en matematisk algoritm och GNN-arkitekturer gav en noggrannhet på 95% för potentiell felnoddetektering. Funktionens betydelse för de ytterligare funktionerna hos nätverkskomponenterna analyserades med den bästa GNN-modellen som användes för att träna för nodklassificeringsuppgiften (för att klassificera basstationerna som felaktiga och icke-felaktiga). Dessutom gjordes ett försök att förutsäga det individuella tidsfelsvärdet för var och en av länkarna med GNN, men det misslyckades potentiellt på grund av närvaron av färre funktioner att träna från.