Reviewerly/exHarmony huggingface dataset:
A target region extraction method for ultrasound medical images based on improved <scp>PRIDNet</scp> and <scp>UCTransNet</scp>

Authors:
raw_author_name: Jintao Zhai
raw_affiliation_string: The School of Physics and Electronics Hunan Normal University Changsha Changsha China
raw_author_name: Feng Tian
raw_affiliation_string: The School of Physics and Electronics Hunan Normal University Changsha Changsha China
raw_author_name: Shengyou Qian
raw_affiliation_string: The School of Physics and Electronics Hunan Normal University Changsha Changsha China
raw_author_name: Xiao Zou
raw_affiliation_string: The School of Physics and Electronics Hunan Normal University Changsha Changsha China

Abstract: Abstract Computer‐aided diagnosis is pivotal in augmenting the diagnostic efficiency of ultrasound images. Nonetheless, the substantial presence of noise and artifacts in ultrasound images presents a challenge to the precise segmentation of the target region. To highlight and analyze the diagnostic information such as tissues, organs, and lesions in ultrasound medical images more accurately, a target region extraction method combining the improved PRIDNet and UCTransNet for ultrasound medical images is proposed. The method sequentially enhances and segments the target region of the image, thereby solving the problem of inconspicuous target region caused by noise and artifacts in ultrasound images. There are three key characteristics: (i) The feature extraction part of the enhancement network (improved PRIDNet) is redesigned for speckle noise to improve the network's ability to extract information and highlight the feature information of the target region in ultrasound images. (ii) The segmentation network with the addition of the underlying information on UCTransNet would effectively improves Channel‐wise Cross fusion Transformer (CCT) and decoder feature fusion capability. (iii) By combining the enhancement network with the segmentation network, we can further improve the segmentation accuracy of the target region in the presence of noise interference. The experiments conducted on both UFSU that we prepared and on some public datasets including BUSI, FHC, and CT2US have demonstrated that The proposed method attains MIoU, DSC, Acc, and HD of 96.34%, 98.12%, 99.35%, and 8.64 in CT2US, respectively. The method significantly surpasses those certain state‐of‐the‐art methods, demonstrating its potential to offer valuable guidance for clinical treatment. The code will be publicly released at https://github.com/425877/Target-Region-Extraction-Method-for-Ultrasound-Medical-Images .
An AI-empowered indoor digital contact tracing system for COVID-19 outbreaks in residential care homes

Authors:
raw_author_name: Lin Yang
raw_affiliation_string: School of Nursing, Hong Kong Polytechnic University, Hong Kong Special Administrative Region
raw_author_name: Man Sing Wong
raw_affiliation_string: Department of Land Surveying and Geo-Informatics, Hong Kong Polytechnic University, Hong Kong Special Administrative Region
raw_author_name: Jincheng Yu
raw_affiliation_string: The Jockey Club School of Public Health and Primary Care, The Chinese University of Hong Kong, Hong Kong Special Administrative Region
raw_author_name: Freddy Man-Hin Lam
raw_affiliation_string: Department of Rehabilitation Sciences, Hong Kong Polytechnic University, Hong Kong Special Administrative Region
raw_author_name: Daihai He
raw_affiliation_string: Department of Applied Mathematics, Hong Kong Polytechnic University, Hong Kong Special Administrative Region
raw_author_name: Lei Yang
raw_affiliation_string: Department of Computing, Hong Kong Polytechnic University, Hong Kong Special Administrative Region
raw_author_name: Yan Li
raw_affiliation_string: School of Nursing, Hong Kong Polytechnic University, Hong Kong Special Administrative Region

