Log in

Relevant bibliographies by topics / Coded Computation / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Coded Computation.

Dissertations / Theses on the topic 'Coded Computation'

Author: Grafiati

Published: 6 September 2023

Last updated: 25 July 2025

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 'Coded Computation.'

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

Wang, Sinong. "Coded Computation for Speeding up Distributed Machine Learning." The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1555336880521062.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Chen, Yiqi. "Computation of Initial State for Tail-Biting Trellis." Ohio University / OhioLINK, 2005. http://www.ohiolink.edu/etd/view.cgi?ohiou1125026574.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Chan, Siu Yan. "Efficient computation of weight enumerators and performance bounds for convolutionally coded systems in quasi-static fading channels /." View abstract or full-text, 2009. http://library.ust.hk/cgi/db/thesis.pl?ECED%202009%20CHANS.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Veluri, Subrahmanya Pavan Kumar. "Code Verification and Numerical Accuracy Assessment for Finite Volume CFD Codes." Diss., Virginia Tech, 2010. http://hdl.handle.net/10919/28715.

Full text

Abstract:

A detailed code verification study of an unstructured finite volume Computational Fluid Dynamics (CFD) code is performed. The Method of Manufactured Solutions is used to generate exact solutions for the Euler and Navier-Stokes equations to verify the correctness of the code through order of accuracy testing. The verification testing is performed on different mesh types which include triangular and quadrilateral elements in 2D and tetrahedral, prismatic, and hexahedral elements in 3D. The requirements of systematic mesh refinement are discussed, particularly in regards to unstructured meshes. D

APA, Harvard, Vancouver, ISO, and other styles

5

Ben, Hadj Fredj Abir. "Computations for the multiple access in wireless networks." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLT030.

Full text

Abstract:

Les futures générations de réseaux sans fil posent beaucoup de défis pour la communauté de recherche. Notamment, ces réseaux doivent être en mesure de répondre, avec une certaine qualité de service, aux demandes d'un nombre important de personnes et d'objets connectés. Ce qui se traduit par des exigences assez importantes en termes de capacité. C'est dans ce cadre que les méthodes d'accès multiple non orthogonaux (NOMA) ont été introduit. Dans cette thèse, nous avons étudié et proposé une méthodes d'accès multiple basé sur la technique compute and forawrd et sur les réseaux de point (Lattice c

APA, Harvard, Vancouver, ISO, and other styles

6

Ben, Hadj Fredj Abir. "Computations for the multiple access in wireless networks." Electronic Thesis or Diss., Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLT030.

Full text

Abstract:

Les futures générations de réseaux sans fil posent beaucoup de défis pour la communauté de recherche. Notamment, ces réseaux doivent être en mesure de répondre, avec une certaine qualité de service, aux demandes d'un nombre important de personnes et d'objets connectés. Ce qui se traduit par des exigences assez importantes en termes de capacité. C'est dans ce cadre que les méthodes d'accès multiple non orthogonaux (NOMA) ont été introduit. Dans cette thèse, nous avons étudié et proposé une méthodes d'accès multiple basé sur la technique compute and forawrd et sur les réseaux de point (Lattice c

APA, Harvard, Vancouver, ISO, and other styles

7

Zeng, Fanxuan. "Nonlinear codes: representation, constructions, minimum distance computation and decoding." Doctoral thesis, Universitat Autònoma de Barcelona, 2014. http://hdl.handle.net/10803/284241.

Full text

Abstract:

Resum La teoria de codis estudia el disseny de codis correctors d'errors per a la transmisió fidedigne d'informació per un canal amb soroll. Un codi corrector d'errors (o simplement codi) es un proces que consisteix en expressar una seqüència d'elements sobre un alfabet de tal manera que qualsevol error que sigui introduït pot ser detactat i corregit (amb limitacions), i està basat en la tècnica d'afegir elements redundants. Aquest proces inclou la codifcació, la transmisió i la descodifcació de la seqüència d'elements. La majoria dels codis utilitzat són codis bloc i la majoria d'ells tenen

