Reviewerly/exHarmony huggingface dataset:
Metadata Standard for Continuous Preservation, Discovery, and Reuse of Research Data in Repositories by Higher Education Institutions: A Systematic Review

This systematic review synthesised existing research papers that explore the available metadata standards to enable researchers to preserve, discover, and reuse research data in repositories. This review provides a broad overview of certain aspects that must be taken into consideration when creating and assessing metadata standards to enhance research data preservation discoverability and reusability strategies. Research papers on metadata standards, research data preservation, discovery and reuse, and repositories published between January 2003 and April 2023 were reviewed from a total of five databases. The review retrieved 1597 papers, and 13 papers were selected in this review. We revealed 13 research articles that explained the creation and application of metadata standards to enhance preservation, discovery, and reuse of research data in repositories. Among them, eight presented the three main types of metadata, descriptive, structural, and administrative, to enable the preservation of research data in data repositories. We noted limited evidence on how these metadata standards can be used to enhance the discovery and reuse of research data in repositories to enable the preservation, discovery, and reuse of research data in repositories. No reviews indicated specific higher education institutions employing metadata standards for the research data created by their researchers. Repository designs and a lack of expertise and technology know-how were among the challenges identified from the reviewed papers. The review has the potential to influence professional practice and decision-making by stakeholders, including researchers, students, librarians, information communication technologists, data managers, private and public organisations, intermediaries, research institutions, and non-profit organizations.
f-AnoGAN for non-destructive testing in industrial anomaly detection

Being able to identify defects is an essential step during manufacturing processes. Yet, not all defects are necessarily known and sufficiently well described in the databases images. The challenge we address in this paper is to detect any defect by fitting a model using only normal samples of industrial parts. For this purpose, we propose to test fast AnoGAN (f-AnoGAN) approach based on a generative adversarial network (GAN). The method is an unsupervised learning algorithm, that contains two phases; first, we train a generative model using only normal images, which proposes a fast mapping of new data into the latent space. Second, we add and train an encoder to reconstruct images. The anomaly detection is defined by the reconstruction error between the defected data and the reconstructed ones, and the residual error of the discriminator. For our experiments, we use two sets of industrial data; the MVTec Anomaly Detection Dataset and a private dataset which is based on thermal-wave and used for non-destructive testing. This technique has been utilized in research for the evaluation of industrial materials. Applying the f-AnoGAN in this domain offers high anomaly detection accuracy.
Automatic scoring in fencing by using skeleton points extracted from images

First time spectators of fencing competitions cannot understand the complicated rules, making it difficult for them to enjoy the game. Therefore, in this paper, we propose a system that detects the situation of a fencing match using skeleton points extracted from videos. Players cannot be equipped with sensors or other devices to prevent interference with the match. Consequently, this research proposes a system that detects "phrases" using skeleton point information extracted from videos and displays the game situation. We evaluate actual videos of fencing to confirm the performance.
Combining unsupervised and supervised deep learning approaches for surface anomaly detection

Anomaly detection in an unsupervised manner has become the go-to approach in applications where data labeling proves problematic. However, these approaches aren’t completely unsupervised, since they rely on the weak knowledge of the dataset distribution into anomalous and anomaly-free subsets and typically require post-training threshold calibration in order to perform anomaly detection. Yet, they do not take advantage of available positive samples during training. In contrast, fully supervised approaches have proven to be more accurate and more efficient, however, they require a sufficient number of anomalous images to be labeled on a per-pixel level, which represents a labour-intensive task. In this paper, we propose a new hybrid approach that utilizes the best of both worlds. We use an unsupervised approach to build a model for generating pseudo labels, followed by a supervised approach in order to robustify anomaly detection. Moreover, we extend this approach with an active learning schema, that results in learning with mixed supervision. We achieve several improvements, i.e., the utilization of available positive image samples, improved anomaly detection performance, and the retention of real-time performance. The proposed approach yields results that are comparable to the fully supervised approach, and at the very least, reduces the number of required labeled anomalous samples.
ACL: active curriculum learning to reducing label efforts

Annotation is a labor-intensive task in deep learning, which requires large amounts of training data. In active learning, which reduces the annotation work, the performance of the model is improved without annotating all the data by performing annotation step by step. In this study, we propose a method to incorporate a curriculum learning framework into active learning, which improves the performance of the model by learning from samples that are easy to identify. The experimental results show that the proposed method achieves 20% reduction in the total annotations compared to random sampling on CIFAR-10.
Scene understanding pipeline for maintenance oriented tasks automation

