Explore chapters and articles related to this topic
Data Types and Data Storage
Published in Julio Sanchez, Maria P. Canton, Microcontroller Programming, 2018
Julio Sanchez, Maria P. Canton
In Chapter 2 we used the positional weights of the binary digits to convert a binary number to its decimal equivalent. A similar method can be used to convert the fractional part of a binary number. Using the decimal equivalents shown in Figure 3-5 we convert the binary fraction .10101 to a decimal fraction as follows
Transfer and Conversion
Published in Cliff Wootton, Developing Quality Metadata, 2009
Integer values are strictly whole numbers. No fractional part after the decimal place is allowed. Integer values come in a variety of sizes, with 1, 2 and 4-byte values being the most common. The number of bytes will dictate the range of available values.
Optimizing Berth-quay Crane Allocation considering Economic Factors Using Chaotic Quantum SSA
Published in Applied Artificial Intelligence, 2022
Xia Cao, Zhong-Yi Yang, Wei-Chiang Hong, Rui-Zhe Xu, Yu-Tian Wang
where the operation of the “mod 1” takes the fractional part of a real number. Eigenvalues of the coefficient matrix of the Cat mapping function are σ1 = 2.618 > 1 and σ2 = 0.382 < 1. Therefore, the resulting maximum Lyapunov exponent of the Cat mapping function is λ1 = ln2.618 > 0. The larger the positive Lyapunov exponent, the faster the orbit separation, and thus the more complex the 3D cat mapping function becomes, the better the chaotic performance. However, after a finite number of iterations, the discretized cat mapping function exhibits the phenomenon of Poincare recovery. To solve this problem more efficiently, Li, Hong, and Kang (2013) extended the two-dimensional cat mapping function to a three-dimensional cat mapping function. The main idea is to introduce two parameters, a and b, into the two-dimensional cat mapping function, as shown in Eq. (35).
Deep learning on Sleptsov nets
Published in International Journal of Parallel, Emergent and Distributed Systems, 2021
Tatiana R. Shmeleva, Jan W. Owsiński, Abdulmalik Ahmad Lawan
For a real: , where is mantissa sign, is biased exponent, and is fractional part of denormalised mantissa [51]. Based on unsigned integer arithmetic operations [17], integer and real arithmetic can be developed with regard to the above-considered representation of integer and real numbers as a marking of a corresponding place. Moreover, to speed-up operations over integer numbers and taking into account the fact all the mentioned vectors have constant (and rather little) number of components, we recommend to store the vector components in separate places without repeated packing and unpacking them into a single natural number.
Dynamics of a family of continued fraction maps
Published in Dynamical Systems, 2018
If α = 0 = [0, ∞] with n1 = ∞, then in the definition (1) of , we are always in the first case (*), and so is the well-known Gauss continued fraction mapwhere x = [0, m1, m2, m3,…] and {y} denotes the fractional part of y. One has Its invariant functions are solutions of the functional equation Substituting y + 1 in place of y leads to the three-term functional equation which admits, when s = 1, the function (called the Gauss density) as a solution. It is well known and easily verified that the Gauss density is an invariant density for the classical GKW-operator .