Reviewerly/exHarmony huggingface dataset:
A blockchain-driven cyber-credit evaluation approach for establishing reliable cooperation among unauthentic MSMEs in social manufacturing

Purpose Social manufacturing has emerged. It aims to integrate the manufacturing resources of micro- and small-scale manufacturing enterprises (MSMEs) and help MSMEs cope with the dynamic, service-oriented and personalized market demands. In social manufacturing, MSMEs cooperate with each other through manufacturing resource sharing. However, because MSMEs are distributed and decentralized, the efficiency of establishing reliable cooperation between MSMEs is relatively low. Therefore, this paper presents a blockchain-driven cyber-credit evaluation system (BCCES) to implement distributed cyber-credit evaluation. BCCES can provide reliable cyber-credit for distributed MSMEs without the trusted third party. This can improve the efficiency of establishing reliable cooperation among unauthentic MSMEs. Design/methodology/approach The paper proposes a BCCES to evaluate MSMEs' cyber-credit in decentralized environment. In BCCES, a cyber-credit evaluation model is proposed by improving set pair analysis (SPA) method, and cyber-credit smart contract and distributed consensus mechanism are designed according to the runtime logic of distributed cyber-credit evaluation. Findings The results confirmed that BCCES is feasible and effective to implement cyber-credit evaluation without the trusted third party. With the advantages of blockchain, BCCES can automatically realize cyber-credit evaluation through smart contract and distributed consensus. At the same time, BCCES can evaluate the real-time cyber-credit of MSMEs based on their latest service evaluation. In addition, we can design corresponding smart contracts according to actual requirements, which makes blockchain applicable to different distributed scenarios. Originality/value The paper combines blockchain and SPA to implement cyber-credit evaluation in social manufacturing and provides a new feasible idea for cyber-credit evaluation without the trusted third party. This can also provide MSMEs a reference of applying blockchain to other distributed scenarios through combining smart contract and different algorithms.
Construction Method and Performance Analysis of Chaotic S-Box Based on a Memorable Simulated Annealing Algorithm

The substitution box (S-box) is the only nonlinear components in the symmetric block cipher. Its performance directly determines the security strength of the block cipher. With the dynamic characteristics degradation and the local periodic phenomenon of digital chaos, and the security problems caused by them becoming more and more prominent, how to efficiently generate an S-box with security guarantee based on chaos has gradually attracted the attention of cryptographers. In this paper, a chaotic S-box construction method is proposed based on a memorable simulated annealing algorithm (MSAA). The chaotic S-box set is produced by using the nonlinearity and randomness of the dynamic iteration of digital cascaded chaotic mapping. The composite objective function is constructed based on the analysis of the performance indexes of S-box. The MSAA is used to efficiently optimize the S-box set. The matrix segmentation and scrambling operations are carried out on the optimized S-box. The cryptographic performance of chaotic S-box is tested and analyzed, and compared with the mainstream chaotic S-box of the same kind. The results show that the S-box constructed in this paper can not only stably and efficiently generate chaotic S-box with better performance, but also make an effective exploration of the construction of chaotic S-boxes based on intelligent algorithms.
Argumentation Mining on Essays at Multi Scales

Argumentation mining on essays is a new challenging task in natural language processing, which aims to identify the types and locations of argumentation components.Recent research mainly models the task as a sequence tagging problem and deal with all the argumentation components at word level.However, this task is not scale-independent.Some types of argumentation components which serve as core opinions on essays or paragraphs, are at essay level or paragraph level.Sequence tagging method conducts reasoning by local context words, and fails to effectively mine these components.To this end, we propose a multi-scale argumentation mining model, where we respectively mine different types of argumentation components at corresponding levels.Besides, an effective coarse-to-fine argumentation fusion mechanism is proposed to further improve the performance.We conduct a serial of experiments on the Persuasive Essay dataset (PE 2.0).Experimental results indicate that our model outperforms existing models on mining all types of argumentation components.
VAEBM: A Symbiosis between Variational Autoencoders and Energy-based Models

Energy-based models (EBMs) have recently been successful in representing complex distributions of small images. However, sampling from them requires expensive Markov chain Monte Carlo (MCMC) iterations that mix slowly in high dimensional pixel space. Unlike EBMs, variational autoencoders (VAEs) generate samples quickly and are equipped with a latent space that enables fast traversal of the data manifold. However, VAEs tend to assign high probability density to regions in data space outside the actual data distribution and often fail at generating sharp images. In this paper, we propose VAEBM, a symbiotic composition of a VAE and an EBM that offers the best of both worlds. VAEBM captures the overall mode structure of the data distribution using a state-of-the-art VAE and it relies on its EBM component to explicitly exclude non-data-like regions from the model and refine the image samples. Moreover, the VAE component in VAEBM allows us to speed up MCMC updates by reparameterizing them in the VAE's latent space. Our experimental results show that VAEBM outperforms state-of-the-art VAEs and EBMs in generative quality on several benchmark image datasets by a large margin. It can generate high-quality images as large as 256$\times$256 pixels with short MCMC chains. We also demonstrate that VAEBM provides complete mode coverage and performs well in out-of-distribution detection. The source code is available at https://github.com/NVlabs/VAEBM
Research on obstacle avoidance algorithm for unmanned ground vehicle based on multi-sensor information fusion

With the wide application of unmanned ground vehicles (UGV) in a complex environment, the research on the obstacle avoidance system has gradually become an important research part in the field of the UGV system. Aiming at the complex working environment, a sensor detection system mounted on UGV is designed and the kinematic estimation model of UGV is studied. In order to meet the obstacle avoidance requirements of UGVs in a complex environment, a fuzzy neural network obstacle avoidance algorithm based on multi-sensor information fusion is designed in this paper. MATLAB is used to simulate the obstacle avoidance algorithm. By comparing and analyzing the simulation path of UGV's obstacle avoidance motion under the navigation control of fuzzy controller and fuzzy neural network algorithm, the superiority of the proposed fuzzy neural network algorithm was verified. Finally, the superiority and reliability of the obstacle avoidance algorithm are verified through the obstacle avoidance experiment on the UGV experimental platform.
Complete Multilingual Neural Machine Translation

Multilingual Neural Machine Translation (MNMT) models are commonly trained on a joint set of bilingual corpora which is acutely English-centric (i.e. English either as source or target language). While direct data between two languages that are non-English is explicitly available at times, its use is not common. In this paper, we first take a step back and look at the commonly used bilingual corpora (WMT), and resurface the existence and importance of implicit structure that existed in it: multi-way alignment across examples (the same sentence in more than two languages). We set out to study the use of multi-way aligned examples in order to enrich the original English-centric parallel corpora. We reintroduce this direct parallel data from multi-way aligned corpora between all source and target languages. By doing so, the English-centric graph expands into a complete graph, every language pair being connected. We call MNMT with such connectivity pattern complete Multilingual Neural Machine Translation (cMNMT) and demonstrate its utility and efficacy with a series of experiments and analysis. In combination with a novel training data sampling strategy that is conditioned on the target language only, cMNMT yields competitive translation quality for all language pairs. We further study the size effect of multi-way aligned data, its transfer learning capabilities and how it eases adding a new language in MNMT. Finally, we stress test cMNMT at scale and demonstrate that we can train a cMNMT model with up to 12,432 language pairs that provides competitive translation quality for all language pairs.
What makes a popular academic AI repository?

Many AI researchers are publishing code, data and other resources that accompany their papers in GitHub repositories. In this paper, we refer to these repositories as academic AI repositories. Our preliminary study shows that highly cited papers are more likely to have popular academic AI repositories (and vice versa). Hence, in this study, we perform an empirical study on academic AI repositories to highlight good software engineering practices of popular academic AI repositories for AI researchers. We collect 1,149 academic AI repositories, in which we label the top 20% repositories that have the most number of stars as popular, and we label the bottom 70% repositories as unpopular. The remaining 10% repositories are set as a gap between popular and unpopular academic AI repositories. We propose 21 features to characterize the software engineering practices of academic AI repositories. Our experimental results show that popular and unpopular academic AI repositories are statistically significantly different in 11 of the studied features—indicating that the two groups of repositories have significantly different software engineering practices. Furthermore, we find that the number of links to other GitHub repositories in the README file, the number of images in the README file and the inclusion of a license are the most important features for differentiating the two groups of academic AI repositories. Our dataset and code are made publicly available to share with the community.
Hypersphere Fitting From Noisy Data Using an EM Algorithm

This letter studies a new expectation maximization (EM) algorithm to solve the problem of circle, sphere and more generally hypersphere fitting. This algorithm relies on the introduction of random latent vectors having a priori independent von Mises-Fisher distributions defined on the hypersphere. This statistical model leads to a complete data likelihood whose expected value, conditioned on the observed data, has a Von Mises-Fisher distribution. As a result, the inference problem can be solved with a simple EM algorithm. The performance of the resulting hypersphere fitting algorithm is evaluated for circle and sphere fitting.
A novel voting convergent difference neural network for diagnosing breast cancer

