| viXra.org > Data Structures and Algorithms > 2002 |
 |
 |
| viXra.org > Data Structures and Algorithms > 2002 |
|
|
[5] viXra:2002.0586 [pdf] submitted on 2020-02-29 03:13:54
Authors: Andrei Lucian Dragoi
Comments: (TFM - IOJD - version 1.1 - 27.08.2018 - 8 pages)
This paper presents a practical method of generation and implementation of a large number of interconnected online/offline JavaScript (JS) 2D databases (IOJDs), using a file manager-like software built with Microsoft Visual Basic 6 (VB6) for their creation and maintenance (including periodic updates). Both this simple tag(-based) file manager (TFM) and IOJDs have many possible applications including medical databases and website cloning (WSC). Keywords: JavaScript (JS), Visual Basic 6 (VB6), tag(-based) file manager (TFM), databases, interconnected online/offline JavaScript 2D databases (IOJDs), website cloning (WSC);
Category: Data Structures and Algorithms
[4] viXra:2002.0415 [pdf] submitted on 2020-02-21 14:15:48
Authors: Aditya Das, Rishab Bhattacharyya, Pramit Ghosh
Comments: 4 Pages. This article is under review at IEEE Letters of the Computer Society for publication
This work is a proposed architectural prototype in the field of High Performance Computing (HPC). Intel Altera DE4 and Altera DE5a - Net FPGA boards were used as functional processors in our designed system. We further explore Peripheral Component Interconnect (PCI) Express communication and amalgamate the transfer of data through PCIe to two different kinds of FPGAs at the same time using a proposed scheduling algorithm called TF-PSST : Time First Power Second Scheduling Technique. This significantly improves efficiency of the system by reducing execution time and because of the heterogeneous nature of the architectural prototype, we also found a way to increase the hardware resource utilisation.
Category: Data Structures and Algorithms
[3] viXra:2002.0367 [pdf] submitted on 2020-02-19 14:01:36
Authors: Armando Alaminos-Bouza
Comments: 14 Pages. associated source code in C (C99) is available upon request.
A simple and fast functional model is proposed to approximate energy loss distributions
of charged particles crossing slabs of matter. The most accepted physical models for treating this
problem was created by Landau and later improved by Vavilov. Both models depend on complex
functional forms with exact solutions that are, by far, too CPU intensive to be directly included in
existing Monte Carlo codes. Several authors have proposed approximations with varying degrees of
accuracy and performance. This paper presents a compact and efficient form that approximates
with enough accuracy the Vavilov distribution and its extreme cases of Landau and Gaussian
shapes. Our functional form could be interpreted as a generalization of the basic Gaussian
distribution. Some parameter fits are illustrated with various test cases. Our model also
represents a simple functional form to use for regression analysis with experimental energy loss
data.
Category: Data Structures and Algorithms
[2] viXra:2002.0186 [pdf] submitted on 2020-02-10 04:19:27
Authors: Siddhant Ray
Comments: 9 Pages.
Software Defined Networking (SDN) is a concept in the area of computer networks in which the control plane and data plane of traditional computer networks are separated as opposed to the mechanism in conventional routers and switches. SDN aims to provide a central control mechanism in the network through a controller known as the SDN Controller. The Controller then makes use of various southbound Application Programming Interfaces (APIs) to connect to the physical switches located on the network and pass on the control information, which used to program the data plane. SDN Controller also exposes several northbound APIs to connect to the applications which can leverage the controller to orchestrate the network. The controller used with regard to this paper is the Open Network Operating System (ONOS), on which the algorithm in question is to be deployed. ONOS provides several APIs which is leveraged to connect the application to the network devices. The typical network path between any two endpoints is a shortest path fulfilling a set of constraints. The algorithm developed here is for optimal K-Shortest path searching in a given network satisfying specified constraints, controlled by ONOS.
Category: Data Structures and Algorithms
[1] viXra:2002.0183 [pdf] replaced on 2020-03-09 08:48:47
Authors: Jason Reaves
Comments: 15 Pages.
Obfuscation in malware is commonly employed for any number of reasons but it’s purpose is ultimately the same, to make the underlying malicious entity go unnoticed. Crypters and Packers both are heavily employed to bypass common security measures so ultimately these are just tools. Tools that are utilizing algorithms in order to take data and turn it into some other data while being able to reverse the process later, obviously these reversible algorithms can be chained together as well into ‘layers’. In this paper I explore the idea that it is easier to think of these layers as a math equation which can be solved. This has the potential of turning something that can be overwhelming at first, like writing an unpacker, into a much more manageable problem.
Category: Data Structures and Algorithms
| Third-Party Links: |
|