Data Structures and Algorithms

1905 Submissions

[6] viXra:1905.0446 [pdf] submitted on 2019-05-22 10:20:18

Preliminary Study for Developing Instantaneous Quantum Computing Algorithms (Iqca)

Authors: Richard L Amoroso
Comments: 25 Pages. Preprint: IOP J Phys Conf Series 2019, R L Amoroso, D M Dubois, L H Kauffman, P Rowlands (eds) Advances in Fundamental Physics: Prelude to Paradigm Shift, 11th International Symposium Honoring Mathematical Physicist J-P Vigier, 2018 Liege, Belgium

Since the mid-1990s theoretical quadratic exponential and polynomial Quantum Computing (QC) speedup algorithms have been discussed. Recently the advent of relativistic information processing (RIP) introducing a relativistic qubit (r-qubit) with additional degrees of freedom beyond the current Hilbert space Bloch 2-sphere qubit formalism extended theory has appeared. In this work a penultimate form of QC speedup – Instantaneous Quantum Computing Algorithms (IQCA) is proposed. Discussion exists on passing beyond the quantum limits of locality and unitarity heretofore restricting the evolution of quantum systems to the standard Copenhagen Interpretation. In that respect as introduced in prior work an ontological-phase topological QC avails itself of extended modeling. As well-known by EPR experiments instantaneous connectivity exists inherently in the nonlocal arena. As our starting point we utilize Bohm’s super-implicate order where inside a wave packet a super-quantum potential introduces nonlocal connectivity. Additionally EPR experiments entangle simultaneously emitted photon pairs by parametric down-conversion. Operating an IQCA requires a parametric up-conversion cycle an M-Theoretic Unified Field Mechanical (MUFM) set of topological transformations beyond the current Galilean Lorentz-Poincairé transforms of the standard model (SM). Yang- Mills Kaluza-Klein (YM-KK) correspondence is shown to provide a path beyond the semi-quantum limit to realize the local-nonlocal duality required to implement IQCA.
Category: Data Structures and Algorithms

[5] viXra:1905.0260 [pdf] submitted on 2019-05-16 06:45:34

Lucidity Yellowpaper

Authors: Miguel Morales
Comments: 34 Pages.

In this paper we present an implementation of a trustless system of measurement and enforcement of advertising metrics. Specifically, our implementation uses a sidechain composed of a decentralized consortium of verifiers. This implementation provides a decentralized and democratically governed mechanism for the codification of measurement standards. This implementation enforces the standards for computing advertising metrics based on signals received from disconnected programmatic supply chain participants. A simple standard could be codified that enforces the computation of an attribution. It also enables a mechanism in which supply-chain participants may be paid using cryptocurrency safely and at scale. Thus, the system we describe implements the trifecta of blockchain-based tracking and billing of programmatic advertising: campaign insertion orders, supply-chain transparency, and payments. In this paper, we will describe the management of participant identities, a Plasma based sidechain architecture, and support for payments. We also describe a Proof-of-Stake consensus along with a rewards and penalties system used to perpetually incentivize and enforce the correct function of the network.
Category: Data Structures and Algorithms

[4] viXra:1905.0194 [pdf] submitted on 2019-05-13 12:12:22

Whitepaper V.1.2

Authors: Lucidity
Comments: 17 Pages.

The digital advertising ecosystem isn’t in a great place. While growth in digital is booming, the most essential members of the ecosystem (namely advertisers and publishers) are frustrated and powerless in the face of an increasingly apparent reality: digital advertising has a transparency problem. In an age where measuring the performance of ad campaigns is paramount, marketers are unable to fully understand the value they deliver. As has become true for most industries, data is the key to measuring performance. But in advertising, data is trapped and siloed in black box technologies, causing data disagreements and opening the door for fraudulent activities. The end result? Waste. Wasted money. Wasted time. Lucidity has built a blockchain-based solution (with five patents filed) that solves these issues. We provide advertisers with a unified set of data, free of discrepancies and fraud, that they can use to gauge their effectiveness. We provide publishers with a way to prove the value of their inventory and avoid identity theft. And we’ve built the only advertising focused blockchain technology to-date that doesn’t require advertisers and agencies to change their work flow or set up integrations. In the following whitepaper, we will outline in detail the problems we’re solving, how we solve it, and the team that’s bringing it all together.
Category: Data Structures and Algorithms