Computerized Maintenance Management System (CMMS) are to assist in organising maintenance, both proactive and reactive, as well as technical operations. It usually works alongside constant surveillance and monitoring of said equipment through repetitive and time-consuming tasks. AI can ease maintenance activities by reducing the time spent on these repetitive task and allocate more time on decision. In this article we present our works on automating part of the intervention request handling in Berger-Levrault’s CMMs. We designed a pipeline of computer vision operations to predict the type of intervention needed from a picture of the situation at hand. The pipeline is basically a decision tree which combines different computer vision models and funnel images between them according to their respective outputs. Each of these models are trained separately on a specific task. To validate our approach, we performed a topic modeling analysis on the maintenance request forms to identify the ten most common topics of intervention. We show that our pipeline performs better than direct prediction by scene recognition model with a five points increases in global F1 score (40% / 45%) which is even more true for the classes with fewer training examples (23% / 37%).
Blockchain-Enabled Smart Legal Contracts

A smart legal contract is a binding contract in which some or all the contractual terms are defined in and/or performed automatically by a computer program. It runs on a blockchain platform and carries the features of the blockchain of being automatically self-executed, and immutable, providing permanent records with real-time information, and reducing cumbersome documentation using high processing power. In major jurisdictions around the world, it is generally recognised that the smart legal contract is capable of having contractual force just like a traditional natural language contract. It has the potential to have entire complex commercial contracts written in and executed by computer codes. This chapter explains the concept and operation of the smart legal contract. Its advancement as an integral part of legal practices and a mainstream area of law is described in chronological order. The judgement of the first significant case relating to the use of smart contracts is unpacked. Whilst the acceptance of smart contracts by legal practices has gained pace, novel legal issues have been emerging in this area of law. This chapter identifies and proposes solutions to key legal issues arising from the operation of computer code and the resolution of disputes of smart legal contracts.
Frequency perturbation analysis for anomaly detection using Fourier heat map

Anomaly detection is an essential task within an industry domain, and sophisticated approaches have been proposed. PaDiM has a promising direction, utilizing ImageNet-pretrained convolutional neural networks without expensive training costs. However, the cues and biases utilized by PaDiM, i.e., shape-vs-texture bias in an anomaly detection process, are unclear. To reveal the bias, we proposed to apply frequency analysis to PaDiM. For frequency analysis, we use a Fourier Heat Map that investigates the sensitivity of the anomaly detection model to input noise in the frequency domain. As a result, we found that PaDiM utilizes texture information as a cue for anomaly detection, similar to the classification models. Based on this preliminary experiment, we propose a shape-aware Stylized PaDiM. Our model is a PaDiM that uses pre-trained weights learned on Stylized ImageNet instead of ImageNet. In the experiments, we confirmed that Stylized PaDiM improves the robustness of high-frequency perturbations. Stylized PaDiM also achieved higher performance than PaDiM for anomaly detection in clean images of MVTecAD.
Discovery of User Groups Densely Connecting Virtual and Physical Worlds in Event-Based Social Networks

An essential task of the event-based social network (EBSN) platform is to recommend events to user groups. Usually, users are more willing to participate in events and interest groups with their friends, forming a particularly closely connected user group. However, such groups do not explicitly exist in EBSN. Therefore, studying how to discover groups composed of users who frequently participate in events and interest groups in EBSN has essential theoretical and practical significance. This article proposes the problem of discovering maximum k fully connected user groups. To address this issue, this article designs and implements three algorithms: a search algorithm based on Max-miner (MMBS), a search algorithm based on two vectors (TVBS) and enumeration tree, and a divide-and-conquer parallel search algorithm (DCPS). The authors conducted experiments on real datasets. The comparison of experimental results of these three algorithms on datasets from different cities shows that the DCPS algorithm and TVBS algorithm significantly accelerate their computational time when the minimum support rate is low. The time consumption of DCPS algorithm can reach one tenth or even lower than that of MMBS algorithm.
Blockchain from a Modern Perspective: An Evolution to Health Science

This paper gives a thorough evaluation of the literature on blockchain applications in healthcare. The evaluation included 42 papers that presented current information on the existing implications and gaps in the usage of blockchain technology for enhancing healthcare systems. According to the SLR results, blockchain is being utilized to produce unique and sophisticated solutions to enhance the prevailing standards of medical data handling, sharing, and processing. In the healthcare business, blockchain technology is experiencing conceptual evolution, adding considerable value through enhanced efficiency, access control, technical innovation, privacy protection, and data management process security. The findings also indicate that the current limits are mostly related to model performance, as well as the constraints and costs involved with implementation. An integrated approach is offered to cover prospective areas where future researchers might bring considerable value, such as regulatory compliance, system architecture, and data protection. Finally, the SLR believes that further research can help to enable the wider implementation of blockchain applications to handle crucial challenges like as medical diagnostics, legal compliance, preventing fraud, and enhancing patient care in remote monitoring or medical emergencies.
Distributed Genetic Algorithm for Community Detection in Large Graphs with a Parallel Fuzzy Cognitive Map for Focal Node Identification

