You searched for subject:( eigenvector)
.
Showing records 1 – 30 of
63 total matches.
◁ [1] [2] [3] ▶

University of Georgia
1.
Lavoie, Michael Rob.
A parallel approach to DICCCOL.
Degree: 2015, University of Georgia
URL: http://hdl.handle.net/10724/30976
► DICCCOL is a process that identifies common connectivity in the brain. It was developed to show that the cortex has a common structure thereby identifying…
(more)
▼ DICCCOL is a process that identifies common connectivity in the brain. It was developed to show that the cortex has a common structure thereby identifying functional correspondence. The tool compares the connectivity in a subject brain
against a reference library of structural correspondence. A set of bundles is processed for comparison against this library. The result is a subject’s fiber bundle that most closely matches the libraries reference bundle. The data set is relatively small
but the processing is extensive. A single thread approach to the process is very time consuming. This task is better suited for a parallel processing approach. I show how the work can be accomplished more efficiently with GPU hardware and CUDA’s parallel
programming, resulting in a speedup factor of better than 6.
Subjects/Keywords: DICCCOL; CUDA; GPGPU; eigenvector; eigenvalue; medical imaging
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):
Lavoie, M. R. (2015). A parallel approach to DICCCOL. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/30976
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):
Lavoie, Michael Rob. “A parallel approach to DICCCOL.” 2015. Thesis, University of Georgia. Accessed April 14, 2021.
http://hdl.handle.net/10724/30976.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Lavoie, Michael Rob. “A parallel approach to DICCCOL.” 2015. Web. 14 Apr 2021.
Vancouver:
Lavoie MR. A parallel approach to DICCCOL. [Internet] [Thesis]. University of Georgia; 2015. [cited 2021 Apr 14].
Available from: http://hdl.handle.net/10724/30976.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Lavoie MR. A parallel approach to DICCCOL. [Thesis]. University of Georgia; 2015. Available from: http://hdl.handle.net/10724/30976
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

NSYSU
2.
Chang, Hui-wen.
Applications of Mathematica 9.0 in Linear Algebra.
Degree: Master, Applied Mathematics, 2014, NSYSU
URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0624114-010245
► This paper investigates the applications of Mathematica 9.0 in linear algebra education. It can be used to solve the complicated or tedious linear algebra problems…
(more)
▼ This paper investigates the applications of Mathematica 9.0 in linear algebra
education. It can be used to solve the complicated or tedious linear algebra
problems by simple commands. First we describe the detailed matrix-related
built-in commands, such as: operations on vectors, constructing matrices,
parts of matrices, matrix operations, linear systems, matrix decompositions
and matrix tests. Then introduced in different areas of application, such as:
linear programming, difference equations and least squares methods. It will
facilitate the lecturer for teaching linear algebra and enhance the effective
learning of linear algebra for students.
Advisors/Committee Members: Chung-Yuan Dye (chair), Mei-Hui Guo (chair), Chung Chang (chair), Fu-Chuen Chang (committee member), Mong-Na Lo (chair).
Subjects/Keywords: difference equations; matrix; matrix decomposition; linear systems; eigenvalue; eigenvector; Mathematica 9.0
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):
Chang, H. (2014). Applications of Mathematica 9.0 in Linear Algebra. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0624114-010245
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):
Chang, Hui-wen. “Applications of Mathematica 9.0 in Linear Algebra.” 2014. Thesis, NSYSU. Accessed April 14, 2021.
http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0624114-010245.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Chang, Hui-wen. “Applications of Mathematica 9.0 in Linear Algebra.” 2014. Web. 14 Apr 2021.
Vancouver:
Chang H. Applications of Mathematica 9.0 in Linear Algebra. [Internet] [Thesis]. NSYSU; 2014. [cited 2021 Apr 14].
Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0624114-010245.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Chang H. Applications of Mathematica 9.0 in Linear Algebra. [Thesis]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0624114-010245
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

NSYSU
3.
Cheng, Rong-Hang.
Eigenvectors for Certain Action on B(H) Induced by Shift.
Degree: Master, Applied Mathematics, 2011, NSYSU
URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0905111-231911
► Let l2(Bbb Z) be the Hilbert space of square summable double sequences of complex numbers with standard basis {en:ninBbb Z}, and let us consider a…
(more)
▼ Let l
2(Bbb Z) be the Hilbert space of square summable double sequences of complex numbers with standard basis {e
n:ninBbb Z}, and let us consider a bounded matrix A on l
2(Bbb Z)
satisfying the following system of equations
egin{itemize}
item[1.] lan
Ae
2j,e
2i
an=p
ij+alan Ae
j,e
i
an;
item[2.] lan
Ae
2j,e
2i-1
an=q
ij+blan Ae
j,e
i
an;
item[3.] lan
Ae
2j-1,e
2i
an=v
ij+clan Ae
j,e
i
an;
item[4.] lan
Ae
2j-1,e
2i-1
an=w
ij+dlan Ae
j,e
i
an
end{itemize}
for all i,j, where P=(p
ij), Q=(q
ij), V=(v
ij), W=(w
ij) are bounded matrices on l
2(Bbb Z) and a,b,c,dinBbb C. This type dyadic recurrent system arises in the study of bounded operators commuting with the slant Toeplitz operators, i.e., the class of operators {{cal T}
vp:vpin L
infty(Bbb T)} satisfying lan {cal T}
vp e
j,e
i
an=c
2i-j, where c
n is the n-th Fourier coefficient of vp.
It is shown in [10] that the solutions of the above system are closely related to the bounded solution A for the operator equation
[
phi(A)=S^*AS=lambda A+B,
]
where B is fixed, λinBbb C and S the shift given by {cal T}
arzeta+arxi z^* (with ζxi
ot=0 and |zeta|
2+|xi|
2=1). In this paper, we shall characterize the ``eigenvectors" for φ for the eigenvalue λ with
|lambda|leq1, in terms of dyadic recurrent systems similar to the one above.
Advisors/Committee Members: Jen-Chih Yao (chair), Mark C. Ho (committee member), Jyh-shyang Jeang (chair), Chun-Yen Chou (chair).
Subjects/Keywords: operator equation; dyadic recurrent system; slant Toeplitz operator; shift; eigenvector
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):
Cheng, R. (2011). Eigenvectors for Certain Action on B(H) Induced by Shift. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0905111-231911
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):
Cheng, Rong-Hang. “Eigenvectors for Certain Action on B(H) Induced by Shift.” 2011. Thesis, NSYSU. Accessed April 14, 2021.
http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0905111-231911.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Cheng, Rong-Hang. “Eigenvectors for Certain Action on B(H) Induced by Shift.” 2011. Web. 14 Apr 2021.
Vancouver:
Cheng R. Eigenvectors for Certain Action on B(H) Induced by Shift. [Internet] [Thesis]. NSYSU; 2011. [cited 2021 Apr 14].
Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0905111-231911.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Cheng R. Eigenvectors for Certain Action on B(H) Induced by Shift. [Thesis]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0905111-231911
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

NSYSU
4.
Chuang, Yu-Hsiang.
Applications of Dynamic Interactivity of Mathematica 9.0 in Linear Algebra.
Degree: Master, Applied Mathematics, 2015, NSYSU
URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0630115-141426
► Mathematica just need short code to fullfill complex animation. It is easy for industry experts or students, or even anyone to create their own complex…
(more)
▼ Mathematica just need short code to fullfill complex animation. It is easy for
industry experts or students, or even anyone to create their own complex small operation
program, and published shared. Some demonstrations can be used to enrich
course or visualizing complex concepts. This paper investigates the applications of
Mathematica 9.0 in dynamic linear algebra education. It can be used to solve and
verify the complicated problems in linear algebra theory; to display dynamic graphs
of linear algebra by interactive manipulation. It will facilitate the lecturer for teaching
linear algebra and enhance the effective learning of linear algebra for students.
Advisors/Committee Members: Chung-Yuan Dye (chair), Chung Chang (chair), Mong-Na Lo Huang (chair), Fu-Chuen Chang (committee member), Mei-Hui Guo (chair).
Subjects/Keywords: matrix; linear algebra; Mathematica 9.0; eigenvector; dynamic functionality
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):
Chuang, Y. (2015). Applications of Dynamic Interactivity of Mathematica 9.0 in Linear Algebra. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0630115-141426
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):
Chuang, Yu-Hsiang. “Applications of Dynamic Interactivity of Mathematica 9.0 in Linear Algebra.” 2015. Thesis, NSYSU. Accessed April 14, 2021.
http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0630115-141426.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Chuang, Yu-Hsiang. “Applications of Dynamic Interactivity of Mathematica 9.0 in Linear Algebra.” 2015. Web. 14 Apr 2021.
Vancouver:
Chuang Y. Applications of Dynamic Interactivity of Mathematica 9.0 in Linear Algebra. [Internet] [Thesis]. NSYSU; 2015. [cited 2021 Apr 14].
Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0630115-141426.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Chuang Y. Applications of Dynamic Interactivity of Mathematica 9.0 in Linear Algebra. [Thesis]. NSYSU; 2015. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0630115-141426
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Georgia Tech
5.
Parihar, Abhinav.
Utilizing switched linear dynamics of interconnected state transition devices for approximating certain global functions.
Degree: PhD, Electrical and Computer Engineering, 2019, Georgia Tech
URL: http://hdl.handle.net/1853/62725
► The objective of the proposed research is to create alternative computing models and architectures, unlike (discrete) sequential Turing machine/Von Neumann style models, which utilize the…
(more)
▼ The objective of the proposed research is to create alternative computing models and architectures, unlike (discrete) sequential Turing machine/Von Neumann style models, which utilize the network dynamics of interconnected IMT (insulator-metal transition) devices. This work focusses on circuits (mainly coupled oscillators) and the resulting switched linear dynamical systems that arise in networks of IMT devices. Electrical characteristics of the devices and their stochasticity are modeled mathematically and used to explain experimentally observed behavior. For certain kinds of connectivity patterns, the steady state limit cycles of these systems encode approximate solutions to global functions like dominant
eigenvector of the connectivity matrix and graph coloring of the connectivity graph.
Advisors/Committee Members: Raychowdhury, Arijit (advisor), Romberg, Justin (committee member), Mukhopadhyay, Saibal (committee member), Egerstedt, Magnus (committee member), Datta, Suman (committee member).
Subjects/Keywords: Coupled oscillators; Switched linear dynamics; Eigenvector; Graph coloring
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):
Parihar, A. (2019). Utilizing switched linear dynamics of interconnected state transition devices for approximating certain global functions. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/62725
Chicago Manual of Style (16th Edition):
Parihar, Abhinav. “Utilizing switched linear dynamics of interconnected state transition devices for approximating certain global functions.” 2019. Doctoral Dissertation, Georgia Tech. Accessed April 14, 2021.
http://hdl.handle.net/1853/62725.
MLA Handbook (7th Edition):
Parihar, Abhinav. “Utilizing switched linear dynamics of interconnected state transition devices for approximating certain global functions.” 2019. Web. 14 Apr 2021.
Vancouver:
Parihar A. Utilizing switched linear dynamics of interconnected state transition devices for approximating certain global functions. [Internet] [Doctoral dissertation]. Georgia Tech; 2019. [cited 2021 Apr 14].
Available from: http://hdl.handle.net/1853/62725.
Council of Science Editors:
Parihar A. Utilizing switched linear dynamics of interconnected state transition devices for approximating certain global functions. [Doctoral Dissertation]. Georgia Tech; 2019. Available from: http://hdl.handle.net/1853/62725

