Digital Alphabet Research Articles

Pengaruh Media Typewriter Alphabet Digital Berbantuan Audio Visual untuk Meningkatkan Kemampuan Membaca Permulaan Siswa Sekolah Dasar

This research aims to determine the effect of using audio-visual assisted digital alphabet typewriter media to improve the initial reading ability of grade 1 students at SDN 23 Batara. The type of research used in this research is Pre-Experimental Design with a One-Group Pretest-Posttest Design research design. The population of this study was all grade 1 students at SDN 23 Batara. The sample consisted of 26 people. The collected data was processed using descriptive statistical analysis and inferential statistical analysis. Based on the results of descriptive analysis, the average value (pretest) was 66.85 and the average value (posttest) was 90. Meanwhile, based on the results of inferential statistical analysis, t-test results were obtained with a significant value (2 tailed) <0.05, namely < 0.000 means H0 is rejected and H1 is accepted. Thus, it can be concluded that there is a significant influence between the application of audio-visual assisted digital alphabet typewriter media on the beginning reading ability of grade 1 students at SDN 23 Batara.

Digital alphabet – a challenge for the modern student and teacher

The fruits of the digital age have become a key part of everyday life in hundreds of millions of households, offices and schools around the world. Our communication takes place far more via text messages and e-mail than face-to-face, and the first place we look for information is Google. The consequences of this technological ubiquity and electronic flood are significant shifts in the attitudes as well as in the behavior of students and teachers, and the goal of this paper is to examine these shifts. How is the digital age changing the opportunities, values and lives of students and teachers - what is happening now, what awaits us in the future? Can digital achievement really change the way students and teachers think or behave? Do both students and teachers learn a new alphabet - the digital alphabet?

Periodic representations in Salem bases

We prove that all algebraic bases β allow an eventually periodic representation of the elements of ℚ(β) with a finite alphabet of digits $${\cal A}$$ . Moreover, the classification of bases allowing that those representations have the socalled weak greedy property is given. The decision problem whether a given pair (β, $${\cal A}$$ ) allows eventually periodic representations proves to be rather hard, for it is equivalent to a topological property of the attractor of an iterated function system.

Two applications of the spectrum of numbers

Let the base $${\beta}$$ be a complex number, $${|\beta| > 1}$$ , and let $${A \subset \mathbb{C}}$$ be a finite alphabet of digits. The A-spectrum of $${\beta}$$ is the set $${{S}_{A}(\beta) = {\{\Sigma^{n}_{k=0} {a}_{k}\beta^{k} | n\in \mathbb{N}, {a}_{k} \in A\}}}$$ . We show that the spectrum $${{S}_{A}(\beta)}$$ has an accumulation point if and only if 0 has a particular $${(\beta, A)}$$ -representation, said to be rigid. The first application is restricted to the case that $${\beta > 1}$$ and the alphabet is A = {−M, . . . , M}, $${{M \geq}}$$ 1 integer. We show that the set $${{Z}_{\beta, M}}$$ of infinite $${(\beta, A)}$$ -representations of 0 is recognizable by a finite Buchi automaton if and only if the spectrum $${{S}_{A}(\beta)}$$ has no accumulation point. Using a result of Akiyama–Komornik and Feng, this implies that $${{Z}_{\beta, M}}$$ is recognizable by a finite Buchi automaton for any positive integer $${M \geq\lceil {\beta\rceil-1}}$$ if and only if $${{\beta}}$$ is a Pisot number. This improves the previous bound $${M \geq \lceil \beta\rceil}$$ . For the second application the base and the digits are complex. We consider the on-line algorithm for division of Trivedi and Ercegovac generalized to a complex numeration system. In on-line arithmetic the operands and results are processed in a digit serial manner, starting with the most significant digit. The divisor must be far from 0, which means that no prefix of the $${(\beta,A)}$$ -representation of the divisor can be small. The numeration system $${(\beta,A)}$$ is said to allow preprocessing if there exists a finite list of transformations on the divisor which achieve this task. We show that $${(\beta,A)}$$ allows preprocessing if and only if the spectrum $${{S}_{A}(\beta)}$$ has no accumulation point.

Quasi-periodic β-expansions and cut languages

Motivated by the analysis of neural net models between integer and rational weights, we introduce a so-called cut language over a real digit alphabet, which contains finite β-expansions (i.e. base-β representations) of the numbers less than a given threshold. We say that an infinite β-expansion is eventually quasi-periodic if its tail sequence formed by the numbers whose representations are obtained by removing leading digits, contains an infinite constant subsequence. We prove that a cut language is regular iff its threshold is a quasi-periodic number whose all β-expansions are eventually quasi-periodic, by showing that altogether they have a finite number of tail values. For algebraic bases β, we prove that there is an eventually quasi-periodic β-expansion with an infinite number of tail values iff there is a conjugate of β on the unit circle. For transcendental β combined with algebraic digits, a β-expansion is eventually quasi-periodic iff it has a finite number of tail values. For a Pisot base β and digits from the smallest field extension Q(β) over rational numbers including β, we show that any number from Q(β) is quasi-periodic. In addition, we achieve a dichotomy that a cut language is either regular or non-context-free and we show that any cut language with rational parameters is context-sensitive.

"Exotic" binary number systems for rings of Gauss and Eisenstein integers

The paper considers nonstandard binary number systems for rings of Gauss and Eisenstein integers. The principal difference ("exoticism") of such number systems from the canonical number systems introduced by I. Katai for quadratic fields is that as a binary "digital alphabet", it uses a two-element set that does not contain a numeric zero. The paper also synthesizes algorithms for the representation of numbers in the considered number system and characterizes the possibility of an efficient implementation of arithmetic operations.

Trees and languages with periodic signature

The signature of a labelled tree (and hence of its prefix-closed branch language) is the sequence of the degrees of the nodes of the tree in the breadth-first traversal . In a previous work, we have characterised the signatures of the regular languages. Here, the trees and languages that have the simplest possible signatures, namely the periodic ones, are characterised as the sets of representations of the integers in rational base numeration systems. For any pair of co-prime integers p and q , p > q > 1 , the language L p q of representations of the integers in base p q looks chaotic and does not fit in the classical Chomsky hierarchy of formal languages. On the other hand, the most basic example given by L 3 2 , the set of representations in base 3 2 , exhibits a remarkable regularity: its signature is the infinite periodic sequence: 2 , 1 , 2 , 1 , 2 , 1 , … We first show that L p q has a periodic signature and the period (a sequence of q integers whose sum is p ) is directly derived from the Christoffel word of slope p q . Conversely, we give a canonical way to label a tree generated by any periodic signature; its branch language then proves to be the set of representations of the integers in a rational base (determined by the period) and written with a non-canonical alphabet of digits. This language is very much of the same kind as a L p q since rational base numeration systems have the key property that, even though L p q is not regular, normalisation is realised by a finite letter-to-letter transducer.

O Teste da Simulação do Falar em Público não gera ansiedade em adolescentes surdos ou ouvintes

O presente trabalho pretendeu comparar a ansiedade relatada através da Escala Analógica de Humor (EAH) no Teste da Simulação do Falar em Público em adolescentes surdos e ouvintes. Participaram do experimento quinze surdos que dominam o alfabeto digital e a Língua Brasileira de Sinais (LIBRAS) (grupo experimental) e quinze ouvintes (grupo controle) com idades entre 11 a 18 anos, pareados em relação a variáveis sócio-econômicas e sexo. Ambos os grupos foram submetidos individualmente ao teste da simulação do falar em público, no qual a escala analógica de humor foi aplicada nas fases de adaptação, pré-discurso, durante o discurso e pós-discurso. Os resultados obtidos em ambos os grupos indicam que para a população de adolescentes o teste não gerou a ansiedade tipicamente relatada em adultos e não houve diferença estatística significativa entre os grupos segundo tipo de linguagem usada.

Greedy expansions and sets with deleted digits

We generalize a result of Daróczy and Kátai, on the characterization of univoque numbers with respect to a non-integer base (Publ. Math. Debrecen 46(3–4) (1995) 385) by relaxing the digit alphabet to a generic set of real numbers. We apply the result to derive the construction of a Büchi automaton accepting all and only the greedy sequences for a given base and digit set. In the appendix, we prove a more general version of the fact that the expansion of an element x ∈ Q ( q ) is ultimately periodic, if q is a Pisot number.

Constructive genetic algorithm for clustering problems.

Genetic algorithms (GAs) have recently been accepted as powerful approaches to solving optimization problems. It is also well-accepted that building block construction (schemata formation and conservation) has a positive influence on GA behavior. Schemata are usually indirectly evaluated through a derived structure. We introduce a new approach called the Constructive Genetic Algorithm (CGA), which allows for schemata evaluation and the provision of other new features to the GA. Problems are modeled as bi-objective optimization problems that consider the evaluation of two fitness functions. This double fitness process, called fg-fitness, evaluates schemata and structures in a common basis. Evolution is conducted considering an adaptive rejection threshold that contemplates both objectives and attributes a rank to each individual in population. The population is dynamic in size and composed of schemata and structures. Recombination preserves good schemata, and mutation is applied to structures to get population diversification. The CGA is applied to two clustering problems in graphs. Representation of schemata and structures use a binary digit alphabet and are based on assignment (greedy) heuristics that provide a clearly distinguished representation for the problems. The clustering problems studied are the classical p-median and the capacitated p-median. Good results are shown for problem instances taken from the literature.