Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(group divisible covering desings)`

.
Showing records 1 – 30 of
11684 total matches.

◁ [1] [2] [3] [4] [5] … [390] ▶

Search Limiters

Dates

- 2016 – 2020 (3061)
- 2011 – 2015 (4229)
- 2006 – 2010 (2482)
- 2001 – 2005 (863)
- 1996 – 2000 (447)
- 1991 – 1995 (263)
- 1986 – 1990 (240)
- 1981 – 1985 (194)
- 1976 – 1980 (185)
- 1971 – 1975 (254)

Universities

- University of Florida (249)
- University of São Paulo (214)
- Brno University of Technology (200)
- University of Pretoria (182)
- University of Hong Kong (179)
- Michigan State University (168)
- NSYSU (155)
- The Ohio State University (148)
- University of Michigan (136)
- Virginia Tech (134)
- University of South Africa (125)
- North Texas State University (109)
- ETH Zürich (108)
- University of Georgia (97)
- Brigham Young University (96)

Department

- Mathematics (281)
- Psychology (250)
- Education (91)
- Chemistry (87)
- Graduate School (86)
- Mathématiques (83)
- Sociology (66)
- Computer Science (63)
- Physics (55)
- Political Science (48)
- Social Work (46)
- Department of Mathematics (43)
- Geology (41)
- Counselor Education (39)
- Communication (38)

Degrees

- PhD (2274)
- MS (578)
- Docteur es (485)
- MA (426)
- Master (265)
- Mestrado (122)
- EdD (80)
- MSW (42)
- MSEd (33)
- MSc (32)
- MEd (27)
- Doctor of Education (EdD) (25)
- Doctor of Psychology (PsyD) (20)
- MAin Education (17)
- MAin Mathematics (16)

Levels

- doctoral (3978)
- masters (2180)
- thesis (203)
- project (47)
- dissertation (20)
- doctor of philosophy ph.d. (14)

Languages

Country

- US (4799)
- Canada (826)
- Brazil (753)
- Sweden (712)
- South Africa (630)
- France (485)
- UK (475)
- Australia (417)
- Netherlands (327)
- Portugal (222)
- Czech Republic (201)
- Hong Kong (190)
- New Zealand (184)
- Taiwan (155)
- Greece (134)

▼ Search Limiters

1.
Francetic, Nevena.
* Covering* Arrays with Row Limit.

Degree: 2012, University of Toronto

URL: http://hdl.handle.net/1807/34006

►

*Covering* arrays with row limit, CARLs, are a new family of combinatorial objects which we introduce as a generalization of *group* *divisible* designs and *covering*…
(more)

Subjects/Keywords: group divisible designs; covering arrays; group divisible covering desings; graph covering problem; packing arrays; group divisible packing designs; 0405

…u2
us
of type g1
g2 . . . gs
GDCD
*group* *divisible* *covering* design
27
GDP D
*group*… …we introduce as a generalization of *group* *divisible* designs and *covering*
arrays, two well… …characteristics of *group* *divisible* designs and *covering*
arrays which lead to the definition and study of… …is a constant, we construct *group* *divisible*
*covering* designs with block size four rather… …*covering* designs.
Definition 3.3. A *group* *divisible* *covering* design, a GDCD for short, with index…

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Francetic, N. (2012). Covering Arrays with Row Limit. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/34006

Chicago Manual of Style (16^{th} Edition):

Francetic, Nevena. “Covering Arrays with Row Limit.” 2012. Doctoral Dissertation, University of Toronto. Accessed September 28, 2020. http://hdl.handle.net/1807/34006.

MLA Handbook (7^{th} Edition):

Francetic, Nevena. “Covering Arrays with Row Limit.” 2012. Web. 28 Sep 2020.

Vancouver:

Francetic N. Covering Arrays with Row Limit. [Internet] [Doctoral dissertation]. University of Toronto; 2012. [cited 2020 Sep 28]. Available from: http://hdl.handle.net/1807/34006.

Council of Science Editors:

Francetic N. Covering Arrays with Row Limit. [Doctoral Dissertation]. University of Toronto; 2012. Available from: http://hdl.handle.net/1807/34006

University of Arizona

2.
Henniges, Alex Jay.
Kisin-Ren Classification of ϖ-*divisible* O-modules via the Dieudonné Crystal
.

Degree: 2016, University of Arizona

URL: http://hdl.handle.net/10150/613179

► Let k be a perfect field of characteristic p > 2 and K a totally ramified extension of K₀ = Frac W(k) with uniformizer π.…
(more)

Subjects/Keywords: crystal; divided powers; divisible modules; p-divisible group; Mathematics; Breuil modules

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Henniges, A. J. (2016). Kisin-Ren Classification of ϖ-divisible O-modules via the Dieudonné Crystal . (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/613179

Chicago Manual of Style (16^{th} Edition):

Henniges, Alex Jay. “Kisin-Ren Classification of ϖ-divisible O-modules via the Dieudonné Crystal .” 2016. Doctoral Dissertation, University of Arizona. Accessed September 28, 2020. http://hdl.handle.net/10150/613179.

MLA Handbook (7^{th} Edition):

Henniges, Alex Jay. “Kisin-Ren Classification of ϖ-divisible O-modules via the Dieudonné Crystal .” 2016. Web. 28 Sep 2020.

Vancouver:

Henniges AJ. Kisin-Ren Classification of ϖ-divisible O-modules via the Dieudonné Crystal . [Internet] [Doctoral dissertation]. University of Arizona; 2016. [cited 2020 Sep 28]. Available from: http://hdl.handle.net/10150/613179.

Council of Science Editors:

Henniges AJ. Kisin-Ren Classification of ϖ-divisible O-modules via the Dieudonné Crystal . [Doctoral Dissertation]. University of Arizona; 2016. Available from: http://hdl.handle.net/10150/613179

3.
Rao, P Ramachandra.
On construction of second order rotatable and *group*
*divisible* rotatable designs through incomplete block
designs; -.

Degree: Stastistics, 1984, Sri Venkateswara University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/42637

Subjects/Keywords: Block designs; Construction; Divisible; Group; Rotatable

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Rao, P. R. (1984). On construction of second order rotatable and group divisible rotatable designs through incomplete block designs; -. (Thesis). Sri Venkateswara University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/42637

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Rao, P Ramachandra. “On construction of second order rotatable and group divisible rotatable designs through incomplete block designs; -.” 1984. Thesis, Sri Venkateswara University. Accessed September 28, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/42637.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Rao, P Ramachandra. “On construction of second order rotatable and group divisible rotatable designs through incomplete block designs; -.” 1984. Web. 28 Sep 2020.

Vancouver:

Rao PR. On construction of second order rotatable and group divisible rotatable designs through incomplete block designs; -. [Internet] [Thesis]. Sri Venkateswara University; 1984. [cited 2020 Sep 28]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/42637.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rao PR. On construction of second order rotatable and group divisible rotatable designs through incomplete block designs; -. [Thesis]. Sri Venkateswara University; 1984. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/42637

Not specified: Masters Thesis or Doctoral Dissertation

Université Paris-Sud – Paris XI

4.
Chen, Miaofen.
Le morphisme déterminant pour les espaces de modules de groupes p-divisibles : The determinant morphism for the moduli spaces of p-*divisible* groups.

Degree: Docteur es, Mathématiques, 2011, Université Paris-Sud – Paris XI

URL: http://www.theses.fr/2011PA112058

►

Soit \M un espace de modules de groupes p-divisibles introduit par Rapoport et Zink. Supposons que cet espace \M soit non-ramifié de type EL ou… (more)

Subjects/Keywords: Composante connexe géométrique; Espace analytique rigide; Espace de Rapoport-Zink; Groupe p-divisible; Morphisme déterminant; Determinant morphism; Geometrically connected component; P-divisible group; Rapoport-Zink space; Rigid analytic space

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Chen, M. (2011). Le morphisme déterminant pour les espaces de modules de groupes p-divisibles : The determinant morphism for the moduli spaces of p-divisible groups. (Doctoral Dissertation). Université Paris-Sud – Paris XI. Retrieved from http://www.theses.fr/2011PA112058

Chicago Manual of Style (16^{th} Edition):

Chen, Miaofen. “Le morphisme déterminant pour les espaces de modules de groupes p-divisibles : The determinant morphism for the moduli spaces of p-divisible groups.” 2011. Doctoral Dissertation, Université Paris-Sud – Paris XI. Accessed September 28, 2020. http://www.theses.fr/2011PA112058.

MLA Handbook (7^{th} Edition):

Chen, Miaofen. “Le morphisme déterminant pour les espaces de modules de groupes p-divisibles : The determinant morphism for the moduli spaces of p-divisible groups.” 2011. Web. 28 Sep 2020.

Vancouver:

Chen M. Le morphisme déterminant pour les espaces de modules de groupes p-divisibles : The determinant morphism for the moduli spaces of p-divisible groups. [Internet] [Doctoral dissertation]. Université Paris-Sud – Paris XI; 2011. [cited 2020 Sep 28]. Available from: http://www.theses.fr/2011PA112058.

Council of Science Editors:

Chen M. Le morphisme déterminant pour les espaces de modules de groupes p-divisibles : The determinant morphism for the moduli spaces of p-divisible groups. [Doctoral Dissertation]. Université Paris-Sud – Paris XI; 2011. Available from: http://www.theses.fr/2011PA112058

5. Bruno Formiga Guimarães. Extensões de Homomorfismos de Subgrupos a Endomorfismos doGrupo.

Degree: 2010, Universidade Federal da Paraíba

URL: http://bdtd.biblioteca.ufpb.br/tde_busca/arquivo.php?codArquivo=1273

►

Bertholf e Walls forneceram uma caracterização para a classe de grupos quasi-injetivos finitos. Além disso, Juriaans, Bastos e Azevedo dão uma classificação para os grupos… (more)

Subjects/Keywords: Grupo quasi-injetivo; injetivo; tipo inetivo; divisível; abeliano; MATEMATICA; Quasi-injective group; injective; injective type; divisible; abelian

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Guimarães, B. F. (2010). Extensões de Homomorfismos de Subgrupos a Endomorfismos doGrupo. (Thesis). Universidade Federal da Paraíba. Retrieved from http://bdtd.biblioteca.ufpb.br/tde_busca/arquivo.php?codArquivo=1273

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Guimarães, Bruno Formiga. “Extensões de Homomorfismos de Subgrupos a Endomorfismos doGrupo.” 2010. Thesis, Universidade Federal da Paraíba. Accessed September 28, 2020. http://bdtd.biblioteca.ufpb.br/tde_busca/arquivo.php?codArquivo=1273.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Guimarães, Bruno Formiga. “Extensões de Homomorfismos de Subgrupos a Endomorfismos doGrupo.” 2010. Web. 28 Sep 2020.

Vancouver:

Guimarães BF. Extensões de Homomorfismos de Subgrupos a Endomorfismos doGrupo. [Internet] [Thesis]. Universidade Federal da Paraíba; 2010. [cited 2020 Sep 28]. Available from: http://bdtd.biblioteca.ufpb.br/tde_busca/arquivo.php?codArquivo=1273.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Guimarães BF. Extensões de Homomorfismos de Subgrupos a Endomorfismos doGrupo. [Thesis]. Universidade Federal da Paraíba; 2010. Available from: http://bdtd.biblioteca.ufpb.br/tde_busca/arquivo.php?codArquivo=1273

Not specified: Masters Thesis or Doctoral Dissertation

6.
Sun, Xinyun.
CM p-*divisible* Groups over Finite Fields.

Degree: PhD, Mathematics, 2011, University of Michigan

URL: http://hdl.handle.net/2027.42/84531

► The primary motivation for this dissertation is to further the study of CM lifting of abelian varieties based on work by Chai, Conrad, and Oort.…
(more)

Subjects/Keywords: CM P-divisible Group; Mathematics; Science

…schemes.
Remark II.2. A p-*divisible* *group* is also known by the term Barsotti-Tate *group*.
13… …x7B;A[pn ]}n≥0 forms a p-*divisible* *group* of height 2g. We denote this… …pdivisible *group* by A[p∞ ].
Let G = lim(Gn , in ) be a p-*divisible* *group* over a… …*divisible* *group* over a field k of characteristic p > 0. We say that
H admits a CM lifting if there… …is a p-*divisible* *group* H of CM type over a complete
Noetherian local domain R of generic…

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Sun, X. (2011). CM p-divisible Groups over Finite Fields. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/84531

Chicago Manual of Style (16^{th} Edition):

Sun, Xinyun. “CM p-divisible Groups over Finite Fields.” 2011. Doctoral Dissertation, University of Michigan. Accessed September 28, 2020. http://hdl.handle.net/2027.42/84531.

MLA Handbook (7^{th} Edition):

Sun, Xinyun. “CM p-divisible Groups over Finite Fields.” 2011. Web. 28 Sep 2020.

Vancouver:

Sun X. CM p-divisible Groups over Finite Fields. [Internet] [Doctoral dissertation]. University of Michigan; 2011. [cited 2020 Sep 28]. Available from: http://hdl.handle.net/2027.42/84531.

Council of Science Editors:

Sun X. CM p-divisible Groups over Finite Fields. [Doctoral Dissertation]. University of Michigan; 2011. Available from: http://hdl.handle.net/2027.42/84531

University of Alabama

7. Green, Michael Timothy. Graphs of groups.

Degree: 2012, University of Alabama

URL: http://purl.lib.ua.edu/55036

► Graphs of groups were first introduced by Jean-Pierre Serre in his book entitled Arbres, Amalgames, SL2 (1977), whose first English translation was Trees in 1980.…
(more)

Subjects/Keywords: Electronic Thesis or Dissertation; – thesis; Mathematics; covering; graph; graphs of groups; group; path; path-lifting

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Green, M. T. (2012). Graphs of groups. (Thesis). University of Alabama. Retrieved from http://purl.lib.ua.edu/55036

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Green, Michael Timothy. “Graphs of groups.” 2012. Thesis, University of Alabama. Accessed September 28, 2020. http://purl.lib.ua.edu/55036.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Green, Michael Timothy. “Graphs of groups.” 2012. Web. 28 Sep 2020.

Vancouver:

Green MT. Graphs of groups. [Internet] [Thesis]. University of Alabama; 2012. [cited 2020 Sep 28]. Available from: http://purl.lib.ua.edu/55036.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Green MT. Graphs of groups. [Thesis]. University of Alabama; 2012. Available from: http://purl.lib.ua.edu/55036

Not specified: Masters Thesis or Doctoral Dissertation

Boston College

8.
Cai, Yuanqing.
Theta representations on *covering* groups.

Degree: PhD, Mathematics, 2017, Boston College

URL: http://dlib.bc.edu/islandora/object/bc-ir:107492

► Kazhdan and Patterson constructed generalized theta representations on covers of general linear groups as multi-residues of the Borel Eisenstein series. For the double covers, these…
(more)

Subjects/Keywords: covering group; doubling construction; Fourier coefficient; semi-Whittaker coefficient; Theta representation; unipotent orbit

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Cai, Y. (2017). Theta representations on covering groups. (Doctoral Dissertation). Boston College. Retrieved from http://dlib.bc.edu/islandora/object/bc-ir:107492

Chicago Manual of Style (16^{th} Edition):

Cai, Yuanqing. “Theta representations on covering groups.” 2017. Doctoral Dissertation, Boston College. Accessed September 28, 2020. http://dlib.bc.edu/islandora/object/bc-ir:107492.

MLA Handbook (7^{th} Edition):

Cai, Yuanqing. “Theta representations on covering groups.” 2017. Web. 28 Sep 2020.

Vancouver:

Cai Y. Theta representations on covering groups. [Internet] [Doctoral dissertation]. Boston College; 2017. [cited 2020 Sep 28]. Available from: http://dlib.bc.edu/islandora/object/bc-ir:107492.

Council of Science Editors:

Cai Y. Theta representations on covering groups. [Doctoral Dissertation]. Boston College; 2017. Available from: http://dlib.bc.edu/islandora/object/bc-ir:107492

Mahatma Gandhi University

9. Joseph, O C. Some problems in block designs and optimality criteria; -.

Degree: Statistics, 2013, Mahatma Gandhi University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/7128

►

Jacroux (1985) extended the definition of Regular graph (RG) designs of Mitchell and John (1976) to Semi-regular graph (SRG) designs, and studied the type 1… (more)

Subjects/Keywords: Eand#8722; optimality.; Balanced Incomplete Block (BIB) Design; Symmetrical Balanced Incomplete Block (SBIB) Design; Semi-Regular Graph (SRG) Design; Regular Graph (RG) Design; Group Divisible (GD) Design; Dual Designs; Balanced Treatment Incomplete Block (BTIB) Design; Group Divisible Treatment (GDT) Design; Partially Efficiency Balanced (PEB) Design

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Joseph, O. C. (2013). Some problems in block designs and optimality criteria; -. (Thesis). Mahatma Gandhi University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/7128

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Joseph, O C. “Some problems in block designs and optimality criteria; -.” 2013. Thesis, Mahatma Gandhi University. Accessed September 28, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/7128.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Joseph, O C. “Some problems in block designs and optimality criteria; -.” 2013. Web. 28 Sep 2020.

Vancouver:

Joseph OC. Some problems in block designs and optimality criteria; -. [Internet] [Thesis]. Mahatma Gandhi University; 2013. [cited 2020 Sep 28]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/7128.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Joseph OC. Some problems in block designs and optimality criteria; -. [Thesis]. Mahatma Gandhi University; 2013. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/7128

Not specified: Masters Thesis or Doctoral Dissertation

10.
Elliot, Jason W.
Central extensions of *divisible* groups.

Degree: PhD, 0439, 2011, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/24095

► This thesis contributes to the classification of central extensions of *divisible* groups with finite abelian quotient, so called ``d-ab extensions.'' We give a matrix classification…
(more)

Subjects/Keywords: divisible groups; central extensions; nilpotent groups; group extensions

…equivalence classes of *group* extensions
E (Q, K)
Eϕ (Q, K)
E0 (Q, K)… …The set of degeneracies for ξe
Aξ
The domain of ξtgt
ZG
The integral *group* ring of G
A… …*divisible* and torsion and Q is finite abelian. One reason for our
interest in these groups is that… …every finite nilpotent *group* of class 2 embeds into
such a *group* in a nice way (… …Proposition 2.1.3). There is a similar embedding
property for a class-c nilpotent *group* (…

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Elliot, J. W. (2011). Central extensions of divisible groups. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/24095

Chicago Manual of Style (16^{th} Edition):

Elliot, Jason W. “Central extensions of divisible groups.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed September 28, 2020. http://hdl.handle.net/2142/24095.

MLA Handbook (7^{th} Edition):

Elliot, Jason W. “Central extensions of divisible groups.” 2011. Web. 28 Sep 2020.

Vancouver:

Elliot JW. Central extensions of divisible groups. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2020 Sep 28]. Available from: http://hdl.handle.net/2142/24095.

Council of Science Editors:

Elliot JW. Central extensions of divisible groups. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/24095

11. JardÃnia Sobrinho Goes. Sobre grupos unicamente cobertos.

Degree: Master, 2011, Universidade Federal do Ceará

URL: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=8686 ;

►

Este trabalho Ã baseado no artigo "Uniquely Covered Groups" de M. A. Brodie, que investiga grupos finitos que possuem uma Ãnica cobertura irredundante por subgrupos… (more)

Subjects/Keywords: irredundant; finite covering; subgrupo maximal; partiÃÃo; irredundante; cobertura finita; ALGEBRA; partition; maximal subgroup; teoria dos grupos; grupos finitos; group theory; finite groups

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Goes, J. S. (2011). Sobre grupos unicamente cobertos. (Masters Thesis). Universidade Federal do Ceará. Retrieved from http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=8686 ;

Chicago Manual of Style (16^{th} Edition):

Goes, JardÃnia Sobrinho. “Sobre grupos unicamente cobertos.” 2011. Masters Thesis, Universidade Federal do Ceará. Accessed September 28, 2020. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=8686 ;.

MLA Handbook (7^{th} Edition):

Goes, JardÃnia Sobrinho. “Sobre grupos unicamente cobertos.” 2011. Web. 28 Sep 2020.

Vancouver:

Goes JS. Sobre grupos unicamente cobertos. [Internet] [Masters thesis]. Universidade Federal do Ceará 2011. [cited 2020 Sep 28]. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=8686 ;.

Council of Science Editors:

Goes JS. Sobre grupos unicamente cobertos. [Masters Thesis]. Universidade Federal do Ceará 2011. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=8686 ;

12. Fernanda Palhares Maríngolo. Grupo de tranças e espaços de configurações.

Degree: 2007, Universidade Federal de São Carlos

URL: http://www.bdtd.ufscar.br/htdocs/tedeSimplificado//tde_busca/arquivo.php?codArquivo=1552

►

In this work, we study the Artin braid *group*, B(n), and the confguration spaces (ordered and unordered) of a path connected manifold of dimension 2.…
(more)

Subjects/Keywords: Recobrimento; Espaço de configurações; Trança; Teorema de Borsuk-Ulam; Topologia algébrica; Configuration spaces; Borsuk-Ulam Theorem; Braids; Group actions; TOPOLOGIA ALGEBRICA; Homotopy; Covering spaces; Eilenberg-MacLane spaces

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Maríngolo, F. P. (2007). Grupo de tranças e espaços de configurações. (Thesis). Universidade Federal de São Carlos. Retrieved from http://www.bdtd.ufscar.br/htdocs/tedeSimplificado//tde_busca/arquivo.php?codArquivo=1552

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Maríngolo, Fernanda Palhares. “Grupo de tranças e espaços de configurações.” 2007. Thesis, Universidade Federal de São Carlos. Accessed September 28, 2020. http://www.bdtd.ufscar.br/htdocs/tedeSimplificado//tde_busca/arquivo.php?codArquivo=1552.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Maríngolo, Fernanda Palhares. “Grupo de tranças e espaços de configurações.” 2007. Web. 28 Sep 2020.

Vancouver:

Maríngolo FP. Grupo de tranças e espaços de configurações. [Internet] [Thesis]. Universidade Federal de São Carlos; 2007. [cited 2020 Sep 28]. Available from: http://www.bdtd.ufscar.br/htdocs/tedeSimplificado//tde_busca/arquivo.php?codArquivo=1552.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Maríngolo FP. Grupo de tranças e espaços de configurações. [Thesis]. Universidade Federal de São Carlos; 2007. Available from: http://www.bdtd.ufscar.br/htdocs/tedeSimplificado//tde_busca/arquivo.php?codArquivo=1552

Not specified: Masters Thesis or Doctoral Dissertation

13.
Reese, Randall Dean.
Topics Pertaining to the *Group* Matrix: k-Characters and Random Walks.

Degree: MS, 2015, Brigham Young University

URL: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=6569&context=etd

► Linear characters of finite groups can be extended to take k operands. The basics of such a k-fold extension are detailed. We then examine a…
(more)

Subjects/Keywords: k-characters; group determinant; random walks; branched covering; Mathematics

…*group* algebra CG. Explicitly,
G = {g1 , g2 , . . . , gn } (these forming the… …*group* G, let Irr(G) = {χ1 , χ2 , . . . , χk }. The regular character
π can… …x5B;31, p. 19] The number of irreducible characters of a *group* G is equal to the
number… …x29; for use in factoring the *group* determinant.
Chapter 2 will further explicate this topic… …character table of a *group* G is an invertible matrix.
Example. A *group* of relative importance in…

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Reese, R. D. (2015). Topics Pertaining to the Group Matrix: k-Characters and Random Walks. (Masters Thesis). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=6569&context=etd

Chicago Manual of Style (16^{th} Edition):

Reese, Randall Dean. “Topics Pertaining to the Group Matrix: k-Characters and Random Walks.” 2015. Masters Thesis, Brigham Young University. Accessed September 28, 2020. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=6569&context=etd.

MLA Handbook (7^{th} Edition):

Reese, Randall Dean. “Topics Pertaining to the Group Matrix: k-Characters and Random Walks.” 2015. Web. 28 Sep 2020.

Vancouver:

Reese RD. Topics Pertaining to the Group Matrix: k-Characters and Random Walks. [Internet] [Masters thesis]. Brigham Young University; 2015. [cited 2020 Sep 28]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=6569&context=etd.

Council of Science Editors:

Reese RD. Topics Pertaining to the Group Matrix: k-Characters and Random Walks. [Masters Thesis]. Brigham Young University; 2015. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=6569&context=etd

14. Alkhalifa, Loay. Locating a Minisum Annulus.

Degree: MSc (MS/Maîtrise ès sciences), Mathematics/Mathématiques, 2014, Royal Military College of Canada

URL: http://hdl.handle.net/11264/201

►

The problem is to find the best location of a minisum annulus with given width using the partial coverage distance model. The concept of partial… (more)

Subjects/Keywords: minisum; minimax; covering; partial covering; annulus; strip

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Alkhalifa, L. (2014). Locating a Minisum Annulus. (Masters Thesis). Royal Military College of Canada. Retrieved from http://hdl.handle.net/11264/201

Chicago Manual of Style (16^{th} Edition):

Alkhalifa, Loay. “Locating a Minisum Annulus.” 2014. Masters Thesis, Royal Military College of Canada. Accessed September 28, 2020. http://hdl.handle.net/11264/201.

MLA Handbook (7^{th} Edition):

Alkhalifa, Loay. “Locating a Minisum Annulus.” 2014. Web. 28 Sep 2020.

Vancouver:

Alkhalifa L. Locating a Minisum Annulus. [Internet] [Masters thesis]. Royal Military College of Canada; 2014. [cited 2020 Sep 28]. Available from: http://hdl.handle.net/11264/201.

Council of Science Editors:

Alkhalifa L. Locating a Minisum Annulus. [Masters Thesis]. Royal Military College of Canada; 2014. Available from: http://hdl.handle.net/11264/201

Oregon State University

15.
Golbabaei, Sanaz.
Branched *Covering* Space Construction and Visualization.

Degree: MS, Computer Science, 2016, Oregon State University

URL: http://hdl.handle.net/1957/59174

► Branched *covering* spaces are a mathematical concept which originates from complex analysis and topology and has found applications in tensor ﬁeld topology and geometry re-meshing.…
(more)

Subjects/Keywords: branched covering space; Covering spaces (Topology)

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Golbabaei, S. (2016). Branched Covering Space Construction and Visualization. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/59174

Chicago Manual of Style (16^{th} Edition):

Golbabaei, Sanaz. “Branched Covering Space Construction and Visualization.” 2016. Masters Thesis, Oregon State University. Accessed September 28, 2020. http://hdl.handle.net/1957/59174.

MLA Handbook (7^{th} Edition):

Golbabaei, Sanaz. “Branched Covering Space Construction and Visualization.” 2016. Web. 28 Sep 2020.

Vancouver:

Golbabaei S. Branched Covering Space Construction and Visualization. [Internet] [Masters thesis]. Oregon State University; 2016. [cited 2020 Sep 28]. Available from: http://hdl.handle.net/1957/59174.

Council of Science Editors:

Golbabaei S. Branched Covering Space Construction and Visualization. [Masters Thesis]. Oregon State University; 2016. Available from: http://hdl.handle.net/1957/59174

Virginia Tech

16. Wang, Xiaowei. Weighted Optimality of Block Designs.

Degree: PhD, Statistics, 2009, Virginia Tech

URL: http://hdl.handle.net/10919/26168

► Design optimality for treatment comparison experiments has been intensively studied by numerous researchers, employing a variety of statistically sound criteria. Their general formulation is based…
(more)

Subjects/Keywords: Generalized group divisible design; Weighted A-optimality; Incomplete block design; Weighted E-optimality; Weighted MV-optimality

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Wang, X. (2009). Weighted Optimality of Block Designs. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/26168

Chicago Manual of Style (16^{th} Edition):

Wang, Xiaowei. “Weighted Optimality of Block Designs.” 2009. Doctoral Dissertation, Virginia Tech. Accessed September 28, 2020. http://hdl.handle.net/10919/26168.

MLA Handbook (7^{th} Edition):

Wang, Xiaowei. “Weighted Optimality of Block Designs.” 2009. Web. 28 Sep 2020.

Vancouver:

Wang X. Weighted Optimality of Block Designs. [Internet] [Doctoral dissertation]. Virginia Tech; 2009. [cited 2020 Sep 28]. Available from: http://hdl.handle.net/10919/26168.

Council of Science Editors:

Wang X. Weighted Optimality of Block Designs. [Doctoral Dissertation]. Virginia Tech; 2009. Available from: http://hdl.handle.net/10919/26168

University of Victoria

17. Chan, Justin. Asymptotic existence results on specific graph decompositions.

Degree: Dept. of Mathematics and Statistics, 2010, University of Victoria

URL: http://hdl.handle.net/1828/2909

► This work examines various asymptotic edge-decomposition problems on graphs. A G-*group* *divisible* design (G-GDD) of type [g_1, ..., g_u] and index lambda is a decomposition…
(more)

Subjects/Keywords: combinatorics; combinatorial; design; graph; frame; frames; designs; resolvable; group; divisible; UVic Subject Index::Sciences and Engineering::Mathematics::Pure mathematics

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Chan, J. (2010). Asymptotic existence results on specific graph decompositions. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/2909

Chicago Manual of Style (16^{th} Edition):

Chan, Justin. “Asymptotic existence results on specific graph decompositions.” 2010. Masters Thesis, University of Victoria. Accessed September 28, 2020. http://hdl.handle.net/1828/2909.

MLA Handbook (7^{th} Edition):

Chan, Justin. “Asymptotic existence results on specific graph decompositions.” 2010. Web. 28 Sep 2020.

Vancouver:

Chan J. Asymptotic existence results on specific graph decompositions. [Internet] [Masters thesis]. University of Victoria; 2010. [cited 2020 Sep 28]. Available from: http://hdl.handle.net/1828/2909.

Council of Science Editors:

Chan J. Asymptotic existence results on specific graph decompositions. [Masters Thesis]. University of Victoria; 2010. Available from: http://hdl.handle.net/1828/2909

18. Stapleton, Nathaniel J. Transchromatic generalized character maps.

Degree: PhD, 0439, 2011, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/26269

► In "Generalized *Group* Characters and Complex Oriented Cohomology Theories", Hopkins, Kuhn, and Ravenel discovered a generalized character theory that proved useful in studying cohomology rings…
(more)

Subjects/Keywords: Algebraic Topology; Stable Homotopy Theory; Generalized Cohomology Theory; p-Divisible Group; Barsotti-Tate Group; Morava E-theory

…can be rephrased in the language of p-*divisible* groups. Let R be a ring. A p-*divisible* *group*… …multiplication by pv in Gv+1 .
Associated to every formal *group*, G, over R is a p-*divisible* *group*
G
i… …GEn pulls back to a constant p-*divisible* *group*.
For GEn , we have OGEn [pk ]… …*divisible* *group*. Rezk noted that there are higher analogues of this: Fix an integer
t such that 0… …torsion of a p-*divisible* *group*, G,
over LK(t) En∗ .
3
Associated to G is a short…

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Stapleton, N. J. (2011). Transchromatic generalized character maps. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/26269

Chicago Manual of Style (16^{th} Edition):

Stapleton, Nathaniel J. “Transchromatic generalized character maps.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed September 28, 2020. http://hdl.handle.net/2142/26269.

MLA Handbook (7^{th} Edition):

Stapleton, Nathaniel J. “Transchromatic generalized character maps.” 2011. Web. 28 Sep 2020.

Vancouver:

Stapleton NJ. Transchromatic generalized character maps. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2020 Sep 28]. Available from: http://hdl.handle.net/2142/26269.

Council of Science Editors:

Stapleton NJ. Transchromatic generalized character maps. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/26269

University of Iowa

19.
Bandyapadhyay, Sayan.
Digging deeper into clustering and *covering* problems.

Degree: PhD, Computer Science, 2019, University of Iowa

URL: https://ir.uiowa.edu/etd/6700

► Clustering problems often arise in the fields like data mining, machine learning and computational biology to *group* a collection of objects into similar groups…
(more)

Subjects/Keywords: Approximation; Clustering; Covering; Inapproximability; Optimization

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Bandyapadhyay, S. (2019). Digging deeper into clustering and covering problems. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/6700

Chicago Manual of Style (16^{th} Edition):

Bandyapadhyay, Sayan. “Digging deeper into clustering and covering problems.” 2019. Doctoral Dissertation, University of Iowa. Accessed September 28, 2020. https://ir.uiowa.edu/etd/6700.

MLA Handbook (7^{th} Edition):

Bandyapadhyay, Sayan. “Digging deeper into clustering and covering problems.” 2019. Web. 28 Sep 2020.

Vancouver:

Bandyapadhyay S. Digging deeper into clustering and covering problems. [Internet] [Doctoral dissertation]. University of Iowa; 2019. [cited 2020 Sep 28]. Available from: https://ir.uiowa.edu/etd/6700.

Council of Science Editors:

Bandyapadhyay S. Digging deeper into clustering and covering problems. [Doctoral Dissertation]. University of Iowa; 2019. Available from: https://ir.uiowa.edu/etd/6700

Vilnius University

20. Zachaževski, Stanislav. Nežinomų teritorijų tyrinėjimas naudojant savaeigius robotizuotus mechanizmus.

Degree: Master, 2010, Vilnius University

URL: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2009~D_20101125_190737-99166 ;

►

Nežinomo ploto dengimas yra aktuali ir paplitusi problema. NPD sprendimas realiuose robotuose susiduria su daviklių ir mechanizmų netikslumu. Atliktame darbe yra pateiktas „Bouncing“ NPD algoritmo… (more)

Subjects/Keywords: Area Coverage; Covering salesman; Robotic

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Zachaževski, Stanislav. (2010). Nežinomų teritorijų tyrinėjimas naudojant savaeigius robotizuotus mechanizmus. (Masters Thesis). Vilnius University. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2009~D_20101125_190737-99166 ;

Note: this citation may be lacking information needed for this citation format:

Author name may be incomplete

Chicago Manual of Style (16^{th} Edition):

Zachaževski, Stanislav. “Nežinomų teritorijų tyrinėjimas naudojant savaeigius robotizuotus mechanizmus.” 2010. Masters Thesis, Vilnius University. Accessed September 28, 2020. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2009~D_20101125_190737-99166 ;.

Note: this citation may be lacking information needed for this citation format:

Author name may be incomplete

MLA Handbook (7^{th} Edition):

Zachaževski, Stanislav. “Nežinomų teritorijų tyrinėjimas naudojant savaeigius robotizuotus mechanizmus.” 2010. Web. 28 Sep 2020.

Note: this citation may be lacking information needed for this citation format:

Author name may be incomplete

Vancouver:

Zachaževski, Stanislav. Nežinomų teritorijų tyrinėjimas naudojant savaeigius robotizuotus mechanizmus. [Internet] [Masters thesis]. Vilnius University; 2010. [cited 2020 Sep 28]. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2009~D_20101125_190737-99166 ;.

Author name may be incomplete

Council of Science Editors:

Zachaževski, Stanislav. Nežinomų teritorijų tyrinėjimas naudojant savaeigius robotizuotus mechanizmus. [Masters Thesis]. Vilnius University; 2010. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2009~D_20101125_190737-99166 ;

Author name may be incomplete

University of Windsor

21. Singh, Harjeet. Performance Evaluation of Weighted Greedy Algorithm in Resource Management.

Degree: MS, Computer Science, 2018, University of Windsor

URL: https://scholar.uwindsor.ca/etd/7397

► Set *covering* is a well-studied classical problem with many applications across different fields. More recent work on this problem has taken into account the parallel…
(more)

Subjects/Keywords: big data; set covering algorithms

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Singh, H. (2018). Performance Evaluation of Weighted Greedy Algorithm in Resource Management. (Masters Thesis). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/7397

Chicago Manual of Style (16^{th} Edition):

Singh, Harjeet. “Performance Evaluation of Weighted Greedy Algorithm in Resource Management.” 2018. Masters Thesis, University of Windsor. Accessed September 28, 2020. https://scholar.uwindsor.ca/etd/7397.

MLA Handbook (7^{th} Edition):

Singh, Harjeet. “Performance Evaluation of Weighted Greedy Algorithm in Resource Management.” 2018. Web. 28 Sep 2020.

Vancouver:

Singh H. Performance Evaluation of Weighted Greedy Algorithm in Resource Management. [Internet] [Masters thesis]. University of Windsor; 2018. [cited 2020 Sep 28]. Available from: https://scholar.uwindsor.ca/etd/7397.

Council of Science Editors:

Singh H. Performance Evaluation of Weighted Greedy Algorithm in Resource Management. [Masters Thesis]. University of Windsor; 2018. Available from: https://scholar.uwindsor.ca/etd/7397

Virginia Tech

22.
Rogers, Donald Wayne, III.
On *Covering*: Queerness.

Degree: MA, Philosophy, 2020, Virginia Tech

URL: http://hdl.handle.net/10919/99909

► The acts of passing and *covering* are socially constructed. To research them further, I spent a significant amount of time understanding others' experiences of passing…
(more)

Subjects/Keywords: passing; covering; standpoint epistemology

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Rogers, Donald Wayne, I. (2020). On Covering: Queerness. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/99909

Chicago Manual of Style (16^{th} Edition):

Rogers, Donald Wayne, III. “On Covering: Queerness.” 2020. Masters Thesis, Virginia Tech. Accessed September 28, 2020. http://hdl.handle.net/10919/99909.

MLA Handbook (7^{th} Edition):

Rogers, Donald Wayne, III. “On Covering: Queerness.” 2020. Web. 28 Sep 2020.

Vancouver:

Rogers, Donald Wayne I. On Covering: Queerness. [Internet] [Masters thesis]. Virginia Tech; 2020. [cited 2020 Sep 28]. Available from: http://hdl.handle.net/10919/99909.

Council of Science Editors:

Rogers, Donald Wayne I. On Covering: Queerness. [Masters Thesis]. Virginia Tech; 2020. Available from: http://hdl.handle.net/10919/99909

Mississippi State University

23.
Balasubramaniam, Mahadevan.
Performance analysis and evaluation of *divisible* load theory and dynamic loop scheduling algorithms in parallel and distributed environments.

Degree: PhD, Computer Science and Engineering, 2015, Mississippi State University

URL: http://sun.library.msstate.edu/ETD-db/theses/available/etd-04282015-235336/ ;

► High performance parallel and distributed computing systems are used to solve large, complex, and data parallel scientific applications that require enormous computational power. Data…
(more)

Subjects/Keywords: 3D torus; parallel and distributed computing; robustness; scalability; dynamic loop scheduling; divisible load theory; arbitrarily divisible workloads; data parallel workloads; cluster

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Balasubramaniam, M. (2015). Performance analysis and evaluation of divisible load theory and dynamic loop scheduling algorithms in parallel and distributed environments. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-04282015-235336/ ;

Chicago Manual of Style (16^{th} Edition):

Balasubramaniam, Mahadevan. “Performance analysis and evaluation of divisible load theory and dynamic loop scheduling algorithms in parallel and distributed environments.” 2015. Doctoral Dissertation, Mississippi State University. Accessed September 28, 2020. http://sun.library.msstate.edu/ETD-db/theses/available/etd-04282015-235336/ ;.

MLA Handbook (7^{th} Edition):

Balasubramaniam, Mahadevan. “Performance analysis and evaluation of divisible load theory and dynamic loop scheduling algorithms in parallel and distributed environments.” 2015. Web. 28 Sep 2020.

Vancouver:

Balasubramaniam M. Performance analysis and evaluation of divisible load theory and dynamic loop scheduling algorithms in parallel and distributed environments. [Internet] [Doctoral dissertation]. Mississippi State University; 2015. [cited 2020 Sep 28]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-04282015-235336/ ;.

Council of Science Editors:

Balasubramaniam M. Performance analysis and evaluation of divisible load theory and dynamic loop scheduling algorithms in parallel and distributed environments. [Doctoral Dissertation]. Mississippi State University; 2015. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-04282015-235336/ ;

University of Pennsylvania

24. Zhang, Xingtan. A Sharper Ratio.

Degree: 2013, University of Pennsylvania

URL: https://repository.upenn.edu/edissertations/951

► The Sharpe ratio is the dominant measure for ranking risky assets and funds. This paper derives a generalized ranking measure which, under a regularity condition,…
(more)

Subjects/Keywords: infinitely divisible distributions; Levy processes; portfolio ranking; Sharpe Ratio; Applied Mathematics

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Zhang, X. (2013). A Sharper Ratio. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/951

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Zhang, Xingtan. “A Sharper Ratio.” 2013. Thesis, University of Pennsylvania. Accessed September 28, 2020. https://repository.upenn.edu/edissertations/951.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zhang, Xingtan. “A Sharper Ratio.” 2013. Web. 28 Sep 2020.

Vancouver:

Zhang X. A Sharper Ratio. [Internet] [Thesis]. University of Pennsylvania; 2013. [cited 2020 Sep 28]. Available from: https://repository.upenn.edu/edissertations/951.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhang X. A Sharper Ratio. [Thesis]. University of Pennsylvania; 2013. Available from: https://repository.upenn.edu/edissertations/951

Not specified: Masters Thesis or Doctoral Dissertation

25. Glaser, Sven. Limit theorems of the power variation of fractional Lévy processes.

Degree: 2015, Technische Universität Dortmund

URL: http://dx.doi.org/10.17877/DE290R-16322

► In dieser Dissertation untersuchen wir das Grenzverhalten von fraktionellen Levy Prozessen. Diese sind Verallgemeinerungen von fraktionellen Brownschen Bewegungen, einer Klasse von Gauß Prozessen, die eine…
(more)

Subjects/Keywords: Limit theorems; Fracional Lévy processes; Power variation; Infinitely divisible distributions; 510

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Glaser, S. (2015). Limit theorems of the power variation of fractional Lévy processes. (Doctoral Dissertation). Technische Universität Dortmund. Retrieved from http://dx.doi.org/10.17877/DE290R-16322

Chicago Manual of Style (16^{th} Edition):

Glaser, Sven. “Limit theorems of the power variation of fractional Lévy processes.” 2015. Doctoral Dissertation, Technische Universität Dortmund. Accessed September 28, 2020. http://dx.doi.org/10.17877/DE290R-16322.

MLA Handbook (7^{th} Edition):

Glaser, Sven. “Limit theorems of the power variation of fractional Lévy processes.” 2015. Web. 28 Sep 2020.

Vancouver:

Glaser S. Limit theorems of the power variation of fractional Lévy processes. [Internet] [Doctoral dissertation]. Technische Universität Dortmund; 2015. [cited 2020 Sep 28]. Available from: http://dx.doi.org/10.17877/DE290R-16322.

Council of Science Editors:

Glaser S. Limit theorems of the power variation of fractional Lévy processes. [Doctoral Dissertation]. Technische Universität Dortmund; 2015. Available from: http://dx.doi.org/10.17877/DE290R-16322

University of Tennessee – Knoxville

26.
Turner, Matthew D.
Explicit Lp-norm estimates of infinitely *divisible* random vectors in Hilbert spaces with applications.

Degree: 2011, University of Tennessee – Knoxville

URL: https://trace.tennessee.edu/utk_graddiss/1035

► I give explicit estimates of the Lp-norm of a mean zero infinitely *divisible* random vector taking values in a Hilbert space in terms of a…
(more)

Subjects/Keywords: Infinitely Divisible random variables; random measures; Ito isomorphism; Kalman filter; Analysis

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Turner, M. D. (2011). Explicit Lp-norm estimates of infinitely divisible random vectors in Hilbert spaces with applications. (Doctoral Dissertation). University of Tennessee – Knoxville. Retrieved from https://trace.tennessee.edu/utk_graddiss/1035

Chicago Manual of Style (16^{th} Edition):

Turner, Matthew D. “Explicit Lp-norm estimates of infinitely divisible random vectors in Hilbert spaces with applications.” 2011. Doctoral Dissertation, University of Tennessee – Knoxville. Accessed September 28, 2020. https://trace.tennessee.edu/utk_graddiss/1035.

MLA Handbook (7^{th} Edition):

Turner, Matthew D. “Explicit Lp-norm estimates of infinitely divisible random vectors in Hilbert spaces with applications.” 2011. Web. 28 Sep 2020.

Vancouver:

Turner MD. Explicit Lp-norm estimates of infinitely divisible random vectors in Hilbert spaces with applications. [Internet] [Doctoral dissertation]. University of Tennessee – Knoxville; 2011. [cited 2020 Sep 28]. Available from: https://trace.tennessee.edu/utk_graddiss/1035.

Council of Science Editors:

Turner MD. Explicit Lp-norm estimates of infinitely divisible random vectors in Hilbert spaces with applications. [Doctoral Dissertation]. University of Tennessee – Knoxville; 2011. Available from: https://trace.tennessee.edu/utk_graddiss/1035

Vanderbilt University

27. Schroeder, Justin Zane. Hamilton cycle embeddings of complete tripartite graphs and their applications.

Degree: PhD, Mathematics, 2012, Vanderbilt University

URL: http://hdl.handle.net/1803/10927

► A central problem in topological graph theory is determining the (orientable or nonorientable) genus of a given graph <i>G</i>. For a general graph <i>G</i>, this…
(more)

Subjects/Keywords: covering triangulation; graph genus; graph embedding

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Schroeder, J. Z. (2012). Hamilton cycle embeddings of complete tripartite graphs and their applications. (Doctoral Dissertation). Vanderbilt University. Retrieved from http://hdl.handle.net/1803/10927

Chicago Manual of Style (16^{th} Edition):

Schroeder, Justin Zane. “Hamilton cycle embeddings of complete tripartite graphs and their applications.” 2012. Doctoral Dissertation, Vanderbilt University. Accessed September 28, 2020. http://hdl.handle.net/1803/10927.

MLA Handbook (7^{th} Edition):

Schroeder, Justin Zane. “Hamilton cycle embeddings of complete tripartite graphs and their applications.” 2012. Web. 28 Sep 2020.

Vancouver:

Schroeder JZ. Hamilton cycle embeddings of complete tripartite graphs and their applications. [Internet] [Doctoral dissertation]. Vanderbilt University; 2012. [cited 2020 Sep 28]. Available from: http://hdl.handle.net/1803/10927.

Council of Science Editors:

Schroeder JZ. Hamilton cycle embeddings of complete tripartite graphs and their applications. [Doctoral Dissertation]. Vanderbilt University; 2012. Available from: http://hdl.handle.net/1803/10927

28. Bossenger, Wayne. 2D irregular strip packing at Kohler signs.

Degree: MCom, Economics, 2014, Stellenbosch University

URL: http://hdl.handle.net/10019.1/96129

►

ENGLISH ABSTRACT: Kohler Signs (PTY) Ltd is a sign production company located in Cape Town, South Africa. They manufacture and install signs for the City… (more)

Subjects/Keywords: Economics; Street signs; Combinatorial packing and covering

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Bossenger, W. (2014). 2D irregular strip packing at Kohler signs. (Thesis). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/96129

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Bossenger, Wayne. “2D irregular strip packing at Kohler signs.” 2014. Thesis, Stellenbosch University. Accessed September 28, 2020. http://hdl.handle.net/10019.1/96129.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Bossenger, Wayne. “2D irregular strip packing at Kohler signs.” 2014. Web. 28 Sep 2020.

Vancouver:

Bossenger W. 2D irregular strip packing at Kohler signs. [Internet] [Thesis]. Stellenbosch University; 2014. [cited 2020 Sep 28]. Available from: http://hdl.handle.net/10019.1/96129.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bossenger W. 2D irregular strip packing at Kohler signs. [Thesis]. Stellenbosch University; 2014. Available from: http://hdl.handle.net/10019.1/96129

Not specified: Masters Thesis or Doctoral Dissertation

University of Rochester

29. Kautz, Henry Alexander (1956 - ). A Formal theory of plan recognition.

Degree: PhD, 2009, University of Rochester

URL: http://hdl.handle.net/1802/6397

► Research in discourse analysis, story understanding, and user modeling for expert systems has shown great interest in plan recognition problems. In a plan recognition problem,…
(more)

Subjects/Keywords: Minimum covering entailment; Plan recognition; Inference

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Kautz, H. A. (. -. ). (2009). A Formal theory of plan recognition. (Doctoral Dissertation). University of Rochester. Retrieved from http://hdl.handle.net/1802/6397

Chicago Manual of Style (16^{th} Edition):

Kautz, Henry Alexander (1956 - ). “A Formal theory of plan recognition.” 2009. Doctoral Dissertation, University of Rochester. Accessed September 28, 2020. http://hdl.handle.net/1802/6397.

MLA Handbook (7^{th} Edition):

Kautz, Henry Alexander (1956 - ). “A Formal theory of plan recognition.” 2009. Web. 28 Sep 2020.

Vancouver:

Kautz HA(-). A Formal theory of plan recognition. [Internet] [Doctoral dissertation]. University of Rochester; 2009. [cited 2020 Sep 28]. Available from: http://hdl.handle.net/1802/6397.

Council of Science Editors:

Kautz HA(-). A Formal theory of plan recognition. [Doctoral Dissertation]. University of Rochester; 2009. Available from: http://hdl.handle.net/1802/6397

Universidade Nova

30.
Buezas, David.
Constraint-based modeling of minimum set *covering*: application to species differentation.

Degree: 2011, Universidade Nova

URL: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/6158

►

Work presented in the context of the European Master in Computational Logics, as partial requisit for the graduation as Master in Computational Logics

A large… (more)

Subjects/Keywords: Minimum set covering; Enzymes; Species differentiation; Constraints

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Buezas, D. (2011). Constraint-based modeling of minimum set covering: application to species differentation. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/6158

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Buezas, David. “Constraint-based modeling of minimum set covering: application to species differentation.” 2011. Thesis, Universidade Nova. Accessed September 28, 2020. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/6158.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Buezas, David. “Constraint-based modeling of minimum set covering: application to species differentation.” 2011. Web. 28 Sep 2020.

Vancouver:

Buezas D. Constraint-based modeling of minimum set covering: application to species differentation. [Internet] [Thesis]. Universidade Nova; 2011. [cited 2020 Sep 28]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/6158.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Buezas D. Constraint-based modeling of minimum set covering: application to species differentation. [Thesis]. Universidade Nova; 2011. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/6158

Not specified: Masters Thesis or Doctoral Dissertation