检索结果-内蒙古大学图书馆

Blockchain and Trusted Reputation Assessment-Based Incentive Mechanism for Healthcare Services

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Liu, Yanhua Liu, Zhihuang Zhang, Qiu Su, Jinshu Li, Xiaoyan College of Computer and Data Science Fuzhou University Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China College of Computer National University of Defense Technology Changsha410073 China

Blockchain-based healthcare IoT technology research promotes increased security for smart healthcare services such as real-time monitoring and remote disease diagnosis. In a healthcare IoT service system, it remains a challenging problem to explore effective incentive mechanisms throughout the healthcare service process and feedback to facilitate the efficiency of the blockchain consensus process. In this paper, we propose a blockchain and trusted reputation assessment-based incentive mechanism for healthcare services (BtRaI). BtRaI provides a realistic and comprehensive reputation assessment with feedback to motivate blockchain consensus node participation, effectively defending against malicious behavior in the healthcare service system. Specifically, BtRaI first introduces multiple moderation factors for comprehensive multidimensional reputation assessment and stores the assessment results credibly on the blockchain. Then, we propose an improved PBFT algorithm based on the reputation assessment to enhance blockchain consensus efficiency. Finally, BtRaI designs a token reward and punishment mechanism to motivate all parties to participate in the blockchain honestly, inhibit potential misbehavior, and encourage the healthcare system to provide better service quality. Theoretical analysis and experimental evaluation demonstrate that BtRaI effectively suppresses malicious attacks in healthcare services, improves blockchain node failure tolerance rates, and achieves blockchain transaction processing efficiency within 0.5 seconds in a 100-node consortium chain. The reputation assessment and token incentive mechanism of BtRaI have a realistic differentiation granularity and change curve, making it suitable for dynamic and complex healthcare service scenarios. © 2023, The Authors. All rights reserved.

关键词： Blockchain

A Novel Effectiveness Assessment Framework for Neoadjuvant Chemoradiotherapy of Locally Advanced Rectal Cancer Based on Multi-modal Intelligence

学校读者我要写书评

暂无评论

A Novel Effectiveness Assessment Framework for Neoadjuvant C...

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Xiao Tian Dong Sui Weifeng Liu Maozu Guo Gongning Luo Kuanquan Wang Beijing Key Laboratory for Intelligent Processing Methods of Architectural Big Data Beijing China School of Electrical and Information Engineering Beijing University of Civil Engineering and Architecture Beijing China Perceptual Computing Research Center Harbin Institute of Technology Harbin China

ISBN: (数字)9798350337488

ISBN: (纸本)9798350337495

Neoadjuvant chemoradiotherapy (nCRT) is the stan-dard treatment for locally advanced rectal cancer (LARC). With the development of artificial intelligence, an increasing number of studies have begun to explore its application in cancer treatment prediction. However, the prior methods exhibit considerable variability even with slight modifications to the input data, which could potentially undermine the reliability of the results. In this paper, we proposed RP-Net, a novel multi-modal fusion-based framework that combines feature information from magnetic resonance imaging (MRI) and whole slide images (WSI), establishing a relationship to map the therapeutic effectiveness of nCRT for LARC. We investigated the relationship of the tumour region and its periphery tissues, and demonstrated the validity of the proposed framework that involving 11 different combinations of modalities. The experimental results revealed that it has achieved higher prediction accuracy compared to the four intra-categories single-modal combinations and outperformed the two intra-categories multi-modal combinations. When compared to the other four inter-categories multi-modal combinations, the fusion features get accuracy of 2 % ~ 6% improvement respectively.

关键词： Protocols Magnetic resonance imaging Decision making Cancer treatment Reliability Bioinformatics Artificial intelligence

ACCURATELY RECOVER GLOBAL QUASIPERIODIC SYSTEMS BY FINITE POINTS

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Jiang, Kai Zhou, Qi Zhang, Pingwen Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing Ministry of Education School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China School of Mathematics and Statistics Wuhan University Wuhan430072 China School of Mathematical Sciences Peking University Beijing100871 China

Quasiperiodic systems, related to irrational numbers, are space-filling structures without decay nor translation invariance. How to accurately recover these systems, especially for non-smooth cases, presents a big challenge in numerical computation. In this paper, we propose a new algorithm, finite points recovery (FPR) method, which is available for both smooth and non-smooth cases, to address this challenge. The FPR method first establishes a homomorphism between the lower-dimensional definition domain of the quasiperiodic function and the higher-dimensional torus, then recovers the global quasiperiodic system by employing interpolation technique with finite points in the definition domain without dimensional lifting. Furthermore, we develop accurate and efficient strategies of selecting finite points according to the arithmetic properties of irrational numbers. The corresponding mathematical theory, convergence analysis, and computational complexity analysis on choosing finite points are presented. Numerical experiments demonstrate the effectiveness and superiority of FPR approach in recovering both smooth quasiperiodic functions and piecewise constant Fibonacci quasicrystals. While existing spectral methods encounter difficulties in accurately recovering non-smooth quasiperiodic *** Codes 11J68, 65D05, 65D15, 68W25 © 2023, CC BY-NC-ND.