Abstract: An AI-empowered indoor digital contact-tracing system was developed using a centralized architecture and advanced low-energy Bluetooth technologies for indoor positioning, with careful preservation of privacy and data security. We analyzed the contact pattern data from two RCHs and investigated a COVID-19 outbreak in one study site. To evaluate the effectiveness of the system in containing outbreaks with minimal contacts under quarantine, a simulation study was conducted to compare the impact of different quarantine strategies on outbreak containment within RCHs. The significant difference in contact hours between weekdays and weekends was observed for some pairs of RCH residents and staff during the two-week data collection period. No significant difference between secondary cases and uninfected contacts was observed in a COVID-19 outbreak in terms of their demographics and contact patterns. Simulation results based on the collected contact data indicated that a threshold of accumulative contact hours one or two days prior to diagnosis of the index case could dramatically increase the efficiency of outbreak containment within RCHs by targeted isolation of the close contacts. This study demonstrated the feasibility and efficiency of employing an AI-empowered system in indoor digital contact tracing of outbreaks in RCHs in the post-pandemic era.
A Randomized Optimal k-mer Indexing Approach for Efficient Parallel Genome Sequence Compression

Authors:
raw_author_name: Subhankar Roy
raw_affiliation_string: Department of Computer Science and Engineering, Academy of Technology, Adisaptagram, Hooghly, 712121, West Bengal, India
raw_author_name: Anirban Mukhopadhyay
raw_affiliation_string: Department of Computer Science and Engineering, University of Kalyani, Kalyani, Nadia, 741235, West Bengal, India

Abstract: Next Generation Sequencing (NGS) technology generates massive amounts of genome sequence that increases rapidly over time. As a result, there is a growing need for efficient compression algorithms to facilitate the processing, storage, transmission, and analysis of large-scale genome sequences. Over the past 31 years, numerous state-of-the-art compression algorithms have been developed. The performance of any compression algorithm is measured by three main compression metrics: compression ratio, time, and memory usage. Existing k-mer hash indexing systems take more time, due to the decision-making process based on compression results. In this paper, we propose a two-phase reference genome compression algorithm using optimal k-mer length (RGCOK). Reference-based compression takes advantage of the inter-similarity between chromosomes of the same species. RGCOK achieves this by finding the optimal k-mer length for matching, using a randomization method and hashing. The performance of RGCOK was evaluated on three different benchmark data sets: novel severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2), Homo sapiens, and other species sequences using an Amazon AWS virtual cloud machine. Experiments showed that the optimal k-mer finding time by RGCOK is around 45.28 min, whereas the time for existing state-of-the-art algorithms HiRGC, SCCG, and HRCM ranges from 58 min to 8.97 h.
Weakly supervised instance segmentation via peak mining and filtering

Authors:
raw_author_name: Zuxian Huang
raw_affiliation_string: The State Key Laboratory for Novel Software Technology Nanjing University Nanjing China
raw_author_name: Gangshan Wu
raw_affiliation_string: The State Key Laboratory for Novel Software Technology Nanjing University Nanjing China

Abstract: Abstract Learning the full extent of pixel‐level instance response in a weakly supervised manner remains unsatisfactory. Peak response maps (PRMs) localizes the discriminative object regions but cannot provide complete instance information, suffering from incomplete segmentation and unreliable mask prediction by noisy proposal retrieval. This work tackles this challenging problem by mining diverse class peak responses that include more discriminative and complete object regions and retrieving more reliable proposals from noisy segment proposal galleries. First, the existing method is enhanced with two more classification branches, thus contributing to more diverse and abundant instance regions from peak response maps. The mined class peak responses from two of the branches are then merged to generate more complete peak response maps by a clustering approach in their deep feature space. Then, instance segmentation masks are retrieved from a noisy object segment proposal gallery with class confidence, which is calculated by a normal classifier to obtain cleaner mask prediction. Finally, the pseudo‐supervision can be used to train an instance segmentation network in a fully supervised manner. Experiments on the PASCAL VOC 2012 dataset and COCO dataset show that the approach works effectively and outperforms other counterparts by a margin of more than 6 %, 4%, and 3% with the mean average precision (mAP) at IoU threshold of 0.25, 0.5 and 0.75, respectively.
Information Retrieval Systems in Healthcare

