Search results for "code"
showing 10 items of 1180 documents
Kieli- ja kielitaitokäsitykset tutkivan opettajan kenttäpäiväkirjamerkinnöissä
2018
This article focuses on a young teacher-researcher’s beliefs about language and language skills. The research is motivated by findings of former studies according with which teachers’ beliefs are often relatively permanent and have a strong effect on their teaching and evaluation practices. The data consists of a teacher-researcher’s diary notes from storytelling events (n=19) in which storycrafting has been used with young primary school pupils. The study was carried out by a theory-driven content analysis in order to reveal and to be able to assess teacher-researcher’s beliefs that are only implicitly present in the data: diary markings were analyzed by comparing them to widely used dicho…
ideal: an R/Bioconductor package for interactive differential expression analysis
2020
AbstractBackgroundRNA sequencing (RNA-seq) is an ever increasingly popular tool for transcriptome profiling. A key point to make the best use of the available data is to provide software tools that are easy to use but still provide flexibility and transparency in the adopted methods. Despite the availability of many packages focused on detecting differential expression, a method to streamline this type of bioinformatics analysis in a comprehensive, accessible, and reproducible way is lacking.ResultsWe developed the ideal software package, which serves as a web application for interactive and reproducible RNA-seq analysis, while producing a wealth of visualizations to facilitate data interpr…
Joint transform correlator with spatial code division multiplexing.
2006
A joint transform correlator may suffer from overlapping of the zero diffraction order of the output, which does not contain relevant information, and the correlation peaks that appear in the first diffraction orders if objects are not sufficiently separated. Such overlapping significantly reduces the signal-to-noise ratio of the identification process. We propose a novel approach based on code division multiplexing technique in which the contrast of the identification peaks is significantly enhanced. The approach does not include placing the two objects side by side but rather includes code multiplexing them. Moreover, the code division multiplexing technique allows the space-bandwidth pro…
Forme del testo digitale
2017
L'articolo costituisce una riflessione sulla modellizzazione dei testi appartenenti alla nostra tradizione culturale in questa fase aurorale della Filologia Digitale e parte dalla domanda: che "forma" stiamo dando ai nostri testi? Vengono asplorati tre aspetti per cui i nostri modelli testuali riflettono i nostri presupposti culturali e tecnologici: in primo luogo, il modello gerarchico OHCO che sta alla base di TEI XML; in secondo luogo, il modello sequenziale alfabetico basato sulla stampa delle lingue occidentali, che sta alla base di Unicode. Un terzo aspetto, poi, è il meno esplorato nella ricerca: protocolli per la citazione testuale come CITE/CTS sono basati su corpora specifici. Per…
Combinatorial isomorphism between Fibonacci classes
2008
Abstract In 1985 Simion and Schmidt showed that the set S n (T 3) of length n permutations avoiding the set of patterns T 3={123, 132, 213} is counted by (the second order) Fibonacci numbers. They also presented a constructive bijection between the set F n–1 of length (n–1) binary strings with no two consecutive 1s and S n (T 3). In 2005, Egge and Mansour generalized the first Simion-Simion’s result and showed that S n (T p ), the set of permutations avoiding the patterns T p ={12…p, 132, 213}, is counted by the (p–1)th order Fibonacci numbers. In this paper we extend the second Simion-Schmidt’s result by giving a bijection between the set of length (n–1) binary strings with no (p–1) consec…
On the weight distribution of perfect binary codes
2021
In this paper, we give a new proof of the closed-form formula for the weight distribution of a perfect binary single-error-correcting code.
New lower bounds for the minimum distance of generalized algebraic geometry codes
2013
Abstract In this paper, we give a new lower bound for generalized algebraic geometry codes with which we are able to construct some new linear codes having better parameters compared with the ones known in the literature. Moreover, we give a relationship between a family of generalized algebraic geometry codes and algebraic geometry codes. Finally, we propose a decoding algorithm for such a family.
On the loopless generation of binary tree sequences
1998
Weight sequences were introduced by Pallo in 1986 for coding binary trees and he presented a constant amortized time algorithm for their generation in lexicographic order. A year later, Roelants van Baronaigien and Ruskey developed a recursive constant amortized time algorithm for generating Gray code for binary trees in Pallo's representation. It is common practice to find a loopless generating algorithm for a combinatorial object when enunciating a Gray code for this object. In this paper we regard weight sequences as variations and apply a Williamson algorithm in order to obtain a loopless generating algorithm for the Roelants van Baronaigien and Ruskey's Gray code for weight sequences.
Divisible designs from semifield planes
2002
AbstractWe give a general method to construct divisible designs from semifield planes and we use this technique to construct some divisible designs. In particular, we give the case of twisted field plane as an example.
Varieties of Codes and Kraft Inequality
2005
Decipherability conditions for codes are investigated by using the approach of Guzman, who introduced in [7] the notion of variety of codes and established a connection between classes of codes and varieties of monoids. The class of Uniquely Decipherable (UD) codes is a special case of variety of codes, corresponding to the variety of all monoids. It is well known that the Kraft inequality is a necessary condition for UD codes, but it is not sufficient, in the sense that there exist codes that are not UD and that satisfy the Kraft inequality. The main result of the present paper states that, given a variety $\mathcal{V}$ of codes, if all the elements of $\mathcal{V}$ satisfy the Kraft inequ…