Reviewerly/exHarmony huggingface dataset:
Boosting active domain adaptation with exploration of samples

Nowadays, the idea of active learning is gradually adopted to assist domain adaptation. However, due to the existence of domain shift, the traditional active learning methods originating from semi-supervised scenarios can not be directly applied to domain adaptation. To solve the problem, active domain adaptation is proposed as a new domain adaptation paradigm, which aims to improve the performance of the model by annotating a small amount of target domain samples. In this regard, we propose an active domain adaptation method named Boosting Active Domain Adaptation with Exploration of Samples (BADA), dividing Active DA into two related issues: sample selection and sample utilization. We design the instability selection criterion based on predictive consistency and the diversity selection criterion. For the remaining unlabeled samples, we design a self-training framework, which screens out reliable samples and unreliable samples through the sample screening mechanism similar to selection criteria. And we adopt respective loss functions for reliable samples and unreliable samples. Experiments show that BADA remarkably outperforms previous active learning methods and Active DA methods on several domain adaptation datasets.
A multi-domain adaptive neural machine translation method based on domain data balancer

Most methods for multi-domain adaptive neural machine translation (NMT) currently rely on mixing data from multiple domains in a single model to achieve multi-domain translation. However, this mixing can lead to imbalanced training data, causing the model to focus on training for the large-scale general domain while ignoring the scarce resources of specific domains, resulting in a decrease in translation performance. In this paper, we propose a multi-domain adaptive NMT method based on Domain Data Balancer (DDB) to address the problems of imbalanced data caused by simple fine-tuning. By adding DDB to the Transformer model, we adaptively learn the sampling distribution of each group of training data, replace the maximum likelihood estimation criterion with empirical risk minimization training, and introduce a reward-based iterative update of the bilevel optimizer based on reinforcement learning. Experimental results show that the proposed method improves the baseline model by an average of 1.55 and 0.14 BLEU (Bilingual Evaluation Understudy) scores respectively in English-German and Chinese-English multi-domain NMT.
EmotionFusion: A unified ensemble R-CNN approach for advanced facial emotion analysis

To assess non-verbal reactions to commodities, services, or products, sentiment analysis is the technique of identifying exhibited human emotions utilizing artificial intelligence-based technology. The facial muscles flex and contract differently in response to each facial expression that a person makes, which facilitates the deep learning AI algorithms’ ability to identify an emotion. Facial emotion analysis has numerous applications across various industries and domains, leveraging the understanding of human emotions conveyed through facial expressions, so it is very much required in healthcare, security and survelliance, Forensics, Autism and cultural studies etc,.. In this study, facially expressed sentiments in real-time photographs as well as in an existing dataset are classified using object detection techniques based on deep learning. Fast Region-based Convolution Neural Network (R-CNN) is an object detection system that uses suggested areas to categorize facial expressions of emotion in real-time. Using a high-quality video collection made up of 24 actors who were photographed facially expressing eight distinct emotions (Happy, Sad, Disgust, Anger, Surprise, Fear, Contempt and Neutral). The Fast R-CNN and Mouth region-based feature extraction and Maximally Stable Extremal Regions (MSER) method used for classification and feature extraction respectively. In order to assess the deep network’s performance, the proposed work builds a confusion matrix. The network generalizes to new images rather well, as seen by the average recognition rate of 97.6% for eight emotions. The suggested deep network approach may deliver superior recognition performance when compared to CNN and SVM methods, and it can be applied to a variety of applications including online classrooms, video game testing, healthcare sectors, and automated industry.
Blockchain-based forensic trustworthiness evidence model for acquisition in the ecosystem with cloud

When a digital adversary or an insider compromised a framework, cloud Forensic examiners can simply lay out the scene of the crime and reconstruct how the event took place using scientific evidence to determine when, why, and how it happened. Be that as it may, computerized proof procurement in a cloud environment is confounded and demonstrated troublesome, Despite modern scientific securing tool compartments. Multi-occupancy, Geo-area, and Administration Level Understanding have added another layer of complexity to obtaining computerized proof from a cloud environment. To moderate these intricacies of proof procurement in the cloud environment, we want a system that can forensically keep up with the reliability and respectability of proof. In this review, we plan and execute a Blockchain-based Forensic in Cloud (BBFC) structure, utilizing a Cloud Forensic methodology (CFA). The outcomes from our single contextual analysis will exhibit that BBFC will alleviate the difficulties and intricacies looked at by computerized forensic specialists in getting acceptable advanced proof from the cloud biological system. Moreover, a quick exhibition observing the proposed Blockchain based measurable in cloud structure was assessed. BBFC will guarantee dependability, respectability, validness, and non-renouncement of the proof in the cloud. The proposed BBFC framework was also subjected to performance evaluation, considering factors such as latency, bandwidth, energy and resource utilization, and failure points. This evaluation provides insights into the efficiency and effectiveness of the framework in real-world cloud forensic scenarios.
Con2Mix: A semi-supervised method for imbalanced tabular security data1

Con2Mix (Contrastive Double Mixup) is a new semi-supervised learning methodology that innovates a triplet mixup data augmentation approach for finding code vulnerabilities in imbalanced, tabular security data sets. Tabular data sets in cybersecurity domains are widely known to pose challenges for machine learning because of their heavily imbalanced data (e.g., a small number of labeled attack samples buried in a sea of mostly benign, unlabeled data). Semi-supervised learning leverages a small subset of labeled data and a large subset of unlabeled data to train a learning model. While semi-supervised methods have been well studied in image and language domains, in security domains they remain underutilized, especially on tabular security data sets which pose especially difficult contextual information loss and balance challenges for machine learning. Experiments applying Con2Mix to collected security data sets show promise for addressing these challenges, achieving state-of-the-art performance on two evaluated data sets compared with other methods.
Pure large kernel convolutional neural network transformer for medical image registration

Deformable medical image registration is a fundamental and critical task in medical image analysis. Recently, deep learning-based methods have rapidly developed and have shown impressive results in deformable image registration. However, existing approaches still suffer from limitations in registration accuracy or generalization performance. To address these challenges, in this paper, we propose a pure convolutional neural network module (CVTF) to implement hierarchical transformers and enhance the registration performance of medical images. CVTF has a larger convolutional kernel, providing a larger global effective receptive field, which can improve the network’s ability to capture long-range dependencies. In addition, we introduce the spatial interaction attention (SIA) module to compute the interrelationship between the target feature pixel points and all other points in the feature map. This helps to improve the semantic understanding of the model by emphasizing important features and suppressing irrelevant ones. Based on the proposed CVTF and SIA, we construct a novel registration framework named PCTNet. We applied PCTNet to generate displacement fields and register medical images, and we conducted extensive experiments and validation on two public datasets, OASIS and LPBA40. The experimental results demonstrate the effectiveness and generality of our method, showing significant improvements in registration accuracy and generalization performance compared to existing methods. Our code has been available at https://github.com/fz852/PCTNet.
EDSR: Empowering super-resolution algorithms with high-quality DIV2K images

Remarkable strides have been made in Enhanced-resolution image reconstruction in recent times. In this research, we propose EDSR, a novel algorithm leveraging high-quality DIV2K images to enhance super-resolution algorithms’ performance. Our approach addresses challenges associated with capturing and reconstructing fine details and textures in low-resolution images. The training process utilizes a deep neural network fed with the extensive DIV2K dataset, comprising meticulously selected high-resolution images for super-resolution tasks. The network learns from these high-quality images to improve super-resolved outputs’ accuracy and fidelity. Extensive experimentation evaluates the effectiveness of the EDSR algorithm in achieving superior results. Experimental outcomes exhibit the remarkable progress made by EDSR compared to other leading super-resolution algorithms. The mean PSNR values obtained using EDSR on various test datasets indicate substantial improvement in image quality. The SSIM scores show enhanced preservation of fine details and textures. In the Nature category, the EDSR algorithm exhibits impressive performance, achieving a mean Peak Signal-to-Noise Ratio (PSNR) of 35.92 dB and a Structural Similarity Index (SSIM) of 0.9321. When analyzing Portrait images, the algorithm consistently maintains high quality, delivering a mean PSNR of 34.17 dB and an SSIM of 0.9125. For Cityscape images, EDSR showcases excellent capabilities with a mean PSNR of 36.05 dB and an SSIM of 0.9382, highlighting its exceptional handling in this category. Lastly, in the Still Life category, the algorithm demonstrates competence, achieving a mean PSNR of 33.79 dB and an SSIM of 0.9024. In conclusion, the proposed EDSR algorithm empowers super-resolution algorithms by leveraging high-quality DIV2K images. The empirical findings validate that EDSR is highly efficient in enhancing image quality and preserving fine details.
A feature-aware long-short interest evolution network for sequential recommendation

