Reviewerly/exHarmony huggingface dataset:
The Digitalization Transformation of Commercial Banks and Its Impact on Sustainable Efficiency Improvements through Investment in Science and Technology

The COVID-19 epidemic has accelerated the digital economy’s pervasiveness throughout the Chinese economy, leading to a sharp rise in demand for “contactless” services in the financial industry. We examine the digital transformation of the Chinese banking industry using the DEA–Malmquist index method, supplemented by a distance function and time to compare the dynamic changes of productivity. Our paper then conducts an empirical study on the digital transformation of Chinese commercial banks based on their improvements in efficiency. We analyze banks with superior efficiency in science and technology investment and evaluate their digital maturity and digital transformation experience. Results show that digitalization investment has contributed to substantial production efficiency improvement for commercial banks; however, heterogeneity exists across banks. We further advocate a path for banks’ digital transformation based on theoretical research and empirical digital transformation experience in this area.
A secure and efficient certificateless signature scheme for Internet of Things

The Internet of Things (IoT) is a new technological innovation, which makes things intelligent and our life more convenient. To ensure secure communication between smart objects in the IoT, certificateless signature is a feasible cryptographic tool to provide data integrity and identity authentication, which eliminates the cumbersome certificate management in the certificate-based signature system, as well as the key escrow problem in the identity-based cryptosystem. However, most of the existing certificateless signature schemes are not all secure to resist various attacks, such as public key replacement attacks or malicious-but-passive key-generation-center attacks. Besides, due to the limited storage and processing capabilities of these smart things, they are unable to meet the real-time demands of the IoT completely. This paper first analyzes Jia’s scheme. We prove that the claimed solution is not resistant to the Type II strong adversaries. Then, we propose a novel certificateless signature scheme and prove its existentially unforgeable under the elliptic curve discrete logarithm problem assumption. Finally, the comprehensive performance evaluations indicate that, at the same security level, our scheme is more efficient than other certificateless signature schemes and is well suitable for the resource-constrained IoT environment.
Recursive elimination–election algorithms for wrapper feature selection

For classification tasks in machine learning, this paper proposes a brand-new wrapper feature selection algorithm prototype named recursive elimination–election (REE), which is conceived in a simple but exquisite structure inspired by the recursion technique in computer science. Prevalent metaheuristic methods such as differential evolution (DE), particle swarm optimization (PSO), etc., from evolutionary computation (EC) and swarm intelligence (SI) communities have recently been widely applied to feature selection research, but suffer from severe drawbacks including but not limited to low-efficient binary representation transformation, poor population diversity, excessive control parameter adjustments and sophisticated mechanisms. Instead, REE is organically constructed with an ordinary subset representation of feature indexes, simple operators, getting rid of extra control parameters. Specifically, REE is assembled of two basic recursive sub-algorithms, i.e., recursive random bisection elimination (RRBE) and recursive greedy binary election (RGBE), which somewhat embody the idea of “divide-and-conquer”. By inspecting smaller and potential feature subsets in recursive ways, better subsets are returned automatically. A comprehensive experimental study was conducted on 14 UCI and ASU benchmark datasets with feature sizes ranging from dozens to thousands by using REE together with 6 state-of-the-art metaheuristic algorithms for comparison. The results show that the proposed REE has competitive search ability for feature selection problems, and it is especially prominent in handling high-dimensional datasets. Therefore, REE is promising to become a wrapper feature selection search paradigm with low solution cost and high efficiency.
Deep Reinforcement Learning for Mapless Navigation of a Hybrid Aerial Underwater Vehicle with Medium Transition

Since the application of Deep Q-Learning to the continuous action domain in Atari-like games, Deep Reinforcement Learning (Deep-RL) techniques for motion control have been qualitatively enhanced. Nowadays, modern Deep-RL can be successfully applied to solve a wide range of complex decision-making tasks for many types of vehicles. Based on this context, in this paper, we propose the use of Deep-RL to perform autonomous mapless navigation for Hybrid Unmanned Aerial Underwater Vehicles (HUAUVs), robots that can operate in both, air or water media. We developed two approaches, one deterministic and the other stochastic. Our system uses the relative localization of the vehicle and simple sparse range data to train the network. We compared our approaches with an adapted version of the BUG2 algorithm for mapless navigation of aerial vehicles. Based on experimental results, we can conclude that Deep-RL-based approaches can be successfully used to perform mapless navigation and obstacle avoidance for HUAUVs. Our vehicle accomplished the navigation in two scenarios, being capable to achieve the desired target through both environments, and even outperforming the behavior-based algorithm on the obstacle-avoidance capability.
NavRep: Unsupervised Representations for Reinforcement Learning of Robot Navigation in Dynamic Human Environments

Robot navigation is a task where reinforcement learning approaches are still unable to compete with traditional path planning. State-of-the-art methods differ in small ways, and do not all provide reproducible, openly available implementations. This makes comparing methods a challenge. Recent research has shown that unsupervised learning methods can scale impressively, and be leveraged to solve difficult problems. In this work, we design ways in which unsupervised learning can be used to assist reinforcement learning for robot navigation. We train two end-to-end, and 18 unsupervised-learning-based architectures, and compare them, along with existing approaches, in unseen test cases. We demonstrate our approach working on a real life robot. Our results show that unsupervised learning methods are competitive with end-to-end methods. We also highlight the importance of various components such as input representation, predictive unsupervised learning, and latent features. We make all our models publicly available, as well as training and testing environments, and tools <sup>1</sup>. This release also includes OpenAI-gym-compatible environments designed to emulate the training conditions described by other papers, with as much fidelity as possible. Our hope is that this helps in bringing together the field of RL for robot navigation, and allows meaningful comparisons across state-of-the-art methods.
Auto-Tuned Sim-to-Real Transfer

Policies trained in simulation often fail when transferred to the real world due to the &#x2018;reality gap&#x2019; where the simulator is unable to accurately capture the dynamics and visual properties of the real world. Current approaches to tackle this problem, such as domain randomization, require prior knowledge and engineering to determine how much to randomize system parameters in order to learn a policy that is robust to sim-to-real transfer while also not being too conservative. We propose a method for automatically tuning simulator system parameters to match the real world using only raw RGB images of the real world without the need to define rewards or estimate state. Our key insight is to reframe the auto-tuning of parameters as a search problem where we iteratively shift the simulation system parameters to approach the real world system parameters. We propose a Search Param Model (SPM) that, given a sequence of observations and actions and a set of system parameters, predicts whether the given parameters are higher or lower than the true parameters used to generate the observations. We evaluate our method on multiple robotic control tasks in both sim-to-sim and sim-to-real transfer, demonstrating significant improvement over naive domain randomization. Project videos at https://yuqingd.github.io/autotuned-sim2real/.
Feedback Network for Mutually Boosted Stereo Image Super-Resolution and Disparity Estimation

Under stereo settings, the problem of image super-resolution (SR) and disparity estimation are interrelated that the result of each problem could help to solve the other. The effective exploitation of correspondence between different views facilitates the SR performance, while the high-resolution (HR) features with richer details benefit the correspondence estimation. According to this motivation, we propose a Stereo Super-Resolution and Disparity Estimation Feedback Network (SSRDE-FNet), which simultaneously handles the stereo image super-resolution and disparity estimation in a unified framework and interact them with each other to further improve their performance. Specifically, the SSRDE-FNet is composed of two dual recursive sub-networks for left and right views. Besides the cross-view information exploitation in the low-resolution (LR) space, HR representations produced by the SR process are utilized to perform HR disparity estimation with higher accuracy, through which the HR features can be aggregated to generate a finer SR result. Afterward, the proposed HR Disparity Information Feedback (HRDIF) mechanism delivers information carried by HR disparity back to previous layers to further refine the SR image reconstruction. Extensive experiments demonstrate the effectiveness and advancement of SSRDE-FNet.
Rank-driven salp swarm algorithm with orthogonal opposition-based learning for global optimization

Salp swarm algorithm (SSA) is a relatively new and straightforward swarm-based meta-heuristic optimization algorithm, which is inspired by the flocking behavior of salps when foraging and navigating in oceans. Although SSA is very competitive, it suffers from some limitations including unbalanced exploration and exploitation operation, slow convergence. Therefore, this study presents an improved version of SSA, called OOSSA, to enhance the comprehensive performance of the basic method. In preference, a new opposition-based learning strategy based on optical lens imaging principle is proposed, and combined with the orthogonal experimental design, an orthogonal lens opposition-based learning technique is designed to help the population jump out of a local optimum. Next, the scheme of adaptively adjusting the number of leaders is embraced to boost the global exploration capability and improve the convergence speed. Also, a dynamic learning strategy is applied to the canonical methodology to improve the exploitation capability. To confirm the efficacy of the proposed OOSSA, this paper uses 26 standard mathematical optimization functions with various features to test the method. Alongside, the performance of the proposed methodology is validated by Wilcoxon signed-rank and Friedman statistical tests. Additionally, three well-known engineering optimization problems and unknown parameters extraction issue of photovoltaic model are applied to check the ability of the OOSA algorithm to obtain solutions to intractable real-world problems. The experimental results reveal that the developed OOSSA is significantly superior to the standard SSA, currently popular SSA-based algorithms, and other state-of-the-artmeta-heuristic algorithms for solving numerical optimization, real-world engineering optimization, and photovoltaic model parameter extraction problems. Finally, an OOSSA-based path planning approach is developed for creating the shortest obstacle-free route for autonomous mobile robots. Our introduced method is compared with several successful swarm-based metaheuristic techniques in five maps, and the comparative results indicate that the suggested approach can generate the shortest collision-free trajectory as compared to other peers.
Globally and Locally Semantic Colorization via Exemplar-Based Broad-GAN

Given a target grayscale image and a reference color image, exemplar-based image colorization aims to generate a visually natural-looking color image by transforming meaningful color information from the reference image to the target image. It remains a challenging problem due to the differences in semantic content between the target image and the reference image. In this paper, we present a novel globally and locally semantic colorization method called exemplar-based conditional broad-GAN, a broad generative adversarial network (GAN) framework, to deal with this limitation. Our colorization framework is composed of two sub-networks: the match sub-net and the colorization sub-net. We reconstruct the target image with a dictionary-based sparse representation in the match sub-net, where the dictionary consists of features extracted from the reference image. To enforce global-semantic and local-structure self-similarity constraints, global-local affinity energy is explored to constrain the sparse representation for matching consistency. Then, the matching information of the match sub-net is fed into the colorization sub-net as the perceptual information of the conditional broad-GAN to facilitate the personalized results. Finally, inspired by the observation that a broad learning system is able to extract semantic features efficiently, we further introduce a broad learning system into the conditional GAN and propose a novel loss, which substantially improves the training stability and the semantic similarity between the target image and the ground truth. Extensive experiments have shown that our colorization approach outperforms the state-of-the-art methods, both perceptually and semantically.
ROSITA: Enhancing Vision-and-Language Semantic Alignments via Cross- and Intra-modal Knowledge Integration

Vision-and-language pretraining (VLP) aims to learn generic multimodal representations from massive image-text pairs. While various successful attempts have been proposed, learning fine-grained semantic alignments between image-text pairs plays a key role in their approaches. Nevertheless, most existing VLP approaches have not fully utilized the intrinsic knowledge within the image-text pairs, which limits the effectiveness of the learned alignments and further restricts the performance of their models. To this end, we introduce a new VLP method called ROSITA, which integrates the cross- and intra-modal knowledge in a unified scene graph to enhance the semantic alignments. Specifically, we introduce a novel structural knowledge masking (SKM) strategy to use the scene graph structure as a priori to perform masked language (region) modeling, which enhances the semantic alignments by eliminating the interference information within and across modalities. Extensive ablation studies and comprehensive analysis verifies the effectiveness of ROSITA in semantic alignments. Pretrained with both in-domain and out-of-domain datasets, ROSITA significantly outperforms existing state-of-the-art VLP methods on three typical vision-and-language tasks over six benchmark datasets.
An Ontology Model for Climatic Data Analysis

Recently ontologies have been exploited in a wide range of research areas for data modeling and data management. They greatly assists in defining the semantic model of the underlying data combined with domain knowledge. In this paper, we propose the Climate Analysis (CA) Ontology to model climate datasets used by remote sensing analysts. We use the data published by National Oceanic and Atmospheric Administration (NOAA) to further explore how ontology modeling can be used to facilitate the field of climatic data processing. The idea of this work is to convert relational climate data to the Resource Description Framework (RDF) data model, so that it can be stored in a graph database and easily accessed through the Web as Linked Data. Typically, this provides climate researchers, who are interested in datasets such as NOAA, with the potential of enriching and interlinking with other databases. As a result, our approach facilitates data integration and analysis of diverse climatic data sources and allows researchers to interrogate these sources directly on the Web using the standard SPARQL query language.
Pose Transformers (POTR): Human Motion Prediction with Non-Autoregressive Transformers

We propose to leverage Transformer architectures for non-autoregressive human motion prediction. Our approach decodes elements in parallel from a query sequence, instead of conditioning on previous predictions such as in state-of-the-art RNN-based approaches. In such a way our approach is less computational intensive and potentially avoids error accumulation to long term elements in the sequence. In that context, our contributions are fourfold: (i) we frame human motion prediction as a sequence-to-sequence problem and propose a non-autoregressive Transformer to infer the sequences of poses in parallel; (ii) we propose to decode sequences of 3D poses from a query sequence generated in advance with elements from the input sequence; (iii) we propose to perform skeleton-based activity classification from the encoder memory, in the hope that identifying the activity can improve predictions; (iv) we show that despite its simplicity, our approach achieves competitive results in two public datasets, although surprisingly more for short term predictions rather than for long term ones.
A high-resolution seismic catalog for the 2021 MS6.4/MW6.1 Yangbi earthquake sequence, Yunnan, China: Application of AI picker and matched filter

We present a high-resolution seismic catalog for the 2021 MS6.4/MW6.1 Yangbi sequence. The catalog has a time range of 2021-05-01 to 2021-05-28, and contains ~8,000 well located events. It captures the features of the whole foreshock sequence and the early aftershocks. We designed a detection strategy incorporating both an artificial intelligent (AI) picker and a matched filter algorithm. Here, we adopt a hybrid AI method incorporating convolutional and recurrent neural network (CNN & RNN) for event detection and phase picking respectively (i.e. CERP), a light-weight AI picker that can be trained with small volume of data. CERP is first trained with detections from a STA/LTA and Kurtosis-based method called PAL, and then construct a rather complete template set of ~4,000 events. Finally, the matched filter algorithm MESS augments the initial detections and measures differential travel times with cross-correlation, which finally results in precise relocation. This process gives 9,026 detections, among which 7,943 events can be well relocated. The catalog shows as expected power-law distribution of frequency magnitude and reveals detailed pattern of seismicity evolution. The main features are: (1) the foreshock sequence images simple fault geometry with consistent strike, but also show a variable event depth along strike; (2) the mainshock ruptures the same fault of the foreshock sequence and activate conjugate faults further to the southeast; (3) complex seismicity are developed in the post-seismic period, indicating complex triggering mechanisms. Thus, our catalog provides a reliable basis for further investigations, such as b-value studies, rupture process, and triggering relations.
A Survey of Computer-Aided Tumor Diagnosis Based on Convolutional Neural Network

Tumors are new tissues that are harmful to human health. The malignant tumor is one of the main diseases that seriously affect human health and threaten human life. For cancer treatment, early detection of pathological features is essential to reduce cancer mortality effectively. Traditional diagnostic methods include routine laboratory tests of the patient's secretions, and serum, immune and genetic tests. At present, the commonly used clinical imaging examinations include X-ray, CT, MRI, SPECT scan, etc. With the emergence of new problems of radiation noise reduction, medical image noise reduction technology is more and more investigated by researchers. At the same time, doctors often need to rely on clinical experience and academic background knowledge in the follow-up diagnosis of lesions. However, it is challenging to promote clinical diagnosis technology. Therefore, due to the medical needs, research on medical imaging technology and computer-aided diagnosis appears. The advantages of a convolutional neural network in tumor diagnosis are increasingly obvious. The research on computer-aided diagnosis based on medical images of tumors has become a sharper focus in the industry. Neural networks have been commonly used to research intelligent methods to assist medical image diagnosis and have made significant progress. This paper introduces the traditional methods of computer-aided diagnosis of tumors. It introduces the segmentation and classification of tumor images as well as the diagnosis methods based on CNN to help doctors determine tumors. It provides a reference for developing a CNN computer-aided system based on tumor detection research in the future.
Neural and Attentional Factorization Machine-Based Web API Recommendation for Mashup Development

The wide adoption of Service Oriented Architecture (SOA) has driven the creation of a massive amount of applications on the Internet, which includes the popular Mashups composed from multiple existing Web APIs. The availability of a large number of Web APIs with diverse functionalities on the Web makes it difficult for users to find APIs meeting their needs for Mashup development. To relieve this difficulty, recommending Web APIs for Mashup development has become an effective solution. A dozen of service recommendation approaches were proposed based on multi-dimensional features extracted from the service repository over the last couple of years, e.g., similarity based matching methods, matrix factorization based models, and factorization machine based models. Among these existing works, Factorization Machine (FM) based models, in particular the deep learning based FM models, have shown better performance compared with other conventional collaborative filtering techniques. Despite their superiority, the deep learning based FMs still have some strong model assumptions that can harm the recommendation accuracy. For example, it models factorized interactions with the same weight and ignores the non-linear and complex inherent structure in data. In a real-world service recommendation scenario, different predictor variables usually have different predictive power and not all features are predictable for estimating the target. Also, higher-order feature interactions are usually underlain in complex user-service environments. To address these deficiencies, this paper proposes a hybrid factorization machine model with a novel neural network architecture, named NAFM, which integrates a deep neural network to capture the non-linear and complex feature interactions and uses an attention mechanism to capture the varying importance of feature interactions. Comprehensive experiments are conducted on a real-world dataset from ProgrammableWeb. The experimental results show that the proposed approach outperforms the existing state-of-the-art models for service recommendation.