In this paper, given a composite integer n, we propose a method of constructing p-ary low correlation zone(LCZ) sequences of period p − 1 from p-ary m-sequences of the same length. The new construction method is a generalized form of the quaternary LCZ sequence by Kim, Jang, No, and Chung in the view of the alphabet size. The correlation distribution of these new p-ary LCZ sequences is derived.

In this paper, given a q-ary LCZ sequence set with parameters (N,M,L, ǫ) and even q, we construct another q-ary LCZ sequence set with parameters (2N, 2M,L, 2ǫ) when q is even. Especially for odd L such that L|N , if a q-ary optimal LCZ sequence set with parameters (N,M,L, 1) is used, the new set with parameters (2N, 2M,L, 2) can be optimal in terms of the set size.

N -ary queries in trees select sets of n-tuples of nodes. We propose and investigate representation formalisms for n-ary queries by tree automata, both for ranked and unranked trees. We show that existential run-based queries capture MSO in the n-ary case, as well as universal run-based queries. We then characterize queries by runs of unambiguous tree automata, and show how to decide whether an...

Node selection in trees is a fundamental operation to XML databases, programming languages, and information extraction. We propose a new class of querying languages to define n-ary node selection queries as compositions of monadic queries. The choice of the underlying monadic querying language is parametric. We show that compositions of monadic MSO-definable queries capture n-ary MSO-definable ...

The 5G system-based cognitive radio network is promised to meet the requirements of huge data applications with spectrum. However, M-ary effect on detection has not been thoroughly investigated. In this paper, an quadrature amplitude modulation system studied. Many rates are used in study 4, 16, 64, and 256 constellation points. applied cooperative spectrum sensing enhance performance for vario...

We prove a general theorem which includes most notions of “exact completion” as special cases. The theorem is that “κ-ary exact categories” are a reflective sub-2-category of “κ-ary sites”, for any regular cardinal κ. A κ-ary exact category is an exact category with disjoint and universal κ-small coproducts, and a κ-ary site is a site whose covering sieves are generated by κ-small families and ...

Two utility models are classically used to represent interaction among criteria: the Choquet integral and the Generalized Additive Independence (GAI) model. We propose a comparison of these models. Looking at their mathematical expression, it seems that the second one is much more general than the first one. The GAI model has been mostly studied in the case where attributes are discrete. We pro...

A set of vertices of the q-ary n-dimensional Hamming space is called a distance-2 MDS code if it has exactly one element in intersection with every line. By an isotopism we mean an isometric transformation of the Hamming space that independently permutes the symbols in every coordinate but does not change the coordinate order. A set M of vertices is called transitive if its automorphism group (...

This paper proposes a model of placing a liaison which forms relations to two members of different levels in a pyramid organization structure such that the communication of information between every member in the organization becomes the most efficient. For the model of adding a node of liaison which gets adjacent to a node with a depth M and its descendant with a depth N in a complete K-ary tr...

In this paper, we present a real-time faulttolerant design for an l-level k-ary tree multiprocessor with two modes of operations and examine its reconfigurability. The k-ary tree is augmented by spare nodes at stages one and two. We consider two modes of operations, one under heavy computation or hard deadline and the other under light computation or soft deadline. By utilizing the capabilities...