Properties and Algorithms of the KCube Graphs

The KCube interconnection topology was rst introduced in 2010. The KCube graph is a compound graph of a Kautz digraph and hypercubes. Compared with the at- tractive Kautz digraph and well known hypercube graph, the KCube graph could accommodate as many nodes as possible for a given indegree (and outdegree) and the diameter of interconnection networks. However, there are few algorithms designed for the KCube graph. In this thesis, we will concentrate on nding graph theoretical properties of the KCube graph and designing parallel algorithms that run on this network. We will explore several topological properties, such as bipartiteness, Hamiltonianicity, and symmetry property. These properties for the KCube graph are very useful to develop efficient algorithms on this network. We will then study the KCube network from the algorithmic point of view, and will give an improved routing algorithm. In addition, we will present two optimal broadcasting algorithms. They are fundamental algorithms to many applications. A literature review of the state of the art network designs in relation to the KCube network as well as some open problems in this field will also be given.

Network Similarity Measures and Automatic Construction of Graph Models using Genetic Programming

A complex network is an abstract representation of an intricate system of interrelated elements where the patterns of connection hold significant meaning. One particular complex network is a social network whereby the vertices represent people and edges denote their daily interactions. Understanding social network dynamics can be vital to the mitigation of disease spread as these networks model the interactions, and thus avenues of spread, between individuals. To better understand complex networks, algorithms which generate graphs exhibiting observed properties of real-world networks, known as graph models, are often constructed. While various efforts to aid with the construction of graph models have been proposed using statistical and probabilistic methods, genetic programming (GP) has only recently been considered. However, determining that a graph model of a complex network accurately describes the target network(s) is not a trivial task as the graph models are often stochastic in nature and the notion of similarity is dependent upon the expected behavior of the network. This thesis examines a number of well-known network properties to determine which measures best allowed networks generated by different graph models, and thus the models themselves, to be distinguished. A proposed meta-analysis procedure was used to demonstrate how these network measures interact when used together as classifiers to determine network, and thus model, (dis)similarity. The analytical results form the basis of the fitness evaluation for a GP system used to automatically construct graph models for complex networks. The GP-based automatic inference system was used to reproduce existing, well-known graph models as well as a real-world network. Results indicated that the automatically inferred models exemplified functional similarity when compared to their respective target networks. This approach also showed promise when used to infer a model for a mammalian brain network.

The Dynamic Interplay of Attachment and Temperament in Relation to Dimensions of Aggression

The current study examined whether overt and relational forms of reactive and proactive aggression were differentially related to adolescents’ temperament and attachment security. Measures of adolescents’ temperament, attachment security, and aggression were completed by 211 adolescents, ages 10–14, and their caregivers. Attachment security was consistently associated with all four dimensions of aggression, whereas proneness to frustration was found to be uniquely associated with reactive-overt aggression. Additionally, it was found that at lower levels of effortful control more secure attachment was related to lower levels of reactive-relational aggression. Results also indicated that, for girls, the relation between attachment and proactive-overt and proactive-relational aggression was only significant when effortful control was low. Conversely, for boys, the relation between attachment and proactive-overt aggression and proactive-relational aggression was significant when effortful control was high. Implications of these findings and limitations to the current study are discussed.

Object-Oriented Genetic Programming for the Automatic Inference of Graph Models for Complex Networks

Complex networks are systems of entities that are interconnected through meaningful relationships. The result of the relations between entities forms a structure that has a statistical complexity that is not formed by random chance. In the study of complex networks, many graph models have been proposed to model the behaviours observed. However, constructing graph models manually is tedious and problematic. Many of the models proposed in the literature have been cited as having inaccuracies with respect to the complex networks they represent. However, recently, an approach that automates the inference of graph models was proposed by Bailey [10] The proposed methodology employs genetic programming (GP) to produce graph models that approximate various properties of an exemplary graph of a targeted complex network. However, there is a great deal already known about complex networks, in general, and often specific knowledge is held about the network being modelled. The knowledge, albeit incomplete, is important in constructing a graph model. However it is difficult to incorporate such knowledge using existing GP techniques. Thus, this thesis proposes a novel GP system which can incorporate incomplete expert knowledge that assists in the evolution of a graph model. Inspired by existing graph models, an abstract graph model was developed to serve as an embryo for inferring graph models of some complex networks. The GP system and abstract model were used to reproduce well-known graph models. The results indicated that the system was able to evolve models that produced networks that had structural similarities to the networks generated by the respective target models.

The treaty between the United States and Mexico, the proceedings of the Senate therson, and message of the President and documents communicated therewith : the messages, with correspondence between the executive departament, General Scott and Mr. Trist, and other papers and proceedings of the on Senate in relation thereto, from wich the injuction of secresy has been removed...

UANL

California : A history of Upper and Lower California from their first discovery to the present time, comprising an account of the climate, soil, natural productions, agriculture, commerce, Sc. A full view of the missionary establishments and condition of the free and domesticated indians. With an appendix relation to steam navigation in the Pacific. Illustrated with a new map, plans of the harbours, and numerous engravings

UANL

Nouvelle Relation, contenant les voyages de Thomas Gage dans la nouvelle Efpagne, fes diverfes avantures, y fom retour dans la province de Nicaragua Jufqu a la Havane. A vec la desciption de la Ville de Mexique telle qu elle etoit autrefois y comme elle efe á pretent ...

UANL

San Juan de Ulúa, ou relation de l'espédition francaise au Mwxique sous les ordes de M. Le Contre Amiral Baudi par M. M. P. Blanchard et A. Dauzats.

UANL

Relation entre la volatilité implicite et la volatilité réalisée.

Rapport de recherche

Les déterminants de la productivité agricole dans le nord-est du Brésil, une interrogation sur la relation négative entre la productivité et la taille des fermes.

Rapport de recherche

La relation dynamique entre monnaie, taux de change et inflation en Haïti : une étude empirique.

Rapport de recherche

Est-il possible d'établir une relation entre les dépenses publiques et le niveau de capital humain via les effets à long terme et à court terme dans le processus de croissance de la Tunisie?

Rapport de recherche

From Sisyphus’s Dilemma to Sisyphus’s Duty? A Meditation on the Regulation of Hate Propaganda in Relation to Hate Crimes and Genocide

Un résumé en français est également disponible.