This study addresses the importance of focal nodes in understanding the structural composition of networks. To identify these crucial nodes, a novel technique based on parallel Fuzzy Cognitive Maps (FCMs) is proposed. By utilising the focal nodes produced by the parallel FCMs, the algorithm efficiently creates initial clusters within the population. The community discovery process is accelerated through a distributed genetic algorithm that leverages the focal nodes obtained from the parallel FCM. This approach mitigates the randomness of the algorithm, addressing the limitations of the random population selection commonly found in genetic algorithms. The proposed algorithm improves the performance of the genetic algorithm by enabling informed decision making and forming a better initial population. This enhancement leads to improved convergence and overall algorithm performance. Furthermore, as graph sizes grow, traditional algorithms struggle to handle the increased complexity. To address this challenge, distributed algorithms are necessary for effectively managing larger data sizes and complexity. The proposed method is evaluated on diverse benchmark networks, encompassing both weighted and unweighted networks. The results demonstrate the superior scalability and performance of the proposed approach compared to the existing state-of-the-art methods.
A classification method of fuzzy semi-supervised support vector machines for the problems of imbalance

Positive instances are often significantly less than negative instances in real-world classification problems. However, positive categories are typically more relevant to the primary focus of categorization tasks. Moreover, obtaining labeled data is often expensive, and the majority of real-life data is unlabeled. Therefore, semi-supervised learning has become a popular approach for addressing imbalanced problems. Traditional support vector machines (SVMs) treat all samples equally and are not suitable for semi-supervised learning. To address this issue, a semi-supervised model called the fuzzy semi-supervised SVM (FS 3 VM) has been proposed. The FS 3 VM model uses the degree of entropy-based fuzzy membership to ensure the materiality of positive classes by assigning positive instances to relatively large degrees of fuzzy membership. After introducing the mainstream FS 3 VM model, the fundamental theory and methods of the model are discussed and expanded upon, including the FS 3 VM algorithm, which applies the Sequential Minimal Optimization (SMO) algorithm to the dual problem. The proposed FS 3 VM model is a smooth and continuous optimization problem, and its dual is a standard quadratic programming. Experimental results demonstrate that the proposed FS 3 VM model outperforms other compared learning algorithms.
Abstract argumentation with conditional preferences

In this paper, we study conditional preferences in abstract argumentation by introducing a new generalization of Dung-style argumentation frameworks (AFs) called Conditional Preference-based AFs (CPAFs). Each subset of arguments in a CPAF can be associated with its own preference relation. This generalizes existing approaches for preference-handling in abstract argumentation, and allows us to reason about conditional preferences in a general way. We conduct a principle-based analysis of CPAFs and compare them to related generalizations of AFs. Specifically, we highlight similarities and differences to Modgil’s Extended AFs and show that our formalism can capture Value-based AFs. Moreover, we show that in some cases the introduction of conditional preferences leads to an increase in computational complexity.
Analysis of learning behaviour in immersive virtual reality

Immersive virtual reality technology has been widely used in teaching and learning scenarios because of its unique visual and interactive experiences that bring learners a sense of immersive reality. However, how to better apply immersive virtual reality technology to learning environments to promote learning effectiveness is a direction that has been studied and explored by many scholars. Although a growing number of studies have concluded that immersive virtual reality technology can enhance learners’ attention in teaching and learning, few studies have directly linked both learning behaviors and attention to investigate the differences in behavioral performance across attention. In this study, attention data monitored by EEG physiological brainwaves and a large number of videos recorded during learning were used to explore the differences in the sequence of high attention behaviors across performance levels in an immersive virtual reality environment using behavioral data mining techniques. The results found that there was a strong correlation between attention and performance in immersive virtual reality, that thinking and looking may be more conducive to learners’ concentration, and that high concentration behaviors in the high-performing group accompanied the test and appeared after the monitoring, while the action continued to be repeated after the high concentration behaviors in the low-performing group. Based on this, this study provides a reference method for the analysis of the learning process in this environment, and provides a theoretical basis and practical guidance for the improvement of participants’ attention and learning effectiveness.
Automatic sarcasm detection in Arabic tweets: resources and approaches

