Data Structures and Algorithms

1902 Submissions

[7] viXra:1902.0484 [pdf] submitted on 2019-02-27 10:26:48

Shox96 - Guaranteed Compression for Short Strings

Authors: Arundale R., Charumathi A., Harsha N.
Comments: 12 Pages.

None of the lossless entropy encoding methods so far have addressed compression of small strings of arbitrary lengths. Although it appears inconsequent, space occupied by several independent small strings become significant in memory constrained environments. It is also significant when attempting efficient storage of such small strings in a database where while block compression is most efficient, retrieval efficiency could be improved if the strings are individually compressed. This paper formulates a hybrid encoding method with which small strings could be compressed using context aware static codes resulting in surprisingly good ratios and also be used in constrained environments like Arduino. We also go on to prove that this technique can guarantee compression for any English language sentence of minimum 3 words.
Category: Data Structures and Algorithms

[6] viXra:1902.0434 [pdf] submitted on 2019-02-25 18:28:09

Elastic Blockchain: A Solution for Massive Internet Service Abuse

Authors: Junhao Li
Comments: 2 Pages. Apparently, arxiv moderators do not like ideas which make their own research useless.

Internet service abuse is a significant threat for service providers, internet users, and even national security. In this short article, I present elastic blockchain, an architecture for solving massive internet abuse. For webmasters, elastic blockchain lowers the cost of service abuse prevention and may even benefit from service abuse. For regular users, it provides a more user-friendly way to prove their goodwill than doing Turing tests. For attackers and water armies, it increases their cost of attacks dramatically, so they are less likely to do that.
Category: Data Structures and Algorithms

[5] viXra:1902.0380 [pdf] replaced on 2019-03-19 11:12:51

It is Easier to Verify the Solution Than to Find it

Authors: Valdir Monteiro dos Santos Godoi
Comments: 10 Pages. In portuguese.

Introducing the concepts of variable languages and languages with semantic we presented an original proof of the famous P versus NP problem of Computer Science. This proof don't implies that the NP-complete problems not belongs to P, so the P versus NP-complete problem remains open, as well as it is possible (perhaps) to solve the SAT problem in polynomial time.
Category: Data Structures and Algorithms

[4] viXra:1902.0296 [pdf] submitted on 2019-02-18 00:54:16

Moea Framework Interaction with Bio-CPP in the Context of Nucleic Acids/polypeptide Bio-Informatics & Computing Towards Using – Java/jvm/jikes Rvm/c++/genetic Algorithms.

Authors: DNT Kumar
Comments: 3 Pages. Short Communication & Technical Notes

MOEA Framework interaction with Bio-CPP in the context of Nucleic Acids/Polypeptide Bio-Informatics & Computing towards Using – Java/JVM/Jikes RVM/C++/Genetic Algorithms.
Category: Data Structures and Algorithms

[3] viXra:1902.0293 [pdf] submitted on 2019-02-16 07:20:31

Defend Against Cyberattacks

Authors: George Rajna
Comments: 66 Pages.

The deluge of cyberattacks sweeping across the world has governments and companies thinking about new ways to protect their digital systems, and the corporate and state secrets stored within. [42] The Pentagon on Friday said there has been a cyber breach of Defense Department travel records that compromised the personal information and credit card data of U.S. military and civilian personnel. [41] Quantum secure direct communication transmits secret information directly without encryption. [40]
Category: Data Structures and Algorithms

[2] viXra:1902.0184 [pdf] replaced on 2019-02-11 16:18:47

Computation, Complexity, and P!=NP Proof

Authors: Hugh Wang
Comments: 2 Pages.

If we refer to a string for Turing machines as a guess and a rejectable substring a flaw, then all algorithms reject similarly flawed guesses flaw by flaw until they chance on an unflawed guess, settle with a flawed guess, or return the unflawed guesses. Deterministic algorithms therefore must identify all flaws before guessing flawlessly in the worst case. Time complexity is then bounded below by the order of the product of the least number of flaws to cover all flawed guesses and the least time to identify a flaw. Since there exists 3-SAT problems with an exponential number of flaws, 3-SAT is not in P, and therefore P!=NP.
Category: Data Structures and Algorithms

[1] viXra:1902.0134 [pdf] submitted on 2019-02-08 04:39:01

Protein Folding Mechanisms – An Introduction & Novel Suggestion based on Dijkstra’s Algorithm.

Authors: DNTKumar
Comments: 3 Pages. Short Communication & Technical Notes

Protein Folding Mechanisms – An Introduction & Novel Suggestion based on Dijkstra’s Algorithm.
Category: Data Structures and Algorithms