The objective of this study was to develop an empirical model relating human running performance to some characteristics of metabolic energy-yielding processes using A, the capacity of anaerobic metabolism (J/kg); MAP, the maximal aerobic power (W/kg); and E, the reduction in peak aerobic power with the natural logarithm of race duration T, when T greater than TMAP = 420 s. Accordingly, the mod...

We construct a new Gray map from S to F 3n 2 where S = F2+uF2+uF2, u3 = 1. It is both an isometry and a weight preserving map. It was shown that the Gray image of cyclic code over S is quasi-cyclic codes of index 3 and the Gray image of quasi-cyclic code over S is l-quasi-cyclic code of index 3. Moreover, the skew cyclic and skew quasi-cyclic codes over S introduced and the Gray images of them ...

Chaotic systems are widely used in image encryption due to their sensitivity initial values, ergodicity, and other properties; many algorithms based on chaotic have been studied the past few years. To obtain a more secure algorithm, this work firstly proposes new two-dimensional discrete hyperchaotic map, which has wider continuous interval, larger Lyapunov exponents passed all NIST part of Tes...

Let S, T be semilattices. Let us assume that if S is upper-bounded, then T is upper-bounded. A map from S into T is said to be a semilattice morphism from S into T if: (Def. 1) For every finite subset X of S holds it preserves inf of X. Let S, T be semilattices. One can check that every map from S into T which is meet-preserving is also monotone. Let S be a semilattice and let T be an upper-bou...

We take an in-depth look at Thurston’s combinatorial characterization of rational functions for a particular class of maps we call nearly Euclidean Thurston maps. These are orientation-preserving branched maps f : S2 → S2 whose local degree at every critical point is 2 and which have exactly four postcritical points. These maps are simple enough to be tractable, but are complicated enough to ha...

| A number of mathematical tools are used for analysing nonlinear over-ow eeects in digital lters. In our investigations we found if useful to use the probabilis-tic approach and the circle-map theory in the analysis of complex behaviour in second-order digital lter. In the rst part we introduce some deenition (rotation number, nonwander-ing and chain recurrent points, mixing, exact-ness) and p...

With the security requirement improvement of the image on the network, some typical image encryption methods can’t meet the demands of encryption, such as Arnold cat map and Hilbert transformation. S-DES system can encrypt the input binary flow of image, but the fixed system structure and few keys will still bring some risks. However, the sensitivity of initial value that Logistic chaotic map c...

While the forward trajectory of a point in discrete dynamical system is always unique, general can have infinitely many backward trajectories. The union limit points all trajectories through $x$ was called by M.~Hero "special $\alpha$-limit" ($s\alpha$-limit for short) $x$. In this article we show that there hierarchy $s\alpha$-limits under iterations S-unimodal map: size $s\alpha$-limit increa...