Data Structures and Algorithms

1903 Submissions

[11] viXra:1903.0435 [pdf] submitted on 2019-03-24 09:14:53

Tool Boxes with Heavyweight Data

Authors: George Rajna
Comments: 67 Pages.

A free, open-source toolkit to help researchers deal with data management overload has been devised by the John Innes Centre Informatics team. [43] A new computer program that spots when information in a quantum computer is escaping to unwanted states will give users of this promising technology the ability to check its reliability without any technical knowledge for the first time. [42] With enhanced understanding of this system, the Quantum Dynamics Unit aims to improve upon the industry standard for qubits – bits of quantum information. [41]
Category: Data Structures and Algorithms

[10] viXra:1903.0391 [pdf] submitted on 2019-03-21 21:57:39

[Dlang+Ragel State Machine Compiler+Colm] Based Design of Embedded Systems & Bio-informatics in the Context of IoT/HPC for Hi-end Computational Environment/s – An Insight into Probing Intelligent Embedded Systems and Intelligent Bio-informatics Framework

Authors: Nirmal Tej Kumar
Comments: 2 Pages. Short Technical Notes

[Dlang+Ragel State Machine Compiler+Colm] Based Design of Embedded Systems & Bio-informatics in the Context of IoT/HPC for Hi-end Computational Environment/s – An Insight into Probing Intelligent Embedded Systems and Intelligent Bio-informatics Frameworks.
Category: Data Structures and Algorithms

[9] viXra:1903.0354 [pdf] submitted on 2019-03-19 12:18:27

Data Formats and Visual Tools for Forecast Evaluation

Authors: Andrey Davydenko, Cuong Sai, Maxim Shcherbakov
Comments: 16 Pages.

Forecast evaluation is inevitably connected with the need to store actuals and forecasts for further analysis. The issue gets complicated when it comes to handling rolling-origin forecasts calculated for many series over multiple horizons. In designing forecast data formats it is important to provide access to all the variables required for exploratory analysis and performance measurement. We show that existing approaches used to store forecast data are not always applicable for implementing reliable cross validation techniques. Here we propose flexible yet simple data schemas allowing the storage and exchange of actuals, forecasts, and additional variables of interest. We also demonstrate how various forecast evaluation tools can be implemented based on the schemas proposed.
Category: Data Structures and Algorithms

[8] viXra:1903.0316 [pdf] submitted on 2019-03-18 00:08:43

Revisiting Mathematical Formalism Involving [Lp Spaces] in the Context of Microwave Imaging for [medical Applications/cryoelectronmicroscopy] – Using [higher Order Logic(hol)/scala/jvm/jikesrvm/scalalab/lms-Scala Informatics] to Implement [iot/hpc] Compu

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

Revisiting Mathematical Formalism involving [Lp Spaces] in the Context of Microwave Imaging for [Medical applications/CryoElectronMicroscopy] – Using [Higher Order Logic(HOL)/Scala/JVM/JikesRVM/Scalalab/LMS-Scala Informatics] to Implement [IoT/HPC] Computing Framework/s.
Category: Data Structures and Algorithms

[7] viXra:1903.0256 [pdf] replaced on 2019-05-03 16:11:44

A New Algebraic Approach to the Graph Isomorphism and Clique Problems

Authors: Roman Galay
Comments: 14 Pages. roman.galay.2019@gmail.com

As it follows from Gödel's incompleteness theorems, any consistent formal system of axioms and rules of inference should imply a true unprovable statement. Actually this fundamental principle can be efficiently applicable in Computational Mathematics and Complexity Theory concerning the computational complexity of problems from the class NP, particularly and especially the NP-complete ones. While there is a wide set of algorithms for these problems that we call heuristic, the correctness or/and complexity of each concrete algorithm (or the probability of its correct and polynomial-time work) on a class of instances is often too difficult to determine, although we may also assume the existence of a variety of algorithms for NP-complete problems that are both correct and polynomial-time on all the instances from a given class (where the given problem remains NP-complete), but whose correctness or/and polynomial-time complexity on the class is impossible to prove as an example for Gödel's theorems. However, supposedly such algorithms should possess a certain complicatedness of processing the input data and treat it in a certain algebraically “entangled” manner. The same algorithmic analysis in fact concerns all the other significant problems and subclasses of NP, such as the graph isomorphism problem and its associated complexity class GI. The following short article offers a couple of algebraically entangled polynomial-time algorithms for the graph isomorphism and clique problems whose correctness is yet to be determined either empirically or through attempting to find proofs. Besides, the paper contains a description of an equation system for elements of a set of groups (which can also be interpreted as an algebraic equation system) that can be polynomial-time reduced to a graph isomorphism problem and, in the same time, is a non-linear extension of a system of modular linear equations where each equation has its own modulus (hence implying the question whether it’s NP-complete).
Category: Data Structures and Algorithms

