Log in

Relevant bibliographies by topics / Computing Mathematics / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Computing Mathematics.

Dissertations / Theses on the topic 'Computing Mathematics'

Author: Grafiati

Published: 4 June 2021

Last updated: 9 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Computing 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.

1

Rush, David B. Ph D. Massachusetts Institute of Technology. "Computing the Lusztig-Vogan bijection." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/113549.

Full text

Abstract:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2017.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 129-130).<br>Let G be a connected complex reductive algebraic group with Lie algebra g. The Lusztig-Vogan bijection relates two bases for the bounded derived category of G-equivariant coherent sheaves on the nilpotent cone 11 of g. One basis is indexed by ..., the set of dominant weights of G, and the other by [Omega], the set of pairs ... consisting of a nilpotent orbit ... and an irreducible G-equivariant vector bundle

APA, Harvard, Vancouver, ISO, and other styles

2

Fasoulakis, Michail. "Computing approximate Nash equilibria." Thesis, University of Warwick, 2017. http://wrap.warwick.ac.uk/91306/.

Full text

Abstract:

The problem of finding equilibria in non-cooperative games and understanding their properties is a central problem in modern game theory. After John Nash proved that every finite game has at least one equilibrium (so-called Nash equilibrium), the natural question arose whether we can compute one efficiently. After several years of extensive research, we now know that the problem of finding a Nash equilibrium is PPAD-complete even for two-player normal-form games, making the task of finding approximate Nash equilibria one of the central questions in the area of equilibrium computation. In this

APA, Harvard, Vancouver, ISO, and other styles

3

Nivens, Ryan Andrew. "Computing in STEM." Digital Commons @ East Tennessee State University, 2016. https://dc.etsu.edu/etsu-works/239.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Belleville, Patrice. "Computing two-covers of simple polygons." Thesis, McGill University, 1991. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=60490.

Full text

Abstract:

A set ${ cal P} = P sb1,P sb2, ...,P sb{k}$ of polygons is called a k-cover of a simple polygon P if $P = cup sbsp{i=1}{k} P sb{i}$. It has been shown that finding k-covers of polygons by subpolygons of a given class is almost always NP-hard, whenever k is allowed to vary. Shermer (She91a) gave a linear time algorithm to determine if P has a two-cover by convex polygons, and to find one if it exists. A polygon P is star-shaped if it has a point which sees all the others, and $L sb{k}$-convex if every pair of points can be joined by a polygonal path of at most k links contained in P. In this th

APA, Harvard, Vancouver, ISO, and other styles

5

Saias, Alain Isaac. "Randomness versus non-determinism in distributed computing." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/37022.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Wong, Yee Lok Ph D. Massachusetts Institute of Technology. "High-performance computing with PetaBricks and Julia." Thesis, Massachusetts Institute of Technology, 2011. http://hdl.handle.net/1721.1/67818.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2011.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 163-170).<br>We present two recent parallel programming languages, PetaBricks and Julia, and demonstrate how we can use these two languages to re-examine classic numerical algorithms in new approaches for high-performance computing. PetaBricks is an implicitly parallel language that allows programmers to naturally express algorithmic choice explicitly at the language level. The PetaBricks compiler and autotuner is not only able

APA, Harvard, Vancouver, ISO, and other styles

7

Shannon, Erica Hilary. "Computing invariant forms for Lie algebras using heaps." Thesis, University of Colorado at Boulder, 2016. http://pqdtopen.proquest.com/#viewpdf?dispub=10150997.

Full text

Abstract:

<p>In this thesis, I present a combinatorial formula for a symmetric invariant quartic form on a spin module for the simple Lie algebra <b>d</b><sub> 6</sub>. This formula relies on a description of this spin module as a vector space with weights, and weight vectors, indexed by ideals of a particular heap. I describe a new statistic, the profile, on pairs of heap ideals. The profile efficiently encodes the shape of the symmetric difference between the two ideals and demonstrates the available actions of the Weyl group and Lie algebra on any given pair. From the profile, I identify a property c

APA, Harvard, Vancouver, ISO, and other styles

8

