Reviewerly/exHarmony huggingface dataset:
Contrastive Instruction-Trajectory Learning for Vision-Language Navigation

The vision-language navigation (VLN) task requires an agent to reach a target with the guidance of natural language instruction. Previous works learn to navigate step-by-step following an instruction. However, these works may fail to discriminate the similarities and discrepancies across instruction-trajectory pairs and ignore the temporal continuity of sub-instructions. These problems hinder agents from learning distinctive vision-and-language representations, harming the robustness and generalizability of the navigation policy. In this paper, we propose a Contrastive Instruction-Trajectory Learning (CITL) framework that explores invariance across similar data samples and variance across different ones to learn distinctive representations for robust navigation. Specifically, we propose: (1) a coarse-grained contrastive learning objective to enhance vision-and-language representations by contrasting semantics of full trajectory observations and instructions, respectively; (2) a fine-grained contrastive learning objective to perceive instructions by leveraging the temporal information of the sub-instructions; (3) a pairwise sample-reweighting mechanism for contrastive learning to mine hard samples and hence mitigate the influence of data sampling bias in contrastive learning. Our CITL can be easily integrated with VLN backbones to form a new learning paradigm and achieve better generalizability in unseen environments. Extensive experiments show that the model with CITL surpasses the previous state-of-the-art methods on R2R, R4R, and RxR.
Using Graph Embedding Techniques in Process-Oriented Case-Based Reasoning

Similarity-based retrieval of semantic graphs is a core task of Process-Oriented Case-Based Reasoning (POCBR) with applications in real-world scenarios, e.g., in smart manufacturing. The involved similarity computation is usually complex and time-consuming, as it requires some kind of inexact graph matching. To tackle these problems, we present an approach to modeling similarity measures based on embedding semantic graphs via Graph Neural Networks (GNNs). Therefore, we first examine how arbitrary semantic graphs, including node and edge types and their knowledge-rich semantic annotations, can be encoded in a numeric format that is usable by GNNs. Given this, the architecture of two generic graph embedding models from the literature is adapted to enable their usage as a similarity measure for similarity-based retrieval. Thereby, one of the two models is more optimized towards fast similarity prediction, while the other model is optimized towards knowledge-intensive, more expressive predictions. The evaluation examines the quality and performance of these models in preselecting retrieval candidates and in approximating the ground-truth similarities of a graph-matching-based similarity measure for two semantic graph domains. The results show the great potential of the approach for use in a retrieval scenario, either as a preselection model or as an approximation of a graph similarity measure.
Automated Classification of Unstructured Bilingual Software Bug Reports: An Industrial Case Study Research

Software bug report classification is a critical process to understand the nature, implications, and causes of software failures. Furthermore, classification enables a fast and appropriate reaction to software bugs. However, for large-scale projects, one must deal with a broad set of bugs from multiple types. In this context, manually classifying bugs becomes cumbersome and time-consuming. Although several studies have addressed automated bug classification using machine learning techniques, they have mainly focused on academic case studies, open-source software, and unilingual text input. This paper presents our automated bug classification approach applied and validated in an industrial case study. In contrast to earlier studies, our study is applied to a commercial software system based on unstructured bilingual bug reports written in English and Turkish. The presented approach adopts and integrates machine learning (ML), text mining, and natural language processing (NLP) techniques to support the classification of software bugs. The approach has been applied within an industrial case study. Compared to manual classification, our results show that bug classification can be automated and even performs better than manual bug classification. Our study shows that the presented approach and the corresponding tools effectively reduce the manual classification time and effort.
Disk

Measuring similarities among different nodes is important in graph analysis. SimRank is one of the most popular similarity measures. Given a graph G ( V , E ) and a source node u , a single-source Sim-Rank query returns the similarities between u and each node v ∈ V. This type of query is often used in link prediction, personalized recommendation and spam detection. While dealing with a large graph is beyond the ability of a single machine due to its limited memory and computational power, it is necessary to process single-source SimRank queries in a distributed environment, where the graph is partitioned and distributed across multiple machines. However, most current solutions are based on shared-memory model, where the whole graph is loaded into a shared memory and all processors can access the graph randomly. It is difficult to deploy such algorithms on shared-nothing model. In this paper, we present DISK, a distributed framework for processing single-source SimRank queries. DISK follows the linearized formulation of SimRank, and consists of offline and online phases. In the offline phase, a tree-based method is used to estimate the diagonal correction matrix of SimRank accurately, and in the online phase, single-source similarities are computed iteratively. Under this framework, we propose different optimization techniques to boost the indexing and queries. DISK guarantees both accuracy and parallel scalability, which distinguishes itself from existing solutions. Its accuracy, efficiency, parallel scalability and scalability are also verified by extensive experimental studies. The experiments show that DISK scales up to graphs of billions of nodes and edges, and answers online queries within seconds, while ensuring the accuracy bounds.
Approach for Multi-Label Text Data Class Verification and Adjustment Based on Self-Organizing Map and Latent Semantic Analysis

