Reviewerly/exHarmony huggingface dataset:
Over-the-Air Computation for Distributed Systems: Something Old and Something New

Facing the upcoming era of Internet-of-Things and connected intelligence, efficient information processing, computation, and communication design becomes a key challenge in large-scale intelligent systems. Recently, Over-the-Air (OtA) computation has been proposed for data aggregation and distributed computation of functions over a large set of network nodes. Theoretical foundations for this concept exist for a long time, but it was mainly investigated within the context of wireless sensor networks. There are still many open questions when applying OtA computation in different types of distributed systems where modern wireless communication technology is applied. In this article, we provide a comprehensive overview of the OtA computation principle and its applications in distributed learning, control, and inference systems, for both server-coordinated and fully decentralized architectures. Particularly, we highlight the importance of the statistical heterogeneity of data and wireless channels, the temporal evolution of model updates, and the choice of performance metrics, for the communication design in OtA federated learning (FL) systems. Several key challenges in privacy, security, and robustness aspects of OtA FL are also identified for further investigation.
One-Shot Generative Prior in Hankel-k-Space for Parallel Imaging Reconstruction

Magnetic resonance imaging serves as an essential tool for clinical diagnosis. However, it suffers from a long acquisition time. The utilization of deep learning, especially the deep generative models, offers aggressive acceleration and better reconstruction in magnetic resonance imaging. Nevertheless, learning the data distribution as prior knowledge and reconstructing the image from limited data remains challenging. In this work, we propose a novel Hankel-k-space generative model (HKGM), which can generate samples from a training set of as little as one k-space. At the prior learning stage, we first construct a large Hankel matrix from k-space data, then extract multiple structured k-space patches from the Hankel matrix to capture the internal distribution among different patches. Extracting patches from a Hankel matrix enables the generative model to be learned from the redundant and low-rank data space. At the iterative reconstruction stage, the desired solution obeys the learned prior knowledge. The intermediate reconstruction solution is updated by taking it as the input of the generative model. The updated result is then alternatively operated by imposing low-rank penalty on its Hankel matrix and data consistency constraint on the measurement data. Experimental results confirmed that the internal statistics of patches within single k-space data carry enough information for learning a powerful generative model and providing state-of-the-art reconstruction.
Evaluation of transformer models for financial targeted sentiment analysis in Spanish

Nowadays, financial data from social media plays an important role to predict the stock market. However, the exponential growth of financial information and the different polarities of sentiment that other sectors or stakeholders may have on the same information has led to the need for new technologies that automatically collect and classify large volumes of information quickly and easily for each stakeholder. In this scenario, we conduct a targeted sentiment analysis that can automatically extract the main economic target from financial texts and obtain the polarity of a text towards such main economic target, other companies and society in general. To this end, we have compiled a novel corpus of financial tweets and news headlines in Spanish, constituting a valuable resource for the Spanish-focused research community. In addition, we have carried out a performance comparison of different Spanish-specific large language models, with MarIA and BETO achieving the best results. Our best result has an overall performance of 76.04%, 74.16%, and 68.07% in macro F1-score for the sentiment classification towards the main economic target, society, and other companies, respectively, and an accuracy of 69.74% for target detection. We have also evaluated the performance of multi-label classification models in this context and obtained a performance of 71.13%.
WRITING ATTITUDE AND EMOTIONAL INTELLIGENCE AS DETERMINANTS IN BOOSTING EFL LEARNERS’ WRITING PERFORMANCE

This study aimed to find out whether or not there was a significant correlation between students’ writing attitude, emotional intelligence and their writing performance, and the predictor variables and the criterion variable. It involved 121 students of the English Education Study Programs of Tridinanti, PGRI, and Muhammadiyah Universities in Palembang. The data were collected through the use of Writing Attitude Questionnaire, Emotional Intelligence Questionnaire and a writing test. The data were analyzed by using the Pearson Product Moment correlation coeficient and partial correlation analysis. The results showed that there were significant correlations in a row of the writing attitude and writing performance with r-obtained was 0.342. There results showed there were significant correlations of emotional intelligence and writing performance because the value of.028 with the correlation coefficient of .140. and the results of the partial correlation showed that writing attitude, emotional intelligence, and writing performance had a significant correlation with r value of .280 and p-value of .001.
Detection of Tumor in the Liver Using CNN and Mobile Net

The prevalence of liver diseases is increasing in areas with high rates of alcohol addiction and among individuals who consume unhealthy diets. This is becoming a significant problem from both a medical and social perspective. Liver cancer is that type of cancer which grows rapidly and can be fatal. Detecting liver cancer in early stages can decrease mortality rates. The intent of this research is to generate a model that can help healthcare professionals identify the type of tumor in the liver region by examining tissue images from a tumor biopsy. At present, identifying whether a tumor is malicious and need medication requires significant effort, time, and expertise from a pathologist. The proposed model can be used as an initial diagnostic tool by histology specialists. The model will be developed using MobileNet architectures, specifically convolutional neural networks (CNNs), trained on ultrasound images of the liver, which possess the ability to transfer knowledge.
Image Description Generator using Residual Neural Network and Long Short-Term Memory

Human beings can describe scenarios and objects in a picture through vision easily whereas performing the same task with a computer is a complicated one. Generating captions for the objects of an image helps everyone to understand the scenario of the image in a better way. Instinctively describing the content of an image requires the apprehension of computer vision as well as natural language processing. This task has gained huge popularity in the field of technology and there is a lot of research work being carried out. Recent works have been successful in identifying objects in the image but are facing many challenges in generating captions to the given image accurately by understanding the scenario. To address this challenge, we propose a model to generate the caption for an image. Residual Neural Network (ResNet) is used to extract the features from an image. These features are converted into a vector of size 2048. The caption generation for the image is obtained with Long Short-Term Memory (LSTM). The proposed model is experimented on the Flickr8K dataset and obtained an accuracy of 88.4\%. The experimental results indicate that our model produces appropriate captions compared to the state of art models. <!-- se va indica textul rezumatului-->
Evaluation of Hotel Performance with Sentiment Analysis by Deep Learning Techniques

The subject of sentiment analysis through social media sites has witnessed significant development due to the increasing reliance of people on social media in advertising and marketing, especially after the Corona pandemic. There is no doubt that the prevalence of the Arabic language makes it considered one of the most important languages all over the world. Through human comments, it can know things if they are positive or negative. But in fact, the comments are many, and it takes work to evaluate the place or the product through a detailed reading of each comment. Therefore, this study applied deep learning approaches to this issue to provide final results that could be utilized to differentiate between the comments in the dataset. Arabic Sentiment Analysis was used and gave a percentage for each positive and negative commentary. This work used eight methods of deep learning techniques after using Fast Text as embedding, except Ara BERT. These techniques are the transformer (AraBERT), RNN (Long short-term memory (LSTM), Bidirectional long-short term memory (BI-LSTM), Gated recurrent units (GRUs), Bidirectional Gated recurrent units (BI-GRU)), CNN (like ALEXNET, proposed CNN), and ensemble model (CNN with BI-GRU). The Hotel Arabic Reviews Dataset was utilized to test the models. This paper obtained the following results. In the Ara BERT model, the accuracy is 96.442%. In CNN, like the Alex Net model, the accuracy is 93.78%. In the suggested CNN model, the accuracy is 94.43%. In the suggested LSTM model, the accuracy is 95%. In the suggested BI-LSTM model, the accuracy is 95.11%. The accuracy of the suggested GRU model is 95.07%. The accuracy of the suggested BI-GRU model is 95.02%. The accuracy is 94.52% in the Ensemble CNN with BI-GRU model that has been proposed. Consequently, the AraBERT outperformed the other approaches in terms of accuracy. Because the AraBERT has already been trained on some Arabic Wikipedia entries. The LSTM, BI-LSTM, GRU, and BI-GRU, on the other hand, had comparable outcomes.
Generalizing Math Word Problem Solvers via Solution Diversification

Current math word problem (MWP) solvers are usually Seq2Seq models trained by the (one-problem; one-solution) pairs, each of which is made of a problem description and a solution showing reasoning flow to get the correct answer. However, one MWP problem naturally has multiple solution equations. The training of an MWP solver with (one-problem; one-solution) pairs excludes other correct solutions, and thus limits the generalizability of the MWP solver. One feasible solution to this limitation is to augment multiple solutions to a given problem. However, it is difficult to collect diverse and accurate augment solutions through human efforts. In this paper, we design a new training framework for an MWP solver by introducing a solution buffer and a solution discriminator. The buffer includes solutions generated by an MWP solver to encourage the training data diversity. The discriminator controls the quality of buffered solutions to participate in training. Our framework is flexibly applicable to a wide setting of fully, semi-weakly and weakly supervised training for all Seq2Seq MWP solvers. We conduct extensive experiments on a benchmark dataset Math23k and a new dataset named Weak12k, and show that our framework improves the performance of various MWP solvers under different settings by generating correct and diverse solutions.
COCA: COllaborative CAusal Regularization for Audio-Visual Question Answering

