Bibliographies thématiques / Alphabet arithmetic

Sommaire

  1. Articles de revues
  2. Thèses
  3. Livres
  4. Chapitres de livres
  5. Actes de conférences

Littérature scientifique sur le sujet « Alphabet arithmetic »

Auteur : Grafiati
Publié le 5 avril 2025

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Alphabet arithmetic ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Alphabet arithmetic"

1

Campbell, Jamie I. D., Yalin Chen, Kurtis Allen, and Leah Beech. "Transfer of training in alphabet arithmetic." Memory & Cognition 44, no. 8 (2016): 1288–300. http://dx.doi.org/10.3758/s13421-016-0631-x.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Perl, Y., and L. Gabriel. "Arithmetic interpolation search for alphabet tables." IEEE Transactions on Computers 41, no. 4 (1992): 493–99. http://dx.doi.org/10.1109/12.135562.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Fias, Wim, Muhammet Ikbal Sahan, Daniel Ansari, and Ian M. Lyons. "From Counting to Retrieving: Neural Networks Underlying Alphabet Arithmetic Learning." Journal of Cognitive Neuroscience 34, no. 1 (2021): 16–33. http://dx.doi.org/10.1162/jocn_a_01789.

Texte intégral
Résumé :
Abstract This fMRI study aimed at unraveling the neural basis of learning alphabet arithmetic facts, as a proxy of the transition from slow and effortful procedural counting-based processing to fast and effortless processing as it occurs in learning addition arithmetic facts. Neural changes were tracked while participants solved alphabet arithmetic problems in a verification task (e.g., F + 4 = J). Problems were repeated across four learning blocks. Two neural networks with opposed learning-related changes were identified. Activity in a network consisting of basal ganglia and parieto-frontal a
Styles APA, Harvard, Vancouver, ISO, etc.
4

Biasizzo, Anton, Franc Novak, and Peter Korošec. "A Multi–Alphabet Arithmetic Coding Hardware Implementation for Small FPGA Devices." Journal of Electrical Engineering 64, no. 1 (2013): 44–49. http://dx.doi.org/10.2478/jee-2013-0006.

Texte intégral
Résumé :
Arithmetic coding is a lossless compression algorithm with variable-length source coding. It is more flexible and efficient than the well-known Huffman coding. In this paper we present a non-adaptive FPGA implementation of a multi-alphabet arithmetic coding with separated statistical model of the data source. The alphabet of the data source is a 256-symbol ASCII character set and does not include the special end-of-file symbol. No context switching is used in the proposed design which gives maximal throughput without pipelining. We have synthesized the design for Xilinx FPGA devices and used t
Styles APA, Harvard, Vancouver, ISO, etc.
5

Mahapatra, Sudipta, and Kuldeep Singh. "An FPGA-Based Implementation of Multi-Alphabet Arithmetic Coding." IEEE Transactions on Circuits and Systems I: Regular Papers 54, no. 8 (2007): 1678–86. http://dx.doi.org/10.1109/tcsi.2007.902527.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Delaygue, É. "Arithmetic properties of Apéry-like numbers." Compositio Mathematica 154, no. 2 (2017): 249–74. http://dx.doi.org/10.1112/s0010437x17007552.

Texte intégral
Résumé :
We provide lower bounds for$p$-adic valuations of multisums of factorial ratios which satisfy an Apéry-like recurrence relation: these include Apéry, Domb and Franel numbers, the numbers of abelian squares over a finite alphabet, and constant terms of powers of certain Laurent polynomials. In particular, we prove Beukers’ conjectures on the$p$-adic valuation of Apéry numbers. Furthermore, we give an effective criterion for a sequence of factorial ratios to satisfy the$p$-Lucas property for almost all primes$p$.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Müller, Burkhard, and Jürgen Gehrke. "Acquisition and Use of Mental Operators: The Influence of Natural Order of Events." Experimental Psychology 51, no. 1 (2004): 33–44. http://dx.doi.org/10.1027/1618-3169.51.1.33.

Texte intégral
Résumé :
Abstract. The present article reports two experiments investigating the influence of natural order of events on the acquisition and use of knowledge about operations, in short mental operators. The principle of use specificity states that task performance depends directly on the similarity between acquisition context and the present situation. In contrast, the principle of natural order proposes that knowledge about operations can always be applied easier (faster) if reasoning follows the natural order of events. In Experiment 1, participants had to apply alphabet-arithmetic operators and LISP
Styles APA, Harvard, Vancouver, ISO, etc.
8

