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

SSRN 2025年

作者： Zhang, Zhuan Wang, Lihui Chen, Qijian Wang, Li Jian, Caiqing Zhu, Yue-Min Wei, Hongjiang Engineering Research Center of Text Computing & Cognitive Intelligence Ministry of Education Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang550025 China University Lyon INSA Lyon CNRS Inserm IRP Metislab CREATIS UMR5220 U1206 Lyon69621 France

Due to the heterogeneous distributions of multi-center rs-fMRI data, currently it is still challenging to identify accurately autism spectrum disorder (ASD) patients from these heterogenous data. To deal with the influence of heterogeneous distributions on multi-center ASD diagnosis, a novel causal adversarial graph neural network (CAG) for multi-center ASD prediction is proposed in this work. CAG mainly consists of a graph filtering (GF) module and a learnable causal graph predictor (CGP). Specifically, the brain connection graph is first constructed from rs-fMRI data, after passing a GF module, the filtered graph is further divided by a causal subgraph and causally irrelevant subgraph. The ground-truth environmental labels and ASD labels are predicted from causal subgraph by a clustering method and a classification block, respectively. In addition, from the filtered graph and causally irrelevant subgraph, the environmental labels are predicted, while from the causally irrelevant subgraph the ASD labels are predicted. Assuming that the predicted environmental labels are independent to causal subgraph, while the predicted ASD labels are independent to causally irrelevant subgraph, accordingly, several adversarial losses are implemented by reversing the gradient. Through this adversarial learning strategy, the derived causal graph can predict multi-center ASD. The comparison experiments on both ABIDE-I and ABIDE-II datasets demonstrate that, the ACC and AUC of CAG has been improved by 3.78\% and 7.38\% at least comparing against the existing methods. Moreover, some abnormal functional connectivities in ASD group are identified from the causal subgraph which may provide useful imaging biomarkers for the early diagnosis of ASD. © 2025, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

BlzFS: Crash Consistent Log-structured File System Based on Byte-loggable Zone for ZNS SSD

BlzFS: Crash Consistent Log-structured File System Based on ...

引用

IEEE International Conference on Computer Design: VLSI in Computers and Processors, (ICCD)

作者： Wenjie Qi Zhipeng Tan Ziyue Zhang Jing Zhang Chao Yu Ying Yuan Shikai Tan Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology Ministry of Education of China School of Computer Science & Technology Huazhong University of Science & Technology Guangdong Oppo Mobile Telecommunications Corp. Ltd

Emerging Zoned Namespace (ZNS) SSDs provide hosts with fine-grained, performance-predictable storage management. The ZNS SSD divides its address space into zones, and each zone must be written sequentially and cannot be overwritten. However, the write constraint results in frequent small modifications of file metadata to record the latest logical block addresses of the updated data blocks, increasing the overhead of fsync() system call. We comprehensively analyze the metadata overhead of fsync on a real ZNS SSD and find that (1) the update size of most metadata blocks (e.g., tens of bytes) is far less than the IO unit of the zone (e.g., 4 KiB), and frequent fsyncs cause severe metadata write amplification; (2) metadata block IOs significantly increase the fsync latency, decreasing the throughput of *** reduce the metadata overhead of fsync, we build the byte-loggable zone based on the persistent write cache of the opened zone, a novel extension of ZNS, which can be appended at byte granularity instead of block. Based on the byte-loggable zone, we present BlzFS, a high-performance and crash-consistent file system for ZNS SSD. Firstly, BlzFS maintains the update ranges of the metadata block by the update bitmap. Secondly, BlzFS ensures the persistence and consistency of metadata by logging the partial updates of metadata blocks to the device’s byte-loggable zone. Finally, BlzFS restores metadata consistency by replaying the metadata update log and scanning the list of recent allocated metadata blocks. In the evaluation, BlzFS shows a 33.5%∼96.1% reduction in metadata write traffic and a 1.37×∼1.91× throughput improvement compared with the original ZNS storage system.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Beyond 10logm Array Gain: A Beamforming Method Under Non-Gaussian Noise and Multi-Sources

SSRN

引用

SSRN 2023年

作者： Su, Xiruo Tao, Liurong Ren, Haoran Wu, Bin Ye, Lingyun College of Biomedical Engineering & Instrument Science Zhejiang University Hangzhou310027 China Key Laboratory of Geoscience Big Data and Deep Resource of Zhejiang Province School of Earth Sciences Zhejiang University Hangzhou310058 China Zhejiang Provincial Key Laboratory for Network Multimedia Technology Hangzhou310027 China Hainan Institute Zhejiang University Sanya572025 China Explosion and Seismic Sensing Research Center Advanced Technology Institute Zhejiang University Hangzhou310027 China

Researchers have applied deep learning techniques in the direction of arrival domain in various real-world applications, such as traffic positioning and hydro-acoustic detection. However, the effectiveness of these algorithms is dependent on the similarity of training data with actual data, which is challenging to obtain, particularly in hydro-acoustic environments. This is due to the limited array gain (AG) and constantly changing ambient noise. Moreover, the presence of non-Gaussian noise in the background further complicates the identification process, especially lower the basic 10logM AG. Additionally, the majority of existing algorithms are only capable of detecting up to four sources. To tackle this issue, we propose a novel method that employs a diagonal beam spectrum (DBS) feature to suppress non-Gaussian noise and enhance array gain. By utilizing DBS, our method surpasses the theoretical 10logM array gain and achieves an impressive 25logM array gain, while effectively detecting signals as low as -38dB (M denotes the number of sensors).We also use SA-U-NET, an image edge detection network based on DBS, to detect unlimited sound sources and optimize angular positioning. Our proposed method achieves up to 95.67% correctness (4 times better than the best baseline) in experiments , demonstrating the potential of DBS and SA-U-NET. © 2023, The Authors. All rights reserved.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

Label Structure Preserving Contrastive Embedding for Multi-Label Learning with Missing Labels

arXiv

引用

arXiv 2022年

作者： Ma, Zhongchen Li, Lisha Mao, Qirong Chen, Songcan The School of Computer Science and Communications Engineering Jiangsu University Zhenjiang212013 China Jiangsu Engineering Research Center of Big Data Ubiquitous Perception and Intelligent Agriculture Applications China MIIT Key Laboratory of Pattern Analysis and Machine Intelligence China Nanjing211106 China

Contrastive learning (CL) has shown impressive advances in image representation learning in whichever supervised multi-class classification or unsupervised learning. However, these CL methods fail to be directly adapted to multi-label image classification due to the difficulty in defining the positive and negative instances to contrast a given anchor image in multi-label scenario, let the label missing one alone, implying that borrowing a commonly-used way from contrastive multi-class learning to define them will incur a lot of false negative instances unfavorable for learning. In this paper, with the introduction of a label correction mechanism to identify missing labels, we first elegantly generate positives and negatives for individual semantic labels of an anchor image, then define a unique contrastive loss for multilabel image classification with missing labels (CLML), the loss is able to accurately bring images close to their true positive images and false negative images, far away from their true negative images. Different from existing multi-label CL losses, CLML also preserves low-rank global and local label dependencies in the latent representation space where such dependencies have been shown to be helpful in dealing with missing labels. To the best of our knowledge, this is the first general multi-label CL loss in the missing-label scenario and thus can seamlessly be paired with those losses of any existing multi-label learning methods just via a single hyperparameter. The proposed strategy has been shown to improve the classification performance of the Resnet101 model by margins of 1.2%, 1.6%, and 1.3% respectively on three standard datasets, MSCOCO, VOC, and NUS-WIDE. Code is available at https://***/chuangua/ContrastiveLossMLML. Copyright © 2022, The Authors. All rights reserved.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Low Rank Reduced Biquaternion Tensor Ring Decomposition and Tensor Completion

SSRN

引用

SSRN 2024年

作者： Luo, Hui Liu, Xin Liu, Wei Zhang, Yang School of Computer Science and Engineering Faculty of Innovation Engineering Macau University of Science and Technology Avenida Wai Long TaiPa 999078 China Macau Institute of Systems Engineering Faculty of Innovation Engineering Macau University of Science and Technology Avenida Wai Long TaiPa 999078 China School of Artificial Intelligence Sun Yat-sen University The Guangdong Key Laboratory of Big Data Analysis and Processing No.135 West Xingang Road Guangdong Provience Guangzhou510275 China Department of Mathematics University of Manitoba No.135 West Xingang Road WinnipegMBR3T 2N2 Canada

Reduced biquaternions (RBs), as an extension of complex numbers, have demonstrated exceptional capabilities in digital signal and image processing. They not only excel particularly in encoding color information but also feature multiplicative commutativity, which simplify the theoretical analysis of related algorithms. Concurrently, tensor completion methods based on tensor ring decomposition in the real domain have been proven effective in exploiting low-rank structures. Building upon these insights, this paper first introduces the Reduced Biquaternion Tensor Ring (RBTR) decomposition, along with a detailed exposition of the corresponding algorithm RBTR-SVD. Leveraging RBTR decomposition, we propose a novel low-rank tensor completion algorithm RBTR-TV integrating RBTR rank with Total Variation (TV) regularization to optimize the process. In color image completion tasks, our method exhibits remarkable stability and robustness, outperforming traditional methods, especially if there are a lot of missing data in the image. © 2024, The Authors. All rights reserved.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

Removing Interference and Recovering Content Imaginatively for Visible Watermark Removal

arXiv

引用

arXiv 2023年

作者： Leng, Yicheng Fang, Chaowei Li, Gen Fang, Yixiang Li, Guanbin School of Artificial Intelligence Xidian University Xi’an China School of Data Science The Chinese University of Hong Kong Shenzhen China Afirstsoft Shenzhen China School of Computer Science and Engineering Research Institute of Sun Yat-sen University in Shenzhen Sun Yat-sen University Guangzhou China GuangDong Province Key Laboratory of Information Security Technology China

Visible watermarks, while instrumental in protecting image copyrights, frequently distort the underlying content, complicating tasks like scene interpretation and image editing. Visible watermark removal aims to eliminate the interference of watermarks and restore the background content. However, existing methods often implement watermark component removal and background restoration tasks within a singular branch, leading to residual watermarks in the predictions and ignoring cases where watermarks heavily obscure the background. To address these limitations, this study introduces the Removing Interference and Recovering Content Imaginatively (RIRCI) framework. RIRCI embodies a two-stage approach: the initial phase centers on discerning and segregating the watermark component, while the subsequent phase focuses on background content restoration. To achieve meticulous background restoration, our proposed model employs a dual-path network capable of fully exploring the intrinsic background information beneath semi-transparent watermarks and peripheral contextual information from unaffected regions. Moreover, a Global and Local Context Interaction module is built upon multi-layer perceptrons and bidirectional feature transformation for comprehensive representation modeling in the background restoration phase. The efficacy of our approach is empirically validated across two large-scale datasets, and our findings reveal a marked enhancement over existing watermark removal techniques. Copyright © 2023, The Authors. All rights reserved.

关键词： Restoration

来源：评论

学校读者我要写书评

暂无评论

Reconfigurable Intelligent Surface Assisted High-Speed Train Communications: Coverage Performance Analysis and Placement Optimization

arXiv

引用

arXiv 2023年

