Data Structures and Algorithms

1911 Submissions

[5] viXra:1911.0218 [pdf] submitted on 2019-11-12 00:37:42

Exploring [ C/C++/Bio-C++ ] based Bio-informatics R&D Framework Using [ XNA- Xeno Nucleic Acids/ Machine Learning/Minsky Machines/Group Theory/Grobner Bases.]

Authors: Nirmal Tej Kumar
Comments: 4 Pages. Short Communication & Technical Notes

[ BioCPP Computational Libraries/dlibC++( Machine Learning-Library)/Group Theory/Grobner Bases ] interaction With C++ based Template Turing Machine w.r.t Minsky Machines in the Context of XNA Sequencing Mechanisms – A Simple Idea to Test Minsky Machines.We intend to explore Synthetic Biology Theoretically.Hence,this Short communication on Synthetic Biology R&D.To understand XNA related mechanisms like Sequencing we are also using/considering Minksy Machines for better Bio-informatics Applications.
Category: Data Structures and Algorithms

[4] viXra:1911.0157 [pdf] submitted on 2019-11-08 12:44:42

Solving the Container Shipment Problem with the Focus on Special Goods (Dangerous and Fragile) Using Genetic Algorithms

Authors: Walter Zimmer, Carsten Mueller
Comments: 8 Pages.

An optimum usage of the shipping space is calculated using genetic algorithms. The objective of the optimization is the maximization of loaded container of type dangerous and the minimization of the unused shipping space. The minimization of the unused shipping space has to be preferred against the maximization of the loaded container of type dangerous. Statistical evalutations were done and the usage of various parameters was analysed.
Category: Data Structures and Algorithms

[3] viXra:1911.0139 [pdf] submitted on 2019-11-08 09:33:49

Monte Carlo based Algorithm for Scoring Grid Systems

Authors: Syed Haseeb Shah
Comments: 3 Pages.

We evaluate Monte Carlo based algorithm for scoring grid systems. The former were used to describe features of the area under study. This was done to select suitable features for City Information Modelling. These algorithms measures path of shortest distance. However, shortest distance does not always ensures shortest time. The algorithm works by pairing multiple iterations of two random numbers in a polygon. The mean of shortest path between these points is calculated. Thus grid systems with shorter paths will return a lower value as compared to grid systems with longer paths. This was applied to GIS systems in urban planning to rate the feasibility of different grid systems. It is a heuristic algorithm that tells us to about the nature of grid system. Instead of measuring the geometry of every path in a grid it eases the workflow of an urban planner by automation.
Category: Data Structures and Algorithms

[2] viXra:1911.0127 [pdf] submitted on 2019-11-07 02:38:29

Robust Quaternion Estimation with Geometric Algebra

Authors: Mauricio Cele Lopez Belon
Comments: 11 Pages. Submitted to Advances in Applied Clifford Algebras

Robust methods for finding the best rotation aligning two sets of corresponding vectors are formulated in the linear algebra framework, using tools like the SVD for polar decomposition or QR for finding eigenvectors. Those are well established numerical algorithms which on the other hand are iterative and computationally expensive. Recently, closed form solutions has been proposed in the quaternion’s framework, those methods are fast but they have singularities i.e., they completely fail on certain input data. In this paper we propose a robust attitude estimator based on a formulation of the problem in Geometric Algebra. We find the optimal eigen-quaternion in closed form with high accuracy and with competitive performance respect to the fastest methods reported in literature.
Category: Data Structures and Algorithms

[1] viXra:1911.0038 [pdf] submitted on 2019-11-03 15:17:15

Building and Visualizing Datasets of a Single Variable (Heart Rate)

Authors: Neel Adwani
Comments: 4 Pages.

Datasets are of great use in the fields like Machine Learning, Data Science, Data Analytics, etc. To solve the problem of Data unavailability, Data sets can be generated with the help of required sensors and that data can even be visualized. Visualization might be necessary to filter or sort out the inaccurate data, which might interfere with the Algorithm used.
Category: Data Structures and Algorithms