• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 171
  • 80
  • 52
  • 12
  • 7
  • 6
  • 5
  • 4
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 1
  • Tagged with
  • 433
  • 94
  • 86
  • 45
  • 44
  • 34
  • 34
  • 33
  • 30
  • 28
  • 27
  • 27
  • 26
  • 26
  • 22
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
11

State interest in cable communications /

Muth, Thomas A. January 1979 (has links)
Diss. Ph. D.--Columbus--Ohio state university, 1973. / Bibliogr. p. 337-346.
12

Distributed associative memory

Sterne, Philip Jonathan January 2011 (has links)
This dissertation modifies error-correcting codes and Bloom filters to create high-capacity associative memories. These associative memories use principled statistical inference and are distributed as no single component contains enough information to complete the task by itself, yet the components can collectively solve the task by passing information to each other. These associative memories are also robust to hardware failure as their distributed nature ensures there is no single point of failure. This dissertation starts by simplifying a Bloom filter so that it tolerates hardware failure (albeit with reduced performance). An efficient associative memory is created by performing inference over the set of items stored in the Bloom filter. This architecture suggests a modification which forgets old patterns stored in the associative memory (known as a palimpsest memory). It is shown that overwriting old patterns in an independent manner reduces performance, but is still comparable to the well-known Hopfield network. The lost performance can be regained using integer storage which allows the superposition of the pattern representation, or ensuring bits are not overwritten independently using concepts from errorcorrecting codes. The final task performs recall in continuous time using components which are more similar to neurons than used in the rest of the dissertation. The resulting memory has the exciting ability to recall many patterns simultaneously. Statistical inference ensures gradual degradation of the performance as an associative memory is overloaded. Since many definitions of associative memory capacity rely on the existence of catastrophic failure a new definition of capacity is provided. In spite of some biologically unrealistic attributes, this work is relevant to the understanding of the brain as it provides high performance solutions to the associative memory task which is known to be relevant to the brain.
13

Non-associative algebras and their automorphism groups /

Wajima, Masayuki, January 1984 (has links)
No description available.
14

L’anaphore associative méronymique et l’ellipse grammaticale / Associative meronymic anaphora and grammatical ellipsis

Abdelhamid Zellama, Sana 12 July 2017 (has links)
Notre étude est centrée sur les mécanismes elliptiques au sein des anaphores associativesméronymiques. Nous sommes partie de l’hypothèse que dans ce type d’anaphore, il existe deuxstructures : une structure profonde et une structure de surface. La première consiste en la présence destrois éléments : le tout, le prédicat partitif et la partie. La deuxième, où apparaissent les différents typesd’ellipse, fait l’objet de notre travail.Nous nous sommes attardée sur trois types d’ellipse que nous considérons caractéristiques desanaphores méronymiques : l’ellipse du prédicat partitif, celle du deuxième élément de la structure N DeN et celle de l’antécédent anaphorique. Traitées séparément, les anaphores nominales, les anaphoresverbales et les anaphores adverbiales ont été soumises dans un premier temps à une descriptionsyntactico-sémantique et dans un deuxième temps à la théorie des trois fonctions primaires. Cettethéorie nous a permis d’expliquer la possibilité pour certains éléments, d’être élidés au sein del’anaphore associative méronymique. / Our study focuses on elliptic mechanisms within associative meronymic anaphora. We departed fromthe assumption that in this type of anaphora, there are two structures: a deep structure and a surfacestructure. The first consists in the presence of three elements: the whole, the partitive predicate and thepart. The second, which shows the different types of ellipsis, is the topic of our work.We focused on three types of Ellipsis, which we considered typical meronymic anaphora: ellipsis ofpartitive predicate, ellipsis of the second element of the structure [N De N] and that of the anaphoricantecedent. Treated separately, nominal anaphora, verbal anaphora, and adverbial anaphora wereinitially submitted to a syntactic-semantic description, and then, to the three primary functions theory.This theory allowed us to explain the ability of certain items to be elided in the associative meronymicanaphora.
15

CRITERION LEARNING AND ASSOCIATIVE MEMORY GAINS: EVIDENCE AGAINST ASSOCIATIVE SYMMETRY

Vaughn, Kalif Elijah 19 July 2012 (has links)
No description available.
16

HOM-TENSOR CATEGORIES

Schrader, Paul T. 17 April 2018 (has links)
No description available.
17

Frame based knowledge representation in an ADAM architecture

Jackson, Thomas Oliver January 1995 (has links)
No description available.
18

An associative account of acquired equivalence

Ward-Robinson, Jasper January 1996 (has links)
No description available.
19

Mediated learning in the rat : implications for perceptual learning

Leonard, Sarah January 1998 (has links)
No description available.
20

The Functioning of Immediate Verbal Feedback in Paired Associative Learning with Normals and Retardates

Ferrara, Joseph William 08 1900 (has links)
The central purpose of this study is to ascertain the function of immediate verbal feedback after each response on learning a paired associative task with normal and retarded subjects.

Page generated in 0.0705 seconds