You searched for subject:(betweenness).
Showing records 1 – 30 of
58 total matches.
◁ [1] [2] ▶
1.
Stevens, Cody Alexander.
GPU-Optimized Graph Theory Analysis of Allosteric Protein Signaling Networks.
Degree: 2015, Wake Forest University
URL: http://hdl.handle.net/10339/57193 
► Graph algorithms have been widely applied to science and engineering problems, but the practical applications of graph algorithms to every-growing, large data sets requires significant…
(more)
▼ Graph algorithms have been widely applied to science and engineering problems, but the practical applications of graph algorithms to every-growing, large data sets requires significant computational time, motivating the need for efficient, parallel solutions on modern computing architectures. Here, we develop a novel GPU-optimized parallel algorithm for measuring the betweenness centrality of edges of a graph that is over 1000x faster than the CPU implementation of the algorithm in the NetworkX software package for 1,000-5,000 nodes. Inspired by biochemical mutagenesis experiments, we also introduce a new approach to measure how the betweenness centrality changes with the perturbation of a graph. As a direct application, we performed MD simulations of several protein-RNA complex, where we abstracted the residues and their interactions as nodes and edges, respectively, to characterize the molecular interaction network. We then systematically compare the change in the betweenness upon the deletion of the residue, akin to mutagenesis experiments performed in the laboratory, to create a predictor for mutagenesis experiments. Finally, we compared communal detection results to previously determined protein domains, finding a high correlation between residue-residue interactome communities and larger protein domains.
Subjects/Keywords: Betweenness
…betweenness of each edge, and deleting the edge from
the graph with the highest betweenness. This… …collection of nodes within their combined subtrees
[20].
The initial betweenness… …calculation is dependent on the all points shortest path,
and it is the standard betweenness… …paths within the graph. The edge
with highest betweenness is deleted, and the calculation is… …betweenness of the
other edges within the graph. For efficiency’s sake, only the shortest paths for…
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Stevens, C. A. (2015). GPU-Optimized Graph Theory Analysis of Allosteric Protein Signaling Networks. (Thesis). Wake Forest University. Retrieved from http://hdl.handle.net/10339/57193
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Stevens, Cody Alexander. “GPU-Optimized Graph Theory Analysis of Allosteric Protein Signaling Networks.” 2015. Thesis, Wake Forest University. Accessed January 22, 2021.
http://hdl.handle.net/10339/57193.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Stevens, Cody Alexander. “GPU-Optimized Graph Theory Analysis of Allosteric Protein Signaling Networks.” 2015. Web. 22 Jan 2021.
Vancouver:
Stevens CA. GPU-Optimized Graph Theory Analysis of Allosteric Protein Signaling Networks. [Internet] [Thesis]. Wake Forest University; 2015. [cited 2021 Jan 22].
Available from: http://hdl.handle.net/10339/57193.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Stevens CA. GPU-Optimized Graph Theory Analysis of Allosteric Protein Signaling Networks. [Thesis]. Wake Forest University; 2015. Available from: http://hdl.handle.net/10339/57193
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Addis Ababa University
2.
HIYWOTE, ESHETU.
The Role of Facebook in Building Social Capital
.
Degree: 2012, Addis Ababa University
URL: http://etd.aau.edu.et/dspace/handle/123456789/738
► This study investigates the role of Facebook in building social capital. The study was conducted with eight students doing their graduate studies in Addis Ababa…
(more)
▼ This study investigates the role of Facebook in building social capital. The study was conducted
with eight students doing their graduate studies in Addis Ababa University. The premise for the
selection of the University as the study site is available baseline data which indicates that the
University is the largest internet user in the country. The research follows the procedures of an
exploratory case study design in examining the experiences of use of Facebook and its outcomes
on social capital. A semi structured interview guide was developed and used as the data
collection instrument. Two analytic techniques were applied in this study: social network
analysis and cross case analysis. The first was used in analyzing data pertaining to the nature of
relationships between study participants and five of their most frequent contacts on Facebook.
Cross case analysis was used in analyzing the bulk of data obtained from study participants
pertaining to their general experiences and perceptions in relation to Facebook. Four key findings
emerged from this study. First, Facebook is primarily used for the purpose of maintaining
existing offline ties, particularly those established in higher learning institutions and the
workplace. Second, study participants’ egocentric networks on Facebook were low in density,
high in ego
betweenness centrality and highly homophilous, which implies better accessibility of
social capital by study participants. Third, the social capital outcomes of Facebook use were
found to be multifaceted in the implications they hold for the psychological, social, cultural and
economic development of study participants. Last, challenges associated with Facebook use
pertained to: internet inaccessibility, privacy concerns and problems in effective utilization. In
conclusion, based on the responses provided by study participants the type of social capital that
pervades most Facebook relationships was found to be bonding social capital, although bridging
functions of Facebook relationships were also identified. This study tries to situate the social
work profession and discipline in how the findings implicate practice, research and education.
The practical implications relate to social workers’ role as facilitators to enhance universal
accessibility of the internet and utilize Facebook as a platform to promote the social work
profession. In terms of the implications for research, Facebook could be seen as providing the
context for examining different aspects of human behavior and social dynamics. Last, the
implications of the study for social work education could be understood in terms of introducing
prospective social workers with concepts and techniques in social network analysis.
Advisors/Committee Members: Wassie Kebede (PhD, MSW) (advisor).
Subjects/Keywords: Betweenness;
Density,Centrality
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
HIYWOTE, E. (2012). The Role of Facebook in Building Social Capital
. (Thesis). Addis Ababa University. Retrieved from http://etd.aau.edu.et/dspace/handle/123456789/738
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
HIYWOTE, ESHETU. “The Role of Facebook in Building Social Capital
.” 2012. Thesis, Addis Ababa University. Accessed January 22, 2021.
http://etd.aau.edu.et/dspace/handle/123456789/738.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
HIYWOTE, ESHETU. “The Role of Facebook in Building Social Capital
.” 2012. Web. 22 Jan 2021.
Vancouver:
HIYWOTE E. The Role of Facebook in Building Social Capital
. [Internet] [Thesis]. Addis Ababa University; 2012. [cited 2021 Jan 22].
Available from: http://etd.aau.edu.et/dspace/handle/123456789/738.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
HIYWOTE E. The Role of Facebook in Building Social Capital
. [Thesis]. Addis Ababa University; 2012. Available from: http://etd.aau.edu.et/dspace/handle/123456789/738
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Rochester Institute of Technology
3.
Belchikova, Mariya.
Graphs with k-Uniform Edge Betweenness Centrality.
Degree: MS, School of Mathematical Sciences (COS), 2018, Rochester Institute of Technology
URL: https://scholarworks.rit.edu/theses/9802
► The edge betweenness centrality of an edge is defined as the ratio of shortest paths between all pairs of vertices passing through that edge.…
(more)
▼ The edge
betweenness centrality of an edge is defined as the ratio of shortest paths between all pairs of vertices passing through that edge. A graph is said to have k-uniform edge
betweenness centrality, if there are k different edge
betweenness centrality values. In this thesis we investigate graphs that have k-uniform edge
betweenness centrality where k=2 or 3, and precisely determine the edge
betweenness centrality values for various families of graphs.
Advisors/Committee Members: Matthew J. Hoffman.
Subjects/Keywords: Circulant graph; Edge betweenness centrality; Shortest path
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Belchikova, M. (2018). Graphs with k-Uniform Edge Betweenness Centrality. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/9802
Chicago Manual of Style (16th Edition):
Belchikova, Mariya. “Graphs with k-Uniform Edge Betweenness Centrality.” 2018. Masters Thesis, Rochester Institute of Technology. Accessed January 22, 2021.
https://scholarworks.rit.edu/theses/9802.
MLA Handbook (7th Edition):
Belchikova, Mariya. “Graphs with k-Uniform Edge Betweenness Centrality.” 2018. Web. 22 Jan 2021.
Vancouver:
Belchikova M. Graphs with k-Uniform Edge Betweenness Centrality. [Internet] [Masters thesis]. Rochester Institute of Technology; 2018. [cited 2021 Jan 22].
Available from: https://scholarworks.rit.edu/theses/9802.
Council of Science Editors:
Belchikova M. Graphs with k-Uniform Edge Betweenness Centrality. [Masters Thesis]. Rochester Institute of Technology; 2018. Available from: https://scholarworks.rit.edu/theses/9802
Delft University of Technology
4.
Huang, Danlei (author).
Reinventing the (green) strips: An investigation on urban in-betweenness.
Degree: 2019, Delft University of Technology
URL: http://resolver.tudelft.nl/uuid:6d09d700-2958-45ab-8952-18460852885f
► The green strips can be found in many roads/streets in Bogota as an urban infrastructure for dividing vehicles and traffic. However, on top of this…
(more)
▼ The green strips can be found in many roads/streets in Bogota as an urban infrastructure for dividing vehicles and traffic. However, on top of this regulating function, it can be observed that the citizens of Bogota have the tendency to spontaneously appropriate the green strips in ways that’s convenient for them.
Advisors/Committee Members: Mejia Hernandez, Jorge (mentor), Jennen, Pierre (graduation committee), Havik, Klaske (graduation committee), Delft University of Technology (degree granting institution).
Subjects/Keywords: Bogota; public space; strip; Intervention; in-betweenness
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Huang, D. (. (2019). Reinventing the (green) strips: An investigation on urban in-betweenness. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:6d09d700-2958-45ab-8952-18460852885f
Chicago Manual of Style (16th Edition):
Huang, Danlei (author). “Reinventing the (green) strips: An investigation on urban in-betweenness.” 2019. Masters Thesis, Delft University of Technology. Accessed January 22, 2021.
http://resolver.tudelft.nl/uuid:6d09d700-2958-45ab-8952-18460852885f.
MLA Handbook (7th Edition):
Huang, Danlei (author). “Reinventing the (green) strips: An investigation on urban in-betweenness.” 2019. Web. 22 Jan 2021.
Vancouver:
Huang D(. Reinventing the (green) strips: An investigation on urban in-betweenness. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2021 Jan 22].
Available from: http://resolver.tudelft.nl/uuid:6d09d700-2958-45ab-8952-18460852885f.
Council of Science Editors:
Huang D(. Reinventing the (green) strips: An investigation on urban in-betweenness. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:6d09d700-2958-45ab-8952-18460852885f
5.
-6879-6322.
Algorithms for dynamic and distributed networks : shortest paths, betweenness centrality and related problems.
Degree: PhD, Computer Science, 2018, University of Texas – Austin
URL: http://hdl.handle.net/2152/63353
► In this thesis we study the problem of computing Betweenness Centrality in dynamic and distributed networks. Betweenness Centrality (BC) is a well-known measure for the…
(more)
▼ In this thesis we study the problem of computing
Betweenness Centrality in dynamic and distributed networks.
Betweenness Centrality (BC) is a well-known measure for the relative importance of a node in a social network. It is widely used in applications such as understanding lethality in biological networks, identifying key actors in terrorist networks, supply chain management processes and more. The necessity of computing BC in large networks, especially when they quickly change their topology over time, motivates the study of dynamic algorithms that can perform faster than static ones. Moreover, the current techniques for computing BC requires a deeper understanding of a classic problem in computer science: computing all pairs all shortest paths (APASP) in a graph. One of the main contributions of this thesis is a collection of dynamic algorithms for computing APASP and BC scores which are provably faster than static algorithms for several classes of graphs. We use n = |V| and m = |E| to indicate respectively the number of nodes and edges in a directed positively weighted graph G = (V,E). Our bounds depend on the parameter [nu]* that is defined as the maximum number of edges that lie on shortest paths through any single vertex. The main results in the first part of this thesis are listed below.
- A decrease-only algorithm for computing BC and APASP running in time O([nu]* n) that is provably faster than recomputing from scratch in sparse graphs.
- An increase-only algorithm for computing BC and APASP that runs in O([nu]*² log n) per update for a sequence of at least [Omega](m*/[nu]*) updates. Here m* is the number of edges in G that lie on shortest paths. This algorithm uses O(m* [nu]*) space.
- An increase-only algorithm for computing BC and APASP that runs in O([nu]*² log n) but improves the computational space to O(m*n).
- A fully dynamic algorithm for computing BC and APASP that runs in O([nu]*² log³ n) amortized time per update for a sequence of at least [Omega](n) updates.
- A refinement of our fully dynamic algorithm that improves the amortized running time to O([nu]*² log² n), saving a logarithmic factor.
In the second part of this thesis, we study the case when the input graph is a distributed network of machines and the BC score of each machine, considering its location within the network topology, needs to be computed. In this scenario, each node in the input graph is a self-contained machine with limited knowledge of the network and communication power. Each machine only knows the (virtual) location of the neighbors machines (adjacent nodes in the input graph). The messages, exchanged in each round between machines, cannot exceed a bounded size of at most O(log n) bits. In this distributed model, called CONGEST, we present algorithms for computing BC in near-optimal time for unweighted networks, and some classes of weighted networks. Specifically, our main results are:
- A distributed BC algorithm for unweighted undirected graphs completing in at most min(2n+O(D[underscore u]); 4n) rounds,…
Advisors/Committee Members: Ramachandran, Vijaya (advisor), Alvisi, Lorenzo (committee member), Nasre, Meghana (committee member), Plaxton, C. Greg (committee member), Zuckerman, David (committee member).
Subjects/Keywords: Betweenness centrality; Dynamic algorithms; Distributed algorithms
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-6879-6322. (2018). Algorithms for dynamic and distributed networks : shortest paths, betweenness centrality and related problems. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/63353
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-6879-6322. “Algorithms for dynamic and distributed networks : shortest paths, betweenness centrality and related problems.” 2018. Doctoral Dissertation, University of Texas – Austin. Accessed January 22, 2021.
http://hdl.handle.net/2152/63353.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-6879-6322. “Algorithms for dynamic and distributed networks : shortest paths, betweenness centrality and related problems.” 2018. Web. 22 Jan 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-6879-6322. Algorithms for dynamic and distributed networks : shortest paths, betweenness centrality and related problems. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2018. [cited 2021 Jan 22].
Available from: http://hdl.handle.net/2152/63353.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-6879-6322. Algorithms for dynamic and distributed networks : shortest paths, betweenness centrality and related problems. [Doctoral Dissertation]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/63353
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
University of Ottawa
6.
Afrasiabi Rad, Amir.
Social Network Analysis and Time Varying Graphs
.
Degree: 2016, University of Ottawa
URL: http://hdl.handle.net/10393/34441
► The thesis focuses on the social web and on the analysis of social networks with particular emphasis on their temporal aspects. Social networks are represented…
(more)
▼ The thesis focuses on the social web and on the analysis of social networks with particular emphasis on their temporal aspects. Social networks are represented here by Time Varying Graphs (TVG), a general model for dynamic graphs borrowed from distributed computing.
In the first part of the thesis we focus on the temporal aspects of social networks. We develop various temporal centrality measures for TVGs including betweenness, closeness, and eigenvector centralities, which are well known in the context of static graphs. Unfortunately the computational complexities of these temporal centrality metrics are not comparable with their static counterparts. For example, the computation of betweenness becomes intractable in the dynamic setting. For this reason, approximation techniques will also be considered. We apply these temporal measures to two very different datasets, one in the context of knowledge mobilization in a small community of university researchers, the other in the context of Facebook commenting activities among a large number of web users. In both settings, we perform a temporal analysis so to understand the importance of the temporal factors in the dynamics of those networks and to detect nodes that act as “accelerators”.
In the second part of the thesis, we focus on a more standard static graph representation. We conduct a propagation study on YouTube datasets to understand and compare the propagation dynamics of two different types of users: subscribers and friends. Finally, we conclude the thesis with the proposal of a general framework to present, in a comprehensive model, the influence of the social web on e-commerce decision making.
Subjects/Keywords: Social Network Analysis;
Time Varying Graphs;
Betweenness Centrality;
Temporal Centrality;
Temporal Eigenvector Centrality;
Foremost Betweenness
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Afrasiabi Rad, A. (2016). Social Network Analysis and Time Varying Graphs
. (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/34441
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Afrasiabi Rad, Amir. “Social Network Analysis and Time Varying Graphs
.” 2016. Thesis, University of Ottawa. Accessed January 22, 2021.
http://hdl.handle.net/10393/34441.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Afrasiabi Rad, Amir. “Social Network Analysis and Time Varying Graphs
.” 2016. Web. 22 Jan 2021.
Vancouver:
Afrasiabi Rad A. Social Network Analysis and Time Varying Graphs
. [Internet] [Thesis]. University of Ottawa; 2016. [cited 2021 Jan 22].
Available from: http://hdl.handle.net/10393/34441.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Afrasiabi Rad A. Social Network Analysis and Time Varying Graphs
. [Thesis]. University of Ottawa; 2016. Available from: http://hdl.handle.net/10393/34441
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Virginia Tech
7.
Narayanan, Shivaram.
The Betweenness Centrality Of Biological Networks.
Degree: MS, Computer Science, 2005, Virginia Tech
URL: http://hdl.handle.net/10919/35405
► In the last few years, large-scale experiments have generated genome-wide protein interaction networks for many organisms including Saccharomyces cerevisiae (baker's yeast), Caenorhabditis elegans (worm) and…
(more)
▼ In the last few years, large-scale experiments have generated genome-wide protein interaction networks for many organisms including Saccharomyces cerevisiae (baker's yeast), Caenorhabditis elegans (worm) and Drosophila melanogaster (fruit fly). In this thesis, we examine the vertex and edge
betweenness centrality measures of these graphs. These measures capture how "central" a vertex or an edge is in the graph by considering the fraction of shortest paths that pass through that vertex or edge. Our primary observation is that the distribution of the vertex
betweenness centrality follows a power law, but the distribution of the edge
betweenness centrality has a Poisson-like distribution with a very sharp spike. To investigate this phenomenon, we generated random networks with degree distribution identical to those of the protein interaction networks. To our surprise, we found out that the random networks and the protein interaction networks had almost identical distribution of edge
betweenness. We conjecture that the "Poisson-like" distribution of the edge
betweenness centrality is the property of any graph whose degree distribution satisfies power law.
Advisors/Committee Members: Murali, T. M. (committeechair), Marathe, Madhav V. (committee member), Vullikanti, Anil Kumar S. (committee member).
Subjects/Keywords: Betweenness centrality; Vertex Betweenness; Edge Betweenness; Power law; Biological networks
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Narayanan, S. (2005). The Betweenness Centrality Of Biological Networks. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/35405
Chicago Manual of Style (16th Edition):
Narayanan, Shivaram. “The Betweenness Centrality Of Biological Networks.” 2005. Masters Thesis, Virginia Tech. Accessed January 22, 2021.
http://hdl.handle.net/10919/35405.
MLA Handbook (7th Edition):
Narayanan, Shivaram. “The Betweenness Centrality Of Biological Networks.” 2005. Web. 22 Jan 2021.
Vancouver:
Narayanan S. The Betweenness Centrality Of Biological Networks. [Internet] [Masters thesis]. Virginia Tech; 2005. [cited 2021 Jan 22].
Available from: http://hdl.handle.net/10919/35405.
Council of Science Editors:
Narayanan S. The Betweenness Centrality Of Biological Networks. [Masters Thesis]. Virginia Tech; 2005. Available from: http://hdl.handle.net/10919/35405
8.
McCoy, Daniel.
Comparing consensus modules using S2B and MODifieR.
Degree: Bioscience, 2019, University of Skövde
URL: http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-16760
► It is currently understood that diseases are typically not caused by rogue errors in genetics but have both molecular and environmental causes from myriad…
(more)
▼ It is currently understood that diseases are typically not caused by rogue errors in genetics but have both molecular and environmental causes from myriad overlapping interactions within an interactome. Genetic errors, such as that seen by a single-nucleotide polymorphism can lead to a dysfunctional cell, which in turn can lead to systemic disruptions that result in disease phenotypes. Perturbations within the interactome, as can be caused by many such errors, can be organized into a pathophenotype, or “disease module”. Disease modules are sets of correlated variables that can represent many of a disease’s activities with subgraphs of nodes and edges. Many methods for inferring disease modules are available today, but the results each one yields is not only variable between methods but also across datasets and trial attempts. In this study, several such inference methods for deriving disease modules are evaluated by combining them to create “consensus” modules. The method of focus is Double-Specific Betweenness (S2B), which uses betweenness centrality across separate diseases to derive new modules. This study, however, uses S2B to combine the results of independent inference methods rather than separate diseases to derive new modules. Pre-processed asthma and arthritis data are compared using various combinations of inference methods. The performance of each result is validated using Pathway Scoring Algorithm. The results of this study suggest that combining methods of inference using MODifieR or S2B may be beneficial for deriving meaningful disease modules.
Subjects/Keywords: S2B; MODifieR; specific betweenness; betweenness centrality; disease module; module inference; asthma; arthritis; Bioinformatics and Systems Biology; Bioinformatik och systembiologi
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
McCoy, D. (2019). Comparing consensus modules using S2B and MODifieR. (Thesis). University of Skövde. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-16760
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
McCoy, Daniel. “Comparing consensus modules using S2B and MODifieR.” 2019. Thesis, University of Skövde. Accessed January 22, 2021.
http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-16760.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
McCoy, Daniel. “Comparing consensus modules using S2B and MODifieR.” 2019. Web. 22 Jan 2021.
Vancouver:
McCoy D. Comparing consensus modules using S2B and MODifieR. [Internet] [Thesis]. University of Skövde; 2019. [cited 2021 Jan 22].
Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-16760.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
McCoy D. Comparing consensus modules using S2B and MODifieR. [Thesis]. University of Skövde; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-16760
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Universidade do Rio Grande do Sul
9.
Batista, Rodrigo de Abreu.
Combinando centralidade de intermediação e demanda de tráfego para identificação de pontos centrais em redes viárias.
Degree: 2015, Universidade do Rio Grande do Sul
URL: http://hdl.handle.net/10183/129878
► Esse trabalho consiste em um estudo sobre a aplicabilidade da medida de centralidade de intermediação (betweenness centrality) combinada com demandas de tráfego em redes viárias…
(more)
▼ Esse trabalho consiste em um estudo sobre a aplicabilidade da medida de centralidade de intermediação (betweenness centrality) combinada com demandas de tráfego em redes viárias com o objetivo de identificar os principais pontos dessas redes. Como principais pontos refere-se aqui aos que aparecem com maior frequência entre os caminhos utilizados pelos motoristas que se deslocam pela rede viária. Trata-se de um estudo exploratório, que se inicia com a aplicação da centralidade de intermediação sobre redes simples, estendendo-se até simulações sobre redes baseadas em mapas reais. Nesse trabalho é analisado o comportamento da medida de centralidade sobre a topologia da rede - i.e. tanto sem considerar uma demanda, como considerando demandas de diversas magnitudes. Para ilustrar a proposta, os resultados são confrontados com valores de centralidade de intermediação calculados sobre as taxas de ocupação das vias extraídas de simulação microscópica. Ao final, foram apresentadas evidências de que o método proposto consegue explicar os fluxos de tráfego com melhor desempenho do que a centralidade de intermediação original. No entanto, o método mostrou-se muito sensível à função de custo utilizada na atribuição da demanda de tráfego ao grafo da rede. Os melhores resultados demonstrados pela abordagem proposta foram obtidos em experimentos sobre redes não regulares e com demandas de tráfego não uniformes. No caso de redes regulares com demanda uniforme, o melhor desempenho foi obtido pelo cálculo da centralidade sem considerar a demanda, mas atribuindo-se o custo unitário às arestas do grafo representativo da rede.
This work consists of a study of applicability of betweenness centrality combined with traffic demands in road networks with the objective of identifying their central points. By central points we refer to those which appear with high frequency among the paths used by drivers that move along the road network. It is an exploratory study, which begins with the application of the betweenness centrality on simple networks, extending to simulations on networks based on real maps. In this study we have analyzed the behavior of the metric over the network topology - i.e. without considering demand, as well as experiments considering demands with several magnitudes. To illustrate the proposed method, the results are compared with betweenness centrality values calculated over roadways occupation rates extracted from microscopic simulation. At the end, evidence that the proposed method can explain traffic flows with better performance than the original betweenness centrality were presented. However, the proposed method was shown to be very sensitive to the cost function used in the allocation of the graph network traffic demand. The best results demonstrated by the proposed approach were obtained in experiments on nonregular networks and non-uniform traffic demands. In the case of regular networks with uniform demand, the best performance was obtained by calculating the betweenness centrality without considering the…
Advisors/Committee Members: Bazzan, Ana Lucia Cetertich.
Subjects/Keywords: Inteligência artificial; Intelligent transportation systems; Informatica : Transportes; Betweenness centrality; Complex networks
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Batista, R. d. A. (2015). Combinando centralidade de intermediação e demanda de tráfego para identificação de pontos centrais em redes viárias. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/129878
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Batista, Rodrigo de Abreu. “Combinando centralidade de intermediação e demanda de tráfego para identificação de pontos centrais em redes viárias.” 2015. Thesis, Universidade do Rio Grande do Sul. Accessed January 22, 2021.
http://hdl.handle.net/10183/129878.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Batista, Rodrigo de Abreu. “Combinando centralidade de intermediação e demanda de tráfego para identificação de pontos centrais em redes viárias.” 2015. Web. 22 Jan 2021.
Vancouver:
Batista RdA. Combinando centralidade de intermediação e demanda de tráfego para identificação de pontos centrais em redes viárias. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2015. [cited 2021 Jan 22].
Available from: http://hdl.handle.net/10183/129878.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Batista RdA. Combinando centralidade de intermediação e demanda de tráfego para identificação de pontos centrais em redes viárias. [Thesis]. Universidade do Rio Grande do Sul; 2015. Available from: http://hdl.handle.net/10183/129878
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Harvard University
10.
Mohamad, Muhammad Arafat Bin.
Be-Longing: Fatanis in Makkah and Jawi.
Degree: PhD, Anthropology, 2013, Harvard University
URL: http://nrs.harvard.edu/urn-3:HUL.InstRepos:11107811
► This dissertation is a study about belonging among the Fatanis who are caught between two places, namely Makkah and Jawi. Using historical and ethnographic data…
(more)
▼ This dissertation is a study about belonging among the Fatanis who are caught between two places, namely Makkah and Jawi. Using historical and ethnographic data collected during two years of transnational fieldwork in Saudi Arabia, Thailand, and Malaysia, this dissertation shows that belonging is constituted as much by ideas of community, namely home and the homeland, as it is by lived experience as well as practical and cultural factors. Its central argument is that belonging is unstable, often incomplete, and always contingent owing to the dynamic quality of social life. Belonging is a condition that is volatile. It is not something that can be retained perpetually. A person might experience comfort from belonging someplace at a particular moment, while yearning to be somewhere else simultaneously. Thus, longing often accompanies belonging. In the late-eighteenth century, some Fatani men and women left Patani, on the northern Malay Peninsula, and sailed northwest until they arrived at Makkah. These migrants left in search of safety and inspiration as Siamese armies pillaged their homeland in attempts to depopulate Siam’s recalcitrant tributary kingdom from 1785-1839. Almost two and half centuries later, in contemporary times, the Fatanis are once again on the move. This time, unfavorable conditions in Makkah are the causes of reverse migration to the homeland, which the Fatanis refer to as Jawi. For the Fatanis, who are caught between Makkah and Jawi, belonging is elusive. Makkah, the place and society that many of them consider home, is familiar, but also where their right of residency as foreigners is fragile. On the other hand, Jawi, the homeland, is foreign to the Fatanis despite their status as nationals. From one page to another, this text tells the Fatanis’ stories of pain and yearning, but also of their ingenuity and perseverance.
Anthropology
Advisors/Committee Members: Caton, Steven C. (advisor), Bestor, Theodore (committee member), Herzfeld, Michael (committee member), Ho, Engseng (committee member).
Subjects/Keywords: Cultural anthropology; belonging; in-betweenness; Makkah; migration; Patani
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Mohamad, M. A. B. (2013). Be-Longing: Fatanis in Makkah and Jawi. (Doctoral Dissertation). Harvard University. Retrieved from http://nrs.harvard.edu/urn-3:HUL.InstRepos:11107811
Chicago Manual of Style (16th Edition):
Mohamad, Muhammad Arafat Bin. “Be-Longing: Fatanis in Makkah and Jawi.” 2013. Doctoral Dissertation, Harvard University. Accessed January 22, 2021.
http://nrs.harvard.edu/urn-3:HUL.InstRepos:11107811.
MLA Handbook (7th Edition):
Mohamad, Muhammad Arafat Bin. “Be-Longing: Fatanis in Makkah and Jawi.” 2013. Web. 22 Jan 2021.
Vancouver:
Mohamad MAB. Be-Longing: Fatanis in Makkah and Jawi. [Internet] [Doctoral dissertation]. Harvard University; 2013. [cited 2021 Jan 22].
Available from: http://nrs.harvard.edu/urn-3:HUL.InstRepos:11107811.
Council of Science Editors:
Mohamad MAB. Be-Longing: Fatanis in Makkah and Jawi. [Doctoral Dissertation]. Harvard University; 2013. Available from: http://nrs.harvard.edu/urn-3:HUL.InstRepos:11107811
University of Houston
11.
-8240-492X.
Computing Graph Metrics and Graph Properties with SQL Queries.
Degree: MS, Computer Science, 2019, University of Houston
URL: http://hdl.handle.net/10657/5294
► Within big data analytics, graph problems are as important as machine learning. There exist many algorithms to analyze large graphs, but they are limited by…
(more)
▼ Within big data analytics, graph problems are as important as machine learning. There exist many algorithms to analyze large graphs, but they are limited by main memory. On the other hand, a lot of data stored on DBMSs needs to be analyzed as graphs. Moreover, DBMSs can work in parallel, and they do not have RAM limitations. In this paper, we propose several algorithms that produce metrics and show properties of the graph as well as help us to understand the graph structure specifically diameter and
betweenness centrality. This work is a big step beyond transitive closure and recursive queries. We propose optimized SQL queries that work on a graph stored in relational form as triples which can compute diameter and
betweenness centrality in a more flexible and efficient manner. We study how to optimize SQL queries combining demanding joins and aggregations that remove main memory limitation and also work in parallel. Finally, we provide an experimental evaluation to understand accuracy and performance. We compare our algorithms with popular platforms including Python and Spark. We experimentally show our that SQL algorithms are accurate and efficient.
Advisors/Committee Members: Ordonez, Carlos (advisor), Pandurangan, Gopal (committee member), Azencott, Robert (committee member).
Subjects/Keywords: Graph analysis; SQL queries; Betweenness centrality; Diameter; DBMS
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-8240-492X. (2019). Computing Graph Metrics and Graph Properties with SQL Queries. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/5294
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-8240-492X. “Computing Graph Metrics and Graph Properties with SQL Queries.” 2019. Masters Thesis, University of Houston. Accessed January 22, 2021.
http://hdl.handle.net/10657/5294.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-8240-492X. “Computing Graph Metrics and Graph Properties with SQL Queries.” 2019. Web. 22 Jan 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-8240-492X. Computing Graph Metrics and Graph Properties with SQL Queries. [Internet] [Masters thesis]. University of Houston; 2019. [cited 2021 Jan 22].
Available from: http://hdl.handle.net/10657/5294.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-8240-492X. Computing Graph Metrics and Graph Properties with SQL Queries. [Masters Thesis]. University of Houston; 2019. Available from: http://hdl.handle.net/10657/5294
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Uppsala University
12.
Aronsson, Fanny Pérez.
"I don't belong anywhere. That's the problem." : (In)Between ethnicities, masculinities, and sexualities in Latino American coming-of-age novels.
Degree: Centre for Gender Research, 2015, Uppsala University
URL: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-256781
► The aim of this study has been to examine representations of Latino boys and young men in Latino American coming of age novels. Two…
(more)
▼ The aim of this study has been to examine representations of Latino boys and young men in Latino American coming of age novels. Two concepts have been central to the study: positions of (in)betweenness and the ability to "fall in line" with norms and expectations. Three overarching themes are been explored in relation to masculinity. These are sexualities, ethnicities, and the representation of women. First, representations of queer sexualities are explored, focusing on the protagonists' "coming out" process and the varying reactions to this. The second part of this theme explores representations of disciplining strategies between boys and men as a means to regulating homosocial bonding and maintain the dominant masculinity ideal. The second theme, ethnicity, examines representations of "authentic" Latino identities in relation to language and bilingualism, and the link between location and identity. Disciplining measures aimed towards the protagonists, such as criminalization and dehumanization, are also explored. The final theme deals with the lacking representation of women in literature and research focused on men and masculinity. In the novels, women are depicted as confidants, present in the boys' lives mainly in order to provoke and facilitate their renegotiations of ideas regarding the previously discussed themes. The boys are represented as inhabiting positions of (in)betweenness throughout the novels, whether in relation to ethnicity, sexuality or gender. While (in)betweenness holds a potential to challenge and "worry" fixed categories, these positions are also characterized by unease, precariousness and the risk of being disciplined by other men.
Subjects/Keywords: masculinity; boyhood; sexuality; ethnicity; Latino American; (in)betweenness; discipline; homosociality; identity
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Aronsson, F. P. (2015). "I don't belong anywhere. That's the problem." : (In)Between ethnicities, masculinities, and sexualities in Latino American coming-of-age novels. (Thesis). Uppsala University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-256781
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Aronsson, Fanny Pérez. “"I don't belong anywhere. That's the problem." : (In)Between ethnicities, masculinities, and sexualities in Latino American coming-of-age novels.” 2015. Thesis, Uppsala University. Accessed January 22, 2021.
http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-256781.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Aronsson, Fanny Pérez. “"I don't belong anywhere. That's the problem." : (In)Between ethnicities, masculinities, and sexualities in Latino American coming-of-age novels.” 2015. Web. 22 Jan 2021.
Vancouver:
Aronsson FP. "I don't belong anywhere. That's the problem." : (In)Between ethnicities, masculinities, and sexualities in Latino American coming-of-age novels. [Internet] [Thesis]. Uppsala University; 2015. [cited 2021 Jan 22].
Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-256781.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Aronsson FP. "I don't belong anywhere. That's the problem." : (In)Between ethnicities, masculinities, and sexualities in Latino American coming-of-age novels. [Thesis]. Uppsala University; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-256781
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
13.
Olanders, Julia.
Betweenness.
Degree: Interior Architecture and Visual Communication (DIV), 2019, University of Arts
URL: http://urn.kb.se/resolve?urn=urn:nbn:se:konstfack:diva-6954
► Betweenness is a project questioning the relation between us and what we surround us with. To reveal our assumptions around artifacts and by doing…
(more)
▼ Betweenness is a project questioning the relation between us and what we surround us with. To reveal our assumptions around artifacts and by doing so create an conversation between us viewers/ users and the objects themselves. Who owns the dialogue: the object or the viewer? Taking a deeper dive into the symbols and languages of objects, the quiet voices they posses and the functions surfaces, the visualization circle around words such as visual function, ornamentation, material displacement and attraction. By trying to convey the objects “inner thoughts” and creating a dialogue it pushes our ideas of what is desirable, what is strange, what is useful or even beautiful. The trick is in the contrast between what we see and what we know, bordering into imaginary, creating voices for ambiguous objects.
Subjects/Keywords: Identity; Duality; Surfaces; Betweenness; Ornamentation; Evolution; Function; Semiotics; Twinship; Design; Design
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Olanders, J. (2019). Betweenness. (Thesis). University of Arts. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:konstfack:diva-6954
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Olanders, Julia. “Betweenness.” 2019. Thesis, University of Arts. Accessed January 22, 2021.
http://urn.kb.se/resolve?urn=urn:nbn:se:konstfack:diva-6954.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Olanders, Julia. “Betweenness.” 2019. Web. 22 Jan 2021.
Vancouver:
Olanders J. Betweenness. [Internet] [Thesis]. University of Arts; 2019. [cited 2021 Jan 22].
Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:konstfack:diva-6954.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Olanders J. Betweenness. [Thesis]. University of Arts; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:konstfack:diva-6954
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Princeton University
14.
Pshevorska, Liana.
IN-BETWEENNESS: AESTHETICS AND IDENTITY IN CONTEMPORARY TRANSLINGUAL FRANCOPHONE LITERATURE
.
Degree: PhD, 2020, Princeton University
URL: http://arks.princeton.edu/ark:/88435/dsp0137720g65b
► This dissertation examines aesthetics of in-betweenness and identity in the works of contemporary authors who migrated to France from non-francophone regions and chose to adopt…
(more)
▼ This dissertation examines aesthetics of in-
betweenness and identity in the works of contemporary authors who migrated to France from non-francophone regions and chose to adopt French for literary expression: Vassilis Alexakis (Greece), Brina Svit (Slovenia), and Andreï Makine (Russia). Common approaches to translingualism tend to focus on the material interaction between languages in the text (plurilingual practices) or on authors’ impressions of changing tongues. This dissertation contributes to scholarship by accounting for aesthetic forms of in-
betweenness that have been overshadowed by the bilingual lens. Throughout its three case studies, it argues that the original tension between native and adopted languages is explored under new poetic guises that are not limited to the thematization of bilingualism and migration. This project is informed by the reception and marketization of translingual literature in France. Specifically, it examines how the authors respond to the nation-state’s conditional hospitality and engage with reception in their own texts.
The first chapter argues that in Vassilis Alexakis' autobiographic "Paris-Athènes" (1989), the text’s polyphonic character resides in the narrator’s ability to act as the creator and critic of his own text, rather than in the interaction between Greek and French languages. The second chapter on Brina Svit’s novel "Coco Dias ou la Porte Dorée" (2007) demonstrates that, by structurally imitating Argentine tango in writing, the tension typically found between native and adopted languages is transformed into an intermedial dialogue between literature and dance. Rereading autobiographic "Moreno" in light of "Coco Dias" brings to the fore an intersubjective dimension of Svit’s translingualism as being beyond traditional communities and conventional affiliations. The third chapter argues that Andreï Makine’s "Le Testament français" and "Alternaissance" (2011) – the latter written under his heteronymic identity Gabriel Osmonde – share an aesthetic quest for a poetic language of in-
betweenness, despite the absence of the habitual Franco-Russian paradigm in the second novel.
My dissertation reveals a tendency to convert linguistic displacement into an aesthetic position of in-
betweenness that – rather than being reconciled – is recreated to assert linguistic freedom and test the limits of language by acting on its perception. Collectively, these three case studies call attention to the malleability and instability of translingual postures that challenge the writers’ status as “assimilationist” figures in reception.
Advisors/Committee Members: Rentzou, Effie (advisor).
Subjects/Keywords: Andreï Makine;
Brina Svit;
Francophone literature;
In-betweenness;
Translingualism;
Vassilis Alexakis
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Pshevorska, L. (2020). IN-BETWEENNESS: AESTHETICS AND IDENTITY IN CONTEMPORARY TRANSLINGUAL FRANCOPHONE LITERATURE
. (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp0137720g65b
Chicago Manual of Style (16th Edition):
Pshevorska, Liana. “IN-BETWEENNESS: AESTHETICS AND IDENTITY IN CONTEMPORARY TRANSLINGUAL FRANCOPHONE LITERATURE
.” 2020. Doctoral Dissertation, Princeton University. Accessed January 22, 2021.
http://arks.princeton.edu/ark:/88435/dsp0137720g65b.
MLA Handbook (7th Edition):
Pshevorska, Liana. “IN-BETWEENNESS: AESTHETICS AND IDENTITY IN CONTEMPORARY TRANSLINGUAL FRANCOPHONE LITERATURE
.” 2020. Web. 22 Jan 2021.
Vancouver:
Pshevorska L. IN-BETWEENNESS: AESTHETICS AND IDENTITY IN CONTEMPORARY TRANSLINGUAL FRANCOPHONE LITERATURE
. [Internet] [Doctoral dissertation]. Princeton University; 2020. [cited 2021 Jan 22].
Available from: http://arks.princeton.edu/ark:/88435/dsp0137720g65b.
Council of Science Editors:
Pshevorska L. IN-BETWEENNESS: AESTHETICS AND IDENTITY IN CONTEMPORARY TRANSLINGUAL FRANCOPHONE LITERATURE
. [Doctoral Dissertation]. Princeton University; 2020. Available from: http://arks.princeton.edu/ark:/88435/dsp0137720g65b
University of Notre Dame
15.
Yihui Ren.
Betweenness Centrality and Its Applications from Modeling
Traffic Flows to Network Community Detection</h1>.
Degree: Physics, 2015, University of Notre Dame
URL: https://curate.nd.edu/show/9w032229n66
► As real-world complex networks are heterogeneous structures, not all their components such as nodes, edges and subgraphs carry the same role or importance in…
(more)
▼ As real-world complex networks are
heterogeneous structures, not all their components such as nodes,
edges and subgraphs carry the same role or importance in the
functions performed by the networks: some elements are more
critical than others. Understanding the roles of the components of
a network is crucial for understanding the behavior of the network
as a whole. One the most basic function of networks is transport;
transport of vehicles/people, information, materials, forces, etc,
and these quantities are transported along edges between source and
destination nodes. For this reason, network path-based importance
measures, also called centralities, play a crucial role in the
understanding of the transport functions of the network and the
network’s structural and dynamical behavior in general.
In this thesis we study the notion of
betweenness
centrality, which measures the fraction of lowest-cost (or
shortest) paths running through a network component, in particular
through a node or an edge. High
betweenness centrality nodes/edges
are those that will be frequently used by the entities transported
through the network and thus they play a key role in the overall
transport properties of the network. In the first part of the
thesis we present a first-principles based method for traffic
prediction using a cost-based generalization of the radiation model
(emission/absorption model) for human mobility, coupled with a
cost-minimizing algorithm for efficient distribution of the
mobility fluxes through the network. Using US census and highway
traffic data, we show that traffic can efficiently and accurately
be computed from a range- limited, network
betweenness type
calculation. The model based on travel time costs captures the
log-normal distribution of the traffic and attains a high Pearson
correlation coefficient (0.75) when compared with real traffic. We
then focus on studying the extent of changes in traffic flows in
the wake of a localized damage or alteration to the network and we
demonstrate that the changes can propagate globally, affecting
traffic several hundreds of miles away. Because of its principled
nature, this method can inform many applications related to human
mobility driven flows in spatial networks, ranging from
transportation, through urban planning to mitigation of the effects
of catastrophic events. In the second part of
the thesis we focus on network deconstruction and community
detection problems, both intensely studied topics in network
science, using a weighted
betweenness centrality approach. We
present an algorithm that solves both problems efficiently and
accurately and demonstrate that on both benchmark networks and data
networks.
Advisors/Committee Members: Kathie E. Newman, Committee Member, Nitesh Chawla, Committee Member, Zoltan Toroczkai, Committee Chair, Dervis Can Vural, Committee Member.
Subjects/Keywords: network science; first-principle based; betweenness centrality; traffic prediction
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ren, Y. (2015). Betweenness Centrality and Its Applications from Modeling
Traffic Flows to Network Community Detection</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/9w032229n66
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Ren, Yihui. “Betweenness Centrality and Its Applications from Modeling
Traffic Flows to Network Community Detection</h1>.” 2015. Thesis, University of Notre Dame. Accessed January 22, 2021.
https://curate.nd.edu/show/9w032229n66.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Ren, Yihui. “Betweenness Centrality and Its Applications from Modeling
Traffic Flows to Network Community Detection</h1>.” 2015. Web. 22 Jan 2021.
Vancouver:
Ren Y. Betweenness Centrality and Its Applications from Modeling
Traffic Flows to Network Community Detection</h1>. [Internet] [Thesis]. University of Notre Dame; 2015. [cited 2021 Jan 22].
Available from: https://curate.nd.edu/show/9w032229n66.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Ren Y. Betweenness Centrality and Its Applications from Modeling
Traffic Flows to Network Community Detection</h1>. [Thesis]. University of Notre Dame; 2015. Available from: https://curate.nd.edu/show/9w032229n66
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Tasmania
16.
Smith, NM.
Drawing the betweenness of place.
Degree: 2014, University of Tasmania
URL: https://eprints.utas.edu.au/22411/13/whole_Smith_thesis_ex_pub_mat.pdf
;
https://eprints.utas.edu.au/22411/2/whole-Smith-Natalie-thesis-2014.pdf
► This research explores the practice of creativity as a means to illuminating the significant yet under explored concept of betweenness. It consists of a theoretical…
(more)
▼ This research explores the practice of creativity as a means to illuminating the significant yet under explored concept of betweenness. It consists of a theoretical interpretation of the concept and its intersection with related concepts, augmented by interview material drawn from participants experiencing the betweenness of everyday journeying. Research participants were drawn from the Tasmanian arts community and included practitioners of visual arts, music, dance, literature, architecture, poetry and film. Creative production itself involves crossings-over; attempts to transcend the mundane by entering emotional and intellectual terrain that is unfamiliar and of unknown status – between what is known and what is yet to be known. For this reason, art practitioners were deemed to be particularly suited to the research needs of the project.
The thesis explores participants’ descriptions of their everyday journeys between two places in order to answer the following questions. Is the inchoate experience, the numinous sensation that seems to characterise commonly undertaken journeys between two places, the emotional essence of betweenness? Given that the inchoate and numinous that qualify betweenness reside at the limits of representation, how might one represent these experiences? This might be described as ‘representing the unrepresentable – without representing it’. The device that I use is the practice of drawing. Rather than representing the betweenness, I use the practice of drawing as a device to ‘give presence’ to the betweenness.
The research uses a phenomenological approach to elucidate individuals’ perceptions of their journeys between two places, and then gathers observations into groups which, together with a review of the literature and autoethnographic explorations, reveal several of many possible components of betweenness. Taken together these comprise a drawing of the betweenness of place. The responses are visual and evocative while also affective in the more discursive sense of the term. Stress is on the process, then, and no ‘hard, definitive’ conclusion as to the nature of betweenness is reached.
Subjects/Keywords: Art; creativity; non-representation theory; journeying; drawing; place; betweenness; everyday cultural geography
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Smith, N. (2014). Drawing the betweenness of place. (Thesis). University of Tasmania. Retrieved from https://eprints.utas.edu.au/22411/13/whole_Smith_thesis_ex_pub_mat.pdf ; https://eprints.utas.edu.au/22411/2/whole-Smith-Natalie-thesis-2014.pdf
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Smith, NM. “Drawing the betweenness of place.” 2014. Thesis, University of Tasmania. Accessed January 22, 2021.
https://eprints.utas.edu.au/22411/13/whole_Smith_thesis_ex_pub_mat.pdf ; https://eprints.utas.edu.au/22411/2/whole-Smith-Natalie-thesis-2014.pdf.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Smith, NM. “Drawing the betweenness of place.” 2014. Web. 22 Jan 2021.
Vancouver:
Smith N. Drawing the betweenness of place. [Internet] [Thesis]. University of Tasmania; 2014. [cited 2021 Jan 22].
Available from: https://eprints.utas.edu.au/22411/13/whole_Smith_thesis_ex_pub_mat.pdf ; https://eprints.utas.edu.au/22411/2/whole-Smith-Natalie-thesis-2014.pdf.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Smith N. Drawing the betweenness of place. [Thesis]. University of Tasmania; 2014. Available from: https://eprints.utas.edu.au/22411/13/whole_Smith_thesis_ex_pub_mat.pdf ; https://eprints.utas.edu.au/22411/2/whole-Smith-Natalie-thesis-2014.pdf
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
17.
Qian, Jiayu.
Estimating Vehicle Miles Traveled on Local Roads.
Degree: MS, Civil Engineering, 2013, Texas A&M University
URL: http://hdl.handle.net/1969.1/151794
► This research presents a new method to estimate the local road vehicle miles traveled (VMT) with the concept of betweenness centrality. Betweenness centrality is a…
(more)
▼ This research presents a new method to estimate the local road vehicle miles traveled (VMT) with the concept of
betweenness centrality.
Betweenness centrality is a measure of a node’s or link’s centrality on a network that has been applied popularly in social science and we relate it to traffic volumes. We demonstrate that VMT on local roads exhibits a scale-free property: it follows two piecewise (double) power law distributions. In other words, the total local VMT can be obtained by properly connecting the two distributions at a breakpoint, each having a slope of the power law distribution. We show that the breakpoint can be predicted by using certain network topological measures, which indicates that the breakpoint may be an inherent property for a particular network. We also show that the highest
betweenness centrality point can be estimated using network measures. Furthermore, we prove that the estimated VMT is not sensitive to the power of the power law distributions. This research highlights a potentially new direction of effort for local road VMT estimation.
Advisors/Committee Members: Wang, Xiubin Bruce (advisor), Zhang, Yunlong (committee member), Joh, Kenneth (committee member).
Subjects/Keywords: Local Road; Vehicle Miles Traveled (VMT); Betweenness Centrality; Scale-Free Property; Power Law
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Qian, J. (2013). Estimating Vehicle Miles Traveled on Local Roads. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151794
Chicago Manual of Style (16th Edition):
Qian, Jiayu. “Estimating Vehicle Miles Traveled on Local Roads.” 2013. Masters Thesis, Texas A&M University. Accessed January 22, 2021.
http://hdl.handle.net/1969.1/151794.
MLA Handbook (7th Edition):
Qian, Jiayu. “Estimating Vehicle Miles Traveled on Local Roads.” 2013. Web. 22 Jan 2021.
Vancouver:
Qian J. Estimating Vehicle Miles Traveled on Local Roads. [Internet] [Masters thesis]. Texas A&M University; 2013. [cited 2021 Jan 22].
Available from: http://hdl.handle.net/1969.1/151794.
Council of Science Editors:
Qian J. Estimating Vehicle Miles Traveled on Local Roads. [Masters Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151794
Stellenbosch University
18.
Durant, Kevin.
Centrality in random trees.
Degree: PhD, Mathematical Sciences, 2017, Stellenbosch University
URL: http://hdl.handle.net/10019.1/102861
► ENGLISH ABSTRACT : We consider two notions of centrality—namely, the betweenness centrality of a node and whether or not it is a centroid—in families of…
(more)
▼ ENGLISH ABSTRACT : We consider two notions of centrality—namely, the betweenness centrality of
a node and whether or not it is a centroid—in families of simply generated and
increasing trees. Both of these concepts are defined in terms of paths within a
tree: the betweenness centrality of a node v is the sum, over pairs of nodes, of the
proportions of shortest paths that pass through v; and v is a centroid (there can be
at most two) if it minimises the sum of the distances to the other nodes in the tree.
We find that betweenness centrality in a large, random simply generated tree
is generally linear in the size n of the tree, and that due to the tall, thin nature
of simply generated trees, the probability of a random node having quadratic-order
betweenness centrality decreases as n increases. This leads to a kth moment of
order n2k−(1/2) for the betweenness centrality of a root node, even though a limiting
distribution arises upon linearly rescaling the betweenness centrality. The class of
labelled subcritical graphs, which are tree-like in structure, behave similarly.
Betweenness centrality in a random increasing tree is also usually linear, except
for nodes near to the root of the tree, which typically have centralities of order n2.
The kth moment of the betweenness centrality of any node with a fixed label is
thus of order n2k, but once again the distribution of the betweenness centrality of a
random node converges to a limit when scaled by 1/n.
To complement known results involving centroid nodes in simply generated trees,
we also derive limiting distributions, along with limits of moments, for the depth,
label, and subtree size of the centroid nearest to the root in an increasing tree. The
first two of these distributions are concentrated around the root, while the latter is
a combination of a point measure at 1 and a decreasing density on [1/2, 1).
In addition, we show that the distributions of the maximum betweenness centrality
in simply generated and increasing trees converge, upon suitable rescalings,
to limiting distributions, and that the probability of the centroid attaining maximal
betweenness centrality tends in both cases to a limiting constant.
AFRIKAANSE OPSOMMING : Ons beskou twee konsepte van sentraliteit—naamlik, die tussensentraliteit van
’n punt en of dit ’n sentroïed is of nie—in families van eenvoudig gegenereerde en
toenemende bome. Albei hierdie konsepte word gedefinieer in terme van paaie binne
’n boom: die tussensentraliteit van ’n punt v is die som, oor pare punte, van die
verhouding van kortste paaie wat deur v beweeg; en v is ’n sentroïed indien dit die
som van die afstande tot ander punte in die boom minimeer.
Ons vind dat tussensentraliteit in ’n groot, lukrake eenvoudig gegenereerde boom
is oor die algemeen lineêr in verhouding tot die grootte n van die boom, en as gevolg
van die lang, dun aard van eenvoudig gegenereerde bome, sal die waarskynlikheid
dat ’n ewekansige punt kwadratiese-orde tussensentraliteit sal hê verminder soos wat
n…
Advisors/Committee Members: Wagner, Stephan, Stellenbosch University. Faculty of Science. Dept. of Mathematical Sciences..
Subjects/Keywords: Analytic combinatorics; Betweenness centrality; Simply generated trees; Increasing trees; Centroids; Random trees; UCTD
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Durant, K. (2017). Centrality in random trees. (Doctoral Dissertation). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/102861
Chicago Manual of Style (16th Edition):
Durant, Kevin. “Centrality in random trees.” 2017. Doctoral Dissertation, Stellenbosch University. Accessed January 22, 2021.
http://hdl.handle.net/10019.1/102861.
MLA Handbook (7th Edition):
Durant, Kevin. “Centrality in random trees.” 2017. Web. 22 Jan 2021.
Vancouver:
Durant K. Centrality in random trees. [Internet] [Doctoral dissertation]. Stellenbosch University; 2017. [cited 2021 Jan 22].
Available from: http://hdl.handle.net/10019.1/102861.
Council of Science Editors:
Durant K. Centrality in random trees. [Doctoral Dissertation]. Stellenbosch University; 2017. Available from: http://hdl.handle.net/10019.1/102861
Universitat Pompeu Fabra
19.
Tsalouchidou, Ioanna.
Temporal analysis of large dynamic graphs.
Degree: Departament de Tecnologies de la Informació i les Comunicacions, 2018, Universitat Pompeu Fabra
URL: http://hdl.handle.net/10803/663755
► El objetivo de esta tesis es proporcionar un análisis temporal de las dinámicas estructurales y de interacción de grafos masivos dinámicos. Para esto proponemos nuevas…
(more)
▼ El objetivo de esta tesis es proporcionar un análisis temporal de las dinámicas estructurales y de interacción de grafos masivos dinámicos.
Para esto proponemos nuevas definiciones de métricas en grafos importantes para incluir la dimensión temporal de los grafos dinámicos.
Además, ampliamos tres problemas importantes de minería de datos en un contexto temporal.
Ellos son los resúmenes de grafos temporales, la búsqueda de comunidades en un contexto temporal y la centralidad temporal en grafos.
Además, proponemos una versión distribuida de todos nuestros algoritmos, que permiten que nuestras técnicas a escalar hasta millones de vértices. Finalmente, evaluamos la validez de nuestros métodos en términos de eficiencia y efectividad con extensos experimentos en gráfos de gran escala en el mundo real.
Advisors/Committee Members: [email protected] (authoremail), true (authoremailshow), Baeza-Yates, Ricardo (director), Bonchi, Francesco (director).
Subjects/Keywords: Dynamic graphs; Temporal graphs; Temporal graph summarization; Temporal community search; Temporal betweenness centrality; 62
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Tsalouchidou, I. (2018). Temporal analysis of large dynamic graphs. (Thesis). Universitat Pompeu Fabra. Retrieved from http://hdl.handle.net/10803/663755
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Tsalouchidou, Ioanna. “Temporal analysis of large dynamic graphs.” 2018. Thesis, Universitat Pompeu Fabra. Accessed January 22, 2021.
http://hdl.handle.net/10803/663755.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Tsalouchidou, Ioanna. “Temporal analysis of large dynamic graphs.” 2018. Web. 22 Jan 2021.
Vancouver:
Tsalouchidou I. Temporal analysis of large dynamic graphs. [Internet] [Thesis]. Universitat Pompeu Fabra; 2018. [cited 2021 Jan 22].
Available from: http://hdl.handle.net/10803/663755.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Tsalouchidou I. Temporal analysis of large dynamic graphs. [Thesis]. Universitat Pompeu Fabra; 2018. Available from: http://hdl.handle.net/10803/663755
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Edinburgh
20.
Hikota, Riyako.
And still we wait : Hans Urs von Balthasar's theology of Holy Saturday and its implications for Christian suffering and discipleship.
Degree: PhD, 2016, University of Edinburgh
URL: http://hdl.handle.net/1842/25479
► The significance of Holy Saturday, the day between Good Friday and Easter Sunday, is often ignored in Christian life. The most influential modern theologian who…
(more)
▼ The significance of Holy Saturday, the day between Good Friday and Easter Sunday, is often ignored in Christian life. The most influential modern theologian who has taken its importance seriously is the Swiss Catholic theologian, Hans Urs von Balthasar. He has presented a very innovative but also controversial interpretation that on Holy Saturday Jesus Christ suffered in utter solidarity with the dead in Hell and took to himself our self-damnation. However, this interpretation and several other aspects of his theology related to it seem to depart from the traditional teaching in an idiosyncratic way and have invited various critiques. What this thesis aims to do is to critically examine Balthasar’s theology of Holy Saturday and present its implications for Christian suffering and discipleship, while doing full justice to the genre within which he is working (a combination of theology and spirituality) and at the same time taking into consideration the main critiques made against him. First of all, we will argue that Balthasar does not try to present a radical reinterpretation of the doctrine of the Descent into Hell in contrast to the traditional teachings but rather tries to fully appreciate the in-betweenness of Holy Saturday as the day of transition from the Cross to the Resurrection, in other words, from the old aeon to the new. Balthasar says that Christ Himself descended into Hell as victor over sin and death objectively, but He still had to wait for the victory to arrive subjectively. Further, we will claim that this silent waiting on Holy Saturday, which marks the transition from the Cross to the Resurrection, helps us to deepen our understanding of the meaning of suffering in Christian discipleship. The waiting on Holy Saturday represents the fundamentally ‘tragic’ state of the Christian (understood as “tragedy under grace”) torn between the law of this world and the truth of Christ. As a paradoxical being in transition, the Christian believes that their victory is both already there and not there yet. In this sense, the Christian still lives in Holy Saturday. This notion deepens our understanding of suffering in the Christian life, because now we could translate the meaning of suffering into ‘tragic waiting,’ while fully facing the subjective reality of suffering and at the same time maintaining the hope of finding its salvific meaning by relating it to the paschal mystery. Our conclusion will be that this ‘tragic waiting,’ which itself is our lives, now can be seen in a Christological light. In short, we can patiently endure our Holy Saturday because of Christ’s Holy Saturday in Hell.
Subjects/Keywords: 263; theology; Catholic; suffering; Christian; Hans Urs von Balthasar; in-betweenness; silent waiting; Holy Saturday
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Hikota, R. (2016). And still we wait : Hans Urs von Balthasar's theology of Holy Saturday and its implications for Christian suffering and discipleship. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/25479
Chicago Manual of Style (16th Edition):
Hikota, Riyako. “And still we wait : Hans Urs von Balthasar's theology of Holy Saturday and its implications for Christian suffering and discipleship.” 2016. Doctoral Dissertation, University of Edinburgh. Accessed January 22, 2021.
http://hdl.handle.net/1842/25479.
MLA Handbook (7th Edition):
Hikota, Riyako. “And still we wait : Hans Urs von Balthasar's theology of Holy Saturday and its implications for Christian suffering and discipleship.” 2016. Web. 22 Jan 2021.
Vancouver:
Hikota R. And still we wait : Hans Urs von Balthasar's theology of Holy Saturday and its implications for Christian suffering and discipleship. [Internet] [Doctoral dissertation]. University of Edinburgh; 2016. [cited 2021 Jan 22].
Available from: http://hdl.handle.net/1842/25479.
Council of Science Editors:
Hikota R. And still we wait : Hans Urs von Balthasar's theology of Holy Saturday and its implications for Christian suffering and discipleship. [Doctoral Dissertation]. University of Edinburgh; 2016. Available from: http://hdl.handle.net/1842/25479
Iowa State University
21.
Wang, Heyong.
A two-stage strategy for solving the connection subgraph problem.
Degree: 2012, Iowa State University
URL: https://lib.dr.iastate.edu/etd/12507
► A connection subgraph is a small subgraph of a large graph that best capture the relationship between two nodes. Formally, Connection Subgraph Problem is: Given:…
(more)
▼ A connection subgraph is a small subgraph of a large graph that best capture the relationship between two nodes. Formally, Connection Subgraph Problem is:
Given: An edge-weighted undirected graph G, two query vertices s and t from G, the size of the subgraph b, and a "goodness" function.
Find: A connected subgraph H containing s and t and at most b other vertices that maximizes the "goodness" function g( H ).
Two challenging problems for Connection Subgraph Problem are i) Finding an good "goodness" function ii) and designing algorithms to quickly identify the connection subgraph. The goal of this work is to provide a way to explore and discovery relationship between nodes on graphs, especially for social networks. We focus on connection subgraph problem on the graphs where the relationship between nodes is from all the contributions of their paths. In this research,
we propose a measure called the Path Betweenness of a path to measure the contribution of a path between two nodes to these two nodes' relationship. Based on path betweenness, We introduce graph between of a graph as the "goodness" function for the Connection Subgraph Problem. Graph betweenness of a graph takes contributions of all paths in the graph into consideration. In
order to quickly find the connection subgraph from a large graph, we propose a two-stage solution. The two-stage strategy first generates a small enough intermediate subgraph by eliminating the unimportant nodes in the graph. In the second stage, a candidate subgraph generation algorithm and the graph betweenness computational algorithm are designed to find the connection subgraph. We implemented a system to conduct experiments on real data. Our experimental results show the two-stage strategy can help us quickly find the connection subgraph in practice.
Subjects/Keywords: Connection Subgraph; Data Mining; Graph Betweenness; Graph Mining; Path Between; Computer Sciences
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Wang, H. (2012). A two-stage strategy for solving the connection subgraph problem. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/12507
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Wang, Heyong. “A two-stage strategy for solving the connection subgraph problem.” 2012. Thesis, Iowa State University. Accessed January 22, 2021.
https://lib.dr.iastate.edu/etd/12507.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Wang, Heyong. “A two-stage strategy for solving the connection subgraph problem.” 2012. Web. 22 Jan 2021.
Vancouver:
Wang H. A two-stage strategy for solving the connection subgraph problem. [Internet] [Thesis]. Iowa State University; 2012. [cited 2021 Jan 22].
Available from: https://lib.dr.iastate.edu/etd/12507.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Wang H. A two-stage strategy for solving the connection subgraph problem. [Thesis]. Iowa State University; 2012. Available from: https://lib.dr.iastate.edu/etd/12507
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Toronto
22.
Ghajar-Khosravi, Shadi.
Characteristics of Social Networks Relevant to Predictions of Social Influence.
Degree: PhD, 2015, University of Toronto
URL: http://hdl.handle.net/1807/79725
► Understanding social influence and identifying influential members of a community is of interest to the designers and evaluators of various online services such as recommender…
(more)
▼ Understanding social influence and identifying influential members of a community is of interest to the designers and evaluators of various online services such as recommender systems in e-commerce or health promotion programs in healthcare. Various methods have been proposed for the identification of influentials in past research. However, there is limited research on the relationships between these different methods and the role of networks' topology on these relationships.
The main goals of the research in this thesis were to study relationships between measures of network structure, and to characterize different types of network, where the properties of structural measures differ across the network types. Understanding the structure of social networks should lead to more useful and usable social network applications. In the research reported in this dissertation I began by examining the relationship between structural and behavioral measures of social influence, finding that they are relatively independent of each other in the two social networks that were examined. I then focused on social network centrality measures, which are structural measures commonly used to identify central and potentially influential members of a social network. Two new factors representing network topology properties were identified and a set of 62 real-world social networks were grouped into three different types based on their scores on those factors. Correlations amongst various structural influence measures, and the effect of network topology on structural measures of centrality, were also examined.
A secondary goal of this research was to determine when approximations of computationally complex measures may be used to estimate social influence. Using the factors representing network topology, the correlation between the computationally complex measure of
betweenness centrality and the computationally simpler measure of ego
betweenness was found to vary depending on network topology, opening the way towards network topology-based selection of centrality-based measures of influence.
The research findings presented in this thesis are offered as a first step towards improved methods of identifying influential members in very large social networks.
Advisors/Committee Members: Chignell, Mark, Mechanical and Industrial Engineering.
Subjects/Keywords: centrality measures; ego betweenness; network structure measures; network topology; social networks; 0546
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ghajar-Khosravi, S. (2015). Characteristics of Social Networks Relevant to Predictions of Social Influence. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/79725
Chicago Manual of Style (16th Edition):
Ghajar-Khosravi, Shadi. “Characteristics of Social Networks Relevant to Predictions of Social Influence.” 2015. Doctoral Dissertation, University of Toronto. Accessed January 22, 2021.
http://hdl.handle.net/1807/79725.
MLA Handbook (7th Edition):
Ghajar-Khosravi, Shadi. “Characteristics of Social Networks Relevant to Predictions of Social Influence.” 2015. Web. 22 Jan 2021.
Vancouver:
Ghajar-Khosravi S. Characteristics of Social Networks Relevant to Predictions of Social Influence. [Internet] [Doctoral dissertation]. University of Toronto; 2015. [cited 2021 Jan 22].
Available from: http://hdl.handle.net/1807/79725.
Council of Science Editors:
Ghajar-Khosravi S. Characteristics of Social Networks Relevant to Predictions of Social Influence. [Doctoral Dissertation]. University of Toronto; 2015. Available from: http://hdl.handle.net/1807/79725
23.
Agryzkov, Taras.
Medidas de centralidad en redes urbanas con datos
.
Degree: 2018, University of Alicante
URL: http://hdl.handle.net/10045/80730
► El 54% de la población mundial vive ya en torno a núcleos de población que llamamos ciudades, por lo que su estudio nos enseña la…
(more)
▼ El 54% de la población mundial vive ya en torno a núcleos de población que llamamos ciudades, por lo que su estudio nos enseña la forma en que piensa y se desarrolla el propio ser humano. Un análisis de las relaciones espaciales que se producen en entornos urbanos reales requieren un procesamiento de dichas relaciones en paralelo. Con el fin de representar y analizar estas relaciones espaciales complejas, los especialistas en urbanismo han empezado a utilizar modelos basados en redes complejas. Las redes emergen como un nuevo modelo más acorde con el problema de la complejidad organizada que es una ciudad. Otro aspecto esencial unido a las ciudades es que se han convertido en unas entidades productoras y creadoras de datos, tanto físicos como virtuales. Un estudio serio de la ciudad significa, por tanto, un estudio de los datos que en ella se generan o se encuentran. Dentro de la moderna teoría de redes, un concepto fundamental y muy estudiado en la bibliografía en las últimas décadas es el de la centralidad de la red. La centralidad consiste en determinar cuantitativamente la importancia de cada nodo dentro de la red, dependiendo del criterio que se adopte en cuanto a lo que consideramos por “importante”. Existen unas medidas clásicas de centralidad en redes complejas, como son la centralidad de grado, de cercanía, de intermediación y basadas en el vector propio. Todas estas medidas solo tienen en cuenta la topología de la red para determinar un valor y una clasificación de los nodos en orden de importancia. Cuando aplicamos estas centralidades a las redes urbanas nos encontramos con el problema de la densidad de grado uniforme que tienen estas redes, lo que hace que no sean adecuadas para la realidad que representan las ciudades. En esta memoria, se han implementado un conjunto de medidas de centralidad para redes urbanas, con la principal característica que tienen en cuenta no solo la topología de la red sino la influencia de la cuantía de los datos presentes en la misma. De esta forma, cuando estudiamos la centralidad de una red urbana, tenemos en cuenta de forma determinante qué datos analizamos y su influencia en la red. Más concretamente, se han implementado tres medidas de centralidad basadas en el concepto de PageRank, introducido por Page y Brin en el conocido buscador Google, que clasifican los nodos de una red urbana en orden de importancia, tanto atendiendo a su conectividad como a los datos asociados a cada nodo. Se ha implementado una medida de centralidad basada en la clásica medida current-flow
betweenness, un tipo concreto de medida de intermediación que estudia la distribución de flujos por una red. Por último, se ha implementado una medida de centralidad para redes urbanas basad en el concepto de centralidad basada en el vector propio, donde la idea básica es que un nodo es importante si sus conexiones o vecinos son importantes. Al final de la memoria se establece una pequeña comparativa entre las medidas basadas en el vector PageRank y vector propio, ya que todas se basan en el cálculo de un…
Advisors/Committee Members: Tortosa, Leandro (advisor), Vicent, Jose F (advisor).
Subjects/Keywords: Redes complejas;
Redes urbanas;
Centralidad;
PageRank;
Betweenness;
Centralidad de vector propio;
Grafo primario
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Agryzkov, T. (2018). Medidas de centralidad en redes urbanas con datos
. (Thesis). University of Alicante. Retrieved from http://hdl.handle.net/10045/80730
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Agryzkov, Taras. “Medidas de centralidad en redes urbanas con datos
.” 2018. Thesis, University of Alicante. Accessed January 22, 2021.
http://hdl.handle.net/10045/80730.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Agryzkov, Taras. “Medidas de centralidad en redes urbanas con datos
.” 2018. Web. 22 Jan 2021.
Vancouver:
Agryzkov T. Medidas de centralidad en redes urbanas con datos
. [Internet] [Thesis]. University of Alicante; 2018. [cited 2021 Jan 22].
Available from: http://hdl.handle.net/10045/80730.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Agryzkov T. Medidas de centralidad en redes urbanas con datos
. [Thesis]. University of Alicante; 2018. Available from: http://hdl.handle.net/10045/80730
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
24.
Ermagun, Alireza.
Network Econometrics and Traffic Flow Analysis.
Degree: PhD, Civil Engineering, 2016, University of Minnesota
URL: http://hdl.handle.net/11299/183378
► This dissertation introduces concepts, theories, and methods dealing with network econometrics to gain a deeper understanding of how the components interact in a complex network.…
(more)
▼ This dissertation introduces concepts, theories, and methods dealing with network econometrics to gain a deeper understanding of how the components interact in a complex network. More precisely, it introduces distinctive network weight matrices to extract the existing spatial dependency between traffic links. The network weight matrices stem from the concepts of betweenness centrality and vulnerability in network science. Their elements are a function not simply of proximity, but of network topology, network structure, and demand configuration. The network weight matrices are tested in congested and uncongested traffic conditions in both simulation-based and real-world environments. The results of the analysis lead to a conclusion that traditional spatial weight matrices are unable to capture the realistic spatial dependency between traffic links in a network. Not only do they overlook the competitive nature of traffic links, but they also ignore the role of network topology and demand configuration in measuring the spatial dependence between traffic links. However, the proposed network weight matrices substitute for traditional spatial weight matrices and exhibit the capability to overcome these deficiencies. The network weight matrices are theoretically defensible in account of acknowledging traffic theory. They capture the competitive and complementary nature of links and embed additional network dynamics such as cost of links and demand configuration. Building on real-world data analysis, the results contribute to the conclusion that in a network comprising links in parallel and series, both negative and positive correlations show up between links. The strength of the correlation varies by time-of-day and day-of-week. Strong negative correlations are observed in rush hours, when congestion affects travel behavior. This correlation occurs mostly in parallel links, and in far upstream links where travelers receive information about congestion (for instance from media, variable message signs, or personal observations of propagating shockwaves) and are able to switch to substitute paths. Irrespective of time-of-day and day-of-week, a strong positive correlation is observed between upstream and downstream sections. This correlation is stronger in uncongested regimes, as traffic flow passes through the consecutive links in a shorter time and there is no congestion effect to shift or stall traffic.
Subjects/Keywords: Betweenness centrality; Data detrending; Network weight matrix; Spatial weight matrix; Traffic flow; Vulnerability
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ermagun, A. (2016). Network Econometrics and Traffic Flow Analysis. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/183378
Chicago Manual of Style (16th Edition):
Ermagun, Alireza. “Network Econometrics and Traffic Flow Analysis.” 2016. Doctoral Dissertation, University of Minnesota. Accessed January 22, 2021.
http://hdl.handle.net/11299/183378.
MLA Handbook (7th Edition):
Ermagun, Alireza. “Network Econometrics and Traffic Flow Analysis.” 2016. Web. 22 Jan 2021.
Vancouver:
Ermagun A. Network Econometrics and Traffic Flow Analysis. [Internet] [Doctoral dissertation]. University of Minnesota; 2016. [cited 2021 Jan 22].
Available from: http://hdl.handle.net/11299/183378.
Council of Science Editors:
Ermagun A. Network Econometrics and Traffic Flow Analysis. [Doctoral Dissertation]. University of Minnesota; 2016. Available from: http://hdl.handle.net/11299/183378
25.
Privat, Alexandre.
Le témoin précaire et l'événement dans les romans d'Adam Thorpe : The precarious witness and the event in Adam Thorpe's novels.
Degree: Docteur es, Études du monde anglophone, 2019, Université Paul Valéry – Montpellier III
URL: http://www.theses.fr/2019MON30017
► L'oeuvre romanesque de l'écrivain britannique Adam Thorpe est fracturée aussi bien que structurée par la notion d'écart entre le témoin et ce que nous appelons…
(more)
▼ L'oeuvre romanesque de l'écrivain britannique Adam Thorpe est fracturée aussi bien que structurée par la notion d'écart entre le témoin et ce que nous appelons les 'pré-Histoire(s)'. Ce travail, prenant appui sur la notion d'écart, étudie la dialectique entre fracture et suture, en montrant son extension à la narrativité, la subjectivité et l'historicité. Face à une oeuvre qui n'a de cesse d'interroger la question de la limite dans un effort constant de faire dialoguer la disjonction avec la conjonction, la déliaison avec la reliaison, notamment entre les bribes et les lacunes de la petite et de la grande Histoire, le but de cette thèse est d'introduire la figure du témoin, entendu ici dans un sens littéraire, philosophique et anthropologique afin de mettre en lumière la précarité de la relationnalité.
British writer Adam Thorpe's fiction is fractured as well as structured by the notion of gap between the subject and what we decided to call the 'pre-Histories'. This work, relying on the notion of interval, examines the dialectics between fracture and suture, showing its extension to narrativity, subjectivity and historicity. Faced with a work that keeps interrogating the question of the limit in a ceaseless effort to combine disjunction with conjonction, disconnection with reconnection, especially between the fragments and silences of the small and big history, the purpose of this thesis is to introduce the figure of the witness, understood here in a literary, philosophical and anthropological sense in order to shed light on the precariousness of relationality.
Advisors/Committee Members: Ganteau, Jean-Michel (thesis director).
Subjects/Keywords: Relation; Evénement; Témoin; Ecart; Précaire; Entre; Relation; Event; Witness; Gap; Precarious; Betweenness
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Privat, A. (2019). Le témoin précaire et l'événement dans les romans d'Adam Thorpe : The precarious witness and the event in Adam Thorpe's novels. (Doctoral Dissertation). Université Paul Valéry – Montpellier III. Retrieved from http://www.theses.fr/2019MON30017
Chicago Manual of Style (16th Edition):
Privat, Alexandre. “Le témoin précaire et l'événement dans les romans d'Adam Thorpe : The precarious witness and the event in Adam Thorpe's novels.” 2019. Doctoral Dissertation, Université Paul Valéry – Montpellier III. Accessed January 22, 2021.
http://www.theses.fr/2019MON30017.
MLA Handbook (7th Edition):
Privat, Alexandre. “Le témoin précaire et l'événement dans les romans d'Adam Thorpe : The precarious witness and the event in Adam Thorpe's novels.” 2019. Web. 22 Jan 2021.
Vancouver:
Privat A. Le témoin précaire et l'événement dans les romans d'Adam Thorpe : The precarious witness and the event in Adam Thorpe's novels. [Internet] [Doctoral dissertation]. Université Paul Valéry – Montpellier III; 2019. [cited 2021 Jan 22].
Available from: http://www.theses.fr/2019MON30017.
Council of Science Editors:
Privat A. Le témoin précaire et l'événement dans les romans d'Adam Thorpe : The precarious witness and the event in Adam Thorpe's novels. [Doctoral Dissertation]. Université Paul Valéry – Montpellier III; 2019. Available from: http://www.theses.fr/2019MON30017
University of Melbourne
26.
Santosa, Sigit.
Indoor centrality.
Degree: 2009, University of Melbourne
URL: http://hdl.handle.net/11343/35138
► Indoor environments are different from other environments. There are some characteristics which are unique such as dimensionality and spatial structure. Apart from indoor centrality, research…
(more)
▼ Indoor environments are different from other environments. There are some characteristics which are unique such as dimensionality and spatial structure. Apart from indoor centrality, research has been done to reveal the properties of centrality particularly in street networks, social networks, and biological networks. In addition, there are some indoor representations which have already been developed for different purposes such as wayfinding, behavioural science, and sociology.Therefore, this research is undertaken to investigate models of representation and apply the measures of centrality to reveal the properties of indoor environments.
Different representations and betweenness centrality measures have been tested in a subset of indoor environments. The models and measures have been proven capable of revealing the properties of indoor environments such as centrality, prominency, and complexity. In addition, this research has revealed the strengths and weaknesses of both models and measures.
The results of different measurements of betweenness centrality based on different representations are combined. Here, graph representations which depict space and link centralities in topological graphs is used to construct a structural hierarchy which is able to support wayfinding in indoor environments.
This research contributes to our understanding of indoor centrality through the formalization of the representations and measures.
Subjects/Keywords: indoor representation; betweenness centrality; indoor hierarchy
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Santosa, S. (2009). Indoor centrality. (Masters Thesis). University of Melbourne. Retrieved from http://hdl.handle.net/11343/35138
Chicago Manual of Style (16th Edition):
Santosa, Sigit. “Indoor centrality.” 2009. Masters Thesis, University of Melbourne. Accessed January 22, 2021.
http://hdl.handle.net/11343/35138.
MLA Handbook (7th Edition):
Santosa, Sigit. “Indoor centrality.” 2009. Web. 22 Jan 2021.
Vancouver:
Santosa S. Indoor centrality. [Internet] [Masters thesis]. University of Melbourne; 2009. [cited 2021 Jan 22].
Available from: http://hdl.handle.net/11343/35138.
Council of Science Editors:
Santosa S. Indoor centrality. [Masters Thesis]. University of Melbourne; 2009. Available from: http://hdl.handle.net/11343/35138
RMIT University
27.
Magalingam, P.
Complex network tools to enable identification of a criminal community.
Degree: 2015, RMIT University
URL: http://researchbank.rmit.edu.au/view/rmit:161407
► Retrieving criminal ties and mining evidence from an organised crime incident, for example money laundering, has been a difficult task for crime investigators due to…
(more)
▼ Retrieving criminal ties and mining evidence from an organised crime incident, for example money laundering, has been a difficult task for crime investigators due to the involvement of different groups of people and their complex relationships. Extracting the criminal association from enormous amount of raw data and representing them explicitly is tedious and time consuming. A study of the complex networks literature reveals that graph-based detection methods have not, as yet, been used for money laundering detection. In this research, I explore the use of complex network analysis to identify the money laundering criminals’ communication associations, that is, the important people who communicate between known criminals and the reliance of the known criminals on the other individuals in a communication path. For this purpose, I use the publicly available Enron email database that happens to contain the communications of 10 criminals who were convicted of a money laundering crime. I show that my new shortest paths network search algorithm (SPNSA) combining shortest paths and network centrality measures is better able to isolate and identify criminals’ connections when compared with existing community detection algorithms and k-neighbourhood detection. The SPNSA is validated using three different investigative scenarios and in each scenario, the criminal network graphs formed are small and sparse hence suitable for further investigation. My research starts with isolating emails with ‘BCC’ recipients with a minimum of two recipients bcc-ed. ‘BCC’ recipients are inherently secretive and the email connections imply a trust relationship between sender and ‘BCC’ recipients. There are no studies on the usage of only those emails that have ‘BCC’ recipients to form a trust network, which leads me to analyse the ‘BCC’ email group separately. SPNSA is able to identify the group of criminals and their active intermediaries in this ‘BCC’ trust network. Corroborating this information with published information about the crimes that led to the collapse of Enron yields the discovery of persons of interest that were hidden between criminals, and could have contributed to the money laundering activity. For validation, larger email datasets that comprise of all ‘BCC’ and ‘TO/CC’ email transactions are used. On comparison with existing community detection algorithms, SPNSA is found to perform much better with regards to isolating the sub-networks that contain criminals. I have adapted the betweenness centrality measure to develop a reliance measure. This measure calculates the reliance of a criminal on an intermediate node and ranks the importance level of each intermediate node based on this reliability value. Both SPNSA and the reliance measure could be used as primary investigation tools to investigate connections between criminals in a complex network.
Subjects/Keywords: Fields of Research; Criminal network; Trust; Shortest path; Leave-one-out; Suspect; Investigation; Betweenness; Intermediate node; Reliance
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Magalingam, P. (2015). Complex network tools to enable identification of a criminal community. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:161407
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Magalingam, P. “Complex network tools to enable identification of a criminal community.” 2015. Thesis, RMIT University. Accessed January 22, 2021.
http://researchbank.rmit.edu.au/view/rmit:161407.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Magalingam, P. “Complex network tools to enable identification of a criminal community.” 2015. Web. 22 Jan 2021.
Vancouver:
Magalingam P. Complex network tools to enable identification of a criminal community. [Internet] [Thesis]. RMIT University; 2015. [cited 2021 Jan 22].
Available from: http://researchbank.rmit.edu.au/view/rmit:161407.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Magalingam P. Complex network tools to enable identification of a criminal community. [Thesis]. RMIT University; 2015. Available from: http://researchbank.rmit.edu.au/view/rmit:161407
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
28.
Raynal, Benjamin.
Applications of digital topology for real-time markerless motion capture : Applications de la topologie discrète pour la captation de mouvement temps réel et sans marqueurs.
Degree: Docteur es, Informatique, 2010, Université Paris-Est
URL: http://www.theses.fr/2010PEST1038
► Durant cette thèse, nous nous sommes intéressés à la problématique de la captation de mouvement sans marqueurs. Une approche classique est basée sur l'utilisation d'un…
(more)
▼ Durant cette thèse, nous nous sommes intéressés à la problématique de la captation de mouvement sans marqueurs. Une approche classique est basée sur l'utilisation d'un modèle prédéfini du sujet, et est divisée en deux phases : celle d'initialisation, où la pose initiale du sujet est estimée, et celle de suivi, où la pose actuelle du sujet est estimée à partir des précédentes. Souvent, la phase d'initialisation est faite manuellement, rendant impossible l'utilisation en direct, ou nécessite des actions spécifiques du sujet. Nous proposons une phase d'initialisation automatique et temps-réel, utilisant l'information topologique extraite par squelettisation d'une reconstruction 3D du sujet. Cette information est représentée sous forme d'arbre (arbre de données), qui est mis en correspondance avec un arbre utilisé comme modèle, afin d'identifier les différentes parties du sujet. Pour obtenir une telle méthode, nous apportons des contributions dans les domaines de la topologie discrète et de la théorie des graphes. Comme notre méthode requiert le temps réel, nous nous intéressons d'abord à l'optimisation du temps de calcul des méthodes de squelettisation, ainsi qu'à l'élaboration de nouveaux algorithmes rapides fournissant de bons résultats. Nous nous intéressons ensuite à la définition d'une mise en correspondance efficace entre l'arbre de données et celui décrivant le modèle. Enfin, nous améliorons la robustesse de notre méthode en ajoutant des contraintes novatrices au modèle. Nous terminons par l'application de notre méthode sur différents jeux de données, démontrantses propriétés : rapidité robustesse et adaptabilité à différents types de sujet
This manuscript deals with the problem of markerless motion capture. An approach to thisproblem is model-based and is divided into two steps : an initialization step in which the initialpose is estimated, and a tracking which computes the current pose of the subject using infor-mation of previous ones. Classically, the initialization step is done manually, for bidding the possibility to be used online, or requires constraining actions of the subject. We propose an automatic real-time markerless initialization step, that relies on topological information provided by skeletonization of a 3D reconstruction of the subject. This topological information is then represented as a tree, which is matched with another tree used as modeldescription, in order to identify the different parts of the subject. In order to provide such a method, we propose some contributions in both digital topology and graph theory researchfields. As our method requires real-time computation, we first focus on the speed optimization of skeletonization methods, and on the design of new fast skeletonization schemes providing good results. In order to efficiently match the tree representing the topological information with the tree describing the model, we propose new matching definitions and associated algorithms. Finally, we study how to improve the robustness of our method by the use of innovative…
Advisors/Committee Members: Couprie, Michel (thesis director).
Subjects/Keywords: Captation de mouvements; Topologie discrète; Squelettisation; Alignement; Homéomorphisme; Interposition; Motion capture; Digital topology; Thinning; Alignment; Homeomorphism; Betweenness
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Raynal, B. (2010). Applications of digital topology for real-time markerless motion capture : Applications de la topologie discrète pour la captation de mouvement temps réel et sans marqueurs. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2010PEST1038
Chicago Manual of Style (16th Edition):
Raynal, Benjamin. “Applications of digital topology for real-time markerless motion capture : Applications de la topologie discrète pour la captation de mouvement temps réel et sans marqueurs.” 2010. Doctoral Dissertation, Université Paris-Est. Accessed January 22, 2021.
http://www.theses.fr/2010PEST1038.
MLA Handbook (7th Edition):
Raynal, Benjamin. “Applications of digital topology for real-time markerless motion capture : Applications de la topologie discrète pour la captation de mouvement temps réel et sans marqueurs.” 2010. Web. 22 Jan 2021.
Vancouver:
Raynal B. Applications of digital topology for real-time markerless motion capture : Applications de la topologie discrète pour la captation de mouvement temps réel et sans marqueurs. [Internet] [Doctoral dissertation]. Université Paris-Est; 2010. [cited 2021 Jan 22].
Available from: http://www.theses.fr/2010PEST1038.
Council of Science Editors:
Raynal B. Applications of digital topology for real-time markerless motion capture : Applications de la topologie discrète pour la captation de mouvement temps réel et sans marqueurs. [Doctoral Dissertation]. Université Paris-Est; 2010. Available from: http://www.theses.fr/2010PEST1038
29.
Kushwaha, Rahul.
Large Knowledge Bases and Networks: Results on Analogies and Betweenness Centrality.
Degree: 2014, University of Illinois – Chicago
URL: http://hdl.handle.net/10027/19033
► Betweenness Centrality and Analogy Solver are the main themes of this Thesis Report. In the rst part we study betweenness centrality on general trees with…
(more)
▼ Betweenness Centrality and Analogy Solver are the main themes of this Thesis Report. In
the rst part we study
betweenness centrality on general trees with some results regarding the
relation between k-
betweenness centrality and
betweenness centrality. We also study complete
binary trees to derive some new formulas with regards to number of shortest paths through a
vertex. In the second part we provide an approach which tries to solve analogies using ConceptNet 4.0. A detailed analysis of few examples and results on the data set is also provided.
Advisors/Committee Members: Turan, Gyorgy (advisor), Sloan, Robert (advisor), Sloan, Robert (committee member), DasGupta, Bhaskar (committee member).
Subjects/Keywords: Large Networks; ConceptNet; Betweenness Centrality; Analogy Solver
…report is
betweenness centrality and its variant. We discuss both form theoretical and… …betweenness centrality in
complete binary trees. We also discuss some of the general properties of… …the complete binary
trees that can help us explore more about betweenness centrality… …Betweenness centrality in
case of general tree is also is also discussed. A special section… …pertaining to k-betweenness
centrality is also presented where we study the study the basic…
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Kushwaha, R. (2014). Large Knowledge Bases and Networks: Results on Analogies and Betweenness Centrality. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/19033
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Kushwaha, Rahul. “Large Knowledge Bases and Networks: Results on Analogies and Betweenness Centrality.” 2014. Thesis, University of Illinois – Chicago. Accessed January 22, 2021.
http://hdl.handle.net/10027/19033.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Kushwaha, Rahul. “Large Knowledge Bases and Networks: Results on Analogies and Betweenness Centrality.” 2014. Web. 22 Jan 2021.
Vancouver:
Kushwaha R. Large Knowledge Bases and Networks: Results on Analogies and Betweenness Centrality. [Internet] [Thesis]. University of Illinois – Chicago; 2014. [cited 2021 Jan 22].
Available from: http://hdl.handle.net/10027/19033.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Kushwaha R. Large Knowledge Bases and Networks: Results on Analogies and Betweenness Centrality. [Thesis]. University of Illinois – Chicago; 2014. Available from: http://hdl.handle.net/10027/19033
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
AUT University
30.
Guo, Su.
Between the Lines: an Experience Design Focuses on Language
.
Degree: AUT University
URL: http://hdl.handle.net/10292/11877
► ‘The reality of language dominates daily human awareness and communication, but we are not usually aware of the fact that even language is grounded in…
(more)
▼ ‘The reality of language dominates daily human awareness and communication, but we are not usually aware of the fact that even language is grounded in embodied metaphors, images and neural representations.’ (Pallasmaa, 2011, p10)
My experimentation focuses on a Chinese pop song, and the creativity offered by the lyrics, and the feelings which appear when I am attached to a particular song. Through experiments with atmosphere, light, materials, metaphors and spatial experience, I explore not only the space between the lines evoked by the lyrics but also the moment of in-
betweenness created by a metaphorical interpretation of different languages. The project responds to an idea of experiencing a threshold, such as that which exists in an underground abandoned toilet located in Auckland city, where people can come to experience the metaphors behind one language and the complex spaces created by emotional lyrics.
Language is the key to passing on information; language is a threshold that can bring one closer to another space. It creates images in our mind. I always wonder how certain words or sentences can have a sudden, deep, impact on our mind, the language not only bringing us to another space, but also creating a vivid spatial experience in the air. Metaphors and images within languages create a space of atmosphere. This leads to deeper thoughts about imagination and the meaning evoked by the lyrics.
This thesis is a question-based design research project. ‘Heuristic inquiry’ and ‘autoethnography’ are my key methodological approaches. The project is realised by ideas drawn from multiple influences. The practice work has been carried out through several iterative stages: from a conceptual understanding of the lyrics, to deeper research on thresholds, and conceptual and physical tests on atmosphere, realised as a physical installation within the abandoned public toilet.
Advisors/Committee Members: Palmer, Fleur (advisor).
Subjects/Keywords: Metaphorial;
Threshold;
Atmosphere;
In-betweenness;
Poetic;
Instability
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Guo, S. (n.d.). Between the Lines: an Experience Design Focuses on Language
. (Thesis). AUT University. Retrieved from http://hdl.handle.net/10292/11877
Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Guo, Su. “Between the Lines: an Experience Design Focuses on Language
.” Thesis, AUT University. Accessed January 22, 2021.
http://hdl.handle.net/10292/11877.
Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Guo, Su. “Between the Lines: an Experience Design Focuses on Language
.” Web. 22 Jan 2021.
Note: this citation may be lacking information needed for this citation format:
No year of publication.
Vancouver:
Guo S. Between the Lines: an Experience Design Focuses on Language
. [Internet] [Thesis]. AUT University; [cited 2021 Jan 22].
Available from: http://hdl.handle.net/10292/11877.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.
Council of Science Editors:
Guo S. Between the Lines: an Experience Design Focuses on Language
. [Thesis]. AUT University; Available from: http://hdl.handle.net/10292/11877
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.
◁ [1] [2] ▶
. 
Open Access Theses and Dissertations