作者： Liu, Changzhu He, Ruisi Niu, Yong Han, Zhu Ai, Bo Gao, Meilin Ma, Zhangfeng Wang, Gongpu Zhong, Zhangdui The State Key Laboratory of Advanced Rail Autonomous Operation The School of Electronics and Information Engineering The Frontiers Science Center for Smart High-speed Railway System The Beijing Engineering Research Center of High-Speed Railway Broadband Mobile Communications Beijing Jiaotong University Beijing100044 China The State Key Laboratory of Advanced Rail Autonomous Operation Beijing Jiaotong University Beijing100044 China The National Mobile Communications Research Laboratory Southeast University Nanjing211189 China The Department of Electrical and Computer Engineering The University of Houston HoustonTX77004 United States The Department of Computer Science and Engineering Kyung Hee University Seoul446-701 Korea Republic of Henan Joint International Research Laboratory of Intelligent Networking and Data Analysis Zhengzhou University Zhengzhou450001 China Research Center of Networks and Communications Peng Cheng Laboratory Shenzhen China The Tsinghua Space Center the Beijing National Research Center for Information Science and Technology Tsinghua University Beijing100091 China The College of Information Engineering Shaoyang University Shaoyang422000 China The Beijing Key Lab of Transportation Data Analysis and Mining School of Computer and Information Technology Beijing Jiaotong University Beijing100044 China

Reconfigurable intelligent surface (RIS) emerges as maximization problem is formulated to facilitate RIS discrete an efficient and promising technology for the next wireless phase design and RIS placement optimization, which is subject generation networks and has attracted a lot of attention owing to coverage probability constraint. Simulation results validate to the capability of extending wireless coverage by reflecting that better coverage performance and higher travel distance signals toward targeted receivers. In this paper, we consider can be achieved with deployment of RIS. The impacts of some a RIS-assisted high-speed train (HST) communication system key system parameters including transmission power, signal-to-to enhance wireless coverage and improve coverage probability. noise ratio threshold, number of RIS elements, number of RIS First, coverage performance of the downlink single-input-single- quantization bits, horizontal distance between base station and output system is investigated, and the closed-form expression RIS, and speed of HST on system performance are investigated. of coverage probability is derived. Moreover, travel distance In addition, it is found that RIS can well improve coverage probability with limited power consumption for HST communications. Copyright © 2023, The Authors. All rights reserved.

关键词： Railroads

来源：评论

学校读者我要写书评

暂无评论

Prediction of Estimated Time of Arrival for Multi-Airport Systems Via "Bubble" Mechanism

SSRN

引用

SSRN 2022年

作者： Wang, Lechen Mao, Jianfeng Li, Lishuai Li, Xuechun Tu, Yilei School of Data Science The Chinese University of Hong Kong Shenzhen China School of Science and Engineering The Chinese University of Hong Kong Shenzhen China Shenzhen Research Institute of Big Data Guangdong China Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen China Faculty of Aerospace Engineering Delft University of Technology Delft2600 AA Netherlands School of Data Science City University of Hong Kong Hong Kong

Predicting Estimated Time of Arrival (ETA) for a Multi-Airport System (MAS) is much more challenging than for a single airport system because of complex air route structure, dense air traffic volume and vagaries of traffic conditions in an MAS. In this work, we propose a novel Bubble mechanism to accurately and e ciently predict medium-term ETA for a Multi-Airport System (MAS), in which the prediction of travel time of an origin-destination (OD) pair is decomposed into two stages, termed as out-MAS and in-MAS stages. For the out-MAS stage, Auto-Regressive Integrated Moving Average (ARIMA) is used to predict the travel time of a ight to reach the MAS boundary. For the in-MAS stage, we construct new spatio-temporal features based on clustering analysis of trajectory patterns facilitated by a novel data-driven hybrid polar sampling method. A sequence-to-sequence prediction model, Multi-variate Stacked Fully connected Bidirectional Long-Short Term Memory, is further developed to achieve multi-step-ahead predictions of in-MAS travel time for each trajectory pattern using the spatio-temporal features as input. Finally, the medium-term ETA prediction for an MAS is achieved by integrating the out-MAS and in-MAS prediction with the help of trajectory pattern prediction via random forest. A case study of predicting medium-term ETA for a typical MAS in china, Guangdong-Hong Kong-Macao Greater Bay Area, is conducted to demonstrate the usage and promising performance of the proposed method in comparison to several commonly used end-to-end learning methods. © 2022, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Tackling Noisy Labels with Network Parameter Additive Decomposition

