Splitting Sequences for Coding and Hybrid Incremental ARQ with Fragment Retransmission

This paper proposes a code defined on a finite ring ℤpM, where pM = 2m−1 is a Mersenne prime, and m is a binary size of ring elements. The code is based on a splitting sequence (splitting set) S, defined for the given multiplier set ℰ={±20, ±21,…, ±2m−1}. The elements of ℰ correspond to the weights of binary error patterns that can be corrected, with the bidirectional single-bit error being the representative that occurs the most. The splitting set splits the code-word into sub-words, which inspired the name splitting code. Each sub-word, provided with auxiliary control symbols that are a byproduct of the coding procedure, corrects a single symbol error. The code can be defined, with some constraints, for general Mersenne numbers as well, while the multiplier set can be adjusted for adjacent binary errors correction. The application proposed for this code is a hybrid three-stage incremental ARQ procedure that transmits the code-word in the first stage, auxiliary control symbols in the second stage, and retransmits the sub-words detected as incorrect in the third stage. At each stage, error correction can be turned on or off, keeping both the retransmission rate and residual error rate at a low level.

A characterization of a map whose inverse limit is an arc

For a continuous function $f:[0,1] \to [0,1]$ we define a splitting sequence admitted by f and show that the inverse limit of f is an arc if and only if f does not admit a splitting sequence.

Division of Myocardial Enzyme Reference Intervals in Population Aged 1 to <18 Years Old Based on Fisher’s Optimal Segmentation Method

Background. Reference interval (RI) research is to make it a concise, effective, and practical diagnostic tool. This study aimed to establish sex- and age-specific RI for myocardial enzyme activity in population aged 1–<18 years old in Changchun, China. Methods. Healthy subjects (n = 6,322, 1–<18 years old) were recruited from communities and schools. Aspartate aminotransferase (AST), lactate dehydrogenase (LDH), creatine kinase (CK), and creatine kinase isoenzyme (CKMB) were measured using an automatic biochemical analyzer. Fisher’s optimal segmentation method was used to partition by including percentiles as impact factors, aiming at minimizing the sum of the squares of the total dispersion into groups as splitting sequence of ordered data. Results. AST decreased gradually and was partitioned as 1, 2∼<10 and 10∼<18 years old. LDH presented disparate descending rate among 1∼<4, 4∼<12, and 12∼<18 years old. CK stood quite stable with the same RI in all ages. CKMB began to differ at 6 years of age sexually and then remained stable during 6∼<14 years old for male while it continued to decline in female. Cardiac development was partitioned as 1∼<6, 6∼<13, and 13∼<18 years old using multiple percentiles from massive data that reflect characteristics of totality as impact factors. Conclusions. Fisher’s optimal segmentation method excelled for multidimensionality, continuity, and loop calculating as dealing with RIs for myocardial enzymes activity and cardiac development process despite limitations. In future, impact of partition on the overall interval should be delved into.

ADVERBIA DALAM NOVEL ANGKATAN PUJANGGA BARU: NOVEL LAYAR TERKEMBANG KARYA SUTAN TAKDIR ALISJAH-BANA DAN NOVEL BELENGGU KARYA ARMIJN PANE

This study was conducted to describe (1) the type of abreviation and (2) the formation of abreviation in the weekly newspaper of Padang Ekspres in January 2018. This research type is qualitative research by using descriptive method. This research data is a kind of abreviation (abbreviations, acronyms, fragments, contractions, and symbols) that exist in the news sentences of the weekly newspaper Padang Ekspres January 2018. The data sources of this research in the newspaper Padang Ekpres Weekly edition in January 2018. Based on the results of data analysis obtained two research findings. First, the type of abreviation in the weekly newspaper Padang Ekspres January 2018, found five types of abreviation, namely (a) abbreviation, (b) acronym, (c)fragments, (d) contractions, and (e) symbols. Second, the formation of abreviation in the weekly newspaper Padang Ekspres January 2018, consists of four processes. (a) The formation of abbreviations consisting of: the first letters of each component; first letters with conjunction, preposition, reduplication, articulation and word; first letters; and first and third letter. (b) The formation of acronyms and contractions consisting of: the first syllabus of each component; first of each component, first two letters of each component, the first three letters of each component, the first two letters of the first two and the first two letters of the second component together with the deletion; and the sequence of various letters and syllables difficult to formulate. (c) The formation of a fragment consist of: that is letters the last syllable of a word and partial splitting sequence. (d) The formation of letter symbol consisting of: that is symbol of letters that characterize size consisting of first letters of consolidation of component, letter symbol expressing data number, and symbol letters that mark currency. Keywords: Adverbs, Novel, Pujangga Baru