APA, Harvard, Vancouver, ISO, and other styles

8

Rodal, Morten. "Scalability of seismic codes on computational clusters." Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2004. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9145.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Cusdin, P. A. "Automatic sensitivity code for computational fluid dynamics." Thesis, Queen's University Belfast, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.431586.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Hagen, Knut Imar. "Fault-tolerance for MPI Codes on Computational Clusters." Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2007. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-8728.

Full text

Abstract:

<p>This thesis focuses on fault-tolerance for MPI codes on computational clusters. When an application runs on a very large cluster with thousands of processors, there is likely that a process crashes due to a hardware or software failure. Fault-tolerance is the ability of a system to respond gracefully to an unexpected hardware or software failure. A test application which is meant to run for several weeks on several nodes is used in this thesis. The application is a seismic MPI application, written in Fortran90. This application was provided by Statoil, who wanted a fault-tolerant implement

APA, Harvard, Vancouver, ISO, and other styles

11

Bellini, Emanuele. "Computational techniques for nonlinear codes and Boolean functions." Doctoral thesis, Università degli studi di Trento, 2014. https://hdl.handle.net/11572/369066.

Full text

Abstract:

We present some upper bounds on the size of nonlinear codes and their restriction to systematic codes and linear codes. These bounds, which are an improvement of a bound by Zinoviev, Litsyn and Laihonen, are independent of other classical known theoretical bounds. Among these, we mention the Griesmer bound for linear codes, of which we provide a partial generalization for the systematic case. Our experiments show that in some cases (the majority of cases for some q) our bounds provide the best value, compared to all other closed-formula upper-bounds. We also present an algebraic method for com

APA, Harvard, Vancouver, ISO, and other styles

12

Bellini, Emanuele. "Computational techniques for nonlinear codes and Boolean functions." Doctoral thesis, University of Trento, 2014. http://eprints-phd.biblio.unitn.it/1376/1/00-Thesis.pdf.

Full text

Abstract:

We present some upper bounds on the size of nonlinear codes and their restriction to systematic codes and linear codes. These bounds, which are an improvement of a bound by Zinoviev, Litsyn and Laihonen, are independent of other classical known theoretical bounds. Among these, we mention the Griesmer bound for linear codes, of which we provide a partial generalization for the systematic case. Our experiments show that in some cases (the majority of cases for some q) our bounds provide the best value, compared to all other closed-formula upper-bounds. We also present an algebraic method for com

APA, Harvard, Vancouver, ISO, and other styles

13

O'Gorman, Joe. "Architectures for fault-tolerant quantum computation." Thesis, University of Oxford, 2017. http://ora.ox.ac.uk/objects/uuid:4219548d-798b-45f8-b376-91025bbe3ec4.

Full text

Abstract:

Quantum computing has enormous potential, but this can only be realised if quantum errors can be controlled sufficiently to allow quantum algorithms to be completed reliably. However, quantum-error-corrected logical quantum bits (qubits) which can be said to have achieved meaningful error suppression have not yet been demonstrated. This thesis reports research on several topics related to the challenge of designing fault-tolerant quantum computers. The first topic is a proposal for achieving large-scale error correction with the surface code in a silicon donor based quantum computing architect

APA, Harvard, Vancouver, ISO, and other styles

14

Mahalanobis, Abhijit, Richard Shilling, Robert Muise, and Mark Neifeld. "High-resolution imaging using a translating coded aperture." SPIE-SOC PHOTO-OPTICAL INSTRUMENTATION ENGINEERS, 2017. http://hdl.handle.net/10150/626004.

Full text

Abstract:

It is well known that a translating mask can optically encode low-resolution measurements from which higher resolution images can be computationally reconstructed. We experimentally demonstrate that this principle can be used to achieve substantial increase in image resolution compared to the size of the focal plane array (FPA). Specifically, we describe a scalable architecture with a translating mask (also referred to as a coded aperture) that achieves eightfold resolution improvement (or 64: 1 increase in the number of pixels compared to the number of focal plane detector elements). The imag

