Reviewerly/exHarmony huggingface dataset:
Improving Structural MRI Preprocessing with Hybrid Transformer GANs

Magnetic resonance imaging (MRI) is a technique that is widely used in practice to evaluate any pathologies in the human body. One of the areas of interest is the human brain. Naturally, MR images are low-resolution and contain noise due to signal interference, the patient's body's radio-frequency emissions and smaller Tesla coil counts in the machinery. There is a need to solve this problem, as MR tomographs that have the capability of capturing high-resolution images are extremely expensive and the length of the procedure to capture such images increases by the order of magnitude. Vision transformers have lately shown state-of-the-art results in super-resolution tasks; therefore, we decided to evaluate whether we can employ them for structural MRI super-resolution tasks. A literature review showed that similar methods do not focus on perceptual image quality because upscaled images are often blurry and are subjectively of poor quality. Knowing this, we propose a methodology called HR-MRI-GAN, which is a hybrid transformer generative adversarial network capable of increasing resolution and removing noise from 2D T1w MRI slice images. Experiments show that our method quantitatively outperforms other SOTA methods in terms of perceptual image quality and is capable of subjectively generalizing to unseen data. During the experiments, we additionally identified that the visual saliency-induced index metric is not applicable to MRI perceptual quality assessment and that general-purpose denoising networks are effective when removing noise from MR images.
Adopting knowledge-sharing-driven blockchain technology in healthcare: a developing country’s perspective

Purpose This study aims to investigate the key factors that influence the behavioural intention of doctors to adopt the knowledge sharing driven blockchain technology in government hospitals. The study is based on the Unified Theory of Acceptance and Use of Technology 2, with the addition of trust as an independent variable and knowledge sharing as a mediating variable between trust and behavioural intention. Design/methodology/approach The data for the study was collected through a correlation and cross-sectional study using a survey, with a sample of 322 responses being used for the final analysis. The initial analysis of the data was conducted using SPSS v.26, followed by a partial least squares structural equation modelling (PLS-SEM) analysis using SmartPLS v.3.9 to test the validity and reliability of the measures and to examine the hypothesized relationships. Findings The results supported the proposed framework. The results of PLS-SEM indicate that all proposed pathways support the model. In particular, the results of the study reveal that performance expectation, effort expectation, social influence, facilitation conditions and trust are drivers of blockchain adoption and have a significant impact on the behavioural intention of clinicians in hospitals. Furthermore, the study found that knowledge sharing mediated the relationship between trust and behavioural intention. Practical implications The present study sheds light on the challenges facing blockchain technology, such as privacy and trust concerns and proposes a more sustainable approach based on knowledge management to enhance the effectiveness of blockchain technology and overcome these challenges. Originality/value The significance of this paper lies in the limited literature examining the relationships between blockchain technology and knowledge management processes. Furthermore, a hypothetical framework that includes the knowledge sharing process as a mediating variable between trust and behavioural intention to adopt blockchain technology has not been presented or developed in any previous studies, particularly in the context of Iraq. Thus, this work is novel and unique in its approach.
A Real-Time Strand Breakage Detection Method for Power Line Inspection with UAVs

Power lines are critical infrastructure components in power grid systems. Strand breakage is a kind of serious defect of power lines that can directly impact the reliability and safety of power supply. Due to the slender morphology of power lines and the difficulty in acquiring sufficient sample data, strand breakage detection remains a challenging task. Moreover, power grid corporations prefer to detect these defects on-site during power line inspection using unmanned aerial vehicles (UAVs), rather than transmitting all of the inspection data to the central server for offline processing which causes sluggish response and huge communication burden. According to the above challenges and requirements, this paper proposes a novel method for detecting broken strands on power lines in images captured by UAVs. The method features a multi-stage light-weight pipeline that includes power line segmentation, power line local image patch cropping, and patch classification. A power line segmentation network is designed to segment power lines from the background; thus, local image patches can be cropped along the power lines which preserve the detailed features of power lines. Subsequently, the patch classification network recognizes broken strands in the image patches. Both the power line segmentation network and the patch classification network are designed to be light-weight, enabling efficient online processing. Since the power line segmentation network can be trained with normal power line images that are easy to obtain and the compact patch classification network can be trained with relatively few positive samples using a multi-task learning strategy, the proposed method is relatively data efficient. Experimental results show that, trained on limited sample data, the proposed method can achieve an F1-score of 0.8, which is superior to current state-of-the-art object detectors. The average inference speed on an embedded computer is about 11.5 images per second. Therefore, the proposed method offers a promising solution for conducting real-time on-site power line defect detection with computing sources carried by UAVs.
Multiobjective sparrow search feature selection with sparrow ranking and preference information and its applications for high-dimensional data

