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

arXiv 2023年

作者： Zhang, Yechao Hu, Shengshan Zhang, Leo Yu Shi, Junyu Li, Minghui Liu, Xiaogeng Wan, Wei Jin, Hai School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Information and Communication Technology Griffith University Australia School of Computer Science and Technology Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security China Hubei Engineering Research Center on Big Data Security China Cluster and Grid Computing Lab

Adversarial examples for deep neural networks (DNNs) have been shown to be transferable: examples that successfully fool one white-box surrogate model can also deceive other black-box models with different architectures. Although a bunch of empirical studies have provided guidance on generating highly transferable adversarial examples, many of these findings fail to be well explained and even lead to confusing or inconsistent advice for practical use. In this paper, we take a further step towards understanding adversarial transferability, with a particular focus on surrogate aspects. Starting from the intriguing "little robustness" phenomenon, where models adversarially trained with mildly perturbed adversarial samples can serve as better surrogates for transfer attacks, we attribute it to a trade-off between two dominant factors: model smoothness and gradient similarity. Our research focuses on their joint effects on transferability, rather than demonstrating the separate relationships alone. Through a combination of theoretical and empirical analyses, we hypothesize that the data distribution shift induced by off-manifold samples in adversarial training is the reason that impairs gradient similarity. Building on these insights, we further explore the impacts of prevalent data augmentation and gradient regularization on transferability and analyze how the trade-off manifest in various training methods, thus building a comprehensive blueprint for the regulation mechanisms behind transferability. Finally, we provide a general route for constructing superior surrogates to boost transferability, which optimizes both model smoothness and gradient similarity simultaneously, e.g., the combination of input gradient regularization and sharpness-aware minimization (SAM), validated by extensive experiments. In summary, we call for attention to the united impacts of these two factors for launching effective transfer attacks, rather than optimizing one while ignoring the other,

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Geometric Constellation Shaping for Wireless Optical Intensity Channels: An information-Theoretic Approach

arXiv

引用

arXiv 2024年

作者： Zhou, Suhua Li, Tianqi Fang, Zhaoxi Zhou, Jing Zhang, Wenyi School of Automation Beijing Information Science and Technology University Beijing100192 China National Computer System Engineering Research Institute of China Beijing100083 China Department of Computer Science and Engineering Shaoxing University Shaoxing312000 China Henan Key Laboratory of Visible Light Communications Zhengzhou450002 China Department of Electronic Engineering and Information Science University of Science and Technology of China Hefei230027 China

A simple geometric shaping method is proposed for optical wireless communication systems based on intensity modulation and direct detection (IM/DD) from an information-theoretic perspective. Constellations consisting of equiprobable levels with exponential-like distribution are obtained, which possesses asymptotic optimality in the sense that the high-SNR capacity of average-intensity constrained optical intensity channel can be approached by such constellations with increasing size. All 2b levels (b ∈ N) of the obtained constellation can be represented by a basic level and b + 2 bits, thereby reducing the required resolution of the digital-to-analog converter (DAC) without affecting the asymptotic optimality. Achievable information rate evaluations verify the asymptotic optimality. As an example, error performance results of a simple 16-level LDPC coded modulation scheme show that a shaping gain of 0.65 dB can be obtained by applying the proposed constellation design. This method can also be applied to more specific IM/DD channel models, since it only requires a near-optimal continuous input distribution. © 2024, CC BY-NC-ND.

关键词： Digital to analog conversion

来源：评论

学校读者我要写书评

暂无评论

PIOD: An Efficient Parallel Iterative Algorithm for Solving Over-determined Equations

PIOD: An Efficient Parallel Iterative Algorithm for Solving ...

引用

International Conference on Parallel and Distributed systems (ICPADS)

作者： Min Tian Zhenguo Wei Yanlong Li Wei Du Lei Xiao Chaoshuai Xu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan Key Laboratory of High Performance Computing Jinan Institute of Supercomputing Technology

The solution of over-determined equations plays a very important role in fields such as data fitting, signal processing, and machine learning. It is of great significance in predicting natural phenomena, optimizing engineering design, and other fields. However, there is currently no efficient method to solve over-determined equations, either being not accurate enough or consuming a lot of time. In this article, we propose a parallel iterative method for solving over-determined equations, called the PIOD algorithm. By using a sub-convergence condition to terminate the iterative calculation, we have developed a task partitioning strategy for the algorithm and implemented parallelization of the solution of over-determined equations on a distributed memory system. Our proposed algorithm achieves an average speedup of 152 ×times compared to the open-source Eigen solver. Additionally, it also achieves a parallel efficiency of over 30%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Bandwidth-Efficient Two-Server ORAMs with O(1) Client Storage

