mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-23 21:11:08 +00:00
24d3cf8244
* The black formatter is no longer beta
* pre-commit autoupdate
* pre-commit autoupdate
* Remove project_euler/problem_145 which is killing our CI tests
* updating DIRECTORY.md
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
103 lines
2.4 KiB
Python
103 lines
2.4 KiB
Python
"""example of simple chaos machine"""
|
|
|
|
# Chaos Machine (K, t, m)
|
|
K = [0.33, 0.44, 0.55, 0.44, 0.33]
|
|
t = 3
|
|
m = 5
|
|
|
|
# Buffer Space (with Parameters Space)
|
|
buffer_space: list[float] = []
|
|
params_space: list[float] = []
|
|
|
|
# Machine Time
|
|
machine_time = 0
|
|
|
|
|
|
def push(seed):
|
|
global buffer_space, params_space, machine_time, K, m, t
|
|
|
|
# Choosing Dynamical Systems (All)
|
|
for key, value in enumerate(buffer_space):
|
|
# Evolution Parameter
|
|
e = float(seed / value)
|
|
|
|
# Control Theory: Orbit Change
|
|
value = (buffer_space[(key + 1) % m] + e) % 1
|
|
|
|
# Control Theory: Trajectory Change
|
|
r = (params_space[key] + e) % 1 + 3
|
|
|
|
# Modification (Transition Function) - Jumps
|
|
buffer_space[key] = round(float(r * value * (1 - value)), 10)
|
|
params_space[key] = r # Saving to Parameters Space
|
|
|
|
# Logistic Map
|
|
assert max(buffer_space) < 1
|
|
assert max(params_space) < 4
|
|
|
|
# Machine Time
|
|
machine_time += 1
|
|
|
|
|
|
def pull():
|
|
global buffer_space, params_space, machine_time, K, m, t
|
|
|
|
# PRNG (Xorshift by George Marsaglia)
|
|
def xorshift(X, Y):
|
|
X ^= Y >> 13
|
|
Y ^= X << 17
|
|
X ^= Y >> 5
|
|
return X
|
|
|
|
# Choosing Dynamical Systems (Increment)
|
|
key = machine_time % m
|
|
|
|
# Evolution (Time Length)
|
|
for i in range(0, t):
|
|
# Variables (Position + Parameters)
|
|
r = params_space[key]
|
|
value = buffer_space[key]
|
|
|
|
# Modification (Transition Function) - Flow
|
|
buffer_space[key] = round(float(r * value * (1 - value)), 10)
|
|
params_space[key] = (machine_time * 0.01 + r * 1.01) % 1 + 3
|
|
|
|
# Choosing Chaotic Data
|
|
X = int(buffer_space[(key + 2) % m] * (10**10))
|
|
Y = int(buffer_space[(key - 2) % m] * (10**10))
|
|
|
|
# Machine Time
|
|
machine_time += 1
|
|
|
|
return xorshift(X, Y) % 0xFFFFFFFF
|
|
|
|
|
|
def reset():
|
|
global buffer_space, params_space, machine_time, K, m, t
|
|
|
|
buffer_space = K
|
|
params_space = [0] * m
|
|
machine_time = 0
|
|
|
|
|
|
if __name__ == "__main__":
|
|
# Initialization
|
|
reset()
|
|
|
|
# Pushing Data (Input)
|
|
import random
|
|
|
|
message = random.sample(range(0xFFFFFFFF), 100)
|
|
for chunk in message:
|
|
push(chunk)
|
|
|
|
# for controlling
|
|
inp = ""
|
|
|
|
# Pulling Data (Output)
|
|
while inp in ("e", "E"):
|
|
print("%s" % format(pull(), "#04x"))
|
|
print(buffer_space)
|
|
print(params_space)
|
|
inp = input("(e)exit? ").strip()
|