Data Structures and Algorithms

1804 Submissions

[4] viXra:1804.0410 [pdf] submitted on 2018-04-28 04:57:56

Efficiently Solving Traveling Salesman Problem in a Computer Network. (Internet)

Authors: Oscar E. Chamizo Sánchez
Comments: 4 Pages.

Traveling salesman problem (TSP for short) is perhaps the most widely known and deeply investigated problem in computation. Given a set of cities, the simple goal is to find the cheapest way of visiting all cities and returning to the starting one. The optimal (in case of a simetric euclidean TSP the shortest) path from the starting city to itself through all the remaining cities is, in general, only one from the (n-1)!/2 set of possible tours or circuits. In our seminal paper A new approach: A hardware device model solving TSP in O(n2) time we presented a physically realizable computation model solving any instance of TSP in O(n2) time, a model that can´t be efficiently simulated by a single TM, thus proving the fallacy of the so called strong form of Church-Turing thesis. In this paper we present a model of network computation that solves TSP in O(n2) time, model that could be implemented with some technical adjustments in a global system like internet. This network with five billions interconnected devices provides boundless possibilities in order to solve unprecedented instances of the TSP and therefore of other NP problems. In section 1 we go directly to the device model and prove mathematically its validity. In section 2 we explain the basic ideas behind the physical model. In section 3 we outline the key aspects to put into practice the theoretical model in a computer network.
Category: Data Structures and Algorithms

[3] viXra:1804.0299 [pdf] submitted on 2018-04-22 08:32:08

Human Brain in a Computer

Authors: George Rajna
Comments: 48 Pages.

Scientists at the Max Planck Institute for Brain Research in Frankfurt have now shown how the new model can be used to investigate multiple properties in parallel. [28] Scientists at the Department of Energy's Oak Ridge National Laboratory are conducting fundamental physics research that will lead to more control over mercurial quantum systems and materials. [27] Physicists in Italy have designed a " quantum battery " that they say could be built using today's solid-state technology. [26] Researches of scientists from South Ural State University are implemented within this area. [25] Following three years of extensive research, Hebrew University of Jerusalem (HU) physicist Dr. Uriel Levy and his team have created technology that will enable computers and all optic communication devices to run 100 times faster through terahertz microchips. [24] When the energy efficiency of electronics poses a challenge, magnetic materials may have a solution. [23] An exotic state of matter that is dazzling scientists with its electrical properties, can also exhibit unusual optical properties, as shown in a theoretical study by researchers at A*STAR. [22] The breakthrough was made in the lab of Andrea Alù, director of the ASRC's Photonics Initiative. Alù and his colleagues from The City College of New York, University of Texas at Austin and Tel Aviv University were inspired by the seminal work of three British researchers who won the 2016 Noble Prize in Physics for their work, which teased out that particular properties of matter (such as electrical conductivity) can be preserved in certain materials despite continuous changes in the matter's form or shape. [21] Researchers at the University of Illinois at Urbana-Champaign have developed a new technology for switching heat flows 'on' or 'off'. [20] Thermoelectric materials can use thermal differences to generate electricity. Now there is an inexpensive and environmentally friendly way of producing them with the simplest tools: a pencil, photocopy paper, and conductive paint. [19] A team of researchers with the University of California and SRI International has developed a new type of cooling device that is both portable and efficient. [18]
Category: Data Structures and Algorithms

[2] viXra:1804.0076 [pdf] submitted on 2018-04-05 21:48:59

Second Edition: Final Results on P vs NP Via Integer Factorization and Optimization

Authors: Yuly Shipilevsky
Comments: 17 Pages.

We reduce integer factorization problem to the equivalent problem of minimizing a quadratic polynomial with integer coefficients over the integer points in a quadratically constrained two-dimensional region. Next, we reduce integer factorization problem to the problem of enumeration of vertices of integer hull of a special two-dimensional rational polyhedron, solvable in time polynomial by Hartmann's algorithm. Finally, as we show that there exists an NP-hard minimization problem, equivalent to the original minimization problem, we conclude that P = NP.
Category: Data Structures and Algorithms

[1] viXra:1804.0062 [pdf] submitted on 2018-04-05 04:11:14

Two-Factor Authentication Vulnerabilities

Authors: Stefan Ćertić
Comments: 14 Pages. Keywords: ​internet, 2FA, data security, attacks, breaches.

Corporative giants of the internet, such as Google, Facebook, Various Banks have being using the two-factor authentication technique to ensure security to its users. Although, this companies don’t make this kind operations by themselves, they hire third part companies to do so, integrating the API products for onwards delivery. Because of this, technique have serious breaches that can be explored by a ill-intentioned company. The third part companies stays between the client and the website being in a privileged place to attack any unsuspecting victim.
Category: Data Structures and Algorithms