To reduce the dimensionality of high-dimensional data and enhance its classification accuracy, feature selection can be regarded as a multiobjective optimization problem that can be addressed by evolutionary computation algorithms with promising results. However, balancing the convergence and diversity of nondominated solutions remains challenging. To address these issues, this paper proposes a multiobjective sparrow search feature selection approach with sparrow ranking and preference information and its applications for high-dimensional data. First, during the population updating process, the updating formula of observers is combined with the mutualism phase of the symbiotic organisms search algorithm to design a location updating formula of observers in the sparrow search algorithm, balancing the local development ability and global search ability of sparrow search algorithm and increasing the possibility of moving closer to the optimal solution. Second, based on the dominant and nondominated sparrow individuals of each sparrow, the dominant and nondominated distances are defined, and the sparrow ranking is proposed. The feature ranking is then designed by using the definition of sparrow ranking. Following the definition of sparrow ranking and feature ranking, the selection strategy and location updating formula of the producers in the sparrow search algorithm are proposed. Finally, a preference information-based mutation algorithm is designed to augment the diversity of the nondominated solutions and more effectively guide the whole sparrow population to a better solution. The experimental results on 14 high-dimensional datasets show that the proposed algorithm outperforms different single-objective and multiobjective optimization feature selection algorithms in terms of classification efficiency and diversity of solutions.
Self-supervised Graph-level Representation Learning with Adversarial Contrastive Learning

The recently developed unsupervised graph representation learning approaches apply contrastive learning into graph-structured data and achieve promising performance. However, these methods mainly focus on graph augmentation for positive samples, while the negative mining strategies for graph contrastive learning are less explored, leading to sub-optimal performance. To tackle this issue, we propose a Graph Adversarial Contrastive Learning (GraphACL) scheme that learns a bank of negative samples for effective self-supervised whole-graph representation learning. Our GraphACL consists of (i) a graph encoding branch that generates the representations of positive samples and (ii) an adversarial generation branch that produces a bank of negative samples. To generate more powerful hard negative samples, our method minimizes the contrastive loss during encoding updating while maximizing the contrastive loss adversarially over the negative samples for providing the challenging contrastive task. Moreover, the quality of representations produced by the adversarial generation branch is enhanced through the regularization of carefully designed bank divergence loss and bank orthogonality loss. We optimize the parameters of the graph encoding branch and adversarial generation branch alternately. Extensive experiments on 14 real-world benchmarks on both graph classification and transfer learning tasks demonstrate the effectiveness of the proposed approach over existing graph self-supervised representation learning methods.
Time‐Multiplexed Control of Programmable Silicon Photonic Circuits Enabled by Monolithic CMOS Electronics

Abstract Programmable photonic circuits require an electronic control layer to configure and stabilize the optical functionality at run‐time. Such control action is normally implemented by supervising the status of the circuit with integrated light monitors and by providing feedback signals to integrated actuators. This paper demonstrates that the control action can be effectively performed with electrical signals that are time‐multiplexed directly on the photonic chip. To this aim, the necessary electronic functionalities are monolithically integrated in a conventional 220 nm silicon photonics platform with no changes to the standard fabrication process. By exploiting a non‐conventional structure to implement metal‐oxide–semiconductor field‐effect transistors, an electronic controller is co‐designed into a programmable photonic circuit to enable a time‐multiplexed readout of integrated photodetectors and sequential activation of thermal phase shifters with on‐chip electronic memory. The accuracy of the time‐multiplexed control, achieved on a time scale of less than 10 ms, is demonstrated by penalty‐free routing of 10 Gbit s −1 modulated signals. This approach can be straightforwardly applied to large‐scale photonic chips to reduce the number of required electrical input/output connections.
Activation Function Dynamic Averaging as a Technique for Nonlinear 2D Data Denoising in Distributed Acoustic Sensors

This work studies the application of low-cost noise reduction algorithms for the data processing of distributed acoustic sensors (DAS). It presents an improvement of the previously described methodology using the activation function of neurons, which enhances the speed of data processing and the quality of event identification, as well as reducing spatial distortions. The possibility of using a cheaper radiation source in DAS setups is demonstrated. Optimal algorithms’ combinations are proposed for different types of the events recorded. The criterion for evaluating the effectiveness of algorithm performance was an increase in the signal-to-noise ratio (SNR). The finest effect achieved with a combination of algorithms provided an increase in SNR of 10.8 dB. The obtained results can significantly expand the application scope of DAS.
Research Trends in Quantum Computers by Focusing on Qubits as Their Building Blocks