Harvard University
6.
Huang, Jiaoyang.
Spectral Statistics of Random d-Regular Graphs.
Degree: PhD, 2019, Harvard University
URL: http://nrs.harvard.edu/urn-3:HUL.InstRepos:42029716
► In this thesis we study the uniform random d-regular graphs on N vertices from a random matrix theory point of view. In the first part…
(more)
▼ In this thesis we study the uniform random d-regular graphs on N vertices from a random matrix theory point of view.
In the first part of this thesis, we focus on uniform random d-regular graphs with large but fixed degree. In the bulk of the spectrum down to the optimal spectral scale, we prove that the Green's functions can be approximated by those of certain infinite tree-like (few cycles) graphs that depend only on the local structure of the original graphs. This result implies that the Kesten – McKay law holds for the empirical eigenvalue density down to the smallest scale and the bulk eigenvectors are completely delocalized. Our method is based on estimating the Green's function of the adjacency matrices and a resampling of the boundary edges of large balls in the graphs.
In the second part of this thesis, we prove, for 1\ll d\ll N2/3, in the bulk of the spectrum the local eigenvalue correlation functions and the distribution of the gaps between consecutive eigenvalues coincide with those of the Gaussian orthogonal ensemble. In order to show this, we interpolate between the adjacent matrices of random d-regular graphs and the Gaussian orthogonal ensemble using a constrained version of Dyson Brownian motion.
Mathematics
Advisors/Committee Members: Yau, Horng-Tzer (advisor), Nelson, Jelani (committee member), Guionnet, Alice (committee member).
Subjects/Keywords: sparse random graphs; random matrices; eigenvalue statistics; eigenvector statistics.
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, J. (2019). Spectral Statistics of Random d-Regular Graphs. (Doctoral Dissertation). Harvard University. Retrieved from http://nrs.harvard.edu/urn-3:HUL.InstRepos:42029716
Chicago Manual of Style (16th Edition):
Huang, Jiaoyang. “Spectral Statistics of Random d-Regular Graphs.” 2019. Doctoral Dissertation, Harvard University. Accessed April 14, 2021.
http://nrs.harvard.edu/urn-3:HUL.InstRepos:42029716.
MLA Handbook (7th Edition):
Huang, Jiaoyang. “Spectral Statistics of Random d-Regular Graphs.” 2019. Web. 14 Apr 2021.
Vancouver:
Huang J. Spectral Statistics of Random d-Regular Graphs. [Internet] [Doctoral dissertation]. Harvard University; 2019. [cited 2021 Apr 14].
Available from: http://nrs.harvard.edu/urn-3:HUL.InstRepos:42029716.
Council of Science Editors:
Huang J. Spectral Statistics of Random d-Regular Graphs. [Doctoral Dissertation]. Harvard University; 2019. Available from: http://nrs.harvard.edu/urn-3:HUL.InstRepos:42029716

Brigham Young University
7.
Hansen, Brian Francis.
A Lift of Cohomology Eigenclasses of Hecke Operators.
Degree: PhD, 2010, Brigham Young University
URL: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=3168&context=etd
► A considerable amount of evidence has shown that for every prime p &neq; N observed, a simultaneous eigenvector v0 of Hecke operators T(l,i), i=1,2,…
(more)
▼ A considerable amount of evidence has shown that for every prime p &neq; N observed, a simultaneous eigenvector v0 of Hecke operators T(l,i), i=1,2, in H3(Γ0(N),F(0,0,0)) has a “lift” v in H3(Γ0(N),F(p−1,0,0)) — i.e., a simultaneous eigenvector v of Hecke operators having the same system of eigenvalues that v0 has. For each prime p>3 and N=11 and 17, we construct a vector v that is in the cohomology group H3(Γ0(N),F(p−1,0,0)). This is the first construction of an element of infinitely many different cohomology groups, other than modulo p reductions of characteristic zero objects. We proceed to show that v is an eigenvector of the Hecke operators T(2,1) and T(2,2) for p>3. Furthermore, we demonstrate that in many cases, v is a simultaneous eigenvector of all the Hecke operators.
Subjects/Keywords: Serre's Conjecture; Hecke operator; cohomology group; lift; eigenvector; Mathematics
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):
Hansen, B. F. (2010). A Lift of Cohomology Eigenclasses of Hecke Operators. (Doctoral Dissertation). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=3168&context=etd
Chicago Manual of Style (16th Edition):
Hansen, Brian Francis. “A Lift of Cohomology Eigenclasses of Hecke Operators.” 2010. Doctoral Dissertation, Brigham Young University. Accessed April 14, 2021.
https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=3168&context=etd.
MLA Handbook (7th Edition):
Hansen, Brian Francis. “A Lift of Cohomology Eigenclasses of Hecke Operators.” 2010. Web. 14 Apr 2021.
Vancouver:
Hansen BF. A Lift of Cohomology Eigenclasses of Hecke Operators. [Internet] [Doctoral dissertation]. Brigham Young University; 2010. [cited 2021 Apr 14].
Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=3168&context=etd.
Council of Science Editors:
Hansen BF. A Lift of Cohomology Eigenclasses of Hecke Operators. [Doctoral Dissertation]. Brigham Young University; 2010. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=3168&context=etd

Arizona State University
8.
Chang, Alena.
Poincare Embeddings for Visualizing Eigenvector
Centrality.
Degree: Computer Science, 2020, Arizona State University
URL: http://repository.asu.edu/items/62689
► Hyperbolic geometry, which is a geometry which concerns itself with hyperbolic space, has caught the eye of certain circles in the machine learning community as…
(more)
▼ Hyperbolic geometry, which is a geometry which
concerns itself with hyperbolic space, has caught the eye of
certain circles in the machine learning community as of late.
Lauded for its ability to encapsulate strong clustering as well as
latent hierarchies in complex and social networks, hyperbolic
geometry has proven itself to be an enduring presence in the
network science community throughout the 2010s, with no signs of
fading into obscurity anytime soon. Hyperbolic embeddings, which
map a given graph to hyperbolic space, have particularly proven to
be a powerful and dynamic tool for studying complex networks.
Hyperbolic embeddings are exploited in this thesis to illustrate
centrality in a graph. In network science, centrality quantifies
the influence of individual nodes in a graph. Eigenvector
centrality is one type of such measure, and assigns an influence
weight to each node in a graph by solving for an eigenvector
equation. A procedure is defined to embed a given network in a
model of hyperbolic space, known as the Poincare disk, according to
the influence weights computed by three eigenvector centrality
measures: the PageRank algorithm, the Hyperlink-Induced Topic
Search (HITS) algorithm, and the Pinski-Narin algorithm. The
resulting embeddings are shown to accurately and meaningfully
reflect each node's influence and proximity to influential
nodes.
Subjects/Keywords: Computer science; centrality; complex network; eigenvector; greedy; hyperbolic embedding; hyperbolic geometry
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):
Chang, A. (2020). Poincare Embeddings for Visualizing Eigenvector
Centrality. (Masters Thesis). Arizona State University. Retrieved from http://repository.asu.edu/items/62689
Chicago Manual of Style (16th Edition):
Chang, Alena. “Poincare Embeddings for Visualizing Eigenvector
Centrality.” 2020. Masters Thesis, Arizona State University. Accessed April 14, 2021.
http://repository.asu.edu/items/62689.
MLA Handbook (7th Edition):
Chang, Alena. “Poincare Embeddings for Visualizing Eigenvector
Centrality.” 2020. Web. 14 Apr 2021.
Vancouver:
Chang A. Poincare Embeddings for Visualizing Eigenvector
Centrality. [Internet] [Masters thesis]. Arizona State University; 2020. [cited 2021 Apr 14].
Available from: http://repository.asu.edu/items/62689.
Council of Science Editors:
Chang A. Poincare Embeddings for Visualizing Eigenvector
Centrality. [Masters Thesis]. Arizona State University; 2020. Available from: http://repository.asu.edu/items/62689

University of Montana
9.
Lehr, Morganne Marie.
MODELING NORTHERN GOSHAWK (ACCIPITER GENTILIS) NESTING HABITAT ON THE LEWIS AND CLARK NATIONAL FOREST USING EIGENVECTOR FILTERS TO ACCOUNT FOR SPATIAL AUTOCORRELATION.
Degree: MS, 2014, University of Montana
URL: https://scholarworks.umt.edu/etd/4355
► Habitat suitability modeling has become a valuable tool for wildlife managers to identify areas of suitable habitats for management and conservation needs. The Northern goshawk…
(more)
▼ Habitat suitability modeling has become a valuable tool for wildlife managers to identify areas of suitable habitats for management and conservation needs. The Northern goshawk (Accipiter gentilis) has been the focus of many modeling efforts, however, the current models guiding goshawk management on the Lewis and Clark National Forest may not fully capture the unique habitat characteristics that the goshawk is actually selecting for nesting habitat. Therefore, the first objective of this study was to explore the use of Maxent for modeling suitable goshawk nesting habitat on the Lewis and Clark National Forest in central Montana. However, goshawk territoriality and their use of alternate nest locations creates, spatial autocorrelation between the nest locations (nest locations that occur close to one another are not independent) and can complicate the development of a habitat suitability model. Spatial autocorrelation can have drastic effects on model prediction and can lead to false conclusions about ecological relationships, but when accounted for can lead to insights that may have been otherwise overlooked. As a result, this study also explored the use of eigenvector filters as additional explanatory variables to assist in “filtering” out the effects of spatial autocorrelation from the modeling effort. Furthermore, this study evaluated the difference in model outputs using different resampling methods (bootstrap and cross-validation) and number of variables to determine the differences between models. The results of the study showed that the use of eigenvector filters not only improved model performance and reduced commission error, but created more precise predictions of suitable habitat. Furthermore, this study also found that using bootstrap methods and all biologically relevant environmental variables (with the additional of eigenvector filters) provided the best overall model. However, wildlife managers should closely review the methods and results provided in this study and choose the model that best suits their available data and management needs.
Subjects/Keywords: Spatial Eigenvector Mapping; Spatial Autocorrelation; Northern Goshawk; Maxent; Habitat Suitability Modeling
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):
Lehr, M. M. (2014). MODELING NORTHERN GOSHAWK (ACCIPITER GENTILIS) NESTING HABITAT ON THE LEWIS AND CLARK NATIONAL FOREST USING EIGENVECTOR FILTERS TO ACCOUNT FOR SPATIAL AUTOCORRELATION. (Masters Thesis). University of Montana. Retrieved from https://scholarworks.umt.edu/etd/4355
Chicago Manual of Style (16th Edition):
Lehr, Morganne Marie. “MODELING NORTHERN GOSHAWK (ACCIPITER GENTILIS) NESTING HABITAT ON THE LEWIS AND CLARK NATIONAL FOREST USING EIGENVECTOR FILTERS TO ACCOUNT FOR SPATIAL AUTOCORRELATION.” 2014. Masters Thesis, University of Montana. Accessed April 14, 2021.
https://scholarworks.umt.edu/etd/4355.
MLA Handbook (7th Edition):
Lehr, Morganne Marie. “MODELING NORTHERN GOSHAWK (ACCIPITER GENTILIS) NESTING HABITAT ON THE LEWIS AND CLARK NATIONAL FOREST USING EIGENVECTOR FILTERS TO ACCOUNT FOR SPATIAL AUTOCORRELATION.” 2014. Web. 14 Apr 2021.
Vancouver:
Lehr MM. MODELING NORTHERN GOSHAWK (ACCIPITER GENTILIS) NESTING HABITAT ON THE LEWIS AND CLARK NATIONAL FOREST USING EIGENVECTOR FILTERS TO ACCOUNT FOR SPATIAL AUTOCORRELATION. [Internet] [Masters thesis]. University of Montana; 2014. [cited 2021 Apr 14].
Available from: https://scholarworks.umt.edu/etd/4355.
Council of Science Editors:
Lehr MM. MODELING NORTHERN GOSHAWK (ACCIPITER GENTILIS) NESTING HABITAT ON THE LEWIS AND CLARK NATIONAL FOREST USING EIGENVECTOR FILTERS TO ACCOUNT FOR SPATIAL AUTOCORRELATION. [Masters Thesis]. University of Montana; 2014. Available from: https://scholarworks.umt.edu/etd/4355