关键词： Interpolation

Toward a Unified Framework for Unsupervised Complex Tabular Reasoning

学校读者我要写书评

暂无评论

Toward a Unified Framework for Unsupervised Complex Tabular ...

International Conference on Data Engineering

作者： Zhenyu Li Xiuxing Li Zhichao Duan Bowen Dong Ning Liu Jianyong Wang Department of Computer Science and Technology Tsinghua University Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences (ICT/CAS) University of Chinese Academy of Sciences School of Software Shandong University Jinan China

Structured tabular data exist across nearly all fields. Reasoning task over these data aims to answer questions or determine the truthiness of hypothesis sentences by understanding the semantic meaning of a table. While previous works have devoted significant efforts to the tabular reasoning task, they always assume there are sufficient labeled data. However, constructing reasoning samples over tables (and related text) is labor-intensive, especially when the reasoning process is complex. When labeled data is insufficient, the performance of models will suffer an unendurable decline. In this paper, we propose a unified framework for unsupervised complex tabular reasoning (UCTR), which generates sufficient and diverse synthetic data with complex logic for tabular reasoning tasks, assuming no human-annotated data at all. Specifically, we first utilize a random sampling strategy to collect diverse programs of different types and execute them on tables based on a "Program-Executor" module. To bridge the gap between the programs and natural language sentences, we design a powerful "NL-Generator" module to generate natural language sentences with complex logic from these programs. Since a table often occurs with its surrounding texts, we further propose novel "Table-to-Text" and "Text-to-Table" operators to handle joint table-text reasoning scenarios. This way, we can adequately exploit the unlabeled table resources to obtain a well-performed reasoning model under an unsupervised setting. Our experiments cover different tasks (question answering and fact verification) and different domains (general and specific), showing that our unsupervised methods can achieve at most 93% performance compared to supervised models. The impressive performance demonstrates that UCTR can significantly reduce the dependence on manual annotation. Moreover, we also find that it can substantially boost the supervised performance in low-resourced domains as a data augmentation technique.

关键词：

Design of reconfigurable monopole antenna with switchable dual band-notches for UWB applications

学校读者我要写书评

暂无评论

Progress In Electromagnetics Research C 2019年 96卷 97-107页

作者： Li, Ji Sun, Yufa Key Lab of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei230601 China

A reconfigurable antenna with on-demand single-band or dual-band rejection capability for ultra-wideband (UWB) applications is presented. A modified monopole structure is integrated with a U-shaped slot and an open-ended slot to realize band-rejection. The antenna operates in four modes: A full UWB (3.1–10.6 GHz) coverage antenna, a UWB antenna with a single-band WiMax or wide local area network (WLAN) rejection, and a UWB antenna with dual-band WiMax/WLAN rejection. On-demand single and dual-band rejections are implemented by controlling two slots using two PIN diodes. Thus, the adopted control technique is quite easy and requires low operating power. Details of the design process and reconfiguration mechanism are presented. The band-rejection performance is explained by return loss and surface current distribution at single-band mode. A prototype is built on a Rogers substrate and tested to validate the performances. The antenna exhibits stable radiation characteristics and almost flat gain responses across the whole band, while significantly gain reduction is achieved at the rejected bands. Therefore, this antenna is suitable for high-performance UWB systems in WiMax/WLAN dense environments with the aim to improve signal quality, system capacity, and communication efficiency. © 2019, Electromagnetics Academy. All rights reserved.

关键词： Monopole antennas

Look Inside for More: Internal Spatial Modality Perception for 3D Anomaly Detection

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Liang, Hanzhe Xie, Guoyang Hou, Chengbin Wang, Bingshu Gao, Can Wang, Jinbao College of Computer Science and Software Engineering Shenzhen University Shenzhen China Shenzhen Audencia Financial Technology Institute Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Department of Intelligent Manufacturing CATL Ningde China School of Computing and Artificial Intelligence Fuyao University of Science and Technology Fuzhou China School of Software Northwestern Polytechnical University Xi’an China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen China

3D anomaly detection has recently become a significant focus in computer vision. Several advanced methods have achieved satisfying anomaly detection performance. However, they typically concentrate on the external structure of 3D samples and struggle to leverage the internal information embedded within samples. Inspired by the basic intuition of why not look inside for more, we introduce a straightforward method named Internal Spatial Modality Perception (ISMP) to explore the feature representation from internal views fully. Specifically, our proposed ISMP consists of a critical perception module, Spatial Insight Engine (SIE), which abstracts complex internal information of point clouds into essential global features. Besides, to better align structural information with point data, we propose an enhanced key point feature extraction module for amplifying spatial structure feature representation. Simultaneously, a novel feature filtering module is incorporated to reduce noise and redundant features for further aligning precise spatial structure. Extensive experiments validate the effectiveness of our proposed method, achieving object-level and pixel-level AUROC improvements of 4.2% and 13.1%, respectively, on the Real3D-AD benchmarks. Note that the strong generalization ability of SIE has been theoretically proven and is verified in both classification and segmentation tasks. Copyright © 2024, The Authors. All rights reserved.