APA, Harvard, Vancouver, ISO, and other styles

15

Bhagat, Indu. "Code optimizations for narrow bitwidth architectures." Doctoral thesis, Universitat Politècnica de Catalunya, 2012. http://hdl.handle.net/10803/96190.

Full text

Abstract:

This thesis takes a HW/SW collaborative approach to tackle the problem of computational inefficiency in a holistic manner. The hardware is redesigned by restraining the datapath to merely 16-bit datawidth (integer datapath only) to provide an extremely simple, low-cost, low-complexity execution core which is best at executing the most common case efficiently. This redesign, referred to as the Narrow Bitwidth Architecture, is unique in that although the datapath is squeezed to 16-bits, it continues to offer the advantage of higher memory addressability like the contemporary wider datapath a

APA, Harvard, Vancouver, ISO, and other styles

16

Holewinski, Justin A. "Automatic Code Generation for Stencil Computations on GPU Architectures." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1354545992.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Senske, Nicholas. "Fear of code : an approach to integrating computation with architectural design." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/33032.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Architecture, 2005.<br>Includes bibliographical references (leaves 84-85).<br>Computation has enormous creative potential for designers. Unfortunately, many factors, such as the considerable investment required to learn programming, have prevented it from entering into common use. By analyzing the barriers to working with computation and suggesting directions for future research and implementation, this thesis seeks to enable a more inclusive dialogue towards the eventual integration of computation into the architectural mainstream

APA, Harvard, Vancouver, ISO, and other styles

18

Zaribafiyan, Arman. "Fast post processing algorithms for fault tolerant quantum computation using surface codes." Thesis, University of British Columbia, 2014. http://hdl.handle.net/2429/50569.

Full text

Abstract:

Local architecture of qubits in two dimensional lattices is known as one of the candidates to run fault tolerant quantum computation with high threshold. Topological quantum error correcting codes, such as surface codes, are used to make this architecture robust against various quantum error models. In this research we present a fast, concise, operationally inexpensive and highly parallelizable decoding algorithm for surface codes without using concatenation which has a threshold range of 8.6 % to 10.5 % varying based on a parameter called OMSS. Thanks to parallelization of the proposed algori

APA, Harvard, Vancouver, ISO, and other styles

19

Beedy, Jeremy. "Using computational fluid dynamics to improve rotorcraft aerodynamic codes." Thesis, University of Glasgow, 2006. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.519486.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Muscat, Martin. "Computational methods of design by analysis for pressure vessel components." Thesis, University of Strathclyde, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.248722.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Tuckett, David Kingsley. "Tailoring surface codes: Improvements in quantum error correction with biased noise." Thesis, The University of Sydney, 2020. https://hdl.handle.net/2123/22132.

Full text

Abstract:

For quantum computers to reach their full potential will require error correction. We study the surface code, one of the most promising quantum error correcting codes, in the context of predominantly dephasing (Z-biased) noise, as found in many quantum architectures. We find that the surface code is highly resilient to Y-biased noise, and tailor it to Z-biased noise, whilst retaining its practical features. We demonstrate ultrahigh thresholds for the tailored surface code: ~39% with a realistic bias of  = 100, and ~50% with pure Z noise, far exceeding known thresholds for the standard surface

APA, Harvard, Vancouver, ISO, and other styles

22

Thakur, Anuja. "Outside cell Interference Computations for Cellular Code Division Multiple Access." Ohio University / OhioLINK, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1071070073.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Shaw, Mackenzie Hooper. "Quantum Computation with Gottesman-Kitaev-Preskill Codes: Logical Gates, Measurements, and Analysis Techniques." Thesis, The University of Sydney, 2022. https://hdl.handle.net/2123/29663.

Full text

Abstract:

The Gottesman-Kitaev-Preskill (GKP) error-correcting code uses one or more bosonic modes to encode a finite-dimensional logical space, allowing a low-error logical qubit to be encoded in a small number of resonators. In this thesis, I propose new methods to implement logical gates and measurements with GKP codes and analyse their performance. The logical gate scheme uses the single-qubit Clifford frame to greatly reduce the number of gates needed to implement an algorithm without increasing the hardware requirements. The logical measurement scheme uses one ancilla mode to achieve a 0.1% logica

APA, Harvard, Vancouver, ISO, and other styles

24

Mora, Alessio. "Mobile Computation Offloading on Android: Evaluation of Sockets and Native Code Offloading Opportunities." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2019.

Find full text

Abstract:

In questa tesi, ULOOF (User Level Online Offloading Framework), un originale framework per offloading dedicato ad applicazioni Android, viene dettagliatamente presentato. L’ambizione di tale framework è quella di essere leggero, poco intrusivo e completamente automatizzato, in grado di abilitare qualsiasi applicazione Android, così come è quando viene scaricata dal Google Play Store, ad usufruire dell’offloading, senza nessuna conoscenza pregressa riguardo l’applicazione stessa. Attualmente, ULOOF riesce a fare ciò sulla maggior parte delle applicazioni disponibili

APA, Harvard, Vancouver, ISO, and other styles

25

Bergman, Harris. "Development of a parallel spectral element computational fluids dynamics code." Thesis, Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/19082.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Tegerup, Alexander. "Simulationof a Bayard-Alpert ionization gauge with the PIC code Warp." Thesis, KTH, Numerisk analys, NA, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-220895.

Full text

Abstract:

At RISE Research Institutes of Sweden, there is an interest in computer simulations of the physics related to ionization gauges. The objective of this thesis is to find out if the open source code Warp can be used for simulating the physics of interest. In this thesis it is explained what an ionization gauge is and the physics and the governing mathematical equations of the simulations are described. How those governing equations are solved and the algorithms used in Warp is also discussed in this thesis. The results of the simulations are presented in the thesis and a discussion of which part

APA, Harvard, Vancouver, ISO, and other styles

27

