The profile of a relational structure R is the function φR which counts for every integer n the number, possibly infinite, φR(n) of substructures of R induced on the n-element subsets, isomorphic substructures being identified. If φR takes only finite values, this is the Hilbert function of a graded algebra associated with R, the age algebra K.A(R), introduced by P. J. Cameron. In this paper, w...

The profile of a relational structure R is the function φR which counts for every integer n the number φR(n), possibly infinite, of substructures of R induced on the n-element subsets, isomorphic substructures being identified. If φR takes only finite values, this is the Hilbert function of a graded algebra associated with R, the age algebra KA(R), introduced by P. J. Cameron. In this paper we ...

BACKGROUND In many medical studies the likelihood ratio test (LRT) has been widely applied to examine whether the random effects variance component is zero within the mixed effects models framework; whereas little work about likelihood-ratio based variance component test has been done in the generalized linear mixed models (GLMM), where the response is discrete and the log-likelihood cannot be ...

We say that a symmetric matrix K is quasi-definite if it has the form K = [ −E AT A F ] where E and F are symmetric positive definite matrices. Although such matrices are indefinite, we show that any symmetric permutation of a quasi-definite matrix yields a factorization LDLT . We apply this result to obtain a new approach for solving the symmetric indefinite systems arising in interior-point m...

The three-state test (3ST) is a method based on ordinal pattern analysis for detecting chaos and determining the period in time series. For some well-known chaotic dynamical systems we showed that the test behaves similar to Lyapunov exponents. However, the 3ST is detecting quasi-periodic motions both as regular and non-regular. In this paper, we propose to use the sensitivity of its chaos indi...

We introduce a newnotion called a quasi-Feistel cipher, which is a generalization of the Feistel cipher, and contains the Lai–Massey cipher as an instance. We show that most of the works on the Feistel cipher can be naturally extended to the quasi-Feistel cipher. From this, we give a new proof for Vaudenay’s theorems on the security of the Lai–Massey cipher, and also we introduce for Lai–Massey...

Our aim in this paper is to show an example of the formalism we have developed to avoid the label-tensor-product-vector-space-formalism of quantum mechanics when dealing with indistinguishable quanta. States in this new vector space, that we call the Q-space, refer only to occupation numbers and permutation operators act as the identity operator on them, reflecting in the formalism the unobserv...

This paper has several folds. We make first new permutation choices in Halton sequences to improve their distributions. These choices are multi-dimensional and they are made for two different discrepancies. We show that multi-dimensional choices are better for standard quasi-Monte Carlo methods. We also use these sequences as a variance reduction technique in Monte Carlo methods, which greatly ...

We give the class of finite groups which arise as the permutation groups of cyclic codes over finite fields. Furthermore, we extend the results of Brand and Huffman et al. and we find the properties of the set of permutations by which two cyclic codes of length p can be equivalent. We also find the set of permutations by which two quasi-cyclic codes can be equivalent.