Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Publication
- Publication Type
Articles 1 - 5 of 5
Full-Text Articles in Physical Sciences and Mathematics
Quantifying Complex Systems Via Computational Fly Swarms, Troy Taylor
Quantifying Complex Systems Via Computational Fly Swarms, Troy Taylor
Senior Theses
Complexity is prevalent both in natural and in human-made systems, yet is not well understood quantitatively. Qualitatively, complexity describes a phenomena in which a system composed of individual pieces, each having simple interactions with one another, results in interesting bulk properties that would otherwise not exist. One example of a complex biological system is the bird flock, in particular, a starling murmuration. Starlings are known to move in the direction of their neighbors and avoid collisions with fellow starlings, but as a result of these simple movement choices, the flock as a whole tends to exhibit fluid-like movements and form …
Practical Chaos: Using Dynamical Systems To Encrypt Audio And Visual Data, Julia Ruiter
Practical Chaos: Using Dynamical Systems To Encrypt Audio And Visual Data, Julia Ruiter
Scripps Senior Theses
Although dynamical systems have a multitude of classical uses in physics and applied mathematics, new research in theoretical computer science shows that dynamical systems can also be used as a highly secure method of encrypting data. Properties of Lorenz and similar systems of equations yield chaotic outputs that are good at masking the underlying data both physically and mathematically. This paper aims to show how Lorenz systems may be used to encrypt text and image data, as well as provide a framework for how physical mechanisms may be built using these properties to transmit encrypted wave signals.
The Computational Study Of Fly Swarms & Complexity, Austin Bebee
The Computational Study Of Fly Swarms & Complexity, Austin Bebee
Senior Theses
A system is considered complex if it is composed of individual parts that abide by their own set of rules, while the system, as a whole, will produce non-deterministic properties. This prevents the behavior of such systems from being accurately predicted. The motivation for studying complexity spurs from the fact that it is a fundamental aspect of innumerable systems. Among complex systems, fly swarms are relatively simple, but even so they are still not well understood. In this research, several computational models were developed to assist with the understanding of fly swarms. These models were primarily analyzed by using the …
Neutrosophic Theory And Its Applications : Collected Papers - Vol. 1, Florentin Smarandache
Neutrosophic Theory And Its Applications : Collected Papers - Vol. 1, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
Neutrosophic Theory means Neutrosophy applied in many fields in order to solve problems related to indeterminacy. Neutrosophy is a new branch of philosophy that studies the origin, nature, and scope of neutralities, as well as their interactions with different ideational spectra. This theory considers every entity together with its opposite or negation and with their spectrum of neutralities in between them (i.e. entities supporting neither nor ). The and ideas together are referred to as . Neutrosophy is a generalization of Hegel's dialectics (the last one is based on and only). According to this theory every entity tends to be …
Nonlinear Dynamics In Combinatorial Games: Renormalizing Chomp, Eric J. Friedman, Adam S. Landsberg
Nonlinear Dynamics In Combinatorial Games: Renormalizing Chomp, Eric J. Friedman, Adam S. Landsberg
WM Keck Science Faculty Papers
We develop a new approach to combinatorial games that reveals connections between such games and some of the central ideas of nonlinear dynamics: scaling behaviors, complex dynamics and chaos, universality, and aggregation processes. We take as our model system the combinatorial game Chomp, which is one of the simplest in a class of "unsolved" combinatorial games that includes Chess, Checkers, and Go. We discover that the game possesses an underlying geometric structure that "grows" (reminiscent of crystal growth), and show how this growth can be analyzed using a renormalization procedure adapted from physics. In effect, this methodology allows one to …