Reviewerly/exHarmony huggingface dataset:
Knowledge Graph Construction and Applications for Web Search and Beyond

Knowledge graph (KG) has played an important role in enhancing the performance of many intelligent systems. In this paper, we introduce the solution of building a large-scale multi-source knowledge graph from scratch in Sogou Inc., including its architecture, technical implementation and applications. Unlike previous works that build knowledge graph with graph databases, we build the knowledge graph on top of SogouQdb, a distributed search engine developed by Sogou Web Search Department, which can be easily scaled to support petabytes of data. As a supplement to the search engine, we also introduce a series of models to support inference and graph based querying. Currently, the data of Sogou knowledge graph that are collected from 136 different websites and constantly updated consist of 54 million entities and over 600 million entity links. We also introduce three applications of knowledge graph in Sogou Inc.: entity detection and linking, knowledge based question answering and knowledge based dialog system. These applications have been used in Web search products to help user acquire information more efficiently.
Back Propagation Neural Network(BPNN) and Sigmoid Activation Function in Multi-Layer Networks

Back propagation neural network are known for computing the problems that cannot easily be computed (huge datasets analysis or training) in artificial neural networks. The main idea of this paper is to implement XOR logic gate by ANNs using back propagation neural network for back propagation of errors, and sigmoid activation function. This neural network to map non-linear threshold gate. The non-linear used to classify binary inputs (x1, x2) and passing it through hidden layer for computing coefficient_errors and gradient_errors (Cerrors, Gerrors), after computing errors by (ei = Output_desired- Output_actual) the weights and thetas (ΔWji = (α)(Xj)(gi), Δϴj = (α)(-1)(gi)) are changing according to errors. Sigmoid activation function is = sig(x)=1/(1+e-x) and Derivation of sigmoid is = dsig(x) = sig(x)(1-sig(x)). The sig(x) and Dsig(x) is between 1 to 0.&#x0D;
Learning Efficient Stereo Matching Network With Depth Discontinuity Aware Super-Resolution

Deep convolutional neural networks (CNNs) have shown great potential to provide accurate depth estimation based on stereo images. Previous work has focused on developing robust stereo matching architectures, while little attention has been paid on improving the network efficiency. In this paper, we propose an efficient Siamese CNN architecture that combines the low resolution disparity estimation and the depth discontinuity aware super-resolution. Specifically, we propose to construct, filter and perform regression on a low resolution cost volume through the designed stereo matching backbone network. A fast depth discontinuity aware super-resolution subnetwork is proposed for upsampling the low resolution disparity map to the desired resolution. Under the guidance of the intensity edge features extracted from the left color image, depth edge residuals are hierarchically learned to refine the upsampled depth map. A delayed upsampling structure is designed to ensure that the computational complexity is proportional to the spatial size of the input disparity map. We also propose to supervise the first derivative loss of the predicted disparity map that makes the network adaptively aware of the depth discontinuity edges. Experiments show that the proposed stereo matching network achieves a comparable prediction accuracy and much faster running speed compared with state-of-the-art methods.
The effect of intention analysis-based fraud detection systems in repeated supply Chain quality inspection: A context of learning and contract

As a result of the information asymmetry on product quality, there is a risk of unethical suppliers defrauding buyers in a supply chain. Buyers often conduct quality inspection on shipments and frame supply contracts to punish quality fraud. Due to cost concerns, buyers need to estimate the suppliers’ fraud possibilities and choose appropriate testing methods and frequencies. As suppliers’ fraud intentions depend on their cost-benefit analysis, it is possible to analyze suppliers’ fraud intention with appropriate modeling of their profit-seeking behavior. In this research, we are interested in how fraud intention analysis may affect the quality inspection process. It should be noted that quality inspection can be a repeated process, with suppliers and buyers conducting multiple rounds of transactions (including transactions with frauds) and learning about each other during the process. Their supply contracts may also affect suppliers’ profit-seeking attitude. We conduct a laboratory experiment to examine the effect of fraud intention analysis systems on inspection decision making considering the learning and contract effects. We put the experiment in the context of a dairy supply chain as a critical and interesting example application. The experiment shows that if there are no strong punitive terms for fraud in the contract, fraud intention analysis can improve buyers’ decision-making efficiency after controlling the learning effect, in terms of decision time, inspection cost, and correctness of rejecting suppliers’ fraudulent shipments.
Logical reduction of metarules

