Reviewerly/exHarmony huggingface dataset:
Using answer set programming to deal with boolean networks and attractor computation: application to gene regulatory networks of cells

Deciphering gene regulatory networks’ functioning is an essential step for better understanding of life, as these networks play a fundamental role in the control of cellular processes. Boolean networks have been widely used to represent gene regulatory networks. They allow to describe the dynamics of complex gene regulatory networks straightforwardly and efficiently. The attractors are essential in the analysis of the dynamics of a Boolean network. They explain that a particular cell can acquire specific phenotypes that may be transmitted over several generations. In this work, we consider a new representation of Boolean networks’ dynamics based on a new semantics used in Answer Set Programming (ASP). We use logic programs and ASP to express and deal with gene regulatory networks seen as Boolean networks, and develop a method to detect all the attractors of such networks. We first show how to represent and deal with general Boolean networks for the synchronous and asynchronous updates modes, where the computation of attractors requires a simulation of these networks’ dynamics. Then, we propose an approach for the particular case of circular networks where no simulation is needed. This last specific case plays an essential role in biological systems. We show several theoretical properties; in particular, simple attractors of the gene networks are represented by the stable models of the corresponding logic programs and cyclic attractors by its extra-stable models. These extra-stable models correspond to the extra-extensions of the new semantics that are not captured by the semantics of stable models. We then evaluate the proposed approach for general Boolean networks on real biological networks and the one dedicated to the case of circular networks on Boolean networks generated randomly. The obtained results for both approaches are encouraging.
Single and Hybrid-Ensemble Learning-Based Phishing Website Detection: Examining Impacts of Varied Nature Datasets and Informative Feature Selection Technique

To tackle issues associated with phishing website attacks, the study conducted rigorous experiments on RF, GB, and CATB classifiers. Since each classifier was an ensemble learner on their own; we integrated them into stacking and majority vote ensemble architectures to create hybrid-ensemble learning. Due to ensemble learning methods being known for their high computational time costs, the study applied the UFS technique to address these concerns and obtained promising results. Since the scalability and performance consistency of the phishing website detection system across numerous datasets is critical to combating various variants of phishing website attacks, we used three distinct phishing website datasets (DS-1, DS-2, and DS-3) to train and test each ensemble learning method to identify the best-performed one in terms of accuracy and model computational time. Our experimental findings reveal that the CATB classifier demonstrated scalable, consistent, and superior accuracy across three distinct datasets (attained 97.9% accuracy in DS-1, 97.36% accuracy in DS-2, and 98.59% accuracy in DS-3). When it comes to model computational time, the RF classifier was discovered to be the fastest when applied to all datasets, while the CATB classifier was discovered to be the second quickest when applied to all datasets.
Interruptible Remote Attestation of Low-end IoT Microcontrollers via Performance Counters

Remote attestation is a method used in distributed systems to detect integrity violations on a target device (prover) through a challenge–response protocol initiated by a verifier device. The prover calculates a hash of its memory, which is compared to a known good state hash by the verifier. We propose a novel technique, called Counters Help Against Roving Malware (CHARM), which uses hardware performance counters on the prover’s side and machine learning on the verifier’s side to make interruptible remote attestation feasible, even for constrained microcontrollers. We will demonstrate the effectiveness of various machine learning tools and data manipulation techniques on prediction accuracy in a variety of scenarios.
Concise outlines for a complex logic: a proof outline checker for TaDA

Abstract Modern separation logics allow one to prove rich properties of intricate code, e.g., functional correctness and linearizability of non-blocking concurrent code. However, this expressiveness leads to a complexity that makes these logics difficult to apply. Manual proofs or proofs in interactive theorem provers consist of a large number of steps, often with subtle side conditions. On the other hand, automation with dedicated verifiers typically requires sophisticated proof search algorithms that are specific to the given program logic, resulting in limited tool support that makes it difficult to experiment with program logics, e.g., when learning, improving, or comparing them. Proof outline checkers fill this gap. Their input is a program annotated with the most essential proof steps, just like the proof outlines typically presented in papers. The tool then checks automatically that this outline represents a valid proof in the program logic. In this paper, we systematically develop a proof outline checker for the TaDA logic, which reduces the checking to a simpler verification problem, for which automated tools exist. Our approach leads to proof outline checkers that provide substantially more automation than interactive provers, but are much simpler to develop than custom automatic verifiers.
Remote Sensing Digital Image Processing—Noise Reduction and Image Reconstruction