Natarajan, S., N. Ramadass, and Ramana Y. V. Rao. "State-based dynamic multi-alphabet arithmetic coding for image compression." Imaging Science Journal 57, no. 1 (2009): 30–36. http://dx.doi.org/10.1179/174313109x373648.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Chen, Yalin, Alicia Orr, and Jamie I. D. Campbell. "What is learned in procedural learning? The case of alphabet arithmetic." Journal of Experimental Psychology: Learning, Memory, and Cognition 46, no. 6 (2020): 1165–77. http://dx.doi.org/10.1037/xlm0000775.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Logan, Gordon D., and Stuart T. Klapp. "Automatizing alphabet arithmetic: I. Is extended practice necessary to produce automaticity?" Journal of Experimental Psychology: Learning, Memory, and Cognition 17, no. 2 (1991): 179–95. http://dx.doi.org/10.1037/0278-7393.17.2.179.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Thèses sur le sujet "Alphabet arithmetic"

1

Strickland, Monica Kathleen. "The Effects of Self-evaluation and Response Restriction on Letter and Number Reversal in Young Children." Thesis, University of North Texas, 2004. https://digital.library.unt.edu/ark:/67531/metadc4542/.

Texte intégral
Résumé :
The purpose of this study was to evaluate the effects of a training package consisting of response restriction and the reinforcement of self-evaluation on letter reversal errors. Participants were 3 typically developing boys between the age of 5 and 7. The results indicated that the training package was successful in correcting reversals in the absence of a model during training and on application tests. These improvements maintained during subsequent follow-up sessions and generalized across trainers. Fading was not always necessary in correcting reversals, but was effective in correcting rev
Styles APA, Harvard, Vancouver, ISO, etc.
2

Rousset, Chouteau Stéphanie. "Apprentissage de l'addition : comptage ou récupération en mémoire ? Approches expérimentale et computationnelle." Electronic Thesis or Diss., Université Grenoble Alpes, 2024. http://www.theses.fr/2024GRALS027.

Texte intégral
Résumé :
L'addition, l'une des opérations fondamentales de l'arithmétique, constitue une des premières opérations enseignées aux enfants. Parmi les diverses formes d’additions, celles impliquant deux opérandes à un chiffre, comme 5+3, sont omniprésentes dans la vie quotidienne et requièrent souvent des calculs mentaux rapides. A ce jour, les mécanismes cognitifs sous-jacents à la résolution de ces opérations restent mal compris. Deux grands modèles théoriques s’opposent. Les théories associationnistes (Ashcraft, 1982; Campbell & Graham, 1985; Logan, 1988; Siegler & Shrager, 1984) postulent que
Styles APA, Harvard, Vancouver, ISO, etc.
3

Peng, Jen-Chun, and 彭仁俊. "Implementation of Adaptive Multi-alphabet Arithmetic Decoder." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/60501285706085764930.

Texte intégral
Résumé :
碩士<br>國立交通大學<br>電機與控制工程系<br>89<br>Data compression played an important role in the data transmission and data storage. Arithmetic coding is an efficient loseless data compression technique and has been proposed in industrial standards. Traditionally, arithmetic coding applies certain specification for different types of data and results in average performance. To obtain the near-optimal performance, this thesis proposes a parameterized solution for adaptive arithmetic coding with a finite weighted history buffer. The thesis develops six probability models by tuning the size of history buffe
Styles APA, Harvard, Vancouver, ISO, etc.

Livres sur le sujet "Alphabet arithmetic"

1

Fleming, Denise. Shout! Shout it out! Henry Holt, 2011.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Īraj, Afshār, та Markaz-i Dāʼirat al-Maʻārif-i Buzurg-i Islāmī (Iran), ред. Shams al-ḥisāb al-Fakhrī. Markaz-i Dāʼirat-al-Maʻārif-i Buzurg-i Islāmī, 2008.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Manuel de Andrade de Figueiredo. Nova escola: Para aprender a ler, escrever e contar. Ministério da Cultura, Fundação Biblioteca Nacional, 2010.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Juster, Norton. The Phantom Tollbooth. Collins, 1999.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Juster, Norton. The annotated Phantom tollbooth. Alfred A. Knopf, 2011.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Juster, Norton. The Phantom Tollbooth. 3rd ed. Random House, 1996.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Juster, Norton. The phantom tollbooth. 5th ed. Alfred A. Knopf, 2011.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Juster, Norton. The Phantom Tollbooth. Bullseye Books/Alfred A. Knopf, 1989.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Juster, Norton. The Phantom Tollbooth. Lions, 1992.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Juster, Norton. The Phantom Tollbooth. 5th ed. Alfred A. Knopf, 1996.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Chapitres de livres sur le sujet "Alphabet arithmetic"