Authors:
raw_author_name: Srijit Panja
raw_affiliation_string: Saras Analytics, India

Abstract: Healthcare systems generate an immense volume of data, which presents a unique opportunity to make a significant impact. This chapter examines the role of information retrieval systems in healthcare, specifically focusing on how text analysis can be utilized to enhance the understanding of medical data. By employing advanced text mining tools, this chapter demonstrates how we can extract valuable insights from these complex documents. It also presents text analytics as a solution-oriented approach, particularly beneficial in managing crises within healthcare systems and in making informed decisions based on accurate data analysis. The technical foundation of the study is rooted in the fields of natural language processing and artificial intelligence, with a focus on methodologies related to the semantics of words and text (e.g., text corpus, dictionaries, and text embeddings). Through this exploration, the chapter aims to highlight the transformative potential of text analysis and information retrieval systems in revolutionizing healthcare data understanding.
A robust bit-level image encryption based on Bessel map

Authors:
raw_author_name: Abdurrahim Toktas
raw_affiliation_string: Department of Artificial Intelligence and Data Engineering, Engineering Faculty, Ankara University, 06830 Gölbaşı, Ankara, Türkiye
raw_author_name: Uğur Erkan
raw_affiliation_string: Department of Computer Engineering, Faculty of Engineering, Karamanoglu Mehmetbey University, 70200, Karaman, Türkiye
raw_author_name: Suo Gao
raw_affiliation_string: School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China

Abstract: A chaotic map plays a critical role in image encryption (IME). The map used to generate chaotic sequences should perform high dynamic characteristics. In this study, a new chaotic system depending on the Bessel function, so-called Bessel map, and a novel Bessel map-based IME scheme are proposed for the IME. The Bessel map has three control parameters, which provide superior ergodicity and diversity. Bessel map has also order degree rather than Sine map, which is used as a control parameter boosting the security. The chaotic characteristic of the Bessel map is verified through different reliable measurements such as bifurcation diagram, trajectory phase, Lyapunov exponent (LE), sample entropy (SE), permutation entropy (PE), and 0-1 test. Then, the Bessel map is employed in a new bitwise IME (BIME) scheme based on bit-level permutation and diffusion processes. The Bessel map-based BIME is validated through various simulated cryptanalyses and cyberattacks as well as compared with the state-of-the-art schemes. The achieved results demonstrate that the BIME based on the Bessel map ensures the most secure ciphered images thanks to the excellent randomness and complexity performance.
Asynchronous Threshold ECDSA With Batch Processing

Authors:
raw_author_name: Hongxin Zhang
raw_affiliation_string: State Key Laboratory of CAD and CG, Zhejiang University, Hangzhou, China
raw_author_name: Guanghuan Xie
raw_affiliation_string: State Key Laboratory of CAD and CG, Zhejiang University, Hangzhou, China
raw_author_name: Chi Zhang
raw_affiliation_string: State Key Laboratory of CAD and CG, Zhejiang University, Hangzhou, China
raw_author_name: Rui Qin
raw_affiliation_string: State Key Laboratory for Management and Control of Complex Systems, Institute of Automation, Chinese Academy of Sciences, Beijing, China
raw_author_name: Gang Xiong
raw_affiliation_string: State Key Laboratory for Management and Control of Complex Systems, Institute of Automation, Chinese Academy of Sciences, Beijing, China
raw_author_name: Fei-Yue Wang
raw_affiliation_string: State Key Laboratory for Management and Control of Complex Systems, Institute of Automation, Chinese Academy of Sciences, Beijing, China

