subject:( Algorithms)

1. Ellis, Alexandra. Emulators to facilitate the development and analysis of computationally expensive decision analytic models in health.

Degree: Department of Health Services, Policy and Practice, 2018, Brown University

URL: https://repository.library.brown.edu/studio/item/bdr:792778/

► In order for a mathematical model to be useful for decision-making, it needs to be detailed enough to capture the salient aspects of the decisional… (more)

▼ In order for a mathematical model to be useful for decision-making, it needs to be detailed enough to capture the salient aspects of the decisional problem. These detailed models can be computationally expensive to develop or use for analyses. An emulator is an approximation of a detailed mathematical model (simulator). Emulators can be used in lieu of simulators for computationally expensive tasks, such as model parameter calibration and value-of-information analyses. Emulators are developed using the output of simulators for specific input values (design points). However, developing an emulator can require a large number of design points, which can become computationally expensive. I proposed a series of algorithms to efficiently select design points for emulators and applied them to a prostate cancer screening simulator. Specifically, I proposed a self-stopping algorithm that efficiently select design points for fitting emulators (Aim 1). With the proposed algorithm, design points are selected with higher density in the regions where the simulator changes ``fast'' for a given change in the inputs. It terminates when there is little improvement in a cross-validation diagnostic, possibly before exhausting a budget. Its postulated advantages over the prevalent approaches are that (1) it self-terminates and (2) it develops emulators with smaller mean squared error. With additional computational budget, the algorithm can be augmented with a diagnostic. I proposed a diagnostic to assess the predictive accuracy of emulators, and use it in a sequential algorithm that further refines emulators to achieve a target level of accuracy (Aim 2). This approach enables users to develop emulators to a target level of accuracy with an additional computational cost. Finally, I proposed an algorithm for using emulators to expedite model calibration (Aim 3). The algorithm starts with an emulator that approximates the simulator over the whole input space, and further refines the emulator by selecting additional design points in areas that have high probability of being a global optimum. This algorithm may be useful to users who wish to efficiently calibrate simulators to target external data. Using the proposed algorithms, emulators can mitigate the computational barriers to wider utilization of complex mathematical models in health. Advisors/Committee Members: Trikalinos, Thomas (Advisor), Iskandar, Rowan (Reader), Schmid, Christopher (Reader), Wong, John (Reader).

Subjects/Keywords: Algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Ellis, A. (2018). Emulators to facilitate the development and analysis of computationally expensive decision analytic models in health. (Thesis). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:792778/

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

Ellis, Alexandra. “Emulators to facilitate the development and analysis of computationally expensive decision analytic models in health.” 2018. Thesis, Brown University. Accessed January 18, 2021. https://repository.library.brown.edu/studio/item/bdr:792778/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Ellis, Alexandra. “Emulators to facilitate the development and analysis of computationally expensive decision analytic models in health.” 2018. Web. 18 Jan 2021.

Vancouver:

Ellis A. Emulators to facilitate the development and analysis of computationally expensive decision analytic models in health. [Internet] [Thesis]. Brown University; 2018. [cited 2021 Jan 18]. Available from: https://repository.library.brown.edu/studio/item/bdr:792778/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ellis A. Emulators to facilitate the development and analysis of computationally expensive decision analytic models in health. [Thesis]. Brown University; 2018. Available from: https://repository.library.brown.edu/studio/item/bdr:792778/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Wake Forest University

2. Rouse, Kathryn Margaret Zuhr. ON THE EFFICIENCY OF ALGORITHMS FOR TENSOR DECOMPOSITIONS AND THEIR APPLICATIONS.

Degree: 2018, Wake Forest University

URL: http://hdl.handle.net/10339/90764

Multi-dimensional arrays, or tensors, are fundamental objects in computational science for their ability to store multi-dimensional data and to encode bilinear forms. We will consider algorithms and applications of the CP and Tucker tensor decompositions, focusing our efforts on optimizing subroutines required to compute tensor decompositions.

Subjects/Keywords: Algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Rouse, K. M. Z. (2018). ON THE EFFICIENCY OF ALGORITHMS FOR TENSOR DECOMPOSITIONS AND THEIR APPLICATIONS. (Thesis). Wake Forest University. Retrieved from http://hdl.handle.net/10339/90764

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

Rouse, Kathryn Margaret Zuhr. “ON THE EFFICIENCY OF ALGORITHMS FOR TENSOR DECOMPOSITIONS AND THEIR APPLICATIONS.” 2018. Thesis, Wake Forest University. Accessed January 18, 2021. http://hdl.handle.net/10339/90764.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Rouse, Kathryn Margaret Zuhr. “ON THE EFFICIENCY OF ALGORITHMS FOR TENSOR DECOMPOSITIONS AND THEIR APPLICATIONS.” 2018. Web. 18 Jan 2021.

Vancouver:

Rouse KMZ. ON THE EFFICIENCY OF ALGORITHMS FOR TENSOR DECOMPOSITIONS AND THEIR APPLICATIONS. [Internet] [Thesis]. Wake Forest University; 2018. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10339/90764.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rouse KMZ. ON THE EFFICIENCY OF ALGORITHMS FOR TENSOR DECOMPOSITIONS AND THEIR APPLICATIONS. [Thesis]. Wake Forest University; 2018. Available from: http://hdl.handle.net/10339/90764

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Rutgers University

3. Francisco, John-Austen. A novel characterization of signal space distortion and its application to the quantification of localization algorithm error.

Degree: PhD, Computer Science, 2015, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/48489/

►

The constant reduction in cost and increase in the power of computing machinery has resulted in an ever-increasing interest and deployment of Internet-enabled sensing systems.… (more)

Subjects/Keywords: Algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Francisco, J. (2015). A novel characterization of signal space distortion and its application to the quantification of localization algorithm error. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/48489/

Chicago Manual of Style (16^th Edition):

Francisco, John-Austen. “A novel characterization of signal space distortion and its application to the quantification of localization algorithm error.” 2015. Doctoral Dissertation, Rutgers University. Accessed January 18, 2021. https://rucore.libraries.rutgers.edu/rutgers-lib/48489/.

MLA Handbook (7^th Edition):

Francisco, John-Austen. “A novel characterization of signal space distortion and its application to the quantification of localization algorithm error.” 2015. Web. 18 Jan 2021.

Vancouver:

Francisco J. A novel characterization of signal space distortion and its application to the quantification of localization algorithm error. [Internet] [Doctoral dissertation]. Rutgers University; 2015. [cited 2021 Jan 18]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/48489/.

Council of Science Editors:

Francisco J. A novel characterization of signal space distortion and its application to the quantification of localization algorithm error. [Doctoral Dissertation]. Rutgers University; 2015. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/48489/

University of Alberta

4. Li, Liwu. Probabilistic analysis of search.

Degree: PhD, Department of Computing Science, 1989, University of Alberta

URL: https://era.library.ualberta.ca/files/3484zk37r

Subjects/Keywords: Algorithms.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Li, L. (1989). Probabilistic analysis of search. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/3484zk37r

Chicago Manual of Style (16^th Edition):

Li, Liwu. “Probabilistic analysis of search.” 1989. Doctoral Dissertation, University of Alberta. Accessed January 18, 2021. https://era.library.ualberta.ca/files/3484zk37r.

MLA Handbook (7^th Edition):

Li, Liwu. “Probabilistic analysis of search.” 1989. Web. 18 Jan 2021.

Vancouver:

Li L. Probabilistic analysis of search. [Internet] [Doctoral dissertation]. University of Alberta; 1989. [cited 2021 Jan 18]. Available from: https://era.library.ualberta.ca/files/3484zk37r.

Council of Science Editors:

Li L. Probabilistic analysis of search. [Doctoral Dissertation]. University of Alberta; 1989. Available from: https://era.library.ualberta.ca/files/3484zk37r

Oregon State University

5. Miyakawa, Yoshihiro. Development of network location algorithm for resource planning and management.

Degree: MS, Industrial Engineering, 1978, Oregon State University

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

► Algorithms capable of automatically drawing Resource Planning and Management (RPM) network models from standard Linear Programming data files are developed. An RPM network is a… (more)