PEMBENTUKAN ABREVIASI DALAM SURAT KABAR PADANG EKSPRES

This study was conducted to describe (1) the type of abreviation and (2) the formation of abreviation in the weekly newspaper of Padang Ekspres in January 2018. This research type is qualitative research by using descriptive method. This research data is a kind of abreviation (abbreviations, acronyms, fragments, contractions, and symbols) that exist in the news sentences of the weekly newspaper Padang Ekspres January 2018. The data sources of this research in the newspaper Padang Ekpres Weekly edition in January 2018. Based on the results of data analysis obtained two research findings. First, the type of abreviation in the weekly newspaper Padang Ekspres January 2018, found five types of abreviation, namely (a) abbreviation, (b) acronym, (c)fragments, (d) contractions, and (e) symbols. Second, the formation of abreviation in the weekly newspaper Padang Ekspres January 2018, consists of four processes. (a) The formation of abbreviations consisting of: the first letters of each component; first letters with conjunction, preposition, reduplication, articulation and word; first letters; and first and third letter. (b) The formation of acronyms and contractions consisting of: the first syllabus of each component; first of each component, first two letters of each component, the first three letters of each component, the first two letters of the first two and the first two letters of the second component together with the deletion; and the sequence of various letters and syllables difficult to formulate. (c) The formation of a fragment consist of: that is letters the last syllable of a word and partial splitting sequence. (d) The formation of letter symbol consisting of: that is symbol of letters that characterize size consisting of first letters of consolidation of component, letter symbol expressing data number, and symbol letters that mark currency.Keywords: Abreviation, Newspaper, Padang Ekspress

A TUTORIAL OF TECHNIQUES FOR IMPROVING STANDARD HIDDEN MARKOV MODEL ALGORITHMS

In this tutorial, we discuss two main algorithms for Hidden Markov Models or HMMs: the Viterbi algorithm and the expectation phase of the Baum–Welch algorithm, and we describe ways to improve their naïve implementations. For the Baum–Welch algorithm we first present an implementation of the expectation computations using constant space. We then discuss the classical implementation of this calculation and describe ways to reduce its space usage to logarithmic and [Formula: see text], with their respective CPU costs. We also note where each respective algorithm can be parallelized. For the Viterbi algorithm, we describe [Formula: see text] and logarithmic space algorithms which increase CPU use by a factor of two and by a logarithmic factor respectively. We also present two recent heuristics for decreasing space use, which in practice lead to logarithmic space use. Classical version of Viterbi cannot be parallelized by splitting sequence in several subsequences, but we show a parallelization that works if we are willing to pay a significant extra CPU cost. Finally we show a very simple parallelization trick which enables full usage of multiple CPUs/cores under the condition that they share memory.

On finitely recursive programs

Disjunctivefinitary programsare a class of logic programs admitting function symbols and hence infinite domains. They have very good computational properties; for example, ground queries are decidable, while in the general case the stable model semantics are Π11-hard. In this paper we prove that a larger class of programs, calledfinitely recursive programs, preserve most of the good properties of finitary programs under the stable model semantics, which are as follows: (i) finitely recursive programs enjoy a compactness property; (ii) inconsistency checking and skeptical reasoning are semidecidable; (iii) skeptical resolution is complete for normal finitely recursive programs. Moreover, we show how to check inconsistency and answer skeptical queries using finite subsets of the ground program instantiation. We achieve this by extending the splitting sequence theorem by Lifschitz and Turner: we prove that if the input programPis finitely recursive, then the partial stable models determined by any smooth splitting ω-sequence converge to a stable model ofP.