Alphabetic Code Research Articles

Memahami Kode Phonetic Alphabet Pada Komunikasi Radio Marine

<p><em>This study purpose to understand and describe in detail and in-dept understanding of the meaning and the use of phonetic alphabet in radio marine communication. Theory used in this study is syimbolic interaksionisme that states when a movement in sociology focused to way people shape the meaning and structure of the community through conversations. The research method used is descriptive qualitative with interpretive perspective. </em><em></em></p><p><em>This research was conducted PT. Pelabuhan Indonesia Scouting III Tanjung Emas Semarang with three (3) sample person as radio marine operator.In concluded for this study has answered phonetic alphabet code is a symbol that used to interaction tool for equalized and straighten meaning when there is misunderstanding in the delivery and reception of informationbetween both radio operator in radio marine communication especially PT. Pelabuhan Indonesia III Tanjung Emas Semarang to understand the meaning from the contents of the message to be effective communication.</em><em></em></p>

Codes Correcting Limited Patterns of Random Errors Using S-K Metric

Abstract Coding is essential in all communications and in all multi-operation devices, and errors do occur. For error control, the method in vogue is to use code words with redundant digits. The number of redundant digits is determined based on two things − the number of messages and the kind of errors that need to be controlled. For efficient coding the redundant digits have to be kept to the minimum. In this paper we introduce the idea of limited error patters while using the code alphabet {0,1, 2,..., 1},mod , q Z = q − q when q > 3. We define limitations of the errors in a position by substitution of the character there by a specified number of other characters, rather than by any other character. This is not possible through Hamming approach, because there a character in an error could be substituted by any other of the q-1 characters. The firm mathematical base is provided by use of a metric from the class of S-K metrics, Hamming metric being one of these. The paper gives upper bounds on the codeword lengths for various kinds of “random limited error patterns”. Examples and discussion bring out the tremendous improvement and generalization of Rao Hamming bound.

Fractional-Order Fourier Analysis of the DNA

This paper studies the deoxyribonucleic acid (DNA) code in the perspective of system dynamics and Fractional Calculus (FC). DNA includes the history of evolution towards the particular species and the instructions for the growth of each individual during its lifetime. In this study are associated logical and mathematical concepts namely, alphabet coding, Fourier transform and FC for the analysis of the DNA data of different chromosomes. The results reveal important characteristics motivating further research with the formalisms of system dynamics.

DC‐free codes with complex‐valued signalling constellations

The use of spectral shaping constrained codes is commonplace in baseband digital communication systems. In this study, the authors consider the use of constrained codes in bandpass systems through the design of DC-free codes for the complex baseband representations of commonly used signalling constellations including quaternary phase shift keying, eight-phase shift keying and sixteen quadrature amplitude modulation. The authors construct DC-free codes for these signalling alphabets and present their spectral performance. They show that, similar to DC-free codes for baseband systems, the variance of the running digital sum remains a good indicator of spectral performance and that Justesen's relationship between the sum variance and cut-off frequency holds.

An erasure-resilient encoding system for flexible reading and writing in storage networks

We introduce the Read-Write-Coding-System (RWC), a very flexible class of linear block codes that generate efficient and flexible erasure codes for storage networks. In particular, given a message x of k symbols and a codeword y of n symbols, an RW code defines additional parameters k≤ r,w≤ n that offer enhanced possibilities to adjust the fault-tolerance capability of the code. More precisely, an RWC provides linear (n,r,d) -codes that have: (a) minimum (Hamming) distance d = n-r+1 for any two codewords, and (b) for any codeword y 1 there exists a codeword y 2 with distance of at most w . Furthermore, depending on the values r,w and the code alphabet, different block codes such as parity codes (e.g., RAID 4/5) or Reed-Solomon (RS) codes (if r = k and thus, w = n ) can be generated. In storage networks in which I/O accesses are very costly and redundancy is crucial, this flexibility has considerable advantages as r and w can optimally be adapted to read or write intensive applications; only w symbols must be updated if the message x changes completely, which is different from other codes that always need to rewrite y completely as x changes. In this article, we first state a tight lower bound and basic conditions for all RW codes. Furthermore, we introduce special RW codes in which all mentioned parameters are adjustable even online, that is, RW codes which are adaptive to changing demands. At last, we investigate the question for which choices of (k,r,w,n) a coding system exists over the binary alphabet F 2 = {0,1} and discuss how RW codes can be combined.

An alphabetic code based atomic level molecular similarity search in databases.