▼ Algorithms capable of automatically drawing Resource Planning and Management (RPM) network models from standard Linear Programming data files are developed. An RPM network is a unique graphical representation that is capable of representing both the primal and the dual model of a mathematical programming problem on a same network model. Each primal decision variable and each dual (Lagrange Multiplier) variable is represented by a node in an RPM network. Unlike a CPM-PERT network, an RPM network must be able to include feedback loops, three different types of nodes, and two types of arrows connecting these nodes. The algorithms presented in this thesis can replace the tedious task of manually drawing an RPM network by an automated computer plotting system which includes a node location algorithm and an arrow routing algorithm. Five different types of algorithms were investigated for the node location problem: rectilinear model, directionaly weighted model, acyclic convergence model, squared distance model, and two-phase model. The two-phase model, the final choice of algorithm, is based upon the basic idea of "pairwise interchange" procedure commonly used for optimizing a facility layout location problem. A special cost evaluation function is developed to realize the technological ordering of nodes. The first phase checks the relative locations of nodes in terms of technological order, while the second phase evaluates the optimality of the resulting configuration. The arrow routing algorithm also consists of two phases: a pin-position ordering model and an open space routing model. The former deals with the ordering of all arrow connections at a node, while the latter uses the concept of macro-routing and macro-tracking to funnel the flows through the open space. The two phases are treated independently but are used jointly to provide a visually balanced and easily understood network drawings. The feasibility of these algorithms was verified by constructing a computerized RPM Network Designer (RAMNED) on a Control Data Corporation Computer Cyber-70 Model 73 and a Gerber flatbed plotter. The program accepts an industry standard input data (IBM's MPS, CDC's APEX, or OSU's REX) for Linear Programming, and automatically produces a finished copy of the network on the flat-bed plotter. The current version of RAMNED is capable of handling up to 70 nodes. Each node may have up to five inflow and five outflow arrows in addition to a flow to an objective function. Computational time requirement varied from 7.9 to 126.0 cpu seconds for a number of problems ranging from 9 to 68 nodes. Advisors/Committee Members: Inoue, Michael S. (advisor).

Subjects/Keywords: Algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Miyakawa, Y. (1978). Development of network location algorithm for resource planning and management. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/43858

Chicago Manual of Style (16^th Edition):

Miyakawa, Yoshihiro. “Development of network location algorithm for resource planning and management.” 1978. Masters Thesis, Oregon State University. Accessed January 18, 2021. http://hdl.handle.net/1957/43858.

MLA Handbook (7^th Edition):

Miyakawa, Yoshihiro. “Development of network location algorithm for resource planning and management.” 1978. Web. 18 Jan 2021.

Vancouver:

Miyakawa Y. Development of network location algorithm for resource planning and management. [Internet] [Masters thesis]. Oregon State University; 1978. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/1957/43858.

Council of Science Editors:

Miyakawa Y. Development of network location algorithm for resource planning and management. [Masters Thesis]. Oregon State University; 1978. Available from: http://hdl.handle.net/1957/43858

Oregon State University

6. Jang, Jai Eun. Design and analysis of robust algorithms for fault tolerant computing.

Degree: PhD, Computer Science, 1990, Oregon State University

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

Subjects/Keywords: Algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Jang, J. E. (1990). Design and analysis of robust algorithms for fault tolerant computing. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/38192

Chicago Manual of Style (16^th Edition):

Jang, Jai Eun. “Design and analysis of robust algorithms for fault tolerant computing.” 1990. Doctoral Dissertation, Oregon State University. Accessed January 18, 2021. http://hdl.handle.net/1957/38192.

MLA Handbook (7^th Edition):

Jang, Jai Eun. “Design and analysis of robust algorithms for fault tolerant computing.” 1990. Web. 18 Jan 2021.

Vancouver:

Jang JE. Design and analysis of robust algorithms for fault tolerant computing. [Internet] [Doctoral dissertation]. Oregon State University; 1990. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/1957/38192.

Council of Science Editors:

Jang JE. Design and analysis of robust algorithms for fault tolerant computing. [Doctoral Dissertation]. Oregon State University; 1990. Available from: http://hdl.handle.net/1957/38192

Nelson Mandela Metropolitan University

7. Kapp, Konrad Phillip. Optimal cycle dating of large financial time series.

Degree: Faculty of Science, 2017, Nelson Mandela Metropolitan University

URL: http://hdl.handle.net/10948/17767

► The study of cycles in the context of economic time series has been active for many decades, if not centuries; however, it was only in… (more)

Subjects/Keywords: Computer algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Kapp, K. P. (2017). Optimal cycle dating of large financial time series. (Thesis). Nelson Mandela Metropolitan University. Retrieved from http://hdl.handle.net/10948/17767

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

Kapp, Konrad Phillip. “Optimal cycle dating of large financial time series.” 2017. Thesis, Nelson Mandela Metropolitan University. Accessed January 18, 2021. http://hdl.handle.net/10948/17767.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Kapp, Konrad Phillip. “Optimal cycle dating of large financial time series.” 2017. Web. 18 Jan 2021.

Vancouver:

Kapp KP. Optimal cycle dating of large financial time series. [Internet] [Thesis]. Nelson Mandela Metropolitan University; 2017. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10948/17767.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kapp KP. Optimal cycle dating of large financial time series. [Thesis]. Nelson Mandela Metropolitan University; 2017. Available from: http://hdl.handle.net/10948/17767

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Cornell University

8. Novikoff, Timothy. Algorithmic Education Theory.

Degree: PhD, Applied Mathematics, 2013, Cornell University

URL: http://hdl.handle.net/1813/33956

► In order to build toward an algorithmic theory of education we construct simple, idealized mathematical models of students, learning, educational software and educational software usage… (more)

Subjects/Keywords: algorithms; education

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Novikoff, T. (2013). Algorithmic Education Theory. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/33956

Chicago Manual of Style (16^th Edition):

Novikoff, Timothy. “Algorithmic Education Theory.” 2013. Doctoral Dissertation, Cornell University. Accessed January 18, 2021. http://hdl.handle.net/1813/33956.

MLA Handbook (7^th Edition):

Novikoff, Timothy. “Algorithmic Education Theory.” 2013. Web. 18 Jan 2021.

Vancouver:

Novikoff T. Algorithmic Education Theory. [Internet] [Doctoral dissertation]. Cornell University; 2013. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/1813/33956.

Council of Science Editors:

Novikoff T. Algorithmic Education Theory. [Doctoral Dissertation]. Cornell University; 2013. Available from: http://hdl.handle.net/1813/33956

9. Satishkumar, M V. Simultaneous scheduling of machines and Agvs using evolutionary optimization algorithms.

Degree: 2010, Jawaharlal Nehru Technological University

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

► High degree of flexibility and quick response times have become essential features of modern manufacturing systems where customers are demanding for a variety of products… (more)

Subjects/Keywords: Genetic Algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Satishkumar, M. V. (2010). Simultaneous scheduling of machines and Agvs using evolutionary optimization algorithms. (Thesis). Jawaharlal Nehru Technological University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/2255

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

Satishkumar, M V. “Simultaneous scheduling of machines and Agvs using evolutionary optimization algorithms.” 2010. Thesis, Jawaharlal Nehru Technological University. Accessed January 18, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/2255.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Satishkumar, M V. “Simultaneous scheduling of machines and Agvs using evolutionary optimization algorithms.” 2010. Web. 18 Jan 2021.

Vancouver:

Satishkumar MV. Simultaneous scheduling of machines and Agvs using evolutionary optimization algorithms. [Internet] [Thesis]. Jawaharlal Nehru Technological University; 2010. [cited 2021 Jan 18]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/2255.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Satishkumar MV. Simultaneous scheduling of machines and Agvs using evolutionary optimization algorithms. [Thesis]. Jawaharlal Nehru Technological University; 2010. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/2255

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

10. Pearce, Roger Allan. Scalable Parallel Algorithms for Massive Scale-free Graphs.

Degree: 2013, Texas Digital Library

URL: http://hdl.handle.net/1969; http://hdl.handle.net/2249.1/66830

► Efficiently storing and processing massive graph data sets is a challenging problem as researchers seek to leverage ???Big Data??? to answer next-generation scientific questions. New… (more)

▼ Efficiently storing and processing massive graph data sets is a challenging problem as researchers seek to leverage ???Big Data??? to answer next-generation scientific questions. New techniques are required to process large scale-free graphs in shared, distributed, and external memory. This dissertation develops new techniques to parallelize the storage, computation, and communication for scale-free graphs with high-degree vertices. Our work facilitates the processing of large real-world graph datasets through the development of parallel algorithms and tools that scale to large computational and memory resources, overcoming challenges not addressed by existing techniques. Our aim is to scale to trillions of edges, and our research is targeted at leadership class supercomputers, clusters with local non-volatile memory, and shared memory systems. We present three novel techniques to address scaling challenges in processing large scale-free graphs. We apply an asynchronous graph traversal technique using prioritized visitor queues that is capable of tolerating data latencies to the external graph storage media and message passing communication. To accommodate large high-degree vertices, we present an edge list partitioning technique that evenly partitions graphs containing high-degree vertices. Finally, we propose a technique we call distributed delegates that distributes and parallelizes the storage, computation, and communication when processing high-degree vertices. The edges of high-degree vertices are distributed, providing additional opportunities for parallelism not present in existing methods. We apply our techniques to multiple graph algorithms: Breadth-First Search, Single Source Shortest Path, Connected Components, K-Core decomposition, Triangle Counting, and Page Rank. Our experimental study of these algorithms demonstrates excellent scalability on supercomputers, clusters with non-volatile memory, and shared memory systems. Our study includes multiple synthetic scale-free graph models, the largest of which has trillion edges, and real-world input graphs. On a supercomputer, we demonstrate scalability up to 131K processors, and improve the best known Graph500 results for IBM BG/P Intrepid by 15%. Advisors/Committee Members: Amato, Nancy M (advisor).

Subjects/Keywords: parallel algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Pearce, R. A. (2013). Scalable Parallel Algorithms for Massive Scale-free Graphs. (Thesis). Texas Digital Library. Retrieved from http://hdl.handle.net/1969; http://hdl.handle.net/2249.1/66830

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

Pearce, Roger Allan. “Scalable Parallel Algorithms for Massive Scale-free Graphs.” 2013. Thesis, Texas Digital Library. Accessed January 18, 2021. http://hdl.handle.net/1969; http://hdl.handle.net/2249.1/66830.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Pearce, Roger Allan. “Scalable Parallel Algorithms for Massive Scale-free Graphs.” 2013. Web. 18 Jan 2021.

Vancouver:

Pearce RA. Scalable Parallel Algorithms for Massive Scale-free Graphs. [Internet] [Thesis]. Texas Digital Library; 2013. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/1969; http://hdl.handle.net/2249.1/66830.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pearce RA. Scalable Parallel Algorithms for Massive Scale-free Graphs. [Thesis]. Texas Digital Library; 2013. Available from: http://hdl.handle.net/1969; http://hdl.handle.net/2249.1/66830

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

11. Crosby, Ralph. Phylogenetic Divergence Time, Algorithms for Improved Accuracy and Performance.

Degree: PhD, Computer Science, 2015, Texas A&M University

URL: http://hdl.handle.net/1969.1/155629

► The inference of species divergence time is a key step in the study of phylogenetics. Methods have been available for the last ten years to… (more)

Subjects/Keywords: Algorithms; Phylogenetics

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Crosby, R. (2015). Phylogenetic Divergence Time, Algorithms for Improved Accuracy and Performance. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155629

Chicago Manual of Style (16^th Edition):

Crosby, Ralph. “Phylogenetic Divergence Time, Algorithms for Improved Accuracy and Performance.” 2015. Doctoral Dissertation, Texas A&M University. Accessed January 18, 2021. http://hdl.handle.net/1969.1/155629.

MLA Handbook (7^th Edition):

Crosby, Ralph. “Phylogenetic Divergence Time, Algorithms for Improved Accuracy and Performance.” 2015. Web. 18 Jan 2021.

Vancouver:

Crosby R. Phylogenetic Divergence Time, Algorithms for Improved Accuracy and Performance. [Internet] [Doctoral dissertation]. Texas A&M University; 2015. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/1969.1/155629.

Council of Science Editors:

Crosby R. Phylogenetic Divergence Time, Algorithms for Improved Accuracy and Performance. [Doctoral Dissertation]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155629

12. Calciu, Irina. Concurrent Algorithms for Emerging Hardware Platforms.

Degree: PhD, Computer Science, 2015, Brown University

URL: https://repository.library.brown.edu/studio/item/bdr:419436/

► Computer architecture has recently seen an explosion of innovation that has enabled more parallel execution, while parallel software systems have been making strides in providing… (more)

Subjects/Keywords: concurrent algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Calciu, I. (2015). Concurrent Algorithms for Emerging Hardware Platforms. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:419436/

Chicago Manual of Style (16^th Edition):

Calciu, Irina. “Concurrent Algorithms for Emerging Hardware Platforms.” 2015. Doctoral Dissertation, Brown University. Accessed January 18, 2021. https://repository.library.brown.edu/studio/item/bdr:419436/.

MLA Handbook (7^th Edition):

Calciu, Irina. “Concurrent Algorithms for Emerging Hardware Platforms.” 2015. Web. 18 Jan 2021.

Vancouver:

Calciu I. Concurrent Algorithms for Emerging Hardware Platforms. [Internet] [Doctoral dissertation]. Brown University; 2015. [cited 2021 Jan 18]. Available from: https://repository.library.brown.edu/studio/item/bdr:419436/.

Council of Science Editors:

Calciu I. Concurrent Algorithms for Emerging Hardware Platforms. [Doctoral Dissertation]. Brown University; 2015. Available from: https://repository.library.brown.edu/studio/item/bdr:419436/

13. Whitney, Michael James. Minterm based search algorithms for two-level minimization of discrete functions.

Degree: Department of Computer Science, 2018, University of Victoria

URL: https://dspace.library.uvic.ca//handle/1828/9643

► Techniques for the heuristic and exact two-level minimization of Boolean and multivalued functions are presented. The work is based on a previously existing algorithmic framework… (more)

Subjects/Keywords: Algorithms

…functional descriptors in random logic design algorithms [BBH+88, MB90]. The size of the… …representation impacts the efficiency of such design algorithms. Two-level logic design is much easier… …parameters, Some two-level minimization algorithms work directly with existing covers, per C H A… …a high-level “template” into which lower level algorithms are inserted, Alba, the… …T R O D U C T IO N 6 The efficacy of the methods, techniques, and algorithms reported…

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Whitney, M. J. (2018). Minterm based search algorithms for two-level minimization of discrete functions. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/9643

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

Whitney, Michael James. “Minterm based search algorithms for two-level minimization of discrete functions.” 2018. Thesis, University of Victoria. Accessed January 18, 2021. https://dspace.library.uvic.ca//handle/1828/9643.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Whitney, Michael James. “Minterm based search algorithms for two-level minimization of discrete functions.” 2018. Web. 18 Jan 2021.

Vancouver:

Whitney MJ. Minterm based search algorithms for two-level minimization of discrete functions. [Internet] [Thesis]. University of Victoria; 2018. [cited 2021 Jan 18]. Available from: https://dspace.library.uvic.ca//handle/1828/9643.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Whitney MJ. Minterm based search algorithms for two-level minimization of discrete functions. [Thesis]. University of Victoria; 2018. Available from: https://dspace.library.uvic.ca//handle/1828/9643

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Wake Forest University

14. Seal, Scott. Optimzing Web Application Fuzzing with Genetic Algorithms and Language Theory.

Degree: 2016, Wake Forest University

URL: http://hdl.handle.net/10339/59321

► The widespread availability and use of computing and internet resources require soft- ware developers to implement secure development standards and rigorous testing to prevent vulnerabilities.… (more)

Subjects/Keywords: evolutionary algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Seal, S. (2016). Optimzing Web Application Fuzzing with Genetic Algorithms and Language Theory. (Thesis). Wake Forest University. Retrieved from http://hdl.handle.net/10339/59321

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

Seal, Scott. “Optimzing Web Application Fuzzing with Genetic Algorithms and Language Theory.” 2016. Thesis, Wake Forest University. Accessed January 18, 2021. http://hdl.handle.net/10339/59321.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Seal, Scott. “Optimzing Web Application Fuzzing with Genetic Algorithms and Language Theory.” 2016. Web. 18 Jan 2021.

Vancouver:

Seal S. Optimzing Web Application Fuzzing with Genetic Algorithms and Language Theory. [Internet] [Thesis]. Wake Forest University; 2016. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10339/59321.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Seal S. Optimzing Web Application Fuzzing with Genetic Algorithms and Language Theory. [Thesis]. Wake Forest University; 2016. Available from: http://hdl.handle.net/10339/59321

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

15. Rush Jr., Larry Edward. FIRST-PRINCIPLES INVESTIGATION OF ELECTRONIC PROPERTIES IN SODIUM-ION ELECTROLYTES FOR SOLID-STATE BATTERY MATERIALS.

Degree: 2017, Wake Forest University

URL: http://hdl.handle.net/10339/82233

► This thesis mainly focuses on characterizing and understanding the electronic properties of sodium-ion electrolytes using first-principles calculations. The core of these calculations is built upon… (more)

Subjects/Keywords: Algorithms

11 more images…

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Rush Jr., L. E. (2017). FIRST-PRINCIPLES INVESTIGATION OF ELECTRONIC PROPERTIES IN SODIUM-ION ELECTROLYTES FOR SOLID-STATE BATTERY MATERIALS. (Thesis). Wake Forest University. Retrieved from http://hdl.handle.net/10339/82233

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

Rush Jr., Larry Edward. “FIRST-PRINCIPLES INVESTIGATION OF ELECTRONIC PROPERTIES IN SODIUM-ION ELECTROLYTES FOR SOLID-STATE BATTERY MATERIALS.” 2017. Thesis, Wake Forest University. Accessed January 18, 2021. http://hdl.handle.net/10339/82233.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Rush Jr., Larry Edward. “FIRST-PRINCIPLES INVESTIGATION OF ELECTRONIC PROPERTIES IN SODIUM-ION ELECTROLYTES FOR SOLID-STATE BATTERY MATERIALS.” 2017. Web. 18 Jan 2021.

Vancouver:

Rush Jr. LE. FIRST-PRINCIPLES INVESTIGATION OF ELECTRONIC PROPERTIES IN SODIUM-ION ELECTROLYTES FOR SOLID-STATE BATTERY MATERIALS. [Internet] [Thesis]. Wake Forest University; 2017. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10339/82233.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rush Jr. LE. FIRST-PRINCIPLES INVESTIGATION OF ELECTRONIC PROPERTIES IN SODIUM-ION ELECTROLYTES FOR SOLID-STATE BATTERY MATERIALS. [Thesis]. Wake Forest University; 2017. Available from: http://hdl.handle.net/10339/82233

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Oregon State University

16. Butler, Karen Jensen. An algorithm for determining the convex hull of N points in 3-space.

Degree: MS, Mathematics, 1963, Oregon State University

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

► An algorithm is described for determining the vertices and supporting planes (or lines) of the convex hull of a given set of N distinct points… (more)

Subjects/Keywords: Algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Butler, K. J. (1963). An algorithm for determining the convex hull of N points in 3-space. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/48642

Chicago Manual of Style (16^th Edition):

Butler, Karen Jensen. “An algorithm for determining the convex hull of N points in 3-space.” 1963. Masters Thesis, Oregon State University. Accessed January 18, 2021. http://hdl.handle.net/1957/48642.

MLA Handbook (7^th Edition):

Butler, Karen Jensen. “An algorithm for determining the convex hull of N points in 3-space.” 1963. Web. 18 Jan 2021.

Vancouver:

Butler KJ. An algorithm for determining the convex hull of N points in 3-space. [Internet] [Masters thesis]. Oregon State University; 1963. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/1957/48642.

Council of Science Editors:

Butler KJ. An algorithm for determining the convex hull of N points in 3-space. [Masters Thesis]. Oregon State University; 1963. Available from: http://hdl.handle.net/1957/48642

Oregon State University

17. Anderson, Sandra Elaine. Some computational schemes equivalent to Turing machines.

Degree: MS, Mathematics, 1963, Oregon State University

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

Computational scheme, equivalence, and Turing machine are defined. Some computational schemes are examined and shown to be equivalent to the computational scheme of a Turing machine. Advisors/Committee Members: Goheen, Harry (advisor).

Subjects/Keywords: Algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Anderson, S. E. (1963). Some computational schemes equivalent to Turing machines. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/48819

Chicago Manual of Style (16^th Edition):

Anderson, Sandra Elaine. “Some computational schemes equivalent to Turing machines.” 1963. Masters Thesis, Oregon State University. Accessed January 18, 2021. http://hdl.handle.net/1957/48819.

MLA Handbook (7^th Edition):

Anderson, Sandra Elaine. “Some computational schemes equivalent to Turing machines.” 1963. Web. 18 Jan 2021.

Vancouver:

Anderson SE. Some computational schemes equivalent to Turing machines. [Internet] [Masters thesis]. Oregon State University; 1963. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/1957/48819.

Council of Science Editors:

Anderson SE. Some computational schemes equivalent to Turing machines. [Masters Thesis]. Oregon State University; 1963. Available from: http://hdl.handle.net/1957/48819

Oregon State University

18. Comstock, Dale R. Machine algorithms for Boolean matrices.

Degree: MS, Mathematics, 1962, Oregon State University

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

Subjects/Keywords: Algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Comstock, D. R. (1962). Machine algorithms for Boolean matrices. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/49060

Chicago Manual of Style (16^th Edition):

Comstock, Dale R. “Machine algorithms for Boolean matrices.” 1962. Masters Thesis, Oregon State University. Accessed January 18, 2021. http://hdl.handle.net/1957/49060.

MLA Handbook (7^th Edition):

Comstock, Dale R. “Machine algorithms for Boolean matrices.” 1962. Web. 18 Jan 2021.

Vancouver:

Comstock DR. Machine algorithms for Boolean matrices. [Internet] [Masters thesis]. Oregon State University; 1962. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/1957/49060.

Council of Science Editors:

Comstock DR. Machine algorithms for Boolean matrices. [Masters Thesis]. Oregon State University; 1962. Available from: http://hdl.handle.net/1957/49060

Oregon State University

19. Dum, Stephen Anthony. A fast division algorithm.

Degree: PhD, Computer Science, 1975, Oregon State University

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

► A radix 2n non-restoring division algorithm is described. The algorithm is designed to be compatible with hardware multiprecision multiplication methods currectly used in high speed… (more)

Subjects/Keywords: Algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Dum, S. A. (1975). A fast division algorithm. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/44160

Chicago Manual of Style (16^th Edition):

Dum, Stephen Anthony. “A fast division algorithm.” 1975. Doctoral Dissertation, Oregon State University. Accessed January 18, 2021. http://hdl.handle.net/1957/44160.

MLA Handbook (7^th Edition):

Dum, Stephen Anthony. “A fast division algorithm.” 1975. Web. 18 Jan 2021.

Vancouver:

Dum SA. A fast division algorithm. [Internet] [Doctoral dissertation]. Oregon State University; 1975. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/1957/44160.

Council of Science Editors:

Dum SA. A fast division algorithm. [Doctoral Dissertation]. Oregon State University; 1975. Available from: http://hdl.handle.net/1957/44160

Oregon State University

20. Nelson, Thomas Clayton. Universal computing systems. Part 1, Simulation of any Normal Algorithm by Turing machine. Part 2, A universal Turing machine to translate any Turing machine to a Normal Algorithm.

Degree: PhD, Mathematics, 1969, Oregon State University

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

► In this paper a direct, constructive proof of the equivalence of the Normal Algorithm and Turing machine using the Turing machines NAS (Normal Algorithm Simulator)… (more)

Subjects/Keywords: Algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Nelson, T. C. (1969). Universal computing systems. Part 1, Simulation of any Normal Algorithm by Turing machine. Part 2, A universal Turing machine to translate any Turing machine to a Normal Algorithm. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/17119

Chicago Manual of Style (16^th Edition):

Nelson, Thomas Clayton. “Universal computing systems. Part 1, Simulation of any Normal Algorithm by Turing machine. Part 2, A universal Turing machine to translate any Turing machine to a Normal Algorithm.” 1969. Doctoral Dissertation, Oregon State University. Accessed January 18, 2021. http://hdl.handle.net/1957/17119.

MLA Handbook (7^th Edition):

Nelson, Thomas Clayton. “Universal computing systems. Part 1, Simulation of any Normal Algorithm by Turing machine. Part 2, A universal Turing machine to translate any Turing machine to a Normal Algorithm.” 1969. Web. 18 Jan 2021.

Vancouver:

Nelson TC. Universal computing systems. Part 1, Simulation of any Normal Algorithm by Turing machine. Part 2, A universal Turing machine to translate any Turing machine to a Normal Algorithm. [Internet] [Doctoral dissertation]. Oregon State University; 1969. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/1957/17119.

Council of Science Editors:

Nelson TC. Universal computing systems. Part 1, Simulation of any Normal Algorithm by Turing machine. Part 2, A universal Turing machine to translate any Turing machine to a Normal Algorithm. [Doctoral Dissertation]. Oregon State University; 1969. Available from: http://hdl.handle.net/1957/17119

Oregon State University

21. Weingarten, Frederick Wesley. On triangulations of fixed points in the plane.

Degree: PhD, Mathematics, 1966, Oregon State University

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

► A theory of straight line triangulations of points in the plane is developed. A basic transformation is presented, and it is shown that any triangulation… (more)

Subjects/Keywords: Algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Weingarten, F. W. (1966). On triangulations of fixed points in the plane. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/17402

Chicago Manual of Style (16^th Edition):

Weingarten, Frederick Wesley. “On triangulations of fixed points in the plane.” 1966. Doctoral Dissertation, Oregon State University. Accessed January 18, 2021. http://hdl.handle.net/1957/17402.

MLA Handbook (7^th Edition):

Weingarten, Frederick Wesley. “On triangulations of fixed points in the plane.” 1966. Web. 18 Jan 2021.

Vancouver:

Weingarten FW. On triangulations of fixed points in the plane. [Internet] [Doctoral dissertation]. Oregon State University; 1966. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/1957/17402.

Council of Science Editors:

Weingarten FW. On triangulations of fixed points in the plane. [Doctoral Dissertation]. Oregon State University; 1966. Available from: http://hdl.handle.net/1957/17402

Oregon State University

22. Balogh, Mária Edith Csermelyi. On scheduling algorithms.

Degree: PhD, Mathematics, 1964, Oregon State University

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

General techniques for constructing Scheduling Algorithms are described as well as their applications to two diverse problems, namely the scheduling at a university and the imitation of the activity of a taxonomist in microbiology. Advisors/Committee Members: Goheen, Harry E. (advisor).

Subjects/Keywords: Algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Balogh, M. E. C. (1964). On scheduling algorithms. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/17457

Chicago Manual of Style (16^th Edition):

Balogh, Mária Edith Csermelyi. “On scheduling algorithms.” 1964. Doctoral Dissertation, Oregon State University. Accessed January 18, 2021. http://hdl.handle.net/1957/17457.

MLA Handbook (7^th Edition):

Balogh, Mária Edith Csermelyi. “On scheduling algorithms.” 1964. Web. 18 Jan 2021.

Vancouver:

Balogh MEC. On scheduling algorithms. [Internet] [Doctoral dissertation]. Oregon State University; 1964. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/1957/17457.

Council of Science Editors:

Balogh MEC. On scheduling algorithms. [Doctoral Dissertation]. Oregon State University; 1964. Available from: http://hdl.handle.net/1957/17457

Michigan State University

23. Joachim, Dale. Multiweight optimization in optimal bounding ellipsoid algorithms.

Degree: PhD, Department of Electrical Engineering, 1998, Michigan State University

URL: http://etd.lib.msu.edu/islandora/object/etd:27819

Subjects/Keywords: Algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Joachim, D. (1998). Multiweight optimization in optimal bounding ellipsoid algorithms. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:27819

Chicago Manual of Style (16^th Edition):

Joachim, Dale. “Multiweight optimization in optimal bounding ellipsoid algorithms.” 1998. Doctoral Dissertation, Michigan State University. Accessed January 18, 2021. http://etd.lib.msu.edu/islandora/object/etd:27819.

MLA Handbook (7^th Edition):

Joachim, Dale. “Multiweight optimization in optimal bounding ellipsoid algorithms.” 1998. Web. 18 Jan 2021.

Vancouver:

Joachim D. Multiweight optimization in optimal bounding ellipsoid algorithms. [Internet] [Doctoral dissertation]. Michigan State University; 1998. [cited 2021 Jan 18]. Available from: http://etd.lib.msu.edu/islandora/object/etd:27819.

Council of Science Editors:

Joachim D. Multiweight optimization in optimal bounding ellipsoid algorithms. [Doctoral Dissertation]. Michigan State University; 1998. Available from: http://etd.lib.msu.edu/islandora/object/etd:27819

Michigan State University

24. Lin, Tsung-Ming. Optimal bounding ellipsoid algorithms with automatic bound estimation.

Degree: PhD, Department of Electrical Engineering, 1996, Michigan State University

URL: http://etd.lib.msu.edu/islandora/object/etd:26165

Subjects/Keywords: Algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Lin, T. (1996). Optimal bounding ellipsoid algorithms with automatic bound estimation. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:26165

Chicago Manual of Style (16^th Edition):

Lin, Tsung-Ming. “Optimal bounding ellipsoid algorithms with automatic bound estimation.” 1996. Doctoral Dissertation, Michigan State University. Accessed January 18, 2021. http://etd.lib.msu.edu/islandora/object/etd:26165.

MLA Handbook (7^th Edition):

Lin, Tsung-Ming. “Optimal bounding ellipsoid algorithms with automatic bound estimation.” 1996. Web. 18 Jan 2021.

Vancouver:

Lin T. Optimal bounding ellipsoid algorithms with automatic bound estimation. [Internet] [Doctoral dissertation]. Michigan State University; 1996. [cited 2021 Jan 18]. Available from: http://etd.lib.msu.edu/islandora/object/etd:26165.

Council of Science Editors:

Lin T. Optimal bounding ellipsoid algorithms with automatic bound estimation. [Doctoral Dissertation]. Michigan State University; 1996. Available from: http://etd.lib.msu.edu/islandora/object/etd:26165

Michigan State University

25. Guthery, Scott B. An inversion algorithm for one-dimensional F-expansions.

Degree: PhD, Department of Statistics and Probability, 1969, Michigan State University

URL: http://etd.lib.msu.edu/islandora/object/etd:40636

Subjects/Keywords: Algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Guthery, S. B. (1969). An inversion algorithm for one-dimensional F-expansions. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:40636

Chicago Manual of Style (16^th Edition):

Guthery, Scott B. “An inversion algorithm for one-dimensional F-expansions.” 1969. Doctoral Dissertation, Michigan State University. Accessed January 18, 2021. http://etd.lib.msu.edu/islandora/object/etd:40636.

MLA Handbook (7^th Edition):

Guthery, Scott B. “An inversion algorithm for one-dimensional F-expansions.” 1969. Web. 18 Jan 2021.

Vancouver:

Guthery SB. An inversion algorithm for one-dimensional F-expansions. [Internet] [Doctoral dissertation]. Michigan State University; 1969. [cited 2021 Jan 18]. Available from: http://etd.lib.msu.edu/islandora/object/etd:40636.

Council of Science Editors:

Guthery SB. An inversion algorithm for one-dimensional F-expansions. [Doctoral Dissertation]. Michigan State University; 1969. Available from: http://etd.lib.msu.edu/islandora/object/etd:40636

University of Ontario Institute of Technology

26. Tanaka, Richard. A few randomized protocols in peer-to-peer networks.

Degree: 2019, University of Ontario Institute of Technology

URL: http://hdl.handle.net/10155/1092

► This thesis studies a few randomized algorithms in application-layer peer-to-peer networks. The significant gain in scalability and resilience that peer-to-peer networks provide has made them… (more)

Subjects/Keywords: Random; Algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Tanaka, R. (2019). A few randomized protocols in peer-to-peer networks. (Thesis). University of Ontario Institute of Technology. Retrieved from http://hdl.handle.net/10155/1092

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

Tanaka, Richard. “A few randomized protocols in peer-to-peer networks.” 2019. Thesis, University of Ontario Institute of Technology. Accessed January 18, 2021. http://hdl.handle.net/10155/1092.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Tanaka, Richard. “A few randomized protocols in peer-to-peer networks.” 2019. Web. 18 Jan 2021.

Vancouver:

Tanaka R. A few randomized protocols in peer-to-peer networks. [Internet] [Thesis]. University of Ontario Institute of Technology; 2019. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10155/1092.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tanaka R. A few randomized protocols in peer-to-peer networks. [Thesis]. University of Ontario Institute of Technology; 2019. Available from: http://hdl.handle.net/10155/1092

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Queens University

27. Torbey, Sami. Beneath the surface electrocardiogram: computer algorithms for the non-invasive assessment of cardiac electrophysiology .

Degree: Computing, 2013, Queens University

URL: http://hdl.handle.net/1974/8392

► The surface electrocardiogram (ECG) is a periodic signal portraying the electrical activity of the heart from the torso. The past fifty years have witnessed a… (more)

▼ The surface electrocardiogram (ECG) is a periodic signal portraying the electrical activity of the heart from the torso. The past fifty years have witnessed a proliferation of computer algorithms destined for ECG analysis. Signal averaging is a noise reduction technique believed to enable the surface ECG to act as a non-invasive surrogate for cardiac electrophysiology. The P wave and the QRS complex of the ECG respectively depict atrial and ventricular depolarization. QRS detection is a pre-requisite to P wave and QRS averaging. A novel algorithm for robust QRS detection in mice achieves a four-fold reduction in false detections compared to leading commercial software, while its human version boasts an error rate of just 0.29% on a public database containing ECGs with varying morphologies and degrees of noise. A fully automated P wave and QRS averaging and onset/offset detection algorithm is also proposed. This approach is shown to predict atrial fibrillation, a common cardiac arrhythmia which could cause stroke or heart failure, from normal asymptomatic ECGs, with 93% sensitivity and 100% specificity. Automated signal averaging also proves to be slightly more reproducible in consecutive recordings than manual signal averaging performed by expert users. Several studies postulated that high-frequency energy content in the signal-averaged QRS may be a marker of sudden cardiac death. Traditional frequency spectrum analysis techniques have failed to consistently validate this hypothesis. Layered Symbolic Decomposition (LSD), a novel algorithmic time-scale analysis approach requiring no basis function assumptions, is presented. LSD proves more reproducible than state-of-the-art algorithms, and capable of predicting sudden cardiac death in the general population from the surface ECG with 97% sensitivity and 96% specificity. A link between atrial refractory period and high-frequency energy content of the signal-averaged P wave is also considered, but neither LSD nor other algorithms find a meaningful correlation. LSD is not ECG-specific and may be effective in countless other signals with no known single basis function, such as other bio-potentials, geophysical signals, and socio-economic trends.

Subjects/Keywords: ECG ; Algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Torbey, S. (2013). Beneath the surface electrocardiogram: computer algorithms for the non-invasive assessment of cardiac electrophysiology . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/8392

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

Torbey, Sami. “Beneath the surface electrocardiogram: computer algorithms for the non-invasive assessment of cardiac electrophysiology .” 2013. Thesis, Queens University. Accessed January 18, 2021. http://hdl.handle.net/1974/8392.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Torbey, Sami. “Beneath the surface electrocardiogram: computer algorithms for the non-invasive assessment of cardiac electrophysiology .” 2013. Web. 18 Jan 2021.

Vancouver:

Torbey S. Beneath the surface electrocardiogram: computer algorithms for the non-invasive assessment of cardiac electrophysiology . [Internet] [Thesis]. Queens University; 2013. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/1974/8392.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Torbey S. Beneath the surface electrocardiogram: computer algorithms for the non-invasive assessment of cardiac electrophysiology . [Thesis]. Queens University; 2013. Available from: http://hdl.handle.net/1974/8392

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Kansas State University

28. Vijayendra, Siravara. A study of a short term correlation algorithm.

Degree: 1982, Kansas State University

URL: http://hdl.handle.net/2097/9617

Subjects/Keywords: Algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Vijayendra, S. (1982). A study of a short term correlation algorithm. (Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/9617

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

Vijayendra, Siravara. “A study of a short term correlation algorithm.” 1982. Thesis, Kansas State University. Accessed January 18, 2021. http://hdl.handle.net/2097/9617.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Vijayendra, Siravara. “A study of a short term correlation algorithm.” 1982. Web. 18 Jan 2021.

Vancouver:

Vijayendra S. A study of a short term correlation algorithm. [Internet] [Thesis]. Kansas State University; 1982. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/2097/9617.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Vijayendra S. A study of a short term correlation algorithm. [Thesis]. Kansas State University; 1982. Available from: http://hdl.handle.net/2097/9617

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Montana

29. Schuman, Elmer Luis. Three characterizations of algorithm.

Degree: MA, 1966, University of Montana

URL: https://scholarworks.umt.edu/etd/8190

Subjects/Keywords: Algorithms.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Schuman, E. L. (1966). Three characterizations of algorithm. (Masters Thesis). University of Montana. Retrieved from https://scholarworks.umt.edu/etd/8190

Chicago Manual of Style (16^th Edition):

Schuman, Elmer Luis. “Three characterizations of algorithm.” 1966. Masters Thesis, University of Montana. Accessed January 18, 2021. https://scholarworks.umt.edu/etd/8190.

MLA Handbook (7^th Edition):

Schuman, Elmer Luis. “Three characterizations of algorithm.” 1966. Web. 18 Jan 2021.

Vancouver:

Schuman EL. Three characterizations of algorithm. [Internet] [Masters thesis]. University of Montana; 1966. [cited 2021 Jan 18]. Available from: https://scholarworks.umt.edu/etd/8190.

Council of Science Editors:

Schuman EL. Three characterizations of algorithm. [Masters Thesis]. University of Montana; 1966. Available from: https://scholarworks.umt.edu/etd/8190

University of British Columbia

30. Kallberg, Jarl Gunnar. Implementable algorithms for stochastic nonlinear programs with applications to portfolio selection and revision.

Degree: PhD, Business Administration, 1979, University of British Columbia

URL: http://hdl.handle.net/2429/22205

► This dissertation has two main objectives: first, to develop efficient algorithms for the solution of one and two period constrained optimization problems, and second, to… (more)

▼ This dissertation has two main objectives: first, to develop efficient algorithms for the solution of one and two period constrained optimization problems, and second, to apply these methods to the solution of portfolio selection and revision problems. The algorithms developed are based upon the Frank-Wolfe method. A convergent algorithm is developed which modifies this approach to allow for sequences of approximations to the objective and to the gradient of the objective, as well as inexact linear searches. By utilizing varying degrees of accuracy (with increasing precision as the optimum is approached), the method will be computationally more tractable than fixed tolerance methods without sacrificing the convergence properties. This algorithm is then applied to a static portfolio selection problem. Here the investor has a wealth allotment to be allocated to a number of possible risky investments with the objective of maximizing the expected utility of terminal wealth. The investor's preferences are assumed to be given by a (von-Neumann-Morgenstern) utility function. For the empirical studies seven classes of utility functions and ten joint normally distributed assets are used. One question investigated is the degree to which the Arrow-Pratt risk aversion measure determines portfolio composition. The empirical results are augmented by a theorem showing (for normally distributed security returns) that the Rubinstein global risk aversion measure is sufficient to determine portfolio composition. The second part of this dissertation deals with two period problems. An algorithm, based on the method of Hogan for extremal value functions, is developed. The extensions (and subsequent advantages) are analogous to those developed for the one period problem. This method is used to solve a portfolio revision problem utilizing five joint normally distributed assets and proportional transaction costs. Empirically, it is shown that significant errors are generated by ignoring the revision aspect of the problem, even with serially uncorrelated returns.

Subjects/Keywords: Algorithms.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Kallberg, J. G. (1979). Implementable algorithms for stochastic nonlinear programs with applications to portfolio selection and revision. (Doctoral Dissertation). University of British Columbia. Retrieved from http://hdl.handle.net/2429/22205

Chicago Manual of Style (16^th Edition):

Kallberg, Jarl Gunnar. “Implementable algorithms for stochastic nonlinear programs with applications to portfolio selection and revision.” 1979. Doctoral Dissertation, University of British Columbia. Accessed January 18, 2021. http://hdl.handle.net/2429/22205.

MLA Handbook (7^th Edition):

Kallberg, Jarl Gunnar. “Implementable algorithms for stochastic nonlinear programs with applications to portfolio selection and revision.” 1979. Web. 18 Jan 2021.

Vancouver:

Kallberg JG. Implementable algorithms for stochastic nonlinear programs with applications to portfolio selection and revision. [Internet] [Doctoral dissertation]. University of British Columbia; 1979. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/2429/22205.

Council of Science Editors:

Kallberg JG. Implementable algorithms for stochastic nonlinear programs with applications to portfolio selection and revision. [Doctoral Dissertation]. University of British Columbia; 1979. Available from: http://hdl.handle.net/2429/22205

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations