Reviewerly/exHarmony huggingface dataset:
Monitoring Temperature and Humidity in Biomass Gasification Using Arduino Technology

Gasification of biomass can be done with pure oxygen or with ambient air. We have chosen gasification with ambient air in our project for costs considerations. Relative humidity (RH) of the air we used with a downdraft co-current gasifier is monitored in this paper. RH sensor used in this paper presents a capacitor which depends on the amount of water contained in the gaseous mixture. That RH, behaving as a variable capacitor is inserted in serial with the RC circuit of an astable multivibrator. Frequency of the oscillator is dependent of the resistance and the capacity which depends on the RH. We have inserted the RH sensor as a variable capacitor in the RC circuit of a NE555 oscillator. From the RH sensor datasheet, a mathematical model has been developed and the equation giving RH found to be $$Rh=496,23 * ( {1.44*T \over (R_4+2R_2 )* C_55}) -443,26.$$ The frequency of the oscillator is calculated with Arduino and the RH is deduced. Temperature can be measured with a K type thermocouple from 25 to 1024C with accuracy of +/-1.5C.The effect of temperature on the RH is also taken into account. Using Arduino Uno3 as a computer, we have calculated corrected RH respective to temperature and displayed both ambient and real RH on 20 columns with 4 lines LCD display. Arduino has also enabled us to save measured data in an Excel sheet, allowing us to analyses measured temperature and RH and plot different curves from it. The same circuit is also used to monitor RH of produced synthesis gas. Results of the Arduino temperature and monitoring system shows that visual observation of air and human feeling can be very misleading in respect to the air RH.
Perceptual Image Quality Prediction: Are Contrastive Language–Image Pretraining (CLIP) Visual Features Effective?

In recent studies, the Contrastive Language–Image Pretraining (CLIP) model has showcased remarkable versatility in downstream tasks, ranging from image captioning and question-answering reasoning to image–text similarity rating, etc. In this paper, we investigate the effectiveness of CLIP visual features in predicting perceptual image quality. CLIP is also compared with competitive large multimodal models (LMMs) for this task. In contrast to previous studies, the results show that CLIP and other LMMs do not always provide the best performance. Interestingly, our evaluation experiment reveals that combining visual features from CLIP or other LMMs with some simple distortion features can significantly enhance their performance. In some cases, the improvements are even more than 10%, while the prediction accuracy surpasses 90%.
Real-Time Object Detection and Tracking Based on Embedded Edge Devices for Local Dynamic Map Generation

This paper proposes a camera system designed for local dynamic map (LDM) generation, capable of simultaneously performing object detection, tracking, and 3D position estimation. This paper focuses on improving existing approaches to better suit our application, rather than proposing novel methods. We modified the detection head of YOLOv4 to enhance the detection performance for small objects and to predict fiducial points for 3D position estimation. The modified detector, compared to YOLOv4, shows an improvement of approximately 5% mAP on the Visdrone2019 dataset and around 3% mAP on our database. We also proposed a tracker based on DeepSORT. Unlike DeepSORT, which applies a feature extraction network for each detected object, the proposed tracker applies a feature extraction network once for the entire image. To increase the resolution of feature maps, the tracker integrates the feature aggregation network (FAN) structure into the DeepSORT network. The difference in multiple objects tracking accuracy (MOTA) between the proposed tracker and DeepSORT is minimal at 0.3%. However, the proposed tracker has a consistent computational load, regardless of the number of detected objects, because it extracts a feature map once for the entire image. This characteristic makes it suitable for embedded edge devices. The proposed methods have been implemented on a system on chip (SoC), Qualcomm QCS605, using network pruning and quantization. This enables the entire process to be executed at 10 Hz on this edge device.
A Convolutional Neural Network-Based Auto-Segmentation Pipeline for Breast Cancer Imaging

Medical imaging is crucial for the detection and diagnosis of breast cancer. Artificial intelligence and computer vision have rapidly become popular in medical image analyses thanks to technological advancements. To improve the effectiveness and efficiency of medical diagnosis and treatment, significant efforts have been made in the literature on medical image processing, segmentation, volumetric analysis, and prediction. This paper is interested in the development of a prediction pipeline for breast cancer studies based on 3D computed tomography (CT) scans. Several algorithms were designed and integrated to classify the suitability of the CT slices. The selected slices from patients were then further processed in the pipeline. This was followed by data generalization and volume segmentation to reduce the computation complexity. The selected input data were fed into a 3D U-Net architecture in the pipeline for analysis and volumetric predictions of cancer tumors. Three types of U-Net models were designed and compared. The experimental results show that Model 1 of U-Net obtained the highest accuracy at 91.44% with the highest memory usage; Model 2 had the lowest memory usage with the lowest accuracy at 85.18%; and Model 3 achieved a balanced performance in accuracy and memory usage, which is a more suitable configuration for the developed pipeline.
Keyword Data Analysis Using Generative Models Based on Statistics and Machine Learning Algorithms

For text big data analysis, we preprocessed text data and constructed a document–keyword matrix. The elements of this matrix represent the frequencies of keywords occurring in a document. The matrix has a zero-inflation problem because many elements are zero values. Also, in the process of preprocessing, the data size of the document–keyword matrix is reduced. However, various machine learning algorithms require a large amount of data, so to solve the problems of data shortage and zero inflation, we propose the use of generative models based on statistics and machine learning. In our experimental tests, we compared the performance of the models using simulation and practical data sets. Thus, we verified the validity and contribution of our research for keyword data analysis.
UViT: Efficient and lightweight U-shaped hybrid vision transformer for human pose estimation

Pose estimation plays a crucial role in human-centered vision applications and has advanced significantly in recent years. However, prevailing approaches use extremely complex structural designs for obtaining high scores on the benchmark dataset, hampering edge device applications. In this study, an efficient and lightweight human pose estimation problem is investigated. Enhancements are made to the context enhancement module of the U-shaped structure to improve the multi-scale local modeling capability. With a transformer structure, a lightweight transformer block was designed to enhance the local feature extraction and global modeling ability. Finally, a lightweight pose estimation network— U-shaped Hybrid Vision Transformer, UViT— was developed. The minimal network UViT-T achieved a 3.9% improvement in AP scores on the COCO validation set with fewer model parameters and computational complexity compared with the best-performing V2 version of the MobileNet series. Specifically, with an input size of 384×288, UViT-T achieves an impressive AP score of 70.2 on the COCO test-dev set, with only 1.52 M parameters and 2.32 GFLOPs. The inference speed is approximately twice that of general-purpose networks. This study provides an efficient and lightweight design idea and method for the human pose estimation task and provides theoretical support for its deployment on edge devices.
Practical security of continuous-variable quantum key distribution with an optical amplifier

In a practical continuous-variable quantum key distribution (CVQKD) system, the optical amplifier can be used to improve the performance of the system by compensating for the imperfections of the detectors. However, the eavesdropper Eve can actively utilize a reverse external magnetic field to deteriorate the performance of the optical amplifier, which may affect the practical security of the system. In this paper, we investigate the practical security of a CVQKD system with an optical amplifier under the effect of the reverse external magnetic field. Based on the investigation of the parameter estimation under the above influence, we find that the evaluation of the secret key rate may be overestimated, which will open a security loophole for Eve to successfully launch an intercept-resend attack in the practical CVQKD system with an optical amplifier. In order to close this security loophole, we can monitor the reverse external magnetic field or change the type of the optical isolator to make the secret key rate of the system evaluated exactly.
Variational approach to unique determinedness in pure-state tomography

In pure-state tomography, the concept of unique determinedness (UD), the ability to uniquely determine pure states from measurement results, is crucial. This study presents a variational approach to examining UD, offering a robust solution to the challenges associated with the construction and certification of UD measurement schemes. We put forward an effective algorithm that minimizes a specially defined loss function, enabling the differentiation between UD and non-UD measurement schemes. This leads to the discovery of numerous optimal pure-state Pauli measurement schemes across a variety of dimensions. Additionally, we discern an alignment between uniquely determined among pure states and uniquely determined among all states in qubit systems when utilizing Pauli measurements, underscoring its intrinsic robustness under pure-state recovery. We further interpret the physical meaning of our loss function, bolstered by a theoretical framework. Our study not only propels the understanding of UD in quantum state tomography forward, but also delivers valuable practical insights for experimental applications, highlighting the need for a balanced approach between mathematical optimality and experimental pragmatism.
Classification of high-dimensional imbalanced biomedical data based on spectral clustering SMOTE and marine predators algorithm

The research of biomedical data is crucial for disease diagnosis, health management, and medicine development. However, biomedical data are usually characterized by high dimensionality and class imbalance, which increase computational cost and affect the classification performance of minority class, making accurate classification difficult. In this paper, we propose a biomedical data classification method based on feature selection and data resampling. First, use the minimal-redundancy maximal-relevance (mRMR) method to select biomedical data features, reduce the feature dimension, reduce the computational cost, and improve the generalization ability; then, a new SMOTE oversampling method (Spectral-SMOTE) is proposed, which solves the noise sensitivity problem of SMOTE by an improved spectral clustering method; finally, the marine predators algorithm is improved using piecewise linear chaotic maps and random opposition-based learning strategy to improve the algorithm’s optimization seeking ability and convergence speed, and the key parameters of the spectral-SMOTE are optimized using the improved marine predators algorithm, which effectively improves the performance of the over-sampling approach. In this paper, five real biomedical datasets are selected to test and evaluate the proposed method using four classifiers, and three evaluation metrics are used to compare with seven data resampling methods. The experimental results show that the method effectively improves the classification performance of biomedical data. Statistical test results also show that the proposed PRMPA-Spectral-SMOTE method outperforms other data resampling methods.
Issues Of Development Of Professional Competence Of Future Builders-Engineers On The Basis Of Foreign Languages

Today, students in higher education institutions of developed countries are taught using the latest techniques and technologies. Also, in order to develop the professional competence of future builders-engineers in the field of construction in our republic, it is becoming important to expand the opportunities for students to work with multimedia, graphic imagination, architectural graphic tasks-projects, design drawings of buildings and structures based on foreign languages. Education in foreign languages is an important factor in providing future builders-engineers with competitive staff, knowledge, skills and literacy in their specialty, and the justification of the demands placed on them is of great relevance.
Preparation of cavity-Fock-state superpositions by reinforcement learning exploiting measurement backaction

Preparation of bosonic and general cavity quantum states usually relies on using open-loop control to reach a desired target state. In this work, a measurement-based feedback approach is used instead, exploiting the nonlinearity of weak measurements alongside a coherent drive to prepare these states. The extension of previous work on Lyapunov-based control is shown to fail for this task. This prompts for a different approach, and reinforcement learning (RL) is resorted to here for this purpose. With such an approach, cavity-eigenstate superpositions can be prepared with fidelities over $98%$ using only the measurements backaction as the nonlinearity, while naturally incorporating detection of cavity photon jumps. Two different RL frameworks are analyzed: an off-policy approach recently introduced called truncated quantile critic (TQC) and the on-policy method commonly used in quantum control, namely proximal policy optimization. It is shown that TQC performs better at reaching higher target state fidelity preparation.
A simple probabilistic neural network for machine understanding

Abstract We discuss the concept of probabilistic neural networks with a fixed internal representation being models for machine understanding. Here, ‘understanding’ is interpretted as the ability to map data to an already existing representation which encodes an a priori organisation of the feature space. We derive the internal representation by requiring that it satisfies the principles of maximal relevance and of maximal ignorance about how different features are combined. We show that, when hidden units are binary variables, these two principles identify a unique model—the hierarchical feature model—which is fully solvable and provides a natural interpretation in terms of features. We argue that learning machines with this architecture possess a number of interesting properties, such as the continuity of the representation with respect to changes in parameters and data, the possibility of controlling the level of compression and the ability to support functions that go beyond generalisation. We explore the behaviour of the model with extensive numerical experiments and argue that models in which the internal representation is fixed reproduce a learning modality which is qualitatively different from that of traditional models, such as restricted Boltzmann machines.
A variable clustering approach for overdispersed high-dimensional count data using a copula-based mixture model

In this paper, we propose a latent variable model for the analysis and clustering of high-dimensional correlated and overdispersed count data. We use a set of random effects to capture within-group correlations and a copula to address between-group correlations. Since maximum likelihood (ML) estimation is computationally intensive for high-dimensional data, we propose a fast moment-based estimation procedure. Additionally, we implement the proposed estimation procedure into a clustering algorithm, borrowing ideas from the K-means algorithm. Based on a simulation study, we demonstrate that the estimation procedure shows good stability and precision. Furthermore, it is computationally fast, unlike the ML approach which shows serious convergence issues. In addition, the clustering algorithm with our moment-based estimation procedure can identify the simulated grouped data structure. The approach is further illustrated with a high-dimensional RNA-Seq dataset of commercial potatoes.
Pose Measurement Method Based on Machine Vision and Novel Directional Target

Aiming at the shortcomings of the existing machine vision pose measurement technology, a pose measurement method based on monocular vision and a cooperative target is proposed. A planar target designed with circles and rings as the main body is dedicated to object pose measurement, and a feature point coordinate extraction and sorting algorithm is designed for this target to effectively extract image features on the target. The RANSAC algorithm and topology-based fitting for the intersection method are used to optimise data processing, further improving the accuracy of feature point coordinate extraction and ultimately achieving high-precision measurement of object poses. The experimental results show that the measurement accuracy of the roll angle perpendicular to the optical axis can reach 0.02°, and the repeatability can reach 0.0004° after removing the systematic error; the measurement accuracy of the pitch angle can reach 0.03°, and the repeatability can go to 0.002° after removing the systematic error. The measurement range of the pitch angle is [−30°, +30°]; the measurement range of the roll angle is [−179°, +179°]. The experimental results show that the system has high measurement accuracy and meets the requirements of high-precision measurement.
Liger: Interleaving Intra- and Inter-Operator Parallelism for Distributed Large Model Inference

Distributed large model inference is still in a dilemma where balancing cost and effect. The online scenarios demand intraoperator parallelism to achieve low latency and intensive communications makes it costly. Conversely, the inter-operator parallelism can achieve high throughput with much fewer communications, but it fails to enhance the effectiveness.
Image Steganography and Style Transformation Based on Generative Adversarial Network

Traditional image steganography conceals secret messages in unprocessed natural images by modifying the pixel value, causing the obtained stego to be different from the original image in terms of the statistical distribution; thereby, it can be detected by a well-trained classifier for steganalysis. To ensure the steganography is imperceptible and in line with the trend of art images produced by Artificial-Intelligence-Generated Content (AIGC) becoming popular on social networks, this paper proposes to embed hidden information throughout the process of the generation of an art-style image by designing an image-style-transformation neural network with a steganography function. The proposed scheme takes a content image, an art-style image, and messages to be embedded as inputs, processing them with an encoder–decoder model, and finally, generates a styled image containing the secret messages at the same time. An adversarial training technique was applied to enhance the imperceptibility of the generated art-style stego image from plain-style-transferred images. The lack of the original cover image makes it difficult for the opponent learning steganalyzer to identify the stego. The proposed approach can successfully withstand existing steganalysis techniques and attain the embedding capacity of three bits per pixel for a color image, according to the experimental results.
<scp>GraphZeppelin</scp> : How to Find Connected Components (Even When Graphs Are Dense, Dynamic, and Massive)

Finding the connected components of a graph is a fundamental problem with uses throughout computer science and engineering. The task of computing connected components becomes more difficult when graphs are very large, or when they are dynamic, meaning the edge set changes over time subject to a stream of edge insertions and deletions. A natural approach to computing the connected components problem on a large, dynamic graph stream is to buy enough RAM to store the entire graph. However, the requirement that the graph fit in RAM is an inherent limitation of this approach and is prohibitive for very large graphs. Thus, there is an unmet need for systems that can process dense dynamic graphs, especially when those graphs are larger than available RAM. We present a new high-performance streaming graph-processing system for computing the connected components of a graph. This system, which we call GraphZeppelin , uses new linear sketching data structures ( CubeSketch ) to solve the streaming connected components problem and as a result requires space asymptotically smaller than the space required for an lossless representation of the graph. GraphZeppelin is optimized for massive dense graphs: GraphZeppelin can process millions of edge updates (both insertions and deletions) per second, even when the underlying graph is far too large to fit in available RAM. As a result GraphZeppelin vastly increases the scale of graphs that can be processed.
Strategic Content Generation and Monetization in Financial Social Media

Strategic Content Generation and Monetization in Financial Social Media Abstract Financial social media, which relies on social media analysts (SMAs) to contribute content to investors, is a crucial channel for investors to gain financial information and for SMAs to monetize their content. The interactive nature of financial social media has given SMAs the opportunity to gain access to the investor preferences of their own audience base for financial content. Our study documents that SMAs would exploit this opportunity to strategically generate and monetize content by catering to investor preferences. Specifically, SMAs would increase the (negative) sentiment of the content if paid subscribers’ preferences for (negative) sentiment grow. Additionally, an SMA is more likely to produce paid content when the expected free readership increases and is less likely to do so when the expected paid subscriptions increase. Our findings suggest that the sentiment of financial social media content is not a mere reflection or prediction of stock market movements but also a result of SMAs’ reaction to investor preferences. We thus illustrate an approach to identify the SMAs who may amplify the investors’ confirmation biases because of such catering behaviors so that platform managers and regulators alike can utilize this method to improve the content quality of financial social media.