NSYSU
10.
LEE, YU-HAO.
The theory of transformation operators and its application in inverse spectral problems.
Degree: Master, Applied Mathematics, 2005, NSYSU
URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0704105-182611
► The inverse spectral problem is the problem of understanding the potential function of the Sturm-Liouville operator from the set of eigenvalues plus some additional spectral…
(more)
▼ The inverse spectral problem is the problem of
understanding the potential function of the Sturm-Liouville
operator from the set of eigenvalues plus some additional
spectral data. The theory of transformation operators, first
introduced by Marchenko, and then reinforced by Gelfand and
Levitan, is a powerful method to deal with the different stages
of the inverse spectral problem: uniqueness, reconstruction,
stability and existence. In this thesis, we shall give a survey
on the theory of transformation operators. In essence, the theory
says that the transformation operator X mapping the solution of
a Sturm-Liouville operator varphi to the solution of a
Sturm-Liouville operator, can be written as
Xvarphi=varphi(x)+int
0xK(x,t)varphi(t)dt, where the
kernel K satisfies the Goursat problem
K
xx-K
tt-(q(x)-q
0(t))K=0 plus some initial boundary
conditions. Furthermore, K is related by a function F defined
by the spectral data {(lambda
n,alpha
n)} where
α
n=(int
0^π|varphi
n(t)|
2)
frac{1{2}}
through the famous Gelfand-Levitan equation
K(x,y)+F(x,y)+int
oxK(x,t)F(t,y)dt=0. Furthermore, all
the above relations are bilateral, that is qLeftrightarrow
KLeftrightarrow FLeftarrow {(lambda
n,alpha
n)}.
hspace*{0.25in}We shall give a concise account of the above
theory, which involves Riesz basis and order of entire functions.
Then, we also report on some recent applications on the
uniqueness result of the inverse spectral problem.
Advisors/Committee Members: C.K.Low (committee member), none (chair), none (chair).
Subjects/Keywords: eigenvalue; Transformation operator; spectral problem; eigenvector
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):
LEE, Y. (2005). The theory of transformation operators and its application in inverse spectral problems. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0704105-182611
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):
LEE, YU-HAO. “The theory of transformation operators and its application in inverse spectral problems.” 2005. Thesis, NSYSU. Accessed April 14, 2021.
http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0704105-182611.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
LEE, YU-HAO. “The theory of transformation operators and its application in inverse spectral problems.” 2005. Web. 14 Apr 2021.
Vancouver:
LEE Y. The theory of transformation operators and its application in inverse spectral problems. [Internet] [Thesis]. NSYSU; 2005. [cited 2021 Apr 14].
Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0704105-182611.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
LEE Y. The theory of transformation operators and its application in inverse spectral problems. [Thesis]. NSYSU; 2005. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0704105-182611
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of California – Berkeley
11.
Tran, Ngoc Mai.
Topics in Tropical Linear Algebra and Applied Probability.
Degree: Statistics, 2013, University of California – Berkeley
URL: http://www.escholarship.org/uc/item/0gc3m4p1
► Tropical linear algebra is the study of classical linear algebra problems with arithmeticdone over the tropical semiring, namely with addition replaced by max, and multiplicationreplaced…
(more)
▼ Tropical linear algebra is the study of classical linear algebra problems with arithmeticdone over the tropical semiring, namely with addition replaced by max, and multiplicationreplaced by addition. It allows one to reformulate nonlinear problems into piecewise-linearones. This approach has successfully been employed to solve and characterize solutions tomany problems in combinatorial optimization, control theory and game theory [5]. Tropicalspectral theory, the study of tropical eigenvalues and eigenspaces, often plays a central rolein these applications. We derive the basics of this theory in Chapter 1.In Chapter 2 we give a combinatorial description of the cones of linearity of the tropicaleigenvector map. In Chapter 3 we extend this work to cones of linearity of the tropicaleigenspace and polytrope map. Our results contribute to a better understanding of thepolyhedral foundations of tropical linear algebra.Chapter 4 illustrates the above results in the context of pairwise ranking. Here one as-signs to each pair of candidates a comparison score, and the algorithm produces a cardinal(numerically quantified) ranking of candidates. This setup is natural in sport competitions,business and decision making. The difficulty lies in the existence of inconsistencies of theform A > B > C > A, since pairwise comparisons are performed independently. Tropi-calRank is an algorithm pioneered by Elsner and van den Driessche. Solution sets of thisranking method are precisely the polytropes studied in Chapter 3. For generic input pair-wise comparison matrices, this set contains one unique point that is the tropical eigenvector,which is then interpreted as the comparison score. In particular, the results in Chapter 3provide a complete classification of all possible solution sets to the optimization problemthat TropicalRank solves. This answers open questions from several papers [22, 32] in thearea.In Chapter 4 we also show that TropicalRank belongs to the same parametrized familyof ranking methods as two other commonly used algorithms, PerronRank and HodgeRank.Furthermore, we show that HodgeRank and PerronRank asymptotically give the same scoreunder certain random ranking models. Despite their mathematical connections, we canconstruct instances in which these three methods produce arbitrarily different rank order.2The last two chapters are topics in applied probability. Chapter 5 studies the exactand asymptotic distribution of size-biased permutations of finite sequences with independentand identically distributed (i.i.d) terms. The size-biased permutation of a positive summablesequence (x1 , x2 , . . .) is the same sequence presented in a random order (x[1], x[2], . . .), wherex[1] is defined to be xi with probability proportional to its `size' xi ; given that x[1] is xi ,the next term x[2] is defined to be xj for j = i with probability again proportional to its`size' xj , and so on. Size-biased permutations model the successive sampling method inecology and oil discovery, where species (or oil reserves) are discovered in a random…
Subjects/Keywords: Statistics; Mathematics; hopfield network; size-biased permutation; tropical eigenvector; tropical geometry; tropical linear algebra
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):
Tran, N. M. (2013). Topics in Tropical Linear Algebra and Applied Probability. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/0gc3m4p1
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):
Tran, Ngoc Mai. “Topics in Tropical Linear Algebra and Applied Probability.” 2013. Thesis, University of California – Berkeley. Accessed April 14, 2021.
http://www.escholarship.org/uc/item/0gc3m4p1.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Tran, Ngoc Mai. “Topics in Tropical Linear Algebra and Applied Probability.” 2013. Web. 14 Apr 2021.
Vancouver:
Tran NM. Topics in Tropical Linear Algebra and Applied Probability. [Internet] [Thesis]. University of California – Berkeley; 2013. [cited 2021 Apr 14].
Available from: http://www.escholarship.org/uc/item/0gc3m4p1.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Tran NM. Topics in Tropical Linear Algebra and Applied Probability. [Thesis]. University of California – Berkeley; 2013. Available from: http://www.escholarship.org/uc/item/0gc3m4p1
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University
12.
Chen, Lianfu.
Topics on Regularization of Parameters in Multivariate Linear Regression.
Degree: PhD, Statistics, 2012, Texas A&M University
URL: http://hdl.handle.net/1969.1/ETD-TAMU-2011-12-10644
► My dissertation mainly focuses on the regularization of parameters in the multivariate linear regression under different assumptions on the distribution of the errors. It consists…
(more)
▼ My dissertation mainly focuses on the regularization of parameters in the multivariate linear regression under different assumptions on the distribution of the errors. It consists of two topics where we develop iterative procedures to construct sparse estimators for both the regression coefficient and scale matrices simultaneously, and a third topic where we develop a method for testing if the skewness parameter in the skew-normal distribution is parallel to one of the eigenvectors of the scale matrix.
In the first project, we propose a robust procedure for constructing a sparse estimator of a multivariate regression coefficient matrix that accounts for the correlations of the response variables. Robustness to outliers is achieved using heavy-tailed t distributions for the multivariate response, and shrinkage is introduced by adding to the negative log-likelihood l1 penalties on the entries of both the regression coefficient matrix and the precision matrix of the responses. Taking advantage of the hierarchical representation of a multivariate t distribution as the scale mixture of normal distributions and the EM algorithm, the optimization problem is solved iteratively where at each EM iteration suitably modified multivariate regression with covariance estimation (MRCE) algorithms proposed by Rothman, Levina and Zhu are used. We propose two new optimization algorithms for the penalized likelihood, called MRCEI and MRCEII, which differ from MRCE in the way that the tuning parameters for the two matrices are selected. Estimating the degrees of freedom when penalizing the entries of the matrices presents new computational challenges. A simulation study and real data analysis demonstrate that the MRCEII, which selects the tuning parameter of the precision matrix of the multiple responses using the Cp criterion, generally does the best among all methods considered in terms of the prediction error, and MRCEI outperforms the MRCE methods when the regression coefficient matrix is less sparse.
The second project is motivated by the existence of the skewness in the data for which the symmetric distribution assumption on the errors does not hold. We extend the procedure we have proposed to the case where the errors in the multivariate linear regression follow a multivariate skew-normal or skew-t distribution. Based on the convenient representation of skew-normal and skew-t as well as the EM algorithm, we develop an optimization algorithm, called MRST, to iteratively minimize the negative penalized log-likelihood. We also carry out a simulation study to assess the performance of the method and illustrate its application with one real data example.
In the third project, we discuss the asymptotic distributions of the eigenvalues and eigenvectors for the MLE of the scale matrix in a multivariate skew-normal distribution. We propose a statistic for testing whether the skewness vector is proportional to one of the eigenvectors of the scale matrix based on the likelihood ratio. Under the alternative, the likelihood is maximized…
Advisors/Committee Members: Pourahmadi, Mohsen (advisor), Cline, Daren B.H. (committee member), Subba Rao, Suhasini (committee member), Zinn, Joel (committee member).
Subjects/Keywords: Eigenvector; EM algorithm; Lasso regression; Multivariate skew-normal and skew-t: Penalty; Regularization.
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):
Chen, L. (2012). Topics on Regularization of Parameters in Multivariate Linear Regression. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2011-12-10644
Chicago Manual of Style (16th Edition):
Chen, Lianfu. “Topics on Regularization of Parameters in Multivariate Linear Regression.” 2012. Doctoral Dissertation, Texas A&M University. Accessed April 14, 2021.
http://hdl.handle.net/1969.1/ETD-TAMU-2011-12-10644.
MLA Handbook (7th Edition):
Chen, Lianfu. “Topics on Regularization of Parameters in Multivariate Linear Regression.” 2012. Web. 14 Apr 2021.
Vancouver:
Chen L. Topics on Regularization of Parameters in Multivariate Linear Regression. [Internet] [Doctoral dissertation]. Texas A&M University; 2012. [cited 2021 Apr 14].
Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2011-12-10644.
Council of Science Editors:
Chen L. Topics on Regularization of Parameters in Multivariate Linear Regression. [Doctoral Dissertation]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2011-12-10644