The originally recorded remote sensing digital images involve noise and system error after imaging, transmission and processing. Therefore, the first task of image processing is to restore the original image.
The Digital City Tour Guide Using Augmented Reality on the Pasupati Bridge

Bandung is a must-visit tourist destination, including those around the Paupati Bridge. The Pasupati Flyover or Pasupati Bridge is an icon of Bandung City. Because of its cool and original location, there is also an ancient building making Bandung interesting to visit and be introduced to its tourism field. One method for propelling the travel industry is with special media. By using Increased Reality (AR)- based data innovation, it can show 3D virtual articles into a genuine climate and construct 3D picture representations. AR can be utilized as an option limited time medium that assists clients with getting more clear data about the fascination they need to visit. This research aims to promote tourism with Augmented Reality using the Multimedia Development Life Cycle (MDLC) Method. The results of this study are Information and 3D images of tourism in which there is a 3D import feature to include images. It can contribute to helping tourists search for information about tourism in an area.
Fedlabx: a practical and privacy-preserving framework for federated learning

Abstract Federated learning (FL) draws attention in academia and industry due to its privacy-preserving capability in training machine learning models. However, there are still some critical security attacks and vulnerabilities, including gradients leakage and interference attacks. Meanwhile, communication is another bottleneck in basic FL schemes since large-scale FL parameter transmission leads to inefficient communication, latency, and slower learning processes. To overcome these shortcomings, different communication efficiency strategies and privacy-preserving cryptographic techniques have been proposed. However, a single method can only partially resist privacy attacks. This paper presents a practical, privacy-preserving scheme combining cryptographic techniques and communication networking solutions. We implement Kafka for message distribution, the Diffie–Hellman scheme for secure server aggregation, and gradient differential privacy for interference attack prevention. The proposed approach maintains training efficiency while being able to addressing gradients leakage problems and interference attacks. Meanwhile, the implementation of Kafka and Zookeeper provides asynchronous communication and anonymous authenticated computation with role-based access controls. Finally, we prove the privacy-preserving properties of the proposed solution via security analysis and empirically demonstrate its efficiency and practicality.
Web Based Leave Management System (Case Study of PT Java Pacific)

PT. Java Pacific has the obligation to provide leave entitlements for all employees, for the process of implementing, managing, calculating, reimbursement of leave being the task of the Human Resources Division of PT. Java Pacific. The objectives of this research include. Design and build a user-friendly web-based leave permit system. Method The method used in the development of this website-based leave application information system uses the RAD method, because it suits the needs of fast application development and has clear needs. The results obtained in this study are a leave management system that can facilitate monitoring data reporting in submitting leave at PT Java Pacific.
Promotion of hate speech by Spanish political actors on Twitter

Abstract By examining the messages published by Spanish political groups on Twitter, this paper seeks to identify the level and understanding of the type and use of hate speech within these groups’ discursive strategy. For this purpose, the topics of 60,209 tweets published between 1 September 2019 and 29 February 2020, by 16 political groups, leaders, and spokespersons of the Congress of Deputies in Spain were analysed. The data reveal a low presence of expressions of hate, most of which do not have a sentimental charge. Despite not observing a high rate of use of this type of expression within the rhetorical discursive strategy applied by political groups, some features associated with this type of expression are identified, more aimed at positioning around issues and specific social groups (immigration), and the greater use of messages published by others, retweeted by these actors for this purpose, among other features.
Simulation and Experimental Studies of Optimization of σ-Value for Block Matching and 3D Filtering Algorithm in Magnetic Resonance Images

In this study, we optimized the σ-values of a block matching and 3D filtering (BM3D) algorithm to reduce noise in magnetic resonance images. Brain T2-weighted images (T2WIs) were obtained using the BrainWeb simulation program and Rician noise with intensities of 0.05, 0.10, and 0.15. The BM3D algorithm was applied to the optimized BM3D algorithm and compared with conventional noise reduction algorithms using Gaussian, median, and Wiener filters. The clinical feasibility was assessed using real brain T2WIs from the Alzheimer’s Disease Neuroimaging Initiative. Quantitative evaluation was performed using the contrast-to-noise ratio, coefficient of variation, structural similarity index measurement, and root mean square error. The simulation results showed optimal image characteristics and similarity at a σ-value of 0.12, demonstrating superior noise reduction performance. The optimized BM3D algorithm showed the greatest improvement in the clinical study. In conclusion, applying the optimized BM3D algorithm with a σ-value of 0.12 achieved efficient noise reduction.
Improving object detection by enhancing the effect of localisation quality evaluation on detection confidence

Abstract The one‐stage object detector has been widely applied in many computer vision applications due to its high detection efficiency and simple framework. However, one‐stage detectors heavily rely on Non‐maximum Suppression to remove the duplicated predictions for the same objects, and the detectors produce detection confidence to measure the quality of those predictions. The localisation quality is an important factor to evaluate the predicted bounding boxes, but its role has not been fully utilised in previous works. To alleviate the problem, the Quality Prediction Block (QPB), a lightweight sub‐network, is designed by the authors, which strengthens the effect of localisation quality evaluation on detection confidence by leveraging the features of predicted bounding boxes. The QPB is simple in structure and applies to different forms of detection confidence. Extensive experiments are conducted on the public benchmarks, MS COCO, PASCAL VOC and Berkeley DeepDrive. The results demonstrate the effectiveness of our method in the detectors with various forms of detection confidence. The proposed approach also achieves better performance in the stronger one‐stage detectors.
New Classifier Ensemble and Fuzzy Community Detection Methods Using POP Choquet-like Integrals

Among various data analysis methods, classifier ensemble (data classification) and community network detection (data clustering) have aroused the interest of many scholars. The maximum operator, as the fusion function, was always used to fuse the results of the base algorithms in the classifier ensemble and the membership degree of nodes to classes in the fuzzy community. It is vital to use generalized fusion functions in ensemble and community applications. Since the Pseudo overlap function and the Choquet-like integrals are two new fusion functions, they can be combined as a more generalized fusion function. Along this line, this paper presents new classifier ensemble and fuzzy community detection methods using a pseudo overlap pair (POP) Choquet-like integral (expressed as a fraction). First, the pseudo overlap function pair is proposed to replace the product operator of the Choquet integral. Then, the POP Choquet-like integrals are defined to perform the combinatorial step of ensembles of classifiers and to generalize the GN modularity for the fuzzy community network. Finally, two new algorithms are designed for experiments, and some computational experiments with other algorithms show the importance of POP Choquet-like integrals. All of the experimental results show that our algorithms are practical.
Neural-Based Detection and Segmentation of Articulated Objects for Robotic Interaction in a Household Environment

Robots operating in household environments should detect and estimate the properties of articulated objects to efficiently perform tasks given by human operators. This paper presents the design and implementation of a system for estimating a point-cloud-based model of a scene, enhanced with information about articulated objects, based on a single RGB-D image. This article describes the neural method used to detect handles, detect and extract fronts, detect rotational joints, and build a point cloud model. It compares various architectures of neural networks to detect handles, the fronts of drawers and cabinets, and estimate rotational joints. In the end, the results are merged to build a 3D model of articulated objects in the environment.
Comparative study on the performance of face recognition algorithms

Facial and object recognition are more and more applied in our life. Therefore, this field has become important to both academicians and practitioners. Face recognition systems are complex systems using features of the face to recognize. Current face recognition systems may be used to increase work efficiency in various methods, including smart homes, online banking, traffic, sports, robots, and others. With various applications like this, the number of facial recognition methods has been increasing in recent years. However, the performance of face recognition systems can be significantly affected by various factors such as lighting conditions, and different types of masks (sunglasses, scarves, hats, etc.). In this paper, a detailed comparison between face recognition techniques is exposed by listing the structure of each model, the advantages and disadvantages as well as performing experiments to demonstrate the robustness, accuracy, and complexity of each algorithm. To be detailed, let’s give a performance comparison of three methods for measuring the efficacy of face recognition systems including a support vector machine (SVM), a visual geometry group with 16 layers (VGG-16), and a residual network with 50 layers (ResNet-50) in real-life settings. The efficiency of algorithms is evaluated in various environments such as normal light indoors, backlit indoors, low light indoors, natural light outdoors, and backlit outdoors. In addition, this paper also evaluates faces with hats and glasses to examine the accuracy of the methods. The experimental results indicate that the ResNet-50 has the highest accuracy to identify faces. The time to recognize is ranging from 1.1s to 1.2s in the normal environment
Bayesian Network Structure Learning Using Improved A* with Constraints from Potential Optimal Parent Sets