Breast cancer is one of the most frequently occurred cancers for females, and thus diagnosing breast cancer is very important. Neural dynamic algorithm (NDA) has been successfully applied in many fields with the characteristics of parallel computing and exponential convergence. However, there is no research on applying NDA-based neural network for pattern classification. In this paper, a novel voting convergent difference neural network (V-CDNN) is proposed. To do so, samples are firstly handled by feature selection, feature weighting and sample normalization. Secondly, the preprocessed samples are used to simultaneously and independently train several convergent difference neural networks in different types of mapping functions. Thirdly, in the testing process, voting strategy for these networks is applied to make diagnosis results more accurate and convincing. Being different from most existing neural networks, the proposed V-CDNN adopts neural dynamic learning algorithm, which greatly improves computation efficiency and increases accuracy rate of diagnosis. Experimental results verify that the proposed V-CDNN can achieve 100% average diagnosis accuracy, which is the highest among existing state-of-the-art methods on the open data set.
Interpreting and Unifying Graph Neural Networks with An Optimization Framework

Graph Neural Networks (GNNs) have received considerable attention on graph-structured data learning for a wide variety of tasks. The well-designed propagation mechanism which has been demonstrated effective is the most fundamental part of GNNs. Although most of GNNs basically follow a message passing manner, litter effort has been made to discover and analyze their essential relations. In this paper, we establish a surprising connection between different propagation mechanisms with a unified optimization problem, showing that despite the proliferation of various GNNs, in fact, their proposed propagation mechanisms are the optimal solution optimizing a feature fitting function over a wide class of graph kernels with a graph regularization term. Our proposed unified optimization framework, summarizing the commonalities between several of the most representative GNNs, not only provides a macroscopic view on surveying the relations between different GNNs, but also further opens up new opportunities for flexibly designing new GNNs. With the proposed framework, we discover that existing works usually utilize naive graph convolutional kernels for feature fitting function, and we further develop two novel objective functions considering adjustable graph kernels showing low-pass or high-pass filtering capabilities respectively. Moreover, we provide the convergence proofs and expressive power comparisons for the proposed models. Extensive experiments on benchmark datasets clearly show that the proposed GNNs not only outperform the state-of-the-art methods but also have good ability to alleviate over-smoothing, and further verify the feasibility for designing GNNs with our unified optimization framework.
Analyzing the Expressive Power of Graph Neural Networks in a Spectral Perspective

In the recent literature of Graph Neural Networks (GNN), the expressive power of models has been studied through their capability to distinguish if two given graphs are isomorphic or not. Since the graph isomorphism problem is NP-intermediate, and Weisfeiler-Lehman (WL) test can give sufficient but not enough evidence in polynomial time, the theoretical power of GNNs is usually evaluated by the equivalence of WL-test order, followed by an empirical analysis of the models on some reference inductive and transductive datasets. However, such analysis does not account the signal processing pipeline, whose capability is generally evaluated in the spectral domain. In this paper, we argue that a spectral analysis of GNNs behavior can provide a complementary point of view to go one step further in the understanding of GNNs. By bridging the gap between the spectral and spatial design of graph convolutions, we theoretically demonstrate some equivalence of the graph convolution process regardless it is designed in the spatial or the spectral domain. Using this connection, we managed to re-formulate most of the state-of-the-art graph neural networks into one common framework. This general framework allows to lead a spectral analysis of the most popular GNNs, explaining their performance and showing their limits according to spectral point of view. Our theoretical spectral analysis is confirmed by experiments on various graph databases. Furthermore, we demonstrate the necessity of high and/or band-pass filters on a graph dataset, while the majority of GNN is limited to only low-pass and inevitably it fails.
A Image Enhancement Method For Night-Way Images