In this paper, a new approach has been proposed for multi-label text data class verification and adjustment. The approach helps to make semi-automated revisions of class assignments to improve the quality of the data. The data quality significantly influences the accuracy of the created models, for example, in classification tasks. It can also be useful for other data analysis tasks. The proposed approach is based on the combination of the usage of the text similarity measure and two methods: latent semantic analysis and self-organizing map. First, the text data must be pre-processed by selecting various filters to clean the data from unnecessary and irrelevant information. Latent semantic analysis has been selected to reduce the vectors dimensionality of the obtained vectors that correspond to each text from the analysed data. The cosine similarity distance has been used to determine which of the multi-label text data class should be changed or adjusted. The self-organizing map has been selected as the key method to detect similarity between text data and make decisions for a new class assignment. The experimental investigation has been performed using the newly collected multi-label text data. Financial news data in the Lithuanian language have been collected from four public websites and classified by experts into ten classes manually. Various parameters of the methods have been analysed, and the influence on the final results has been estimated. The final results are validated by experts. The research proved that the proposed approach could be helpful to verify and adjust multi-label text data classes. 82% of the correct assignments are obtained when the data dimensionality is reduced to 40 using the latent semantic analysis, and the self-organizing map size is reduced from 40 to 5 by step 5.
Selecting Post-Processing Schemes for Accurate Detection of Small Objects in Low-Resolution Wide-Area Aerial Imagery

In low-resolution wide-area aerial imagery, object detection algorithms are categorized as feature extraction and machine learning approaches, where the former often requires a post-processing scheme to reduce false detections and the latter demands multi-stage learning followed by post-processing. In this paper, we present an approach on how to select post-processing schemes for aerial object detection. We evaluated combinations of each of ten vehicle detection algorithms with any of seven post-processing schemes, where the best three schemes for each algorithm were determined using average F-score metric. The performance improvement is quantified using basic information retrieval metrics as well as the classification of events, activities and relationships (CLEAR) metrics. We also implemented a two-stage learning algorithm using a hundred-layer densely connected convolutional neural network for small object detection and evaluated its degree of improvement when combined with the various post-processing schemes. The highest average F-scores after post-processing are 0.902, 0.704 and 0.891 for the Tucson, Phoenix and online VEDAI datasets, respectively. The combined results prove that our enhanced three-stage post-processing scheme achieves a mean average precision (mAP) of 63.9% for feature extraction methods and 82.8% for the machine learning approach.
Neural Collaborative Filtering with Ontologies for Integrated Recommendation Systems

Machine learning (ML) and especially deep learning (DL) with neural networks have demonstrated an amazing success in all sorts of AI problems, from computer vision to game playing, from natural language processing to speech and image recognition. In many ways, the approach of ML toward solving a class of problems is fundamentally different than the one followed in classical engineering, or with ontologies. While the latter rely on detailed domain knowledge and almost exhaustive search by means of static inference rules, ML adopts the view of collecting large datasets and processes this massive information through a generic learning algorithm that builds up tentative solutions. Combining the capabilities of ontology-based recommendation and ML-based techniques in a hybrid system is thus a natural and promising method to enhance semantic knowledge with statistical models. This merge could alleviate the burden of creating large, narrowly focused ontologies for complicated domains, by using probabilistic or generative models to enhance the predictions without attempting to provide a semantic support for them. In this paper, we present a novel hybrid recommendation system that blends a single architecture of classical knowledge-driven recommendations arising from a tailored ontology with recommendations generated by a data-driven approach, specifically with classifiers and a neural collaborative filtering. We show that bringing together these knowledge-driven and data-driven worlds provides some measurable improvement, enabling the transfer of semantic information to ML and, in the opposite direction, statistical knowledge to the ontology. Moreover, the novel proposed system enables the extraction of the reasoning recommendation results after updating the standard ontology with the new products and user behaviors, thus capturing the dynamic behavior of the environment of our interest.
Feasibility of Combining Transcranial Direct Current Stimulation and Active Fully Embodied Virtual Reality for Visual Height Intolerance: A Double-Blind Randomized Controlled Study

