
Andrew JonesUniversity of Chester | UC · Faculty of Science and Engineering
Andrew Jones
Master of Technology
Looking for collaborators, a new position, feedback or make a suggestion.
About
15
Publications
3,972
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
1
Citation
Introduction
Our "Eureka Moment" document introduces the "4D^4 TetraLogix" model, drawing from Newton's Cradle to envision a new data dynamics framework. It explores geometric scaling and the temporal evolution of computational models, promising advancements in AI, ML, and beyond. By mimicking energy transfer and conservation, it offers a fresh perspective on efficient data processing and machine learning enhancement. This model not only pushes theoretical boundaries but also has practical implications.
Publications
Publications (15)
"Unraveling the Complex Weave of Cybersecurity in Document Processing: A Comprehensive Exploration"
Embark on an enlightening journey into the heart of cybersecurity within document processing applications, where innovation meets vigilance in an ongoing battle against digital vulnerabilities. This extensive exploration delves into the intricacies...
This book synthesizes the central themes, narratives, and insights derived from the exploration of the historical and military legacies of ancient commanders. It particularly focuses on the Five Tiger Generals of ancient China, alongside other notable military figures such as Jiang Ziya, King Wu of Zhou, King Goujian of Yue, Sun Tzu, and Wu Qi. The...
Brief Summary This paper introduces a groundbreaking approach to data representation, extending the traditional binary bit into a dynamic four-dimensional model. Termed the 4D^4 Bit Model, it evolves from a simple binary state to a complex system encompassing spatial coordinates in base 60 and base 360, and temporal dimensions in base 8. This novel...
This document provides a comprehensive examination of ISO 9241-11:2018, which outlines guidelines for human-centred design in the development of interactive systems. Emphasizing the core objective of enhancing user experience, it delves into the multifaceted approach of the standard, underlining the importance of usability improvement and user invo...
This abstract discusses the use of various artificial intelligence techniques including neural networks, genetic algorithms, fuzzy systems, and swarm intelligence. Neural networks, inspired by the structure and function of the human brain, are used for tasks such as image and speech recognition. Genetic algorithms, inspired by the process of natura...
Computer Vision and Virtual Environments are two rapidly growing and evolving fields that have a significant impact on the way we interact with technology. Computer Vision is a subfield of Artificial Intelligence that focuses on enabling computers to interpret and understand visual information from the world around them. This is achieved through th...
The Traveling Salesman Problem (TSP) is a well-known problem in computational mathematics and computer science. It is an optimization problem that asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?"...
Particle Swarm Optimization (PSO) is a computational optimization technique that is based on the collective behaviour of particles in a swarm. The algorithm was first introduced in 1995 by James Kennedy and Russell Eberhart and has since been widely used in a variety of optimization problems. PSO algorithms are inspired by the social behaviour of b...
The subset sum problem is a problem in computer science where, given a set of integers and a target sum, you are asked to find a subset of the integers whose sum is equal to the target sum. This problem is NP-complete, which means that there is no known efficient algorithm to solve it for all possible inputs. However, it is possible to design appro...
import random def greedy_subset_sum(set, k): if not set: print("Error: set is empty") return if sum(set) % k != 0: print("Error: sum of set is not divisible by number of subsets") return # calculate the target sum value of subsets target_sum = sum(set) // k # sort the set in descending order set = sorted(set, reverse=True) subsets = [[] for _ in ra...
Robotic space exploration refers to the use of robots and other unmanned systems for the investigation and exploration of space. This field has a long history and has been instrumental in advancing our understanding of the universe and our place within it. The primary goals of robotic space exploration include studying the formation and evolution o...
Number of subsets k = 4 Target sum value of subsets = 255 the sum of the set divided by the number of subsets The subset sum problem is defined as follows: Given a set of integers and a target sum value, determine if there exists a subset of the given set that adds up to the target sum. A greedy heuristic algorithm A greedy algorithm is a simple, i...