Leong, Chi Keong. "Computing for pricing compound options." Thesis, University of Macau, 2006. http://umaclib3.umac.mo/record=b1636812.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Holm, Marcus. "Scientific computing on hybrid architectures." Licentiate thesis, Uppsala universitet, Avdelningen för beräkningsvetenskap, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-200242.

Full text

Abstract:

Modern computer architectures, with multicore CPUs and GPUs or other accelerators, make stronger demands than ever on writers of scientific code. As a rule of thumb, the fastest, most efficient program consists of labor-intensive code written by expert programmers for a certain application on a particular computer. This thesis deals with several algorithmic and technical approaches towards effectively satisfying the demand for high-performance parallel programming without incurring such a high cost in expert programmer time. Effective programming is accomplished by writing performance-portable

APA, Harvard, Vancouver, ISO, and other styles

10

Long, Nguyen Hoang. "Authentication protocols in pervasive computing." Thesis, University of Oxford, 2009. https://ora.ox.ac.uk/objects/uuid:d21c0ce6-5dd6-43ef-b6c6-01346d02031b.

Full text

Abstract:

The popularity of personal computing devices (e.g. smart cards) exposes users to risks, notably identity theft, and creates new requirements for secure communication. A recently proposed approach to creating secure communication is to use human trust and human interactions. These approaches potentially eliminate the need for passwords as in Bluetooth, shared secrets or trusted parties, which are often too complex and expensive to use in portable devices. In this new technology, handheld devices exchange data (e.g. payment, heart rates or public keys) over some medium (e.g. WiFi) and then displ

APA, Harvard, Vancouver, ISO, and other styles

11

Berman, Peter Hillel. "Computing Galois Groups for Certain Classes of Ordinary Differential Equations." NCSU, 2001. http://www.lib.ncsu.edu/theses/available/etd-20010723-022851.

Full text

Abstract:

<p>As of now, it is an open problem to find an algorithmthat computes the Galois group G of an arbitrary linear ordinary differential operator L in C(x)[D]. We assume thatC is a computable, characteristic-zero,algebraically closed constant field with factorization algorithm.In this dissertation, we present new methods forcomputing differential Galois groups in two special cases.An article by Compoint and Singer presents a decision procedure to compute G in case L is completely reducible or, equivalently, G is reductive. Here, we present the results of an article by Berman and Singerthat reduce

APA, Harvard, Vancouver, ISO, and other styles

12

Rassart, Étienne 1975. "Geometric approaches to computing Kostka numbers and Littlewood-Richardson coefficients." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/16632.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2004.<br>Includes bibliographical references (p. 119-125).<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Using tools from combinatorics, convex geometry and symplectic geometry, we study the behavior of the Kostka numbers and Littlewood-Richardson coefficients (the type A weight multiplicities and Clebsch-Gordan coefficients). We sh w that both are given by piecewise polynomial functions in the entries of the pa

APA, Harvard, Vancouver, ISO, and other styles

13

Tillenius, Martin. "Leveraging multicore processors for scientific computing." Licentiate thesis, Uppsala universitet, Avdelningen för beräkningsvetenskap, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-181266.

Full text

Abstract:

This thesis deals with how to develop scientific computing software that runs efficiently on multicore processors. The goal is to find building blocks and programming models that increase the productivity and reduce the probability of programming errors when developing parallel software. In our search for new building blocks, we evaluate the use of hardware transactional memory for constructing atomic floating point operations. Using benchmark applications from scientific computing, we show in which situations this achieves better performance than other approaches. Driven by the needs of scien

APA, Harvard, Vancouver, ISO, and other styles

14

Harrison, Anthony Westbrook. "Algorithms for Computing the Lattice Size." Kent State University / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=kent1529781033957183.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Samuel, David. "Computing the external geodesic diameter of a simple polygon." Thesis, McGill University, 1988. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=61805.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Howden, David J. A. "Computing automorphism groups and isomorphism testing in finite groups." Thesis, University of Warwick, 2012. http://wrap.warwick.ac.uk/50060/.

Full text

Abstract:

We outline a new method for computing automorphism groups and performing isomorphism testing for soluble groups. We derive procedures for computing polycyclic presentations for soluble automorphism groups, allowing for much more efficient calculations. Finally, we demonstrate how these methods can be extended to tackle some non-soluble groups. Performance statistics are included for an implementation of these algorithms in the MAGMA [BCP97] language.

