[5] viXra:1901.0338 [pdf] submitted on 2019-01-23 02:34:03
Authors: Nirmal Tej Kumar
Comments: 3 Pages. Short Communication & Technical Notes
An Interesting Insight & Interaction of Q*cert With BaseX Data Base System in the Context of BIG-DATA Based on - High Volume Data Querying,Informatics & Computing.
Category: Data Structures and Algorithms
[4] viXra:1901.0239 [pdf] submitted on 2019-01-17 03:37:17
Authors: Chandrima Chowdhury
Comments: 76 Pages.
In this project, an Excel based automated tool has been developed which extensively uses D3.Js, R, Excel VBA and Phantom JS to provide an integrated application that automatically fetches the data from the web and develops models, creates interactive hovering data label D3 charts on excel and also tests the accuracy of the predictions just at the click of a button. Though the models are very basic, the automation mechanism is effective and can be used by people who still want to rely on basic excel apps for stock data analytics.
A demo of the tool is available here: https://youtu.be/VBx7Ik6aw7c
Category: Data Structures and Algorithms
[3] viXra:1901.0177 [pdf] submitted on 2019-01-12 23:06:16
Authors: D.N.T.Kumar
Comments: 3 Pages. Short Technical Notes
Q*cert – CoqTheoremProver[CTP]/OCaml as
Bio-informatics Platform in the Context of Understanding Protein Folding Mechanisms Based on General Purpose Libraries – A Simple Interesting Insight Into the Promising, Challenging & Interesting World of Protein Engineering and Applications.
Category: Data Structures and Algorithms
[2] viXra:1901.0157 [pdf] submitted on 2019-01-12 04:53:17
Authors: Nirmal Tej Kumar
Comments: 3 Pages. Short Communication & Technical Notes
Using Topology to Understand Protein Folding Mechanisms – An Approximate and Simple Suggestion in the Context of HOL/Scala/Java/JikesRVM/JVM.
[HOL – Higher Order Logic]
Category: Data Structures and Algorithms
[1] viXra:1901.0028 [pdf] replaced on 2019-01-23 15:02:23
Authors: Krystian Zawistowski
Comments: 6 Pages. fixed some typos
We propose an O(n log n) algorithm for evaluation of bivariate Kolmogorov- Smirnov statistics (n is number of samples). It offers few orders of magnitude of speedup over existing implementations for n > 100k samples of input. The algorithm is based on static Binary Search Trees and sweep algorithm. We share C++ implementation with Python bindings.
Category: Data Structures and Algorithms