1

Jeż, Artur, Anthony W. Lin, Oliver Markgraf, and Philipp Rümmer. "Decision Procedures for Sequence Theories." In Computer Aided Verification. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37703-7_2.

Texte intégral
Résumé :
AbstractSequence theories are an extension of theories of strings with an infinite alphabet of letters, together with a corresponding alphabet theory (e.g. linear integer arithmetic). Sequences are natural abstractions of extendable arrays, which permit a wealth of operations including append, map, split, and concatenation. In spite of the growing amount of tool support for theories of sequences by leading SMT-solvers, little is known about the decidability of sequence theories, which is in stark contrast to the state of the theories of strings. We show that the decidable theory of strings with concatenation and regular constraints can be extended to the world of sequences over an alphabet theory that forms a Boolean algebra, while preserving decidability. In particular, decidability holds when regular constraints are interpreted as parametric automata (which extend both symbolic automata and variable automata), but fails when interpreted as register automata (even over the alphabet theory of equality). When length constraints are added, the problem is Turing-equivalent to word equations with length (and regular) constraints. Similar investigations are conducted in the presence of symbolic transducers, which naturally model sequence functions like map, split, filter, etc. We have developed a new sequence solver, SeCo, based on parametric automata, and show its efficacy on two classes of benchmarks: (i) invariant checking on array-manipulating programs and parameterized systems, and (ii) benchmarks on symbolic register automata.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Starchak, Mikhail R. "On the Existential Arithmetics with Addition and Bitwise Minimum." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30829-1_9.

Texte intégral
Résumé :
AbstractThis paper presents a similar approach for existential first-order characterizations of the languages recognizable by finite automata, by Parikh automata, and by multi-counter machines over the alphabet $$\left\{ 0,1,...,k-1\right\} ^{n}$$ 0 , 1 , . . . , k - 1 n for some $$k\ge 2$$ k ≥ 2 . The set of k-FA-recognizable relations coincides with the set of relations, which are existentially definable in the structure "Image missing" , where "Image missing" corresponds to the bitwise minimum of base k. In order to obtain an existential first-order description of k-Parikh automata languages, we extend this structure with the predicate $$ EqNZB _{k}(x,y)$$ E q N Z B k ( x , y ) which is true if and only if x and y have the same number of non-zero bits in k-ary encoding. Using essentially the same ideas, we encode computations of k-multi-counter machines and thus show that every recursively enumerable relation over the natural numbers is existentially definable in the aforementioned structure supplemented with concatenation $$z=x\smallfrown _{k} y\rightleftharpoons z = x + k^{l_{k}(x)}y$$ z = x ⌢ k y ⇌ z = x + k l k ( x ) y , where $$l_{k}(x)$$ l k ( x ) is the bit-length of x in base k. This result gives us another proof of DPR-theorem.
Styles APA, Harvard, Vancouver, ISO, etc.
3

Smullyan, Raymond M. "Tarski’s Theorem for Arithmetic." In Gödel's Incompleteness Theorems. Oxford University Press, 1992. http://dx.doi.org/10.1093/oso/9780195046724.003.0005.