APA, Harvard, Vancouver, ISO, and other styles

17

Hussein, Anwar. "Fast methods for computing bifurcation points in power systems." Thesis, University of Liverpool, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.272745.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Stewart, Sean. "Deploying a CMS Tier-3 Computing Cluster with Grid-enabled Computing Infrastructure." FIU Digital Commons, 2016. http://digitalcommons.fiu.edu/etd/2564.

Full text

Abstract:

The Large Hadron Collider (LHC), whose experiments include the Compact Muon Solenoid (CMS), produces over 30 million gigabytes of data annually, and implements a distributed computing architecture—a tiered hierarchy, from Tier-0 through Tier-3—in order to process and store all of this data. Out of all of the computing tiers, Tier-3 clusters allow scientists the most freedom and flexibility to perform their analyses of LHC data. Tier-3 clusters also provide local services such as login and storage services, provide a means to locally host and analyze LHC data, and allow both remote and local us

APA, Harvard, Vancouver, ISO, and other styles

19

Fortin, Charles. "Computing the local minimizers of a large and sparse trust-region subproblem." Thesis, McGill University, 2004. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=85548.

Full text

Abstract:

We present new algorithms for computing local minimizers of the trust-region subproblem (TRS). This problem consists in minimizing a quadratic function subject to a ball constraint. In particular, this problem appears as a subproblem in trust-region methods for constrained and unconstrained optimization. First, by modeling the TRS with a new semidefinite program, different than the standard semidefinite relaxation, we derive an algorithm, similar in structure to the Rendl-Wolkowicz Algorithm, which implicitly solves the semidefinite program by maximizing a single variable concave functi

APA, Harvard, Vancouver, ISO, and other styles

20

Nivens, Ryan Andrew. "Avenues for Embedding Computing in STEM." Digital Commons @ East Tennessee State University, 2018. https://dc.etsu.edu/etsu-works/2638.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Margianti, Eko Sri. "Learning environment, mathematics achievement and student attitudes among university computing students in Indonesia." Curtin University of Technology, Science and Mathematics Education Centre, 2001. http://espace.library.curtin.edu.au:80/R/?func=dbin-jump-full&object_id=12161.

Full text

Abstract:

This thesis reports the findings of a study of the influence of the classroom learning environment on students cognitive and affective outcomes among 2,498 third-year computing students in 50 university-level classes in Indonesia. Students perceptions of the classroom environment were measured using a modified Indonesian version of the What Is Happening In This Class? (WIHIC) questionnaire. To assess students affective outcomes, a scale derived from the Test of Science Related Attitudes was adapted for use in higher education computing classes and translated into Indonesian. Students' final sc

APA, Harvard, Vancouver, ISO, and other styles

22

chanchana, prakash. "An Algorithm for Computing the Perron Root of a Nonnegative Irreducible Matrix." NCSU, 2007. http://www.lib.ncsu.edu/theses/available/etd-02192007-224304/.

Full text

Abstract:

We present a new algorithm for computing the Perron root of a nonnegative irreducible matrix. The algorithm is formulated by combining a reciprocal of the well known Collatz's formula with a special inverse iteration algorithm discussed in [10, Linear Algebra Appl., 15 (1976), pp 235-242]. Numerical experiments demonstrate that our algorithm is able to compute the Perron root accurately and faster than other well known algorithms; in particular, when the size of the matrix is large. The proof of convergence of our algorithm is also presented.

APA, Harvard, Vancouver, ISO, and other styles

23

Meiners, Justin. "Computing the Rank of Braids." BYU ScholarsArchive, 2021. https://scholarsarchive.byu.edu/etd/8947.

Full text

Abstract:

We describe a method for computing rank (and determining quasipositivity) in the free group using dynamic programming. The algorithm is adapted to computing upper bounds on the rank for braids. We test our method on a table of knots by identifying quasipositive knots and calculating the ribbon genus. We consider the possibility that rank is not theoretically computable and prove some partial results that would classify its computational complexity. We then present a method for effectively brute force searching band presentations of small rank and conjugate length.