McMaster University
13.
Brown, Matthew.
Link-focused prediction of bike share trip volume using GPS data: A GIS based approach.
Degree: MSc, 2020, McMaster University
URL: http://hdl.handle.net/11375/25381
► Modern bike share systems (BSSs) allow users to rent from a fleet of bicycles at hubs across the designated service area. With clear evidence of…
(more)
▼ Modern bike share systems (BSSs) allow users to rent from a fleet of bicycles at hubs across the designated service area. With clear evidence of cycling being a health-positive form of active transport, furthering our understanding of the underlying processes that affect BSS ridership is essential to continue further adoption. Using 286,587 global positioning system (GPS) trajectories over a 12-month period between January 1st, 2018 and December 31st, 2018 from a BSS called SoBi (Social Bicycles) Hamilton, the number of trips on every traveled link in the service area are predicted. A GIS-based map-matching toolkit is used to generate cyclists’ routes along the cycling network of Hamilton, Ontario to determine the number of observed unique trips on every road segment (link) in the study area. To predict trips, several variables were created at the individual link level including accessibility measures, distances to important locations in the city, proximity to active travel infrastructure (SoBi hubs, bus stops), and bike infrastructure. Linear regression models were used to estimate trips. Eigenvector spatial filtering (ESF) was used to explicitly model spatial autocorrelation. The results suggest the largest positive predictors of cycling traffic in terms of cycling infrastructure are those that are physically separated from the automobile network (e.g., designated bike lanes). Additionally, hub-trip distance accessibility, a novel measure, was found to be the most significant variable in predicting trips. A demonstration of how the model can be used for strategic planning of road network upgrades is also presented.
Thesis
Master of Science (MSc)
Advisors/Committee Members: Scott, Darren, Geography.
Subjects/Keywords: Bike share; Cycling; Active travel; Eigenvector Spatial Filtering; Network Analysis; Geographic Information Systems
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):
Brown, M. (2020). Link-focused prediction of bike share trip volume using GPS data: A GIS based approach. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/25381
Chicago Manual of Style (16th Edition):
Brown, Matthew. “Link-focused prediction of bike share trip volume using GPS data: A GIS based approach.” 2020. Masters Thesis, McMaster University. Accessed April 14, 2021.
http://hdl.handle.net/11375/25381.
MLA Handbook (7th Edition):
Brown, Matthew. “Link-focused prediction of bike share trip volume using GPS data: A GIS based approach.” 2020. Web. 14 Apr 2021.
Vancouver:
Brown M. Link-focused prediction of bike share trip volume using GPS data: A GIS based approach. [Internet] [Masters thesis]. McMaster University; 2020. [cited 2021 Apr 14].
Available from: http://hdl.handle.net/11375/25381.
Council of Science Editors:
Brown M. Link-focused prediction of bike share trip volume using GPS data: A GIS based approach. [Masters Thesis]. McMaster University; 2020. Available from: http://hdl.handle.net/11375/25381

University of Ottawa
14.
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 April 14, 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. 14 Apr 2021.
Vancouver:
Afrasiabi Rad A. Social Network Analysis and Time Varying Graphs
. [Internet] [Thesis]. University of Ottawa; 2016. [cited 2021 Apr 14].
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
15.
Zhao, Yue.
Screening Urban Road Network for Corridors with Promise.
Degree: 2015, University of Nevada – Reno
URL: http://hdl.handle.net/11714/2595
► Both federal and state policy makers increasingly emphasize the need to reduce traffic fatalities and serious injuries. Finding improved methods to enhance roadway safety has…
(more)
▼ Both federal and state policy makers increasingly emphasize the need to reduce traffic fatalities and serious injuries. Finding improved methods to enhance roadway safety has become a top priority. In an attempt to reduce traffic crashes, crash-prone locations should be identified for increased law enforcement activities, education programs, and engineering improvements. This dissertation addresses the critical issue in traffic safety research, methods for corridor-based screening for safety improvement. The role of corridor level screening is to periodically examine the entire urban roadway network in order to generate a list of corridors ranked in order of priority by which detailed engineering studies should be conducted. Ongoing debates in regards to corridor level network screening include what should constitute a corridor for the purpose of network screening, and how a local agency should perform a corridor screening. This research provides answers to these questions.Firstly, a comprehensive literature review was conducted to summarize current practices across the nation pertaining to corridor level network screening. No consensus was found in terms of corridor definitions or screening methodologies. Observed traffic crashes are generally used in evaluating the safety of urban facilities in state departments of transportation although model based evaluation is highly recommended because of its exceptional merits. Secondly, this research proposes a spatial clustering based approach to define urban corridor boundaries. The idea is to group signalized intersections along urban arterial roads based on their spatial auto-correlations. Local spatial measurements (local Moran's I and Getis-Ord index) are adopted to cluster multivariate intersection data. The analyses of arterials in the Reno-Sparks area indicate that the proposed approach provides reasonable corridor definitions. The next section of the dissertation proposes a model-based scheme for screening urban corridors. Significant efforts were made to collect crash, traffic and road inventory data at intersection level, segment level and corridor level. Data assembling and processing were conducted in ArcGIS. Statistical models, such as negative binomial regression models, have been widely used in developing crash prediction models over the past decades. This research investigated other models including the Poisson-Inverse Gaussian and Poisson-Lognormal models. Analysis results imply that for a certain data set different model assumptions will generate quite different results. Overall, the Poisson-Inverse Gaussian model and the Poisson-Lognormal model perform better than the negative binomial model in terms of goodness-of-fit statistics. Due to the high flexibility of Inverse Gaussian and Lognormal distributions, such models can be adopted as alternatives to the negative binomial models in developing crash prediction models. Furthermore, this research explores the effect of spatial correlations in crash prediction modeling. Significant spatial correlations…
Advisors/Committee Members: Tian, Zong Z. (advisor), Xu, Hao (committee member), Fadali, Sami (committee member), Hajj, Elie Y. (committee member), Song, Shunfeng (committee member).
Subjects/Keywords: Corridors; Eigenvector spatial filtering; Network screening; Roadway safety; Spatial dependency; Urban road network
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):
Zhao, Y. (2015). Screening Urban Road Network for Corridors with Promise. (Thesis). University of Nevada – Reno. Retrieved from http://hdl.handle.net/11714/2595
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):
Zhao, Yue. “Screening Urban Road Network for Corridors with Promise.” 2015. Thesis, University of Nevada – Reno. Accessed April 14, 2021.
http://hdl.handle.net/11714/2595.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Zhao, Yue. “Screening Urban Road Network for Corridors with Promise.” 2015. Web. 14 Apr 2021.
Vancouver:
Zhao Y. Screening Urban Road Network for Corridors with Promise. [Internet] [Thesis]. University of Nevada – Reno; 2015. [cited 2021 Apr 14].
Available from: http://hdl.handle.net/11714/2595.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Zhao Y. Screening Urban Road Network for Corridors with Promise. [Thesis]. University of Nevada – Reno; 2015. Available from: http://hdl.handle.net/11714/2595
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Maryland
16.
Cloninger, Alexander.
Exploiting Data-Dependent Structure for Improving Sensor Acquisition and Integration.
Degree: Applied Mathematics and Scientific Computation, 2014, University of Maryland
URL: http://hdl.handle.net/1903/15281
► This thesis deals with two approaches to building efficient representations of data. The first is a study of compressive sensing and improved data acquisition. We…
(more)
▼ This thesis deals with two approaches to building efficient representations of data. The first is a study of compressive sensing and improved data acquisition. We outline the development of the theory, and proceed into its uses in matrix completion problems via convex optimization. The aim of this research is to prove that a general class of measurement operators, bounded norm Parseval frames, satisfy the necessary conditions for random subsampling and reconstruction. We then demonstrate an example of this theory in solving 2-dimensional Fredholm integrals with partial measurements. This has large ramifications in improved acquisition of nuclear magnetic resonance spectra, for which we give several examples.
The second part of this thesis studies the Laplacian Eigenmaps (LE) algorithm and its uses in data fusion. In particular, we build a natural approximate inversion algorithm for LE embeddings using L1 regularization and MDS embedding techniques. We show how this inversion, combined with feature space rotation, leads to a novel form of data reconstruction and inpainting using a priori information. We demonstrate this method on hyperspectral imagery and LIDAR.
We also aim to understand and characterize the embeddings the LE algorithm gives. To this end, we characterize the order in which eigenvectors of a disjoint graph emerge and the support of those eigenvectors. We then extend this characterization to weakly connected graphs with clusters of differing sizes, utilizing the theory of invariant subspace perturbations and proving some novel results.
Advisors/Committee Members: Czaja, Wojciech (advisor), Benedetto, John J (advisor).
Subjects/Keywords: Applied mathematics; Mathematics; applied harmonic analysis; compressive sensing; data analysis; eigenvector localization; graph Laplacian
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):
Cloninger, A. (2014). Exploiting Data-Dependent Structure for Improving Sensor Acquisition and Integration. (Thesis). University of Maryland. Retrieved from http://hdl.handle.net/1903/15281
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):
Cloninger, Alexander. “Exploiting Data-Dependent Structure for Improving Sensor Acquisition and Integration.” 2014. Thesis, University of Maryland. Accessed April 14, 2021.
http://hdl.handle.net/1903/15281.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Cloninger, Alexander. “Exploiting Data-Dependent Structure for Improving Sensor Acquisition and Integration.” 2014. Web. 14 Apr 2021.
Vancouver:
Cloninger A. Exploiting Data-Dependent Structure for Improving Sensor Acquisition and Integration. [Internet] [Thesis]. University of Maryland; 2014. [cited 2021 Apr 14].
Available from: http://hdl.handle.net/1903/15281.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Cloninger A. Exploiting Data-Dependent Structure for Improving Sensor Acquisition and Integration. [Thesis]. University of Maryland; 2014. Available from: http://hdl.handle.net/1903/15281
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Texas State University – San Marcos
17.
Reiss, Randolf H.
Eigenvalues and Eigenvectors in Data Dimension Reduction for Regression.
Degree: MS, Mathematics, 2013, Texas State University – San Marcos
URL: https://digital.library.txstate.edu/handle/10877/4696
► A basic theory of eigenvalues and eigenvectors as a means to reduce the dimension of data, is presented. Iterative methods for finding eigenvalues and eigenvectors…
(more)
▼ A basic theory of eigenvalues and eigenvectors as a means to reduce the dimension of data, is presented. Iterative methods for finding eigenvalues and eigenvectors are explored with proofs of the existence and uniqueness of solutions. Of particular focus is the Power Method as it is the basis of most
eigenvector algorithms. Interpretations of the Power Method are presented in the context of linear algebra and data dimension reduction. It is shown that the algorithms for principal component analysis and partial least squares are extensions of the Power Method. The estimation of parameters for a computer-based pharmaceutical bioreactor simulator is presented as an application. Diagnostics methods of ordinary multiple least squares regression are applied to partial least squares, including detection of hidden extrapolation.
Advisors/Committee Members: Zhao, Qiang (advisor), White, Alexander (committee member), Shen, Jian (committee member).
Subjects/Keywords: Eigenvector; Eigenvalue; Dimension reduction; Power method; Partial least squares; Eigenvalues; Eigenvectors; Data reduction
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):
Reiss, R. H. (2013). Eigenvalues and Eigenvectors in Data Dimension Reduction for Regression. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/4696
Chicago Manual of Style (16th Edition):
Reiss, Randolf H. “Eigenvalues and Eigenvectors in Data Dimension Reduction for Regression.” 2013. Masters Thesis, Texas State University – San Marcos. Accessed April 14, 2021.
https://digital.library.txstate.edu/handle/10877/4696.
MLA Handbook (7th Edition):
Reiss, Randolf H. “Eigenvalues and Eigenvectors in Data Dimension Reduction for Regression.” 2013. Web. 14 Apr 2021.
Vancouver:
Reiss RH. Eigenvalues and Eigenvectors in Data Dimension Reduction for Regression. [Internet] [Masters thesis]. Texas State University – San Marcos; 2013. [cited 2021 Apr 14].
Available from: https://digital.library.txstate.edu/handle/10877/4696.
Council of Science Editors:
Reiss RH. Eigenvalues and Eigenvectors in Data Dimension Reduction for Regression. [Masters Thesis]. Texas State University – San Marcos; 2013. Available from: https://digital.library.txstate.edu/handle/10877/4696