Abstract: Threshold Elliptic Curve Digital Signature Algorithm (ECDSA) has attracted a lot of attention due to the wide applications of ECDSA in crypto asset. Although several variants of threshold signature protocols can provide functions, such as key generation and signing, they suffer from two shortfalls. First, these schemes only discuss a single signature computation task in a synchronous algorithm context, which is difficult to adapt to real crypto-asset applications, such as custody. Second, these schemes are computing intensive and not scalable, hence can hardly support large-scale processing operations in real life even after traditional optimization, such as multithreading, is applied. In this article, we propose an innovative computation method called asynchronous threshold ECDSA with batch processing, based on the interactive threshold signature protocols. The method provides a reliable solution for critical operational scenarios, such as threshold signing and distributed key generation (DKG) in crypto-asset custody, and can be a future reference in secure data distribution mechanisms. The performance and scalability of our methods are validated through a benchmark testing.
Neural Architecture Search via Multi-Hashing Embedding and Graph Tensor Networks for Multilingual Text Classification

Authors:
raw_author_name: Xueming Yan
raw_affiliation_string: School of Information Science and Technology, Guangdong University of Foreign Studies, Guangzhou, China
raw_author_name: Han Huang
raw_affiliation_string: School of Software Engineering, South China University of Technology, Guangzhou, China
raw_author_name: Yaochu Jin
raw_affiliation_string: Faculty of Technology, Bielefeld University, Bielefeld, Germany

Abstract: Neural architecture search (NAS) has been demonstrated to be promising in deep learning for text classification. Most existing NAS algorithms, however, are proposed for single-language text classification. They may become ineffective when extended to multilingual text classification because the differences in the syntactic structure and contextual semantics of different languages increase the computational complexity of NAS search. To address the above issue, this article proposes a differential neural architecture search approach using multi-hashing embedding for multilingual text representation. A multi-hashing network capable of processing heterogeneous graph information is constructed so that cross-language syntactic and contextual semantic information can be effectively represented. In addition, a neural tensor network with multi-hashing embedding is adopted as a continuous encoder to estimate the probability for each candidate operation in the search space, and reparameterization-based gradient search is employed to efficiently search for network architectures for multilingual text representation. Our experimental results on two multilingual text classification datasets demonstrate that the proposed approach outperforms the state-of-the-art NAS methods for text classification in terms of both classification accuracy and computational efficiency.
Multi-Hop Task Routing in Vehicle-Assisted Collaborative Edge Computing

Authors:
raw_author_name: Yiqin Deng
raw_affiliation_string: School of Control Science and Engineering, Shandong University, Jinan, Shandong, China
raw_author_name: Haixia Zhang
raw_affiliation_string: School of Control Science and Engineering, Shandong University, Jinan, Shandong, China
raw_author_name: Xianhao Chen
raw_affiliation_string: Department of Electrical and Electronic Engineering, University of Hong Kong, Hong Kong SAR, China
raw_author_name: Yuguang Fang
raw_affiliation_string: Department of Computer Science, City University of Hong Kong, Hong Kong SAR, China

Abstract: Collaborative edge computing has emerged as a novel paradigm that allows edge servers (ESs) to share data and computing resources, effectively mitigating network congestion in traditional multi-access edge computing (MEC) scenarios. However, existing research in collaborative edge computing often limits offloading to only one hop, which may lead to suboptimal computing resource sharing due to challenges such as poor channel conditions or high computing workload at ESs located just one hop away. To address this limitation and enable more efficient computing resource utilization, we propose a multi-hop MEC approach that leverages omnipresent vehicles in urban areas to create a data transportation network for task delivery. Here, we propose a general multi-hop task offloading framework for vehicle-assisted collaborative edge computing where tasks from users can be offloaded to powerful ESs via potentially multi-hop transmissions. Under the proposed framework, we formulate an aggregated service throughput maximization problem by designing the task routing path subject to end-to-end latency requirements, spectrum, and computing resources. To efficiently address the curse of dimensionality problem due to vehicular mobility and channel variability, we develop a deep reinforcement learning, i.e., multi-agent deep deterministic policy gradient, based multi-hop task routing approach. Numerical results demonstrate that the proposed algorithm outperforms existing benchmark schemes.
Distinct but correct: generating diversified and entity-revised medical response

