Siga este link para ver outros tipos de publicações sobre o tema: Computation Theory and Mathematics.

Teses / dissertações sobre o tema "Computation Theory and Mathematics"

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Veja os 50 melhores trabalhos (teses / dissertações) para estudos sobre o assunto "Computation Theory and Mathematics".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Veja as teses / dissertações das mais diversas áreas científicas e compile uma bibliografia correta.

1

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/.

Texto completo da fonte
Resumo:
We compute the partial isomorphism rank, in the sense Scott and Karp, of a pair of ordinal structures using an Ehrenfeucht-Fraisse game. A complete formula is proven by induction given any two arbitrary ordinals written in Cantor normal form.
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Zhang, 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.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

Semegni, Jean Yves. "On the computation of freely generated modular lattices." Thesis, Stellenbosch : Stellenbosch University, 2008. http://hdl.handle.net/10019.1/1207.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

Khafizov, Farid T. "Descriptions and Computation of Ultrapowers in L(R)." Thesis, University of North Texas, 1995. https://digital.library.unt.edu/ark:/67531/metadc277867/.

Texto completo da fonte
Resumo:
The results from this dissertation are an exact computation of ultrapowers by measures on cardinals $\aleph\sb{n},\ n\in w$, in $L(\IR$), and a proof that ordinals in $L(\IR$) below $\delta\sbsp{5}{1}$ represented by descriptions and the identity function with respect to sequences of measures are cardinals. An introduction to the subject with the basic definitions and well known facts is presented in chapter I. In chapter II, we define a class of measures on the $\aleph\sb{n},\ n\in\omega$, in $L(\IR$) and derive a formula for an exact computation of the ultrapowers of cardinals by these measu
Estilos ABNT, Harvard, Vancouver, APA, etc.
5

Theeranaew, 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.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
6

Marsden, Daniel. "Logical aspects of quantum computation." Thesis, University of Oxford, 2015. http://ora.ox.ac.uk/objects/uuid:e99331a3-9d93-4381-8075-ad843fb9b77c.

Texto completo da fonte
Resumo:
A fundamental component of theoretical computer science is the application of logic. Logic provides the formalisms by which we can model and reason about computational questions, and novel computational features provide new directions for the development of logic. From this perspective, the unusual features of quantum computation present both challenges and opportunities for computer science. Our existing logical techniques must be extended and adapted to appropriately model quantum phenomena, stimulating many new theoretical developments. At the same time, tools developed with quantum applica
Estilos ABNT, Harvard, Vancouver, APA, etc.
7

Kirk, Neil Patrick. "Computational aspects of singularity theory." Thesis, University of Liverpool, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359187.

Texto completo da fonte
Resumo:
In this thesis we develop computational methods suitable for performing the symbolic calculations common to local singularity theory. For classification theory we employ the unipotent determinacy techniques of Bruce, du Plessis, Wall and complete transversal theorems of Bruce, du Plessis. The latter results are, as yet, unpublished and we spend some time reviewing these results, extending them to filtrations of the module m,,,.E (n, p) other than the standard filtration by degree. Weighted filtrations and filtrations induced by the action of a nilpotent Lie algebra are considered. A computer p
Estilos ABNT, Harvard, Vancouver, APA, etc.
8

Fatouros, Stavros. "Approximate algebraic computations in control theory." Thesis, City University London, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.274524.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
9

Heyman, Joseph Lee. "On the Computation of Strategically Equivalent Games." The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1561984858706805.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
10

Fukasawa, Ricardo. "Single-row mixed-integer programs : theory and computations /." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/24660.