University of Waterloo
18.
Howarth, Samuel.
Locating Instability in the Lumbar Spine: Characterizing the Eigenvector.
Degree: 2006, University of Waterloo
URL: http://hdl.handle.net/10012/2808
► Overloading of the back can cause instability such that buttressing the instability is a primary objective of many of the leading edge therapeutic approaches. However,…
(more)
▼ Overloading of the back can cause instability such that buttressing the instability is a primary objective of many of the leading edge therapeutic approaches. However, a challenge lies in determining the location of the instability or the least stable vertebral joint. A mathematical analysis, based on a commonly used approach in engineering for determining structural stability, has been developed for the lumbar spine. The purpose of this investigation was to determine the feasibility of a method for mathematically locating potential areas of instability within a computer-based model of the lumbar spine. To validate this method, the eigenvector from the stability analysis was compared to the output from a geometric equation that approximated individual vertebral joint rotational stiffness with the idea that the entry in the eigenvector with the largest absolute value would correspond to the vertebral joint and axis with the lowest stiffness. Validation of the eigenvector was not possible due to computational similarities between the stability analysis and the geometric rotational stiffness method. However, it has been previously demonstrated that the eigenvector can be useful for locating instability, and thus warrants future study. Determining the least stable vertebral joint and axis can be used to guide proper motor pattern training as a clinical intervention. It was also shown in this investigation that an even distribution of fascicle force and stiffness generated stability. This supports the idea that well-coordinated efforts of muscle activation are beneficial for improving stability of the lumbar spine.
Subjects/Keywords: Kinesiology and Sport; lumbar spine; eigenvector; mechanical stability
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):
Howarth, S. (2006). Locating Instability in the Lumbar Spine: Characterizing the Eigenvector. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/2808
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):
Howarth, Samuel. “Locating Instability in the Lumbar Spine: Characterizing the Eigenvector.” 2006. Thesis, University of Waterloo. Accessed April 14, 2021.
http://hdl.handle.net/10012/2808.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Howarth, Samuel. “Locating Instability in the Lumbar Spine: Characterizing the Eigenvector.” 2006. Web. 14 Apr 2021.
Vancouver:
Howarth S. Locating Instability in the Lumbar Spine: Characterizing the Eigenvector. [Internet] [Thesis]. University of Waterloo; 2006. [cited 2021 Apr 14].
Available from: http://hdl.handle.net/10012/2808.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Howarth S. Locating Instability in the Lumbar Spine: Characterizing the Eigenvector. [Thesis]. University of Waterloo; 2006. Available from: http://hdl.handle.net/10012/2808
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

North Carolina State University
19.
Miao, Huiping.
Model Selection and Estimation in Additive Regression Models.
Degree: PhD, Statistics, 2009, North Carolina State University
URL: http://www.lib.ncsu.edu/resolver/1840.16/4135
► We propose a method of simultaneous model selection and estimation in additive regression models (ARMs) for independent normal data. We use the mixed model representation…
(more)
▼ We propose a method of simultaneous model selection and estimation in additive regression models (ARMs) for
independent normal data. We use the mixed model representation of the smoothing spline estimators of the
nonparametric functions in ARMs, where the importance of these functions is controlled by treating the
inverse of the smoothing parameters as extra variance components. The selection of important nonparametric
functions is achieved by maximizing the penalized likelihood with an adaptive LASSO. A unified EM algorithm
is provided to obtain the maximum penalized likelihood estimates of the nonparametric functions and the
residual variance. In the same framework, we also consider forward selection based on score tests, and a two
stage approach that imposes an early stage screening using an individual score test on each induced variance
component of the smoothing parameter.
For longitudinal data, we propose to extend the adaptive LASSO and the two-stage selection with score test
screening to the additive mixed models (AMMs), by introducing
subject-specific random effects to the additive
models to accommodate the correlation in responses. We use the eigenvalue-
eigenvector decomposition approach
to approximate the working random effects in the linear mixed model presentation of the AMMs, so as to reduce
the dimensions of matrices involved in the algorithm while keeping most data information, hence to tackle the
computational problems caused by large sample sizes in longitudinal data.
Simulation studies are provided and the methods are illustrated with data applications.
Advisors/Committee Members: Hao Zhang, Committee Member (advisor), Marie Davidian, Committee Member (advisor), Dennis Boos, Committee Member (advisor), Daowen Zhang, Committee Chair (advisor).
Subjects/Keywords: score tests; mixed models; additive regression models; additive mixed models; eigenvalue-eigenvector decomposition; the adaptive LASSO
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):
Miao, H. (2009). Model Selection and Estimation in Additive Regression Models. (Doctoral Dissertation). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/4135
Chicago Manual of Style (16th Edition):
Miao, Huiping. “Model Selection and Estimation in Additive Regression Models.” 2009. Doctoral Dissertation, North Carolina State University. Accessed April 14, 2021.
http://www.lib.ncsu.edu/resolver/1840.16/4135.
MLA Handbook (7th Edition):
Miao, Huiping. “Model Selection and Estimation in Additive Regression Models.” 2009. Web. 14 Apr 2021.
Vancouver:
Miao H. Model Selection and Estimation in Additive Regression Models. [Internet] [Doctoral dissertation]. North Carolina State University; 2009. [cited 2021 Apr 14].
Available from: http://www.lib.ncsu.edu/resolver/1840.16/4135.
Council of Science Editors:
Miao H. Model Selection and Estimation in Additive Regression Models. [Doctoral Dissertation]. North Carolina State University; 2009. Available from: http://www.lib.ncsu.edu/resolver/1840.16/4135

Victoria University of Wellington
20.
Aziz, Nazrina.
Analysis and Diagnostics for
Censored Regression and
Multivariate Data.
Degree: 2010, Victoria University of Wellington
URL: http://hdl.handle.net/10063/1487
► This thesis investigates three research problems which arise in multivariate data and censored regression. The first is the identification of outliers in multivariate data. The…
(more)
▼ This thesis investigates three research problems which arise in multivariate
data and censored regression. The first is the identification of outliers
in multivariate data. The second is a dissimilarity measure for clustering
purposes. The third is the diagnostics analysis for the Buckley-James
method in censored regression.
Outliers can be defined simply as an observation (or a subset of observations)
that is isolated from the other observations in the data set. There
are two main reasons that motivate people to find outliers; the first is the
researcher's intention. The second is the effects of an outlier on analyses,
i.e. the existence of outliers will affect means, variances and regression
coefficients; they will also cause a bias or distortion of estimates; likewise,
they will inflate the sums of squares and hence, false conclusions are likely
to be created. Sometimes, the identification of outliers is the main objective
of the analysis, and whether to remove the outliers or for them to be
down-weighted prior to fitting a non-robust model.
This thesis does not differentiate between the various justifications for
outlier detection. The aim is to advise the analyst of observations that
are considerably different from the majority. Note that the techniques for
identification of outliers introduce in this thesis is applicable to a wide
variety of settings. Those techniques are performed on large and small
data sets. In this thesis, observations that are located far away from the
remaining data are considered to be outliers.
Additionally, it is noted that some techniques for the identification of
outliers are available for finding clusters. There are two major challenges
in clustering. The first is identifying clusters in high-dimensional data sets
is a difficult task because of the curse of dimensionality. The second is a
new dissimilarity measure is needed as some traditional distance functions
cannot capture the pattern dissimilarity among the objects. This thesis
deals with the latter challenge. This thesis introduces Influence Angle
Cluster Approach (iaca) that may be used as a dissimilarity matrix and
the author has managed to show that iaca successfully develops a cluster
when it is used in partitioning clustering, even if the data set has mixed
variables, i.e. interval and categorical variables. The iaca is developed
based on the influence eigenstructure.
The first two problems in this thesis deal with a complete data set. It is
also interesting to study about the incomplete data set, i.e. censored data
set. The term 'censored' is mostly used in biological science areas such as
a survival analysis. Nowadays, researchers are interested in comparing
the survival distribution of two samples. Even though this can be done
by using the logrank test, this method cannot examine the effects of more
than one variable at a time. This difficulty can easily be overcome by using
the survival regression model. Examples of the survival regression model
are the Cox model, Miller's model, the Buckely James model and the Koul-…
Advisors/Committee Members: Wang, Dong Qian.
Subjects/Keywords: Outliers; Eigenvalue and eigenvector; Influence angle; Buckley-James model; Dissimilarity measure; Censored data; Diagnostic analysis; Renovated Cook's distance; Local influence
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):
Aziz, N. (2010). Analysis and Diagnostics for
Censored Regression and
Multivariate Data. (Doctoral Dissertation). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/1487
Chicago Manual of Style (16th Edition):
Aziz, Nazrina. “Analysis and Diagnostics for
Censored Regression and
Multivariate Data.” 2010. Doctoral Dissertation, Victoria University of Wellington. Accessed April 14, 2021.
http://hdl.handle.net/10063/1487.
MLA Handbook (7th Edition):
Aziz, Nazrina. “Analysis and Diagnostics for
Censored Regression and
Multivariate Data.” 2010. Web. 14 Apr 2021.
Vancouver:
Aziz N. Analysis and Diagnostics for
Censored Regression and
Multivariate Data. [Internet] [Doctoral dissertation]. Victoria University of Wellington; 2010. [cited 2021 Apr 14].
Available from: http://hdl.handle.net/10063/1487.
Council of Science Editors:
Aziz N. Analysis and Diagnostics for
Censored Regression and
Multivariate Data. [Doctoral Dissertation]. Victoria University of Wellington; 2010. Available from: http://hdl.handle.net/10063/1487