arXiv

引用

arXiv 2024年

作者： Wang, Jingyi Xia, Xiaobo Lan, Long Wu, Xinghao Yu, Jun Yang, Wenjing Han, Bo Liu, Tongliang The Department of Intelligent Data Science College of Computer Science and Technology National University of Defense Technology Changsha410073 China The Trustworthy Machine Learning Lab School of Computer Science Faculty of Engineering University of Sydney DarlingtonNSW2008 Australia The State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beihang University Beijing100191 China The Department of Automation University of Science and Technology of China Hefei230026 China The Department of Computer Science Hong Kong Baptist University Hong Kong

Given data with noisy labels, over-parameterized deep networks suffer overfitting mislabeled data, resulting in poor generalization. The memorization effect of deep networks shows that although the networks have the ability to memorize all noisy data, they would first memorize clean training data, and then gradually memorize mislabeled training data. A simple and effective method that exploits the memorization effect to combat noisy labels is early stopping. However, early stopping cannot distinguish the memorization of clean data and mislabeled data, resulting in the network still inevitably overfitting mislabeled data in the early training stage. In this paper, to decouple the memorization of clean data and mislabeled data, and further reduce the side effect of mislabeled data, we perform additive decomposition on network parameters. Namely, all parameters are additively decomposed into two groups, i.e. , parameters w are decomposed as w = σ + γ. Afterward, the parameters σ are considered to memorize clean data, while the parameters γ are considered to memorize mislabeled data. Benefiting from the memorization effect, the updates of the parameters σ are encouraged to fully memorize clean data in early training, and then discouraged with the increase of training epochs to reduce interference of mislabeled data. The updates of the parameters γ are the opposite. In testing, only the parameters σ are employed to enhance generalization. Extensive experiments on both simulated and real-world benchmarks confirm the superior performance of our method. The implementation is available at: https://***/wangjingyi9924/TNLPAD. Copyright © 2024, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

A Distinguisher for RNGs with LFSR Post-processing 16th

A Distinguisher for RNGs with LFSR Post-processing

引用

16th International Conference on Information Security and Cryptology, Inscrypt 2020

作者： Wu, Xinying Ma, Yuan Chen, Tianyu Lv, Na State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing China Data Assurance and Communications Security Research Center Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783030718510

Random number generator (RNG) is a fundamental element in modern cryptography. If the quality of the outputs generated by RNGs is not as well as expected, the cryptographic applications which use the random number service are vulnerable to security threats. In reality, the entropy source of RNGs could be impressible by the changes of environmental factors, resulting in defects in the generated data, such as poor statistical properties. Thus, RNG is generally designed with a preset post-processing module to improve the quality of the output sequences. Linear feedback shift register (LFSR) is one of the frequently used methods for post-processing thanks to the characteristic of simplicity and no reduction in output throughput. However, we point out that even if the statistical properties of the outputs of the entropy source are extremely poor, the sequences processed by LFSR can still pass the statistical test. This undoubtedly increases the security risks in the usage of RNGs. In this work, we propose a distinguisher for the RNGs with LFSR post-processing for the first time. The distinguisher can be used to detect the RNGs with LFSR post processing, and we theoretically prove the sequences before processing can be recovered. On this basis, we design a new statistical test via combining the distinguisher with the Frequency Test in the NIST test suite. The experimental results show that if the sequence is biased before being processed by LFSR, our proposed method can detect it, but the NIST SP 800-22 Test Suite cannot. © 2021, Springer Nature Switzerland AG.

关键词： Statistical tests

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：