Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 131 for “"adjacency"”.
-
Clustering Methods for Network Adjacency Data
Clustering analysis aims to detect the topological community-structure of networks (connected graphs with n vertices and m edges), and studies inherent relations behind partitions. In this thesis, we consider far-reaching model-free clustering algorithms including Girvan and Newman’s edge …
-
Urban envelopes : an architecture of adjacency and difference
In a contemporary world of rapidly dwindling resources and the sprawling consumption of landscape, it is important to look at the role of boundary, spatial differentiation and the value of spatial diversity while recognizing that the city, like nature, is composed of interdependent parts. Rather …
-
Characterizing the Spectral Radius of a Sequence of Adjacency Matrices
… network to a path network. For the sequence of adjacency matrices that describe this transition, we show the spectral radius of these graphs can be given in a simple algebraic equation. Using this equation we show the spectral radius increases as the star unfolds and establish bounds on the …
-
IMPROVING MULTI-VARIATE TIME SERIES FORECASTING WITH DYNAMIC MULTI-HEAD ATTENTION ADJACENCY MATRIX
… novel framework that uses a dynamically learned adjacency matrix based on related work called the Multi-variate Time-series Graph Neural Network(MTGNN). Instead of using a correlation-based learned adjacency matrix, the adjacency matrix and graph modules are replaced with a dynamically learned …
-
Polynomials of the Adjacency Matrix of a Graph (distance-Transitive, Distance-Regular, Orbit)
… = A((DELTA)) where A((GAMMA)) and A((DELTA)) are adjacency matrices. For several interesting classes of graphs it is possible to determine all of the graphs which can be generated by a polynomial. Define the ith distance graph, (GAMMA)(,i), as the graph with the same vertex set as (GAMMA) and two …
-
A training methodology for spatial orientation in spacecraft
… and spatial memory tasks is improved. An "adjacency training" method was developed that taught connections between landmarks in two joined modules with inconsistent visual verticals by emphasizing functional relationships among adjacent surfaces within and between modules. An experiment was …
-
A study of knot-graphs
… and extensions of them. The basic tool is the adjacency matrix. In fact several kinds of adjacency matrix are defined, for knot diagrams which are either nonoriented or are given orientations which reflect certain topological properties of the knots concerned. First the properties of knot-graph …
-
Conjunctions and Grammatical Agreement
… subjects in both Lebanese Arabic and English. Adjacency also played a role, as plural nouns in furthest conjunct position did not enforce plural agreement in the same way as plural nouns that were linearly adjacent to the verb. These results indicate that notional information, lexical …
-
Bazaar [+] : addressing critical adjacencies in Mumbai's urban farm
… Mumbai, and evolves the notion of how "critical adjacency" has been instrumental in guiding the city's urban transformations into modernity. Presently, Mumbai experiences some of the highest densities and land value Levels in the world, and the city still continues to grow. New development in the …
-
Studies of some classes of algebraically defined graphs
… investigate algebraically defined graphs whose adjacency is governed by systems of polynomial equations over various fields. In certain contexts, point-line incidence graphs of finite geometries called generalized quadrangles have these algebraically defined graphs as induced subgraphs. At …
-
Matrix completion algorithms with applications in biomedicine, e-commerce and social science
… often yield high rank matrices. For example, the adjacency matrix representing interactions between transcription factors and target genes in the cell is a highly sparse matrix, in which most entries correspond to absent interactions and only a few entries correspond to present interactions. This …
-
Layering
… three(3), admittedly broad, notions of spatial adjacency and relation:path, threshold, and layering.
-
Some Advances in Statistical modeling of Brain Structural Connectomes
… These networks are typically expressed as adjacency matrices, with each cell containing a summary of connectivity between a pair of brain regions. There is an emerging statistical literature describing methods for the analysis of such multi-network data in which nodes are common across …
-
Convergence Rates of Spectral Distribution of Random Inner Product Kernel Matrices
… the unit sphere are considered. Observing that adjacency matrices of these graphs can be thought of as random inner product matrices, we are able to use an idea of Cheng-Singer to establish the limiting for the ESD of these adjacency matrices.
-
Spectral Properties of Quaternionic Unit Gain Cycles
… define certain concepts on these graphs such as adjacency and Laplacian matrices, gains of paths, and more. If we restrict ourselves to the unit norm quaternions, we can define quaternionic unit gain graphs, or U(H)-gain graphs, as gain graphs where the domain of the gain function is the unit …
-
Evaluation Of Paradigms For A P300 Based Brain Computer Interface Speller
… to test the accuracy, region error, and adjacency error among the paradigms. The first experiment was the comparison of four paradigms: the single character (SC), row/column (RC), region based 1 (RB1), and region based 2 (RB2) paradigms. Six subjects were considered for that experiment …
-
Algebraic methods in graph theory
… In general, we can use the eigenvalues of the adjacency matrix of a graph to study various properties of graphs. In this thesis, we obtain the whole spectrum of a family of graphs called Wenger graphs Wm (q ). We also study the a conjecture of Brouwer, concerning the second connectivity of …
-
Spectral analysis in bipartite biregular graphs and community detection
… bound for the non trivial eigenvalues of its adjacency operator, proving Alon's Conjecture for this family of graphs. Secondly, we use a spectral algorithm to recover hidden communities in a random network model we call regular stochastic block model. We rely on a technique introduced recently …
Page 1 of 7