University of Vermont
21.
Dambros, Cristian de Sales.
Determinants of Termite Species Taxonomic, Phylogenetic, and Functional Diversity in the Amazonian Forest.
Degree: PhD, Biology, 2015, University of Vermont
URL: https://scholarworks.uvm.edu/graddis/353
► The distribution of species in space is determined by the species dispersal capacity, adaptation to environmental conditions, and response to predators and competitors. To…
(more)
▼ The distribution of species in space is determined by the species dispersal capacity, adaptation to environmental conditions, and response to predators and competitors. To determine the importance of dispersal limitation, environmental filtering, and species interactions on the distribution of species in the Brazilian Amazonian forest, I sampled termites in a large area of Brazil. I investigated patterns in species occurrence that could indicate competition and predation structuring termite communities, and analyzed the association of termite abundance and species richness with the density of ant predators. The spatial distribution of termites, and their association with climatic and edaphic conditions were also used to infer about the effects of dispersal limitation and environmental filtering. A total of 271 termite species and 4,389 colonies was found in the 148 transects sampled. Predator density was the strongest predictor of termite abundance and species richness at small spatial scales, but the turnover in termite species composition was mostly associated with measures of soil texture. At broad spatial scales, soil chemistry, climate, and isolation by distance were associated with termite abundance, species richness, and species composition. These results suggest that both species interactions, their association with the environment, and their dispersal capacity determine their distribution. Nevertheless, dispersal limitation seem to be stronger over large areas, whereas environmental filtering can act both at small and large geographic scales.
Advisors/Committee Members: Nicholas J. Gotelli.
Subjects/Keywords: Biogeography; Community Ecology; Moran Eigenvector Maps; Spatial ecology; Species diversity; Tropical rainforests; Ecology and Evolutionary Biology; Zoology
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):
Dambros, C. d. S. (2015). Determinants of Termite Species Taxonomic, Phylogenetic, and Functional Diversity in the Amazonian Forest. (Doctoral Dissertation). University of Vermont. Retrieved from https://scholarworks.uvm.edu/graddis/353
Chicago Manual of Style (16th Edition):
Dambros, Cristian de Sales. “Determinants of Termite Species Taxonomic, Phylogenetic, and Functional Diversity in the Amazonian Forest.” 2015. Doctoral Dissertation, University of Vermont. Accessed April 14, 2021.
https://scholarworks.uvm.edu/graddis/353.
MLA Handbook (7th Edition):
Dambros, Cristian de Sales. “Determinants of Termite Species Taxonomic, Phylogenetic, and Functional Diversity in the Amazonian Forest.” 2015. Web. 14 Apr 2021.
Vancouver:
Dambros CdS. Determinants of Termite Species Taxonomic, Phylogenetic, and Functional Diversity in the Amazonian Forest. [Internet] [Doctoral dissertation]. University of Vermont; 2015. [cited 2021 Apr 14].
Available from: https://scholarworks.uvm.edu/graddis/353.
Council of Science Editors:
Dambros CdS. Determinants of Termite Species Taxonomic, Phylogenetic, and Functional Diversity in the Amazonian Forest. [Doctoral Dissertation]. University of Vermont; 2015. Available from: https://scholarworks.uvm.edu/graddis/353
22.
Biglands, Adrian J.
Ranking Problems Arising from ODE Models on Networks.
Degree: PhD, Department of Mathematical and Statistical
Sciences, 2015, University of Alberta
URL: https://era.library.ualberta.ca/files/m900nx135
► The use of ordinary differential equations modelled on networks has become an increasingly important technique in many areas of research. The local behaviour of the…
(more)
▼ The use of ordinary differential equations modelled on
networks has become an increasingly important technique in many
areas of research. The local behaviour of the system is modelled
with differential equations and interactions between members or
nodes are described using weighted digraphs. For instance, in
public health nodes can represent different groups of people
affected by an infectious disease, while edges in the network
represent the cross-infection between the groups. The local
behaviours of the disease in each group are described with ODE
dynamics. In ecology, the spatial dispersal of one or more species
considers the habitation patches as nodes and the edges between
nodes describe the movement of the species between patches. This
thesis develops a method of ranking the nodes of an ODE network at
a positive equilibrium x^* = (x_1^* , . . . , x_n^*)T . Such a
ranking is called an equilibrium ranking. More specifically,
assuming an ODE system modelled on a network (G,B) has a positive
equilibrium x^*, we associate x_i^* to node i of the network. These
positive equilibrium values x_i^* are used to rate, and hence rank,
the individual nodes of the network. Such an equilibrium ranking
reflects both the graph structure and the local ODE parameters of
the model. In my dissertation I investigate equilibrium ranking for
several ODE networks including SIR epidemiology models with n
different groups or spatial regions, single or multiple species
ecological models, and coupled oscillator models from engineering.
For an SIR model the equilibrium ranking can be obtained using the
equilibrium values of the disease prevalence vector I^* = (I_1^* ,
. . . , I_n^*)T . This will indicate which of the n groups or
patches has the highest number of infected individuals per capita.
In the single species ecology model an equilibrium ranking vector
comes from the species density vector x^* = (x_1^* , . . . ,
x_n^*)T , and reflects overpopulation or extinction on different
patches or in different groups. The dependence of equilibrium
ranking on both graph structure and local parameters is also
investigated. In particular, the dependence of the equilibrium
ranking is considered for several digraph structures including
rooted trees, loop digraphs, unicyclic and multi-cyclic digraphs.
This will allow researchers to fix the network structure (G,B) of
the system and focus on how the dynamics play a role in the
importance of nodes in a network.
Subjects/Keywords: Eigenvector Centrality; ODE Network; Equilibrium Ranking
…Networks, ODE Models on Networks, Relative Importance and Centrality, Eigenvector Centrality… …vector I∗ = (I1∗ , . . . , In∗ )T .
Therefore, I∗ is the unique positive eigenvector… …of eigenvector
centrality ranking. The benefit of this new equilibrium ranking is that it… …x29;x∗ = x∗ .
(1.3)
Then we can show that x∗ is the Perron eigenvector of M… …Chapter 3, this establishes a link between eigenvector ranking of
a network and our equilibrium…
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):
Biglands, A. J. (2015). Ranking Problems Arising from ODE Models on Networks. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/m900nx135
Chicago Manual of Style (16th Edition):
Biglands, Adrian J. “Ranking Problems Arising from ODE Models on Networks.” 2015. Doctoral Dissertation, University of Alberta. Accessed April 14, 2021.
https://era.library.ualberta.ca/files/m900nx135.
MLA Handbook (7th Edition):
Biglands, Adrian J. “Ranking Problems Arising from ODE Models on Networks.” 2015. Web. 14 Apr 2021.
Vancouver:
Biglands AJ. Ranking Problems Arising from ODE Models on Networks. [Internet] [Doctoral dissertation]. University of Alberta; 2015. [cited 2021 Apr 14].
Available from: https://era.library.ualberta.ca/files/m900nx135.
Council of Science Editors:
Biglands AJ. Ranking Problems Arising from ODE Models on Networks. [Doctoral Dissertation]. University of Alberta; 2015. Available from: https://era.library.ualberta.ca/files/m900nx135
23.
Santos Júnior, Jânio Alves dos.
Grafos e suas aplicações.
Degree: 2016, Universidade Federal de Goiás; PROFMAT – Programa de Pós-graduação em Matemática em Rede Nacional - Sociedade Brasileira de Matemática (RJ); UFG; Brasil; Regional Jataí (RJ)
URL: http://repositorio.bc.ufg.br/tede/handle/tede/6798
► Submitted by Cássia Santos ([email protected]) on 2017-01-26T09:20:52Z No. of bitstreams: 2 Dissertação - Jânio Alves dos Santos Júnior - 2016.pdf: 3798217 bytes, checksum: c2acd93260ead52c126f4b37d994825f (MD5)…
(more)
▼ Submitted by Cássia Santos ([email protected]) on 2017-01-26T09:20:52Z No. of bitstreams: 2 Dissertação - Jânio Alves dos Santos Júnior - 2016.pdf: 3798217 bytes, checksum: c2acd93260ead52c126f4b37d994825f (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Approved for entry into archive by Luciana Ferreira ([email protected]) on 2017-01-30T10:25:56Z (GMT) No. of bitstreams: 2 Dissertação - Jânio Alves dos Santos Júnior - 2016.pdf: 3798217 bytes, checksum: c2acd93260ead52c126f4b37d994825f (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Made available in DSpace on 2017-01-30T10:25:56Z (GMT). No. of bitstreams: 2 Dissertação - Jânio Alves dos Santos Júnior - 2016.pdf: 3798217 bytes, checksum: c2acd93260ead52c126f4b37d994825f (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2016-12-14
Coordenação de Aperfeiçoamento de Pessoal de Nível
Superior - CAPES
This work aims to study some topics of graph theory in order to solve some problems. In order to complement, we approached a light study of matrices, eigenvalues and eigenvectors. The first problem is known as Königsberg Bridge Problem, where this was considered the problem that gave rise to the study on graphs. The House Problem is a joke, which shows us several propositions about planar and bipartite graphs. Some models we can relate graphs, such as we can observe in the problem of cannibals and in the game of chess. Finally, we will work with applications in the adjacency matrix as in the Problem of the Condominium of Farms and in the Number of Possible Paths in a graph, where we will work with geometric figures, apparently resolving a counting problem using eigenvalues and graph. As a methodological support will be approached Linear Algebra.
O objetivo deste trabalho é estudar alguns tópicos da teoria de grafos com o intuito de resolver alguns problemas.
Para complementar, abordamos um leve estudo de matrizes, autovalores e autovetores. O primeiro problema é conhecido como o Problema da Ponte de Königsberg, onde tal, foi considerado o problema que deu origem ao estudo sobre grafos. O Problema das Casas que é uma brincadeira, que nos mostra várias proposições sobre grafos planares e bipartidos. Alguns modelos que podemos relacionar grafos, tais como veremos no problema dos canibais e no jogo de xadrez. Por fim, trabalharemos com aplicações na matriz de adjacência como no problema do Condomínio de Chácaras e no Número de Caminhos Possíveis em um Grafo, onde trabalharemos com figuras geométricas, resolvendo aparentemente um problema de contagem, utilizando autovalores e grafos. Como suporte metodológico será abordado Álgebra Linear.
Advisors/Committee Members: Silva, Gecirlei Francisco da, Smith, Ole Peter, Silva, Gecirlei Francisco da, Costa, Esdras Teixeira, Gomes, Paulo Freitas.
Subjects/Keywords: Grafos; Matrizes; Autovalor; Autovetor; Polinômio característico; Graphs; Linear algebra; Eigenvalue; Eigenvector; Characteristic polynomial; CIENCIAS EXATAS E DA TERRA::MATEMATICA
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):
Santos Júnior, J. A. d. (2016). Grafos e suas aplicações. (Masters Thesis). Universidade Federal de Goiás; PROFMAT – Programa de Pós-graduação em Matemática em Rede Nacional - Sociedade Brasileira de Matemática (RJ); UFG; Brasil; Regional Jataí (RJ). Retrieved from http://repositorio.bc.ufg.br/tede/handle/tede/6798
Chicago Manual of Style (16th Edition):
Santos Júnior, Jânio Alves dos. “Grafos e suas aplicações.” 2016. Masters Thesis, Universidade Federal de Goiás; PROFMAT – Programa de Pós-graduação em Matemática em Rede Nacional - Sociedade Brasileira de Matemática (RJ); UFG; Brasil; Regional Jataí (RJ). Accessed April 14, 2021.
http://repositorio.bc.ufg.br/tede/handle/tede/6798.
MLA Handbook (7th Edition):
Santos Júnior, Jânio Alves dos. “Grafos e suas aplicações.” 2016. Web. 14 Apr 2021.
Vancouver:
Santos Júnior JAd. Grafos e suas aplicações. [Internet] [Masters thesis]. Universidade Federal de Goiás; PROFMAT – Programa de Pós-graduação em Matemática em Rede Nacional - Sociedade Brasileira de Matemática (RJ); UFG; Brasil; Regional Jataí (RJ); 2016. [cited 2021 Apr 14].
Available from: http://repositorio.bc.ufg.br/tede/handle/tede/6798.
Council of Science Editors:
Santos Júnior JAd. Grafos e suas aplicações. [Masters Thesis]. Universidade Federal de Goiás; PROFMAT – Programa de Pós-graduação em Matemática em Rede Nacional - Sociedade Brasileira de Matemática (RJ); UFG; Brasil; Regional Jataí (RJ); 2016. Available from: http://repositorio.bc.ufg.br/tede/handle/tede/6798

University of Stirling
24.
Doeser, Anna.
Refining biological monitoring of hydromorphological change in river channels using benthic riverfly larvae (Ephemeroptera, Plecoptera and Trichoptera).
Degree: PhD, 2016, University of Stirling
URL: http://hdl.handle.net/1893/25238
► Rivers and their catchments are under mounting pressure from direct channel modification, intensification of land use, and from a legacy of decades of channelisation. Recent…
(more)
▼ Rivers and their catchments are under mounting pressure from direct channel modification, intensification of land use, and from a legacy of decades of channelisation. Recent legislation, in the form of the EU Water Framework Directive, places a greater emphasis on the management of water bodies as holistic systems, and includes the explicit consideration of hydromorphological quality, which describes the hydrologic and geomorphic elements of river habitats. These are defined specifically as hydrological regime, river continuity and river morphology. This appreciates that sediment and flow regimes, along with the channel structure, provides the 'template' on which stream ecological structure and function is built.
Invertebrate fauna contribute significantly to the biodiversity of rivers, and often form the basis of monitoring river health. However much of the fundamental ecological knowledge base on the response of invertebrates to hydromorphological change needed to make informed decisions and accurate predictions, is either lacking, inadequate or contradictory. This thesis addresses some of the key potential shortcomings in recent bio-assessment that others have alluded to, but which have rarely been explored in the context of direct channel manipulations. By using two case studies of, realignment in a natural upland catchment, and flood protection engineering in an urban stream, this study investigates the sensitivity of hydromorphological impact assessment methods that rely on biodiversity patterns of benthic riverfly (Ephemeroptera, Plecoptera and Trichoptera) larva.
This work employed widely used biomonitoring indices of benthic riverfly larva abundance, species richness, alpha and beta diversity, and community composition, applied over a range of spatial scales, in combination with spatially contemporaneous physical habitat data, to describe and explain community changes in response to disturbance, and patterns of natural variation. The effects of restoration were investigated using a high degree of sample replication within channels and across the wider catchment, as well as contrasting spring and autumn seasons. To assess change in a small urban channel, approaches that explicitly consider spatial elements of community data, using spatial eigenvectors analysis, were applied to spatially detrend community data and directly investigate spatial patterns.
Restoration of the Rottal Burn was found to be successful in restoring habitat diversity and geomorphic processes, and in turn increasing reach scale species richness and beta diversity through the gradual arrival of rare and specialist taxa into novel habitats. Catchment scale replication revealed high variation in diversity indices of modified and undisturbed streams, and a strong temporal pattern related to antecedent flow conditions. Channels with greater habitat heterogeneity were able to maintain high gamma diversity during times of high flow stress by providing a number of low flow refuges along their length.
The urban Brox…
Subjects/Keywords: river; restoration; stream; eigenvector maps; biodiversity; beta diversity; habitat; monitoring; hydromorphology; WFD; benthic macroinvertebrates; bio-assesment; spatial patterns; spatial autocorrelation; urban stream; Ecohydrology; Biodiversity; River channels; Mayflies; Stoneflies; Caddisflies
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):
Doeser, A. (2016). Refining biological monitoring of hydromorphological change in river channels using benthic riverfly larvae (Ephemeroptera, Plecoptera and Trichoptera). (Doctoral Dissertation). University of Stirling. Retrieved from http://hdl.handle.net/1893/25238
Chicago Manual of Style (16th Edition):
Doeser, Anna. “Refining biological monitoring of hydromorphological change in river channels using benthic riverfly larvae (Ephemeroptera, Plecoptera and Trichoptera).” 2016. Doctoral Dissertation, University of Stirling. Accessed April 14, 2021.
http://hdl.handle.net/1893/25238.
MLA Handbook (7th Edition):
Doeser, Anna. “Refining biological monitoring of hydromorphological change in river channels using benthic riverfly larvae (Ephemeroptera, Plecoptera and Trichoptera).” 2016. Web. 14 Apr 2021.
Vancouver:
Doeser A. Refining biological monitoring of hydromorphological change in river channels using benthic riverfly larvae (Ephemeroptera, Plecoptera and Trichoptera). [Internet] [Doctoral dissertation]. University of Stirling; 2016. [cited 2021 Apr 14].
Available from: http://hdl.handle.net/1893/25238.
Council of Science Editors:
Doeser A. Refining biological monitoring of hydromorphological change in river channels using benthic riverfly larvae (Ephemeroptera, Plecoptera and Trichoptera). [Doctoral Dissertation]. University of Stirling; 2016. Available from: http://hdl.handle.net/1893/25238

University of Saskatchewan
25.
He, Peiren.
A general computational tool for structure synthesis.
Degree: 2003, University of Saskatchewan
URL: http://hdl.handle.net/10388/etd-10062008-104305
► Synthesis of structures is a very difficult task even with only a small number of components that form a system; yet it is the catalyst…
(more)
▼ Synthesis of structures is a very difficult task even with only a small number of components that form a system; yet it is the catalyst of innovation. Molecular structures and nanostructures typically have a large number of similar components but different connections, which manifests a more challenging task for their synthesis.
This thesis presents a novel method and its related algorithms and computer programs for the synthesis of structures. This novel method is based on several concepts: (1) the structure is represented by a graph and further by the adjacency matrix; and (2) instead of only exploiting the eigenvalue of the adjacency matrix, both the eigenvalue and the
eigenvector are exploited; specifically the components of the
eigenvector have been found very useful in algorithm development. This novel method is called the Eigensystem method.
The complexity of the Eigensystem method is equal to that of the famous program called Nauty in the combinatorial world. However, the Eigensystem method can work for the weighted and both directed and undirected graph, while the Nauty program can only work for the non-weighted and both directed and undirected graph. The cause for this is the different philosophies underlying these two methods. The Nauty program is based on the recursive component decomposition strategy, which could involve some unmanageable complexities when dealing with the weighted graph, albeit no such an attempt has been reported in the literature. It is noted that in practical applications of structure synthesis, weighted graphs are more useful than non-weighted graphs for representing physical systems.
Pivoted at the Eigensystem method, this thesis presents the algorithms and computer programs for the three fundamental problems in structure synthesis, namely the isomorphism/automorphism, the unique labeling, and the enumeration of the structures or graphs.
Advisors/Committee Members: Zhang, W. J. (Chris), Takaya, Kunio, Dolovich, Allan T., Burton, Richard T..
Subjects/Keywords: structure synthesis; graph isomorphism; graph automorphism; eigenvector; eigenvalue; canonical labeling
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):
He, P. (2003). A general computational tool for structure synthesis. (Thesis). University of Saskatchewan. Retrieved from http://hdl.handle.net/10388/etd-10062008-104305
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):
He, Peiren. “A general computational tool for structure synthesis.” 2003. Thesis, University of Saskatchewan. Accessed April 14, 2021.
http://hdl.handle.net/10388/etd-10062008-104305.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
He, Peiren. “A general computational tool for structure synthesis.” 2003. Web. 14 Apr 2021.
Vancouver:
He P. A general computational tool for structure synthesis. [Internet] [Thesis]. University of Saskatchewan; 2003. [cited 2021 Apr 14].
Available from: http://hdl.handle.net/10388/etd-10062008-104305.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
He P. A general computational tool for structure synthesis. [Thesis]. University of Saskatchewan; 2003. Available from: http://hdl.handle.net/10388/etd-10062008-104305
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
26.
Mantell, Rosemary Genevieve.
Accelerated sampling of energy landscapes.
Degree: PhD, 2017, University of Cambridge
URL: https://www.repository.cam.ac.uk/handle/1810/267990
► In this project, various computational energy landscape methods were accelerated using graphics processing units (GPUs). Basin-hopping global optimisation was treated using a version of the…
(more)
▼ In this project, various computational energy landscape methods were accelerated using graphics processing units (GPUs). Basin-hopping global optimisation was treated using a version of the limited-memory BFGS algorithm adapted for CUDA, in combination with GPU-acceleration of the potential calculation. The Lennard-Jones potential was implemented using CUDA, and an interface to the GPU-accelerated AMBER potential was constructed. These results were then extended to form the basis of a GPU-accelerated version of hybrid eigenvector-following. The doubly-nudged elastic band method was also accelerated using an interface to the potential calculation on GPU. Additionally, a local rigid body framework was adapted for GPU hardware. Tests were performed for eight biomolecules represented using the AMBER potential, ranging in size from 81 to 22\,811 atoms, and the effects of minimiser history size and local rigidification on the overall efficiency were analysed. Improvements relative to CPU performance of up to two orders of magnitude were obtained for the largest systems. These methods have been successfully applied to both biological systems and atomic clusters.
An existing interface between a code for free energy basin-hopping and the SuiteSparse package for sparse Cholesky factorisation was refined, validated and tested. Tests were performed for both Lennard-Jones clusters and selected biomolecules represented using the AMBER potential. Significant acceleration of the vibrational frequency calculations was achieved, with negligible loss of accuracy, relative to the standard diagonalisation procedure. For the larger systems, exploiting sparsity reduces the computational cost by factors of 10 to 30.
The acceleration of these computational energy landscape methods opens up the possibility of investigating much larger and more complex systems than previously accessible. A wide array of new applications are now computationally feasible.
Subjects/Keywords: Energy landscapes; GPUs; Graphics processing units; GPU-acceleration; Basin-hopping global optimisation; Hybrid eigenvector-following; Doubly-nudged elastic band method; Sparse Cholesky factorisation; Sparse Cholesky decomposition; SuiteSparse; AMBER
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):
Mantell, R. G. (2017). Accelerated sampling of energy landscapes. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/267990
Chicago Manual of Style (16th Edition):
Mantell, Rosemary Genevieve. “Accelerated sampling of energy landscapes.” 2017. Doctoral Dissertation, University of Cambridge. Accessed April 14, 2021.
https://www.repository.cam.ac.uk/handle/1810/267990.
MLA Handbook (7th Edition):
Mantell, Rosemary Genevieve. “Accelerated sampling of energy landscapes.” 2017. Web. 14 Apr 2021.
Vancouver:
Mantell RG. Accelerated sampling of energy landscapes. [Internet] [Doctoral dissertation]. University of Cambridge; 2017. [cited 2021 Apr 14].
Available from: https://www.repository.cam.ac.uk/handle/1810/267990.
Council of Science Editors:
Mantell RG. Accelerated sampling of energy landscapes. [Doctoral Dissertation]. University of Cambridge; 2017. Available from: https://www.repository.cam.ac.uk/handle/1810/267990

