Results 21 to 30 of about 141,047 (269)
GFD: An R Package for the Analysis of General Factorial Designs
Factorial designs are widely used tools for modeling statistical experiments in all kinds of disciplines, e.g., biology, psychology, econometrics and medicine. For testing null hypotheses in this framework, ANOVA methods are widely used.
Sarah Friedrich +2 more
doaj +1 more source
Bogdanov Map-based Permuted Double Image Encryption [PDF]
Chaos-based image encryption schemes shuffle the position of the pixels (confuse), change their values (diffuse), to camouflage the identity of the original image.
SUBASHINI V. JANARDHANAN +1 more
doaj +1 more source
Calculating Permutation Entropy without Permutations [PDF]
A method for analyzing sequential data sets, similar to the permutation entropy one, is discussed. The characteristic features of this method are as follows: it preserves information about equal values, if any, in the embedding vectors; it is exempt from combinatorics; and it delivers the same entropy value as does the permutation method, provided the ...
openaire +3 more sources
Permutation and complete permutation polynomials
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leonid A. Bassalygo, Victor A. Zinoviev
openaire +1 more source
Ballot permutations and odd order permutations [PDF]
There was an error with an alternative formula for b(n,3) that was on page ...
openaire +2 more sources
Phenolic Compounds and Skin Permeability: An In Silico Investigation [PDF]
Background: The skin is the largest organ of the body and provides the main barrier between the internal and external environment. Assessment of skin permeability is of critical importance for understanding and predicting in vivo efficacy and ...
Majdi Hammami +4 more
doaj +1 more source
Intervals and factors in the Bruhat order [PDF]
Combinatorics
Bridget Eileen Tenner
doaj +1 more source
Operators of equivalent sorting power and related Wilf-equivalences [PDF]
We study sorting operators $\textrm{A}$ on permutations that are obtained composing Knuth's stack sorting operator \textrmS and the reverse operator $\textrm{R}$, as many times as desired.
Michael Albert, Mathilde Bouvel
doaj +1 more source
Homogeneous Permutations [PDF]
There are just five Fraïssé classes of permutations (apart from the trivial class of permutations of a singleton set); these are the identity permutations, reversing permutations, composites (in either order) of these two classes, and all permutations. The paper also discusses infinite generalisations of permutations, and the connection with Fraïssé's ...
openaire +2 more sources
Interlocked Permutations [PDF]
The zero-error capacity of channels with a countably infinite input alphabet formally generalises Shannon's classical problem about the capacity of discrete memoryless channels. We solve the problem for three particular channels. Our results are purely combinatorial and in line with previous work of the third author about permutation capacity.
Cohen, Gérard +2 more
openaire +3 more sources