Image processing has a wide range of applications especially in our daily lives. Image processing is not common in sensitive industrial applications. Because of these applications, very high percentage of success is requested. Also these applications work in real-time. However, it can be widely used in many daily routines (driving, entrance to the workplace/ exit, control of multimedia devices, security applications, identification applications, etc.). Especially Advanced Driver Assistance Systems (ADAS) is a popular working area for image processing. Strip tracking systems, pedestrian detection systems, reading of traffic signs and signals are based on image processing. In this study, a new method has been developed to increase the visibility levels of road images at night driving. In these images, the brightness level is low because of insufficient of light sources (headlights and road lighting) which are often used to increase the driver's view. On the other hand, adversely affects the view of driver which the headlight of coming vehicles from opposite directions, poorly structured road lighting and etc. Especially the vehicle headlights coming from the opposite direction take the eye of the drivers and cause the level of view to decrease. Intense dark areas and light sources are in the image together. By so, special to these images requires the use of an adaptive improvement method. This is because, when classical image enhancement methods are used, the visibility levels of the dark areas are increased, and the shining regions are more likely to shine and the visibility level decreases in these regions. The developed method aims at enhancement these images that drivers be exposed to. For this purpose, the light sources in the image and the magnitudes of these light sources, the distance of the pixels to be calculated from the light sources, the value of the pixel itself and the neighboring pixels are used as separate parameters. Images are enhancement with the equations developed using these parameters. When the output images obtained with the use of the developed equations and the obtained Structural Similarity İndex Maps (SSIM) are examined, it is seen that the developed method gives good results.
Image Captioning Using Motion-CNN with Object Detection

Automatic image captioning has many important applications, such as the depiction of visual contents for visually impaired people or the indexing of images on the internet. Recently, deep learning-based image captioning models have been researched extensively. For caption generation, they learn the relation between image features and words included in the captions. However, image features might not be relevant for certain words such as verbs. Therefore, our earlier reported method included the use of motion features along with image features for generating captions including verbs. However, all the motion features were used. Since not all motion features contributed positively to the captioning process, unnecessary motion features decreased the captioning accuracy. As described herein, we use experiments with motion features for thorough analysis of the reasons for the decline in accuracy. We propose a novel, end-to-end trainable method for image caption generation that alleviates the decreased accuracy of caption generation. Our proposed model was evaluated using three datasets: MSR-VTT2016-Image, MSCOCO, and several copyright-free images. Results demonstrate that our proposed method improves caption generation performance.
PIQI: perceptual image quality index based on ensemble of Gaussian process regression

Digital images contain a lot of redundancies, therefore, compression techniques are applied to reduce the image size without loss of reasonable image quality. Same become more prominent in the case of videos which contains image sequences and higher compression ratios are achieved in low throughput networks. Assessment of quality of images in such scenarios has become of particular interest. Subjective evaluation in most of the scenarios is infeasible so objective evaluation is preferred. Among the three objective quality measures, full-reference and reduced-reference methods require an original image in some form to calculate the image quality which is unfeasible in scenarios such as broadcasting, acquisition or enhancement. Therefore, a no-reference Perceptual Image Quality Index (PIQI) is proposed in this paper to assess the quality of digital images which calculates luminance and gradient statistics along with mean subtracted contrast normalized products in multiple scales and color spaces. These extracted features are provided to a stacked ensemble of Gaussian Process Regression (GPR) to perform the perceptual quality evaluation. The performance of the PIQI is checked on six benchmark databases and compared with twelve state-of-the-art methods and competitive results are achieved. The comparison is made based on RMSE, Pearson and Spearman correlation coefficients between ground truth and predicted quality scores. The scores of 0.0552, 0.9802 and 0.9776 are achieved respectively for these metrics on CSIQ database. Two cross-dataset evaluation experiments are performed to check the generalization of PIQI.
Attention-based Saliency Hashing for Ophthalmic Image Retrieval

Deep hashing methods have been proved to be effective for the large-scale medical image search assisting reference-based diagnosis for clinicians. However, when the salient region plays a maximal discriminative role in ophthalmic image, existing deep hashing methods do not fully exploit the learning ability of the deep network to capture the features of salient regions pointedly. The different grades or classes of ophthalmic images may be share similar overall performance but have subtle differences that can be differentiated by mining salient regions. To address this issue, we propose a novel end-to-end network, named Attention-based Saliency Hashing (ASH), for learning compact hash-code to represent ophthalmic images. ASH embeds a spatial-attention module to focus more on the representation of salient regions and highlights their essential role in differentiating ophthalmic images. Benefiting from the spatial-attention module, the information of salient regions can be mapped into the hash-code for similarity calculation. In the training stage, we input the image pairs to share the weights of the network, and a pairwise loss is designed to maximize the discriminability of the hash-code. In the retrieval stage, ASH obtains the hash-code by inputting an image with an end-to-end manner, then the hash-code is used to similarity calculation to return the most similar images. Extensive experiments on two different modalities of ophthalmic image datasets demonstrate that the proposed ASH can further improve the retrieval performance compared to the state-of-the-art deep hashing methods due to the huge contributions of the spatial-attention module.