Transcranial Direct Current Stimulation (tDCS) and Virtual Reality Exposure Therapy (VRET) are individually increasingly used in psychiatric research.Our study aimed to investigate the feasibility of combining tDCS and wireless 360° full immersive active and embodied VRET to reduce height-induced anxiety.We carried out a pilot randomized, double-blind, controlled study associating VRET (two 20 min sessions with a 48 h interval, during which, participants had to cross a plank at rising heights in a building in construction) with online tDCS (targeting the ventromedial prefrontal cortex) in 28 participants. The primary outcomes were the sense of presence level and the tolerability. The secondary outcomes were the anxiety level (Subjective Unit of Discomfort) and the salivary cortisol concentration.We confirmed the feasibility of the association between tDCS and fully embodied VRET associated with a good sense of presence without noticeable adverse effects. In both groups, a significant reduction in the fear of height was observed after two sessions, with only a small effect size of add-on tDCS (0.1) according to the SUD. The variations of cortisol concentration differed in the tDCS and sham groups.Our study confirmed the feasibility of the association between wireless online tDCS and active, fully embodied VRET. The optimal tDCS paradigm remains to be determined in this context to increase effect size and then adequately power future clinical studies assessing synergies between both techniques.
Deep Neural Network for DrawiNg Networks, $${(DNN)^{\textit{2}\,}} $$

By leveraging recent progress of stochastic gradient descent methods, several works have shown that graphs could be efficiently laid out through the optimization of a tailored objective function. In the meantime, Deep Learning (DL) techniques achieved great performances in many applications. We demonstrate that it is possible to use DL techniques to learn a graph-to-layout sequence of operations thanks to a graph-related objective function. In this paper, we present a novel graph drawing framework called \({(DNN)^{\textit{2}\,}} \): Deep Neural Network for DrawiNg Networks. Our method uses Graph Convolution Networks to learn a model. Learning is achieved by optimizing a graph topology related loss function that evaluates \({(DNN)^{\textit{2}\,}} \)generated layouts during training. Once trained, the \({(DNN)^{\textit{2}\,}} \)model is able to quickly lay any input graph out. We experiment \({(DNN)^{\textit{2}\,}} \)and statistically compare it to optimization-based and regular graph layout algorithms. The results show that \({(DNN)^{\textit{2}\,}} \)performs well and are encouraging as the Deep Learning approach to Graph Drawing is novel and many leads for future works are identified.
Processing Sunshine Duration Measurements for the Assessment of Solar Radiation in Climatic Regions of the Central African Republic

Abstract The objectives of this work carried out in the Central African Republic are to propose new correlations between the components of solar radiation and the sunshine duration on a horizontal surface on the ground, and then to make an evaluation of the solar potential in the cities of Bambari, Birao, and Bangui. Polynomial regression models were used and their parameters were estimated by the ordinary least-squares method. A statistical evaluation allowed us to compare the performance of the models. The best correlations are then used to estimate the global and diffuse radiation. In the city of Birao, the estimated global radiation is around 6 kW h/m2 j and the diffuse radiation is around 2 kW h/m2 j; in Bambari, the global radiation is around 5.4 kW h/m2 j and the diffuse is around 2.3 kW h/m2 j; in Bangui, the global radiation is around 5 kW h/m2 j and the diffuse radiation is around 2.3 kW h/m2 j. The potential solar in all these regions is very favorable for small- and large-scale solar photovoltaic applications.
Technological Foundations of Ontological Ecosystems on the 3rd Generation Blockchains

In this article we present the technological foundations on which an ecosystem of semantic data objects can be implemented on the latest Blockchain based systems. As the most important citizens among the semantic data objects are ontologies, the ecosystem is referred to as Ontospace. The foundations can be characterized by their architectural, cryptographic and transactional aspects. The architectural aspect borrows from the latest Layer-2 protocols of the 3rd generation blockchains and from the rules of Linked Data systems creation. The cryptographic aspect represents an original work that attempts to resolve the issue of efficient hashing of the graph data structures. The transactional aspect is concerned with the graph replication consistency, conditions for the direct access to graph data from the blockchain smart-contracts and with linkage between sidechains bearing semantic objects and the main network. The large parts of the work were implemented in the context of the Ontochain project – a part of the Next Generation Internet EU Initiative.
Context-aware Entity Typing in Knowledge Graphs

Knowledge graph entity typing aims to infer entities' missing types in knowledge graphs which is an important but under-explored issue.This paper proposes a novel method for this task by utilizing entities' contextual information.Specifically, we design two inference mechanisms: i) N2T: independently use each neighbor of an entity to infer its type; ii) Agg2T: aggregate the neighbors of an entity to infer its type.Those mechanisms will produce multiple inference results, and an exponentially weighted pooling method is used to generate the final inference result.Furthermore, we propose a novel loss function to alleviate the false-negative problem during training.Experiments on two real-world KGs demonstrate the effectiveness of our method.
AN ONLINE REPOSITORY OF PYTHON RESOURCES FOR TEACHING MACHINE TRANSLATION TO TRANSLATION STUDENTS

