Data Structures and Algorithms

1710 Submissions

[4] viXra:1710.0266 [pdf] submitted on 2017-10-23 06:45:18

Languages Varying in Time and the P X NP Problem (Better Translation)

Authors: Valdir Monteiro dos Santos Godoi
Comments: 8 Pages. In english and portuguese. A better translation of the my article published at Transactions on Mathematics (TM) Vol. 3, No. 1, January 2017, pp. 34-37.

An original proof of P is not equal to NP.
Category: Data Structures and Algorithms

[3] viXra:1710.0201 [pdf] submitted on 2017-10-15 11:44:37

Automatic Intelligent Translation of Videos

Authors: Shivam Bansal
Comments: 8 Pages.

There are a lot of educational videos online which are in English and inaccessible to 80% population of the world. This paper presents a process to translate a video into another language by creating its transcript and using TTS to produce synthesized fragments of speech. It introduces an algorithm which synthesyses intelligent, synchronized, and easily understandable audio by combining those fragments of speech. This algorithm is also compared to an algorithm from another research paper on the basis of performance.
Category: Data Structures and Algorithms

[2] viXra:1710.0104 [pdf] submitted on 2017-10-09 12:57:09

Polynomial-time Integer Factorization Algorithms

Authors: Yuly Shipilevsky
Comments: 11 Pages.

polynomial-time algorithm for integer factorization, wherein integer factorization reduced to a polynomial-time integer minimization problem over the integer points in a two-dimensional rational polyhedron with conclusion that P = NP and a polynomial-time algorithm for integer factorization using enumeration of vertices of integer hull of those two-dimensional rational polyhedron
Category: Data Structures and Algorithms

[1] viXra:1710.0101 [pdf] submitted on 2017-10-09 16:11:25

SOPE: A Spatial Order Preserving Encryption Model for Multi-dimensional Data

Authors: Eirini Molla, Theodoros Tzouramanis, Stefanos Gritzalis
Comments: 24 Pages. 37 figures, 2 tables, 60 references

Due to the increasing demand for cloud services and the threat of privacy invasion, the user is suggested to encrypt the data before it is outsourced to the remote server. The safe storage and efficient retrieval of d-dimensional data on an untrusted server has therefore crucial importance. The paper proposes a new encryption model which offers spatial order-preservation for d-dimensional data (SOPE model). The paper studies the operations for the construction of the encrypted database and suggests algorithms that exploit unique properties that this new model offers for the efficient execution of a whole range of well-known queries over the encrypted d-dimensional data. The new model utilizes wellknown database indices, such as the B+-tree and the R-tree, as backbone structures in their traditional form, as it suggests no modifications to them for loading the data and for the efficient execution of the supporting query algorithms. An extensive experimental study that is also presented in the paper indicates the effectiveness and practicability of the proposed encryption model for real-life d-dimensional data applications.
Category: Data Structures and Algorithms