Reviewerly/exHarmony huggingface dataset:
Collective Displacement of Regional Cryptomarket Vendors—A Study on the Aftermath of the Flugsvamp 3.0 Closure

The cryptomarket ecosystem has become increasingly volatile and fragmented with sites shutting down on short notice. Displacement to new marketplaces is tricky when the original location was domestically oriented. We examine the spatial and temporal displacement of 83 Swedish vendors in the aftermath of the Flugsvamp 3.0 shutdown. Vendors rejected the successor Flugsvamp 4.0 and moved to German-run Archetyp Market. Using quantitative cross-sectional data from Archetyp Market we measure bivariate correlations between the temporal displacement and status-related variables. We found moderately strong correlation between vendors’ number of sales per day and the order of their relocation to Archetyp. We also examined cryptomarket discussion forums and blogs during the time of the Flugsvamp 3.0 shutdown. This qualitative data supported the finding that migration choices of high-status vendors inspired others to follow.
Affine combination‐based over‐sampling for imbalanced regression

Abstract Imbalanced domain prediction analysis is currently one of the hot research topics. Many real‐world data mining analyses involve using imbalanced data to obtain predictive models. In the context of imbalance, research on classification problems has been extensive, but research on regression problems is negligible. Rare values rarely occur in imbalanced regression problems, but the focus is on accurately predicting the continuous target variables of rare instances. One of the challenges in imbalanced regression is finding a suitable strategy to rebalance the original dataset in order to improve the predictive performance of the model in rare instances. In this study, two algorithms are proposed: sigma nearest over‐sampling based on convex combination for regression (SNOCCR) and affine combination‐based over‐sampling (ACOS). ACOS rebalances the original dataset by generating new instances through the affine combinations of the original examples. The region where the new instances are generated can be adjusted based on the distribution of the data, ensuring that the generated cases better mimic the distribution of the original examples. The comparison among ACOS, SNOCCR, and other preprocessing methods was conducted on 15 datasets to validate the predictive performance of models trained on rebalanced datasets for rare instances. The experimental results indicate that ACOS outperforms other existing methods.
Continuous Variable Quantum Teleportation in a Dissipative Environment: Comparison of Non‐Gaussian Operations Before and After Noisy Channel

Abstract This article explores the relative advantages in continuous‐variable quantum teleportation when non‐Gaussian operations, namely, photon subtraction, addition, and catalysis, are performed before and after interaction with a noisy channel. The resource state for teleporting unknown coherent and squeezed vacuum states is generated using two distinct strategies: i) Implementation of non‐Gaussian operations on two mode squeezed vacuum (TMSV) state before interaction with a noisy channel, ii) Implementation of non‐Gaussian operations after interaction of TMSV state with a noisy channel. The results show that non‐Gaussian operations can enhance teleportation fidelity in a dissipative environment. However, the most advantageous non‐Gaussian operation and appropriate strategy depend on the state and channel parameters. The results suggest that employing such strategies can be advantageous in other non‐Gaussian continuous variable quantum information (QIP) processing tasks in a dissipative environment.
A speed‐area‐efficient hardware ECPM‐engine in GF(<i>p</i>) over generic Weierstrass curves

Abstract This paper proposes a 256‐bit speed‐area‐efficient hardware elliptic curve point‐multiplication engine (ECPM‐engine) in GF( p ) over generic Weierstrass curves, which is optimized by a new speed‐area‐efficient radix‐64 Montgomery modular multiplication (R64MMM) and a novel Montgomery ladder scheduling. The R64MMM calls one 129‐bit adder and one (64x64+129)‐bit multiply‐accumulator (64‐129‐MAC) in parallel to make a trade‐off between speed and area. The novel Montgomery ladder scheduling is used to improve the utilization of MAC in ECPM operation. In this ECPM‐engine, both MAC utilization in R64MMM operations and R64MMM utilization in ECPM operations are close to 100%. The result shows that the proposed ECPM‐engine consumes 72k gates when the clock frequency is 714 MHz with a 90 nm standard cell library, and it computes one 256‐bit ECPM in 0.14 ms.
Exploring substitution random functions composed of stationary multi-Gaussian processes

Abstract Simulation of random fields is widely used in Earth sciences for modeling and uncertainty quantification. The spatial features of these fields may have a strong impact on the forecasts made using these fields. For instance, in flow and transport problems the connectivity of the permeability fields is a crucial aspect. Multi-Gaussian random fields are the most common tools to analyze and model continuous fields. Their spatial correlation structure is described by a covariance or variogram model. However, these types of spatial models are unable to represent highly or poorly connected structures even if a broad range of covariance models can be employed. With this type of model, the regions with values close to the mean are always well connected whereas the regions of low or high values are isolated. Substitution random functions (SRFs) belong to another broad class of random functions that are more flexible. SRFs are constructed by composing ( $$Z=Y\circ T$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>Z</mml:mi> <mml:mo>=</mml:mo> <mml:mi>Y</mml:mi> <mml:mo>∘</mml:mo> <mml:mi>T</mml:mi> </mml:mrow> </mml:math> ) two stochastic processes: the directing function T (latent field) and the coding process Y (modifying the latent field in a stochastic manner). In this paper, we study the properties of SRFs obtained by combining stationary multi-Gaussian random fields for both T and Y with bounded variograms. The resulting SRFs Z are stationary, but as T has a finite variance Z is not ergodic for the mean and the covariance. This means that single realizations behave differently from each other. We propose a simple technique to control which values (low, intermediate, or high) are connected. It consists of adding a control point on the process Y to guide every single realization. The conditioning to local values is obtained using a Gibbs sampler.
Anomaly sound detection of industrial devices by using teacher-student incremental continual learning

Abstract Normal production processes will be substantially impacted by industrial devices in abnormal working conditions. Anomaly sound detection (ASD) model can monitor the working condition of devices by the non-contact and non-invasive way. When new device data is introduced, traditional ASD models are trained using data from all devices, to accommodate every device. However, in real-world settings, the kinds and amounts of devices are constantly changing, which raises difficulties for the current ASD models. This paper proposes a teacher-student incremental learning method for ASD models, aiming to solve ASD model scalability problem. In this paradigm, teacher model has knowledge of all the old devices. The objective of student model is to learn new device knowledge, while avoiding the forgetting of old device knowledge. When student model learns new device data, teacher model transfers the acoustic feature knowledge of old devices to student model via knowledge distillation. Furthermore, the imbalance between old and new knowledge causes challenges, such as knowledge forgetting or lower learning efficiency for student model. This paper presents a dual-teacher-student (DTS) model to solve the problem of knowledge imbalance. Different teacher models for new and old devices in DTS, directing student model to accomplish continuous and deep integration of knowledge. Evaluation for proposed method on the DCASE 2020 Task2 dataset. The results show, the proposed method outperforms other methods in terms of learning capability and robustness during the incremental learning process. Analysis of significance test on the experimental results demonstrates that the method outperforms other methods statistically.
Estimation of optimal treatment regimes with electronic medical record data using the residual life value estimator

Summary Clinicians and patients must make treatment decisions at a series of key decision points throughout disease progression. A dynamic treatment regime is a set of sequential decision rules that return treatment decisions based on accumulating patient information, like that commonly found in electronic medical record (EMR) data. When applied to a patient population, an optimal treatment regime leads to the most favorable outcome on average. Identifying optimal treatment regimes that maximize residual life is especially desirable for patients with life-threatening diseases such as sepsis, a complex medical condition that involves severe infections with organ dysfunction. We introduce the residual life value estimator (ReLiVE), an estimator for the expected value of cumulative restricted residual life under a fixed treatment regime. Building on ReLiVE, we present a method for estimating an optimal treatment regime that maximizes expected cumulative restricted residual life. Our proposed method, ReLiVE-Q, conducts estimation via the backward induction algorithm Q-learning. We illustrate the utility of ReLiVE-Q in simulation studies, and we apply ReLiVE-Q to estimate an optimal treatment regime for septic patients in the intensive care unit using EMR data from the Multiparameter Intelligent Monitoring Intensive Care database. Ultimately, we demonstrate that ReLiVE-Q leverages accumulating patient information to estimate personalized treatment regimes that optimize a clinically meaningful function of residual life.
Three-dimentional reconstruction of underwater side-scan sonar images based on shape-from-shading and monocular depth fusion

Abstract Modern marine research requires high-precision three-dimensional (3D) underwater data. Underwater environments experience severe visible light attenuation, which leads to inferior imaging compared with air. In contrast, sound waves are less affected underwater; hence side-scan sonar is used for underwater 3D reconstruction. Typically, the shape-from-shading algorithm (SfS) is widely used to reconstruct surface normal or heights from side-scan sonar images. However, this approach has challenges because of global information loss and noise. To address these issues, this study introduces a surface-normal fusion method. Specifically, we propose a frequency separation SfS algorithm using a discrete cosine transform, which provides a surface-normal map with less noise. We then fuse the surface-normal map with a novel depth estimation network to achieve high-precision 3D reconstruction of underwater side-scan sonar images. We conducted experiments on synthetic, NYU-depth-v2, and real side-scan sonar datasets to demonstrate the effectiveness of the proposed method.
RSRNeT: a novel multi-modal network framework for named entity recognition and relation extraction

Named entity recognition (NER) and relation extraction (RE) are two important technologies employed in knowledge extraction for constructing knowledge graphs. Uni-modal NER and RE approaches solely rely on text information for knowledge extraction, leading to various limitations, such as suboptimal performance and low efficiency in recognizing polysemous words. With the development of multi-modal learning, multi-modal named entity recognition (MNER) and multi-modal relation extraction (MRE) have been introduced to improve recognition performance. However, existing MNER and MRE methods often encounter reduced efficiency when the text includes unrelated images. To address this problem, we propose a novel multi-modal network framework for named entity recognition and relation extraction called RSRNeT. In RSRNeT, we focus on extracting visual features more fully and designing a multi-scale visual feature extraction module based on ResNeSt network. On the other hand, we also emphasize fusing multi-modal features more comprehensively while minimizing interference from irrelevant images. To address this issue, we propose a multi-modal feature fusing module based on RoBERTa network. These two modules enable us to learn superior visual and textual representations, reducing errors caused by irrelevant images. Our approach has undergone extensive evaluation and comparison with various baseline models on MNER and MRE tasks. Experimental results show that our method achieves state-of-the-art performance in recall and F1 score on three public datasets: Twitter2015, Twitter2017 and MNRE.
CSINet: A Cross-Scale Interaction Network for Lightweight Image Super-Resolution

In recent years, advancements in deep Convolutional Neural Networks (CNNs) have brought about a paradigm shift in the realm of image super-resolution (SR). While augmenting the depth and breadth of CNNs can indeed enhance network performance, it often comes at the expense of heightened computational demands and greater memory usage, which can restrict practical deployment. To mitigate this challenge, we have incorporated a technique called factorized convolution and introduced the efficient Cross-Scale Interaction Block (CSIB). CSIB employs a dual-branch structure, with one branch extracting local features and the other capturing global features. Interaction operations take place in the middle of this dual-branch structure, facilitating the integration of cross-scale contextual information. To further refine the aggregated contextual information, we designed an Efficient Large Kernel Attention (ELKA) using large convolutional kernels and a gating mechanism. By stacking CSIBs, we have created a lightweight cross-scale interaction network for image super-resolution named "CSINet". This innovative approach significantly reduces computational costs while maintaining performance, providing an efficient solution for practical applications. The experimental results convincingly demonstrate that our CSINet surpasses the majority of the state-of-the-art lightweight super-resolution techniques used on widely recognized benchmark datasets. Moreover, our smaller model, CSINet-S, shows an excellent performance record on lightweight super-resolution benchmarks with extremely low parameters and Multi-Adds (e.g., 33.82 dB@Set14 × 2 with only 248 K parameters).
Improving 3D Object Detection with Context-Aware and Dimensional Interaction Attention

Abstract Recently, 3D object detection technology based on point clouds has developed rapidly. However, too few points of distant and occluded objects are scanned by the sensor, and thus these objects suffer from too insufficient features to be detected. This case damages the detection accuracy. Therefore, we constitute a novel 3D object detection with Context-aware and dimensional Interaction Attention Network (CIANet) to explore vital geometric cues for enriching the feature representation of the object, thus boosting the overall detection performance. Specifically, in the first stage, we employ the 3D sparse convolution to extract voxel features, and then construct a Channel-Spatial Hybrid Attention (CSHA) module and a Contextual Self-Attention (CSA) module to enhance voxel features for generating proposals. The CSHA module aims to enhance the key information of the channel and spatial domains of 2D Bird’s Eye View (BEV) features, and the CSA module is applied to supplement contextual information to the enhanced BEV features, thus generating accurate proposals. In the second stage, we construct a Dimensional Interaction Attention (DIA) module to refine Region of Interest (RoI) features within the proposals. It enhances the interactions among the channel and spatial dimensions of RoI features to learn accurate boundaries of objects for proposal refinement. Extensive experiments on the KITTI and Waymo benchmarks show the superior detection performance of CIANet compared to recent methods, especially for objects such as pedestrians and cyclists.
A Smart Ad Display System

This paper proposes a smart ad display system to provide personalized delivery of video ads. The proposed system records consumers’ facial expression and eye gaze stream data as they watch an ad and analyzes data at the frame level. The recognized facial expression and detected eye gaze are matched to the corresponding frame of the video ad, thereby linking facial expressions to specific visual objects appearing in the ad. By tracking a consumer’s facial expressions in response to various visual objects in real time, the system learns the consumer’s individual preferences toward different ads, searches the ad pool, and selects and subsequently displays a new ad that is most likely to elicit positive attitudinal and behavioral responses. We demonstrate the feasibility and effectiveness of the proposed system with two empirical studies. The results show that by tracking a consumer’s facial responses to only one ad or even part of an ad, our proposed system is able to make reasonably accurate inferences about a consumer’s ad preferences, with or without using information about other consumers. These inferences are used to make personalized recommendations that help enhance consumers’ ad viewing experiences and elicit favorable responses.
A Bayesian Dirichlet auto-regressive moving average model for forecasting lead times

In the hospitality industry, lead time data are a form of compositional data that are crucial for business planning, resource allocation, and staffing. Hospitality businesses accrue fees daily, but recognition of these fees is often deferred. This paper presents a novel class of Bayesian time series models, the Bayesian Dirichlet auto-regressive moving average (B-DARMA) model, designed specifically for compositional time series. The model is motivated by the analysis of five years of daily fees data from Airbnb, with the aim of forecasting the proportion of future fees that will be recognized in 12 consecutive monthly intervals. Each day’s compositional data are modeled as Dirichlet distributed, given the mean and a scale parameter. The mean is modeled using a vector auto-regressive moving average process, which depends on previous compositional data, previous compositional parameters, and daily covariates. The B-DARMA model provides a robust solution for analyzing large compositional vectors and time series of varying lengths. It offers efficiency gains through the choice of priors, yields interpretable parameters for inference, and produces reasonable forecasts. The paper also explores the use of normal and horseshoe priors for the vector auto-regressive and vector moving average coefficients, and for regression coefficients. The efficacy of the B-DARMA model is demonstrated through simulation studies and an analysis of Airbnb data.
Comparison of Machine Learning Approaches for Sentiment Analysis in Slovak

The process of determining and understanding the emotional tone expressed in a text, with a focus on textual data, is referred to as sentiment analysis. This analysis facilitates the identification of whether the overall sentiment is positive, negative, or neutral. Sentiment analysis on social networks seeks valuable insight into public opinions, trends, and user sentiments. The main motivation is to enable informed decisions and an understanding of the dynamics of online discourse by businesses and researchers. Additionally, sentiment analysis plays a vital role in the field of hate speech detection, aiding in the identification and mitigation of harmful content on social networks. In this paper, studies on the sentiment analysis of texts in the Slovak language, as well as in other languages, are introduced. The primary aim of the paper, aside from releasing the “SentiSK” dataset to the public, is to evaluate our dataset by comparing its results with those of other existing datasets in the Slovak language. The “SentiSK” dataset, consisting of 34,006 comments, was created, specified, and annotated for the task of sentiment analysis. The proposed approach involved the utilization of three datasets in the Slovak language, with nine classification methods trained and compared in two defined tasks. For the first task, testing on the “SentiSK” and “Sentigrade” datasets involved three classes (positive, neutral, and negative). In the second task, testing on the “SentiSK”, “Sentigrade”, and “Slovak dataset for SA” datasets involved two classes (positive and negative). Selected models achieved an F1 score ranging from 75.35% to 95.04%.
Conflicting Marks Archive Dataset: A Dataset of Conflicting Marks from the Brazilian Intellectual Property Office

A registered trademark represents one of a company’s most valuable intellectual assets, acting as a safeguard against possible reputational damage and financial losses resulting from infringements of this intellectual property. To be registered, a mark must be unique and distinctive in relation to other trademarks which are already registered. In this paper, we describe the CMAD, an acronym for Conflicting Marks Archive Dataset. This dataset has been meticulously organized into pairs of marks (Number of pairs = 18,355) involved in copyright infringement across word, figurative and mixed marks. Organizations sought to register these marks with the National Institute of Industrial Property (INPI) in Brazil, and had their applications denied after analysis by intellectual property specialists. The robustness of this dataset is ensured by the intrinsic similarity of the conflicting marks, since the decisions were made by INPI specialists. This characteristic provides a reliable basis for the development and testing of tools designed to analyze similarity between marks, thus contributing to the evolution of practices and computer-based solutions in the field of intellectual property.
A Lightweight Context-Aware Feature Transformer Network for Human Pose Estimation

We propose a Context-aware Feature Transformer Network (CaFTNet), a novel network for human pose estimation. To address the issue of limited modeling of global dependencies in convolutional neural networks, we design the Transformerneck to strengthen the expressive power of features. Transformerneck directly substitutes 3×3 convolution in the bottleneck of HRNet with a Contextual Transformer (CoT) block while reducing the complexity of the network. Specifically, the CoT first produces keys with static contextual information through 3×3 convolution. Then, relying on query and contextualization keys, dynamic contexts are generated through two concatenated 1×1 convolutions. Static and dynamic contexts are eventually fused as an output. Additionally, for multi-scale networks, in order to further refine the features of the fusion output, we propose an Attention Feature Aggregation Module (AFAM). Technically, given an intermediate input, the AFAM successively deduces attention maps along the channel and spatial dimensions. Then, an adaptive refinement module (ARM) is exploited to activate the obtained attention maps. Finally, the input undergoes adaptive feature refinement through multiplication with the activated attention maps. Through the above procedures, our lightweight network provides powerful clues for the detection of keypoints. Experiments are performed on the COCO and MPII datasets. The model achieves a 76.2 AP on the COCO val2017 dataset. Compared to other methods with a CNN as the backbone, CaFTNet has a 72.9% reduced number of parameters. On the MPII dataset, our method uses only 60.7% of the number of parameters, acquiring similar results to other methods with a CNN as the backbone.