University of Toronto
27.
Ho, Shen Yong.
Approximation Techniques for Large Finite Quantum Many-body Systems.
Degree: 2009, University of Toronto
URL: http://hdl.handle.net/1807/19277
► In this thesis, we will show how certain classes of quantum many-body Hamiltonians with \su{2}1 ⊕ \su{2}2 ⊕ … ⊕ \su{2}k spectrum generating algebras can…
(more)
▼ In this thesis, we will show how certain classes of quantum many-body Hamiltonians with \su{2}1 ⊕ \su{2}2 ⊕ … ⊕ \su{2}k spectrum generating algebras can be approximated by multi-dimensional shifted harmonic oscillator Hamiltonians. The dimensions of the Hilbert spaces of such Hamiltonians usually depend exponentially on k. This can make obtaining eigenvalues by diagonalization computationally challenging. The Shifted Harmonic Approximation (SHA) developed here gives good predictions of properties such as ground state energies, excitation energies and the most probable states in the lowest eigenstates. This is achieved by solving only a system of k equations and diagonalizing k × k matrices. The SHA gives accurate approximations over wide domains of parameters and in many cases even across phase transitions.
The SHA is first illustrated using the Lipkin-Meshkov-Glick (LMG) model and the Canonical Josephson Hamiltonian (CJH) which have \su{2} spectrum generating algebras. Next, we extend the technique to the non-compact \su{1,1} algebra, using the five-dimensional quartic oscillator (5DQO) as an example. Finally, the SHA is applied to a k-level Bardeen-Cooper-Shrieffer (BCS) pairing Hamiltonian with fixed particle number. The BCS model has a \su{2}1 ⊕ \su{2}2 ⊕ … ⊕ \su{2}k spectrum generating algebra.
An attractive feature of the SHA is that it also provides information to construct basis states which yield very accurate eigenvalues for low-lying states by diagonalizing Hamiltonians in small subspaces of huge Hilbert spaces. For Hamiltonians that involve a smaller number of operators, accurate eigenvalues can be obtained using another technique developed in this thesis: the generalized Rowe-Rosensteel-Kerman-Klein equations-of-motion method (RRKK). The RRKK is illustrated using the LMG and the 5DQO. In RRKK, solving unknowns in a set of 10 × 10 matrices typically gives estimates of the lowest few eigenvalues to an accuracy of at least eight significant figures. The RRKK involves optimization routines which require initial guesses of the matrix representations of the operators. In many cases, very good initial guesses can be obtained using the SHA.
The thesis concludes by exploring possible future developments of the SHA.
PhD
Advisors/Committee Members: Rowe, David J., Physics.
Subjects/Keywords: Quantum Many-body systems; Approximation Techniques; Algebraic Hamiltonian; Eigenvector; 0753; 0611; 0610; 0748
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):
Ho, S. Y. (2009). Approximation Techniques for Large Finite Quantum Many-body Systems. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/19277
Chicago Manual of Style (16th Edition):
Ho, Shen Yong. “Approximation Techniques for Large Finite Quantum Many-body Systems.” 2009. Doctoral Dissertation, University of Toronto. Accessed April 14, 2021.
http://hdl.handle.net/1807/19277.
MLA Handbook (7th Edition):
Ho, Shen Yong. “Approximation Techniques for Large Finite Quantum Many-body Systems.” 2009. Web. 14 Apr 2021.
Vancouver:
Ho SY. Approximation Techniques for Large Finite Quantum Many-body Systems. [Internet] [Doctoral dissertation]. University of Toronto; 2009. [cited 2021 Apr 14].
Available from: http://hdl.handle.net/1807/19277.
Council of Science Editors:
Ho SY. Approximation Techniques for Large Finite Quantum Many-body Systems. [Doctoral Dissertation]. University of Toronto; 2009. Available from: http://hdl.handle.net/1807/19277

