Randomized Local Network Computing: Derandomization Beyond Locally Checkable Labelings

We carry on investigating the line of research questioning the power of randomization for the design of distributed algorithms. In their seminal paper, Naor and Stockmeyer [STOC 1993] established that, in the context of network computing in which all nodes execute the same algorithm in parallel, any construction task that can be solved locally by a randomized Monte-Carlo algorithm can also be solved locally by a deterministic algorithm. This result, however, holds only for distributed tasks such that the correctness of their solutions can be locally checked by a deterministic algorithm. In this article, we extend the result of Naor and Stockmeyer to a wider class of tasks. Specifically, we prove that the same derandomization result holds for every task such that the correctness of their solutions can be locally checked using a 2-sided error randomized Monte-Carlo algorithm.

Research Progress of Biomimetic Memristor Flexible Synapse

With the development of the Internet of things, artificial intelligence, and wearable devices, massive amounts of data are generated and need to be processed. High standards are required to store and analyze this information. In the face of the explosive growth of information, the memory used in data storage and processing faces great challenges. Among many types of memories, memristors have received extensive attentions due to their low energy consumption, strong tolerance, simple structure, and strong miniaturization. However, they still face many problems, especially in the application of artificial bionic synapses, which call for higher requirements in the mechanical properties of the device. The progress of integrated circuit and micro-processing manufacturing technology has greatly promoted development of the flexible memristor. The use of a flexible memristor to simulate nerve synapses will provide new methods for neural network computing and bionic sensing systems. In this paper, the materials and structure of the flexible memristor are summarized and discussed, and the latest configuration and new materials are described. In addition, this paper will focus on its application in artificial bionic synapses and discuss the challenges and development direction of flexible memristors from this perspective.

Analysis of User Personalized Retrieval of Multimedia Digital Archives Dependent on BP Neural Network Algorithm

This paper briefly introduces the characteristics of content-based multimedia retrieval under the information background, analyzes the implementation process of these technologies in the multimedia archives retrieval system including video and image information of digital archives, and points out that the content-based multimedia retrieval technology is bound to be organically combined with the traditional text retrieval methods. The information retrieval technologies in the past can only comply with the specific requirements of customers. Due to their characteristics of universality, they can hardly meet the demands of different environments, various purposes, and different times at the same time yet. Researchers have put forward personalized retrieval of multimedia files based on the BP neural network computing. In this way, the interest model of customers can be analyzed based on the characteristics of the different classification areas of users. Subsequently, the corresponding calculations are carried out, and the model is updated accordingly. Through the experiments, it is verified that the probability model put forward in this paper is the optimal solution to express the interest of customers and its changes.

Efficiency of cluster schemes implementation for discrete dynamic programming for systems of support of dispatching technological processes in transport systems

Within the framework of a computationally complex canonical scheduling problem, formulated by an optimization model for one-processor servicing of a finite deterministic flow of objects, a scheme of computational process of an algorithm of discrete dynamic programming in cluster implementation is considered. Variants of balancing of computational subtasks over network cluster array are investigated, purposed to reduce the volume and intensity of intranetwork interaction. It has been established that for practical improvement of efficiency of cluster algorithm, it is required not to increase the uniformity of distribution of subtasks among the cluster nodes, but to minimize the network traffic between the cluster nodes. Balancing options are proposed that allow to significantly increase localization of data in network computing. Experimental results are analytically confirmed, showing the scaling limits of implementation of discrete dynamic programming algorithms on a cluster architecture. The method for choosing the number of computational nodes and dimension of the problem being solved, which provide a threefold reduction in overhead costs for network exchange, is shown. The results obtained make it possible to objectively substantiate the choice of methodological and algorithmic approaches when choosing computer tools developing architectural and technological solutions for dispatching systems support in inland water transport.