Abstract Many forms of inductive logic programming (ILP) use metarules , second-order Horn clauses, to define the structure of learnable programs and thus the hypothesis space. Deciding which metarules to use for a given learning task is a major open problem and is a trade-off between efficiency and expressivity: the hypothesis space grows given more metarules, so we wish to use fewer metarules, but if we use too few metarules then we lose expressivity. In this paper, we study whether fragments of metarules can be logically reduced to minimal finite subsets. We consider two traditional forms of logical reduction: subsumption and entailment. We also consider a new reduction technique called derivation reduction , which is based on SLD-resolution. We compute reduced sets of metarules for fragments relevant to ILP and theoretically show whether these reduced sets are reductions for more general infinite fragments. We experimentally compare learning with reduced sets of metarules on three domains: Michalski trains, string transformations, and game rules. In general, derivation reduced sets of metarules outperform subsumption and entailment reduced sets, both in terms of predictive accuracies and learning times.
Augmented Reality: Examining its value in a music technology classroom. Practice and potential.

Augmented reality (AR) provides exciting opportunities for advancing the design and practice of classroom instruction. AR can facilitate unique opportunities for students to conceptualise, understand and recall learning content. AR offers students contextual learning experiences. These views suggest that AR can assist in reducing distances between learner’s knowledge and what they need to understand. In my senior music classroom, I tested these ideas, wanting to see if students, through using AR, could visualise relationships between component parts, describe their function and use that knowledge in practice. The focus centred on students need to construct a sound system for performance in a Year 12 music class (16–17 years old). The project question was; Would AR aid the understanding and conceptualisation of content and develop the quality and retention of their learning? Through observation, interviews and a questionnaire, I used these data to understand levels of knowledge retention, conceptualisation and understanding of content. Findings indicate that while students displayed content conceptualisation skills, they also showed secure knowledge retention in line with previous studies. An encouraging finding suggests that in using AR, students retained what they had learned, remembering the function and use of various components after one learning experience. The potential impact of new and emerging technologies such as AR on student progress and instructional design is exciting, offering alternative ways of delivering and mediating learning content and concepts that connect with teaching and learning.
Hierarchically Authorized Transactions for Massive Internet-of-Things Data Sharing Based on Multilayer Blockchain

With the arrival of the Internet of Things (IoT) era and the rise of Big Data, cloud computing, and similar technologies, data resources are becoming increasingly valuable. Organizations and users can perform all kinds of processing and analysis on the basis of massive IoT data, thus adding to their value. However, this is based on data-sharing transactions, and most existing work focuses on one aspect of data transactions, such as convenience, privacy protection, and auditing. In this paper, a data-sharing-transaction application based on blockchain technology is proposed, which comprehensively considers various types of performance, provides an efficient consistency mechanism, improves transaction verification, realizes high-performance concurrency, and has tamperproof functions. Experiments were designed to analyze the functions and storage of the proposed system.
Path Planning for Autonomous Bus Driving in Highly Constrained Environments

Driving in urban environments often presents difficult situations that require expert maneuvering of a vehicle. These situations become even more challenging when considering large vehicles, such as buses. We present a path planning framework that addresses the demanding driving task of buses in highly constrained environments, such as urban areas. The approach is formulated as an optimization problem using the road-aligned vehicle model. The road-aligned frame introduces a distortion on the vehicle body and obstacles, motivating the development of novel approximations that capture this distortion. These approximations allow for the formulation of safe and accurate collision avoidance constraints. Unlike other path planning approaches, our method exploits curbs and other sweepable regions, which a bus must often sweep over in order to manage certain maneuvers. Furthermore, it takes full advantage of the particular characteristics of buses, namely the overhangs, an elevated part of the vehicle chassis, that can sweep over curbs. Simulations are presented, showing the applicability and benefits of the proposed method.
Online Adaptive Asymmetric Active Learning With Limited Budgets

Online Active Learning (OAL) aims to manage unlabeled datastream by selectively querying the label of data. OAL is applicable to many real-world problems, such as anomaly detection in health-care and finance. In these problems, there are two key challenges: the query budget is often limited; the ratio between classes is highly imbalanced. In practice, it is quite difficult to handle imbalanced unlabeled datastream when only a limited budget of labels can be queried for training. To solve this, previous OAL studies adopt either asymmetric losses or queries (an isolated asymmetric strategy) to tackle the imbalance, and use first-order methods to optimize the cost-sensitive measure. However, the isolated strategy limits their performance in class imbalance, while first-order methods restrict their optimization performance. In this article, we propose a novel Online Adaptive Asymmetric Active learning algorithm, based on a new asymmetric strategy (merging both asymmetric losses and queries strategies), and second-order optimization. We theoretically analyze its mistake bound and cost-sensitive metric bounds. Moreover, to better balance performance and efficiency, we enhance our algorithm via a sketching technique, which significantly accelerates the computational speed with quite slight performance degradation. Promising results demonstrate the effectiveness and efficiency of the proposed methods.
Simulability of partially distinguishable superposition and Gaussian boson sampling