Authors:
raw_author_name: Bin Li
raw_affiliation_string: College of Electrical and Information Engineering, Hunan University, Changsha, 410082, China
raw_author_name: Hongru Liu
raw_affiliation_string: College of Electrical and Information Engineering, Hunan University, Changsha, 410082, China
raw_author_name: Yixuan Weng
raw_affiliation_string: School of Mathematics, Sun Yat-sen University, Guangzhou, 510275, China
raw_author_name: Bin Sun
raw_affiliation_string: JD Technology, Beijing, 101100, China
raw_author_name: Shutao Li
raw_affiliation_string: National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy of Sciences, Beijing, 100190, China
raw_author_name: Yongping Bai
raw_affiliation_string: Xiangya Hospital of Central South University, Changsha, 410008, China

Abstract: Medical dialogue generation (MDG) is applied for building medical dialogue systems for intelligent consultation. Such systems can communicate with patients in real time, thereby improving the efficiency of clinical diagnosis. However, predicting correct entities and correctly generating distinct responses remain a great challenge. Inspired by actual doctors’ responses to patients, we consider MDG a two-stage task: entity prediction and dialogue generation. For entity prediction, we design an ent-mac post pre-training strategy by leveraging external medical entity knowledge to enhance the pre-trained model. For dialogue generation, we propose an entity-aware fusion MDG method in which predicted entities are integrated into the dialogue generation model through different encoding fusion mechanisms, using information from different sources. Because the diverse beam search algorithm can produce responses with entities that deviate from the predicted entities, an entity-revised diverse beam search is proposed to correct the entities entailed in the generated responses and make the generated responses more distinct. The experimental results on the China Conference on Knowledge Graph and Semantic Computing 2021 (A/B tests) and the International Conference on Learning Representations 2021 (online test) datasets show that the proposed method outperforms several state-of-the-art methods, which demonstrates its practicability and effectiveness.
Multitask Kernel-based Learning with Logic Constraints

Authors:
raw_author_name: Michelangelo Diligenti
raw_affiliation_string: University of Siena, Italy, email: {diligmic,marco,maggini,rigutini}@dii.unisi.it
raw_author_name: Marco Gori
raw_affiliation_string: University of Siena, Italy, email: {diligmic,marco,maggini,rigutini}@dii.unisi.it
raw_author_name: Marco Maggini
raw_affiliation_string: University of Siena, Italy, email: {diligmic,marco,maggini,rigutini}@dii.unisi.it
raw_author_name: Leonardo Rigutini
raw_affiliation_string: University of Siena, Italy, email: {diligmic,marco,maggini,rigutini}@dii.unisi.it

Abstract: This paper presents a general framework to integrate prior knowledge in the form of logic constraints among a set of task functions into kernel machines. The logic propositions provide a partial representation of the environment, in which the learner operates, that is exploited by the learning algorithm together with the information available in the supervised examples. In particular, we consider a multi-task learning scheme, where multiple unary predicates on the feature space are to be learned by kernel machines and a higher level abstract representation consists of logic clauses on these predicates, known to hold for any input. A general approach is presented to convert the logic clauses into a continuous implementation, that processes the outputs computed by the kernel-based predicates. The learning task is formulated as a primal optimization problem of a loss function that combines a term measuring the fitting of the supervised examples, a regularization term, and a penalty term that enforces the constraints on both supervised and unsupervised examples. The proposed semi-supervised learning framework is particularly suited for learning in high dimensionality feature spaces, where the supervised training examples tend to be sparse and generalization difficult. Unlike for standard kernel machines, the cost function to optimize is not generally guaranteed to be convex. However, the experimental results show that it is still possible to find good solutions using a two stage learning schema, in which first the supervised examples are learned until convergence and then the logic constraints are forced. Some promising experimental results on artificial multi-task learning tasks are reported, showing how the classification accuracy can be effectively improved by exploiting the a priori rules and the unsupervised examples.