Dissertations / Theses on the topic '080200 Computation Theory and Mathematics'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic '080200 Computation Theory and Mathematics.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Bryant, Ross. "A Computation of Partial Isomorphism Rank on Ordinal Structures." Thesis, University of North Texas, 2006. https://digital.library.unt.edu/ark:/67531/metadc5387/.
Full textZhang, Yue. "Sparsity in Image Processing and Machine Learning: Modeling, Computation and Theory." Case Western Reserve University School of Graduate Studies / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=case1523017795312546.
Full textSemegni, Jean Yves. "On the computation of freely generated modular lattices." Thesis, Stellenbosch : Stellenbosch University, 2008. http://hdl.handle.net/10019.1/1207.
Full textKhafizov, Farid T. "Descriptions and Computation of Ultrapowers in L(R)." Thesis, University of North Texas, 1995. https://digital.library.unt.edu/ark:/67531/metadc277867/.
Full textTheeranaew, Wanchat. "STUDY ON INFORMATION THEORY: CONNECTION TO CONTROL THEORY, APPROACH AND ANALYSIS FOR COMPUTATION." Case Western Reserve University School of Graduate Studies / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=case1416847576.
Full textMarsden, Daniel. "Logical aspects of quantum computation." Thesis, University of Oxford, 2015. http://ora.ox.ac.uk/objects/uuid:e99331a3-9d93-4381-8075-ad843fb9b77c.
Full textHeyman, Joseph Lee. "On the Computation of Strategically Equivalent Games." The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1561984858706805.
Full textEngdahl, Erik. "Computation of resonance energies and spectral densities in the complex energy plane : application of complex scaling techniques for atoms, molecules and surfaces /." Uppsala : Uppsala Universitet, 1988. http://bibpurl.oclc.org/web/32938.
Full textWhaley, Dewey Lonzo. "The Interquartile Range: Theory and Estimation." Digital Commons @ East Tennessee State University, 2005. https://dc.etsu.edu/etd/1030.
Full textTung, Jen-Fu. "An Algorithm to Generate Two-Dimensional Drawings of Conway Algebraic Knots." TopSCHOLAR®, 2010. http://digitalcommons.wku.edu/theses/163.
Full textJohnson, Tomas. "Computer-aided Computation of Abelian integrals and Robust Normal Forms." Doctoral thesis, Uppsala universitet, Matematiska institutionen, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-107519.
Full textSivan, D. D. "Design and structural modifications of vibratory systems to achieve prescribed modal spectra /." Title page, contents and abstract only, 1997. http://web4.library.adelaide.edu.au/theses/09PH/09phs6238.pdf.
Full textMbangeni, Litha. "Development of methods for parallel computation of the solution of the problem for optimal control." Thesis, Cape Peninsula University of Technology, 2010. http://hdl.handle.net/20.500.11838/1110.
Full textOptimal control of fermentation processes is necessary for better behaviour of the process in order to achieve maximum production of product and biomass. The problem for optimal control is a very complex nonlinear, dynamic problem requiring long time for calculation Application of decomposition-coordinating methods for the solution of this type of problems simplifies the solution if it is implemented in a parallel way in a cluster of computers. Parallel computing can reduce tremendously the time of calculation through process of distribution and parallelization of the computation algorithm. These processes can be achieved in different ways using the characteristics of the problem for optimal control. Problem for optimal control of a fed-batch, batch and continuous fermentation processes for production of biomass and product are formulated. The problems are based on a criterion for maximum production of biomass at the end of the fermentation process for the fed-batch process, maximum production of metabolite at the end of the fermentation for the batch fermentation process and minimum time for achieving steady state fermentor behavior for the continuous process and on unstructured mass balance biological models incorporating in the kinetic coefficients, the physiochemical variables considered as control inputs. An augmented functional of Lagrange is applied and its decomposition in time domain is used with a new coordinating vector. Parallel computing in a Matlab cluster is used to solve the above optimal control problems. The calculations and tasks allocation to the cluster workers are based on a shared memory architecture. Real-time control implementation of calculation algorithms using a cluster of computers allows quick and simpler solutions to the optimal control problems.
Torstensson, Johan. "Computation of Mileage Limits for Traveling Salesmen by Means of Optimization Techniques." Thesis, Linköping University, Department of Mathematics, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-12473.
Full textMany companies have traveling salesmen that market and sell their products.This results in much traveling by car due to the daily customer visits. Thiscauses costs for the company, in form of travel expenses compensation, and environmentaleffects, in form of carbon dioxide pollution. As many companies arecertified according to environmental management systems, such as ISO 14001,the environmental work becomes more and more important as the environmentalconsciousness increases every day for companies, authorities and public.The main task of this thesis is to compute reasonable limits on the mileage ofthe salesmen; these limits are based on specific conditions for each salesman’sdistrict. The objective is to implement a heuristic algorithm that optimizes thecustomer tours for an arbitrary chosen month, which will represent a “standard”month. The output of the algorithm, the computed distances, will constitute amileage limit for the salesman.The algorithm consists of a constructive heuristic that builds an initial solution,which is modified if infeasible. This solution is then improved by a local searchalgorithm preceding a genetic algorithm, which task is to improve the toursseparately.This method for computing mileage limits for traveling salesmen generates goodsolutions in form of realistic tours. The mileage limits could be improved if theinput data were more accurate and adjusted to each district, but the suggestedmethod does what it is supposed to do.
Sheppeard, Marni Dee. "Gluon Phenomenology and a Linear Topos." Thesis, University of Canterbury. Physics and Astronomy, 2007. http://hdl.handle.net/10092/1436.
Full textAndujo, Nicholas R. "Progenitors Involving Simple Groups." CSUSB ScholarWorks, 1986. https://scholarworks.lib.csusb.edu/etd/758.
Full textBurgos, Sylvestre Jean-Baptiste Louis. "The computation of Greeks with multilevel Monte Carlo." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:6453a93b-9daf-4bfe-8c77-9cd6802f77dd.
Full textQin, Yu. "Computations and Algorithms in Physical and Biological Problems." Thesis, Harvard University, 2014. http://dissertations.umi.com/gsas.harvard:11478.
Full textEngineering and Applied Sciences
Hansen, Brian Francis. "Explicit Computations Supporting a Generalization of Serre's Conjecture." Diss., CLICK HERE for online access, 2005. http://contentdm.lib.byu.edu/ETD/image/etd842.pdf.
Full textDevore, Lucas Clay. "Random Walks with Elastic and Reflective Lower Boundaries." TopSCHOLAR®, 2009. http://digitalcommons.wku.edu/theses/134.
Full textBarbier, Morgan. "Décodage en liste et application à la sécurité de l'information." Phd thesis, Ecole Polytechnique X, 2011. http://pastel.archives-ouvertes.fr/pastel-00677421.
Full textBispo, Danilo Gustavo. "Dos fundamentos da matemática ao surgimento da teoria da computação por Alan Turing." Pontifícia Universidade Católica de São Paulo, 2013. https://tede2.pucsp.br/handle/handle/13286.
Full textIn this paper I present initially in order to contextualize the influences involved in the emergence of the theory of Alan Turing computability on a history of some issues that mobilized mathematicians in the early twentieth century. In chapter 1, an overview will be exposed to the emergence of ideology Formalist designed by mathematician David Hilbert in the early twentieth century. The aim was to base the formalism elementary mathematics from the method and axiomatic theories eliminating contradictions and paradoxes. Although Hilbert has not obtained full success in your program, it will be demonstrated how their ideas influenced the development of the theory of computation Turing. The theory proposes that Turing is a decision procedure, a method that analyzes any arbitrary formula of logic and determines whether it is likely or not. Turing proves that there can be no general decision. For that will be used as a primary source document On Computable Numbers, with an application to the Entscheidungsproblem. In Chapter 2, you will see the main sections of the document Turing exploring some of its concepts. The project will be completed with a critique of this classic text in the history of mathematics based on historiographical proposals presented in the first chapter
Neste texto apresento inicialmente com o intuito de contextualizar as influências envolvidas no surgimento da teoria de Alan Turing sobre computabilidade um histórico de algum problemas que mobilizaram os matemáticos no início do século XX. No capítulo 1, será exposto um panorama do surgimento da ideologia formalista concebida pelo matemático David Hilbert no início do século XX. O objetivo do formalismo era de fundamentar a matemática elementar a partir do método e axiomático, eliminando das teorias suas contradições e paradoxos. Embora Hilbert não tenha obtido pleno êxito em seu programa, será demonstrado como suas concepções influenciaram o desenvolvimento da teoria da computação de Turing. A teoria que Turing propõe é um procedimento de decisão, um método que analisa qualquer fórmula arbitrária da lógica e determina se ela é provável ou não. Turing prova que nenhuma decisão geral pode existir. Para tanto será utilizado como fonte primária o documento On computable numbers, with an application to the Entscheidungsproblem. No capítulo 2, será apresentado as principais seções do documento de Turing explorando alguns de seus conceitos. O projeto será finalizado com uma crítica a este texto clássico da história da matemática com base nas propostas historiográficas apresentadas no primeiro capítulo
Zhao, Yue. "Modelling avian influenza in bird-human systems : this thesis is presented in the partial fulfillment of the requirement for the degree of Masters of Information Science in Mathematics at Massey University, Albany, New Zealand." Massey University, 2009. http://hdl.handle.net/10179/1145.
Full textMcDermott, Matthew. "Fast Algorithms for Analyzing Partially Ranked Data." Scholarship @ Claremont, 2014. http://scholarship.claremont.edu/hmc_theses/58.
Full textWhitinger, Robert. "An Algorithm for the Machine Calculation of Minimal Paths." Digital Commons @ East Tennessee State University, 2016. https://dc.etsu.edu/etd/3119.
Full textLenormand, Maxime. "Initialize and Calibrate a Dynamic Stochastic Microsimulation Model: Application to the SimVillages Model." Phd thesis, Université Blaise Pascal - Clermont-Ferrand II, 2012. http://tel.archives-ouvertes.fr/tel-00764929.
Full textLemaire, François. "Contribution à l'algorithmique en algèbre différentielle." Phd thesis, Université des Sciences et Technologie de Lille - Lille I, 2002. http://tel.archives-ouvertes.fr/tel-00001363.
Full textdifférentielles non linéaires aux dérivées partielles. L'approche choisie est celle de l'algèbre différentielle. Étant donné un système d'équations différentielles, nous cherchons à obtenir des renseignements sur ses solutions. Pour ce faire, nous calculons une famille d'ensembles particuliers (appelés chaînes différentielles régulières) dont la réunion des solutions coïncide avec les solutions du système initial.
Les nouveaux résultats relèvent principalement du calcul formel. Le chapitre 2 clarifie le lien entre les chaînes régulières et les chaînes différentielles régulières. Deux nouveaux algorithmes (chapitres 4 et 5) viennent optimiser les algorithmes existants permettant de calculer ces chaînes différentielles régulières. Ces deux algorithmes intègrent des techniques purement algébriques qui permettent de mieux contrôler le grossissement des données et de supprimer des calculs inutiles. Des problèmes jusqu'à présent non résolus ont ainsi pu être traités. Un algorithme de calcul de forme normale d'un polynôme différentiel modulo une chaîne différentielle régulière est exposé dans le chapitre 2.
Les derniers résultats relèvent de l'analyse. Les solutions que nous considérons sont des séries formelles. Le chapitre 3 fournit des conditions suffisantes pour qu'une solution formelle soit analytique. Ce même chapitre présente un contre-exemple à une conjecture portant sur l'analycité des solutions formelles.
Weil, Jacques-Arthur. "Méthodes effectives en théorie de Galois différentielle et applications à l'intégrabilité de systèmes dynamiques." Habilitation à diriger des recherches, Université de Limoges, 2013. http://tel.archives-ouvertes.fr/tel-00933064.
Full textJanon, Alexandre. "Analyse de sensibilité et réduction de dimension. Application à l'océanographie." Phd thesis, Université de Grenoble, 2012. http://tel.archives-ouvertes.fr/tel-00757101.
Full textHanna, George T. "Cubature reduction using the theory of inequalities." Thesis, 2002. https://vuir.vu.edu.au/18166/.
Full textIm, Paul Poh Teng. "An enhanced progressive fuzzy clustering approach to pattern recognition." Thesis, 1997. https://vuir.vu.edu.au/15324/.
Full textWhite, Roderick J. "Aspects of parallel topologies applied to digital transforms of discrete signals." Thesis, 1994. https://vuir.vu.edu.au/17930/.
Full textSo, Wing Wah Simon. "Content-based image indexing and retrieval for visual information systems." Thesis, 2000. https://vuir.vu.edu.au/15318/.
Full textHart, Keith Allen. "Mean reversion in asset prices and asset allocation in investment management." Thesis, 1996. https://vuir.vu.edu.au/18168/.
Full textMisiorek, Violetta Iwona. "Controlling processes with reference to costs, item price and process evolution." Thesis, 1998. https://vuir.vu.edu.au/18194/.
Full textTaniar, David Randy. "Query optimization for parallel object-oriented database systems." Thesis, 1997. https://vuir.vu.edu.au/15272/.
Full textIves, Robert V. "Reduction of the parameter estimation time for an adaptive control system." Thesis, 1994. https://vuir.vu.edu.au/18182/.
Full textChandran, Jaideep. "An image based colorimetric technique for portable blood gas analysis." Thesis, 2012. https://vuir.vu.edu.au/19422/.
Full textGrossman, Igor. "Applications of multi-threading paradigms to stimulate turbulent flows." Thesis, 2017. https://vuir.vu.edu.au/40454/.
Full textRowland, Eric Samuel. "Experimental methods applied to the computation of integer sequences." 2009. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051398.
Full textMorris, Brian Cleon. "Variational study of interstellar magnetic gas clouds: Theory, modeling, and computation." 1991. https://scholarworks.umass.edu/dissertations/AAI9132888.
Full textHuang, Guangyan. "Semantics orientated spatial temporal data mining for water resource decision support." Thesis, 2011. https://vuir.vu.edu.au/18971/.
Full textTeng, Luyao. "Research on Joint Sparse Representation Learning Approaches." Thesis, 2019. https://vuir.vu.edu.au/40024/.
Full textMustafa, Abdul K. "Signal conditioning for high efficiency : wireless transmission." Thesis, 2010. https://vuir.vu.edu.au/24556/.
Full textPan, Jie. "Variational inequalities in the modelling and computation of spatial economic equilibria: Structural reformulations and the method of multipliers." 1992. https://scholarworks.umass.edu/dissertations/AAI9233126.
Full textLoo, Clinton. "Settling Time Reducibility Orderings." Thesis, 2010. http://hdl.handle.net/10012/5101.
Full text(6636218), Luke N. Veldt. "Optimization Frameworks for Graph Clustering." Thesis, 2019.
Find full textSivan, Dmitri D. "Design and structural modifications of vibratory systems to achieve prescribed modal spectra / Dmitri D. Sivan." Thesis, 1997. http://hdl.handle.net/2440/18916.
Full textxii, 198 leaves : ill. ; 30 cm.
This thesis reports on problems associated with design and structural modification of vibratory systems. Several common problems encountered in practical engineering applications are described and novel strategies for solving this problems are proposed. Mathematical formulations of these problems are generated, and solution methods are developed.
Thesis (Ph.D.)--University of Adelaide, Dept. of Mechanical Engineering, 1997
(5929862), Xuejiao Kang. "Fault Tolerance in Linear Algebraic Methods using Erasure Coded Computations." Thesis, 2019.
Find full textAs parallel and distributed systems scale to hundreds of thousands of cores and beyond, fault tolerance becomes increasingly important -- particularly on systems with limited I/O capacity and bandwidth. Error correcting codes (ECCs) are used in communication systems where errors arise when bits are corrupted silently in a message. Error correcting codes can detect and correct erroneous bits. Erasure codes, an instance of error correcting codes that deal with data erasures, are widely used in storage systems. An erasure code addsredundancy to the data to tolerate erasures.
In this thesis, erasure coded computations are proposed as a novel approach to dealing with processor faults in parallel and distributed systems. We first give a brief review of traditional fault tolerance methods, error correcting codes, and erasure coded storage. The benefits and challenges of erasure coded computations with respect to coding scheme, fault models and system support are also presented.
In the first part of my thesis, I demonstrate the novel concept of erasure coded computations for linear system solvers. Erasure coding augments a given problem instance with redundant data. This augmented problem is executed in a fault oblivious manner in a faulty parallel environment. In the event of faults, we show how we can compute the true solution from potentially fault-prone solutions using a computationally inexpensive procedure. The results on diverse linear systems show that our technique has several important advantages: (i) as the hardware platform scales in size and in number of faults, our scheme yields increasing improvement in resource utilization, compared to traditional schemes; (ii) the proposed scheme is easy to code as the core algorithm remains the same; (iii) the general scheme is flexible to accommodate a range of computation and communication trade-offs.
We propose a new coding scheme for augmenting the input matrix that satisfies the recovery equations of erasure coding with high probability in the event of random failures. This coding scheme also minimizes fill (non-zero elements introduced by the coding block), while being amenable to efficient partitioning across processing nodes. Our experimental results show that the scheme adds minimal overhead for fault tolerance, yields excellent parallel efficiency and scalability, and is robust to different fault arrival models and fault rates.
Building on these results, we show how we can minimize, to optimality, the overhead associated with our problem augmentation techniques for linear system solvers. Specifically, we present a technique that adaptively augments the problem only when faults are detected. At any point during execution, we only solve a system with the same size as the original input system. This has several advantages in terms of maintaining the size and conditioning of the system, as well as in only adding the minimal amount of computation needed to tolerate the observed faults. We present, in details, the augmentation process, the parallel formulation, and the performance of our method. Specifically, we show that the proposed adaptive fault tolerance mechanism has minimal overhead in terms of FLOP counts with respect to the original solver executing in a non-faulty environment, has good convergence properties, and yields excellent parallel performance.
Based on the promising results for linear system solvers, we apply the concept of erasure coded computation to eigenvalue problems, which arise in many applications including machine learning and scientific simulations. Erasure coded computation is used to design a fault tolerant eigenvalue solver. The original eigenvalue problem is reformulated into a generalized eigenvalue problem defined on appropriate augmented matrices. We present the augmentation scheme, the necessary conditions for augmentation blocks, and the proofs of equivalence of the original eigenvalue problem and the reformulated generalized eigenvalue problem. Finally, we show how the eigenvalues can be derived from the augmented system in the event of faults.
We present detailed experiments, which demonstrate the excellent convergence properties of our fault tolerant TraceMin eigensolver in the average case. In the worst case where the row-column pairs that have the most impact on eigenvalues are erased, we present a novel scheme that computes the augmentation blocks as the computation proceeds, using the estimates of leverage scores of row-column pairs as they are computed by the iterative process. We demonstrate low overhead, excellent scalability in terms of the number of faults, and the robustness to different fault arrival models and fault rates for our method.
In summary, this thesis presents a novel approach to fault tolerance based on erasure coded computations, demonstrates it in the context of important linear algebra kernels, and validates its performance on a diverse set of problems on scalable parallel computing platforms. As parallel systems scale to hundreds of thousands of processing cores and beyond, these techniques present the most scalable fault tolerant mechanisms currently available.
(11186139), Benjamin D. Harsha. "Modeling Rational Adversaries: Predicting Behavior and Developing Deterrents." Thesis, 2021.
Find full text