Quantum computing is a rapidly developing field that has the potential to revolutionize the way we process data. In this article, we will introduce quantum computers, their hardware and the challenges associated with their development. One of the key concepts in quantum computing is the qubit, which is the basic unit of quantum information. We will discuss this concept in greater detail, exploring how qubits work and the unique properties that make them so powerful. There are currently three leading models of quantum computers: superconducting, ion trap, and neutral-atom qubits. We will compare these models, highlighting their respective advantages and limitations, and discuss the current state of research in each area. In addition to exploring the hardware of quantum computers, we will also introduce some of the innovative research projects related to qubits. Finally, we will examine the market around the quantum computing industry, outlining some of the fundamental challenges we may face.
Large Language Models are Competitive Near Cold-start Recommenders for Language- and Item-based Preferences

Traditional recommender systems leverage users’ item preference history to recommend novel content that users may like. However, modern dialog interfaces that allow users to express language-based preferences offer a fundamentally different modality for preference input. Inspired by recent successes of prompting paradigms for large language models (LLMs), we study their use for making recommendations from both item-based and language-based preferences in comparison to state-of-the-art item-based collaborative filtering (CF) methods. To support this investigation, we collect a new dataset consisting of both item-based and language-based preferences elicited from users along with their ratings on a variety of (biased) recommended items and (unbiased) random items. Among numerous experimental results, we find that LLMs provide competitive recommendation performance for pure language-based preferences (no item preferences) in the near cold-start case in comparison to item-based CF methods, despite having no supervised training for this specific task (zero-shot) or only a few labels (few-shot). This is particularly promising as language-based preference representations are more explainable and scrutable than item-based or vector-based representations.
Cyberbullying in text content detection: an analytical review

Technological advancements have resulted in an exponential increase in the use of online social networks (OSNs) worldwide.While online social networks provide a great communication medium, they also increase the user's exposure to life-threatening situations such as suicide, eating disorder, cybercrime, compulsive behavior, anxiety, and depression.To tackle the issue of cyberbullying, most existing literature focuses on developing approaches to identifying factors and understanding the textual factors associated with cyberbullying.While most of these approaches have brought great success in cyberbullying research, data availability needed to develop model detection remains a challenge in the research space.This paper conducts a comprehensive literature review to provide an understanding of cyberbullying detection.
Trusted AI in Multiagent Systems: An Overview of Privacy and Security for Distributed Learning

Motivated by the advancing computational capacity of distributed end-user equipment (UE), as well as the increasing concerns about sharing private data, there has been considerable recent interest in machine learning (ML) and artificial intelligence (AI) that can be processed on distributed UEs. Specifically, in this paradigm, parts of an ML process are outsourced to multiple distributed UEs. Then, the processed information is aggregated on a certain level at a central server, which turns a centralized ML process into a distributed one and brings about significant benefits. However, this new distributed ML paradigm raises new risks in terms of privacy and security issues. In this article, we provide a survey of the emerging security and privacy risks of distributed ML from a unique perspective of information exchange levels, which are defined according to the key steps of an ML process, i.e., we consider the following levels: 1) the level of preprocessed data; 2) the level of learning models; 3) the level of extracted knowledge; and 4) the level of intermediate results. We explore and analyze the potential of threats for each information exchange level based on an overview of current state-of-the-art attack mechanisms and then discuss the possible defense methods against such threats. Finally, we complete the survey by providing an outlook on the challenges and possible directions for future research in this critical area.
Exploring Homomorphic Encryption and Differential Privacy Techniques towards Secure Federated Learning Paradigm

The trend of the next generation of the internet has already been scrutinized by top analytics enterprises. According to Gartner investigations, it is predicted that, by 2024, 75% of the global population will have their personal data covered under privacy regulations. This alarming statistic necessitates the orchestration of several security components to address the enormous challenges posed by federated and distributed learning environments. Federated learning (FL) is a promising technique that allows multiple parties to collaboratively train a model without sharing their data. However, even though FL is seen as a privacy-preserving distributed machine learning method, recent works have demonstrated that FL is vulnerable to some privacy attacks. Homomorphic encryption (HE) and differential privacy (DP) are two promising techniques that can be used to address these privacy concerns. HE allows secure computations on encrypted data, while DP provides strong privacy guarantees by adding noise to the data. This paper first presents consistent attacks on privacy in federated learning and then provides an overview of HE and DP techniques for secure federated learning in next-generation internet applications. It discusses the strengths and weaknesses of these techniques in different settings as described in the literature, with a particular focus on the trade-off between privacy and convergence, as well as the computation overheads involved. The objective of this paper is to analyze the challenges associated with each technique and identify potential opportunities and solutions for designing a more robust, privacy-preserving federated learning framework.
Collaborative path planning and task allocation for multiple agricultural machines