We study the hardness of classically simulating boson sampling with superposition and Gaussian input states at nonzero photon indistinguishability. We find that, similar to regular boson sampling, distinguishability causes exponential attenuation of the many-photon interference terms in both these boson sampling variants. For superposition sampling, we find that it is not simulable with out method at zero indistinguishability, which is evidence for the computational hardness of this problem, and we find that it is simulable at any level of particle distinguishability, similar to regular boson sampling. If an efficient classical algorithm to approximate a given sum over permanents is found, this approach also leads to an efficient classical algorithm to simulate Gaussian boson sampling in the presence of distinguishability.
Email phishing: text classification using natural language processing

Phishing is networked theft in which the main motive of phishers is to steal any person’s private information, its financial details like account number, credit card details, login information, payment mode information by creating and developing a fake page or a fake web site, which look completely authentic and genuine. Nowadays email phishing has become a big threat to all, and is increasing day by day. Moreover detection of phishing emails have been considered an important research issue as phishing emails have been increasing day by day. Various techniques have been introduced and applied to deal with such a big issue. The major objective of this research paper is giving a detailed description on the classification of phishing emails using the natural language processing concepts. NLP (natural language processing) concepts have been applied for the classification of emails, along with that accuracy rate of various classifiers have been calculated. The paper is presented in four sections. An introduction about phishing its types, its history, statistics, life cycle, motivation for phishers and working of email phishing have been discussed in the first section. The second section covers various technologies of phishing- email phishing and also description of evaluation metrics. An overview of the various proposed solutions and work done by researchers in this field in form of literature review has been presented in the third section. The solution approach and the obtained results have been defined in the fourth section giving a detailed description about NLP concepts and working procedure.
Empirical Bayes Transductive Meta-Learning with Synthetic Gradients

We propose a meta-learning approach that learns from multiple tasks in a transductive setting, by leveraging unlabeled information in the query set to learn a more powerful meta-model. To develop our framework we revisit the empirical Bayes formulation for multi-task learning. The evidence lower bound of the marginal log-likelihood of empirical Bayes decomposes as a sum of local KL divergences between the variational posterior and the true posterior of each task. We derive a novel amortized variational inference that couples all the variational posteriors into a meta-model, which consists of a synthetic gradient network and an initialization network. The combination of local KL divergences and synthetic gradient network allows for backpropagating information from unlabeled data, thereby enabling transduction. Our results on the Mini-ImageNet and CIFAR-FS benchmarks for episodic few-shot classification significantly outperform previous state-of-the-art methods.
Location recommendation privacy protection method based on location sensitivity division

Abstract Location-based recommendation services can provide users with convenient services, but this requires monitoring and collecting a large amount of location information. In order to prevent location information from being leaked after monitoring and collection, location privacy must be effectively protected. Therefore, this paper proposes a privacy protection method based on location sensitivity for location recommendation. This method uses location trajectories and check-in frequencies to set a threshold so as to classify location sensitivity levels. The corresponding privacy budget is then assigned based on the sensitivity to add Laplace noise that satisfies the differential privacy. Experimental results show that this method can effectively protect the user’s location privacy and reduce the impact of differential privacy noise on service quality.
Adaptive Binarization of QR Code Images for Fast Automatic Sorting in Warehouse Systems

As the fundamental element of the Internet of Things, the QR code has become increasingly crucial for connecting online and offline services. Concerning e-commerce and logistics, we mainly focus on how to identify QR codes quickly and accurately. An adaptive binarization approach is proposed to solve the problem of uneven illumination in warehouse automatic sorting systems. Guided by cognitive modeling, we adaptively select the block window of the QR code for robust binarization under uneven illumination. The proposed method can eliminate the impact of uneven illumination of QR codes effectively whilst meeting the real-time needs in the automatic warehouse sorting. Experimental results have demonstrated the superiority of the proposed approach when benchmarked with several state-of-the-art methods.
Learning Deep Relations to Promote Saliency Detection

