Data Structures and Algorithms

1805 Submissions

[5] viXra:1805.0399 [pdf] submitted on 2018-05-21 20:28:48

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

Authors: Yuly Shipilevsky
Comments: 18 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

[4] viXra:1805.0248 [pdf] submitted on 2018-05-12 21:38:04

Nano-Soa a Powerful Alternative and Complementary of Soa

Authors: Bai Yang
Comments: 26 Pages.

SOA (Service Oriented Architecture) and micro SOA (Micro Service) have the advantages of high cohesion and low coupling, but at the same time they also bring complicated implementation, maintenance, high network load, and weak consistency. At the same time, they also increase product development and operation costs. This article attempts to use an improved approach by a kind of plug-in isolation mechanism that avoids the above issues as much as possible while preserving the benefits of SOA. In addition, this paper also proposes a new strong consistent distributed coordination algorithm for improving the low performance and high overhead (at least three network broadcasts and multiple disk I/O requests per request) problem of existing Paxos/Raft algorithms. This algorithm, at the expense of data reliability, completely eliminates the above overhead and provides the same level of strong agreement and high availability guarantees as the Paxos/Raft algorithm.
Category: Data Structures and Algorithms

[3] viXra:1805.0131 [pdf] submitted on 2018-05-06 07:42:44

A Study on the Design Method of a Wholeness Management System Based on Integrated Management of Data Centers

Authors: IlNam Ri, SongIl Choe, Hun Kim
Comments: 11 Pages.

In recent years, with the rapid development of cloud computing and IoT, the demand for big data has increased and the need for large data center and enterprise data center has been actively promoted. (1,3) In this paper, a system design method that integrates and manages various information systems in the data centers of enterprise units is dealt with. Since the production facilities of medium-scale units are managed by various detention facilities and control devices, an integrated monitoring system should be established to manage them collectively. (2) Therefore, the paper suggests a standard design for proposing an integrated model face-to-face configuration of various facilities to be managed in enterprise units and an integrated monitoring system for environmental facilities, do. And we try to evaluate the effectiveness of the system by analyzing the failure information transmission time of the integrated monitoring system.
Category: Data Structures and Algorithms

[2] viXra:1805.0088 [pdf] submitted on 2018-05-04 09:41:30

On the Equivalence Between P=NP and the Extended Church-Turing Thesis.

Authors: Óscar E. Chamizo Sánchez
Comments: 3 Pages.

Since the mere Church-Turing thesis says that Turing machines can simulate any computational device, but perhaps at the cost of an exponential blowup in time and/or space, the Extended Church-Turing Thesis (ECT for short) states that every physically realizable computational device can be efficiently simulated by Turing machines. Unlike the Church-Turing Thesis, which computer science conventional wisdom appears to think is true, the Extended Church-Turing Thesis is widely believed to be false just as it happens with the P=NP conjecture. In this paper we present an interesting extension from our seminal papers A new approach: A hardware device model solving TSP in O(n2) time and Efficiently solving Traveling Salesman Problem in a computer network. (Internet), proving the equivalence between ECT and P=NP. In section 1 we go directly to a physically feasible model and prove mathematically its validity. In section 2 we explain the basic ideas behind the physical model. In section 3 we prove the equivalence between the conjecture P=NP and the ECT thesis.
Category: Data Structures and Algorithms

[1] viXra:1805.0038 [pdf] submitted on 2018-05-02 00:18:33

One Way of Using Ajax Components to Realize Asynchronous Communication in Web Service

Authors: IlNam Ri, SongIl Choe, Hun Kim
Comments: 10 Pages.

Ajax (Asynchronos Javascript And XML), one of the world's most widely used Web 2.0 technologies, is devoid of the traditional Web page approach.(1) This technology is becoming an indispensable element in Web apps as it supports asynchronous communication that allows the user to proceed with the conversation.(3,4) Today 's reality is getting closer to the virtual reality by the dissemination of intelligent devices, the new Internet of Things, cloud computing and the development of information society. In the field of business services, we also need to improve the size and service quality of our web apps, and Ajax technology is constantly expanding.(5) In the fields of stocks, finance, auctions, etc. that deal with large-scale, real-time data, it is important for business service providers to transmit information to users as soon as possible. This Paper describes one way of using Ajax components to realize asynchronous communication of Web service providers on the Internet. Ajax components consist of an Ajax core that supports Epoll and an Ajax library that supports asynchronous communication, and provides an application interface to define and implement various push functions.(2)Web service applications developed using Ajax components can provide various push services by using asynchronous communication with client by using Epoll method.
Category: Data Structures and Algorithms