Path planning and task allocation are critical concerns in multi-machine collaborative operations for unmanned farms. Nevertheless, several problems remain in the operation of agricultural machinery, such as the slow path planning algorithm, the omission of the working area, and the unreasonable scheduling of machines, resulting in low efficiency and wasted resources. Collaborative and complete coverage path planning was achieved to solve the problems of slow path planning algorithms and the omission of working areas. The farm’s electronic map was constructed using the topological map method. The improved Dijkstra algorithm based on priority queues was combined with three different complete coverage methods: the nested method, the reciprocating method, and the combination of nested and internal spiral path methods. The simulation results show that the improved Dijkstra method based on priority queues can effectively minimize the running time of the algorithm. The reciprocating method has a higher coverage index than the other two methods, with an average coverage rate of 94.73 %. To solve the problem of illogical scheduling of the same type of agricultural machines, an improved ant colony method was presented based on the whole working path to minimize the path cost. The simulation results show that the proposed method can allocate the task properly, and the path cost is reduced by 14 %–33 %. By combining the proposed path planning and task allocation methods, the whole-process path planning of a single agricultural machine and multiple agricultural machines of the same type was achieved, providing a technical solution for promoting the construction of unmanned farms.
Hybrid black widow optimization with iterated greedy algorithm for gene selection problems

Gene Selection (GS) is a strategy method targeted at reducing redundancy, limited expressiveness, and low informativeness in gene expression datasets obtained by DNA Microarray technology. These datasets contain a plethora of diverse and high-dimensional samples and genes, with a significant discrepancy in the number of samples and genes present. The complexities of GS are especially noticeable in the context of microarray expression data analysis, owing to the inherent data imbalance. The main goal of this study is to offer a simplified and computationally effective approach to dealing with the conundrum of attribute selection in microarray gene expression data. We use the Black Widow Optimization algorithm (BWO) in the context of GS to achieve this, using two unique methodologies: the unaltered BWO variation and the hybridized BWO variant combined with the Iterated Greedy algorithm (BWO-IG). By improving the local search capabilities of BWO, this hybridization attempts to promote more efficient gene selection. A series of tests was carried out using nine benchmark datasets that were obtained from the gene expression data repository in the pursuit of empirical validation. The results of these tests conclusively show that the BWO-IG technique performs better than the traditional BWO algorithm. Notably, the hybridized BWO-IG technique excels in the efficiency of local searches, making it easier to identify relevant genes and producing findings with higher levels of reliability in terms of accuracy and the degree of gene pruning. Additionally, a comparison analysis is done against five modern wrapper Feature Selection (FS) methodologies, namely BIMFOHHO, BMFO, BHHO, BCS, and BBA, in order to put the suggested BWO-IG method's effectiveness into context. The comparison that follows highlights BWO-IG's obvious superiority in reducing the number of selected genes while also obtaining remarkably high classification accuracy. The key findings were an average classification accuracy of 94.426, average fitness values of 0.061, and an average number of selected genes of 2933.767.
Scalable Optimal Layout Synthesis for NISQ Quantum Processors

Due to its effect on the success rate of a quantum circuit, quantum layout synthesis is a crucial step for circuit compilation. As such, having a layout synthesis tool that provides high solution quality is important to maximize circuit performance and fidelity for NISQ application. Previous heuristic approaches have been shown to be far from optimal when evaluated on known-optimal benchmarks. Alternatively, exact layout synthesis tools can generate optimal results with the aid of constraint solvers but generally suffer from scalability issues because of inefficient encodings and slow optimization methods. In this paper, we propose a scalable optimal layout synthesis tool that improves upon previous works, through a more succinct problem formulation as well as better encoding techniques. Additionally, we implement a depth and SWAP count optimization feature that performs iterative refinement under a fixed time budget. Experimental results show that for depth optimization, our tool can achieve a 692× speedup over the state-of-the-art optimal layout synthesis, and for SWAP optimization, we can obtain a 6,957× speedup on average. Compared to a leading heuristic-based synthesizer, for depth optimization, we can solve circuits consisting of 54 program qubits and 1726 gates within 11 hours with an 18× depth reduction and by 12× SWAP count reduction on average.