Audio-Visual Question Answering (AVQA) is a sophisticated QA task, which aims at answering textual questions over given video-audio pairs with comprehensive multimodal reasoning. Through detailed causal-graph analyses and careful inspections of their learning processes, we reveal that AVQA models are not only prone to over-exploit prevalent language bias, but also suffer from additional joint-modal biases caused by the shortcut relations between textual-auditory/visual co-occurrences and dominated answers. In this paper, we propose a COllabrative CAusal (COCA) Regularization to remedy this more challenging issue of data biases. Specifically, a novel Bias-centered Causal Regularization (BCR) is proposed to alleviate specific shortcut biases by intervening bias-irrelevant causal effects, and further introspect the predictions of AVQA models in counterfactual and factual scenarios. Based on the fact that the dominated bias impairing model robustness for different samples tends to be different, we introduce a Multi-shortcut Collaborative Debiasing (MCD) to measure how each sample suffers from different biases, and dynamically adjust their debiasing concentration to different shortcut correlations. Extensive experiments demonstrate the effectiveness as well as backbone-agnostic ability of our COCA strategy, and it achieves state-of-the-art performance on the large-scale MUSIC-AVQA dataset.
VIDM: Video Implicit Diffusion Models

Diffusion models have emerged as a powerful generative method for synthesizing high-quality and diverse set of images. In this paper, we propose a video generation method based on diffusion models, where the effects of motion are modeled in an implicit condition manner, i.e. one can sample plausible video motions according to the latent feature of frames. We improve the quality of the generated videos by proposing multiple strategies such as sampling space truncation, robustness penalty, and positional group normalization. Various experiments are conducted on datasets consisting of videos with different resolutions and different number of frames. Results show that the proposed method outperforms the state-of-the-art generative adversarial network-based methods by a significant margin in terms of FVD scores as well as perceptible visual quality.
Stability-Based Generalization Analysis of the Asynchronous Decentralized SGD

The generalization ability often determines the success of machine learning algorithms in practice. Therefore, it is of great theoretical and practical importance to understand and bound the generalization error of machine learning algorithms. In this paper, we provide the first generalization results of the popular stochastic gradient descent (SGD) algorithm in the distributed asynchronous decentralized setting. Our analysis is based on the uniform stability tool, where stable means that the learned model does not change much in small variations of the training set. Under some mild assumptions, we perform a comprehensive generalizability analysis of the asynchronous decentralized SGD, including generalization error and excess generalization error bounds for the strongly convex, convex, and non-convex cases. Our theoretical results reveal the effects of the learning rate, training data size, training iterations, decentralized communication topology, and asynchronous delay on the generalization performance of the asynchronous decentralized SGD. We also study the optimization error regarding the objective function values and investigate how the initial point affects the excess generalization error. Finally, we conduct extensive experiments on MNIST, CIFAR-10, CIFAR-100, and Tiny-ImageNet datasets to validate the theoretical findings.
Multiple Robust Learning for Recommendation

In recommender systems, a common problem is the presence of various biases in the collected data, which deteriorates the generalization ability of the recommendation models and leads to inaccurate predictions. Doubly robust (DR) learning has been studied in many tasks in RS, with the advantage that unbiased learning can be achieved when either a single imputation or a single propensity model is accurate. In this paper, we propose a multiple robust (MR) estimator that can take the advantage of multiple candidate imputation and propensity models to achieve unbiasedness. Specifically, the MR estimator is unbiased when any of the imputation or propensity models, or a linear combination of these models is accurate. Theoretical analysis shows that the proposed MR is an enhanced version of DR when only having a single imputation and propensity model, and has a smaller bias. Inspired by the generalization error bound of MR, we further propose a novel multiple robust learning approach with stabilization. We conduct extensive experiments on real-world and semi-synthetic datasets, which demonstrates the superiority of the proposed approach over state-of-the-art methods.
Self-Emphasizing Network for Continuous Sign Language Recognition