Atomic level molecular similarity and diversity studies have gained considerable importance through their wide application in Bioinformatics and Chemo-informatics for drug design. The availability of large volumes of data on chemical compounds requires new methodologies for efficient and effective searching of its archives in less time with optimal computational power. We describe an alphabetic algorithm for similarity searching based on atom-atom bonding preference for ligands. We represented 170 cyclindependent kinase 2 inhibitors using strings of pre-defined alphabets for searching using known protein sequence alignment tools. Thus, a common pattern was extracted using this set of compounds for database searching to retrieve similar active compounds. Area under the receiver operating characteristic (ROC) curve was used for the discrimination of similar and dissimilar compounds in the databases. An average retrieval rate of about 60% is obtained in cross-validation using the home-grown dataset and the directory of useful decoys (DUD, formally known as the ZINC database) data. This will help in the effective retrieval of similar compounds using database search.

Secure Network Coding for Wiretap Networks of Type II

We consider the problem of securing a multicast network against a wiretapper that can eavesdrop on the packets on a limited number of network edges of its choice. We assume that the network employs network coding to simultaneously deliver the packets available at the source to all the destinations. We show that this problem can be looked at as a network generalization of the wiretap channel of type II introduced in a seminal paper by Ozarow and Wyner. In particular, we show that the transmitted information can be secured by using the Ozarow-Wyner approach of coset coding at the source on top of the existing network code. This way, we quickly and transparently recover some of the results available in the literature on secure network coding for wiretap networks. Moreover, we use this framework to derive new bounds on the code alphabet size that are independent of the network size, and provide algorithms for explicit construction of secure network codes. We also analyze the amount of information that can be leaked to the wiretapper as a function of the number of wiretapped edges.

Cryptology and Communication Security

Cryptology is the scientific study and practice of making (cryptography) and breaking (cryptanalysis) of codes andciphers. Code is a system of rephrasing parts of normal language meaningful with certain standard groups or symbols. Whereas cipher is a system of transforming fixed length group of language symbols at normally the single character of alphabet into code alphabet character. The science of making communications unintelligible to all except the intended recipient(s) is known as cryptography. Until recently cryptography has been of interest primarily to the defence and diplomatic personnel of governments, guarded over and directed by their national crypto logic services. But now a day’s It has become the part of our daily life viz. providing electronic security to our house and offices, use of ATM, Credit Card, Smart Cards and RFID tags, etc. all of them needs cryptography in some form. Private business sectors, terrorist outfit and electronic communication agencies are using cryptographic methods to keep their data, valuable information and their developmental activities secret until they feel that it is important for their commercial interest, etc. Many cryptographic devices and algorithms are available for non-governmental application, such as M209, Hagelin machine, DES, AES, Public key cryptography (RSA system), and also varieties of crypto algorithms are available in the open literatures for any interested agency to implement their own system of encryptions.Defence Science Journal, 2012, 62(1), pp.3-5, DOI:http://dx.doi.org/10.14429/dsj.62.1434

Fractional-Order Fourier Analysis of Human DNA

AbstractThis paper studies the deoxyribonucleic acid (DNA) code in the perspective of system dynamics and Fractional Calculus (FC). DNA includes the history of evolution towards the particular species and the instructions for the growth of each individual during its lifetime. In this study are associated logical and mathematical concepts namely, alphabet coding, Fourier transform and FC for the analysis of the DNA data of different chromosomes. The results reveal important characteristics motivating further research with the formalisms of system dynamics.

Desempenho de adultos não-letrados em avaliação das habilidades em consciência fonológica

OBJETIVO: verificar o desempenho das habilidades em consciência fonológica em adultos não-letrados e compará-lo com o de adultos letrados. MÉTODO: 31 adultos, ambos os sexos, divididos em não-letrados e letrados, submetidos à Prova de Consciência Fonológica. RESULTDOS: o desempenho dos adultos não-letrados foi insatisfatório e inferior ao dos letrados; os dois grupos apresentaram desempenho inferior em tarefas fonêmicas; em apenas dois subtestes não foi encontrada diferença estatisticamente significante entre os grupos. CONCLUSÃO: o desempenho inferior dos adultos não-letrados, especialmente nas tarefas fonêmicas, pode decorrer do fator escolaridade, pois não dominam o código alfabético.

Writing strengthens orthography and alphabetic-coding strengthens phonology in learning to read Chinese.

Learning to write words may strengthen orthographic representations and thus support word-specific recognition processes. This hypothesis applies especially to Chinese because its writing system encourages character-specific recognition that depends on accurate representation of orthographic form. We report 2 studies that test this hypothesis in adult learners of Chinese. In those studies, the researchers 1st compared the effects of an online writing tutor that included character handwriting with an instructional tutor that included reading only. The writing condition led to better performance on word recognition and on character-meaning links but not on the character-phonology link. In the 2nd experiment, we added an alphabetic (Pinyin) typing tutor to strengthen the phonology link and to control for manual motor activity during instruction. This experiment replicated the effects of writing on word recognition and character-meaning links, whereas alphabetic (Pinyin) typing supported only phonological representations and the character-phonology link. Theoretically, the studies suggest constituent-specific effects: writing on orthography and alphabetic coding on phonology. We suggest the mechanism for the writing effect is the refinement of visual-spatial information needed for character recognition and the addition of a sensory-motor memory that accompanies writing. The practical implication is that an integration of character handwriting and Pinyin typing promotes learning to read Chinese in a second language learning context.