APA, Harvard, Vancouver, ISO, and other styles

24

Deng, Junjun. "Parallel computing techniques for computed tomography." Diss., University of Iowa, 2011. https://ir.uiowa.edu/etd/945.

Full text

Abstract:

X-ray computed tomography is a widely adopted medical imaging method that uses projections to recover the internal image of a subject. Since the invention of X-ray computed tomography in the 1970s, several generations of CT scanners have been developed. As 3D-image reconstruction increases in popularity, the long processing time associated with these machines has to be significantly reduced before they can be practically employed in everyday applications. Parallel computing is a computer science computing technique that utilizes multiple computer resources to process a computational task simul

APA, Harvard, Vancouver, ISO, and other styles

25

Richards, Michael John. "Computing covering maps for subgroups of #GAMMA#(1) with genus#>=#1." Thesis, University of Oxford, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.318854.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Joubert, Jean-Pierre. "AC3P: an architecture using cloud computing for the provision of mathematical powerpoint content to feature phones." Thesis, Nelson Mandela Metropolitan University, 2012. http://hdl.handle.net/10948/d1011088.

Full text

Abstract:

The Govan Mbeki Mathematics Development Unit (GMMDU) provides additional mathematics content to learners via mathematics workshops and DVDs. Mathematics is presented in PPT format. The prominence of feature phone usage has been confirmed amongst learners in socio-economic disadvantaged schools, specifically those learners participating in the GMMDU mathematics workshops. Feature phones typically contain limited device resources such as memory, battery power, and network resources. Distributed computing provides the potential to facilitate a new class of mobile applications with the provision o

APA, Harvard, Vancouver, ISO, and other styles

27

Townsend, Alex. "Computing with functions in two dimensions." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:02f92917-809e-477d-8413-417bb8106e56.

Full text

Abstract:

New numerical methods are proposed for computing with smooth scalar and vector valued functions of two variables defined on rectangular domains. Functions are approximated to essentially machine precision by an iterative variant of Gaussian elimination that constructs near-optimal low rank approximations. Operations such as integration, differentiation, and function evaluation are particularly efficient. Explicit convergence rates are shown for the singular values of differentiable and separately analytic functions, and examples are given to demonstrate some paradoxical features of low rank ap

APA, Harvard, Vancouver, ISO, and other styles

28

Chongo, Ambrose. "Computing the Greeks using the integration by parts formula for the Skorohod integral." Thesis, Link to the online version, 2008. http://hdl.handle.net/10019/818.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Xu, Lei. "Cellular distributed and parallel computing." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:88ffe124-c2fd-4144-86fe-47b35f4908bd.

Full text

Abstract:

This thesis focuses on novel approaches to distributed and parallel computing that are inspired by the mechanism and functioning of biological cells. We refer to this concept as cellular distributed and parallel computing which focuses on three important principles: simplicity, parallelism, and locality. We first give a parallel polynomial-time solution to the constraint satisfaction problem (CSP) based on a theoretical model of cellular distributed and parallel computing, which is known as neural-like P systems (or neural-like membrane systems). We then design a class of simple neural-like P

APA, Harvard, Vancouver, ISO, and other styles

30

Fagerlund, Martin. "Computing Word Senses by Semantic Mirroring and Spectral Graph Partitioning." Thesis, Linköping University, Scientific Computing, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-57103.

Full text

Abstract:

<p>In this thesis we use the method of Semantic Mirrors to create a graph of words that are semantically related to a seed word. Spectral graph partitioning methods are then used to partition the graph into subgraphs, and thus dividing the words into different word senses. These methods are applied to a bilingual lexicon of English and Swedish adjectives. A panel of human evaluators have looked at a few examples, and evaluated consistency within the derived senses and synonymy with the seed word.</p>

APA, Harvard, Vancouver, ISO, and other styles

31

Aguiar, Izabel Pirimai. "Dynamic Active Subspaces| A Data-driven Approach to Computing Time-dependent Active Subspaces in Dynamical Systems." Thesis, University of Colorado at Boulder, 2018. http://pqdtopen.proquest.com/#viewpdf?dispub=10826096.

Full text

Abstract:

<p> Computational models are aiding in the advancement of science – from biological, to engineering, to social systems. To trust the predictions of computational models, however, we must understand how the errors in the models’ inputs (i.e., through measurement error) affect the output of the systems: we must quantify the uncertainty that results from these input errors. Uncertainty quantification (UQ) becomes computationally complex when there are many parameters in the model. In such cases it is useful to reduce the dimension of the problem by identifying unimportant parameters a

APA, Harvard, Vancouver, ISO, and other styles

32

Zhang, Ping. "Iterative Methods for Computing Eigenvalues and Exponentials of Large Matrices." UKnowledge, 2009. http://uknowledge.uky.edu/gradschool_diss/789.

Full text

Abstract:

In this dissertation, we study iterative methods for computing eigenvalues and exponentials of large matrices. These types of computational problems arise in a large number of applications, including mathematical models in economics, physical and biological processes. Although numerical methods for computing eigenvalues and matrix exponentials have been well studied in the literature, there is a lack of analysis in inexact iterative methods for eigenvalue computation and certain variants of the Krylov subspace methods for approximating the matrix exponentials. In this work, we proposed an inex

APA, Harvard, Vancouver, ISO, and other styles

33

Heyworth, A. "Applications of rewriting systems and GroÌˆbner bases to computing Kan extensions and identities among relations". Thesis, Bangor University, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.275133.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Smith, Michael Anthony. "Embedding an object calculus in the unifying theories of programming." Thesis, University of Oxford, 2010. http://ora.ox.ac.uk/objects/uuid:8b5be90d-59c1-42c0-a996-ecd8015097b3.

Full text

Abstract:

Hoare and He's Unifying Theories of Programming (UTP) provides a rich model of programs as relational predicates. This theory is intended to provide a single framework in which any programming paradigms, languages, and features, can be modelled, compared and contrasted. The UTP already has models for several programming formalisms, such as imperative programming, higher-order programming (e.g. programing with procedures), several styles of concurrent programming (or reactive systems), class-based object-orientation, and transaction processing. We believe that the UTP ought to be able to repres

APA, Harvard, Vancouver, ISO, and other styles

35

Ravindrudu, Rahul. "Benchmarking More Aspects of High Performance Computing." Ames, Iowa : Oak Ridge, Tenn. : Ames Laboratory ; distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy, 2004. http://www.osti.gov/servlets/purl/837280-06M7ga/webviewable/.

Full text

Abstract:

Thesis (M.S.); Submitted to Iowa State Univ., Ames, IA (US); 19 Dec 2004.<br>Published through the Information Bridge: DOE Scientific and Technical Information. "IS-T 2196" Rahul Ravindrudu. US Department of Energy 12/19/2004. Report is also available in paper and microfiche from NTIS.

APA, Harvard, Vancouver, ISO, and other styles

36

Savala, Paul. "Computing spectral data for Maass cusp forms using resonance." Diss., University of Iowa, 2016. https://ir.uiowa.edu/etd/3182.

Full text

Abstract:

The primary arithmetic information attached to a Maass cusp form is its Laplace eigenvalue. However, in the case of cuspidal Maass forms, the range that these eigenvalues can take is not well-understood. In particular it is unknown if, given a real number r, one can prove that there exists a primitive Maass cusp form with Laplace eigenvalue 1/4 + r2. Conversely, given the Fourier coeﬃcients of a primitive Maass cusp form f on Γ0(D), it is not clear whether or not one can determine its Laplace eigenvalue. In this paper we show that given only a ﬁnite number of Fourier coeﬃcients one can ﬁrst de

APA, Harvard, Vancouver, ISO, and other styles

37

Dhillon, Adam. "A Complexity of Real Functions based on Analog Computing." Scholarship @ Claremont, 2019. https://scholarship.claremont.edu/hmc_theses/225.

Full text

Abstract:

This thesis is focused on analyzing a particular notion of complexity of real valued functions through the lens of analog computers. This report features design changes to Pour-El’s notion of an analog computer that reflect this question of complexity in a concrete way. Additionally, these changes to the analog computer allow an extension of Pour-El’s work in which the complexity of a function can be identified with the order of a differentiably algebraic equation that the function satisfies.