Recommendation systems are an effective solution to deal with information overload, particularly in the e-commerce sector, in which sequential recommendation is extensively utilized. Sequential recommendations aim to acquire users’ interests and provide accurate recommendations by analyzing users’ historical interaction sequences. To improve recommendation performance, it is vital to take into account the long- and short-term interests of users. Despite significant advancements in this domain, some issues need to be addressed. Conventional sequential recommendation models typically express each item with a uniform embedding, ignoring evolutionary patterns among item attributes, such as category, brand, and price. Moreover, these models often model users’ long- and short-term interests independently, failing to adequately address the issues of interest drift and short-term interest evolution. This study proposes a new model, the Feature-aware Long-Short Interest Evolution Network (FLSIE), to address the above-mentioned issues. Specifically, the model uses explicit feature embedding to represent item attribute information and employs a two-dimensional (2D) attention mechanism to distinguish the significance of individual features in a specific item and the relevance of each item in the interaction sequence. Furthermore, to avoid the issue of interest drift, the model employs a long-term interest guidance mechanism to enhance the representation of short-term interest and adopts a gated recurrent unit with attentional update gate to model the dynamic evolution of users’ short-term interest. Experimental results indicate that our presented model outperforms existing methods on three real-world datasets.
Postdigital Lifelong Learning

Postdigital lifelong learning is impacted by and concerns the intertwining of analog and digital, biology and physics, human and nonhuman, individual and collective, private and public aspects of learning throughout human life. It is a complex phenomenon that intersects individual and societal issues. Since the twentieth century, this intersection has been a site of struggle between at least two discourses. The democratic and humanistic capability discourse emphasises lifelong learning as the development of agency, emancipation, enlightenment, equity, and freedom. The economic and neoliberal discourse focuses on developing human capital and employability. Postdigital lifelong learning combines these two discourses and dissolves the boundaries between the individual and the collective by developing capabilities and enabling employment.
Existence of Pauli-like stabilizers for every quantum error-correcting code

The Pauli stabilizer formalism is perhaps the most thoroughly studied means of procuring quantum error-correcting codes, whereby the code is obtained through commutative Pauli operators and ``stabilized'' by them. In this work we will show that every quantum error-correcting code, including Pauli stabilizer codes and subsystem codes, has a similar structure, in that the code can be stabilized by commutative ``Paulian'' operators which share many features with Pauli operators and which form a Paulian stabilizer group. By facilitating a controlled gate we can measure these Paulian operators to acquire the error syndrome. Examples concerning codeword stabilized codes and bosonic codes will be presented; specifically, one of the examples has been demonstrated experimentally and the observable for detecting the error turns out to be Paulian, thereby showing the potential utility of this approach. This work provides a possible approach to implement error-correcting codes and to find new codes.
What is PA + con(PA) about, and where?

Abstract Justin Clarke-Doane offers what purports to be a stand-alone argument, relying on Gödel’s second incompleteness theorem, that if we hold that PA + Con(PA) and PA + ~ Con(PA) are equally true of their intended subjects, then there is no objective fact as to whether PA is consistent. It is shown that the argument is fallacious, although illuminating: The fallaciousness of the argument arises from a 20 th -century shift in our understanding of interpreted languages from the view—derived from our experience of language—of sentences as intrinsically interpreted to one which sharply distinguishes syntax and semantics, and treats uninterpreted syntactic forms as endowed with interpretations by models. It is shown that this syntax/semantic distinction, because it is “unintuitive” induces fallacies such as the one that Clarke-Doane’s argument exemplifies.
Scene flow estimation from 3D point clouds based on dual‐branch implicit neural representations

Abstract Recently, online optimisation‐based scene flow estimation has attracted significant attention due to its strong domain adaptivity. Although online optimisation‐based methods have made significant advances, the performance is far from satisfactory as only flow priors are considered, neglecting scene priors that are crucial for the representations of dynamic scenes. To address this problem, the authors introduce a dual‐branch MLP‐based architecture to encode implicit scene representations from a source 3D point cloud, which can additionally synthesise a target 3D point cloud. Thus, the mapping function between the source and synthesised target 3D point clouds is established as an extra implicit regulariser to capture scene priors. Moreover, their model infers both flow and scene priors in a stronger bidirectional manner. It can effectively establish spatiotemporal constraints among the synthesised, source, and target 3D point clouds. Experiments on four challenging datasets, including KITTI scene flow, FlyingThings3D, Argoverse, and nuScenes, show that our method can achieve potential and comparable results, proving its effectiveness and generality.
Discovering research data management trends from job advertisements using a text-mining approach