The scale for the assessment and rating of ataxia correlates with dysarthria assessment in Friedreich's ataxia

Dysarthria is an acquired neurogenic sensorimotor speech symptom and an integral part within the clinical spectrum of ataxia syndromes. Ataxia measurements and disability scores generally focus on the assessment of motor functions. Since comprehensive investigations of dysarthria in ataxias are sparse, we assessed dysarthria in ataxia patients using the Frenchay Dysarthria Assessment. The Frenchay Dysarthria Assessment is a ten-item validated test in which eight items focus on the observation of oral structures and speech functions. Fifteen Friedreich's ataxia patients and 15 healthy control individuals were analyzed using clinical and logopedic methodology. All patients underwent neurological assessment applying the Scale for the Assessment and Rating of Ataxia. In Friedreich's ataxia patients, the Frenchay sub-item voice showed to be most affected compared to healthy individuals followed by items such as reflexes, palate, tongue, and intelligibility. Scoring of lips, jaw, and respiration appeared to be mildly affected. Ataxia severity in Friedreich's ataxia patients revealed a significant correlation with the Frenchay dysarthria sum score. The introduction of a binary Adapted Dysarthria Score additionally allowed allocation to distinct dysarthria pattern in ataxias. The Frenchay Dysarthria Assessment proved to be a valid dysarthria measure in Friedreich's ataxia. Its availability in several languages provides a major advantage regarding the applicability in international clinical studies. Shortcomings of the Frenchay test are the multiplicity of items tested and its alphabetic coding. Numerical scoring and condensation of assessments in a modified version may, however, provide an excellent clinical tool for the measurement and scoring of dysarthria in ataxic speech disorders.

Learning Disabilities, Dyslexia, and Vision

Learning disabilities constitute a diverse group of disorders in which children who generally possess at least average intelligence have problems processing information or generating output. Their etiologies are multifactorial and reflect genetic influences and dysfunction of brain systems. Reading disability, or dyslexia, is the most common learning disability. It is a receptive language-based learning disability that is characterized by difficulties with decoding, fluent word recognition, rapid automatic naming, and/or reading-comprehension skills. These difficulties typically result from a deficit in the phonologic component of language that makes it difficult to use the alphabetic code to decode the written word. Early recognition and referral to qualified professionals for evidence-based evaluations and treatments are necessary to achieve the best possible outcome. Because dyslexia is a language-based disorder, treatment should be directed at this etiology. Remedial programs should include specific instruction in decoding, fluency training, vocabulary, and comprehension. Most programs include daily intensive individualized instruction that explicitly teaches phonemic awareness and the application of phonics. Vision problems can interfere with the process of reading, but children with dyslexia or related learning disabilities have the same visual function and ocular health as children without such conditions. Currently, there is inadequate scientific evidence to support the view that subtle eye or visual problems cause or increase the severity of learning disabilities. Because they are difficult for the public to understand and for educators to treat, learning disabilities have spawned a wide variety of scientifically unsupported vision-based diagnostic and treatment procedures. Scientific evidence does not support the claims that visual training, muscle exercises, ocular pursuit-and-tracking exercises, behavioral/perceptual vision therapy, "training" glasses, prisms, and colored lenses and filters are effective direct or indirect treatments for learning disabilities. There is no valid evidence that children who participate in vision therapy are more responsive to educational instruction than children who do not participate.

Computing and estimating the number of [formula omitted]-ary Huffman sequences of a specified length

An n -ary Huffman sequence of length q is the list, in non-decreasing order, of the lengths of the code words in a prefix-free replacement code for a q -letter source alphabet over an n -letter code alphabet, optimal with respect to some probability (relative frequency) distribution over the source alphabet, meaning that the code minimizes the average number of code letters per source letter. Here we extend a theorem in [E. Norwood, The number of different possible compact codes, IEEE Trans. Inform. Theory (October) (1967) 613–616] about the case n = 2 to arbitrary n ≥ 2 . The theorem permits the recursive computation of the number, h ( q , n ) , of different n -ary Huffman sequences of length q , and the estimation of h ( q , n ) , which turns out to grow geometrically with q , for each n ≥ 2 . Upper and lower estimates of h ( q , n ) are given for 2 ≤ n ≤ 6 . For instance, c 1 ( 1.75488 ) q ≤ h ( q , 2 ) ≤ c 2 ( 1.83929 ) q for some constants c 1 , c 2 ; this result significantly tightens the estimates of h ( q , 2 ) in [J. Burkert, Simple bounds on the numbers of binary Huffman sequences, Bull. Inst. Combin. Appl. 58 (2010) 79–82].