arXiv

引用

arXiv 2025年

作者： Wang, Wei Zhang, Xianglong Xu, Peng Chen, Rongmao Yang, Laurence Tianruo School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Hubei Key Laboratory of Distributed System Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Jinyinhu Laboratory Wuhan430040 China School of Computer National University of Defense Technology Changsha410073 China School of Computer and Artificial Intelligence Zhengzhou University Zhengzhou450001 China Department of Computer Science St. Francis Xavier University AntigonishNSB2G 2W5 Canada

Oblivious RAM (ORAM) allows a client to securely retrieve elements from outsourced servers without leakage about the accessed elements or their virtual addresses. Two-server ORAM, designed for secure two-party RAM computation, stores data across two non-colluding servers. However, many two-server ORAM schemes suffer from excessive local storage or high bandwidth costs. To serve lightweight clients, it is crucial for ORAM to achieve concretely efficient bandwidth while maintaining O(1) local storage. Hence, this paper presents two new client-friendly two-server ORAM schemes that achieve practical logarithmic bandwidth under O(1) local storage, while incurring linear symmetric key computations. The core design features a hierarchical structure and a pairwise-area setting for the elements and their tags. Accordingly, we specify efficient read-only and write-only private information retrieval (PIR) algorithms in our schemes to ensure obliviousness in accessing two areas respectively, so as to avoid the necessity of costly shuffle techniques in previous works. We empirically evaluate our schemes against LO13 (TCC’13), AFN17 (PKC’17), and KM19 (PKC’19) in terms of both bandwidth and time cost. The results demonstrate that our schemes reduce bandwidth by approximately 2 ∼ 4× compared to LO13, and by 16 ∼ 64× compared to AFN17 and KM19. For a database of size 214 blocks, our schemes are over 64× faster than KM19, while achieving similar performance to LO13 and AFN17 in the WAN setting, with a latency of around 1 second. Copyright © 2025, The Authors. All rights reserved.

关键词： Virtual addresses

来源：评论

学校读者我要写书评

暂无评论

An Enhanced Resource Selection Scheme for Efficient Intra-Platoon Message Delivery

An Enhanced Resource Selection Scheme for Efficient Intra-Pl...

引用

2024 IEEE Global Communications Conference, GLOBECOM 2024

作者： Wang, Bingying Zheng, Jun Li, Cheng Nanjing University of Information Science and Technology School of Electronics and Information Engineering Nanjing210044 China Southeast University National Mobile Communications Research Laboratory Frontiers Science Center for Mobile Information Communication and Security Nanjing210096 China Purple Mountain Laboratories Nanjing211111 China Simon Fraser University School of Engineering Science BurnabyBCV5A 1S6 Canada Memorial University Department of Electrical and Computer Engineering St. John'sNLA1B 3X5 Canada

ISBN: (纸本)9798350351255

This paper proposes an enhanced resource selection (eInP-RS) scheme for efficient intra-platoon message delivery of cooperative awareness messages (CAMs) and decentralized environmental notification messages (DENMs). To achieve this goal, the eInP-RS scheme allows each vehicle to transmit CAM and DENM packets on a C-V2X channel (CH1) and an 802.11p channel (CH2), separately, and introduces four mechanisms to enhance the standardized sensing-based SPS scheme. A contention window (CW) size adjustment mechanism is introduced to enable a vehicle to adjust its CW size according to the information it collects on CH1 in order to avoid potential packet collisions on CH2;a resource partition mechanism is introduced to divide frequency-time resources in a selection window into two sets in order for vehicles moving in opposite directions to select different resources and thus avoid potential merging collisions on CH1;an intra-platoon cooperation mechanism is introduced to enable the PL of a platoon to know the resource and channel occupation information of the platoon's hidden nodes on CH1 and CH2;and a packet collision detection mechanism is used to enable a non-platoon vehicle to detect packet collisions occurring on both channels after a lane-changing maneuver to avoid potential merging collisions. Simulation results show that the proposed eInP-RS scheme outperforms the standardized sensing-based SPS scheme in terms of the intra-platoon CAM/DENM delivery ratio and the average intra-platoon DENM delivery delay. © 2024 IEEE.

关键词： Magnetic levitation vehicles

来源：评论