[6] viXra:1903.0249 [pdf] submitted on 2019-03-13 23:19:02

An Insight Into Antlr(antlr)/jedit/netbeans/eclipse/java/jvm/jikesrvm/osgi as Bioinformatics Platform in the Context of Dna/rna Sequencing & Gene Chip Design – a Simple & Interesting Suggestion Towards Interfacing Nano-Bio Systems /iot Hardware & Software

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

An Insight into ANTLR(antlr)/jEdit/NetBeans/Eclipse/Java/JVM/JikesRVM/OSGi as Bioinformatics Platform in the Context of DNA/RNA Sequencing & Gene Chip Design – A Simple & Interesting Suggestion towards Interfacing Nano-Bio Systems/IoT Hardware & Software/HPC Environments.
Category: Data Structures and Algorithms

[5] viXra:1903.0204 [pdf] submitted on 2019-03-11 22:56:28

An Insight Into Theoretical Analysis of Gene Therapy Using Coq Theorem Prover[ctp] – a Simple Computing Framework on [molecular/bio-Molecular Systems,bio-Informatics + Spectroscopy] to Probe Gene Therapy in the Context of Group Theory.

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

An Insight into Theoretical Analysis of Gene Therapy using Coq Theorem Prover[CTP] – A Simple Computing Framework on -[Molecular/Bio-molecular Systems,Bio-informatics + Spectroscopy] to Probe Gene Therapy in the context of Group Theory.
Category: Data Structures and Algorithms

[4] viXra:1903.0170 [pdf] submitted on 2019-03-09 09:09:58

Cryptographic Key Generation

Authors: George Rajna
Comments: 71 Pages.

Cryptography is often used in information technology security environments to protect sensitive, high-value data that might be compromised during transmission or while in storage. [41] In a step forward for information security for the Internet of Things, a team of researchers has published a new paper in the online edition of Nano Letters in which they have engineered a new type of physically unclonable function (PUF) based on interfacial magnetic anisotropy energy (IAE). [40] Researchers from Linköping University and the Royal Institute of Technology in Sweden have proposed a new device concept that can efficiently transfer the information carried by electron spin to light at room temperature-a stepping stone toward future information technology. [39] Now writing in Light Science & Applications, Hamidreza Siampour and co-workers have taken a step forward in the field of integrated quantum plasmonics by demonstrating on-chip coupling between a single photon source and plasmonic waveguide. [38] Researchers at University of Utah Health developed a proof-of-concept technology using nanoparticles that could offer a new approach for oral medications. [37] Using scanning tunneling microscopy (STM), extremely high resolution imaging of the molecule-covered surface structures of silver nanoparticles is possible, even down to the recognition of individual parts of the molecules protecting the surface. [36] A fiber optic sensing system developed by researchers in China and Canada can peer inside supercapacitors and batteries to observe their state of charge. [35] The idea of using a sound wave in optical fibers initially came from the team's partner researchers at Bar-Ilan University in Israel. Joint research projects should follow. [34] Researchers at the Technion-Israel Institute of Technology have constructed a first-of-its-kind optic isolator based on resonance of light waves on a rapidly rotating glass sphere. [33]
Category: Data Structures and Algorithms

[3] viXra:1903.0105 [pdf] submitted on 2019-03-06 22:12:54

Exploring & Examining Cryo-EM Images in the Context of Helical Protein Polymers/Bio-Polymers for Helical Reconstructions Using Ruby Language/Machine Learning/Image Processing/ruby-LLVM Informatics Framework.

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

Exploring & Examining Cryo-EM Images in the Context of Helical Protein Polymers/Bio-Polymers for Helical Reconstructions Using Ruby Language/Machine Learning/Image Processing/ruby-LLVM Informatics Framework.
Category: Data Structures and Algorithms

[2] viXra:1903.0101 [pdf] submitted on 2019-03-07 05:27:25

Wormhole Attacks as Security Risk in Wireless Sensor Networks and Countermeasures of RPL

Authors: Marco Mühl
Comments: 5 Pages. In German

Security is a big topic for basically every network. Attackers are consistently improving their methods and should always be considered a big threat. Especially in Wireless Sensor Networks (WSN) it is important to find countermeasures. But often this is a big challenge: Finding the right balance between security, effort, performance and cost is not easy. In this paper it is shown, how the Routing Protocol for Low Power and Lossy Networks (RPL) can handle an often used attack on networks: the wormhole attack.
Category: Data Structures and Algorithms

[1] viXra:1903.0014 [pdf] replaced on 2019-03-19 11:15:07

It is Easier to Verify the Solution Than to Find it - II

Authors: Valdir Monteiro dos Santos Godoi
Comments: 14 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