Texte intégral
Résumé :
In the last chapter, we dealt with mathematical languages in considerable generality. We shall now turn to some particular mathematical languages. One of our goals is to reach Gödel’s incompleteness theorem for the particular system known as Peano Arithmetic. We shall give several proofs of this important result; the simplest one is based partly on Tarski’s theorem, to which we first turn. The first concrete language that we will study is the language of first order arithmetic based on addition, multiplication and exponentiation. [We also take as primitive the successor function and the less than or equal to relation, but these are inessential.] We shall formulate the language using only a finite alphabet (mainly for purposes of a convenient Gödel numbering); specifically we use the following 13 symbols. . . . 0’ ( ) f, υ ∽ ⊃ ∀ = ≤ # . . . The expressions 0, 0′, 0″, 0‴, · · · are called numerals and will serve as formal names of the respective natural numbers 0, 1, 2, 3, · · ·. The accent symbol (also called the prime) is serving as a name of the successor function. We also need names for the operations of addition, multiplication and exponentiation; we use the expressions f′, f″, f‴ as respective names of these three functions. We abbreviate f′ by the familiar “+”; we abbreviate f’’ by the familiar dot and f‴ by the symbol “E”. The symbols ~ and ⊃ are the familiar symbols from prepositional logic, standing for negation and material implication, respectively. [For any reader not familiar with the use of the horseshoe symbol, for any propositions p and q, the propositions p ⊃ q is intended to mean nothing more nor less than that either p is false, or p and q are both true.] The symbol ∀ is the universal quantifier and means “for all.” We will be quantifying only over natural numbers not over sets or relations on the natural numbers. [Technically, we are working in first-order arithmetic, not second-order arithmetic.] The symbol “=” is used, as usual, to denote the identity relation, and “≤” is used, as usual, to denote the “less than or equal to” relation.
Styles APA, Harvard, Vancouver, ISO, etc.
4

Tarski, Alfred. "On the Theory of Classes." In Introduction to Logic and to the Methodology of the Deductive Sciences. Oxford University PressNew York, NY, 1994. http://dx.doi.org/10.1093/oso/9780195044720.003.0004.

Texte intégral
Résumé :
Abstract Apart from separate individual objects, which we shall also call INDIVIDUALS for short, logic is concerned with CLASSES of objects; in everyday life as well as in mathematics, classes are more often referred to as SETS. Arithmetic, for instance, frequently deals with sets of numbers, and in geometry our interest lies not so much in single points as in sets of points (that is, in geometrical configurations). Now, classes of individuals are called CLASSES OF THE FIRST ORDER. Relatively more rarely in our investigations we come upon CLASSES OF THE SECOND ORDER, that is, upon classes which consist, not of individuals, but of classes of the first order. Sometimes even CLASSES OF THE THIRD, FOURTH, and HIGHER ORDERS have to be dealt with. Here we shall be concerned almost exclusively with classes of the first order, and only exceptionally-as in Section 26-we shall have to deal with classes of the second order; however, our considerations can be applied with practically no changes to classes of any order. In order to distinguish between individuals and classes (and also among classes of different orders), we employ as variables letters of different shape and belonging to different alphabets. It is customary to designate individual objects such as numbers, and classes of such objects, by lower-case and capital letters of the Latin alphabet, respectively. In elementary geometry the opposite notation is the accepted one, capital letters designating points and lower-case letters (of the Latin or the Greek alphabet) designating sets of points.
Styles APA, Harvard, Vancouver, ISO, etc.
5

Mazur, Joseph. "Symbol Infancy." In Enlightening Symbols. Princeton University Press, 2016. http://dx.doi.org/10.23943/princeton/9780691173375.003.0012.

Texte intégral
Résumé :
This chapter discusses the evolution of symbolic algebra that began in the first half of the sixteenth century. Algebra was not always called algebra. In the mid-fifteenth century some Italian and Latin writers called it Regula rei e census. The twentieth-century mathematician and science fiction author Eric Temple Bell allegedly remarked that in the mid-seventeenth century, mathematicians were able to introduce negative and rational exponents because symbolic manipulation liberated their thinking from the wilderness of words. The chapter considers the contributions of the Arab algebraist al-Qalasādi, who used letters of the Arabic alphabet to denote arithmetic operations and whose notation was clearly an attempt at symbolizing algebra through abbreviations, a first approximation to what we would consider true symbols. It also examines how Italy cultivated the seeds of algebra, citing in particular Gerolamo Cardano's Ars Magna.
Styles APA, Harvard, Vancouver, ISO, etc.
6

Chandio, Asghar Ali, Zahid Hussain, Muhammad Saleem Vighio, and Mehwish Leghari. "Interactive Learning System for Primary Schools using Tablet PC." In Advances in Civil and Industrial Engineering. IGI Global, 2016. http://dx.doi.org/10.4018/978-1-4666-8803-2.ch020.

Texte intégral
Résumé :
The rapid development in technology has facilitated human beings in many ways such as automated home appliances, smart vehicles, smart mobile phones, and tablet computers. The uses of these tools and techniques are increasing in our daily lives to facilitate day to day work. The new trends in technology have focused on finding approaches towards improved learning techniques. Various tools are being used to integrate Information and Communication Technology in education. Tablet Personal Computers (PCs) are one of the new and innovative tools used in education for enhancing learning skills. This research has been conducted in five primary schools, where students of class nursery to class three were taught basic lessons using Tablet PC. In this research an application has been developed on android platform with easy to use interface, where the students were able to perform simple arithmetic calculations and learned alphabet of Sindhi and English languages in visual form. During the experiment, it was observed that with visual aids students understood lessons more clearly and easily.
Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Alphabet arithmetic"