Hong, Sung Wook. "Uncertainty of microwave radiative transfer computations in rain." [College Station, Tex. : Texas A&M University, 2006. http://hdl.handle.net/1969.1/ETD-TAMU-1733.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Maislin, Scott. "Cyclic Codes and Cyclic Lattices." Scholarship @ Claremont, 2017. http://scholarship.claremont.edu/cmc_theses/1552.

Full text

Abstract:

In this thesis, we review basic properties of linear codes and lattices with a certain focus on their interplay. In particular, we focus on the analogous con- structions of cyclic codes and cyclic lattices. We start out with a brief overview of the basic theory and properties of linear codes. We then demonstrate the construction of cyclic codes and emphasize their importance in error-correcting coding theory. Next we survey properties of lattices, focusing on algorithmic lattice problems, exhibit the construction of cyclic lattices and discuss their applications in cryptography. We emphasize t

APA, Harvard, Vancouver, ISO, and other styles

29

BONIFETTO, ROBERTO. "Computational thermal-hydraulic modeling for nuclear fusion and fission applications." Doctoral thesis, Politecnico di Torino, 2014. http://hdl.handle.net/11583/2572946.

Full text

Abstract:

Both nuclear fusion and fission devices have to face the issue of the cooling of some critical components, and in particular the cooling of the superconducting coils and of the core fuel assemblies, respectively. In order to investigate these issues during the design phase of new reactors, e.g. new tokamak experiments and the forthcoming Generation IV reactors, new dedicated models and reliable tools should be developed. In this work, two separate tools, for fusion and fission devices, respectively, are developed relying on the same quasi-3D thermal-hydraulic model, i.e. the 1D advection flow

APA, Harvard, Vancouver, ISO, and other styles

30

Mouilleron, Christophe. "Efficient computation with structured matrices and arithmetic expressions." Phd thesis, Ecole normale supérieure de lyon - ENS LYON, 2011. http://tel.archives-ouvertes.fr/tel-00688388.

Full text

Abstract:

Designing efficient code in practice for a given computation is a hard task. In this thesis, we tackle this issue in two different situations. The first part of the thesis introduces some algorithmic improvements in structured linear algebra. We first show how to extend an algorithm by Cardinal for inverting Cauchy-like matrices to the other common structures. This approach, which mainly relies on products of the type "structured matrix × matrix", leads to a theoretical speed-up of a factor up to 7 that we also observe in practice. Then, we extend some works on Toeplitz-like matrices and prove

APA, Harvard, Vancouver, ISO, and other styles

31

Ingraham, Daniel. "Verification of a Computational Aeroacoustics Code Using External Verification Analysis (EVA)." University of Toledo / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1271271426.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Marchand, Renier Gustav. "The method of manufactured solutions for the verification of computational electromagnetic codes." Thesis, Stellenbosch : Stellenbosch University, 2013. http://hdl.handle.net/10019.1/80210.

Full text

Abstract:

Thesis (PhD)--Stellenbosch University, 2013.<br>ENGLISH ABSTRACT: In this work the Method of Manufactured Solutions (MMS) is introduced for the code veri cation of full-wave frequency dependent electromagnetic computational software. At rst the method is sketched in the context of the veri cation and validation process and the need for proper code veri cation is highlighted. Subsequently, the MMS is investigated in its natural context: the Finite Element Method, speci cally for the E- eld Vector Wave Equation. The usefulness of the method to detect error in a computational code is demo

APA, Harvard, Vancouver, ISO, and other styles

33

Devulapalli, Venkata Lakshmi Narasimha. "Application of Huffman Data Compression Algorithm in Hashing Computation." TopSCHOLAR®, 2018. https://digitalcommons.wku.edu/theses/2614.

Full text

Abstract:

Cryptography is the art of protecting information by encrypting the original message into an unreadable format. A cryptographic hash function is a hash function which takes an arbitrary length of the text message as input and converts that text into a fixed length of encrypted characters which is infeasible to invert. The values returned by the hash function are called as the message digest or simply hash values. Because of its versatility, hash functions are used in many applications such as message authentication, digital signatures, and password hashing [Thomsen and Knudsen, 2005]. The purp

APA, Harvard, Vancouver, ISO, and other styles

34

Pippin, William E. Jr. "Optimizing Threads of Computation in Constraint Logic Programs." The Ohio State University, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=osu1041551800.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Chou, Remi. "Information-theoretic security under computational, bandwidth, and randomization constraints." Diss., Georgia Institute of Technology, 2015. http://hdl.handle.net/1853/53837.

Full text

Abstract:

The objective of the proposed research is to develop and analyze coding schemes for information-theoretic security, which could bridge a gap between theory an practice. We focus on two fundamental models for information-theoretic security: secret-key generation for a source model and secure communication over the wire-tap channel. Many results for these models only provide existence of codes, and few attempts have been made to design practical schemes. The schemes we would like to propose should account for practical constraints. Specifically, we formulate the following constraints to avoid ov

APA, Harvard, Vancouver, ISO, and other styles

36

Mansouri, Boroujeni Nima. "A High-Order High-Accuracy Geometric Block Interface Treatment for Computational Aeroacoustics Codes." University of Toledo / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1463099661.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Guo, Jian. "Multiphysics computational framework for MEMS based on code coupling and data exchange." Thesis, University of Leeds, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.531531.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Lyle, Suzanne McLean. "Error Correcting Codes and the Human Genome." Digital Commons @ East Tennessee State University, 2010. https://dc.etsu.edu/etd/1689.

Full text

Abstract:

In this work, we study error correcting codes and generalize the concepts with a view toward a novel application in the study of DNA sequences. The author investigates the possibility that an error correcting linear code could be included in the human genome through application and research. The author finds that while it is an accepted hypothesis that it is reasonable that some kind of error correcting code is used in DNA, no one has actually been able to identify one. The author uses the application to illustrate how the subject of coding theory can provide a teaching enrichment activity for

APA, Harvard, Vancouver, ISO, and other styles

39

Côte, Maxime. "Reconnaissance de codes correcteurs d'erreurs." Phd thesis, Ecole Polytechnique X, 2010. http://pastel.archives-ouvertes.fr/pastel-00006125.

Full text

Abstract:

Durant cette thèse, je me suis intéressés à la reconnaissance de codes correcteurs d'erreurs à partir d'une observation bruitée. Parmi ces codes, nous avons choisi d'étudier plus particulièrement les codes convolutifs et les turbo-codes. Le canal de transmission considéré pour nos travaux est le canal binaire symétrique. En s'appuyant sur les travaux de E. Filiol et J. Barbier, j'ai mis au point un algorithme, imaginé conjointement avec N. Sendrier. Nous avons créé une nouvelle méthode générique de reconnaissance des codes convolutifs (n; k) (k entrées et n sorties). Cette méthode améliore l'é

APA, Harvard, Vancouver, ISO, and other styles

40

Saied, Mariem. "Automatic code generation and optimization of multi-dimensional stencil computations on distributed-memory architectures." Thesis, Strasbourg, 2018. http://www.theses.fr/2018STRAD036/document.

Full text

Abstract:

Nous proposons Dido, un langage dédié (DSL) implicitement parallèle qui capture les spécifications de haut niveau des stencils et génère automatiquement du code parallèle de haute performance pour les architectures à mémoire distribuée. Le code généré utilise ORWL en tant que interface de communication et runtime. Nous montrons que Dido réalise un grand progrès en termes de productivité sans sacrifier les performances. Dido prend en charge une large gamme de calculs stencils ainsi que des applications réelles à base de stencils. Nous montrons que le code généré par Dido est bien structuré et s

APA, Harvard, Vancouver, ISO, and other styles

41

Wong, Brenden. "On the computation of the probability of undetected error for linear block codes on the Gilbert channel." Thesis, University of British Columbia, 1991. http://hdl.handle.net/2429/30119.

Full text

Abstract:

An important measure of the performance of error detecting codes is the probability of undetected error. Extensive study on the subject has yielded results which allow for the computation of the probability of undetected error for many codes on the binary symmetric channel (BSC). However, little is known about code performance in more complicated channel models. The Gilbert channel is a two-state, three-parameter model with memory which simulates the effects of burst noise. In this thesis, we investigate methods to compute the probability of undetected error of binary linear block codes on th

APA, Harvard, Vancouver, ISO, and other styles

42

Clarke, Lauren Elizabeth. "Interfacing the CFD Code MFiX with the PETSc Linear Solver Library to Achieve Reduced Computation Times." Thesis, The University of North Dakota, 2018. http://pqdtopen.proquest.com/#viewpdf?dispub=10813583.

Full text

Abstract:

<p>A computational bottleneck during the solution to multiphase formulations of the incompressible Navier-Stokes equations is often during the implicit solution of the pressure-correction equation that results from operator-splitting methods. Since density is a coefficient in the pressure-correction equation, large variations or discontinuities among the phase densities greatly increase the condition number of the pressure-correction matrix and impede the convergence of iterative methods employed in its solution. To alleviate this shortcoming, the open-source multiphase code MFiX is interfaced

APA, Harvard, Vancouver, ISO, and other styles

43

Lienkaemper, Caitlin. "Toric Ideals, Polytopes, and Convex Neural Codes." Scholarship @ Claremont, 2017. http://scholarship.claremont.edu/hmc_theses/106.

Full text

Abstract:

How does the brain encode the spatial structure of the external world? A partial answer comes through place cells, hippocampal neurons which become associated to approximately convex regions of the world known as their place fields. When an organism is in the place field of some place cell, that cell will fire at an increased rate. A neural code describes the set of firing patterns observed in a set of neurons in terms of which subsets fire together and which do not. If the neurons the code describes are place cells, then the neural code gives some information about the relationships between t

APA, Harvard, Vancouver, ISO, and other styles

44

Choudhary, Aniruddha. "Verification of Compressible and Incompressible Computational Fluid Dynamics Codes and Residual-based Mesh Adaptation." Diss., Virginia Tech, 2015. http://hdl.handle.net/10919/51169.

Full text

Abstract:

Code verification is the process of ensuring, to the degree possible, that there are no algorithm deficiencies and coding mistakes (bugs) in a scientific computing simulation. In this work, techniques are presented for performing code verification of boundary conditions commonly used in compressible and incompressible Computational Fluid Dynamics (CFD) codes. Using a compressible CFD code, this study assesses the subsonic inflow (isentropic and fixed-mass), subsonic outflow, supersonic outflow, no-slip wall (adiabatic and isothermal), and inviscid slip-wall. The use of simplified curved surfac

APA, Harvard, Vancouver, ISO, and other styles

45

Parks, Benjamin T. "Using the FLUENT computational fluid dynamics code to model the NACOK corrosion test." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/38249.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Nuclear Engineering, 2004.<br>Includes bibliographical references (p. 89-90).<br>As a part of advancing nuclear technology, computational fluid dynamics (CFD) analysis offers safer and lower-cost results relative to experimental work. Its use as a safety analysis tool is gaining much broader acceptance due to increasing experimental verification. FLUENT is a Computational Fluid Dynamics (CFD) code that offers extensive benchmarks and validations, and is widely accepted by the nuclear engineering community. The Modular Pebble Bed Re

APA, Harvard, Vancouver, ISO, and other styles

46

Hardman, Robert R. "Infrared imaging : a proposed validation technique for computational fluid dynamics codes used in STOVL applications /." Thesis, This resource online, 1990. http://scholar.lib.vt.edu/theses/available/etd-05022009-040418/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Ingraham, Daniel. "External Verification Analysis: A Code-Independent Approach to Verifying Unsteady Partial Differential Equation Solvers." University of Toledo / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1430491745.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Rennó, Costa César. "The Hippocampus code : a computational study of the structure and function of the hippocampus." Doctoral thesis, Universitat Pompeu Fabra, 2012. http://hdl.handle.net/10803/94196.

Full text

Abstract:

Actualment, no hi ha consens científic respecte a la informació representada en la activitat de les célules del hipocamp. D'una banda, experiments amb humans sostenen una visión de la funció de l'hipocamp com a un sistema per l'emmagatzematge de memóries episódiques, mentre que la recerca amb rodents enfatitza una visió com a sistema cognitiu espacial. Tot i que existeix abundant evidència experimental que indica una possible sobreposició d'ambdues teories, aquesta dissociació també es manté en part en base a dades fisiològiques aparentment incompatibles. Aquesta tèsi poposa que l'hipp

APA, Harvard, Vancouver, ISO, and other styles

49

Rose, Isaac D. "Aerodynamic Modeling of an Unmanned Aerial Vehicle Using a Computational Fluid Dynamics Prediction Code." Ohio University / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1237481460.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Shin, Sangmook. "Reynolds-Averaged Navier-Stokes Computation of Tip Clearance Flow in a Compressor Cascade Using an Unstructured Grid." Diss., Virginia Tech, 2001. http://hdl.handle.net/10919/28947.

Full text

Abstract:

A three-dimensional unstructured incompressible RANS code has been developed using artificial compressibility and Spalart-Allmaras eddy viscosity model. A node-based finite volume method is used in which all flow variables are defined at the vertices of tetrahedrons in an unstructured grid. The inviscid fluxes are computed by using the Roe's flux difference splitting method, and higher order accuracy is attained by data reconstruction based on Taylor series expansion. Gauss theorem is used to formulate necessary gradients. For time integration, an implicit scheme based on linearized Euler back

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!