This paper presents an online repository of Python resources aimed at teaching the technical dimension of machine translation to students of translation studies programmes. The Python resources provided in this repository are Jupyter notebooks. These are web-based computational environments in which students can run commented blocks of code in order to perform MT-related tasks such as exploring word embeddings, preparing MT training data, training open- source machine translation systems or calculating automatic MT quality metrics such as BLEU, METEOR, BERTScore or COMET. The notebooks are prepared in such a way that students can interact with them even if they have had little to no prior exposure to the Python programming language. The notebooks are provided as open-source resources under the MIT License and can be used and modified by translator training institutions which intend to make their students familiar with the more technical aspects of modern machine translation technology. Institutions who would like to contribute their own Python-based teaching resources to the repository are welcome to do so. Keywords: translation technology, machine translation, natural language processing, translation didactics, Jupyter notebooks, Python programming
Modified Whale Optimization Algorithm for Multi-Type Combine Harvesters Scheduling

The optimal scheduling of multi-type combine harvesters is a crucial topic in improving the operating efficiency of combine harvesters. Due to the NP-hard property of this problem, developing appropriate optimization approaches is an intractable task. The multi-type combine harvesters scheduling problem considered in this paper deals with the question of how a given set of harvesting tasks should be assigned to each combine harvester, such that the total cost is comprehensively minimized. In this paper, a novel multi-type combine harvesters scheduling problem is first formulated as a constrained optimization problem. Then, a whale optimization algorithm (WOA) including an opposition-based learning search operator, adaptive convergence factor and heuristic mutation, namely, MWOA, is proposed and evaluated based on benchmark functions and comprehensive computational studies. Finally, the proposed intelligent approach is used to solve the multi-type combine harvesters scheduling problem. The experimental results prove the superiority of the MWOA in terms of solution quality and convergence speed both in the benchmark test and for solving the complex multi-type combine harvester scheduling problem.
Big Data Architectures: A Detailed and Application Oriented Analysis

Big Data refers to huge amounts of heterogeneous data from both traditional and new sources, growing at a higher rate than ever. Due to their high heterogeneity, it is a challenge to build systems to centrally process and analyze efficiently such data which are internal and external to organizations. A Big data architecture describes the blueprint of a system handling massive volume of data during its storage, processing, analysis and visualization. Several architectures belonging to different categories have been proposed by academia and industry but the field is still lacking benchmarks. Therefore, a detailed analysis of the characteristics of the existing architectures is required in order to ease the choice between architectures for specific use cases or industry requirements. The types of data sources, the hardware requirements, the maximum tolerable latency, the fitment to industry, the amount of data to be handled are some of the factors that need to be considered carefully before making the choice of an architecture of a Big Data system. However, the wrong choice of architecture can result in huge decline for a company reputation and business. This paper reviews the most prominent existing Big Data architectures, their advantages and shortcomings, their hardware requirements, their open source and proprietary software requirements and some of their real-world use cases catering to each industry. The purpose of this body of work is to equip Big Data architects with the necessary resources to make better informed choices to design optimal Big Data systems.
On the Performance of Energy Criterion Method in Wi-Fi Transient Signal Detection

In the development of radiofrequency fingerprinting (RFF), one of the major challenges is to extract subtle and robust features from transmitted signals of wireless devices to be used in accurate identification of possible threats to the wireless network. To overcome this challenge, the use of the transient region of the transmitted signals could be one of the best options. For an efficient transient-based RFF, it is also necessary to accurately and precisely estimate the transient region of the signal. Here, the most important difficulty can be attributed to the detection of the transient starting point. Thus, several methods have been developed to detect transient start in the literature. Among them, the energy criterion method based on the instantaneous amplitude characteristics (EC-a) was shown to be superior in a recent study. The study reported the performance of the EC-a method for a set of Wi-Fi signals captured from a particular Wi-Fi device brand. However, since the transient pattern varies according to the type of wireless device, the device diversity needs to be increased to achieve more reliable results. Therefore, this study is aimed at assessing the efficiency of the EC-a method across a large set of Wi-Fi signals captured from various Wi-Fi devices for the first time. To this end, Wi-Fi signals are first captured from smartphones of five brands, for a wide range of signal-to-noise ratio (SNR) values defined as low (−3 to 5 dB), medium (5 to 15 dB), and high (15 to 30 dB). Then, the performance of the EC-a method and well-known methods was comparatively assessed, and the efficiency of the EC-a method was verified in terms of detection accuracy.