1

Apparaju, Rakesh, and Suneeta Agarwal. "An Arithmetic Coding Scheme by Converting the Multisymbol Alphabet to M-ary Alphabet." In International Conference on Computational Intelligence and Multimedia Applications (ICCIMA 2007). IEEE, 2007. http://dx.doi.org/10.1109/iccima.2007.317.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Guo, Muling, Takahumi Oka, Shigeo Kato, Hiroshi Kajiwara, and Naoto Kawamura. "Encoding of multi-alphabet sources by binary arithmetic coding." In Electronic Imaging '99, edited by Kiyoharu Aizawa, Robert L. Stevenson, and Ya-Qin Zhang. SPIE, 1998. http://dx.doi.org/10.1117/12.334610.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Gomes, Jiovana Sousa, and Fabio Luis Livi Ramos. "High-Performance Design for the AV1 Multi - Alphabet Arithmetic Decoder." In 2021 34th SBC/SBMicro/IEEE/ACM Symposium on Integrated Circuits and Systems Design (SBCCI). IEEE, 2021. http://dx.doi.org/10.1109/sbcci53441.2021.9529970.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Borodzhieva, Adriana. "MS EXCEL-BASED APPLICATION FOR ENCRYPTION AND DECRYPTION USING THE HILL CIPHER ON THE BASIS OF 2X2-MATRIX AND 64-SYMBOL ALPHABET." In eLSE 2017. Carol I National Defence University Publishing House, 2017. http://dx.doi.org/10.12753/2066-026x-17-049.

Texte intégral
Résumé :
In classical cryptography, the Hill cipher, invented by Lester Hill in 1929, was the first polygraphic substitution cipher based on linear algebra, which practically processed more than three symbols at once. In the classical Hill cipher, each letter is represented by a number modulo 26. To encrypt a message, each block of n letters (considered as an n-component vector) is multiplied by an invertible matrix of size n×n, again modulus 26. In order to decrypt the message, each block is multiplied by the inverse matrix of the matrix used for encryption. In the paper a modified algorithm for encry
Styles APA, Harvard, Vancouver, ISO, etc.
5

Ahmed, F., A. A. S. Awwal, and P. Chen. "Experiment with the storage capacity and shift invariance of trinary associative memory for character recognition." In OSA Annual Meeting. Optica Publishing Group, 1991. http://dx.doi.org/10.1364/oam.1991.thx6.

Texte intégral
Résumé :
Character recognition by a trinary associative memory (TAM) neural network model is proposed. All the twenty-six letters of the English alphabet are stored in the trinary memory. The proposed scheme will then be able to recognize a character from its partial input. The dot product of the partial input with all the stored patterns is calculated as a measure of discrepancy from the desired pattern. Zero thresholding and arithmetic mean thresholding and some other statistical thresholding methods are then applied to select the desired output. The convergence of the recall procedure of the TAM net
Styles APA, Harvard, Vancouver, ISO, etc.
6

Sharma, Saurabh, Sonali Aatrai, and Rajlakshmi Guha. "Impact of Anxiety on Eye Markers: Role of Visual Task Complexity." In 15th International Conference on Applied Human Factors and Ergonomics (AHFE 2024). AHFE International, 2024. http://dx.doi.org/10.54941/ahfe1004746.

Texte intégral
Résumé :
Anxiety and visual task difficulty may interact, impose cognitive demands, and affect task performance. Researchers have found that when comparing task performance across people with different levels of anxiety vulnerability, people with somewhat elevated anxiety vulnerability perform worse than people with lower anxiety susceptibility. Furthermore, vulnerability to anxiety is associated with a decreased ability to control the allocation of attention that is reflected while performing tasks. We aim to see the role of visual task complexity as potential mediators in the relation between differe
Styles APA, Harvard, Vancouver, ISO, etc.
7

Xiaohui Xue and Wen Gao. "High performance arithmetic coding for small alphabets." In Proceedings DCC '97. Data Compression Conference. IEEE, 1997. http://dx.doi.org/10.1109/dcc.1997.582149.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie