Reviewerly/exHarmony huggingface dataset:
Research on Path Planning and Trajectory Tracking of an Unmanned Electric Shovel Based on Improved APF and Preview Deviation Fuzzy Control

With the development and upgrading of intelligent mines, research on the unmanned walking of intelligent electric shovels (ES) has been carried out to improve the moving efficiency of extra-large excavators. This paper first introduces an electric shovel’s primary moving condition in an open-pit mine. According to the moving characteristics of the heavy-duty crawler, the artificial potential field (APF) algorithm is improved to plan the moving trajectory of the electric shovel and carry out simulation verification. A dynamic model of an electric shovel is established. A fuzzy control tracking method is proposed based on preview displacement and centroid displacement deviation. The robustness of the tracking algorithm is verified by multi-condition simulation. Finally, the electric shovel prototype is tested through path planning and tracking experiments. The experimental results show that the improved artificial potential field algorithm can plan an obstacle-free path that satisfies the movement of an electric shovel, and the electric shovel can quickly track the preset trajectory. The maximum deviation of the track tracking center of mass is no more than 10 cm, and the deviation of the heading angle when the shovel reaches the endpoint is within 2°.
Artificial intelligence for topic modelling in Hindu philosophy: Mapping themes between the Upanishads and the Bhagavad Gita

A distinct feature of Hindu religious and philosophical text is that they come from a library of texts rather than single source. The Upanishads is known as one of the oldest philosophical texts in the world that forms the foundation of Hindu philosophy. The Bhagavad Gita is core text of Hindu philosophy and is known as a text that summarises the key philosophies of the Upanishads with major focus on the philosophy of karma. These texts have been translated into many languages and there exists studies about themes and topics that are prominent; however, there is not much study of topic modelling using language models which are powered by deep learning. In this paper, we use advanced language produces such as BERT to provide topic modelling of the key texts of the Upanishads and the Bhagavad Gita. We analyse the distinct and overlapping topics amongst the texts and visualise the link of selected texts of the Upanishads with Bhagavad Gita. Our results show a very high similarity between the topics of these two texts with the mean cosine similarity of 73%. We find that out of the fourteen topics extracted from the Bhagavad Gita, nine of them have a cosine similarity of more than 70% with the topics of the Upanishads. We also found that topics generated by the BERT-based models show very high coherence as compared to that of conventional models. Our best performing model gives a coherence score of 73% on the Bhagavad Gita and 69% on The Upanishads. The visualization of the low dimensional embeddings of these texts shows very clear overlapping among their topics adding another level of validation to our results.
pyBumpHunter: A model independent bump hunting tool in Python for high energy physics analyses

The BumpHunter algorithm is widely used in the search for new particles in High Energy Physics analysis. This algorithm offers the advantage of evaluating the local and global p-values of a localized deviation in the observed data without making any hypothesis on the supposed signal. The increasing popularity of the Python programming language motivated the development of a new public implementation of this algorithm in Python, called pyBumpHunter, together with several improvements and additional features. It is the first public implementation of the BumpHunter algorithm to be added to Scikit-HEP. This paper presents in detail the BumpHunter algorithm as well as all the features proposed in this implementation. All these features have been tested in order to demonstrate their behaviour and performance.
Three-tier Storage Framework Based on TBchain and IPFS for Protecting IoT Security and Privacy

Recently, most of the Internet of things (IoT) infrastructures are highly centralized with single points of failure, which results in serious security and privacy issues of IoT data. Fortunately, blockchain technique can provide a decentralized and secure IoT framework to deal with security issues based on the characteristics of decentralization, non-tampering, openness, transparency, and traceability. However, the blockchain consensus protocol guarantees the safety and reliability of data, but it also brings problems such as scalability limitations and poor storage extensibility, resulting in the inability to directly integrate blockchain and the IoT in existing conditions. In this article, a private three-tier local blockchain, Three-tier architecture Blockchain (TBchain), is proposed to solve the problem by splitting part of the transactions in the public blockchain and locking them in a higher-level blockchain TBchain. Additionally, the private blockchain TBchain is connected to the public blockchain to build a hierarchical blockchain network to provide privacy protection for the IoT data stored on the blockchain. Finally, we implement an IoT framework based on TBchain and the InterPlanetary File System (IPFS) to realize the decentralized IoT, which guarantees the user’s access control right to personal data. Experimental results show that the IoT framework based on TBchain and IPFS realizes the user’s access control right to personal data by verifying in advance to ensure the confidentiality and security of shared data, and improves the security and privacy of IoT data and transactions. Moreover, we prove that the scalability and storage extensibility of the blockchain is positively correlated with the number of data blocks in TBchain.
Combination of explicit segmentation with Seq2Seq recognition for fine analysis of children handwriting

We consider the task of analyzing children handwriting in the context of a dictation task. The objective is to detect orthographic and phonological errors. To achieve this goal, we extend an existing handwriting analysis engine, based on an explicit segmentation of the handwritten input, originally developed for children copying exercises. We present a new approach, based on the combination of this analysis engine with a deep learning word recognition approach in order to improve both the recognition and segmentation performance. Explicit segmentation needs prior knowledge, and the deep network recognition predictions are a reliable approximation of the ground truth which can guide the analysis process. We propose to combine multiple prior knowledge strategies to further improve the analysis performance. Furthermore, we exploit the deep network approximate implicit segmentation to optimize the existing analysis process in terms of complexity.
Drone Detection and Classification Using Physical-Layer Protocol Statistical Fingerprint

We propose a novel approach for drone detection and classification based on RF communication link analysis. Our approach analyses large signal record including several packets and can be decomposed of two successive steps: signal detection and drone classification. On one hand, the signal detection step is based on Power Spectral Entropy (PSE), a measure of the energy distribution uniformity in the frequency domain. It consists of detecting a structured signal such as a communication signal with a lower PSE than a noise one. On the other hand, the classification step is based on a so-called physical-layer protocol statistical fingerprint (PLSPF). This method extracts the packets at the physical layer using hysteresis thresholding, then computes statistical features for classification based on extracted packets. It consists of performing traffic analysis of communication link between the drone and its controller. Conversely to classic drone traffic analysis working at data link layer (or at upper layers), it performs traffic analysis directly from the corresponding I/Q signal, i.e., at the physical layer. The approach shows interesting properties such as scale invariance, frequency invariance, and noise robustness. Furthermore, the classification method allows us to distinguish WiFi drones from other WiFi devices due to underlying requirement of drone communications such as good reactivity in control. Finally, we propose different experiments to highlight theses properties and performances. The physical-layer protocol statistical fingerprint exploiting communication specificities could also be used in addition of RF fingerprinting method to perform authentication of devices at the physical-layer.
Cyberspace Ecologism 4.0: Between Software Softeners of and Hardware Hardships on the Natural Environment

Planet Earth, with its plethora of natural (im)balances, has a venerable age of 4.54 billion years; the (industrial) imprint placed by the human species on it, considered to be not negligible, counts of just little over two centuries; while the digital/IT&C/virtual existence of man, in what we call cyberspace, is reduced to just a few decades.An amorphous world, hastily assimilated to the Internet, the cyberspace is the sum or, better said, the synergy created by links between computers (and other compatible devices), servers, routers and various items of global IT and telecommunications infrastructures.A sort of fiefdom for tech computing power, but also a field of geo-political-economic power calculus, the cyberspace raises another dilemma: is it the salutary alternative to the bodice of a physical environment subject to depletion/plunder and degradation/pollution of its scarce resources?This article aims to capture, in an original way, how the translation of a great part of the world and social life into cyberspace, especially in the wake of the Fourth Industrial Revolution, relieves the natural environment/climate of Anthropocene pressures (e.g., via optimizations of production processes, favoured by artificial intelligence etc.), or, on the contrary, a less noticeable aspect, how it worsens certain components of it (e.g., via the amplified need for energy or for rare minerals, critical to new technologies etc.).Moreover, the above-mentioned ecological alleviations (labelled as of software nature) and (hardware) aggravations brought by digitalization are duly emphasized and evaluated in the light of the (un)intended consequences occurring at the highly sensitive intersection between markets (private practices) and states (public policies), pointing to the case of the European Union.
Searching a High Performance Feature Extractor for Text Recognition Network

Feature extractor plays a critical role in text recognition (TR), but customizing its architecture is relatively less explored due to expensive manual tweaking. In this work, inspired by the success of neural architecture search (NAS), we propose to search for suitable feature extractors. We design a domain-specific search space by exploring principles for having good feature extractors. The space includes a 3D-structured space for the spatial model and a transformed-based space for the sequential model. As the space is huge and complexly structured, no existing NAS algorithms can be applied. We propose a two-stage algorithm to effectively search in the space. In the first stage, we cut the space into several blocks and progressively train each block with the help of an auxiliary head. We introduce the latency constrain into the second stage and search sub-network from the trained supernet via natural gradient descent. In experiments, a series of ablation studies are performed to better understand the designed space, search algorithm, and searched architectures. We also compare the proposed method with various state-of-the-art ones on both hand-written and scene TR tasks. Extensive results show that our approach can achieve better recognition performance with less latency. Code is avaliable at <uri xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">https://github.com/AutoML-Research/TREFE</uri>
Accurate and Robust Lesion RECIST Diameter Prediction and Segmentation with Transformers

Automatically measuring lesion/tumor size with RECIST (Response Evaluation Criteria In Solid Tumors) diameters and segmentation is important for computer-aided diagnosis. Although it has been studied in recent years, there is still space to improve its accuracy and robustness, such as (1) enhancing features by incorporating rich contextual information while keeping a high spatial resolution and (2) involving new tasks and losses for joint optimization. To reach this goal, this paper proposes a transformer-based network (MeaFormer, Measurement transFormer) for lesion RECIST diameter prediction and segmentation (LRDPS). It is formulated as three correlative and complementary tasks: lesion segmentation, heatmap prediction, and keypoint regression. To the best of our knowledge, it is the first time to use keypoint regression for RECIST diameter prediction. MeaFormer can enhance high-resolution features by employing transformers to capture their long-range dependencies. Two consistency losses are introduced to explicitly build relationships among these tasks for better optimization. Experiments show that MeaFormer achieves the state-of-the-art performance of LRDPS on the large-scale DeepLesion dataset and produces promising results of two downstream clinic-relevant tasks, i.e., 3D lesion segmentation and RECIST assessment in longitudinal studies.
A Novel Data-Driven Weighted Sentiment Analysis with an Application for Online Medical Review

Online reviews provide a lot of information for analyzing consumers' satisfaction with products.However, traditional methods analyze overall online reviews, which not only wastes human and material resources, but also produces data analysis deviation.Meanwhile, traditional methods cannot accurately mine the novel features of products after software update.Therefore, a new data-driven method is proposed to overcome the shortcomings of the traditional method.We screen helpful reviews through information entropy to get the product features that customers really care about.We also utilize the uncertainty of information entropy to find the product features that customers follow with interest.Then we obtain the ranking of customer satisfaction with products by weighted sentiment analysis of product features.A case of medical APP is used to verify the availability and effectiveness of the proposed method.The results show that using 56.72% of the original data, 92% of the consistent results can be achieved, and 8% of the novel features can be discovered.Our research method can also be applied to environmental science and other fields.Finally, some interesting conclusions and future research directions are given.
Leakage-Resilient Anonymous Multireceiver Certificateless Encryption Resistant to Side-Channel Attacks

Anonymous multireceiver encryption (AMRE) allows a data provider to transmit a ciphertext to a designated group of receivers. Any receiver of the designated group can get the plaintext by decrypting this ciphertext while the receiver's identity is concealed to other receivers. In the past, several anonymous multireceiver certificateless encryption (AMR-CLE) schemes based on the certificateless public-key cryptography (CL-PKC) were proposed to remove both the certificate management problem of AMRE schemes based on the conventional public-key cryptography and the key escrow problem of AMR-IBE schemes based on the ID-based public-key cryptography. Recently, side-channel attacks endanger the existing cryptographic schemes, AMRE, AMR-IBE, AMR-CLE, etc. To resist to such attacks, leakage-resilient cryptography is a novel way. However, until now, there exists no multireceiver encryption or AMRE scheme resistant to side-channel attacks. In this article, we present the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$first$</tex-math></inline-formula> leakage-resilient anonymous multireceiver certificateless encryption (LR-AMR-CLE) scheme. In our scheme, attackers are granted to repeatedly extract fractional content of each secret key participated in our scheme and retains the original security of AMR-CLE schemes.
Advanced Drone Swarm Security by Using Blockchain Governance Game

This research contributes to the security design of an advanced smart drone swarm network based on a variant of the Blockchain Governance Game (BGG), which is the theoretical game model to predict the moments of security actions before attacks, and the Strategic Alliance for Blockchain Governance Game (SABGG), which is one of the BGG variants which has been adapted to construct the best strategies to take preliminary actions based on strategic alliance for protecting smart drones in a blockchain-based swarm network. Smart drones are artificial intelligence (AI)-enabled drones which are capable of being operated autonomously without having any command center. Analytically tractable solutions from the SABGG allow us to estimate the moments of taking preliminary actions by delivering the optimal accountability of drones for preventing attacks. This advanced secured swarm network within AI-enabled drones is designed by adapting the SABGG model. This research helps users to develop a new network-architecture-level security of a smart drone swarm which is based on a decentralized network.
Intelligent Recognition of Traffic Signs Based on Improved YOLO v3 Algorithm

In recent years, assisted driving and autonomous driving technology have been paid more attention to by the public. Road sign recognition is of great practical significance for the realization of auto-driving technology. In the actual traffic environment, the traffic signs have the problems of small detectable volume, low resolution, unclear characteristics, and easy to be disturbed by the environment. In order to better realize road traffic sign recognition, this paper improves and optimizes the YOLO v3 network derived from YOLO v3 structure algorithm, enhances the data of the traffic signs by using color enhancement and other technologies, and improves the original FPN structure of the YOLO v3 network algorithm to 52 × 52. Then, the secondary sampling output characteristic diagram 108 in the YOLO v3 network is used × 108 solutions to solve these difficulties of picture size and image distortion. Use 5, 9, and 13 fixed-size pools in front of the surface of the control architecture, then the output characteristics are associated with the original characteristics of the picture so that inputs of different sizes can obtain the same output. Finally, we use the intermediate class K algorithm to group the TT100K landmark data set, reconsider the original network parameters, and compare the TT100K data set with the small target determination algorithm, such as YOLO v3 network model and improved YOLO v3 network model. The results show that compared with the traditional YOLO v3 algorithm, the optimized YOLO v3 road sign recognition algorithm has a significant improvement in sign recognition accuracy, sign recognition speed, and learning cost. When the change of FPS is very small, the recall rate and accuracy will be greatly improved. At the same time, compared with other small target detection algorithms, the improved YOLO v3 algorithm has more accurate and faster detection accuracy.
Towards Pragmatic Explanations for Domain Ontologies

Ontologies have gained popularity in a wide range of research fields, in the domains where possible interpretations of terms have to be narrowed and there is a need for explicit inter-relations of concepts. Although reusability has always been claimed as one of the main characteristics of ontologies, it has been shown that reusing domain ontologies is not a common practice. Perhaps this is due to the fact that despite a large number of works towards complexity management of ontologies, popular systems do not incorporate enough functionality for ontology explanation. We analyse the state of the art and substantiate a minimal functionality that the system should provide in order to make domain ontologies better understandable for their users.
Knowledge Graph Alignment Network with Node-Level Strong Fusion

Entity alignment refers to the process of discovering entities representing the same object in different knowledge graphs (KG). Recently, some studies have learned other information about entities, but they are aspect-level simple information associations, and thus only rough entity representations can be obtained, and the advantage of multi-faceted information is lost. In this paper, a novel node-level information strong fusion framework (SFEA) is proposed, based on four aspects: structure, attribute, relation and names. The attribute information and name information are learned first, then structure information is learned based on these two aspects of information through graph convolutional network (GCN), the alignment signals from attribute and name are already carried at the beginning of the learning structure. In the process of continuous propagation of multi-hop neighborhoods, the effect of strong fusion of structure, attribute and name information is achieved and the more meticulous entity representations are obtained. Additionally, through the continuous interaction between sub-alignment tasks, the effect of entity alignment is enhanced. An iterative framework is designed to improve performance while reducing the impact on pre-aligned seed pairs. Furthermore, extensive experiments demonstrate that the model improves the accuracy of entity alignment and significantly outperforms 13 previous state-of-the-art methods.
Local Differential Privacy for Federated Learning

Advanced adversarial attacks such as membership inference and model memorization can make federated learning (FL) vulnerable and potentially leak sensitive private data. Local differentially private (LDP) approaches are gaining more popularity due to stronger privacy notions and native support for data distribution compared to other differentially private (DP) solutions. However, DP approaches assume that the FL server (that aggregates the models) is honest (run the FL protocol honestly) or semi-honest (run the FL protocol honestly while also trying to learn as much information as possible). These assumptions make such approaches unrealistic and unreliable for real-world settings. Besides, in real-world industrial environments (e.g., healthcare), the distributed entities (e.g., hospitals) are already composed of locally running machine learning models (this setting is also referred to as the cross-silo setting). Existing approaches do not provide a scalable mechanism for privacy-preserving FL to be utilized under such settings, potentially with untrusted parties. This paper proposes a new local differentially private FL protocol (named LDPFL) for industrial settings. LDPFL can run in industrial settings with untrusted entities while enforcing stronger privacy guarantees than existing approaches. LDPFL shows high FL model performance (up to 98%) under small privacy budgets (e.g., $$\varepsilon = 0.5$$ ) in comparison to existing methods.