Hand and face play an important role in expressing sign language. Their features are usually especially leveraged to improve system performance. However, to effectively extract visual representations and capture trajectories for hands and face, previous methods always come at high computations with increased training complexity. They usually employ extra heavy pose-estimation networks to locate human body keypoints or rely on additional pre-extracted heatmaps for supervision. To relieve this problem, we propose a self-emphasizing network (SEN) to emphasize informative spatial regions in a self-motivated way, with few extra computations and without additional expensive supervision. Specifically, SEN first employs a lightweight subnetwork to incorporate local spatial-temporal features to identify informative regions, and then dynamically augment original features via attention maps. It's also observed that not all frames contribute equally to recognition. We present a temporal self-emphasizing module to adaptively emphasize those discriminative frames and suppress redundant ones. A comprehensive comparison with previous methods equipped with hand and face features demonstrates the superiority of our method, even though they always require huge computations and rely on expensive extra supervision. Remarkably, with few extra computations, SEN achieves new state-of-the-art accuracy on four large-scale datasets, PHOENIX14, PHOENIX14-T, CSL-Daily, and CSL. Visualizations verify the effects of SEN on emphasizing informative spatial and temporal features. Code is available at https://github.com/hulianyuyy/SEN_CSLR
High PSNR Using Fibonacci Sequences in Classical Cryptography and Steganography Using LSB

The exchange of confidential information should be done in a secure environment.Therefore, security is needed if the exchange of information is carried out using Internet media.The way to secure the information can be done using cryptography and steganography techniques.and vigenere cipher had been applied as cryptography techniques and the LSB method as steganography techniques.This research has also compared the effect of the Fibonacci sequence in the encryption process.In this study, six images were used, each with a different extension, size, and type of images.All these images will be inserted with the secret message resulting from the encryption that applies the Fibonacci sequence or without applying the Fibonacci sequence.Fibonacci series is used to generate a random key, which is used for encrypting the message in playfair encryption algorithm.The level of effectiveness of the Fibonacci sequence has been determined and measured using MSE, PSNR, Entropy, UACI, and NPCR.The highest PSNR was in a 512x512 pixel grayscale image with a result of 7.9632, the best PSNR obtained was more than 85 dB, while the best UACI obtained was more than 49% using Fibonacci and 34% without implementing Fibonacci.The NPCR obtained is both above 99%, it is just that the image that has been implemented by Fibonacci produces a slightly higher UACI.
Attention-Conditioned Augmentations for Self-Supervised Anomaly Detection and Localization

Self-supervised anomaly detection and localization are critical to real-world scenarios in which collecting anomalous samples and pixel-wise labeling is tedious or infeasible, even worse when a wide variety of unseen anomalies could surface at test time. Our approach involves a pretext task in the context of masked image modeling, where the goal is to impose agreement between cluster assignments obtained from the representation of an image view containing saliency-aware masked patches and the uncorrupted image view. We harness the self-attention map extracted from the transformer to mask non-salient image patches without destroying the crucial structure associated with the foreground object. Subsequently, the pre-trained model is fine-tuned to detect and localize simulated anomalies generated under the guidance of the transformer's self-attention map. We conducted extensive validation and ablations on the benchmark of industrial images and achieved superior performance against competing methods. We also show the adaptability of our method to the medical images of the chest X-rays benchmark.
Noise Based Deepfake Detection via Multi-Head Relative-Interaction

Deepfake brings huge and potential negative impacts to our daily lives. As the real-life Deepfake videos circulated on the Internet become more authentic, most existing detection algorithms have failed since few visual differences can be observed between an authentic video and a Deepfake one. However, the forensic traces are always retained within the synthesized videos. In this study, we present a noise-based Deepfake detection model, NoiseDF for short, which focuses on the underlying forensic noise traces left behind the Deepfake videos. In particular, we enhance the RIDNet denoiser to extract noise traces and features from the cropped face and background squares of the video image frames. Meanwhile, we devise a novel Multi-Head Relative-Interaction method to evaluate the degree of interaction between the faces and backgrounds that plays a pivotal role in the Deepfake detection task. Besides outperforming the state-of-the-art models, the visualization of the extracted Deepfake forensic noise traces has further displayed the evidence and proved the robustness of our approach.
Improvement-Focused Causal Recourse (ICR)

Algorithmic recourse recommendations inform stakeholders of how to act to revert unfavorable decisions. However, existing methods may recommend actions that lead to acceptance (i.e., revert the model's decision) but do not lead to improvement (i.e., may not revert the underlying real-world state). To recommend such actions is to recommend fooling the predictor. We introduce a novel method, Improvement-Focused Causal Recourse (ICR), which involves a conceptual shift: Firstly, we require ICR recommendations to guide toward improvement. Secondly, we do not tailor the recommendations to be accepted by a specific predictor. Instead, we leverage causal knowledge to design decision systems that predict accurately pre- and post-recourse, such that improvement guarantees translate into acceptance guarantees. Curiously, optimal pre-recourse classifiers are robust to ICR actions and thus suitable post-recourse. In semi-synthetic experiments, we demonstrate that given correct causal knowledge ICR, in contrast to existing approaches, guides toward both acceptance and improvement.