Texto completo da fonte
Resumo:
Thesis (Ph.D.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2009.<br>Committee Chair: William J. Cook; Committee Member: Ellis Johnson; Committee Member: George Nemhauser; Committee Member: Robin Thomas; Committee Member: Zonghao Gu
Estilos ABNT, Harvard, Vancouver, APA, etc.
11

Engdahl, 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.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
12

Whaley, Dewey Lonzo. "The Interquartile Range: Theory and Estimation." Digital Commons @ East Tennessee State University, 2005. https://dc.etsu.edu/etd/1030.

Texto completo da fonte
Resumo:
The interquartile range (IQR) is used to describe the spread of a distribution. In an introductory statistics course, the IQR might be introduced as simply the “range within which the middle half of the data points lie.” In other words, it is the distance between the two quartiles, IQR = Q3 - Q1. We will compute the population IQR, the expected value, and the variance of the sample IQR for various continuous distributions. In addition, a bootstrap confidence interval for the population IQR will be evaluated.
Estilos ABNT, Harvard, Vancouver, APA, etc.
13

Phoa, Wesley. "Domain theory in realizability toposes." Thesis, University of Cambridge, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.387061.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
14

Marletta, Marco. "Theory and implementation of algorithms for Sturm-Lioville computations." Thesis, Cranfield University, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.293105.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
15

Apedaile, Thomas J. "Computational Topics in Lie Theory and Representation Theory." DigitalCommons@USU, 2014. https://digitalcommons.usu.edu/etd/2156.

Texto completo da fonte
Resumo:
The computer algebra system Maple contains a basic set of commands for working with Lie algebras. The purpose of this thesis was to extend the functionality of these Maple packages in a number of important areas. First, programs for dening multiplication in several types of Cayley algebras, Jordan algebras and Cliord algebras were created to allow users to perform a variety of calculations. Second, commands were created for calculating some basic properties of nite-dimensional representations of complex semisimple Lie algebras. These commands allow one to identify a given representation as dir
Estilos ABNT, Harvard, Vancouver, APA, etc.
16

Buckle, John Francis. "Computational aspects of lattice theory." Thesis, University of Warwick, 1989. http://wrap.warwick.ac.uk/106446/.

Texto completo da fonte
Resumo:
The use of computers to produce a user-friendly safe environment is an important area of research in computer science. This dissertation investigates how computers can be used to create an interactive environment for lattice theory. The dissertation is divided into three parts. Chapters two and three discuss mathematical aspects of lattice theory, chapter four describes methods of representing and displaying distributive lattices and chapters five, six and seven describe a definitive based environment for lattice theory. Chapter two investigates lattice congruences and pre-orders and demonstra
Estilos ABNT, Harvard, Vancouver, APA, etc.
17

Zhu, Huaiyu. "Neural networks and adaptive computers : theory and methods of stochastic adaptive computation." Thesis, University of Liverpool, 1993. http://eprints.aston.ac.uk/365/.

Texto completo da fonte
Resumo:
This thesis studies the theory of stochastic adaptive computation based on neural networks. A mathematical theory of computation is developed in the framework of information geometry, which generalises Turing machine (TM) computation in three aspects - It can be continuous, stochastic and adaptive - and retains the TM computation as a subclass called "data processing". The concepts of Boltzmann distribution, Gibbs sampler and simulated annealing are formally defined and their interrelationships are studied. The concept of "trainable information processor" (TIP) - parameterised stochastic mappi
Estilos ABNT, Harvard, Vancouver, APA, etc.
18

Mitrouli, Marilena Th. "Numerical issues and computational problems in algebraic control theory." Thesis, City University London, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.280573.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
19

Hill, Michael Anthony Ph D. Massachusetts Institute of Technology. "Computational methods for higher real K-theory with applications to tmf." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/34545.

Texto completo da fonte
Resumo:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2006.<br>Includes bibliographical references (p. 67-69).<br>We begin by present a new Hopf algebra which can be used to compute the tmf homology of a space or spectrum at the prime 3. Generalizing work of Mahowald and Davis, we use this Hopf algebra to compute the tmf homology of the classifying space of the symmetric group on three elements. We also discuss the E3 Tate spectrum of tmf at the prime 3. We then build on work of Hopkins and his collaborators, first computing the Adams-Novikov zero line of the homotopy o
Estilos ABNT, Harvard, Vancouver, APA, etc.
20

Artemov, Anton G. "Inverse factorization in electronic structure theory : Analysis and parallelization." Licentiate thesis, Uppsala universitet, Avdelningen för beräkningsvetenskap, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-381333.

Texto completo da fonte
Resumo:
This licentiate thesis is a part of an effort to run large electronic structure calculations in modern computational environments with distributed memory. The ultimate goal is to model materials consisting of millions of atoms at the level of quantum mechanics. In particular, the thesis focuses on different aspects of a computational problem of inverse factorization of Hermitian positive definite matrices. The considered aspects are numerical properties of the algorithms and parallelization. Not only is an efficient and scalable computation of inverse factors necessary in order to be able to r
Estilos ABNT, Harvard, Vancouver, APA, etc.
21

Young, Po-yuk. "Profile of good computational estimators related mathematical variables and common strategies used." [Hong Kong] : University of Hong Kong, 1994. http://sunzi.lib.hku.hk/hkuto/record.jsp?B14420478.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
22

Shi, Bin. "A Mathematical Framework on Machine Learning: Theory and Application." FIU Digital Commons, 2018. https://digitalcommons.fiu.edu/etd/3876.

Texto completo da fonte
Resumo:
The dissertation addresses the research topics of machine learning outlined below. We developed the theory about traditional first-order algorithms from convex opti- mization and provide new insights in nonconvex objective functions from machine learning. Based on the theory analysis, we designed and developed new algorithms to overcome the difficulty of nonconvex objective and to accelerate the speed to obtain the desired result. In this thesis, we answer the two questions: (1) How to design a step size for gradient descent with random initialization? (2) Can we accelerate the current convex
Estilos ABNT, Harvard, Vancouver, APA, etc.
23

Wikström, Gunilla. "Computation of Parameters in some Mathematical Models." Doctoral thesis, Umeå University, Computing Science, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-565.

Texto completo da fonte
Resumo:
<p>In computational science it is common to describe dynamic systems by mathematical models in forms of differential or integral equations. These models may contain parameters that have to be computed for the model to be complete. For the special type of ordinary differential equations studied in this thesis, the resulting parameter estimation problem is a separable nonlinear least squares problem with equality constraints. This problem can be solved by iteration, but due to complicated computations of derivatives and the existence of several local minima, so called short-cut methods may be an
Estilos ABNT, Harvard, Vancouver, APA, etc.
24

Bastounis, Alexander James. "On fundamental computational barriers in the mathematics of information." Thesis, University of Cambridge, 2018. https://www.repository.cam.ac.uk/handle/1810/279086.

Texto completo da fonte
Resumo:
This thesis is about computational theory in the setting of the mathematics of information. The first goal is to demonstrate that many commonly considered problems in optimisation theory cannot be solved with an algorithm if the input data is only known up to an arbitrarily small error (modelling the fact that most real numbers are not expressible to infinite precision with a floating point based computational device). This includes computing the minimisers to basis pursuit, linear programming, lasso and image deblurring as well as finding an optimal neural network given training data. These r
Estilos ABNT, Harvard, Vancouver, APA, etc.
25

Leclerc, Philip. "Prospect Theory Preferences in Noncooperative Game Theory." VCU Scholars Compass, 2014. http://scholarscompass.vcu.edu/etd/3522.

Texto completo da fonte
Resumo:
The present work seeks to incorporate a popular descriptive, empirically grounded model of human preference under risk, prospect theory, into the equilibrium theory of noncooperative games. Three primary, candidate definitions are systematically identified on the basis of classical characterizations of Nash Equilibrium; in addition, three equilibrium subtypes are defined for each primary definition, in order to enable modeling of players' reference points as exogenous and fixed, slowly and myopically adaptive, highly flexible and non-myopically adaptive. Each primary equilibrium concept was an
Estilos ABNT, Harvard, Vancouver, APA, etc.
26

Tung, Jen-Fu. "An Algorithm to Generate Two-Dimensional Drawings of Conway Algebraic Knots." TopSCHOLAR®, 2010. http://digitalcommons.wku.edu/theses/163.

Texto completo da fonte
Resumo:
The problem of finding an efficient algorithm to create a two-dimensional embedding of a knot diagram is not an easy one. Typically, knots with a large number of crossings will not nicely generate two-dimensional drawings. This thesis presents an efficient algorithm to generate a knot and to create a nice two-dimensional embedding of the knot. For the purpose of this thesis a drawing is “nice” if the number of tangles in the diagram consisting of half-twists is minimal. More specifically, the algorithm generates prime, alternating Conway algebraic knots in O(n) time where n is the number of c
Estilos ABNT, Harvard, Vancouver, APA, etc.
27

Alp, Murat. "GAP, crossed inodules, Cat'1-groups : applications of computational group theory." Thesis, Bangor University, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.361168.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
28

Zarabi, Patrick, and August Denes. "Solving the Facility Location Problem using Graph Theory and Shortest Path Algorithms." Thesis, KTH, Optimeringslära och systemteori, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-229979.

Texto completo da fonte
Resumo:
This thesis in systems engineering and optimization theory aims to solve a facility location problem within the context of a confined space with path and proximity constraints. The thesis was commissioned by LKAB Kiruna, to help in their decision of where to construct a new facility on their industrial premises. The facility location problem was divided into a main problem of finding the best position of the facility, and a sub-problem of how to model distances and feasible areas within this particular context. The distance and feasibility modeling was solved by utilizing graph theory to const
Estilos ABNT, Harvard, Vancouver, APA, etc.
29

Hu, Fan. "Computation of exciton transfer in the one- and two-dimensional close-packed quantum dot arrays." Virtual Press, 2005. http://liblink.bsu.edu/uhtbin/catkey/1319543.

Texto completo da fonte
Resumo:
Forster theory of energy transfer is applied in diluted systems, and yet it remains unknown if it can be applied to the dense media. We have studied the exciton transfer in one-dimensional (1-D) close-packed pure and mixed quantum dot (QD) array under different models and two-dimensional (2-D) perfect lattice. Our approach is based on the master equation created by treating the exciton relaxation as a stochastic process. The random parameter has been used to describe dot-to-dot distance variations. The master equation has been investigated analytically for 1-D and 2-D perfect lattices and nume
Estilos ABNT, Harvard, Vancouver, APA, etc.
30

Dang, Hiep Tuan [Verfasser], and Wolfram [Akademischer Betreuer] Decker. "Intersection theory with applications to the computation of Gromov-Witten invariants / Dang Tuan Hiep. Betreuer: Wolfram Decker." Kaiserslautern : Technische Universität Kaiserslautern, 2014. http://d-nb.info/1048558428/34.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
31

Dmytryshyn, Andrii. "Skew-symmetric matrix pencils : stratification theory and tools." Licentiate thesis, Umeå universitet, Institutionen för datavetenskap, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-87501.

Texto completo da fonte
Resumo:
Investigating the properties, explaining, and predicting the behaviour of a physical system described by a system (matrix) pencil often require the understanding of how canonical structure information of the system pencil may change, e.g., how eigenvalues coalesce or split apart, due to perturbations in the matrix pencil elements. Often these system pencils have different block-partitioning and / or symmetries. We study changes of the congruence canonical form of a complex skew-symmetric matrix pencil under small perturbations. The problem of computing the congruence canonical form is known to
Estilos ABNT, Harvard, Vancouver, APA, etc.
32

Sivan, 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.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
33

Johnson, 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.

Texto completo da fonte
Resumo:
This PhD thesis consists of a summary and seven papers, where various applications of auto-validated computations are studied. In the first paper we describe a rigorous method to determine unknown parameters in a system of ordinary differential equations from measured data with known bounds on the noise of the measurements. Papers II, III, IV, and V are concerned with Abelian integrals. In Paper II, we construct an auto-validated algorithm to compute Abelian integrals. In Paper III we investigate, via an example, how one can use this algorithm to determine the possible configurations of limit
Estilos ABNT, Harvard, Vancouver, APA, etc.
34

Mbangeni, 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.

Texto completo da fonte
Resumo:
Thesis (MTech(Electrical Engineering))--Cape Peninsula University of Technology, 2010<br>Optimal 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 ca
Estilos ABNT, Harvard, Vancouver, APA, etc.
35

Levkovitz, Ron. "An investigation of interior point methods for large scale linear programs : theory and computational algorithms." Thesis, Brunel University, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.316541.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
36

Qin, Yu. "Computations and Algorithms in Physical and Biological Problems." Thesis, Harvard University, 2014. http://dissertations.umi.com/gsas.harvard:11478.

Texto completo da fonte
Resumo:
This dissertation presents the applications of state-of-the-art computation techniques and data analysis algorithms in three physical and biological problems: assembling DNA pieces, optimizing self-assembly yield, and identifying correlations from large multivariate datasets. In the first topic, in-depth analysis of using Sequencing by Hybridization (SBH) to reconstruct target DNA sequences shows that a modified reconstruction algorithm can overcome the theoretical boundary without the need for different types of biochemical assays and is robust to error. In the second topic, consistent with t
Estilos ABNT, Harvard, Vancouver, APA, etc.
37

Aubad, Ali. "On commuting involution graphs of certain finite groups." Thesis, University of Manchester, 2017. https://www.research.manchester.ac.uk/portal/en/theses/on-commuting-involution-graphs-of-certain-finite-groups(009c80f5-b0d6-4164-aefc-f783f74c80f1).html.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
38

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.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
39

Witt, Walter G. "Quantifying the Structure of Misfolded Proteins Using Graph Theory." Digital Commons @ East Tennessee State University, 2017. https://dc.etsu.edu/etd/3244.

Texto completo da fonte
Resumo:
The structure of a protein molecule is highly correlated to its function. Some diseases such as cystic fibrosis are the result of a change in the structure of a protein so that this change interferes or inhibits its function. Often these changes in structure are caused by a misfolding of the protein molecule. To assist computational biologists, there is a database of proteins together with their misfolded versions, called decoys, that can be used to test the accuracy of protein structure prediction algorithms. In our work we use a nested graph model to quantify a selected set of proteins that
Estilos ABNT, Harvard, Vancouver, APA, etc.
40

Wenz, Andreas [Verfasser], Peter [Gutachter] Müller, and Michael [Gutachter] Dettweiler. "Computation of Belyi maps with prescribed ramification and applications in Galois theory / Andreas Wenz ; Gutachter: Peter Müller, Michael Dettweiler." Würzburg : Universität Würzburg, 2021. http://d-nb.info/1236859898/34.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
41

Sheppeard, Marni Dee. "Gluon Phenomenology and a Linear Topos." Thesis, University of Canterbury. Physics and Astronomy, 2007. http://hdl.handle.net/10092/1436.

Texto completo da fonte
Resumo:
In thinking about quantum causality one would like to approach rigorous QFT from outside the perspective of QFT, which one expects to recover only in a specific physical domain of quantum gravity. This thesis considers issues in causality using Category Theory, and their application to field theoretic observables. It appears that an abstract categorical Machian principle of duality for a ribbon graph calculus has the potential to incorporate the recent calculation of particle rest masses by Brannen, as well as the Bilson-Thompson characterisation of the particles of the Standard Model. Th
Estilos ABNT, Harvard, Vancouver, APA, etc.
42

Andujo, Nicholas R. "Progenitors Involving Simple Groups." CSUSB ScholarWorks, 1986. https://scholarworks.lib.csusb.edu/etd/758.

Texto completo da fonte
Resumo:
I will be going over writing representations of both permutation and monomial progenitors, which include 2^{*4} : D_4, 2^(*7) :L_2 (7) as permutation progenitors, and monomial progenitors 7^(*2) :_m S_3 \times 2, 11^{*2} :_m (5:2)^{*}5, 11^{*3} :_m (25:3), 11^{*4} :_m (4 : 5)^{*}5. Also, the images of these different progenitors at both lower and higher fields and orders. \\ We will also do the double coset enumeration of S5 over D6, S6 over 5 : 4, A_5 x A_5 over (5:2)^{*}5, and go on to also do the double coset enumeration over maximal subgroups for larger constructions. We will also do the c
Estilos ABNT, Harvard, Vancouver, APA, etc.
43

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.

Texto completo da fonte
Resumo:
<p>Many 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 m
Estilos ABNT, Harvard, Vancouver, APA, etc.
44

Mildenhall, Paula. "Enhancing the teaching and learning of computational estimation in year 6." Thesis, Edith Cowan University, Research Online, Perth, Western Australia, 2011. https://ro.ecu.edu.au/theses/387.

Texto completo da fonte
Resumo:
There have been repeated calls for computational estimation to have a more prominent position in mathematics teaching and learning but there is still little evidence that quality time is being spent on this topic. Estimating numerical quantities is a useful skill for people to be able to use in their everyday lives in order to meet their personal needs. It is also accepted that number sense is an important component of mathematics learning (McIntosh, Reys, Reys, Bana, & Farrell, 1997; Paterson, 2004) and that computational estimation is an important part of number sense (Edwards, 1984; Markovi
Estilos ABNT, Harvard, Vancouver, APA, etc.
45

Kley, Tobias [Verfasser], Holger [Gutachter] Dette, Herold [Gutachter] Dehling, and Marc [Gutachter] Hallin. "Quantile-based spectral analysis : asymptotic theory and computation / Tobias Kley ; Gutachter: Holger Dette, Herold Dehling, Marc Hallin ; Fakultät für Mathematik." Bochum : Ruhr-Universität Bochum, 2014. http://d-nb.info/1228624046/34.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
46

Burgos, 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.

Texto completo da fonte
Resumo:
In mathematical finance, the sensitivities of option prices to various market parameters, also known as the “Greeks”, reflect the exposure to different sources of risk. Computing these is essential to predict the impact of market moves on portfolios and to hedge them adequately. This is commonly done using Monte Carlo simulations. However, obtaining accurate estimates of the Greeks can be computationally costly. Multilevel Monte Carlo offers complexity improvements over standard Monte Carlo techniques. However the idea has never been used for the computation of Greeks. In this work we answer t
Estilos ABNT, Harvard, Vancouver, APA, etc.
47

Simoneau, Andre. "An Overview of Computational Mathematical Physics: A Deep Dive on Gauge Theories." Scholarship @ Claremont, 2019. https://scholarship.claremont.edu/cmc_theses/2182.

Texto completo da fonte
Resumo:
Over the course of a college mathematics degree, students are inevitably exposed to elementary physics. The derivation of the equations of motion are the classic examples of applications of derivatives and integrals. These equations of motion are easy to understand, however they can be expressed in other ways that students aren't often exposed to. Using the Lagrangian and the Hamiltonian, we can capture the same governing dynamics of Newtonian mechanics with equations that emphasize physical quantities other than position, velocity, and acceleration like Newton's equations do. Building o of th
Estilos ABNT, Harvard, Vancouver, APA, etc.
48

Khoury, Imad. "Mathematical and computational tools for the manipulation of musical cyclic rhythms." Thesis, McGill University, 2007. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=101858.

Texto completo da fonte
Resumo:
This thesis presents and analyzes tools and experiments that aim at achieving multiple yet related goals in the exploration and manipulation of musical cyclic rhythms. The work presented in this thesis may be viewed as a preliminary study for the ultimate future goal of developing a general computational theory of rhythm. Given a family of rhythms, how does one reconstruct its ancestral rhythms? How should one change a rhythm's cycle length while preserving its musicologically salient properties, and hence be able to confirm or disprove popular or historical beliefs regarding its origins and e
Estilos ABNT, Harvard, Vancouver, APA, etc.
49

Andersson, Per-Åke. "Computation of Thermal Development in Injection Mould Filling, based on the Distance Model." Licentiate thesis, Linköping University, Linköping University, Optimization, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-5733.

Texto completo da fonte
Resumo:
<p>The heat transfer in the filling phase of injection moulding is studied, based on Gunnar Aronsson’s distance model for flow expansion ([Aronsson], 1996).</p><p>The choice of a thermoplastic materials model is motivated by general physical properties, admitting temperature and pressure dependence. Two-phase, per-phase-incompressible, power-law fluids are considered. The shear rate expression takes into account pseudo-radial flow from a point inlet.</p><p>Instead of using a finite element (FEM) solver for the momentum equations a general analytical viscosity expression is used, adjusted to cu
Estilos ABNT, Harvard, Vancouver, APA, etc.
50

Volkova, Tanya N. Presmeg Norma C. "Characterizing preservice teachers' thinking in computational estimation with regard to whole numbers, fractions, decimals, and percents." Normal, Ill. : Illinois State University, 2006. http://proquest.umi.com/pqdweb?index=0&did=1276391451&SrchMode=1&sid=6&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1181316122&clientId=43838.

Texto completo da fonte
Resumo:
Thesis (Ph. D.)--Illinois State University, 2006.<br>Title from title page screen, viewed on June 8, 2007. Dissertation Committee: Norma C. Presmeg (chair), Cynthia W. Langrall, Beverly S. Rich, Janet Warfield. Includes bibliographical references (leaves 177-187) and abstract. Also available in print.
Estilos ABNT, Harvard, Vancouver, APA, etc.
Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!