关键词： Feature extraction

ON THE APPROXIMATION OF QUASIPERIODIC FUNCTIONS WITH DIOPHANTINE FREQUENCIES BY PERIODIC FUNCTIONS

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Jiang, Kai Li, Shifeng Zhang, Pingwen Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China School of Mathematics and Statistics Wuhan University Wuhan430072 China School of Mathematical Sciences Peking University Beijing100871 China

We present an analysis of the approximation error for a d-dimensional quasiperiodic function f with Diophantine frequencies, approximated by a periodic function with the fundamental domain [0, L1) × [0, L2) × · · · × [0, Ld). When f has a certain regularity, its global behavior can be described by a finite number of Fourier components and has a polynomial decay at infinity. The dominant part of periodic approximation error is bounded by (formula presented), where Lj belongs to the best simultaneous approximation sequence and sj is the number of different irrational elements in j-th dimension component of Fourier frequencies, respectively. Meanwhile, we discuss the approximation rate. Finally, these analytical results are verified by some examples. Copyright © 2023, The Authors. All rights reserved.

关键词： Natural frequencies

Learning to Learn Transferable Generative Attack for Person Re-Identification

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Bian, Yuan Liu, Min Wang, Xueping Ma, Yunfeng Wang, Yaonan The College of Electrical and Information Engineering Hunan University National Engineering Research Center of Robot Visual Perception and Control Technology Hunan Changsha China The College of Information Science and Engineering Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Changsha China

Deep learning-based person re-identification (re-id) models are widely employed in surveillance systems and inevitably inherit the vulnerability of deep networks to adversarial attacks. Existing attacks merely consider cross-dataset and cross-model transferability, ignoring the cross-test capability to perturb models trained in different domains. To powerfully examine the robustness of real-world re-id models, the Meta Transferable Generative Attack (MTGA) method is proposed, which adopts meta-learning optimization to promote the generative attacker producing highly transferable adversarial examples by learning comprehensively simulated transfer-based cross-model&dataset&test black-box meta attack tasks. Specifically, cross-model&dataset black-box attack tasks are first mimicked by selecting different re-id models and datasets for meta-train and meta-test attack processes. As different models may focus on different feature regions, the Perturbation Random Erasing module is further devised to prevent the attacker from learning to only corrupt model-specific features. To boost the attacker learning to possess cross-test transferability, the Normalization Mix strategy is introduced to imitate diverse feature embedding spaces by mixing multi-domain statistics of target models. Extensive experiments show the superiority of MTGA, especially in cross-model&dataset and cross-model&dataset&test attacks, our MTGA outperforms the SOTA methods by 21.5% and 11.3% on mean mAP drop rate, respectively. The code of MTGA will be released after the paper is accepted. Copyright © 2024, The Authors. All rights reserved.

关键词： Generative adversarial networks

Combining Kernelized Autoencoding and Centroid Prediction for Dynamic Multi-objective Optimization

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Hou, Zhanglu Zou, Juan Ruan, Gan Liu, Yuan Xia, Yizhang Hunan Engineering Research Center of Intelligent System Optimization and Security Key Laboratory of Intelligent Computing and Information Processing Ministry of Education of China Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan University Hunan Province Xiangtan411105 China CERCIA School of Computer Science University of Birmingham Edgbaston BirminghamB15 2TT United Kingdom

Evolutionary algorithms face significant challenges when dealing with dynamic multi-objective optimization because Pareto optimal solutions and/or Pareto optimal fronts change. This paper proposes a unified paradigm, which combines the kernelized autoncoding evolutionary search and the centriod-based prediction (denoted by KAEP), for solving dynamic multi-objective optimization problems (DMOPs). Specifically, whenever a change is detected, KAEP reacts effectively to it by generating two subpopulations. The first subpoulation is generated by a simple centriod-based prediction strategy. For the second initial subpopulation, the kernel autoencoder is derived to predict the moving of the Pareto-optimal solutions based on the historical elite solutions. In this way, an initial population is predicted by the proposed combination strategies with good convergence and diversity, which can be effective for solving DMOPs. The performance of our proposed method is compared with five state-of-the-art algorithms on a number of complex benchmark problems. Empirical results fully demonstrate the superiority of our proposed method on most test instances. Copyright © 2023, The Authors. All rights reserved.

关键词： Forecasting