Data Structures and Algorithms

1712 Submissions

[7] viXra:1712.0587 [pdf] submitted on 2017-12-23 16:09:27

Kalman Folding 5.5: EKF in Python with System Identification

Authors: Brian Beckman
Comments: 31 Pages. Creative Commons 4.0 license: https://creativecommons.org/licenses/by/4.0/

Kalman Folding 5 presents an Extended Kalman Filter in Mathematica. Python is much more accessible to average practitioners. In this follow-up article, we write a very general, foldable EKF in Python, verify it against Mathematica using sympy, Python's package for symbolic mathematics. We apply it to a spinning dashpot and demonstrate both state estimation and system identification from observing only one angle over time. It is remarkable that a complete dynamical description of eight states and parameters can be recovered from measurements of a single, scalar value.
Category: Data Structures and Algorithms

[6] viXra:1712.0528 [pdf] submitted on 2017-12-21 01:38:25

A Simple Introduction to Karmarkar's Algorithm for Linear Programming

Authors: Sanjeev Saxena
Comments: 11 Pages.

An extremely simple, description of Karmarkar's algorithm with very few technical terms is given.
Category: Data Structures and Algorithms

[5] viXra:1712.0510 [pdf] submitted on 2017-12-20 04:40:22

Intercepting a Stealthy Network

Authors: Mai Ben-Adar Bessos, Amir Herzberg
Comments: 18 Pages.

We investigate a new threat: networks of stealthy routers (S-Routers), communicating across a restricted area. The ‘classical’ approach of transmission-detection by triangulation fails, since S-Routers use short-range, low-energy communication, detectable only by nearby devices. We investigate algorithms to intercept S-Routers, using one or more mobile devices, called Interceptors. Given a source of communication, Interceptors find the destination, by intercepting packet-relaying by S-Routers along the path. We evaluate the algorithms analytically and experimentally (simulations), including against a parametric, optimized S-Routers algorithm. Our main result is a (centralized) Interceptors algorithm bounding the outcome to O(Nlog^2(N), where N is the number of S-Routers. We later improve the bound to O(Nlog(N)log(log(N))), for the case where the transmission schedule of the S-Routers is continuous.
Category: Data Structures and Algorithms

[4] viXra:1712.0407 [pdf] replaced on 2017-12-28 01:10:10

Ellipsoid Method for Linear Programming Made Simple

Authors: Sanjeev Saxena
Comments: 8 Pages. Minor corrections

In this paper, ellipsoid method for linear programming is derived using only minimal knowledge of algebra and matrices. Unfortunately, most authors first describe the algorithm, then later prove its correctness, which requires a good knowledge of linear algebra.
Category: Data Structures and Algorithms

[3] viXra:1712.0374 [pdf] submitted on 2017-12-09 10:21:20

Proposal for a New Architecture for Anonymous Peer to Peer Networks

Authors: Steven David Young
Comments: 16 Pages. A proposal to Improve Tor Hidden Services

A system that incorporates distributed means of communication as well as steganographic storage techniques while remaining as similar as possible to an existing trusted platform such as Tor could provide a model for a next generation anonymous communication system that is less susceptible to common vulnerabilities, such as an adversarial Global Network Observer.
Category: Data Structures and Algorithms

[2] viXra:1712.0137 [pdf] submitted on 2017-12-05 14:10:05

Neoplexus – Developing a Heterogeneous Computer Architecture Suitable for Extreme Complex Systems

Authors: M. J. Dudziak, M. Tsepeleva
Comments: 6 Pages. submitted to CoDIT 2018 *Theassaloniki, Greece, April, 2018)

NeoPlexus is a newly established permanent program of international collaborative scientific research and application development. It is focused upon the design, construction and application of a new architecture and family of computing machines that are adept at solving problems of control involving extreme complex systems (XCS) for which conventional numerical computing methods and machines are fundamentally inadequate. The GCM involves a different foundation of computing from classical Turing Machines including qubit-based quantum computers and it incorporates geometrical and specifically topological dynamics. The target for implementation is to construct molecular-scale platform using protein-polymer conjugates and MEMS-type microfluidics.
Category: Data Structures and Algorithms

[1] viXra:1712.0081 [pdf] submitted on 2017-12-04 07:40:22

The Mathematics of Eating

Authors: Timothy W. Jones
Comments: 19 Pages.

Using simple arithmetic of the prime numbers, a model of nutritional content of food need and content is created. This model allows for the dynamics of natural languages to be specified as a game theoretical construct. The goal of this model is to evolve human culture.
Category: Data Structures and Algorithms