Data Structures and Algorithms

2211 Submissions

[5] viXra:2211.0150 [pdf] submitted on 2022-11-25 23:48:50

Super Cloud or Meta Cloud: A Problematic Approach

Authors: Stephane H. Maes
Comments: 8 Pages.

Over the last year, several vendors and evangelist have taken on to promote, and push, super clouds, also known as meta clouds, as the future of cloud computing, or at least a latest trends.It is not clear that it is an actual trend yet, or just the pe project of a few. Part of the problems that we see with super clouds may come from shifting all-encompassing definitions, which can mean whatever you want them to mean.In any case we argue that such a super cloud, as an abstract layer across clouds, may be a problematic approach, from a business viability, architecture and efficiency point of view. Using management tools and practices for multi cloud, hybrid cloud and developing cloud native applications is a better approach, with more manageable challenges.
Category: Data Structures and Algorithms

[4] viXra:2211.0097 [pdf] submitted on 2022-11-17 03:22:16

Algebraic Programming Language

Authors: Sing Kuang Tan
Comments: 12 Pages.

In this paper, I am going to propose a new programming language in mathematical algebraic form. Represent all algorithms in canonical form, that is easy to read, analyze and communicate with other people. Loop invariant, preconditions, post conditions are difficult to use. It can use to derive all properties of algorithms. It can be fed into computer to analyze and manipulate symbolically. Analyze an algorithm sequentially cannot see global pattern in the algorithms, and this is not a long term solution.
Category: Data Structures and Algorithms

[3] viXra:2211.0085 [pdf] submitted on 2022-11-14 03:13:23

Novel Transcendental Encryption Algorithm Using BBP Formula

Authors: Alex-Pauline Poudade
Comments: 7 Pages.

This paper discusses a new way to encrypt data using transcendental properties discovered through mathematical Bailey—Borwein—Plouffe formula (BBP). In regard to pseudo-stochastic computer methods, it enables a stronger non-linear model close to True number generators (TRNG) resistance without need for physical prior transmissions of initial stochastic patterns. Soleau envelope European deposit number: DSO2017001085 - deposit reference 260819711812005332017 National Institute of Industrial Property (INPI) February 2, 2017 Supplemental Code/Data: doi.org/10.7910/DVN/CCJMAP
Category: Data Structures and Algorithms

[2] viXra:2211.0072 [pdf] submitted on 2022-11-11 10:17:34

Subset Construction is P-complete

Authors: Mirzakhmet Syzdykov
Comments: 1 Page.

In this work the experimental results along with proof are presented: the state explosion doesn’t occur in specific cases after decomposition of regular expression into non-deterministic finite automata (NFA), thus, the P-complete procedure to take turn for converting NFA into deterministic finite automaton (DFA) with respect to the De Morgan Law
Category: Data Structures and Algorithms

[1] viXra:2211.0058 [pdf] submitted on 2022-11-11 01:53:46

P Versus NP for Algorithm Design and Evaluation

Authors: Mirzakhmet Syzdykov
Comments: 4 Pages.

We present the difference of the "P versus NP" problem for polynomial and non-polynomial classes on the example of two contest problems held by ACM ICPC NEERC in 2004 and 2005.
Category: Data Structures and Algorithms