In today’s data-driven culture, research data management (RDM) is essential for the research community. The demand for reusing research datasets is a challenging and diverse process for the scientific community. Despite this, it is essential in RDM to discover trends and themes using text mining, which is scarce. The purpose of this study is to employ text mining to discover insights from job advertisements associated with RDM profiles, which collected 810 advertisements. We found RDM-related patterns using latent Dirichlet allocation (LDA) and identified three key contexts. The first is ‘research services in libraries’, with the topics of research services, research information, research universities, collection processes and library services. The second context is ‘research data’, which includes RDM, business data, university data, research data, health research, science research, social science research, data centres, data services, statistical software, digital scholarship and digital preservation. The third context is ‘workplace environment’, and the topics are leadership, work development and scientific position. Job title normalisation reveals names such as ‘data librarian’, ‘librarian’, ‘director’, ‘data curator’, ‘data manager’, ‘research data librarian’, ‘data specialist’ and ‘data officer’ are frequently employed. Focusing on titles with a single or double occurrence is new and interesting for developing nations. Reputable institutions such as Harvard, Stanford and the Massachusetts Institute of Technology, as well as countries such as the United States, the United Kingdom, Canada and Germany, are the major participants in RDM practises and services. This discovery will assist higher education institutions, RDM stakeholders, which aid in the formulation of curriculum, and job seekers to familiarise themselves with the themes.
Learning Horn envelopes via queries from language models

We present an approach for systematically probing a trained neural network to extract a symbolic abstraction of it, represented as a Boolean formula. We formulate this task within Angluin's exact learning framework, where a learner attempts to extract information from an oracle (in our work, the neural network) by posing membership and equivalence queries. We adapt Angluin's algorithm for Horn formula to the case where the examples are labelled w.r.t. an arbitrary Boolean formula in CNF (rather than a Horn formula). In this setting, the goal is to learn the smallest representation of all the Horn clauses implied by a Boolean formula—called its Horn envelope—which in our case correspond to the rules obeyed by the network. Our algorithm terminates in exponential time in the worst case and in polynomial time if the target Boolean formula can be closely approximated by its envelope. We also show that extracting Horn envelopes in polynomial time is as hard as learning CNFs in polynomial time. To showcase the applicability of the approach, we perform experiments on BERT based language models and extract Horn envelopes that expose occupation-based gender biases.
Generalized Variable Selection Algorithms for Gaussian Process Models by LASSO-Like Penalty

AbstractWith the rapid development of modern technology, massive amounts of data with complex pattern are generated. Gaussian process models that can easily fit the nonlinearity in data become more and more popular nowadays. It is often the case that in some data only a few features are important or active. However, unlike classical linear models, it is challenging to identify active variables in Gaussian process models. One of the most commonly used methods for variable selection in Gaussian process models is automatic relevance determination, which is known to be open-ended. There is no rule of thumb to determine the threshold for dropping features, which makes the variable selection in Gaussian process models ambiguous. In this work, we propose two variable selection algorithms for Gaussian process models, which use the artificial nuisance columns as baseline for identifying the active features. Moreover, the proposed methods work for both regression and classification problems. The algorithms are demonstrated using comprehensive simulation experiments and an application to multi-subject electroencephalography data that studies alcoholic levels of experimental subjects. Supplementary materials for this article are available online.KEYWORDS: Automatic relevance determinationElectroencephalography dataGaussian processPrincipal component analysisVariable selection Supplementary MaterialsThe supplementary materials provide some proofs of results and additional simulation studies.Disclosure StatementThe authors confirm that there are no relevant financial or nonfinancial competing interests to report.
VisActive: Visual-concept-based Active Learning for Image Classification under Class Imbalance

Active learning methods recommend the most informative images from a large unlabeled dataset for manual labeling. These methods improve the performance of an image classifier while minimizing manual labeling efforts. We propose VisActive, a visual-concept-based active learning method for image classification under class imbalance. VisActive learns a visual concept, a generalized representation that holds the most important image characteristics for class prediction, and then recommends for each class four sets of unlabeled images with different visual concepts to increase the diversity and enlarge the training dataset. Experimental results on four datasets show that VisActive outperforms the state-of-the-art deep active learning methods.
Appraising occupational therapy students' perceptions of virtual reality as a pedagogical innovation

Virtual reality (VR) offers a forum for a person to immerse themselves in an artificial world. Despite the emergence of VR as a teaching tool, a strong base to understand the pedagogical impact of VR within post-secondary education is absent. Furthermore, there is minimal literature on how VR can be used pedagogically with medical and rehabilitation professional students. This pilot research project sought to answer “how do students perceive that VR should be used within occupational therapy curricula after trialling a variety of educational modules?” Study participants were Masters of Occupational Therapy Students who trialed four different educational modules using four different technological solutions. After each trial they completed a questionnaire specific to the learning and then completed an overall survey about how VR should be considered for future use in the curriculum. Findings showcased that students preferred a higher level of immersion and interaction. They showed less preference for the lower technological and less immersive learning opportunities. Students shared that they would welcome VR solutions to learn about assessment, anatomy and musculoskeletal function, neuroanatomy and neurological foundations and for cases as a preparation for clinical fieldwork experiences. Future research is required to evaluate the impact of a larger scale roll out of specific learning approaches.