Gauss: program synthesis by reasoning over graphs

While input-output examples are a natural form of specification for program synthesis engines, they can be imprecise for domains such as table transformations. In this paper, we investigate how extracting readily-available information about the user intent behind these input-output examples helps speed up synthesis and reduce overfitting. We present Gauss, a synthesis algorithm for table transformations that accepts partial input-output examples, along with user intent graphs. Gauss includes a novel conflict-resolution reasoning algorithm over graphs that enables it to learn from mistakes made during the search and use that knowledge to explore the space of programs even faster. It also ensures the final program is consistent with the user intent specification, reducing overfitting. We implement Gauss for the domain of table transformations (supporting Pandas and R), and compare it to three state-of-the-art synthesizers accepting only input-output examples. We find that it is able to reduce the search space by 56×, 73× and 664× on average, resulting in 7×, 26× and 7× speedups in synthesis times on average, respectively.

A Fault Diagnosis Method Considering Meteorological Factors for Transmission Networks Based on P Systems

Bad meteorological conditions may reduce the reliability of power communication equipment, which can increase the distortion possibility of fault information in the communication process, hence raising its uncertainty and incompleteness. To address the issue, this paper proposes a fault diagnosis method for transmission networks considering meteorological factors. Firstly, a spiking neural P system considering a meteorological living environment and its matrix reasoning algorithm are designed. Secondly, based on the topology structure of the target power transmission network and the action logic of its protection devices, a diagnosis model based on the spiking neural P system considering the meteorological living environment is built for each suspicious fault transmission line. Following this, the action messages of protection devices and corresponding temporal order information are used to obtain initial pulse values of input neurons of the diagnosis model, which are then modified with the gray fuzzy theory. Finally, the matrix reasoning algorithm of each model is executed in a parallel manner to obtain diagnosis results. Experiment results achieved out on IEEE 39-bus system show the feasibility and effectiveness of the proposed method.

Probabilistic Graph Model Mining User Affinity in Social Networks

In social networks, discovery of user similarity is the basis of social media data analysis. It can be applied to user-based product recommendations and inference of user relationship evolution in social networks. In order to effectively describe the complex correlation and uncertainty for social network users, the accuracy of similarity discovery is improved theoretically for massive social network users. Based on the Bayesian network probability map model, network topological structure is combined with the dependency between users, and an effective method is proposed to discover similarity in social network users. To improve the scalability of the proposed method and solve the storage and computation problem of mass data, Bayesian network distributed storage and parallel reasoning algorithm is proposed based on Hadoop platform in this paper. Experimental results verify the efficiency and correctness of the algorithm.

Knowledge Graph Reasoning Based on Tensor Decomposition and MHRP-Learning

In the process of learning and reasoning knowledge graph, the existing tensor decomposition technology only considers the direct relationship between entities in knowledge graph. However, it ignores the characteristics of the graph structure of knowledge graph. To solve this problem, a knowledge graph reasoning algorithm based on multihop relational paths learning (MHRP-learning) and tensor decomposition is proposed in this paper. Firstly, MHRP-learning is adopted to obtain the relationship path between entity pairs in the knowledge graph. Then, the tensor decomposition is performed to get a novel learning framework. Finally, experiments show that the proposed method achieves advanced results, and it is applicable to knowledge graph reasoning.

A Fault Analysis Method for Three-Phase Induction Motors Based on Spiking Neural P Systems

The fault prediction and abductive fault diagnosis of three-phase induction motors are of great importance for improving their working safety, reliability, and economy; however, it is difficult to succeed in solving these issues. This paper proposes a fault analysis method of motors based on modified fuzzy reasoning spiking neural P systems with real numbers (rMFRSNPSs) for fault prediction and abductive fault diagnosis. To achieve this goal, fault fuzzy production rules of three-phase induction motors are first proposed. Then, the rMFRSNPS is presented to model the rules, which provides an intuitive way for modelling the motors. Moreover, to realize the parallel data computing and information reasoning in the fault prediction and diagnosis process, three reasoning algorithms for the rMFRSNPS are proposed: the pulse value reasoning algorithm, the forward fault prediction reasoning algorithm, and the backward abductive fault diagnosis reasoning algorithm. Finally, some case studies are given, in order to verify the feasibility and effectiveness of the proposed method.