学校读者我要写书评

暂无评论

DHD: Double Hard Decision Decoding Scheme for NAND Flash Memory

DHD: Double Hard Decision Decoding Scheme for NAND Flash Mem...

引用

2025 Design, Automation and Test in Europe Conference, DATE 2025

作者： Cui, Lanlan Wang, Yichuan Xiao, Renzhi Li, Miao Liu, Xiaoxue Hei, Xinhong School of Computer Science and Engineering XI'AN University of Technology Xi'an China Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an China School of Software Engineering Jiangxi University of Science and Technology Nanchang China School of Information Engineering Zhongnan University of Economics and Law Wuhan China

ISBN: (纸本)9783982674100

With the advancement of NAND flash technology, the increased storage density leads to intensified interference, which in turn raises the error rate during data retrieval. To ensure data reliability, low-density parity-check (LDPC) codes are extensively employed for error correction in NAND flash memory. Although LDPC soft decision decoding offers high error correction capability, it comes with a significant latency. Conversely, hard-decision decoding, although faster, lacks sufficient error correction strength. Consequently, flash memory typically initiates with hard-decision decoding and resorts to multiple soft decision decoding upon failure. To minimize decoding latency, this paper proposes a decoding mechanism based on the double hard decision, called DHD. This DHD scheme improves the Log-Likelihood Ratio (LLR) in the hard decision process. After the first hard decision fails, the read reference voltage (RRV) is adjusted to perform the second hard decision decoding. If the second hard decision also fails, soft decision decoding is then employed. Experimental results demonstrate that when the Raw Bit Error Rate (RBER) is 8.5 × 10-3, DHD reduces the Frame Error Rate (FER) by 86.4% compared to the traditional method. © 2025 EDAA.

关键词： Error correction

来源：评论

学校读者我要写书评

暂无评论

A Power-system Economic Dispatching Based on Enhanced Group Search Optimizer 1

引用

18th International Conference on Intelligent information Hiding and Multimedia Signal Processing, IIH-MSP 2022

作者： Pan, Jeng-Shyang Nguyen, Trong-The Nguyen, Trinh-Dong Nguyen, Vinh-Tiep Dao, Thi-Kien College of Computer Science and Engineering Shandong University of Science and Technology Qing-Dao266590 China Department of Information Management Chaoyang University of Technology Taichung41349 Taiwan University of Information Technology Ho Chi Minh City700000 Viet Nam Vietnam National University Ho Chi Minh City700000 Viet Nam Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou350118 China

ISBN: (数字)9789819901050

ISBN: (纸本)9789819901043

Economic dispatch (ED) is one of the critical tasks in a power system’s optimization issues, but its characteristics with non-convex, high-dimensional, non-linear, and non-differentiable, so that caused solutions are more challenging in reality. This paper suggests an enhanced group search optimizer (EGSO) for solving the ED model with the valve-point effect and the different fuels. The EGSO adopts the original group search optimizer (GSO) by changing polar to Cartesian coordinate’s conversion and adding cyclic translation operators to the search behavior of the finder and walker to avoid falling into local optimal and slow convergence of the GSO. In the experiment section, the testing power systems of the ED model are used to validate the EGSO performance. The experimental results reveal that EGSO outperformed the other algorithms regarding convergence speed, the time required to complete calculations, and impacts with lower fuel cost. Additionally, with excellent outcomes in optimization issues involving multiple local optimal values show the EGSO is practical, quick, and efficient in addressing the challenging ED model. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

ATEDU-NET: An Attention-Embedded Deep Unet for multi-disease diagnosis in chest X-ray images, breast ultrasound, and retina fundus

引用

computers in Biology and Medicine 2025年 186卷 109708-109708页

作者： Ejiyi, Chukwuebuka Joseph Qin, Zhen Agbesi, Victor K. Ejiyi, Makuachukwu Bennedith Chikwendu, Ijeoma A. Bamisile, Oluwatoyosi F. Onyekwere, Favour Ezinne Bamisile, Olusola O. College of Nuclear Technology and Automation Engineering Chengdu University of Technology Sichuan 610059 China Network and Data Security Key Laboratory of Sichuan Province University of Electronic Science and Technology of China Sichuan Chengdu China School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China Pharmacy Department University of Nigeria Nsukka Enugu State Nsukka Nigeria School of Information and Communication Engineering University of Electronic Science and Technology of China Chengdu China

