Reviewerly/exHarmony huggingface dataset:
RETRACTED: Research on the Application of Cloud Accounting in Government Accounting under the Background of Big Data

Abstract In the era of big data, cloud computing and big accounting data are combined to build a cloud accounting application platform that mainly integrates spatial distribution, security, accessibility, and the importance of transforming the state of accounting information. In the face of the wave of economic development, cloud accounting will also begin to be applied to administrative agencies and show great vitality in these departments. On this basis, this article focuses on the application of cloud accounting in government accounting under the background of big data. This article attempts to analyze the characteristics of cloud accounting to explore its functions and application services. In the new requirements of the new government accounting system, the importance of “big data” in the implementation of the new government accounting system is systematically analyzed. The use of cloud accounting in the government compares the settings and levels of the application with traditional government accounting work. The research results show that the emergence of cloud accounting is a major change in the accounting industry. It improves production efficiency and reduces company costs, and is favored by units. But cloud computing has some disadvantages. In today’s digital age, how to make cloud accounting a foothold takes a long time to think about how to make cloud accounting seize opportunities and respond to challenges.
AI programmer

In this paper, we present AI Programmer, a machine learning (ML) system that can automatically generate full software programs, while requiring only minimal human guidance. At its core, AI Programmer uses a genetic algorithm (GA), coupled with a tightly constrained programming language that minimizes the overhead of its ML search space. Part of AI Programmer's novelty stems from (i) its unique system design, including an embedded, hand-crafted interpreter for efficiency and security and (ii) its augmentation of classic GA to include instruction-gene randomization bindings and programming language-specific genome construction and elimination techniques. We provide a detailed examination of AI Programmer's system design, several examples detailing how the system works, and experimental data demonstrating its software generation capabilities and performance using only mainstream CPUs.
No-reference image quality assessment for contrast-changed images via a semi-supervised robust PCA model

Contrast plays an important role in human perception of image quality. In this paper, we propose a metric for no-reference quality assessment of contrast-changed images by using a novel semi-supervised robust PCA, which can realize feature selection and denoising simultaneously, guided by the available supervisory information. To select features adaptively, the information-oriented features (e.g. entropy and natural scene statistics) and appearance-oriented features (e.g. colorfulness) are adopted. The proposed model is formulated as a constraint optimization problem, which is further casted to a convex problem and solved via augmented Lagrangian multiplier method. Extensive experimental results on CCID2014, CSIQ, SIQAD and TID2013 databases show that the proposed semi-supervised image quality metric based on robust PCA (SIQMR) provides a more accurate prediction than other metrics on the human perception of contrast variations.
Enhancing the association in multi‐object tracking via neighbor graph

Most modern multi-object tracking (MOT) systems for videos follow the tracking-by-detection paradigm, where objects of interest are first located in each frame then associated correspondingly to form their intact trajectories. In this setting, the appearance features of objects usually provide the most important cues for data association, but it is very susceptible to occlusions, illumination variations, and inaccurate detections, thus easily resulting in incorrect trajectories. To address this issue, in this study we propose to make full use of the neighboring information. Our motivations derive from the observations that people tend to move in a group. As such, when an individual target's appearance is remarkably changed, the observer can still identify it with its neighbor context. To model the contextual information from neighbors, we first utilize the spatiotemporal relations among trajectories to efficiently select suitable neighbors for targets. Subsequently, we construct neighbor graph for each target and corresponding neighbors then employ the graph convolutional networks (GCNs) to model their relations and learn the graph features. To the best of our knowledge, it is the first time to explicitly leverage neighbor cues via GCN in MOT. Finally, standardized evaluations on the MOT16 and MOT17 data sets demonstrate that our approach can remarkably reduce the identity switches whilst achieve state-of-the-art overall performance.
EDNet: Efficient Disparity Estimation with Cost Volume Combination and Attention-based Spatial Residual

Existing state-of-the-art disparity estimation works mostly leverage the 4D concatenation volume and construct a very deep 3D convolution neural network (CNN) for disparity regression, which is inefficient due to the high memory consumption and slow inference speed. In this paper, we propose a network named EDNet for efficient disparity estimation. Firstly, we construct a combined volume which incorporates contextual information from the squeezed concatenation volume and feature similarity measurement from the correlation volume. The combined volume can be next aggregated by 2D convolutions which are faster and require less memory than 3D convolutions. Secondly, we propose an attention-based spatial residual module to generate attention-aware residual features. The attention mechanism is applied to provide intuitive spatial evidence about inaccurate regions with the help of error maps at multiple scales and thus improve the residual learning efficiency. Extensive experiments on the Scene Flow and KITTI datasets show that EDNet outperforms the previous 3D CNN based works and achieves state-of-the-art performance with significantly faster speed and less memory consumption.
Exploiting saliency in quality assessment for light field images

The evaluation of the quality of light field images is a demanding task given the peculiarities of this media. In the literature, attempts to assess quality have been done by considering specific coding approaches or visualization techniques. In this paper we intend to i) investigate whether the distortions of the light field are reflected in the distortion of the saliency map and ii) propose a metric for image quality assessment of light fields based on a convolutional neural network that exploits the measure of the distortion of the saliency map. In our tests, the annotated SMART dataset has been used. The achieved results confirm the importance of saliency for improving the performance of quality metrics.
Sandwiched Image Compression: Wrapping Neural Networks Around A Standard Codec

We sandwich a standard image codec between two neural networks: a preprocessor that outputs neural codes, and a postprocessor that reconstructs the image. The neural codes are compressed as ordinary images by the standard codec. Using differentiable proxies for both rate and distortion, we develop a rate-distortion optimization framework that trains the networks to generate neural codes that are efficiently compressible as images. This architecture not only improves rate-distortion performance for ordinary RGB images, but also enables efficient compression of alternative image types (such as normal maps of computer graphics) using standard image codecs. Results demonstrate the effectiveness and flexibility of neural processing in mapping a variety of input data modalities to the rigid structure of standard codecs. A surprising result is that the rate-distortion-optimized neural processing seamlessly learns to transport color images using a single-channel (grayscale) codec.
A Reliability Guaranteed Solution for Data Storing and Sharing

Digital data certified by a reputable organization are valuable digital data that can be stored or shared on the internet. However, the problems are: (1) How to ensure the anonymity of organizations on issued certificates? (2) How to ensure that valuable digital data are securely stored in the system? and (3) How could people verify the reliability of shared data while still ensuring the confidentiality of its content, and how to ensure that the data sharing process is safe, transparent, and fair? Therefore, we propose data producing, data storing, and data sharing schemas. In the data producing schema, we deploy a group signature scheme for a group of reputable organizations that provide the same type of service, an organization in the group generates a valuable digital data from raw data sent from a data owner and then issues a certificate on the ciphertext of this digital data. In the data storing schema, the data owner uploads his/her data to the public Inter-Planetary File System network and then stores the access address of the stored data and the corresponding certificate on the blockchain ledger. In the data sharing schema, everyone on the system could verify the reliability of shared data before sending a data sharing request to the data owner. The data sharing process is performed via a smart contract, and involved parties have to escrow to encourage honesty. The schemas of data storing and sharing guarantee the security properties including confidentiality, integrity, privacy, non-repudiation, and anonymity.
Cooperative route planning of multiple fuel-constrained Unmanned Aerial Vehicles with recharging on an Unmanned Ground Vehicle

Multiple small, low cost, multi-rotor Unmanned Aerial Vehicles (UAVs) are ideal for aerial surveillance over large areas. However, their limited battery capacity restricts them to areas in proximity of stationary recharging depots. One solution is to use an Unmanned Ground Vehicle (UGV) to provide a moving recharging depot. The problem is then to find the time-or energy-optimal paths for the multiple fuel-constrained UAVs to visit a set of mission points while being recharged by stopping at the UGV, whose path also needs to be determined. This is a combinatorial optimization problem that is computationally challenging, but may be solved relatively fast using heuristics. In this paper, we present two-level optimization that involves, (1) finding a UGV path by fixing waypoints using K-means and then formulating and solving a traveling salesman problem (TSP), and (2) finding paths for the multiple UAVs using a vehicle routing problem (VRP) formulation with capacity constraints, time windows, and dropped visits. We used constraint programming to solve these problems in less than a minute on a standard desktop computer for up to 25 mission points and 4 UAVs. Our main observation is that increasing the number of UAVs decreases the mission time and refueling stops, but does not decrease the total distance covered or total time taken.
Interpretable Graph Similarity Computation via Differentiable Optimal Alignment of Node Embeddings

Computing graph similarity is an important task in many graph-related applications such as retrieval in graph databases or graph clustering. While numerous measures have been proposed to capture the similarity between a pair of graphs, Graph Edit Distance (GED) and Maximum Common Subgraphs (MCS) are the two widely used measures in practice. GED and MCS are domain-agnostic measures of structural similarity between the graphs and define the similarity as a function of pairwise alignment of different entities (such as nodes, edges, and subgraphs) in the two graphs. The explicit explainability offered by the pairwise alignment provides transparency and justification of the similarity score, thus, GED and MCS have important practical applications. However, their exact computations are known to be NP-hard. While recently proposed neural-network based approximations have been shown to accurately compute these similarity scores, they have limited ability in providing comprehensive explanations compared to classical combinatorial algorithms, e.g., Beam search. This paper aims at efficiently approximating these domain-agnostic similarity measures through a neural network, and simultaneously learning the alignments (i.e., explanations) similar to those of classical intractable methods. Specifically, we formulate the similarity between a pair of graphs as the minimal "transformation" cost from one graph to another in the learnable node-embedding space. We show that, if node embedding is able to capture its neighborhood context closely, our proposed similarity function closely approximates both the alignment and the similarity score of classical methods. Furthermore, we also propose an efficient differentiable computation of our proposed objective for model training. Empirically, we demonstrate that the proposed method achieves up to 50%-100% reduction in the Mean Squared Error for the graph similarity approximation task and up to 20% improvement in the retrieval evaluation metrics for the graph retrieval task. The source code is available at https://github.com/khoadoan/GraphOTSim.
The Political Theory of Data: Institutions, Algorithms, &amp; Formats in Racial Redlining

Despite widespread recognition of an emergent politics of data in our midst, we strikingly lack a political theory of data. We readily acknowledge the presence of data across our political lives, but we often do not know how to conceptualize the politics of all those data points—the forms of power they constitute and the kinds of political subjects they implicate. Recent work in numerous academic disciplines is evidence of the first steps toward a political theory of data. This article maps some limits of this emergent literature with an eye to enriching its theoretical range. The literature on data politics, both within political theory and elsewhere, has thus far focused almost exclusively on the algorithm. This article locates a further dimension of data politics in the work of formatting technology or, more simply, formats. Formats are simultaneously conceptual and technical in the ways they define what can even count as data, and by extension who can count as data and how they can count. A focus on formats is of theoretical value because it provides a bridge between work on the conceptual contours of categories and the technology-centric literature on algorithms that tends to ignore the more conceptual dimensions of data technology. The political insight enabled by format theory is shown in the context of an extended interrogation of the politics of racialized redlining.
Deep Residual Dual-Attention Network for Super-Resolution Reconstruction of Remote Sensing Images

A super-resolution (SR) reconstruction of remote sensing images is becoming a highly active area of research. With increasing upscaling factors, richer and more abundant details can progressively be obtained. However, in comparison with natural images, the complex spatial distribution of remote sensing data increases the difficulty in its reconstruction. Furthermore, most SR reconstruction methods suffer from low feature information utilization and equal processing of all spatial regions of an image. To improve the performance of SR reconstruction of remote sensing images, this paper proposes a deep convolutional neural network (DCNN)-based approach, named the deep residual dual-attention network (DRDAN), which achieves the fusion of global and local information. Specifically, we have developed a residual dual-attention block (RDAB) as a building block in DRDAN. In the RDAB, we firstly use the local multi-level fusion module to fully extract and deeply fuse the features of the different convolution layers. This module can facilitate the flow of information in the network. After this, a dual-attention mechanism (DAM), which includes both a channel attention mechanism and a spatial attention mechanism, enables the network to adaptively allocate more attention to regions carrying high-frequency information. Extensive experiments indicate that the DRDAN outperforms other comparable DCNN-based approaches in both objective evaluation indexes and subjective visual quality.
“One-Shot” Super-Resolution via Backward Style Transfer for Fast High-Resolution Style Transfer

Owing to the excellent visual quality of results, Gatys et al.'s Neural Style Transfer (NST) online algorithm is regarded as the gold-standard in the community of NST, but this algorithm is quite time-consuming especially for high-resolution (HR) image. In this letter, we propose “One-Shot” super-resolution (SR) for fast high-resolution style transfer. We first generate a low-resolution (LR) stylized image by NST, and then use “One-Shot” super-resolution to restore the HR stylized image by learning the mapping relations between HR-LR stylized images from HR-LR style images. However, due to the style loss is not eliminated, there are some subtle but important fine-grained style differences between LR stylized and style images. These differences lead to the poor visual quality of SR results. To reduce the style differences further, we adjust the texture of LR style image to approach LR stylized image by backward style transfer. The result of backward style transfer will be treated as the LR part of the “One-Shot” example pair, which leads to a better SR. The experimental results show that with good visual quality, our method reduces the time consumption by 81.6%. Especially in a specific application scenario of fixed style image and changed content image, our method reduces the time consumption by 89.3%.
Wavelet method optimised by ant colony algorithm used for extracting stable and unstable signals in intelligent substations

Partial discharge (PD) signals are an important index to evaluate the operation state of intelligent substations. The correct distinction of PD pulse and interference pulse has become a challenging task. Because of the noise and the low signal-to-noise ratio, the stable signals become non-stationary. The selection of a wavelet basis, the selection rule of threshold λ and the design of the threshold function are the key factors affecting the final denoising effect. Therefore, an enhanced ant colony optimisition wavelet (ACOW) algorithm was applied to find the global optimal threshold through the continuous derivative threshold function and the ant colony optimisation (ACO) algorithm. At the same time the efficiency of adaptive search calculation, was also significantly improved. The method of the ACOW algorithm was compared with the soft wavelet method, gradient-based wavelet method and the genetic optimisation wavelet (GOW) method. Using these four methods to denoise four typical signals, different mean square errors (MSE), magnitude errors (ME) and time costs were obtained. Interestingly, the results show that the ACOW method can achieve the minimum MSE and has less time cost. It generates significantly smaller waveform distortion than the other three threshold estimation methods. In addition, the high efficiency and good quality of the output signals are beneficial to the diagnosis of local discharge signals in intelligent substations.
A New Approach for Optimization of Distributed Quantum Circuits

Abstract In the present work, a novel approach was proposed to optimize the teleportation cost in Distributed Quantum Circuits (DQCs) by applying a new approach. To overcome the difficulty with keeping a large number of qubits next to each other, DQCs, as a well-known solution, have always been employed. In a distributed quantum system, qubits are transferred from a subsystem to another subsystem by a quantum protocol such as teleportation. First, we proposed a heuristic approach through which we could replace the equivalent circuits in the initial quantum circuit. Then, we used a genetic algorithm to partition the placement of qubits so that the number of teleportations could be optimized for the communications of a DQC. Finally, results showed that the proposed approach could impressively work.
Privacy‐preserving mechanism for mixed data clustering with local differential privacy

Summary In big data mining, the K‐prototypes has become a popular clustering method for mixed data owing to its simplicity and efficiency. However, the data clustering process of the K‐prototypes method will cause the risk of user privacy leakage because user data usually contain sensitive information. To address this issue, general solutions introduce a trusted third‐party model for privacy protection in clustering analysis, but it is difficult to find a fully trusted entity in reality. In this article, we propose a local differential privacy K‐prototypes (LDPK) mechanism, which does not require any trusted third party to perform privacy preprocessing on user data. Our mechanism first uses local differential privacy to disturb user data, then completes the clustering through the interaction between server and user. Furthermore, we propose a privacy protection enhancement mechanism (ELDPK) by extending the LDPK mechanism, which disturbs the user's clustering information in each iteration to protect user privacy further. Theoretical analysis proves the privacy and feasibility of our proposed scheme, and the experimental results prove that our proposed scheme can guarantee the quality of the clustering results under the premise of satisfying the local differential privacy.
Three dimensional tracking of a maneuvering emitter utilizing doppler-bearing measurements of a constant velocity observer

This manuscript handles a 3-D tracking problem, in which a 3-D observer with a constant velocity estimates the emitter state (position and velocity) while measuring the emitter's elevation, azimuth angle, and doppler frequency. Conventional tracking filters are built assuming a constant velocity emitter, thus have difficulty in tracking a maneuvering emitter. This manuscript introduces the filter restart approach for tracking a maneuvering emitter in 3-D environments. As far as we know, this manuscript is novel in 3-D doppler-bearing problems so that a constant velocity observer can track a maneuvering emitter with zigzag trajectories. This paper is unique in presenting the observability analysis of 3-D doppler-bearing problems. The performance of the proposed tracking filter is verified by comparing it with 3-D Interacting Multiple Model Kalman filters under MATLAB simulations.