Dissertations / Theses on the topic 'Cognitive computation'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Cognitive 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.
Mansinghka, Vikash Kumar. "Natively probabilistic computation." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/47892.
Full textIncludes bibliographical references (leaves 129-135).
I introduce a new set of natively probabilistic computing abstractions, including probabilistic generalizations of Boolean circuits, backtracking search and pure Lisp. I show how these tools let one compactly specify probabilistic generative models, generalize and parallelize widely used sampling algorithms like rejection sampling and Markov chain Monte Carlo, and solve difficult Bayesian inference problems. I first introduce Church, a probabilistic programming language for describing probabilistic generative processes that induce distributions, which generalizes Lisp, a language for describing deterministic procedures that induce functions. I highlight the ways randomness meshes with the reflectiveness of Lisp to support the representation of structured, uncertain knowledge, including nonparametric Bayesian models from the current literature, programs for decision making under uncertainty, and programs that learn very simple programs from data. I then introduce systematic stochastic search, a recursive algorithm for exact and approximate sampling that generalizes a popular form of backtracking search to the broader setting of stochastic simulation and recovers widely used particle filters as a special case. I use it to solve probabilistic reasoning problems from statistical physics, causal reasoning and stereo vision. Finally, I introduce stochastic digital circuits that model the probability algebra just as traditional Boolean circuits model the Boolean algebra.
(cont.) I show how these circuits can be used to build massively parallel, fault-tolerant machines for sampling and allow one to efficiently run Markov chain Monte Carlo methods on models with hundreds of thousands of variables in real time. I emphasize the ways in which these ideas fit together into a coherent software and hardware stack for natively probabilistic computing, organized around distributions and samplers rather than deterministic functions. I argue that by building uncertainty and randomness into the foundations of our programming languages and computing machines, we may arrive at ones that are more powerful, flexible and efficient than deterministic designs, and are in better alignment with the needs of computational science, statistics and artificial intelligence.
by Vikash Kumar Mansinghka.
Ph.D.
Sprevak, Mark Daniel. "Computation in mind and world : a realist account of computation in cognitive science." Thesis, University of Cambridge, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.613848.
Full textJonas, Eric Michael. "Stochastic architectures for probabilistic computation." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/87457.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (pages 107-111).
The brain interprets ambiguous sensory information faster and more reliably than modern computers, using neurons that are slower and less reliable than logic gates. But Bayesian inference, which is at the heart of many models for sensory information processing and cognition, as well as many machine intelligence systems, appears computationally challenging, even given modern transistor speeds and energy budgets. The computational principles and structures needed to narrow this gap are unknown. Here I show how to build fast Bayesian computing machines using intentionally stochastic, digital parts, narrowing this efficiency gap by multiple orders of magnitude. By connecting stochastic digital components according to simple mathematical rules, it is possible to rapidly, reliably and accurately solve many Bayesian inference problems using massively parallel, low precision circuits. I show that our circuits can solve problems of depth and motion perception, perceptual learning and causal reasoning via inference over 10,000+ latent variables in real time - a 1,000x speed advantage over commodity microprocessors - by exploiting stochasticity. I will show how this natively stochastic approach follows naturally from the probability algebra, giving rise to easy-to-understand rules for abstraction and composition. I have developed a compiler that automatically generate circuits for a wide variety of problems fixed-structure problems. I then present stochastic computing architectures for models that are viable even when constrained by silicon area and dynamic creation and destruction of random variables. These results thus expose a new role for randomness and Bayesian inference in the engineering and reverse-engineering of computing machines.
by Eric Jonas.
Ph. D.
Ullman, Michael Thomas. "The computation of inflectional morphology." Thesis, Massachusetts Institute of Technology, 1993. http://hdl.handle.net/1721.1/12489.
Full textGhahramani, Zoubin. "Computation and psychophysics of sensorimotor integration." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/11123.
Full textKell, Alexander James Eaton. "Hierarchy and invariance in auditory cortical computation." Thesis, Massachusetts Institute of Technology, 2018. https://hdl.handle.net/1721.1/132746.
Full textCataloged from the PDF version of thesis. "June 2019"--Hand written on title page.
Includes bibliographical references.
With ease, we recognize a friend's voice in a crowd, or pick out the first violin in a concerto. But the effortlessness of everyday perception masks its computational challenge. Perception does not occur in the eyes and ears - indeed, nearly half of primate cortex is dedicated to it. While much is known about peripheral auditory processing, auditory cortex remains poorly understood. This thesis addresses basic questions about the functional and computational organization of human auditory cortex through three studies. In the first study we show that a hierarchical neural network model optimized to recognize speech and music does so at human levels, exhibits a similar pattern of behavioral errors, and predicts cortical responses, as measured with fMRI. The multi-task optimization procedure we introduce produces separate music and speech pathways after a shared front end, potentially recapitulating aspects of auditory cortical functional organization. Within the model, different layers best predict primary and non-primary voxels, revealing a hierarchical organization in human auditory cortex. We then seek to characterize the representational transformations that occur across stages of the putative cortical hierarchy, probing for one candidate: invariance to realworld background noise. To measure invariance, we correlate voxel responses to natural sounds with and without real-world background noise. Non-primary responses are substantially more noise-invariant than primary responses. These results illustrate a representational consequence of the potential hierarchical organization of the auditory system. Lastly, we explore of the generality of deep neural networks as models of human hearing by simulating many psychophysical and fMRI experiments on the above-described neural network model. The results provide an extensive comparison of the performance characteristics and internal representations of a deep neural network with those of humans. We observe many similarities that suggest that the model replicates a broad variety of aspects of auditory perception. However, we also find discrepancies that suggest targets for future modeling efforts.
by Alexander James Eaton Kell.
Ph. D. in Neuroscience
Ph.D.inNeuroscience Massachusetts Institute of Technology, Department of Brain and Cognitive Sciences
Heirdsfield, Ann M. "Mental computation: The identification of associated cognitive, metacognitive and affective factors." Thesis, Queensland University of Technology, 2001. https://eprints.qut.edu.au/36637/1/36637_Digitised%20Thesis.pdf.
Full textWells, Andrew J. "The External Tape Hypothesis : a Turing machine based approach to cognitive computation." Thesis, London School of Economics and Political Science (University of London), 1994. http://etheses.lse.ac.uk/118/.
Full textAboalela, Rania Anwar. "An Assessment of Knowledge by Pedagogical Computation on Cognitive Level mapped Concept Graphs." Kent State University / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=kent1496941747313396.
Full textFayez, Almohanad Samir. "Design Space Decomposition for Cognitive and Software Defined Radios." Diss., Virginia Tech, 2013. http://hdl.handle.net/10919/23180.
Full textdepend on software to implement radio functionality. Cognitive Engines (CEs) introduce
intelligence to radio by monitoring radio performance through a set of meters and configuring
the underlying radio design by modifying its knobs. In Cognitive Radio (CR) applications,
CEs intelligently monitor radio performance and reconfigure them to meet it application
and RF channel needs. While the issue of introducing computational knobs and meters
is mentioned in literature, there has been little work on the practical issues involved in
introducing such computational radio controls.
This dissertation decomposes the radio definition to reactive models for the CE domain
and real-time, or dataflow models, for the SDR domain. By allowing such design space
decomposition, CEs are able to define implementation independent radio graphs and rely on
a model transformation layer to transform reactive radio models to real-time radio models
for implementation. The definition of knobs and meters in the CE domain is based on
properties of the dataflow models used in implementing SDRs. A framework for developing
this work is presented, and proof of concept radio applications are discussed to demonstrate
how CEs can gain insight into computational aspects of their radio implementation during
their reconfiguration decision process.
Ph. D.
Rieuf, Vincent. "Impact de l’expérience immersive sur la prise en compte du kansei en design industriel amont." Thesis, Paris, ENSAM, 2013. http://www.theses.fr/2013ENAM0027/document.
Full textIn an ever-changing context, the industrial design uses representation as a vector for inspiration and as a tool to operate stylistic choices which in turn enable the shaping of the experience induced by the designed product.This doctoral research presents the comparative study of traditional early design activity and immersive early design activity. This enables the evaluation and modeling of Virtual Kansei Design. My work essentially address the application and experimentation of fundamental theories through the design of two successive tools composing and innovative early design process.• The Immersive Moodboards are spatial immersive inspirational environments dedicated to the understanding of a stylistic trend, designed to substitute and enhance traditional moodboards.• The Immersive sketching is a generational environment enabling the design to position, erase, manipulate… a graphical mark in a three dimensional space planned for the creation of the first ideation sketches.This research aim to develop tools and a digital immersive workflow which first of all enables the design to anticipate Kansei (holistic relationship between the designer/user and the product) in order to optimize strategic style related choices and secondly enhances the fidelity between inspiration and generation while increasing the ability of the designer to produce innovating and aesthetic concepts
Riera, Villanueva Marc. "Low-power accelerators for cognitive computing." Doctoral thesis, Universitat Politècnica de Catalunya, 2020. http://hdl.handle.net/10803/669828.
Full textLes xarxes neuronals profundes (DNN) han aconseguit un èxit enorme en aplicacions cognitives, i són especialment eficients en problemes de classificació i presa de decisions com ara reconeixement de veu o traducció automàtica. Els dispositius mòbils depenen cada cop més de les DNNs per entendre el món. Els telèfons i rellotges intel·ligents, o fins i tot els cotxes, realitzen diàriament tasques discriminatòries com ara el reconeixement de rostres o objectes. Malgrat la popularitat creixent de les DNNs, el seu funcionament en sistemes mòbils presenta diversos reptes: proporcionar una alta precisió i rendiment amb un petit pressupost de memòria i energia. Les DNNs modernes consisteixen en milions de paràmetres que requereixen recursos computacionals i de memòria enormes i, per tant, no es poden utilitzar directament en sistemes de baixa potència amb recursos limitats. L'objectiu d'aquesta tesi és abordar aquests problemes i proposar noves solucions per tal de dissenyar acceleradors eficients per a sistemes de computació cognitiva basats en DNNs. En primer lloc, ens centrem en optimitzar la inferència de les DNNs per a aplicacions de processament de seqüències. Realitzem una anàlisi de la similitud de les entrades entre execucions consecutives de les DNNs. A continuació, proposem DISC, un accelerador que implementa una tècnica de càlcul diferencial, basat en l'alt grau de semblança de les entrades, per reutilitzar els càlculs de l'execució anterior, en lloc de computar tota la xarxa. Observem que, de mitjana, més del 60% de les entrades de qualsevol capa de les DNNs utilitzades presenten canvis menors respecte a l'execució anterior. Evitar els accessos de memòria i càlculs d'aquestes entrades comporta un estalvi d'energia del 63% de mitjana. En segon lloc, proposem optimitzar la inferència de les DNNs basades en capes FC. Primer analitzem el nombre de pesos únics per neurona d'entrada en diverses xarxes. Aprofitant optimitzacions comunes com la quantització lineal, observem un nombre molt reduït de pesos únics per entrada en diverses capes FC de DNNs modernes. A continuació, per millorar l'eficiència energètica del càlcul de les capes FC, presentem CREW, un accelerador que implementa un eficient mecanisme de reutilització de càlculs i emmagatzematge dels pesos. CREW redueix el nombre de multiplicacions i proporciona estalvis importants en l'ús de la memòria. Avaluem CREW en un conjunt divers de DNNs modernes. CREW proporciona, de mitjana, una millora en rendiment de 2,61x i un estalvi d'energia de 2,42x. En tercer lloc, proposem un mecanisme per optimitzar la inferència de les RNNs. Les cel·les de les xarxes recurrents realitzen multiplicacions element a element de les activacions de diferents comportes, sigmoides i tanh sent les funcions habituals d'activació. Realitzem una anàlisi dels valors de les funcions d'activació i mostrem que una fracció significativa està saturada cap a zero o un en un conjunto d'RNNs populars. A continuació, proposem CGPA per podar dinàmicament les activacions de les RNNs a una granularitat gruixuda. CGPA evita l'avaluació de neurones senceres cada vegada que les sortides de neurones parelles estan saturades. CGPA redueix significativament la quantitat de càlculs i accessos a la memòria, aconseguint en mitjana un 12% de millora en el rendiment i estalvi d'energia. Finalment, en l'última contribució d'aquesta tesi ens centrem en metodologies de poda estàtica de les DNNs. La poda redueix la petjada de memòria i el treball computacional mitjançant l'eliminació de connexions o neurones redundants. Tanmateix, mostrem que els esquemes de poda previs fan servir un procés iteratiu molt llarg que requereix l'entrenament de les DNNs moltes vegades per ajustar els paràmetres de poda. A continuació, proposem un esquema de poda basat en l'anàlisi de components principals i la importància relativa de les connexions de cada neurona que optimitza automàticament el DNN optimitzat en un sol tret sense necessitat de sintonitzar manualment múltiples paràmetres
Buss, Aaron Thomas. "Closing the developmental loop on the behavioral and neural dynamics of flexible rule-use." Diss., University of Iowa, 2013. https://ir.uiowa.edu/etd/4949.
Full textLundqvist, Tomas. "Creating Resilience – A Matter of Control or Computation? : Resilience Engineering explored through the lenses of Cognitive Systems Engineering and Distributed Cognition in a patient safety case study." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-102366.
Full textBurke, Lauren. "Computer Science Education at The Claremont Colleges: The Building of an Intuition." Scholarship @ Claremont, 2016. http://scholarship.claremont.edu/scripps_theses/875.
Full textSchultheis, Holger. "Computational cognitive modeling of control in spatial cognition." Lengerich Berlin Bremen Miami, Fla. Riga Viernheim Wien Zagreb Pabst Science Publ, 2009. http://d-nb.info/998029661/04.
Full textPowell, Nathaniel V. "The role of Uncertainty in Categorical Perception Utilizing Statistical Learning in Robots." ScholarWorks @ UVM, 2016. http://scholarworks.uvm.edu/graddis/581.
Full textTyska, Carvalho Jônata. "Adaptive behaviour in evolving robots." Thesis, University of Plymouth, 2017. http://hdl.handle.net/10026.1/10547.
Full textCosta, César Rennó. "Controle de síntese sonora por analogia acústica e semântica aplicando computação bio-inspirada." [s.n.], 2007. http://repositorio.unicamp.br/jspui/handle/REPOSIP/259090.
Full textDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação
Made available in DSpace on 2018-08-17T09:26:02Z (GMT). No. of bitstreams: 1 Costa_CesarRenno_M.pdf: 8817422 bytes, checksum: f05c86a8d8717568f1afd9da373b6a55 (MD5) Previous issue date: 2007
Resumo: Este trabalho sugere novos paradigmas de controle de mecanismos de síntese sonora. Utilizando conceitos das ciências cognitivas, o processo gerativo é modelado como um sistema de conversões entre representações, da atuação subjetiva do usuário, passando pela descritiva e culminando no material sonoro. A partir do estudo da analogia descritiva, engendra-se a analogia acústica, representação por amostras sonoras, e a analogia semântica, representação por linguagem. Aplicadas à arquitetura modelada, essas analogias permitem que o processo de síntese sonora tenha um caráter mais intuitivo. São apresentadas duas implementações práticas, sendo que técnicas de computação bio-inspirada fornecem o maquinário computacional para a realização do mapeamento entre representações e controle do processo de síntese
Abstract: This work suggests novel control paradigms of sound synthesis mechanisms. Applying cognitive science concepts, the generative process is modeled as a system of conversions throughout representations: from user's insight, through descriptive, to the sound material. From descriptive analogy studies, the acoustic analogy (representation through sound) and the semantic analogy (representation through language) are engendered. Applied to the modeled architecture, these analogies allow the synthesis process to have a more intuitive nature. Two practical implementations are presented. Bio-inspired computing provides the computational machinery used to map different representations and to control the synthesis process
Mestrado
Mestre em Engenharia Elétrica
Boruta, Luc. "Indicateurs d'allophonie et de phonémicité." Phd thesis, Université Paris-Diderot - Paris VII, 2012. http://tel.archives-ouvertes.fr/tel-00746163.
Full textLowry, Mark D. "Evaluating Theories of Bilingual Language Control Using Computational Models." Scholar Commons, 2019. https://scholarcommons.usf.edu/etd/7852.
Full textMadl, Tamas. "Bayesian mechanisms in spatial cognition : towards real-world capable computational cognitive models of spatial memory." Thesis, University of Manchester, 2016. https://www.research.manchester.ac.uk/portal/en/theses/bayesian-mechanisms-in-spatial-cognition-towards-realworld-capable-computational-cognitive-models-of-spatial-memory(665d1016-b841-47de-9b2d-40ddd8a0ff0d).html.
Full textLie, Nga-sze, and 李雅詩. "Abduction and computation." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2012. http://hub.hku.hk/bib/B4819928X.
Full textpublished_or_final_version
Philosophy
Doctoral
Doctor of Philosophy
Carbonaro, Michael David. "Computational cognitive modeling of concept attainment." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq22960.pdf.
Full textMiri, Hossein. "CernoCAMAL : a probabilistic computational cognitive architecture." Thesis, University of Hull, 2012. http://hydra.hull.ac.uk/resources/hull:6887.
Full textSeminck, Olga. "Cognitive Computational Models of Pronoun Resolution." Thesis, Sorbonne Paris Cité, 2018. http://www.theses.fr/2018USPCC184/document.
Full textPronoun resolution is the process in which an anaphoric pronoun is linked to its antecedent. In a normal situation, humans do not experience much cognitive effort due to this process. However, automatic systems perform far from human accuracy, despite the efforts made by the Natural Language Processing community. Experimental research in the field of psycholinguistics has shown that during pronoun resolution many linguistic factors are taken into account by speakers. An important question is thus how much influence each of these factors has and how the factors interact with each-other. A second question is how linguistic theories about pronoun resolution can incorporate all relevant factors. In this thesis, we propose a new approach to answer these questions: computational simulation of the cognitive load of pronoun resolution. The motivation for this approach is two-fold. On the one hand, implementing hypotheses about pronoun resolution in a computational system leads to a more precise formulation of theories. On the other hand, robust computational systems can be run on uncontrolled data such as eye movement corpora and thus provide an alternative to hand-constructed experimental material. In this thesis, we conducted various experiments. First, we simulated the cognitive load of pronouns by learning the magnitude of impact of various factors on corpus data. Second, we tested whether concepts from Information Theory were relevant to predict the cognitive load of pronoun resolution. Finally, we evaluated a theoretical model of pronoun resolution on a corpus enriched with eye movement data. Our research shows that multiple factors play a role in pronoun resolution and that their influence can be estimated on corpus data. We also demonstrate that the concepts of Information Theory play a role in pronoun resolution. We conclude that the evaluation of hypotheses on corpus data enriched with cognitive data ---- such as eye movement data --- play an important role in the development and evaluation of theories. We expect that corpus based methods will lead to a better modelling of the influence of discourse structure on pronoun resolution in future work
Gok, Selvi Elif. "Modeling Consciousness: A Comparison Of Computational Models." Master's thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/3/12611178/index.pdf.
Full textreview and study. The computational models studied are evaluated with respect to each identified aspect and feature of consciousness.
Urgen, Burcu Aysen. "A Philosophical Analysis Of Computational Modeling In Cognitive Science." Master's thesis, METU, 2007. http://etd.lib.metu.edu.tr/upload/12608832/index.pdf.
Full textMorrison (1999)&rsquo
s account, is employed on a case study. The framework emphasizes four key elements to understand the place of models in science, which are the construction of models, the function of models, the representation they provide, and the ways we learn from models. The case study Q-Soar (Simon, Newell &
Klahr, 1991), is a model built with Soar cognitive architecture (Laird, Newell &
Rosenbloom, 1987) which is representative of a class of computational cognitive models. Discussions are included for how to make generalizations for computational cognitive models out of this class, i.e. for models that are built with other modeling paradigms.
Rendell, Nicholas. "Mechanisms of cognitive reserve : computational and experimental explorations." Thesis, Birkbeck (University of London), 2017. http://bbktheses.da.ulcc.ac.uk/256/.
Full textJin, Lifeng. "Computational Modeling of Syntax Acquisition with Cognitive Constraints." The Ohio State University, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1594934826359118.
Full textAlcock, Rupert. "Governing the new unconscious : cognition, computation and biopolitics." Thesis, University of Bristol, 2016. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.723433.
Full textKleiman-Weiner, Max. "Computational foundations of human social intelligence." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/120621.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (pages 199-211).
This thesis develops formal computational cognitive models of the social intelligence underlying human cooperation and morality. Human social intelligence is uniquely powerful. We collaborate with others to accomplish together what none of us could do on our own; we share the benefits of collaboration fairly and trust others to do the same. Even young children work and play collaboratively, guided by normative principles, and with a sophistication unparalleled in other animal species. Here, I seek to understand these everyday feats of social intelligence in computational terms. What are the cognitive representations and processes that underlie these abilities and what are their origins? How can we apply these cognitive principles to build machines that have the capacity to understand, learn from, and cooperate with people? The overarching formal framework of this thesis is the integration of individually rational, hierarchical Bayesian models of learning, together with socially rational multi-agent and game-theoretic models of cooperation. I use this framework to probe cognitive questions across three time-scales: evolutionary, developmental, and in the moment. First, I investigate the evolutionary origins of the cognitive structures that enable cooperation and support social learning. I then describe how these structures are used to learn social and moral knowledge rapidly during development, leading to the accumulation of knowledge over generations. Finally I show how this knowledge is used and generalized in the moment, across an infinitude of possible situations. This framework is applied to a variety of cognitively challenging social inferences: determining the intentions of others, distinguishing who is friend or foe, and inferring the reputation of others all from just a single observation of behavior. It also answers how these inferences enable fair and reciprocal cooperation, the computation of moral permissibility, and moral learning. This framework predicts and explains human judgment and behavior measured in large-scale multi-person experiments. Together, these results shine light on how the scale and scope of human social behavior is ultimately grounded in the sophistication of our social intelligence.
by Max Kleiman-Weiner.
Ph. D.
Mukovskiy, Albert [Verfasser]. "Computational Methods for Cognitive and Cooperative Robotics / Albert Mukovskiy." Tübingen : Universitätsbibliothek Tübingen, 2019. http://d-nb.info/1227480946/34.
Full textChada, Daniel de Magalhães. "From cognitive science to management science: two computational contributions." reponame:Repositório Institucional do FGV, 2011. http://hdl.handle.net/10438/17053.
Full textApproved for entry into archive by Kelly Ayala (kelly.ayala@fgv.br) on 2016-09-12T12:58:17Z (GMT) No. of bitstreams: 1 Chada 2011 FINAL ENTREGUE.pdf: 579283 bytes, checksum: f463590c20f51b84ba0f9357ab1a6e08 (MD5)
Approved for entry into archive by Kelly Ayala (kelly.ayala@fgv.br) on 2016-09-12T13:00:07Z (GMT) No. of bitstreams: 1 Chada 2011 FINAL ENTREGUE.pdf: 579283 bytes, checksum: f463590c20f51b84ba0f9357ab1a6e08 (MD5)
Made available in DSpace on 2016-09-12T13:03:31Z (GMT). No. of bitstreams: 1 Chada 2011 FINAL ENTREGUE.pdf: 579283 bytes, checksum: f463590c20f51b84ba0f9357ab1a6e08 (MD5) Previous issue date: 2011
This work is composed of two contributions. One borrows from the work of Charles Kemp and Joshua Tenenbaum, concerning the discovery of structural form: their model is used to study the Business Week Rankings of U.S. Business Schools, and to investigate how other structural forms (structured visualizations) of the same information used to generate the rankings can bring insights into the space of business schools in the U.S., and into rankings in general. The other essay is purely theoretical in nature. It is a study to develop a model of human memory that does not exceed our (human) psychological short-term memory limitations. This study is based on Pentti Kanerva’s Sparse Distributed Memory, in which human memories are registered into a vast (but virtual) memory space, and this registration occurs in massively parallel and distributed fashion, in ideal neurons.
Este trabalho é composto de duas contribuições. Uma se usa do trabalhode Charles Kemp e Joshua Tenenbaum sobre a descoberta da forma estrutural: o seu modelo é usado para estudar os rankings da revista Business Week sobre escolas de administração, e para investigar como outras formas estruturais (visualizações estruturadas) da mesma informação usada para gerar os rankings pode trazer discernimento no espaço de escolas de negócios nos Estados Unidos e em rankings em geral. O outro ensaio é de natureza puramente teórica. Ele é um estudo no desenvolvimento de um modelo de memória que não excede os nossos (humanos) limites de memória de curto-prazo. Este estudo se baseia na Sparse Distributed Memory (Memória Esparsa e Distribuida) de Pentti Kanerva, na qual memórias humanas são registradas em um vasto (mas virtual) espaço, e este registro ocorre de forma maciçamente paralela e distribuida, em neurons ideais.
Johnson, Joseph G. "A computational modeling account of robust preference reversal phenomena." [Bloomington, Ind.] : Indiana University, 2004. http://wwwlib.umi.com/dissertations/fullcit/3162242.
Full textTitle from PDF t.p. (viewed Dec. 1, 2008). Source: Dissertation Abstracts International, Volume: 66-01, Section: B, page: 0586. Chair: Jerome R. Busemeyer.
Passera, Anthony. "A computational model of visuo-motor development." Thesis, Massachusetts Institute of Technology, 1993. http://hdl.handle.net/1721.1/12585.
Full textPasquali, Antoine. "Learning with and without consciousness: empirical and computational explorations." Doctoral thesis, Universite Libre de Bruxelles, 2009. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210269.
Full textHere are a few of the many questions that I have attempted to investigate during the past few years. The main goal of this thesis was to explore the differences between conscious and unconscious learning. Thus, I will expose the behavioral and computational explorations that we conducted during the last few years. To present them properly, I first review the main concepts that, for almost a century now, researchers in the fields of neuroscience have formulated in order to tackle the issues of both learning and consciousness. Then I detail different hypotheses that guided our empirical and computational explorations. Notably, a few series of experiments allowed identification of several mechanisms that participate in either unconscious or conscious learning. In addition we explored a computational framework for explaining how one could learn unconsciously and nonetheless gain subjective access to one’s mental events. After reviewing the unfolding of our investigation, I detail the mechanisms that we identified as responsible for differences between learning with and without consciousness, and propose new hypotheses to be evaluated in the future.
Doctorat en Sciences Psychologiques et de l'éducation
info:eu-repo/semantics/nonPublished
Wrigley, Stuart Nicholas. "A theory and computational model of auditory selective attention." Thesis, University of Sheffield, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.269326.
Full textPainter, Joan. "Imaginal processing in the two hemispheres : a computational investigation." Thesis, Goldsmiths College (University of London), 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.297225.
Full textAparicio, Mera Juan José. "Representación computacional de las perífrasis de fase: de la cognición a la computación." Doctoral thesis, Universitat de Barcelona, 2016. http://hdl.handle.net/10803/392696.
Full textThis thesis, based on cognitive linguistics and stemming from an empirical perspective, deals with the phenomenon of Spanish phase periphrases. Thus, one of our goals is to understand, clarify and systematically characterize their semantic-aspectual status in order to represent them from a computational point of view. The semantics and aspect of the phase periphrases are considered as mechanisms of composition, in which the meaning of a complex unit is built from the meaning of simple units. In this proposal of representation, the focus is on the semantic-conceptual dimension of the periphrastic construction. Consequently, the concept of "scheme" is a key point in the analysis. This is why different combinations and restrictions arise in the formation processes of periphrases. A lexical verb can only participate in those periphrases that express an appropriate setting scheme for the denoted situation. This proposal of aspectual characterization of phase periphrases can capture both resulting restrictions from the interrelationship between lexical aspect and periphrastic context, and the gradual nature of the "Aktionsart". Thus, new ways are offered for observing the relationship and the changes that occur between categories. The system of representation that is proposed is motivated not only cognitively; but, above all, it is empirically verified against the methodologies provided by corpus linguistics and statistical techniques. Therefore, this thesis gathers different empirical methodologies in the study of phase periphrases and their representation. In this sense, a study of corpus of broad-coverage has been made, which has allowed us, first, to confirm that the phase periphrases are sensitive to the “Aktionsart”; secondly, to identify and classify the different resulting routes of aspectual coercion in this kind of periphrases, and last, to demonstrate that in these periphrases the greater expression, the lower functional profitability. The system of event structure analysis implemented has allowed us to develop an initial set of criteria for the annotation of the phase periphrases in a corpus of Spanish. Finally, the model of representation proposed allows cognition and computing to be brought near. The parameters of cognitive linguistics have been formalized and have been proved to be suitable for their computational representation.
Lundh, Dan. "A computational neuroscientific model for short-term memory." Thesis, University of Exeter, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.324742.
Full textGartenberg, Daniel. "A Comprehensive Computational Model of Sustained Attention." Thesis, George Mason University, 2016. http://pqdtopen.proquest.com/#viewpdf?dispub=10130797.
Full textThe vigilance decrement is the decline in performance over time that characterizes tasks requiring sustained attention. Resource Theory proposes that the vigilance decrement is due to information processing assets that become depleted with use. Resource theorists must thus identify these assets and the process of how resources are depleted and replenished. The Microlapse Theory of Fatigue (MTF) identifies the resource that is depleted when performing a sustained attention task as the central executive attentional network. The depletion of the central executive network resource results in microlapses or brief gaps in attention that prevent the perception and processing of information. The MTF can explain various effects in the sustained attention literature regarding how resources are depleted. However, the MTF alone cannot explain the event rate effect or the motivation effect because it does not include replenishment mechanisms that can occur during a sustained attention task. To better understand the process of replenishment, participants were assigned to varying event rate and external motivation conditions in a novel paradigm that could measure the perceptual processing of a trial over time. These stages of processing included when participants looked at the first stimulus, looked at the second stimulus, and responded. In Experiment 1, it was found that the vigilance decrement was more severe for faster event rates, consistent with Resource Theory and counter to the MTF. In Experiment 2, the event rate effect was replicated, but unexpectedly, external motivation did not impact the vigilance decrement. In both experiments it was found that for the stages of processing that involved looking at the stimuli, more slowing was found as event rate increased. Additionally, more slowing was detected earlier in the processing of a trial than later. These results supported the process of microlapses inducing the vigilance decrement due to not having enough time to perceive, encode, and respond to stimuli, as described by the MTF. It was interpreted that the interaction between time-on-task and event rate was due to opportunistic breaks that occurred more frequently in slower event rate conditions. The finding that more slowing occurred earlier in processing was interpreted as evidence for internal rewards related to learning impacting the speed of processing a trial. To explain these findings, I propose the Microlapse Theory of Fatigue with Replenishment (MTFR) a process model similar to MTF, but that includes additional replenishment mechanisms related to opportunistic rest periods and internal rewards. The Microlapse Theory of Fatigue with Replenishment (MTFR) closely correlates to the empirical data and is an important step forward in the effort to build a comprehensive model of sustained attention.
Dreany, Harry Hayes. "Safety Engineering of Computational Cognitive Architectures within Safety-Critical Systems." Thesis, The George Washington University, 2018. http://pqdtopen.proquest.com/#viewpdf?dispub=10688677.
Full textThis paper presents the integration of an intelligent decision support model (IDSM) with a cognitive architecture that controls an autonomous non-deterministic safety-critical system. The IDSM will integrate multi-criteria, decision-making tools via intelligent technologies such as expert systems, fuzzy logic, machine learning, and genetic algorithms.
Cognitive technology is currently simulated within safety-critical systems to highlight variables of interest, interface with intelligent technologies, and provide an environment that improves the system’s cognitive performance. In this study, the IDSM is being applied to an actual safety-critical system, an unmanned surface vehicle (USV) with embedded artificial intelligence (AI) software. The USV’s safety performance is being researched in a simulated and a real-world, maritime based environment. The objective is to build a dynamically changing model to evaluate a cognitive architecture’s ability to ensure safe performance of an intelligent safety-critical system. The IDSM does this by finding a set of key safety performance parameters that can be critiqued via safety measurements, mechanisms, and methodologies. The uniqueness of this research lies in bounding the decision-making associated with the cognitive architecture’s key safety parameters (KSPs). Other real-time applications (RTAs) that would benefit from advancing cognitive science associated with safety are unmanned platforms, transportation technologies, and service robotics. Results will provide cognitive science researchers with a reference for the safety engineering of artificially intelligent safety-critical systems.
Chan, Tak-Shing Thomas. "A cognitive information theory of music : a computational memetics approach." Thesis, Goldsmiths College (University of London), 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.479386.
Full textCronin, Beau D. "Quantifying uncertainty in computational neuroscience with Bayesian statistical inference." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/45336.
Full textIncludes bibliographical references (p. 101-106).
Two key fields of computational neuroscience involve, respectively, the analysis of experimental recordings to understand the functional properties of neurons, and modeling how neurons and networks process sensory information in order to represent the environment. In both of these endeavors, it is crucial to understand and quantify uncertainty - when describing how the brain itself draws conclusions about the physical world, and when the experimenter interprets neuronal data. Bayesian modeling and inference methods provide many advantages for doing so. Three projects are presented that illustrate the advantages of the Bayesian approach. In the first, Markov chain Monte Carlo (MCMC) sampling methods were used to answer a range of scientific questions that arise in the analysis of physiological data from tuning curve experiments; in addition, a software toolbox is described that makes these methods widely accessible. In the second project, the model developed in the first project was extended to describe the detailed dynamics of orientation tuning in neurons in cat primary visual cortex. Using more sophisticated sampling-based inference methods, this model was applied to answer specific scientific questions about the tuning properties of a recorded population. The final project uses a Bayesian model to provide a normative explanation of sensory adaptation phenomena. The model was able to explain a range of detailed physiological adaptation phenomena.
by Beau D. Cronin.
Ph.D.
Smith, Elliot. "Incoherence and text comprehension : cognitive and computational models of inferential control." Thesis, University of Birmingham, 2000. http://etheses.bham.ac.uk//id/eprint/4653/.
Full textVellmer, Sebastian. "Applications of the Fokker-Planck Equation in Computational and Cognitive Neuroscience." Doctoral thesis, Humboldt-Universität zu Berlin, 2020. http://dx.doi.org/10.18452/21597.
Full textThis thesis is concerned with the calculation of statistics, in particular the power spectra, of point processes generated by stochastic multidimensional integrate-and-fire (IF) neurons, networks of IF neurons and decision-making models from the corresponding Fokker-Planck equations. In the brain, information is encoded by sequences of action potentials. In studies that focus on spike timing, IF neurons that drastically simplify the spike generation have become the standard model. One-dimensional IF neurons do not suffice to accurately model neural dynamics, however, the extension towards multiple dimensions yields realistic behavior at the price of growing complexity. The first part of this work develops a theory of spike-train power spectra for stochastic, multidimensional IF neurons. From the Fokker-Planck equation, a set of partial differential equations is derived that describes the stationary probability density, the firing rate and the spike-train power spectrum. In the second part of this work, a mean-field theory of large and sparsely connected homogeneous networks of spiking neurons is developed that takes into account the self-consistent temporal correlations of spike trains. Neural input is approximated by colored Gaussian noise generated by a multidimensional Ornstein-Uhlenbeck process of which the coefficients are initially unknown but determined by the self-consistency condition and define the solution of the theory. To explore heterogeneous networks, an iterative scheme is extended to determine the distribution of spectra. In the third part, the Fokker-Planck equation is applied to calculate the statistics of sequences of binary decisions from diffusion-decision models (DDM). For the analytically tractable DDM, the statistics are calculated from the corresponding Fokker-Planck equation. To determine the statistics for nonlinear models, the threshold-integration method is generalized.
Iyer, Laxmi R. "CANDID - A Neurodynamical Model of Idea Generation." University of Cincinnati / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1326828617.
Full textDeline, Stéphane. "Différences individuelles dans les processus de contrôle attentionnel chez des personnes jeunes et âgées : approches expérimentale et computationnelle." Phd thesis, Université Rennes 2, 2011. http://tel.archives-ouvertes.fr/tel-00960549.
Full textMilne, Andrew J. "A computational model of the cognition of tonality." Thesis, Open University, 2013. http://oro.open.ac.uk/38787/.
Full text