Advanced search options

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

You searched for `subject:(Mathematical sequences)`

.
Showing records 1 – 30 of
68 total matches.

Search Limiters

Dates

- 2010 – 2014 (15)
- 1995 – 1999 (10)

Universities

- University of Florida (46)
- ETH Zürich (10)

Country

- US (47)
- Switzerland (10)

▼ Search Limiters

University of KwaZulu-Natal

1. [No author]. Using spectral methods on HIV infection with TAT and SSU72 activation.

Degree: 2016, University of KwaZulu-Natal

URL: http://hdl.handle.net/10413/13389

► HIV dynamics within the host are complex especially when a reservoir of latently infected CD4+ T cells are present. The failure of the immune system…
(more)

Subjects/Keywords: HIV infections – Mathematical models.; Spectral sequences (Mathematics); T cells – Receptors.; Phosphoprotein phosphatases.; Mathematics.; TAT; SSU72

Record Details Similar Records

❌

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

APA (6^{th} Edition):

author], [. (2016). Using spectral methods on HIV infection with TAT and SSU72 activation. (Thesis). University of KwaZulu-Natal. Retrieved from http://hdl.handle.net/10413/13389

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):

author], [No. “Using spectral methods on HIV infection with TAT and SSU72 activation. ” 2016. Thesis, University of KwaZulu-Natal. Accessed October 17, 2019. http://hdl.handle.net/10413/13389.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

author], [No. “Using spectral methods on HIV infection with TAT and SSU72 activation. ” 2016. Web. 17 Oct 2019.

Vancouver:

author] [. Using spectral methods on HIV infection with TAT and SSU72 activation. [Internet] [Thesis]. University of KwaZulu-Natal; 2016. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/10413/13389.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

author] [. Using spectral methods on HIV infection with TAT and SSU72 activation. [Thesis]. University of KwaZulu-Natal; 2016. Available from: http://hdl.handle.net/10413/13389

Not specified: Masters Thesis or Doctoral Dissertation

University of Florida

2. Severa, William M. Geometric Representations of the Infimax S-Adic Family.

Degree: PhD, Mathematics, 2015, University of Florida

URL: http://ufdc.ufl.edu/UFE0048980

► Infimax *sequences* are defined as the infimum of all cyclically maximal *sequences* whose symbols appear in a given proportion. These *sequences* have been shown to…
(more)

Subjects/Keywords: Alphabets; Dynamical systems; Eigenvalues; Eigenvectors; Mathematical sequences; Mathematics; Matrices; Method of characteristics; Tiles; Words; infimax

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Severa, W. M. (2015). Geometric Representations of the Infimax S-Adic Family. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0048980

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

Severa, William M. “Geometric Representations of the Infimax S-Adic Family.” 2015. Doctoral Dissertation, University of Florida. Accessed October 17, 2019. http://ufdc.ufl.edu/UFE0048980.

MLA Handbook (7^{th} Edition):

Severa, William M. “Geometric Representations of the Infimax S-Adic Family.” 2015. Web. 17 Oct 2019.

Vancouver:

Severa WM. Geometric Representations of the Infimax S-Adic Family. [Internet] [Doctoral dissertation]. University of Florida; 2015. [cited 2019 Oct 17]. Available from: http://ufdc.ufl.edu/UFE0048980.

Council of Science Editors:

Severa WM. Geometric Representations of the Infimax S-Adic Family. [Doctoral Dissertation]. University of Florida; 2015. Available from: http://ufdc.ufl.edu/UFE0048980

University of Florida

3. Hemmati, Mehdi. Multilevel Discrete Formulations and Algorithms with Applications to New Production Introduction Games and Network Interdiction Problems.

Degree: PhD, Industrial and Systems Engineering, 2013, University of Florida

URL: http://ufdc.ufl.edu/UFE0045762

► In this dissertation, we study multilevel optimization andnetwork interdiction theory, and apply this theory across several applicationsettings. The common theme of all ourproblems involves competitive…
(more)

Subjects/Keywords: Algorithms; Customers; Integers; Linear programming; Mathematical sequences; Mathematical variables; Objective functions; Operations research; Optimal solutions; Product introduction; bilevel – interdiction – network – optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hemmati, M. (2013). Multilevel Discrete Formulations and Algorithms with Applications to New Production Introduction Games and Network Interdiction Problems. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0045762

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

Hemmati, Mehdi. “Multilevel Discrete Formulations and Algorithms with Applications to New Production Introduction Games and Network Interdiction Problems.” 2013. Doctoral Dissertation, University of Florida. Accessed October 17, 2019. http://ufdc.ufl.edu/UFE0045762.

MLA Handbook (7^{th} Edition):

Hemmati, Mehdi. “Multilevel Discrete Formulations and Algorithms with Applications to New Production Introduction Games and Network Interdiction Problems.” 2013. Web. 17 Oct 2019.

Vancouver:

Hemmati M. Multilevel Discrete Formulations and Algorithms with Applications to New Production Introduction Games and Network Interdiction Problems. [Internet] [Doctoral dissertation]. University of Florida; 2013. [cited 2019 Oct 17]. Available from: http://ufdc.ufl.edu/UFE0045762.

Council of Science Editors:

Hemmati M. Multilevel Discrete Formulations and Algorithms with Applications to New Production Introduction Games and Network Interdiction Problems. [Doctoral Dissertation]. University of Florida; 2013. Available from: http://ufdc.ufl.edu/UFE0045762

University of Florida

4. Fairbanks, James. A Ramsey Theorem for Indecomposable Matchings.

Degree: 2012, University of Florida

URL: http://ufdc.ufl.edu/AA00057281

► A matching is indecomposable if it does not contain a nontrivial contiguous segment of vertices whose neighbors are entirely contained in the segment. We prove…
(more)

Subjects/Keywords: College mathematics; Combinatorics; Electronic journals; Mathematical intervals; Mathematical sequences; Mathematical sets; Mathematical theorems; Permutations; Recursion; Vertices; Indecomposable modules; Matching theory; Ramsey theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fairbanks, J. (2012). A Ramsey Theorem for Indecomposable Matchings. (Thesis). University of Florida. Retrieved from http://ufdc.ufl.edu/AA00057281

Not specified: Masters Thesis or Doctoral Dissertation

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

Fairbanks, James. “A Ramsey Theorem for Indecomposable Matchings.” 2012. Thesis, University of Florida. Accessed October 17, 2019. http://ufdc.ufl.edu/AA00057281.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Fairbanks, James. “A Ramsey Theorem for Indecomposable Matchings.” 2012. Web. 17 Oct 2019.

Vancouver:

Fairbanks J. A Ramsey Theorem for Indecomposable Matchings. [Internet] [Thesis]. University of Florida; 2012. [cited 2019 Oct 17]. Available from: http://ufdc.ufl.edu/AA00057281.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fairbanks J. A Ramsey Theorem for Indecomposable Matchings. [Thesis]. University of Florida; 2012. Available from: http://ufdc.ufl.edu/AA00057281

Not specified: Masters Thesis or Doctoral Dissertation

Macquarie University

5.
Weerasinghe Jayawardana Rathambalage, Madawa Priyadarshana.
The cross-entropy method and multiple change-point detection in genomic * sequences*.

Degree: 2015, Macquarie University

URL: http://hdl.handle.net/1959.14/1067413

►

Thesis by publication.

Spine title: The CE method and multiple change-point detection.

1. Introduction and thesis outline – 2. Methods – 3. Multiple break-points detection… (more)

Subjects/Keywords: Cross-entropy method; Mathematical optimization; Stochastic sequences; Genomics – Statistical methods; cross-entropy method; change-point detection; DNA sequences; aCGH data; next generation sequencing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Weerasinghe Jayawardana Rathambalage, M. P. (2015). The cross-entropy method and multiple change-point detection in genomic sequences. (Doctoral Dissertation). Macquarie University. Retrieved from http://hdl.handle.net/1959.14/1067413

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

Weerasinghe Jayawardana Rathambalage, Madawa Priyadarshana. “The cross-entropy method and multiple change-point detection in genomic sequences.” 2015. Doctoral Dissertation, Macquarie University. Accessed October 17, 2019. http://hdl.handle.net/1959.14/1067413.

MLA Handbook (7^{th} Edition):

Weerasinghe Jayawardana Rathambalage, Madawa Priyadarshana. “The cross-entropy method and multiple change-point detection in genomic sequences.” 2015. Web. 17 Oct 2019.

Vancouver:

Weerasinghe Jayawardana Rathambalage MP. The cross-entropy method and multiple change-point detection in genomic sequences. [Internet] [Doctoral dissertation]. Macquarie University; 2015. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/1959.14/1067413.

Council of Science Editors:

Weerasinghe Jayawardana Rathambalage MP. The cross-entropy method and multiple change-point detection in genomic sequences. [Doctoral Dissertation]. Macquarie University; 2015. Available from: http://hdl.handle.net/1959.14/1067413

6.
Sätterqvist, Erik.
* Sequences* of Functions : Different Notions of Convergence and How They Are Related.

Degree: Faculty of Science & Engineering, 2018, Linköping UniversityLinköping University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-148418

►

In this thesis we examine different types of convergence for *sequences* of functions and how these are related. The functions considered are real valued…
(more)

Subjects/Keywords: Sequences of functions; convergence; quasi uniform convergence; Lp-spaces; Funktionsföljder; konvergens; kvasilikformig konvergens; Lp-rum; Mathematical Analysis; Matematisk analys

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sätterqvist, E. (2018). Sequences of Functions : Different Notions of Convergence and How They Are Related. (Thesis). Linköping UniversityLinköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-148418

Not specified: Masters Thesis or Doctoral Dissertation

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

Sätterqvist, Erik. “Sequences of Functions : Different Notions of Convergence and How They Are Related.” 2018. Thesis, Linköping UniversityLinköping University. Accessed October 17, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-148418.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sätterqvist, Erik. “Sequences of Functions : Different Notions of Convergence and How They Are Related.” 2018. Web. 17 Oct 2019.

Vancouver:

Sätterqvist E. Sequences of Functions : Different Notions of Convergence and How They Are Related. [Internet] [Thesis]. Linköping UniversityLinköping University; 2018. [cited 2019 Oct 17]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-148418.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sätterqvist E. Sequences of Functions : Different Notions of Convergence and How They Are Related. [Thesis]. Linköping UniversityLinköping University; 2018. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-148418

Not specified: Masters Thesis or Doctoral Dissertation

University of Florida

7. Jefferson, Aziza F. The Substitution Decomposition of Matchings and RNA Secondary Structures.

Degree: PhD, Mathematics, 2015, University of Florida

URL: http://ufdc.ufl.edu/UFE0047620

► The secondary structure of RNA provides important information about the function of the RNA and its study is a fundamental problem in *mathematical* biology so…
(more)

Subjects/Keywords: Algebra; Algorithms; Family structure; Generating function; Mathematical sequences; Mathematics; Permutations; Polynomials; RNA; Vertices; combinatorics – enumeration – matching – mathematics – rna – secondary – sequence – structure

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jefferson, A. F. (2015). The Substitution Decomposition of Matchings and RNA Secondary Structures. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0047620

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

Jefferson, Aziza F. “The Substitution Decomposition of Matchings and RNA Secondary Structures.” 2015. Doctoral Dissertation, University of Florida. Accessed October 17, 2019. http://ufdc.ufl.edu/UFE0047620.

MLA Handbook (7^{th} Edition):

Jefferson, Aziza F. “The Substitution Decomposition of Matchings and RNA Secondary Structures.” 2015. Web. 17 Oct 2019.

Vancouver:

Jefferson AF. The Substitution Decomposition of Matchings and RNA Secondary Structures. [Internet] [Doctoral dissertation]. University of Florida; 2015. [cited 2019 Oct 17]. Available from: http://ufdc.ufl.edu/UFE0047620.

Council of Science Editors:

Jefferson AF. The Substitution Decomposition of Matchings and RNA Secondary Structures. [Doctoral Dissertation]. University of Florida; 2015. Available from: http://ufdc.ufl.edu/UFE0047620

University of Lethbridge

8. University of Lethbridge. Faculty of Arts and Science. Perron's formula and resulting explicit bounds on sums .

Degree: 2019, University of Lethbridge

URL: http://hdl.handle.net/10133/5441

► By working with Perron’s formula we prove an explicit bound on ∑n≤x an/ns, where an,s ∈ C. We then prove a second explicit bound on…
(more)

Subjects/Keywords: Mathematical analysis; Numbers, prime; Number theory; Numbers, complex; Sequences (Mathematics); Perron's formula; explicit bounds; Prime Number Theorem; sums; Dissertations, Academic

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Science, U. o. L. F. o. A. a. (2019). Perron's formula and resulting explicit bounds on sums . (Thesis). University of Lethbridge. Retrieved from http://hdl.handle.net/10133/5441

Not specified: Masters Thesis or Doctoral Dissertation

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

Science, University of Lethbridge. Faculty of Arts and. “Perron's formula and resulting explicit bounds on sums .” 2019. Thesis, University of Lethbridge. Accessed October 17, 2019. http://hdl.handle.net/10133/5441.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Science, University of Lethbridge. Faculty of Arts and. “Perron's formula and resulting explicit bounds on sums .” 2019. Web. 17 Oct 2019.

Vancouver:

Science UoLFoAa. Perron's formula and resulting explicit bounds on sums . [Internet] [Thesis]. University of Lethbridge; 2019. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/10133/5441.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Science UoLFoAa. Perron's formula and resulting explicit bounds on sums . [Thesis]. University of Lethbridge; 2019. Available from: http://hdl.handle.net/10133/5441

Not specified: Masters Thesis or Doctoral Dissertation

University of Florida

9. Graves, Eric S. Information Integrity.

Degree: PhD, Electrical and Computer Engineering, 2013, University of Florida

URL: http://ufdc.ufl.edu/UFE0045197

► This thesis presents the concept of Information Integrity, or the *mathematical* concept of determining modifications by a Byzantine relay. As networks continue to grow…
(more)

Subjects/Keywords: Alphabets; Decryption; Information theory; Linear programming; Mathematical sequences; Mathematical vectors; Matrices; Random variables; Statistical theories; Statistics; byzantine – detection – information – integrity – relay – secrecy

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Graves, E. S. (2013). Information Integrity. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0045197

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

Graves, Eric S. “Information Integrity.” 2013. Doctoral Dissertation, University of Florida. Accessed October 17, 2019. http://ufdc.ufl.edu/UFE0045197.

MLA Handbook (7^{th} Edition):

Graves, Eric S. “Information Integrity.” 2013. Web. 17 Oct 2019.

Vancouver:

Graves ES. Information Integrity. [Internet] [Doctoral dissertation]. University of Florida; 2013. [cited 2019 Oct 17]. Available from: http://ufdc.ufl.edu/UFE0045197.

Council of Science Editors:

Graves ES. Information Integrity. [Doctoral Dissertation]. University of Florida; 2013. Available from: http://ufdc.ufl.edu/UFE0045197

University of Florida

10.
Lim, Kil-Sup.
Statistical problems in using Markov chain to represent DNA *sequences* and their applications.

Degree: PhD, Statistics, 1998, University of Florida

URL: http://ufdc.ufl.edu/AA00040740

Subjects/Keywords: Amino acids; Codons; Exons; Introns; Markov chains; Mathematical sequences; Nucleotide sequences; Statistics; Word frequency analysis; Zipfs law

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lim, K. (1998). Statistical problems in using Markov chain to represent DNA sequences and their applications. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/AA00040740

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

Lim, Kil-Sup. “Statistical problems in using Markov chain to represent DNA sequences and their applications.” 1998. Doctoral Dissertation, University of Florida. Accessed October 17, 2019. http://ufdc.ufl.edu/AA00040740.

MLA Handbook (7^{th} Edition):

Lim, Kil-Sup. “Statistical problems in using Markov chain to represent DNA sequences and their applications.” 1998. Web. 17 Oct 2019.

Vancouver:

Lim K. Statistical problems in using Markov chain to represent DNA sequences and their applications. [Internet] [Doctoral dissertation]. University of Florida; 1998. [cited 2019 Oct 17]. Available from: http://ufdc.ufl.edu/AA00040740.

Council of Science Editors:

Lim K. Statistical problems in using Markov chain to represent DNA sequences and their applications. [Doctoral Dissertation]. University of Florida; 1998. Available from: http://ufdc.ufl.edu/AA00040740

Indian Institute of Science

11. Bharadwaj, Subramanya B V. The Isoperimetric Problem On Trees And Bounded Tree Width Graphs.

Degree: 2008, Indian Institute of Science

URL: http://hdl.handle.net/2005/844

► In this thesis we study the isoperimetric problem on trees and graphs with bounded treewidth. Let G = (V,E) be a finite, simple and undirected…
(more)

Subjects/Keywords: Computer Graphics - Algorithms; Computer Graphics - Mathematical Models; Isoperimetric Inequalities; Meta-Fibonacci Sequences; Graph Theory; Trees (Graph Theory); Treewidth Graphs; Weighted Graphs; Infinite Binary Tree; Isoperimetric Problem; Computer Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bharadwaj, S. B. V. (2008). The Isoperimetric Problem On Trees And Bounded Tree Width Graphs. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/844

Not specified: Masters Thesis or Doctoral Dissertation

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

Bharadwaj, Subramanya B V. “The Isoperimetric Problem On Trees And Bounded Tree Width Graphs.” 2008. Thesis, Indian Institute of Science. Accessed October 17, 2019. http://hdl.handle.net/2005/844.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Bharadwaj, Subramanya B V. “The Isoperimetric Problem On Trees And Bounded Tree Width Graphs.” 2008. Web. 17 Oct 2019.

Vancouver:

Bharadwaj SBV. The Isoperimetric Problem On Trees And Bounded Tree Width Graphs. [Internet] [Thesis]. Indian Institute of Science; 2008. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/2005/844.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bharadwaj SBV. The Isoperimetric Problem On Trees And Bounded Tree Width Graphs. [Thesis]. Indian Institute of Science; 2008. Available from: http://hdl.handle.net/2005/844

Not specified: Masters Thesis or Doctoral Dissertation

12. Valter Henrique Biscaro Raposo. Expoentes iniciais críticos em sequências sturmianas.

Degree: 2013, Universidade Estadual de Londrina

URL: http://www.bibliotecadigital.uel.br/document/?code=vtls000184922

►

Neste trabalho investigamos potências de prefixos de sequências Sturmianas. Deduzimos uma fórmula explícita para o expoente inicial crítico de uma sequência Sturmiana w, definido como… (more)

Subjects/Keywords: Sequências (Matemática); Sistemas dinâmicos diferenciais; Teoria do ponto crítico (Análise matemática); Dinâmica simbólica; Sequences (Mathematics); Differentiable dynamical systems; Critical point theory (Mathematical analysis); Symbolic dynamics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Raposo, V. H. B. (2013). Expoentes iniciais críticos em sequências sturmianas. (Thesis). Universidade Estadual de Londrina. Retrieved from http://www.bibliotecadigital.uel.br/document/?code=vtls000184922

Not specified: Masters Thesis or Doctoral Dissertation

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

Raposo, Valter Henrique Biscaro. “Expoentes iniciais críticos em sequências sturmianas.” 2013. Thesis, Universidade Estadual de Londrina. Accessed October 17, 2019. http://www.bibliotecadigital.uel.br/document/?code=vtls000184922.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Raposo, Valter Henrique Biscaro. “Expoentes iniciais críticos em sequências sturmianas.” 2013. Web. 17 Oct 2019.

Vancouver:

Raposo VHB. Expoentes iniciais críticos em sequências sturmianas. [Internet] [Thesis]. Universidade Estadual de Londrina; 2013. [cited 2019 Oct 17]. Available from: http://www.bibliotecadigital.uel.br/document/?code=vtls000184922.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Raposo VHB. Expoentes iniciais críticos em sequências sturmianas. [Thesis]. Universidade Estadual de Londrina; 2013. Available from: http://www.bibliotecadigital.uel.br/document/?code=vtls000184922

Not specified: Masters Thesis or Doctoral Dissertation

University of Florida

13. Yi, Tae-Il, 1962-. A classification of trees and applications of topology and graph theory to neurosurgery.

Degree: PhD, Mathematics, 2000, University of Florida

URL: http://ufdc.ufl.edu/AA00018872

Subjects/Keywords: Algorithms; Brain neoplasms; Dosage; Geometric centers; Integers; Mathematical sequences; Mathematics; Radiosurgery; Tumors; Vertices

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yi, Tae-Il, 1. (2000). A classification of trees and applications of topology and graph theory to neurosurgery. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/AA00018872

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

Yi, Tae-Il, 1962-. “A classification of trees and applications of topology and graph theory to neurosurgery.” 2000. Doctoral Dissertation, University of Florida. Accessed October 17, 2019. http://ufdc.ufl.edu/AA00018872.

MLA Handbook (7^{th} Edition):

Yi, Tae-Il, 1962-. “A classification of trees and applications of topology and graph theory to neurosurgery.” 2000. Web. 17 Oct 2019.

Vancouver:

Yi, Tae-Il 1. A classification of trees and applications of topology and graph theory to neurosurgery. [Internet] [Doctoral dissertation]. University of Florida; 2000. [cited 2019 Oct 17]. Available from: http://ufdc.ufl.edu/AA00018872.

Council of Science Editors:

Yi, Tae-Il 1. A classification of trees and applications of topology and graph theory to neurosurgery. [Doctoral Dissertation]. University of Florida; 2000. Available from: http://ufdc.ufl.edu/AA00018872

University of Florida

14.
De Andrade, Leonardo.
Cross-Species Analysis of Choices between Reinforcer * Sequences*.

Degree: PhD, Psychology, 2010, University of Florida

URL: http://ufdc.ufl.edu/UFE0041584

► When given choices between *sequences* of reinforcers distributed over time, humans and non-humans show different patterns of preference: humans tend to prefer *sequences* that improve…
(more)

Subjects/Keywords: Discounting; Experimental psychology; Humans; Mathematical sequences; Modeling; Pigeons; Psychology; Questionnaires; Rectangles; Restaurants; analysis, choice, comparison, cross, decay, human, hyperbolic, improving, model, pigeon, reinforcement, sequence, species, tokens, worsening

Record Details Similar Records

❌

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

APA (6^{th} Edition):

De Andrade, L. (2010). Cross-Species Analysis of Choices between Reinforcer Sequences. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0041584

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

De Andrade, Leonardo. “Cross-Species Analysis of Choices between Reinforcer Sequences.” 2010. Doctoral Dissertation, University of Florida. Accessed October 17, 2019. http://ufdc.ufl.edu/UFE0041584.

MLA Handbook (7^{th} Edition):

De Andrade, Leonardo. “Cross-Species Analysis of Choices between Reinforcer Sequences.” 2010. Web. 17 Oct 2019.

Vancouver:

De Andrade L. Cross-Species Analysis of Choices between Reinforcer Sequences. [Internet] [Doctoral dissertation]. University of Florida; 2010. [cited 2019 Oct 17]. Available from: http://ufdc.ufl.edu/UFE0041584.

Council of Science Editors:

De Andrade L. Cross-Species Analysis of Choices between Reinforcer Sequences. [Doctoral Dissertation]. University of Florida; 2010. Available from: http://ufdc.ufl.edu/UFE0041584

University of Florida

15. Banerjee Mishra, Tania. TCAM-Based Low Power Routers and Packet Classifiers.

Degree: PhD, Computer Engineering - Computer and Information Science and Engineering, 2012, University of Florida

URL: http://ufdc.ufl.edu/UFE0043973

► Ternary Content Addressable Memory (TCAM) is a hardware device which can support high-speed table lookups and is an attractive solution for applications such as packet…
(more)

Subjects/Keywords: Algorithms; Carving; Datasets; Descendants; Duets; Heuristics; Leaves; Mathematical sequences; Power efficiency; Vertices; duo – low-power – packet-classification – packet-forwarding – pc-duos – pc-trio – petcam – router-architecture – tcam – updates

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Banerjee Mishra, T. (2012). TCAM-Based Low Power Routers and Packet Classifiers. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0043973

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

Banerjee Mishra, Tania. “TCAM-Based Low Power Routers and Packet Classifiers.” 2012. Doctoral Dissertation, University of Florida. Accessed October 17, 2019. http://ufdc.ufl.edu/UFE0043973.

MLA Handbook (7^{th} Edition):

Banerjee Mishra, Tania. “TCAM-Based Low Power Routers and Packet Classifiers.” 2012. Web. 17 Oct 2019.

Vancouver:

Banerjee Mishra T. TCAM-Based Low Power Routers and Packet Classifiers. [Internet] [Doctoral dissertation]. University of Florida; 2012. [cited 2019 Oct 17]. Available from: http://ufdc.ufl.edu/UFE0043973.

Council of Science Editors:

Banerjee Mishra T. TCAM-Based Low Power Routers and Packet Classifiers. [Doctoral Dissertation]. University of Florida; 2012. Available from: http://ufdc.ufl.edu/UFE0043973

University of Florida

16. Horton, Joshua A. Normalized Maximum Likelihood on Variable-Length Sequence Datasets.

Degree: PhD, Computer Engineering - Computer and Information Science and Engineering, 2014, University of Florida

URL: http://ufdc.ufl.edu/UFE0047146

► This work examines the minimal description length criterion and the normalized maximum likelihood distribution and derives extensions for applications in which data *sequences* are of…
(more)

Subjects/Keywords: Datasets; Language; Linguistics; Mathematical sequences; Modeling; Parametric models; Statistical models; Syllables; Topology; Words; hidden-markov-models – machine-learning – model-selection – normalized-maximum-likelihood

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Horton, J. A. (2014). Normalized Maximum Likelihood on Variable-Length Sequence Datasets. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0047146

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

Horton, Joshua A. “Normalized Maximum Likelihood on Variable-Length Sequence Datasets.” 2014. Doctoral Dissertation, University of Florida. Accessed October 17, 2019. http://ufdc.ufl.edu/UFE0047146.

MLA Handbook (7^{th} Edition):

Horton, Joshua A. “Normalized Maximum Likelihood on Variable-Length Sequence Datasets.” 2014. Web. 17 Oct 2019.

Vancouver:

Horton JA. Normalized Maximum Likelihood on Variable-Length Sequence Datasets. [Internet] [Doctoral dissertation]. University of Florida; 2014. [cited 2019 Oct 17]. Available from: http://ufdc.ufl.edu/UFE0047146.

Council of Science Editors:

Horton JA. Normalized Maximum Likelihood on Variable-Length Sequence Datasets. [Doctoral Dissertation]. University of Florida; 2014. Available from: http://ufdc.ufl.edu/UFE0047146

University of Florida

17. Toska, Ferit. Effective Symbolic Dynamics and Complexity.

Degree: PhD, Mathematics, 2013, University of Florida

URL: http://ufdc.ufl.edu/UFE0045340

► In the second chapter we investigate the computability of countable subshifts in one dimension, and their members. Subshifts of Cantor-Bendixson rank two contain only eventually…
(more)

Subjects/Keywords: Compressibility; Computability; Degree of unsolvability; Dynamical systems; Hausdorff dimensions; Homeomorphism; Mathematical sequences; Mathematics; Randomness; Recursion theory; complexity – computability – dynamics – machine – process – randomness – strict

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Toska, F. (2013). Effective Symbolic Dynamics and Complexity. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0045340

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

Toska, Ferit. “Effective Symbolic Dynamics and Complexity.” 2013. Doctoral Dissertation, University of Florida. Accessed October 17, 2019. http://ufdc.ufl.edu/UFE0045340.

MLA Handbook (7^{th} Edition):

Toska, Ferit. “Effective Symbolic Dynamics and Complexity.” 2013. Web. 17 Oct 2019.

Vancouver:

Toska F. Effective Symbolic Dynamics and Complexity. [Internet] [Doctoral dissertation]. University of Florida; 2013. [cited 2019 Oct 17]. Available from: http://ufdc.ufl.edu/UFE0045340.

Council of Science Editors:

Toska F. Effective Symbolic Dynamics and Complexity. [Doctoral Dissertation]. University of Florida; 2013. Available from: http://ufdc.ufl.edu/UFE0045340

University of Florida

18. Phillips, Cara Lucia. Generalized Instruction following with Textual Prompts.

Degree: PhD, Psychology, 2012, University of Florida

URL: http://ufdc.ufl.edu/UFE0044072

► The benefits of permanent prompts in enhancing maintenance and generalization are likely dependent on their degree of stimulus control and the extent to which their…
(more)

Subjects/Keywords: Activities of daily living; Autistic disorder; Developmental disabilities; Disabilities; Literature; Mathematical sequences; Mental stimulation; Sensory discrimination; Special education; Toys; autism – generalization – instructions – textual

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Phillips, C. L. (2012). Generalized Instruction following with Textual Prompts. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0044072

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

Phillips, Cara Lucia. “Generalized Instruction following with Textual Prompts.” 2012. Doctoral Dissertation, University of Florida. Accessed October 17, 2019. http://ufdc.ufl.edu/UFE0044072.

MLA Handbook (7^{th} Edition):

Phillips, Cara Lucia. “Generalized Instruction following with Textual Prompts.” 2012. Web. 17 Oct 2019.

Vancouver:

Phillips CL. Generalized Instruction following with Textual Prompts. [Internet] [Doctoral dissertation]. University of Florida; 2012. [cited 2019 Oct 17]. Available from: http://ufdc.ufl.edu/UFE0044072.

Council of Science Editors:

Phillips CL. Generalized Instruction following with Textual Prompts. [Doctoral Dissertation]. University of Florida; 2012. Available from: http://ufdc.ufl.edu/UFE0044072

Texas State University – San Marcos

19. Herrera, Christine A. An Investigation of the Relationships between Conceptualization of Limits and Proof Comprehension.

Degree: PhD, Mathematics Education, 2016, Texas State University – San Marcos

URL: https://digital.library.txstate.edu/handle/10877/6051

► This study investigates eighteen Real Analysis students’ informal and formal understanding of the *mathematical* concept of limits and the relationship on their comprehension of limit…
(more)

Subjects/Keywords: Limits; Limits of sequences; Limits of functions; Real analysis; Undergraduate mathematics; Proof; Proof comprehension; Concept image; Concept definition; Example space; Mathematical analysis; Mathematics – Study and teaching

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Herrera, C. A. (2016). An Investigation of the Relationships between Conceptualization of Limits and Proof Comprehension. (Doctoral Dissertation). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/6051

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

Herrera, Christine A. “An Investigation of the Relationships between Conceptualization of Limits and Proof Comprehension.” 2016. Doctoral Dissertation, Texas State University – San Marcos. Accessed October 17, 2019. https://digital.library.txstate.edu/handle/10877/6051.

MLA Handbook (7^{th} Edition):

Herrera, Christine A. “An Investigation of the Relationships between Conceptualization of Limits and Proof Comprehension.” 2016. Web. 17 Oct 2019.

Vancouver:

Herrera CA. An Investigation of the Relationships between Conceptualization of Limits and Proof Comprehension. [Internet] [Doctoral dissertation]. Texas State University – San Marcos; 2016. [cited 2019 Oct 17]. Available from: https://digital.library.txstate.edu/handle/10877/6051.

Council of Science Editors:

Herrera CA. An Investigation of the Relationships between Conceptualization of Limits and Proof Comprehension. [Doctoral Dissertation]. Texas State University – San Marcos; 2016. Available from: https://digital.library.txstate.edu/handle/10877/6051

University of Florida

20. Leaning, Jeffrey Scott, 1971-. Disassociated indiscernibles.

Degree: PhD, Mathematics, 1999, University of Florida

URL: http://ufdc.ufl.edu/AA00017710

Subjects/Keywords: Academic degrees; Critical points; Indiscernibles; Logical theorems; Mathematical sequences; Mathematical set theory; Mathematical theorems; Mathematics; Ultrafilters; Ultrapowers

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Leaning, Jeffrey Scott, 1. (1999). Disassociated indiscernibles. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/AA00017710

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

Leaning, Jeffrey Scott, 1971-. “Disassociated indiscernibles.” 1999. Doctoral Dissertation, University of Florida. Accessed October 17, 2019. http://ufdc.ufl.edu/AA00017710.

MLA Handbook (7^{th} Edition):

Leaning, Jeffrey Scott, 1971-. “Disassociated indiscernibles.” 1999. Web. 17 Oct 2019.

Vancouver:

Leaning, Jeffrey Scott 1. Disassociated indiscernibles. [Internet] [Doctoral dissertation]. University of Florida; 1999. [cited 2019 Oct 17]. Available from: http://ufdc.ufl.edu/AA00017710.

Council of Science Editors:

Leaning, Jeffrey Scott 1. Disassociated indiscernibles. [Doctoral Dissertation]. University of Florida; 1999. Available from: http://ufdc.ufl.edu/AA00017710

University of Florida

21. Ghosh, Amitava. Approximations to Pi, Dedekind's Eta Function and Modular Equations.

Degree: MS, Mathematics, 2007, University of Florida

URL: http://ufdc.ufl.edu/UFE0021455

► In 1989, Bailey, Borwein and Borwein gave a method for constructing series and algorithms that converge to π to high order using Jacobi's theta-functions. In…
(more)

Subjects/Keywords: Algorithms; Approximation; Graduate schools; High schools; Integers; Linear programming; Mathematical congruence; Mathematical sequences; Mathematics; Polynomials; iteration, maple, pi

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ghosh, A. (2007). Approximations to Pi, Dedekind's Eta Function and Modular Equations. (Masters Thesis). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0021455

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

Ghosh, Amitava. “Approximations to Pi, Dedekind's Eta Function and Modular Equations.” 2007. Masters Thesis, University of Florida. Accessed October 17, 2019. http://ufdc.ufl.edu/UFE0021455.

MLA Handbook (7^{th} Edition):

Ghosh, Amitava. “Approximations to Pi, Dedekind's Eta Function and Modular Equations.” 2007. Web. 17 Oct 2019.

Vancouver:

Ghosh A. Approximations to Pi, Dedekind's Eta Function and Modular Equations. [Internet] [Masters thesis]. University of Florida; 2007. [cited 2019 Oct 17]. Available from: http://ufdc.ufl.edu/UFE0021455.

Council of Science Editors:

Ghosh A. Approximations to Pi, Dedekind's Eta Function and Modular Equations. [Masters Thesis]. University of Florida; 2007. Available from: http://ufdc.ufl.edu/UFE0021455

University of Florida

22. Tadayon, Bita. Algorithms and Complexity Analysis for Integer Multicommodity Network Flow and Robust Single-Machine Scheduling Problems.

Degree: PhD, Industrial and Systems Engineering, 2014, University of Florida

URL: http://ufdc.ufl.edu/UFE0046568

► We address several optimization problems in which data elements are uncertain. For each problem we apply an appropriate method for uncertainty representation, propose efficient *mathematical*…
(more)

Subjects/Keywords: Algorithms; Commodities; Hubs; Linear programming; Mathematical robustness; Mathematical sequences; Mink; Objective functions; Robust optimization; Scheduling; budgeted-uncertainty – complexity-analysis – congestion – cutting-planes – dynamic-programming – integer-programming – linearization – multicommodity-flow – network-optimization – node-reliabilities – robust-optimization – scheduling – single-machine – uncertainty

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tadayon, B. (2014). Algorithms and Complexity Analysis for Integer Multicommodity Network Flow and Robust Single-Machine Scheduling Problems. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0046568

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

Tadayon, Bita. “Algorithms and Complexity Analysis for Integer Multicommodity Network Flow and Robust Single-Machine Scheduling Problems.” 2014. Doctoral Dissertation, University of Florida. Accessed October 17, 2019. http://ufdc.ufl.edu/UFE0046568.

MLA Handbook (7^{th} Edition):

Tadayon, Bita. “Algorithms and Complexity Analysis for Integer Multicommodity Network Flow and Robust Single-Machine Scheduling Problems.” 2014. Web. 17 Oct 2019.

Vancouver:

Tadayon B. Algorithms and Complexity Analysis for Integer Multicommodity Network Flow and Robust Single-Machine Scheduling Problems. [Internet] [Doctoral dissertation]. University of Florida; 2014. [cited 2019 Oct 17]. Available from: http://ufdc.ufl.edu/UFE0046568.

Council of Science Editors:

Tadayon B. Algorithms and Complexity Analysis for Integer Multicommodity Network Flow and Robust Single-Machine Scheduling Problems. [Doctoral Dissertation]. University of Florida; 2014. Available from: http://ufdc.ufl.edu/UFE0046568

University of Florida

23. Adler, André Bruce, 1958-. Some limit theorems for weighted sums of random variables.

Degree: 1987, University of Florida

URL: http://ufdc.ufl.edu/AA00002149

Subjects/Keywords: Infinity; Integers; Law of large numbers; Mathematical constants; Mathematical sequences; Mathematical variables; Mathematics; Perceptron convergence procedure; Random variables; Statistics; Limit theorems (Probability theory)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Adler, André Bruce, 1. (1987). Some limit theorems for weighted sums of random variables. (Thesis). University of Florida. Retrieved from http://ufdc.ufl.edu/AA00002149

Not specified: Masters Thesis or Doctoral Dissertation

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

Adler, André Bruce, 1958-. “Some limit theorems for weighted sums of random variables.” 1987. Thesis, University of Florida. Accessed October 17, 2019. http://ufdc.ufl.edu/AA00002149.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Adler, André Bruce, 1958-. “Some limit theorems for weighted sums of random variables.” 1987. Web. 17 Oct 2019.

Vancouver:

Adler, André Bruce 1. Some limit theorems for weighted sums of random variables. [Internet] [Thesis]. University of Florida; 1987. [cited 2019 Oct 17]. Available from: http://ufdc.ufl.edu/AA00002149.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Adler, André Bruce 1. Some limit theorems for weighted sums of random variables. [Thesis]. University of Florida; 1987. Available from: http://ufdc.ufl.edu/AA00002149

Not specified: Masters Thesis or Doctoral Dissertation

University of Florida

24. Jewett, Robert Stanley, 1945-. Generalizations of the Vitali-Hahn-Saks and Nikodym theorems.

Degree: 1971, University of Florida

URL: http://ufdc.ufl.edu/UF00097676

Subjects/Keywords: Absolute convergence; Banach space; Integers; Mathematical sequences; Mathematical theorems; Mathematical vectors; Mathematics; Perceptron convergence procedure; Series convergence; Topological theorems; Mathematics thesis Ph. D; Measure theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jewett, Robert Stanley, 1. (1971). Generalizations of the Vitali-Hahn-Saks and Nikodym theorems. (Thesis). University of Florida. Retrieved from http://ufdc.ufl.edu/UF00097676

Not specified: Masters Thesis or Doctoral Dissertation

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

Jewett, Robert Stanley, 1945-. “Generalizations of the Vitali-Hahn-Saks and Nikodym theorems.” 1971. Thesis, University of Florida. Accessed October 17, 2019. http://ufdc.ufl.edu/UF00097676.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Jewett, Robert Stanley, 1945-. “Generalizations of the Vitali-Hahn-Saks and Nikodym theorems.” 1971. Web. 17 Oct 2019.

Vancouver:

Jewett, Robert Stanley 1. Generalizations of the Vitali-Hahn-Saks and Nikodym theorems. [Internet] [Thesis]. University of Florida; 1971. [cited 2019 Oct 17]. Available from: http://ufdc.ufl.edu/UF00097676.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jewett, Robert Stanley 1. Generalizations of the Vitali-Hahn-Saks and Nikodym theorems. [Thesis]. University of Florida; 1971. Available from: http://ufdc.ufl.edu/UF00097676

Not specified: Masters Thesis or Doctoral Dissertation

UNIVERSIDADE FEDERAL DE OURO PRETO

25. Daila Silva Seabra de Moura Fonseca. CONVERGÃNCIA DE SEQUÃNCIAS E SÃRIES NUMÃRICAS NO CÃLCULO: UM TRABALHO VISANDO A CORPORIFICAÃÃO DOS CONCEITOS.

Degree: 2012, UNIVERSIDADE FEDERAL DE OURO PRETO

URL: http://www.tede.ufop.br/tde_busca/arquivo.php?codArquivo=919

►

A presente pesquisa buscou verificar se a aplicaÃÃo de atividades, com o auxÃlio do software GeoGebra, favoreceu a corporificaÃÃo dos conceitos de convergÃncia de sequÃncias… (more)

Subjects/Keywords: EducaÃÃo MatemÃtica; TrÃs Mundos da MatemÃtica; Pensamento MatemÃtico AvanÃado; CorporificaÃÃo; ConvergÃncia; SequÃncias e sÃries numÃricas; Mathematics Education; Three Worlds of Mathematics; Advanced Mathematical Thinking; Embodiment; Convergence; Sequences and infinite series; ENSINO-APRENDIZAGEM

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fonseca, D. S. S. d. M. (2012). CONVERGÃNCIA DE SEQUÃNCIAS E SÃRIES NUMÃRICAS NO CÃLCULO: UM TRABALHO VISANDO A CORPORIFICAÃÃO DOS CONCEITOS. (Thesis). UNIVERSIDADE FEDERAL DE OURO PRETO. Retrieved from http://www.tede.ufop.br/tde_busca/arquivo.php?codArquivo=919

Not specified: Masters Thesis or Doctoral Dissertation

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

Fonseca, Daila Silva Seabra de Moura. “CONVERGÃNCIA DE SEQUÃNCIAS E SÃRIES NUMÃRICAS NO CÃLCULO: UM TRABALHO VISANDO A CORPORIFICAÃÃO DOS CONCEITOS.” 2012. Thesis, UNIVERSIDADE FEDERAL DE OURO PRETO. Accessed October 17, 2019. http://www.tede.ufop.br/tde_busca/arquivo.php?codArquivo=919.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Fonseca, Daila Silva Seabra de Moura. “CONVERGÃNCIA DE SEQUÃNCIAS E SÃRIES NUMÃRICAS NO CÃLCULO: UM TRABALHO VISANDO A CORPORIFICAÃÃO DOS CONCEITOS.” 2012. Web. 17 Oct 2019.

Vancouver:

Fonseca DSSdM. CONVERGÃNCIA DE SEQUÃNCIAS E SÃRIES NUMÃRICAS NO CÃLCULO: UM TRABALHO VISANDO A CORPORIFICAÃÃO DOS CONCEITOS. [Internet] [Thesis]. UNIVERSIDADE FEDERAL DE OURO PRETO; 2012. [cited 2019 Oct 17]. Available from: http://www.tede.ufop.br/tde_busca/arquivo.php?codArquivo=919.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fonseca DSSdM. CONVERGÃNCIA DE SEQUÃNCIAS E SÃRIES NUMÃRICAS NO CÃLCULO: UM TRABALHO VISANDO A CORPORIFICAÃÃO DOS CONCEITOS. [Thesis]. UNIVERSIDADE FEDERAL DE OURO PRETO; 2012. Available from: http://www.tede.ufop.br/tde_busca/arquivo.php?codArquivo=919

Not specified: Masters Thesis or Doctoral Dissertation

University of Canterbury

26. Erdös, P. L. The number of nucleotide sites needed to accurately reconstruct large evolutionary trees.

Degree: Dept. of Mathematics, 1996, University of Canterbury

URL: http://hdl.handle.net/10092/11402

► Biologists seek to reconstruct evolutionary trees for increasing number of species, n, from aligned genetic *sequences*. How fast the sequence length N must grow, as…
(more)

Subjects/Keywords: Phylogenetic trees; DNA sequences; Azuma-Hoeffding inequality; phylogenetic invariants; subtrees; Field of Research::01 - Mathematical Sciences

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Erdös, P. L. (1996). The number of nucleotide sites needed to accurately reconstruct large evolutionary trees. (Thesis). University of Canterbury. Retrieved from http://hdl.handle.net/10092/11402

Not specified: Masters Thesis or Doctoral Dissertation

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

Erdös, P L. “The number of nucleotide sites needed to accurately reconstruct large evolutionary trees.” 1996. Thesis, University of Canterbury. Accessed October 17, 2019. http://hdl.handle.net/10092/11402.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Erdös, P L. “The number of nucleotide sites needed to accurately reconstruct large evolutionary trees.” 1996. Web. 17 Oct 2019.

Vancouver:

Erdös PL. The number of nucleotide sites needed to accurately reconstruct large evolutionary trees. [Internet] [Thesis]. University of Canterbury; 1996. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/10092/11402.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Erdös PL. The number of nucleotide sites needed to accurately reconstruct large evolutionary trees. [Thesis]. University of Canterbury; 1996. Available from: http://hdl.handle.net/10092/11402

Not specified: Masters Thesis or Doctoral Dissertation

Queensland University of Technology

27. Burdett, Robert. Sequencing and scheduling theory for mixed-model multi-stage assembly environment.

Degree: 2001, Queensland University of Technology

URL: http://eprints.qut.edu.au/37082/

Subjects/Keywords: Production scheduling Mathematical models; Sequences (Mathematics); sequencing; scheduling; flowshop; mixed-model assembly; heuristics; thesis; doctoral

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Burdett, R. (2001). Sequencing and scheduling theory for mixed-model multi-stage assembly environment. (Thesis). Queensland University of Technology. Retrieved from http://eprints.qut.edu.au/37082/

Not specified: Masters Thesis or Doctoral Dissertation

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

Burdett, Robert. “Sequencing and scheduling theory for mixed-model multi-stage assembly environment.” 2001. Thesis, Queensland University of Technology. Accessed October 17, 2019. http://eprints.qut.edu.au/37082/.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Burdett, Robert. “Sequencing and scheduling theory for mixed-model multi-stage assembly environment.” 2001. Web. 17 Oct 2019.

Vancouver:

Burdett R. Sequencing and scheduling theory for mixed-model multi-stage assembly environment. [Internet] [Thesis]. Queensland University of Technology; 2001. [cited 2019 Oct 17]. Available from: http://eprints.qut.edu.au/37082/.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Burdett R. Sequencing and scheduling theory for mixed-model multi-stage assembly environment. [Thesis]. Queensland University of Technology; 2001. Available from: http://eprints.qut.edu.au/37082/

Not specified: Masters Thesis or Doctoral Dissertation

University of Florida

28. Gao, Li. Adaptive direct sequence code division multiple access (DS-CDMA) systems based on sequence optimization.

Degree: PhD, Electrical and Computer Engineering, 2002, University of Florida

URL: http://ufdc.ufl.edu/AA00039175

Subjects/Keywords: Algorithms; Code division multiple access; Eigenvalues; Mathematical sequences; Matrices; Power efficiency; Receivers; Signal reception; Signals; Transmitters; Code division multiple access

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gao, L. (2002). Adaptive direct sequence code division multiple access (DS-CDMA) systems based on sequence optimization. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/AA00039175

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

Gao, Li. “Adaptive direct sequence code division multiple access (DS-CDMA) systems based on sequence optimization.” 2002. Doctoral Dissertation, University of Florida. Accessed October 17, 2019. http://ufdc.ufl.edu/AA00039175.

MLA Handbook (7^{th} Edition):

Gao, Li. “Adaptive direct sequence code division multiple access (DS-CDMA) systems based on sequence optimization.” 2002. Web. 17 Oct 2019.

Vancouver:

Gao L. Adaptive direct sequence code division multiple access (DS-CDMA) systems based on sequence optimization. [Internet] [Doctoral dissertation]. University of Florida; 2002. [cited 2019 Oct 17]. Available from: http://ufdc.ufl.edu/AA00039175.

Council of Science Editors:

Gao L. Adaptive direct sequence code division multiple access (DS-CDMA) systems based on sequence optimization. [Doctoral Dissertation]. University of Florida; 2002. Available from: http://ufdc.ufl.edu/AA00039175

University of Florida

29. Hsieh, Lienzu L ( Lienzu Lin ), 1946-. Convergence theorems for vector integrals.

Degree: 1981, University of Florida

URL: http://ufdc.ufl.edu/AA00003453

Subjects/Keywords: Banach space; Increasing sequences; Integers; Martingales; Mathematical theorems; Mathematics; Perceptron convergence procedure; Random variables; Stopping distances; Topological theorems; Integrals; Martingales (Mathematics)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hsieh, Lienzu L ( Lienzu Lin ), 1. (1981). Convergence theorems for vector integrals. (Thesis). University of Florida. Retrieved from http://ufdc.ufl.edu/AA00003453

Not specified: Masters Thesis or Doctoral Dissertation

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

Hsieh, Lienzu L ( Lienzu Lin ), 1946-. “Convergence theorems for vector integrals.” 1981. Thesis, University of Florida. Accessed October 17, 2019. http://ufdc.ufl.edu/AA00003453.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hsieh, Lienzu L ( Lienzu Lin ), 1946-. “Convergence theorems for vector integrals.” 1981. Web. 17 Oct 2019.

Vancouver:

Hsieh, Lienzu L ( Lienzu Lin ) 1. Convergence theorems for vector integrals. [Internet] [Thesis]. University of Florida; 1981. [cited 2019 Oct 17]. Available from: http://ufdc.ufl.edu/AA00003453.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hsieh, Lienzu L ( Lienzu Lin ) 1. Convergence theorems for vector integrals. [Thesis]. University of Florida; 1981. Available from: http://ufdc.ufl.edu/AA00003453

Not specified: Masters Thesis or Doctoral Dissertation

University of Florida

30. Zhang, Xu. Multiple Sequence Alignment Solutions and Applications.

Degree: PhD, Computer Engineering - Computer and Information Science and Engineering, 2007, University of Florida

URL: http://ufdc.ufl.edu/UFE0021685

► Multiple sequence alignment is one of the most fundamental problems in bioinformatics. It is widely used in many applications such as protein structure prediction, phylogenetic…
(more)

Subjects/Keywords: Algorithms; Approximation; Bioinformatics; Datasets; Dynamic programming; Genomes; Health savings accounts; Mathematical sequences; Sequence alignment; Vertices; dp, msa, sp

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhang, X. (2007). Multiple Sequence Alignment Solutions and Applications. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0021685

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

Zhang, Xu. “Multiple Sequence Alignment Solutions and Applications.” 2007. Doctoral Dissertation, University of Florida. Accessed October 17, 2019. http://ufdc.ufl.edu/UFE0021685.

MLA Handbook (7^{th} Edition):

Zhang, Xu. “Multiple Sequence Alignment Solutions and Applications.” 2007. Web. 17 Oct 2019.

Vancouver:

Zhang X. Multiple Sequence Alignment Solutions and Applications. [Internet] [Doctoral dissertation]. University of Florida; 2007. [cited 2019 Oct 17]. Available from: http://ufdc.ufl.edu/UFE0021685.

Council of Science Editors:

Zhang X. Multiple Sequence Alignment Solutions and Applications. [Doctoral Dissertation]. University of Florida; 2007. Available from: http://ufdc.ufl.edu/UFE0021685