Sentiment analysis has become a prevalent issue in the research community, with researchers employing data mining and artificial intelligence approaches to extract insights from textual data. Sentiment analysis has progressed from simply classifying evaluations as positive or negative to a sophisticated task requiring a fine-grained multimodal analysis of emotions, manifestations of sarcasm, aggression, hatred, and racism. Sarcasm occurs when the intended message differs from the literal meaning of the words employed. Generally, the content of the utterance is the opposite of the context. Sentiment analysis tasks are hampered when a sarcastic tone is recognized in user-generated content. Thus, automatic sarcasm detection in textual data dramatically impacts the performance of sentiment analysis models. This study aims to explain the basic architecture of a sarcasm detection system and the most effective techniques for extracting sarcasm. Then, for the Arabic language, determining the gap and challenges.
A secure fractional-order polar harmonic transforms based image watermarking scheme using funk singular value decomposition

In addition to existing cryptographic systems, watermarking technologies have been developed to add extra security. Digital watermarking utilizes embedding or hiding techniques to protect multimedia files from copyright violations. Fundamental procedures of digital watermarking techniques are embedding and extraction. Singular value decomposition (SVD) based Image watermarking schemes become popular owing to its better trade-off among robustness and imperceptibility. Nevertheless, false positive problem (FPP) is a major issue of SVD-based watermarking schemes. The singular value that is a fixed value and does not contain structural information about image is the primary cause of FPP problem. Therefore, Message Digest algorithm image watermarking scheme based on Funk Singular Value Decomposition and Fractional-Order Polar Harmonic Transform (FSVD-FOPHT) is proposed in this paper to address this problem. The MD-5 algorithm is used to extract data from the host and watermark imageries and then create secret key. The FSVD-FOPHT method is utilized to hide watermark information in host image. The secret keys are extracted from hided image using inverse process of Fractional-Order Polar Harmonic Transforms with Funk Singular Value Decomposition algorithm. By using the extraction procedure, watermark image is extracted, and then reconstructs original watermarked image. During extraction procedure, the secret key is used for authentication to address FPP. Then, the proposed method is implemented in MATLAB and performance is analyzed with evaluation metrics, such as Embedding capacity, MSE, PSNR, and NC. The proposed method provide 14.6%, 17.34%, 19.53%, 21.46% and 23.89% high PSNR for cold-snow-landscape-water test image, 14.29%, 16.47%, 18.39%, 20.16% and 21.93% high PSNR for landscape-nature-sky-blue Test image, 16.85%, 19.99%, 22.70%, 27.22% and 29.16% high Embedding Capacity for cold-snow-landscape-water test image 22.83%, 24.64%, 27.92%, 29.60% and 31.77% high Embedding Capacity for landscape-nature-sky-blue Test image 35.38%, 32.63%, 30.95%, 28.61% and 26.08% low extraction time compared with existing methods SVD-CMSF-SIW, FE-IWS-DNN, AR-IWS-DNN, BBET-SHA1-SIW and LSB-DWT-SIW respectively.
Analysis of people’s opinions based on the vaccination procedure and e-commerce product reviews using XLnet framework

Many people have been severely affected by the COVID-19 outbreak, which has left them anxious, terrified, and other difficult feelings. Since the introduction of coronavirus vaccinations, people’s emotional spectrum has broadened and become more sophisticated.We want to observe and interpret their sentiments using deep learning techniques in this work. The most efficient way to convey one’s thoughts and feelings right now is via social media, and using Twitter may help one better understand what is popular and what is going through other people’s minds. Analyzing and visualization of data play a vital role in Data Science; as customers over e-commerce increase, feedback/reviews shared by them increase significantly, and decisions by a new customer to buy a product or not rely on these reviews; reviews might falsely be displayed which may be involving in controlling if any products demand and supply so, reviews analyzing and visualizationto understand they are genuinely playing an important role over e-commerce nowadays. Our primary objective in conducting this study was to understand better the various perspectives individuals held on the vaccination process and reviews of products purchased online. As shown by the presented study, analysis and visualization approaches may be used to facilitate rapid and easy comprehension of e-commerce data, despite its high dimensionality.All correlation and non-correlation factors were mapped and examined, providing a comprehensive picture of the proposed data and its connection to other parameters.The proposed work provides an overview of sentiment observations across arguments and the relationships between parameters; it opens the door for modeling to extract some decision-making insights from the data, which can be used to improve the efficiency of application areas like product quality and customer satisfaction.