In image segmentation for medical image analysis, effective upsampling is crucial for recovering spatial information lost during downsampling. This challenge becomes more pronounced when dealing with diverse medical image modalities, which can significantly impact model performance. Plain and standard skip connections, widely used in most models, often fall short of maintaining high segmentation accuracy across different modalities, because essential spatial information transferred from the encoder to the decoder is lost. Inspired by these limitations, the Attention-Embedded Deep UNet (ATEDU-Net) is presented here, an innovative framework designed and tested on diverse medical image modalities, including X-ray, breast ultrasound, and retinal fundus images. ATEDU-Net features a unique architecture that combines progressive context refinement modules (PCRM) and global context modules (GCM) within a U-shaped network structure with Convgroup blocks which facilitate the integration of convolutional operations. This allows ATEDU-Net to autonomously capture rich spatial details and crucial contextual information from input images. The GCM captures essential contextual information for informed decision-making, while the PCRM enhances feature attention, resulting in precise and robust segmentation. The experimentation and analysis demonstrate that ATEDU-Net promises to be a powerful tool for medical professionals, aiding in the early detection of chest-related diseases, accurate localization of breast tumors, and early identification of eye diseases. This, in turn, contributes significantly to the formulation of optimal therapeutic strategies, enhancing patient care and outcomes. The versatility of ATEDU-Net is further highlighted by its ability to analyze medical images across various modalities, making it well-suited for the complex task of medical image analysis in diverse clinical scenarios. © 2025 Elsevier Ltd

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

A 3D Memristive Cubic Map with Dual Discrete Memristors: Design, Implementation, and Application in Image Encryption

引用

IEEE Transactions on Circuits and systems for Video technology 2025年

作者： Gao, Suo Iu, Herbert Ho-Ching Erkan, Ugur Simsek, Cemaleddin Toktas, Abdurrahim Cao, Yinghong Wu, Rui Mou, Jun Li, Qi Wang, Chunpeng Dalian Polytechnic University School of Information Science and Engineering Dalian116034 China The University of Western Australia School of Electrical Electronic and Computer Engineering Perth6009 Australia Faculty of Engineering Electrical and Electronics Engineering Respectively Karamanoglu Mehmetbey University Karaman70200 Turkey Ankara University Engineering Faculty Department of Artificial Intelligence and Data Engineering Ankara06830 Turkey Harbin Institute of Technology School of Computer Science and Technology Harbin150001 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan250000 China

Discrete chaotic systems based on memristors exhibit excellent dynamical properties and are more straightforward to implement in hardware, making them highly suitable for generating cryptographic keystreams. However, most existing memristor-based chaotic systems rely on a single memristor. This paper introduces a novel discrete chaotic system employing dual memristors, named the 3D memristive cubic map with dual discrete memristors (3D-MCM). The 3D-MCM system demonstrates richer and more intricate dynamical behaviors compared to its single-memristor counterparts, as verified through bifurcation diagrams, Lyapunov exponent spectra, and complexity analyses. Notably, the system exhibits coexisting attractors, substantially enhancing its dynamical complexity. Hardware implementation of the 3D-MCM attractors confirms its feasibility for industrial applications. To illustrate the system's potential in encryption tasks, this study integrates the quaternary-based permutation and dynamic emanating diffusion (QPDED-IE) scheme for image encryption with the *** results demonstrate that the QPDED-IE scheme based on the 3D-MCM exhibits strong diffusion and confusion properties, effectively resisting cryptanalytic attacks. © 1991-2012 IEEE.

关键词： Bifurcation (mathematics)

来源：评论

学校读者我要写书评

暂无评论

What limits limits?

引用

National science Review 2021年第1期8卷 11-14页

作者： Yong-Chun Liu Kun Huang Yun-Feng Xiao Lan Yang Cheng-Wei Qiu State Key Laboratory of Low-Dimensional Quantum Physics Department of Physics Frontier Science Center for Quantum Information Tsinghua University Department of Optics and Optical Engineering University of Science and Technology of China State Key Laboratory for Mesoscopic Physics and Frontiers Science Center for Nano-optoelectronics School of Physics Peking University Department of Electrical and Systems Engineering Washington University Department of Electrical and Computer Engineering National University of Singapore

There are fundamental rules and principles setting the limits of physical systems. It triggers an interesting thought—can we break the limits under specific circumstances? A realistic system can only provide limited functionalities because its performance is physically constrained by some fundamental principles.‘Breaking the limit’, which usually implies that the capability of a system could be enhanced significantly,

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：