Development of phonological awareness during the preschool year: the influence of gender and socio-economic status

Phonological awareness is a critical enabling skill in learning to read, often developed outside the context of formal reading instruction. More than 2,000 6-year-old children were tested on phonological awareness at two occasions during the preschool year in two cohorts. Between the assessments, a training program was implemented. A two-level path model was applied. More frequent training sessions were connected to higher gains of test scores especially for children with low initial scores in the first cohort. A clear gender effect was also observed. There were more boys with very low initial scores and more girls among the top scorers. A clear SES-effect indicated the influence of early language stimulation. Children who already at the beginning of the preschool year had grasped the alphabetic code had the highest initial scores on the test.

Alphabetic coding with exponential costs

This note considers an alphabetic binary tree formulation in a family of nonlinear problems. An application of this family occurs when a random outcome needs to be determined via alphabetically ordered search within a stochastic time window. Rather than finding a decision tree minimizing ∑ i = 1 n w ( i ) l ( i ) , this variant involves minimizing log a ∑ i = 1 n w ( i ) a l ( i ) for a given a ∈ ( 0 , 1 ) . Herein a dynamic programming algorithm finds the optimal solution in O ( n 3 ) time and O ( n 2 ) space; methods traditionally used to improve the speed of optimizations in related problems, such as the Hu–Tucker procedure, fail for this problem. This note thus also introduces two algorithms which can find a suboptimal solution in linear time (for one) or O ( n log n ) time (for the other), with associated redundancy bounds guaranteeing their coding efficiency.

A New Algorithm for Building Alphabetic Minimax Trees

We show how to build an alphabetic minimax tree for a sequence W = w$_1$, m, w$_n$ of real weights in O(nd log log n) time, where d is the number of distinct integers ⌈wi⌉. We apply this algorithm to building an alphabetic prefix code given a sample.

Interleaved Reed-Solomon Codes versus Interleaved Hermitian Codes

Recently, Bleichenbacher et. al. introduced a collaborative decoding technique to jointly decode the constituent Reed-Solomon (RS) codes of an interleaved RS code. Brown et. al. subsequently generalized their approach to decode interleaved algebraic geometry codes. We identify when interleaved Hermitian codes enable recovery from more errors compared to interleaved RS codes of the same length, rate and alphabet size, under the aforementioned collaborative decoding schemes. Our investigations consider a wide range of code rates and alphabet sizes as well as codelengths of practical interest.

Code-oriented instruction for kindergarten students at risk for reading difficulties: a replication and comparison of instructional groupings

The purposes of this study were to replicate previous research on phonics-based tutoring in kindergarten and to compare treatment effects for students who received individual instruction compared to instruction in dyads. Thirty classroom teachers from 13 urban elementary schools referred at-risk students for participation. Students who met screening criteria were quasi-randomly assigned, within classroom, to one of three conditions: individual tutoring (n = 22), tutoring in dyads (n = 32), or no tutoring (n = 22, classroom instruction only). Twenty-one paraeducators provided 18 weeks of explicit instruction in phonemic skills and the alphabetic code to students during the latter half of kindergarten. Multilevel model results showed that tutored students outperformed non-tutored controls on posttest measures of phonological awareness, word reading accuracy, oral reading fluency, spelling, and comprehension. However, no significant differences were found between the two tutored groups on any measure, suggesting that code-oriented tutoring for pairs of students is a viable alternative to the gold standard of individual instruction.

Structural pattern recognition methods based on string comparison for fusion databases

Databases for fusion experiments are designed to store several million waveforms. Temporal evolution signals show the same patterns under the same plasma conditions and, therefore, pattern recognition techniques allow the identification of similar plasma behaviours. This article is focused on the comparison of structural pattern recognition methods. A pattern can be composed of simpler sub-patterns, where the most elementary sub-patterns are known as primitives. Selection of primitives is an essential issue in structural pattern recognition methods, because they determine what types of structural components can be constructed. However, it should be noted that there is not a general solution to extract structural features (primitives) from data. So, four different ways to compute the primitives of plasma waveforms are compared: (1) constant length primitives, (2) adaptive length primitives, (3) concavity method and (4) concavity method for noisy signals. Each method defines a code alphabet and, in this way, the pattern recognition problem is carried out via string comparisons. Results of the four methods with the TJ-II stellarator databases will be discussed.