[3] viXra:1905.0186 [pdf] submitted on 2019-05-14 01:50:58

DNA Sequencing Informatics Framework Using [CoqTP/q*cert/CRSX-HACS/Java/Ocaml/JikesRVM/(RVM-Research Virtual Machine)] in the Context of [IoT/HPC/Cloud Computing/JIProlog/Owl] Hi-End Complex Environments

Authors: Nirmal Tej Kumar
Comments: 6 Pages. Short Communication

DNA Sequencing Informatics Framework Using [CoqTP/q*cert/CRSX-HACS/Java/Ocaml/JikesRVM/(RVM-Research Virtual Machine)] in the Context of [IoT/HPC/Cloud Computing/JIProlog/Owl] Hi-End Complex Environments – An Interesting insight into the Technically Challenging R&D domains involving Nano-Bio Systems. [ Towards AI/ML/DL based Interfacing of Engineering/Physics/Biology/Medicine Domain Platforms ]
Category: Data Structures and Algorithms

[2] viXra:1905.0126 [pdf] submitted on 2019-05-08 22:21:53

[coqtp-Q*cert-Ocaml-Fortran-Simple] Image Processing Software Based Informatics Framework for Electron Microscopy(em) Images – a Novel Suggestion to Interface Fortran with Ocaml in the Context of Cryo-em Image Processing Tasks.

Authors: Nirmal Tej Kumar
Comments: 4 Pages. Short Communication on Fortran & Ocaml

[CoqTP-q*cert-Ocaml-Fortran-SIMPLE] Image Processing Software based Informatics Framework for Electron Microscopy(EM) Images – A Novel Suggestion to interface Fortran with Ocaml in the Context of cryo-EM Image Processing Tasks. [ Exploring Theorem Proving & Ocaml - Fortran Interfacing & Image Processing ]
Category: Data Structures and Algorithms

[1] viXra:1905.0028 [pdf] submitted on 2019-05-03 04:10:04

The Neglected Challenge for Practitioners to Practice Requirement Prioritization Methods

Authors: Ji Yuan
Comments: 99 Pages.

Background: Though the academic has been studying the requirement prioritization methodology, the industry still encounters challenges of the requirement prioritization in real world. Most academic models only study requirement prioritization under some limited contexts. Unexpected factors induce the challenges when practicing a requirement prioritization method. Objectives: The objective of this study is to find what challenges to practice requirement prioritization methodologies commonly need to be improved or have been neglected. Methods: We used systematic mapping study and interview-based survey. The systematic mapping study conducts the overview and generalization on the present requirement prioritization techniques in the academic. The survey does the interview on the actual status of practicing requirement prioritization in real world. The data of both methods is qualitatively analyzed by thematic analysis. Results: Through the systematic mapping study on 17 articles, we found some characters common in the design of the academic requirement prioritization models, about the usual workflow step, advantage and limitation. Then through the survey with 14 interviewees, we studied what method the practitioner is most using and what challenge exists to practice the requirement prioritization in real world, mainly related to the workflow and limitation of these practical methods. Finally, based on the contrast of results above, we find what challenge for practitioners between the academic and practical methods worth to be improved or studied further. Besides, according to the acquired empirical insights, we proposed some potential future trends. Conclusions: This study elicited the challenges and insights to practice requirement prioritization methods, which brings the value to inspire the industry for designing and applying more productive requirement prioritization method. Besides, based on the empirical result, we proposed 2 new definition (Practicable Requirement Prioritization Engineering and Modularized Requirement Prioritization Model) and 1 potential situation (Requirement Prioritization of Compounded-Business Software) worth to be studied for the future trend.
Category: Data Structures and Algorithms