APA, Harvard, Vancouver, ISO, and other styles

38

Schwingel, Ruth. "Two matrix group algorithms with applications to computing the automorphism group of a finite p-group." Thesis, Queen Mary, University of London, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.313397.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Muhamed, Abera Ayalew. "Moduli spaces of topological solitons." Thesis, University of Kent, 2015. https://kar.kent.ac.uk/47961/.

Full text

Abstract:

This thesis presents a detailed study of phenomena related to topological solitons (in $2$-dimensions). Topological solitons are smooth, localised, finite energy solutions in non-linear field theories. The problems are about the moduli spaces of lumps in the projective plane and vortices on compact Riemann surfaces. Harmonic maps that minimize the Dirichlet energy in their homotopy classes are known as lumps. Lump solutions in real projective space are explicitly given by rational maps subject to a certain symmetry requirement. This has consequences for the behaviour of lumps and their symmetr

APA, Harvard, Vancouver, ISO, and other styles

40

Anderson, Zann Benjamin. "Laying a Foundation for Computing in Outdoor Recreation." BYU ScholarsArchive, 2019. https://scholarsarchive.byu.edu/etd/8713.

Full text

Abstract:

Mobile computing allows individuals to bring computing with them into the outdoors. This creates a new situation in which individuals can stay connected even when trying to "get away from it all." Questions arise from this juxtaposition regarding whether the inclusion of computing in these activities is a positive or a negative. Evidence exists supporting both conclusions. We posit that computing can contribute positively to outdoor recreation without distracting. This dissertation details work undertaken in two phases which explores how computing can accomplish this goal. Phase 1 explored how

APA, Harvard, Vancouver, ISO, and other styles

41

Perez, Delgado Carlos Antonio. "An Optimizing Pulse Sequence Compiler for NMR QIP." Thesis, University of Waterloo, 2003. http://hdl.handle.net/10012/1042.

Full text

Abstract:

Quantum information processing is a multi-disciplinary science involving physics, mathematics, computer science, and even quantum chemistry. It is centred around the idea of manipulating physical systems at the quantum level, either for simulation of physical systems, or numerical computation. Although it has been known for almost a decade that a quantum computer would enable the solution of problems deemed infeasible classically, constructing one has been beyond today's capabilities. In this work we explore one proposed implementation of a quantum computer: Nuclear Magnetic Resonance (N

APA, Harvard, Vancouver, ISO, and other styles

42

Zhang, Yulong. "TOWARDS AN INCENTIVE COMPATIBLE FRAMEWORK OF SECURE CLOUD COMPUTING." VCU Scholars Compass, 2012. http://scholarscompass.vcu.edu/etd/2739.

Full text

Abstract:

Cloud computing has changed how services are provided and supported through the computing infrastructure. It has the advantages such as flexibility , scalability , compatibility and availability . However, the current architecture design also brings in some troublesome problems, like the balance of cooperation benefits and privacy concerns between the cloud provider and the cloud users, and the balance of cooperation benefits and free-rider concerns between different cloud users. Theses two problems together form the incentive problem in cloud environment. The first conflict lies between the r

APA, Harvard, Vancouver, ISO, and other styles

43

Dick, Stephanie Aleen. "After Math: (Re)configuring Minds, Proof, and Computing in the Postwar United States." Thesis, Harvard University, 2015. http://nrs.harvard.edu/urn-3:HUL.InstRepos:14226096.

Full text

Abstract:

This dissertation examines the history of three early computer programs that were designed to prove mathematical theorems: The Logic Theory Machine, the Program P, and the Automated Reasoning Assistant, all developed between 1955 and 1975. I use these programs as an opportunity to explore ways in which mathematical knowledge and practice were transformed by the introduction of modern computing. The prospect of automation generated disagreement about the character of human mathematical faculties like intuition, reasoning, and understanding and whether computers could be made to possess or parti

APA, Harvard, Vancouver, ISO, and other styles

44

Hu, Jing. "Solution of partial differential equations using reconfigurable computing." Thesis, University of Birmingham, 2011. http://etheses.bham.ac.uk//id/eprint/1655/.

Full text

Abstract:

This research undergone is an inter-disciplinary project with the Civil Engineering Department, which focuses on acceleration of the numerical solutions of Partial differential equations (PDEs) describing continuous solid bodies (e.g. a dam or an aircraft wing). Numerical techniques for solutions to PDEs are generally computationally demanding and data intensive. One approach to acceleration of their numerical solutions is to use FPGA based reconfigurable computing boards. The aim of this research is to investigate the features of various algorithms for the numerical solution of Laplace’s equa

APA, Harvard, Vancouver, ISO, and other styles

45

Setta, Mario. "Multiscale numerical approximation of morphology formation in ternary mixtures with evaporation : Discrete and continuum models for high-performance computing." Thesis, Karlstads universitet, Institutionen för matematik och datavetenskap (from 2013), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-85036.

Full text

Abstract:

We propose three models to study morphology formations in interacting ternary mixtures with the evaporation of one component. Our models involve three distinct length scales: microscopic, mesoscopic, and respectively, macroscopic. The real-world application we have in mind concerns charge transport through the heterogeneous structures arising in the fabrication of organic solar cells. As first model, we propose a microscopic 3-spins lattice dynamics with short-range interactions between the considered species. This microscopic model is approximated numerically via a Monte Carlo Metropolis-base

APA, Harvard, Vancouver, ISO, and other styles

46

Judge, Edmund William. "Spectral results for perturbed periodic Jacobi operators." Thesis, University of Kent, 2017. https://kar.kent.ac.uk/63374/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Chivers, Daniel. "Improving automated layout techniques for the production of schematic diagrams." Thesis, University of Kent, 2014. https://kar.kent.ac.uk/50750/.

Full text

Abstract:

This thesis explores techniques for the automated production of schematic diagrams, in particular those in the style of metro maps. Metro map style schematics are used across the world, typically to depict public transport networks, and therefore benefit from an innate level of user familiarity not found with most other data visualisation styles. Currently, this style of schematic is used infrequently due to the difficulties involved with creating an effective layout – there are no software tools to aid with the positioning of nodes and other features, resulting in schematics being produced by

APA, Harvard, Vancouver, ISO, and other styles

48

Alsufyani, Abdulmajeed. "Detecting salient information using RSVP and the P3 : computational and EEG explorations." Thesis, University of Kent, 2015. https://kar.kent.ac.uk/50751/.

Full text

Abstract:

This thesis investigates the efficacy of employing the Rapid Serial Visual Presentation (RSVP) technique for stimulus presentation in brain activity-based deception detection tests. One reason for using RSVP is to present stimuli on the fringe of awareness (e.g. 10 per second), making it more difficult for a guilty person to confound the test by use of countermeasures. It is hypothesized that such a rapid presentation rate prevents the vast majority of RSVP stimuli from being perceived at a level sufficient for encoding into working memory, but that salient stimuli will break through into cons

APA, Harvard, Vancouver, ISO, and other styles

49

Sakaria, Dhirendra Kumar. "Application of dynamic factor modelling to financial contagion." Thesis, University of Kent, 2016. https://kar.kent.ac.uk/54759/.

Full text

Abstract:

Contagion has been described as the spread of idiosyncratic shocks from one market to another in times of financial turmoil. In this work, contagion has been modelled using a global factor to capture the general market movements and idiosyncratic shocks are used to capture co-movements and volatility spill-over between markets. Many previous studies have used pre-specified turmoil and calm periods to understand when contagion occurs. We introduce time-varying parameters which model the volatility spillover from one country to another. This approach avoids the need to pre-specify particular typ

APA, Harvard, Vancouver, ISO, and other styles

50

Silles, Christopher Anthony. "Provenance-aware CXXR." Thesis, University of Kent, 2014. https://kar.kent.ac.uk/50499/.

Full text

Abstract:

A provenance-aware computer system is one that records information about the operations it performs on data to enable it to provide an account of the process that led to a particular item of data. These systems allow users to ask questions of data, such as “What was the sequence of steps involved in its creation?”, “What other items of data were used to create it?”, or “What items of data used it during their creation?”. This work will present a study of how, and the extent to which the CXXR statistical programming software can be made aware of the provenance of the data on which it operates.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!