Search results for "coding"
showing 10 items of 920 documents
The node-depth encoding
2008
The node-depth encoding has elements from direct and indirect encoding for trees which encodes trees by storing the depth of nodes in a list. Node-depth encoding applies specific search operators that is a typical characteristic for direct encodings. An investigation into the bias of the initialization process and the mutation operators of the node-depth encoding shows that the initialization process has a bias to solutions with small depths and diameters, and a bias towards stars. This investigation, also, shows that the mutation operators are unbiased. The performance of node-depth encoding is investigated for the bounded-diameter minimum spanning tree problem. The results are presented f…
Symbolic Dynamics of Geodesic Flows on Trees
2019
In this chapter, we give a coding of the discrete-time geodesic ow on the nonwandering sets of quotients of locally finite simplicial trees X without terminal vertices by nonelementary discrete subgroups of Aut(X) by a subshift of finite type on a countable alphabet.
Coding with traces
1994
We prove that the existence of a coding between two trace monoids is decidable for some families of trace monoids. Decidability heavily depends on the structure of the dependence graphs. The concept of coding is based on the new notion of strong morphism between trace monoids.
Polyomino Number Theory (II)
2003
Polyominoes are connected plane figures formed of joining unit squares edge to edge. We have a monomino, a domino, two trominoes named I and V, five tetrominoes named I, L, N, O and T, respectively, and twelve pentominoes (a registered trademark of Solomon W. Golomb) named F, I, L, N, P, T, U, V, W, X, Y and Z respectively.
Encoding into Visual Working Memory: Event-Related Brain Potentials Reflect Automatic Processing of Seemingly Redundant Information.
2013
Encoding and maintenance of information in visual working memory in an S1-S2 task with a 1500 ms retention phase were investigated by means of event-related brain potentials (ERPs). Participants were asked to decide whether two visual stimuli were physically identical (identity comparison (IC) task) or belonged to the same set or category of equivalent patterns (category comparison (CC) task). The stimuli differ with regard to two features. (1) Each pattern can belong to a set of either four (ESS 4) or eight (ESS 8) equivalent patterns, mirroring differences in the complexity with regard to the representational structure of each pattern (i.e., equivalence set size (ESS)). (2) The set of pat…
Position Coding in Two-Digit Arabic Numbers
2011
Digit position coding in two-digit Arabic numbers was examined in two masked priming experiments. In Experiment 1, participants had to decide whether the presented stimulus was a two-digit Arabic number (e.g., 67) or not (e.g., G7). Target stimuli could be preceded by a prime which (i) shared one digit in the initial position (e.g., 13-18), (ii) shared one digit but in a different position (83-18), and (iii) was a transposed number (81-18). Two unrelated control conditions, equalized in terms of the distance between primes and targets with the experimental conditions, were also included (e.g., 79-18). Results showed a priming effect only when prime and target shared digits in the same posi…
Encoding numbers: behavioral evidence for processing-specific representations.
2006
The aim of this study was to test the hypothesis of a complex encoding of numbers according to which each numerical processing requires a specific representational format for input. In three experiments, adult participants were given two numbers presented successively on screen through a self-presentation procedure after being asked to add, to subtract, or to compare them. We considered the self-presentation time of the first number as reflecting the complexity of the encoding for a given planned processing. In line with Dehaene's triple-code model, self-presentation times were longer for additions and subtractions than for comparisons with two-digit numbers but longer for subtractions than…
Factors Behind Junk DNA in Bacteria
2012
Although bacterial genomes have been traditionally viewed as being very compact, with relatively low amounts of repetitive and non-coding DNA, this view has dramatically changed in recent years. The increase of available complete bacterial genomes has revealed that many species present abundant repetitive DNA (i.e., insertion sequences, prophages or paralogous genes) and that many of these sequences are not functional but can have evolutionary consequences as concerns the adaptation to specialized host-related ecological niches. Comparative genomics analyses with close relatives that live in non-specialized environments reveal the nature and fate of this bacterial junk DNA. In addition, the…
Linear-size suffix tries
2016
Suffix trees are highly regarded data structures for text indexing and string algorithms [MCreight 76, Weiner 73]. For any given string w of length n = | w | , a suffix tree for w takes O ( n ) nodes and links. It is often presented as a compacted version of a suffix trie for w, where the latter is the trie (or digital search tree) built on the suffixes of w. Here the compaction process replaces each maximal chain of unary nodes with a single arc. For this, the suffix tree requires that the labels of its arcs are substrings encoded as pointers to w (or equivalent information). On the contrary, the arcs of the suffix trie are labeled by single symbols but there can be Θ ( n 2 ) nodes and lin…
New super-orthogonal space-time trellis codes using differential M-PSK for noncoherent mobile communication systems with two transmit antennas
2010
Published version of an article in the journal: Annals of Telecommunications-Annales Des Telecommunications. Also available from the publisher at: http://dx.doi.org/10.1007/s12243-010-0191-1 In this paper, we develop super-orthogonal space-time trellis codes (SOSTTCs) using differential binary phase-shift keying, quadriphase-shift keying and eight-phase shift keying for noncoherent communication systems with two transmit antennas without channel state information at the receiver. Based on a differential encoding scheme proposed by Tarokh and Jafarkhani, we propose a new decoding algorithm with reduced decoding complexity. To evaluate the performance of the SOSTTCs by way of computer simulat…