Дисертації з теми "Coded Computation"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Coded Computation".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Wang, Sinong. "Coded Computation for Speeding up Distributed Machine Learning." The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1555336880521062.
Повний текст джерелаChen, Yiqi. "Computation of Initial State for Tail-Biting Trellis." Ohio University / OhioLINK, 2005. http://www.ohiolink.edu/etd/view.cgi?ohiou1125026574.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерелаPh. D.
Ben, Hadj Fredj Abir. "Computations for the multiple access in wireless networks." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLT030.
Повний текст джерелаFuture generations of wireless networks pose many challenges for the research community. In particular, these networks must be able to respond, with a certain quality of service, to the demands of a large number of connected people and objects. This drives us into quite important requirements in terms of capacity. It is within this framework that non-orthogonal multiple access methods (NOMA) have been introduced. In this thesis, we have studied and proposed a multiple access method based on the compute and forward technique and on Lattice codes while considering different lattice constructions. We have also proposed improvements to the algorithm for decoding the Sparse code multiple access (SCMA) method based on Lattice codes. In order to simplify the multi-stage decoders used in here, we have proposed simplified expressions of LLRs as well as approximations. Finally, we studied the construction D of lattices using polar codes. This thesis was in collaboration with the research center of Huawei France
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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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 implementation. The original test application had no degree of fault-tolerance --if one process or one node crashed, the entire application also crashed. In this thesis, a collection of fault-tolerant techniques are analysed, including checkpointing, MPI Error handlers, extending MPI, replication, fault detection, atomic clocks and multiple simultaneous failures. Several MPI implementations are described, like MPICH1, MPICH2, LAM/MPI and Open MPI. Next, some fault-tolerant products which are developed at other universities are described, like FT-MPI, FEMPI, MPICH-V including its five protocols, the fault-tolerant functionality of Open MPI, and MPI Error handlers. A fault-tolerant simulator which simulates the application's behaviour is developed. The simulator uses two fault-tolerance methods: FT-MPI and MPI Error handlers. Next, our test application is similarly made fault-tolerant with FT-MPI using three proposed approaches: MPI_Reduce(), MPI_Barrier(), and the final and current implementation: MPI Loop. Tests of the MPI Loop implementation are run on a small and a large cluster to verify the fault-tolerant behaviour. The seismic application survives a crash of n-2 nodes/processes. Process number 0 must stay alive since it acts as an I/O server, and there must be at least one process left to compute data. Processes can also be restarted rather than left out, but the test application needs to be modified to support this.
Bellini, Emanuele. "Computational techniques for nonlinear codes and Boolean functions." Doctoral thesis, Università degli studi di Trento, 2014. https://hdl.handle.net/11572/369066.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерелаBhagat, Indu. "Code optimizations for narrow bitwidth architectures." Doctoral thesis, Universitat Politècnica de Catalunya, 2012. http://hdl.handle.net/10803/96190.
Повний текст джерелаEsta tesis deriva su motivación en la inherente ineficiencia computacional de los procesadores actuales: a pesar de que muchas aplicaciones contemporáneas tienen unos requisitos de ancho de bits estrechos (aplicaciones de enteros, de red y multimedia), el hardware acaba utilizando el camino de datos completo, utilizando más recursos de los necesarios y consumiendo más energía. Esta tesis utiliza una aproximación HW/SW para atacar, de forma íntegra, el problema de la ineficiencia computacional. El hardware se ha rediseñado para restringir el ancho de bits del camino de datos a sólo 16 bits (únicamente el de enteros) y ofrecer así un núcleo de ejecución simple, de bajo consumo y baja complejidad, el cual está diseñado para ejecutar de forma eficiente el caso común. El rediseño, llamado en esta tesis Arquitectura de Ancho de Bits Estrecho (narrow bitwidth en inglés), es único en el sentido que aunque el camino de datos se ha estrechado a 16 bits, el sistema continúa ofreciendo las ventajas de direccionar grandes cantidades de memoria tal como procesadores con caminos de datos más anchos (64 bits actualmente). Su interface con el mundo exterior se denomina ISA estrecho. En nuestra propuesta el software es responsable de mapear eficientemente la actual pila software de las aplicaciones de 64 bits en el hardware de 16 bits. Sin embargo, esta aproximación HW/SW introduce penalizaciones no despreciables tanto en el tamaño del código dinámico como en el rendimiento, incluso con un traductor de código inteligente que mapea las aplicaciones de 64 bits en el procesador de 16 bits. El objetivo de esta tesis es el de diseñar una capa software que aproveche la capacidad de las optimizaciones para reducir el efecto negativo en el rendimiento del ISA estrecho. Concretamente, esta tesis se centra en optimizaciones que tratan el problema de como compilar programas de 64 bits para una máquina de 16 bits desde la perspectiva de las Mínimas Computaciones Requeridas (MRC en inglés). Dado un programa, la noción de MRC intenta deducir la cantidad de cómputo que realmente se necesita para generar la misma (correcta) salida que el programa original. Aproximarse al MRC perfecto es una meta intrínsecamente ambiciosa y que requiere predicciones perfectas de comportamiento del programa. Con este fin, la tesis propone tres heurísticas basadas en optimizaciones que tratan de inferir el MRC. La utilización de MRC se desarrolla en la definición de productividad: si un cálculo no altera el dato que ya había almacenado, entonces no es productivo y por lo tanto, no es necesario llevarlo a cabo. Se han propuesto tres optimizaciones del código basadas en profile: 1. Propagación Global de la Productividad (GPP en inglés) aplica el concepto de productividad a la granularidad de función. 2. Poda Local de Productividad (LPP en inglés) aplica el mismo concepto pero a una granularidad mucho más fina, la de una única instrucción. 3. Computación Mínima del Salto (MBC en inglés) es una técnica de reordenación de código que aplica los principios de MRC a los saltos condicionales. El objetivo principal de todas esta técnicas es el de reducir el tamaño dinámico del código estrecho. Las primeras dos optimizaciones (GPP y LPP) realizan la tarea de podar especulativamente las computaciones no productivas (innecesarias) utilizando profiles. Además, estas dos optimizaciones realizan un recorrido hacia atrás de las regiones a optimizar para añadir chequeos en el código no especulativo, haciendo de esta forma la técnica autosuficiente para detectar, dinámicamente, los casos de fallo en la especulación. La idea de la optimización MBC es reordenar las instrucciones que generan el salto condicional tal que las mínimas computaciones que general la misma (correcta) salida se ejecuten en la mayoría de los casos; el resto de las computaciones se ejecutarán sólo cuando sea necesario.
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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерелаIncludes bibliographical references (leaves 84-85).
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. To this end, I propose a more responsible relationship between architects and their software through a combination of interface improvements, code analysis and management tools, and the formation of open source communities for support and development.
by Nicholas Senske.
S.M.
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.
Повний текст джерелаApplied Science, Faculty of
Electrical and Computer Engineering, Department of
Graduate
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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Знайти повний текст джерелаBergman, Harris. "Development of a parallel spectral element computational fluids dynamics code." Thesis, Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/19082.
Повний текст джерела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.
Повний текст джерелаPå RISE Research Institutes of Sweden, är man intresserad av att göra datorsimuleringar av fysiken bakom joniserande tryckgivare. Målet med denna uppsats är att ta reda på om det är möjligt att använda den öppna källkoden Warp för att genomföra simuleringar av fysiken som man är intresserad av. I den här uppsatsen förklaras det vad en joniserande tryckgivare är och fysiken och de styrande matematiska ekvationerna bakom simuleringarna beskrivs. Hur dessa styrande ekvationer löses och algoritmerna som används i Warp diskuteras också i denna uppsats. Resultaten från simuleringarna presenteras i uppsatsen och det förs en diskussion om vilka delar utav Warp som behöver vidareutvecklas för att framgångsrikt kunna simulera fysiken.
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.
Повний текст джерелаMaislin, Scott. "Cyclic Codes and Cyclic Lattices." Scholarship @ Claremont, 2017. http://scholarship.claremont.edu/cmc_theses/1552.
Повний текст джерелаBONIFETTO, ROBERTO. "Computational thermal-hydraulic modeling for nuclear fusion and fission applications." Doctoral thesis, Politecnico di Torino, 2014. http://hdl.handle.net/11583/2572946.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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 demonstrated. The selection of Manufactured Solutions is discussed and it is demonstrated how it can be used to nd the probable cause of bugs. Mutation testing is introduced and used to show the ability to detect errors present in code. The MMS is nally applied in a novel manner to a Method of Moments (MoM) code. The challenges of numerical integration associated with the application of the operator is discussed and correct integration is successfully demonstrated. Subsequently the MMS is demonstrated to be successfully applied to the MoM and mutation testing is used to demonstrate the practical e cacy of the method. The application of the MMS to the MoM is the main contribution of this work.
AFRIKAANSE OPSOMMING: Die Metode van Vervaardigde Oplossings (MVO) word hier bekend gestel vir die veri kasie van numeriese volgolf frekwensie-afhanklike elektromagnetise kode. Die metode word eerstens in die bre e konteks van algemene veri kasie en validasie geplaas en gevolglik word die noodsaaklikheid van kode veri kasie beklemtoon. Daarna, word die toets-metode in die konteks van die Eindige Element Metode vir die E-veld vektorgolf vergelyking bestudeer. Die MVO is oorspronklik ontwikkel in die di erentiaalvergelyking omgewing. Die bruikbaarheid van die metode vir elektromagnetiese simulasies word prakties gedemonstreer deur die opsporing van werklike foute. Die metode word ook verder ondersoek vir die oorsprong van foute. Mutasietoetsing word bekendgestel en word gebruik om die metode verder prakties te veri eer. Die MVO word laastens in 'n nuwe manier gebruik om 'n Moment Metode kode te veri eer. Die praktiese probleme betrokke by numeriese integrasie word ondersoek en die korrekte toepassing van die integraal operator word prakties gedemonstreer. Daarna, word die MVO in hierdie konteks gedemonstreer deur verskeie voorbeelde te ondersoek. Mutasietoetsing word weereens gebruik om na die e ektiewiteit van die MVO te kyk om 'n Moment Metode kode te toets. Die toepassing van die MVO op 'n Moment Metode kode is die hoof bydrae van hierdie werk.
Devulapalli, Venkata Lakshmi Narasimha. "Application of Huffman Data Compression Algorithm in Hashing Computation." TopSCHOLAR®, 2018. https://digitalcommons.wku.edu/theses/2614.
Повний текст джерела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.
Повний текст джерелаChou, Remi. "Information-theoretic security under computational, bandwidth, and randomization constraints." Diss., Georgia Institute of Technology, 2015. http://hdl.handle.net/1853/53837.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерелаIn this work, we present Dido, an implicitly parallel domain-specific language (DSL) that captures high-level stencil abstractions and automatically generates high-performance parallel stencil code for distributed-memory architectures. The generated code uses ORWL as a communication and synchronization backend. We show that Dido achieves a huge progress in terms of programmer productivity without sacrificing the performance. Dido supports a wide range of stencil computations and real-world stencil-based applications. We show that the well-structured code generated by Dido lends itself to different possible optimizations and study the performance of two of them. We also combine Dido's code generation technique with the polyhedral loop optimizer Pluto to increase data locality and improve intra-node data reuse. We present experiments that prove the efficiency and scalability of the generated code that outperforms both ORWL and MPI hand-crafted implementations
Lyle, Suzanne McLean. "Error Correcting Codes and the Human Genome." Digital Commons @ East Tennessee State University, 2010. https://dc.etsu.edu/etd/1689.
Повний текст джерелаCôte, Maxime. "Reconnaissance de codes correcteurs d'erreurs." Phd thesis, Ecole Polytechnique X, 2010. http://pastel.archives-ouvertes.fr/pastel-00006125.
Повний текст джерела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.
Повний текст джерелаApplied Science, Faculty of
Electrical and Computer Engineering, Department of
Graduate
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.
Повний текст джерела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 with the linear solver library PETSc. Through an appropriate mapping of matrix and vector data structures between the two software, the access to a suite of robust, scalable, solver options in PETSc is obtained. Verification of the implementation of MFiX-PETSc is demonstrated through predictions that are identical to those obtained from MFiX?s native solvers for a simple heat conduction case with a well-known solution. After verifying the framework, several cases were tested with MFiX-PETSc to analyze the performance of various solver and preconditioner combinations. For a low Reynolds number, flow over a cylinder case, applying right-side Block Jacobi preconditioning to the BiCGSTAB iterative solver in MFiX-PETSc was 28-40% faster than MFiX?s native solver at the finest mesh resolution. Similarly, the left-side Block Jacobi preconditioner in MFiX-PETSc was 27?46% faster for the same fine meshing. Further assessments of these preconditioning options were then made for a fluidized bed problem involving different bed geometries, convergence tolerances, material densities, and inlet velocities. For a three-dimensional geometry with uniform meshing, native MFiX was faster than MFiX-PETSc for each simulation. The difference in speed was minimized when a low density fluidization material (polypropylene) was used along with a higher order discretization scheme. With these settings, MFiX-PETSc was only 2-6% slower than native MFiX when right-side Block Jacobi preconditioning was employed. The fluidized bed was then represented by a two-dimensional geometry with fine meshing towards the center. When this bed was filled with glass beads, right-side Block Jacobi was 28% faster than MFiX?s native solver, which was the largest speedup encountered throughout this 2D case.
Lienkaemper, Caitlin. "Toric Ideals, Polytopes, and Convex Neural Codes." Scholarship @ Claremont, 2017. http://scholarship.claremont.edu/hmc_theses/106.
Повний текст джерела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.
Повний текст джерелаPh. D.
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.
Повний текст джерелаIncludes bibliographical references (p. 89-90).
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 Reactor (MPBR) is among the advanced reactor designs proposed for future deployment. As such, it offers an excellent opportunity to illustrate the possible contributions of computational modeling to the reactor design process. Because the MPBR contains graphite structures and fuel elements, there is significant concern about graphite heating and chemical reactions during an air ingress accident. Some MPBR-relevant experimental safety assurances have been benchmarked using FLUENT. Currently, there is a planned experiment involving natural convection flow and graphite corrosion at the Forschungzentrum Julich in Julich, Germany. Thus far, only a preliminary test of this experiment has been performed. This test has been called the NACOK Corrosion Test, and this thesis presents a model of the test configuration.
(cont.) A methodology is developed by which an efficient analysis of the flow, heat transfer, and corrosion effects of the test are modeled using the FLUENT software. An adequate grid resolution is determined that allows computationally efficient analysis. Steady-state and transient flow and heat transfer effects are modeled, and separate models contain steady-state and transient chemistry effects. The steady-state flow and heat transfer model was used for the grid refinement study; it was determined that a fully-structured, 4,508 element grid was sufficient for analysis of this experiment. The transient flow and heat transfer model confirmed the results of the steady-state analysis in that the transient model had results similar to those of the steady-state model. An effort was made to couple a density-driven pressure drop correlation to this model; however, because of the requirement of a general pressure-drop specification for the entire model, and the temperature dependence of the correlation, an over-specification resulted that caused the solution to diverge. Because the ambient air that causes the buoyancy-induced pressure drop is not modeled, it was determined that specifying a general pressure drop for the entire model was a sufficient and relevant assumption.
(cont.) The steady-state chemistry model was used to perform sensitivity studies by varying the flow rate, graphite temperature, and stoicheometry. Increasing the flow rate results in quicker graphite consumption, although the oxygen exits the system less depleted. Increasing the graphite temperature seems to have little effect on the chemistry effects of the modeL Varying the stoicheometry indicated that more heat is released by CO2 production. Overall, it was determined that most of the graphite chemistry occurs in the reflector region of the model. A transient chemistry model was also created, but because mass transport effects were not modeled, the solution tended to steady-state operation, rather than eventual graphite cooling, which would be the expected result of this test in the laboratory setting.
by Benjamin T. Parks.
S.M.
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/.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерелаThere is no consensual understanding on what the activity of the hippocampus neurons represents. While experiments with humans foster a dominant view of an episodic memory system, experiments with rodents promote its role as a spatial cognitive system. Although there is abundant evidence pointing to an overlap between these two theories, the dissociation is sustained by conflicting physiological data. This thesis proposes that the functional role of the hippocampus should be analyzed in terms of its structure and function rather than by the correlation of neuronal activity and behavioral performance. The identification of the hippocampus code, i.e. the set of computational principles underlying the input-output transformations of neural activity, might ultimately provide a unifying understanding of its role. In this thesis we present a theoretical model that quantitatively describes and interprets the selectivity of regions of the hippocampus to spatial and non-spatial variables observed in experiments with rats. The results suggest that the multiple aspects of memory expressed in human and rodent data are derived form similar principles. This approach suggests new principles for memory, pattern completion and plasticity. In addition, by creating a causal tie between the neural circuitry and behavior through a robotic control framework we show that the conjunctive nature of neural selectivity observed in the hippocampus is needed for effective problem solving in real-world tasks such as foraging. Altogether, these results advance the concept that the hippocampal code is generic to the different aspects of memory highlighted in the literature.
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.
Повний текст джерела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.
Повний текст джерелаPh. D.
Nawaf, Sameer Obaid. "EFFECT OF ANCILLA LOSSES ON FAULT-TOLERANT QUANTUM ERROR CORRECTION IN THE [[7,1,3]] STEANE CODE." OpenSIUC, 2013. https://opensiuc.lib.siu.edu/theses/1333.
Повний текст джерела