Results 31 to 40 of about 1,430,679 (327)

Compressing Sets and Multisets of Sequences [PDF]

IEEE Transactions on Information Theory, 2014
This article describes lossless compression algorithms for multisets of sequences, taking advantage of the multiset's unordered structure. Multisets are a generalisation of sets where members are allowed to occur multiple times. A multiset can be encoded na vely by simply storing its elements in some sequential order, but then information is wasted on
openaire   +2 more sources

On the ground states of the Bernasconi model [PDF]

, 1997
The ground states of the Bernasconi model are binary +1/-1 sequences of length N with low autocorrelations. We introduce the notion of perfect sequences, binary sequences with one-valued off-peak correlations of minimum amount.
, Baumert L D, Bernasconi J, Beth T, Borsari I, Bouchaud J P, Christine Bessenrodt, Eliahou S, Golay M J E, Jungnickel D, Jungnickel D, Krauth W, Lempel A, Marinari E, Marinari E, Mertens S, Pott A, Schmidt B, Schroeder M R, Stephan Mertens, Turyn R, Turyn R, Watson E J, Zivkovic M   +23 more
core   +3 more sources

On certain Banach spaces of difference sequences of fuzzy real numbers [PDF]

Maejo International Journal of Science and Technology, 2014
Some sets of difference sequences of fuzzy real numbers which have Banach subspaces are introduced and investigated. Further, it is shown that these subspaces are isometric with some subsets of the sets of null, convergent and bounded sequences of fuzzy
Hemen Dutta
doaj   +1 more source

Construction and Assignment of Orthogonal Sequences and Zero Correlation Zone Sequences Over GF(p)

IEEE Access, 2022
Orthogonal sequences can be assigned to a regular tessellation of hexagonal cells, typical for synchronised code-division multiple-access (S-CDMA) systems.
Chunlei Xie, Xiaofang Wang, Liupiao Zhang   +2 more
doaj   +1 more source

Effective inseparability for sequences of sets [PDF]

Proceedings of the American Mathematical Society, 1965
Ax but not to any other member of the sequence {Ax}. The complement of a set A will be denoted by A'. We use Vx and Ax as universal and existential quantifiers over M. Superscripts will range over the set N of all natural numbers; variables left free should be interpreted as universally quantified over N, or over M for suffixes.
openaire   +2 more sources

Achievement Sets of Reciprocals of Complete Sequences

Results in Mathematics, 2023
AbstractThe paper is dedicated to answer Question 1 from the preprint of the paper (Jones in Am Math Mon 118: 508-521, 2011). We show that it is possible to construct a complete sequence $$(x_n)$$ ( x n )
openaire   +1 more source

Graphical Markov models: overview [PDF]

, 2015
We describe how graphical Markov models started to emerge in the last 40 years, based on three essential concepts that had been developed independently more than a century ago.
Andersen, Anderson, Bergsma, Bollen, Cheung, Cochran, Cowell, Cox, Cox, Cox, Cox, Cox, Cox, Darroch, Dempster, Drton, Drton, Edwards, Edwards, Geiger, Gibbs, Haavelmo, Hardt, Hardt, Hardt, Koster, Laucht, Lauritzen, Lauritzen, Lauritzen, Lněnička, Loh, Marchetti, Marchetti, Marchetti, Markov, McCullagh, Németh, Pearl, Pearl, Richardson, Richardson, Robins, Sadeghi, Sadeghi, Sadeghi, San Martin, Simpson, Smith, Spirtes, Studený, Vandenbroucke, Wainwright, Weisberg, Wermuth, Wermuth, Wermuth, Wermuth, Wermuth, Wermuth, Wermuth, Wermuth, Wermuth, Wermuth, Wermuth, Wermuth, Wermuth, Wermuth, Wermuth, Wermuth, Whittaker, Wright, Wright, Zellner   +73 more
core   +2 more sources

Sequence of Regular Finitely Additive Set Functions [PDF]

Transactions of the American Mathematical Society, 1974
The purpose of this paper is to deduce versions of Phillips’ lemma and the Vitali-Hahn-Saks theorem, with weaker conditions placed on the set functions and convergence conditions than is usually required.
openaire   +2 more sources

Design Framework of Fourier-Based Non-Orthogonal Sequences for Sparse Activity Detection in Multicell Massive Connectivity

IEEE Access, 2022
In massive machine-type communications (mMTC), grant-free access is a key enabler for a massive number of users to be connected to a base station with low signaling overhead and low latency. In this paper, new Fourier-based sequence sets are proposed for
Nam Yul Yu
doaj   +1 more source

Explicit constructions of point sets and sequences with low discrepancy

, 2013
In this article we survey recent results on the explicit construction of finite point sets and infinite sequences with optimal order of $\mathcal{L}_q$ discrepancy.
Dick, Josef, Pillichshammer, Friedrich
core   +1 more source