Learning the structure of a Bayesian network and considering the efficiency and accuracy of learning has always been a hot topic for researchers. This paper proposes two constraints to solve the problem that the A* algorithm, an exact learning algorithm, is not efficient enough to search larger networks. On the one hand, the parent–child set constraints reduce the number of potential optimal parent sets. On the other hand, the path constraints are obtained from the potential optimal parent sets to constrain the search process of the A* algorithm. Both constraints are proposed based on the potential optimal parent sets. Experiments show that the time efficiency of the A* algorithm can be significantly improved, and the ability of the A* algorithm to search larger Bayesian networks can be improved by the two constraints. In addition, compared with the globally optimal Bayesian network learning using integer linear programming (GOBNILP) algorithm and the max–min hill-climbing (MMHC) algorithm, which are state of the art, the A* algorithm enhanced by constraints still performs well in most cases.
An Innovative Approach for Removing Stripe Noise in Infrared Images

The non-uniformity of infrared detectors' readout circuits can lead to stripe noise in infrared images, which affects their effective information and poses challenges for subsequent applications. Traditional denoising algorithms have limited effectiveness in maintaining effective information. This paper proposes a multi-level image decomposition method based on an improved LatLRR (MIDILatLRR). By utilizing the global low-rank structural characteristics of stripe noise, the noise and smooth information are decomposed into low-rank part images, and texture information is adaptively decomposed into several salient part images, thereby better preserving texture edge information in the image. Sparse terms are constructed according to the smoothness of the effective information in the final low-rank part of the image and the sparsity of the stripe noise direction. The modeling of stripe noise is achieved using multi-sparse constraint representation (MSCR), and the Alternating Direction Method of Multipliers (ADMM) is used for calculation. Extensive experiments demonstrated the proposed algorithm's effectiveness and compared it with state-of-the-art algorithms in subjective judgments and objective indicators. The experimental results fully demonstrate the proposed algorithm's superiority and efficacy.
A Robust Video Watermarking Algorithm Based on Two-Dimensional Discrete Fourier Transform

Due to the continuous development and popularity of digital video technology, the copyright protection of digital video content has become an increasingly prominent issue. Digital video watermarking, as an effective means of digital copyright protection, has attracted widespread attention from academia and industry. The two-dimensional discrete Fourier transform (2D-DFT) template-based method has the advantages of good real-time performance and robustness, but the embedding capacity is small and cannot resist frame-dropping attack. To address this problem, a new template construction method is proposed in this paper, which can extend the embedding capacity from 1 bit each group of pictures (GOP) to theoretically n bits each GOP. In addition, by changing the GOP pattern, the method gains the ability to resist frame-dropping attacks. Experimental results show that the proposed method can achieve larger watermark capacity while maintaining strong robustness against image-processing attacks, geometric attacks, video-processing attacks and compression attacks.
Quantum semantic coding for structure extraction and matching applications

Quantum Natural Language Processing (QNLP) is coded in the semantic space using a combined semantic distribution classification model with tensor operations. Its theoretical results on quantum circuit mapping and quantum semantic coding of text have been tested in practice with the recent development of quantum back-end equipment. In view of the small scale of quantum natural language processing tasks, single sentence structure of quantum semantic coding, low text coverage and lack of application, this paper proposes a combination of syntactic structure to extract text and extend the sentence components of quantum semantic coding, which improves the utilization of text processing task of quantum computing resources. In view of the fact that quantum natural language processing has few cases in specific applications, this paper studies the application expansion possibility of quantum text matching and question answering applications. The development path of classical natural language processing is referred to enhance the usefulness and explore the practical ability of QNLP in the current resource-constrained conditions.
Prompt Learning with Structured Semantic Knowledge Makes Pre-Trained Language Models Better

Pre-trained language models with structured semantic knowledge have demonstrated remarkable performance in a variety of downstream natural language processing tasks. The typical methods of integrating knowledge are designing different pre-training tasks and training from scratch, which requires high-end hardware, massive storage resources, and long computing times. Prompt learning is an effective approach to tuning language models for specific tasks, and it can also be used to infuse knowledge. However, most prompt learning methods accept one token as the answer, instead of multiple tokens. To tackle this problem, we propose the long-answer prompt learning method (KLAPrompt), with three different long-answer strategies, to incorporate semantic knowledge into pre-trained language models, and we compare the performance of these three strategies through experiments. We also explore the effectiveness of the KLAPrompt method in the medical field. Additionally, we generate a word sense prediction dataset (WSP) based on the Xinhua Dictionary and a disease and category prediction dataset (DCP) based on MedicalKG. Experimental results show that discrete answers with the answer space partitioning strategy achieve the best results, and introducing structured semantic information can consistently improve language modeling and downstream tasks.