Though saliency detectors has made stunning progress recently. The performances of the state-of-the-art saliency detectors are not acceptable in some confusing areas, e.g., object boundary. We argue that the feature spatial independence should be one of the root cause. This paper explores the ubiquitous relations on the deep features to promote the existing saliency detectors efficiently. We establish the relation by maximizing the mutual information of the deep features of the same category via deep neural networks to break this independence. We introduce a threshold-constrained training pair construction strategy to ensure that we can accurately estimate the relations between different image parts in a self-supervised way. The relation can be utilized to further excavate the salient areas and inhibit confusing backgrounds. The experiments demonstrate that our method can significantly boost the performance of the state-of-the-art saliency detectors on various benchmark datasets. Besides, our model is label-free and extremely efficient. The inference speed is 140 FPS on a single GTX1080 GPU.
RecapNet: Action Proposal Generation Mimicking Human Cognitive Process

Generating action proposals in untrimmed videos is a challenging task, since video sequences usually contain lots of irrelevant contents and the duration of an action instance is arbitrary. The quality of action proposals is key to action detection performance. The previous methods mainly rely on sliding windows or anchor boxes to cover all ground-truth actions, but this is infeasible and computationally inefficient. To this end, this article proposes a RecapNet-a novel framework for generating action proposal, by mimicking the human cognitive process of understanding video content. Specifically, this RecapNet includes a residual causal convolution module to build a short memory of the past events, based on which the joint probability actionness density ranking mechanism is designed to retrieve the action proposals. The RecapNet can handle videos with arbitrary length and more important, a video sequence will need to be processed only in one single pass in order to generate all action proposals. The experiments show that the proposed RecapNet outperforms the state of the art under all metrics on the benchmark THUMOS14 and ActivityNet-1.3 datasets. The code is available publicly at https://github.com/tianwangbuaa/RecapNet.
A novel switching bilateral filtering algorithm for depth map

n this paper, we propose a novel switching bilateral filter for depth map from a RGB-D sensor. The switching method works as follows: the bilateral filter is applied not at all pixels of the depth map, but only in those where noise and holes are possible, that is, at the boundaries and sharp changes. With the help of computer simulation we show that the proposed algorithm can effectively and fast process a depth map. The presented results show an improvement in the accuracy of 3D object reconstruction using the proposed depth filtering. The performance of the proposed algorithm is compared in terms of the accuracy of 3D object reconstruction and speed with that of common successful depth filtering algorithms.
Specifying Weight Priors in Bayesian Deep Neural Networks with Empirical Bayes

Stochastic variational inference for Bayesian deep neural network (DNN) requires specifying priors and approximate posterior distributions over neural network weights. Specifying meaningful weight priors is a challenging problem, particularly for scaling variational inference to deeper architectures involving high dimensional weight space. We propose MOdel Priors with Empirical Bayes using DNN (MOPED) method to choose informed weight priors in Bayesian neural networks. We formulate a two-stage hierarchical modeling, first find the maximum likelihood estimates of weights with DNN, and then set the weight priors using empirical Bayes approach to infer the posterior with variational inference. We empirically evaluate the proposed approach on real-world tasks including image classification, video activity recognition and audio classification with varying complex neural network architectures. We also evaluate our proposed approach on diabetic retinopathy diagnosis task and benchmark with the state-of-the-art Bayesian deep learning techniques. We demonstrate MOPED method enables scalable variational inference and provides reliable uncertainty quantification.
Revisiting the Foundations of Abstract Argumentation – Semantics Based on Weak Admissibility and Weak Defense

In his seminal 1995 paper, Dung paved the way for abstract argumentation, a by now major research area in knowledge representation. He pointed out that there is a problematic issue with self-defeating arguments underlying all traditional semantics. A self-defeat occurs if an argument attacks itself either directly or indirectly via an odd attack loop, unless the loop is broken up by some argument attacking the loop from outside. Motivated by the fact that such arguments represent self-contradictory or paradoxical arguments, he asked for reasonable semantics which overcome the problem that such arguments may indeed invalidate any argument they attack. This paper tackles this problem from scratch. More precisely, instead of continuing to use previous concepts defined by Dung we provide new foundations for abstract argumentation, so-called weak admissibility and weak defense. After showing that these key concepts are compatible as in the classical case we introduce new versions of the classical Dung-style semantics including complete, preferred and grounded semantics. We provide a rigorous study of these new concepts including interrelationships as well as the relations to their Dung-style counterparts. The newly introduced semantics overcome the issue with self-defeating arguments, and they are semantically insensitive to syntactic deletions of self-attacking arguments, a special case of self-defeat.