Brno University of Technology
28.
Klimek, Jaroslav.
Řešení diferenčních rovnic a jejich vztah s transformací Z: Solution of difference equations and relation with Z-transform.
Degree: 2019, Brno University of Technology
URL: http://hdl.handle.net/11012/4924
► This dissertation presents the solution of difference equations and focuses on a method of difference equations solution with the aid of eigenvectors. The first part…
(more)
▼ This dissertation presents the solution of difference equations and focuses on a method of difference equations solution with the aid of eigenvectors. The first part reminds the basic terms from area of difference equations such as dynamic of difference equations and linear difference equations of first order and higher order. Then the second section recalls also the system of difference equations including the fundamental matrix and general solution description. Afterthat, the method of solving the difference equations with a variation of constants and transform of scalar equations to the system are shown. The second part of the dissertation analyses some known algorithms and methods for the solution of linear difference equations. The Z-transform, its importance and usage for finding the solution of difference equation is recalled. Then the discrete analogue of Putzer's algorithm is mentioned because this algorithm was often used to check the results obtained by the newly described algorithm in further parts of this thesis. Also some ways of the system matrix power are stated. The next section then describes the principle of Weyr's method which is the basic point for further development of the theory including the presentation of the research results gained by Jiří Čermák in this area. The third part describes own solution of the difference equations system via eigenvectors based on the principle of Weyr's method for differential equations. The solution of system of linear homogeneous difference equtions with constant coefficients including the proof is presented and this solution is then extended to nonhomogeneous systems. Consequently to the theory, the influence of a nulity and the multiplicity of roots on the form of the solution is discussed. The last section of this part shows the implementation of the algorithm in Matlab program (for basic simpler cases) and its application to some cases of difference equations and systems with these equations. The final part of the thesis is more practical and it presents the usage of the designed algorithm and theory. Firstly, the algorithm is compared with Z-transform and the method of variation of constants and it is illustrated how to obtain the same results by using these three approaches. Then an example of current response solution in RLC circuit is demonstrated. The continuous case is solved and then the problem is transferred to discrete case and solved with the Z-transform and the method of eigenvectors. The obtained results are compared with the result of the continuous case.
Advisors/Committee Members: Diblík, Josef (advisor), Smékal, Zdeněk (referee), Růžičková,, Miroslava (referee).
Subjects/Keywords: diferenční rovnice; vlastní vektor; transformace Z; implementace v programu Matlab; Putzerův algoritmus; Weyrova maticová metoda; difference equation; eigenvector; Z-transform; implementation in Matlab program; Putzer algorithm; Weyr's matrix method
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):
Klimek, J. (2019). Řešení diferenčních rovnic a jejich vztah s transformací Z: Solution of difference equations and relation with Z-transform. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/4924
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):
Klimek, Jaroslav. “Řešení diferenčních rovnic a jejich vztah s transformací Z: Solution of difference equations and relation with Z-transform.” 2019. Thesis, Brno University of Technology. Accessed April 14, 2021.
http://hdl.handle.net/11012/4924.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Klimek, Jaroslav. “Řešení diferenčních rovnic a jejich vztah s transformací Z: Solution of difference equations and relation with Z-transform.” 2019. Web. 14 Apr 2021.
Vancouver:
Klimek J. Řešení diferenčních rovnic a jejich vztah s transformací Z: Solution of difference equations and relation with Z-transform. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Apr 14].
Available from: http://hdl.handle.net/11012/4924.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Klimek J. Řešení diferenčních rovnic a jejich vztah s transformací Z: Solution of difference equations and relation with Z-transform. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/4924
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of South Florida
29.
Iezzi, Jana.
Multi-criteria decision making in outpatient scheduling.
Degree: 2006, University of South Florida
URL: https://scholarcommons.usf.edu/etd/2570
► Hospital ambulatory patients are seen in outpatient departments (OPDs) located in the hospital. 83.3 million visits were made to these departments in 2002. Many sources…
(more)
▼ Hospital ambulatory patients are seen in outpatient departments (OPDs) located in the hospital. 83.3 million visits were made to these departments in 2002. Many sources of patient waiting time exist including: poor coordination of information, inefficient scheduling, inaccurate time estimation and others. Well-designed and executed patient scheduling has the potential to remedy some of these problems. To properly schedule patients, variability in demand must be addressed. Patients may cancel appointments, arrive late and arrive without appointments. We address this problem based on a Multi-attribute Decision Making (MADM) approach. Decision models are developed using the Simple Additive Weighting (SAW) method to address scheduling decisions for late-arrival and walk-in patients and the operational decision of calling back patients from the waiting room.The models are developed as part of a case study at H.
Lee Moffitt Cancer Center and tested in a single-clinic computer simulation against the current clinic system decision process with respect to various performance measures.The proposed decision models successfully made walk-in and late patient scheduling decisions. The contributions of this research include identifying, defining and weighting of relevant decision making criteria at H. Lee Moffitt. Our decision models guaranteed all of the defined criteria are included every time a walk-in or late patient decision must be made. Based on the findings, implementation of the models with no reduction in number of patients would improve scheduling and operational decisions while not affecting clinic output measures.Using criteria to restrict the number of late and walk-in patients, on average, the clinic closed between 36.20 minutes and 47.95 minutes earlier. However, practitioner and room utilization suffered.
The tradeoff among number of patients seen, resource utilization, waiting time and clinic close time should be considered but cannot be fully assessed solely on the information gathered in this research. As a case study of H. Lee Moffitt Cancer Center, the decision models successfully incorporated all relevant patient criteria without adversely affecting the clinic system. Future research is needed to better understand what factors will impact system measures and expand the decision models to other outpatient clinic settings.
Subjects/Keywords: Healthcare; Clinic; Waiting time; Eigenvector method; Simulation; American Studies; Arts and Humanities
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):
Iezzi, J. (2006). Multi-criteria decision making in outpatient scheduling. (Thesis). University of South Florida. Retrieved from https://scholarcommons.usf.edu/etd/2570
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):
Iezzi, Jana. “Multi-criteria decision making in outpatient scheduling.” 2006. Thesis, University of South Florida. Accessed April 14, 2021.
https://scholarcommons.usf.edu/etd/2570.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Iezzi, Jana. “Multi-criteria decision making in outpatient scheduling.” 2006. Web. 14 Apr 2021.
Vancouver:
Iezzi J. Multi-criteria decision making in outpatient scheduling. [Internet] [Thesis]. University of South Florida; 2006. [cited 2021 Apr 14].
Available from: https://scholarcommons.usf.edu/etd/2570.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Iezzi J. Multi-criteria decision making in outpatient scheduling. [Thesis]. University of South Florida; 2006. Available from: https://scholarcommons.usf.edu/etd/2570
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
30.
Mantell, Rosemary Genevieve.
Accelerated sampling of energy landscapes.
Degree: PhD, 2017, University of Cambridge
URL: https://doi.org/10.17863/CAM.13921
;
https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.725618
► In this project, various computational energy landscape methods were accelerated using graphics processing units (GPUs). Basin-hopping global optimisation was treated using a version of the…
(more)
▼ In this project, various computational energy landscape methods were accelerated using graphics processing units (GPUs). Basin-hopping global optimisation was treated using a version of the limited-memory BFGS algorithm adapted for CUDA, in combination with GPU-acceleration of the potential calculation. The Lennard-Jones potential was implemented using CUDA, and an interface to the GPU-accelerated AMBER potential was constructed. These results were then extended to form the basis of a GPU-accelerated version of hybrid eigenvector-following. The doubly-nudged elastic band method was also accelerated using an interface to the potential calculation on GPU. Additionally, a local rigid body framework was adapted for GPU hardware. Tests were performed for eight biomolecules represented using the AMBER potential, ranging in size from 81 to 22\,811 atoms, and the effects of minimiser history size and local rigidification on the overall efficiency were analysed. Improvements relative to CPU performance of up to two orders of magnitude were obtained for the largest systems. These methods have been successfully applied to both biological systems and atomic clusters. An existing interface between a code for free energy basin-hopping and the SuiteSparse package for sparse Cholesky factorisation was refined, validated and tested. Tests were performed for both Lennard-Jones clusters and selected biomolecules represented using the AMBER potential. Significant acceleration of the vibrational frequency calculations was achieved, with negligible loss of accuracy, relative to the standard diagonalisation procedure. For the larger systems, exploiting sparsity reduces the computational cost by factors of 10 to 30. The acceleration of these computational energy landscape methods opens up the possibility of investigating much larger and more complex systems than previously accessible. A wide array of new applications are now computationally feasible.
Subjects/Keywords: 660.0285; Energy landscapes; GPUs; Graphics processing units; GPU-acceleration; Basin-hopping global optimisation; Hybrid eigenvector-following; Doubly-nudged elastic band method; Sparse Cholesky factorisation; Sparse Cholesky decomposition; SuiteSparse; AMBER
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):
Mantell, R. G. (2017). Accelerated sampling of energy landscapes. (Doctoral Dissertation). University of Cambridge. Retrieved from https://doi.org/10.17863/CAM.13921 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.725618
Chicago Manual of Style (16th Edition):
Mantell, Rosemary Genevieve. “Accelerated sampling of energy landscapes.” 2017. Doctoral Dissertation, University of Cambridge. Accessed April 14, 2021.
https://doi.org/10.17863/CAM.13921 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.725618.
MLA Handbook (7th Edition):
Mantell, Rosemary Genevieve. “Accelerated sampling of energy landscapes.” 2017. Web. 14 Apr 2021.
Vancouver:
Mantell RG. Accelerated sampling of energy landscapes. [Internet] [Doctoral dissertation]. University of Cambridge; 2017. [cited 2021 Apr 14].
Available from: https://doi.org/10.17863/CAM.13921 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.725618.
Council of Science Editors:
Mantell RG. Accelerated sampling of energy landscapes. [Doctoral Dissertation]. University of Cambridge; 2017. Available from: https://doi.org/10.17863/CAM.13921 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.725618
◁ [1] [2] [3] ▶
.