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

Proceedings of the 55th Annual IEEE/ACM International Symposium on Microarchitecture

作者： Jawad Haj Yahya Haris Volos Davide B. Bartolini Georgia Antoniou Jeremie S. Kim Zhe Wang Kleovoulos Kalaitzidis Tom Rollet Zhirui Chen Ye Geng Onur Mutlu Yiannakis Sazeides Rivos Inc Mountain View California United States Computer Architecture Laboratory Department of Computer Science University of Cyprus Computing Systems Lab Huawei Zurich Research Center Department of Information Technology and Electrical Engineering ETH Zurich Switzerland

ISBN: (纸本)9781665462723

User-facing applications running in modern datacenters exhibit irregular request patterns and are implemented using a multitude of services with tight latency requirements (30--250μs). These characteristics render existing energy-conserving techniques ineffective when processors are idle due to the long transition time (order of 100μs) from a deep CPU core idle power state (C-state). While prior works propose management techniques to mitigate this inefficiency, we tackle it at its root with AgileWatts (AW): a new deep CPU core C-state architecture optimized for datacenter server processors targeting latency-sensitive *** drastically reduces the transition latency from deep CPU core idle power states while retaining most of their power savings based on three key ideas. First, AW eliminates the latency (several microseconds) of saving/restoring the core context when powering-off/-on the core in a deep idle state by i) implementing medium-grained power-gates, carefully distributed across the CPU core, and ii) retaining context in the power-ungated domain. Second, AW eliminates the flush latency (several tens of microseconds) of the L1/L2 caches when entering a deep idle state by keeping L1/L2 content power-ungated. A small control logic also remains ungated to serve cache coherence traffic. AW implements cache sleep-mode and leakage reduction for the power-ungated domain by lowering a core's voltage to the minimum operational level. Third, using a state-of-the-art power efficient all-digital phase-locked loop (ADPLL) clock generator, AW keeps the PLL active and locked during the idle state, cutting microseconds of wake-up latency at negligible power *** evaluation with an accurate industrial-grade simulator calibrated against an Intel Skylake server shows that AW reduces the energy consumption of Memcached by up to 71% (35% on average) with <1% end-to-end performance degradation. We observe similar trends for other evaluated services (MySQL and Kafka).

关键词：

来源：评论

学校读者我要写书评

暂无评论

What will regularized continuous learning performs if it was used to medical image segmentation: a preliminary analysis

What will regularized continuous learning performs if it was...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Weihao Dai Chaolu Feng Shuaizheng Chen Wei Li Jinzhu Yang Dazhe Zhao College of Computer Science and Engineering Northeastern University Shenyang China Key Laboratory of Intelligent Computing in Medical Image (MIIC) Ministry of Education Shenyang China National Frontiers Science Center for Industrial Intelligence and Systems Optimization Shenyang China

Regularization-based continuous learning (RCL) has been proven to be highly effective on struggling against catastrophic forgetting. However, its application in medical image segmentation (MIS) is relatively scarce. In this paper, we provide a unified description of 6 RCL methods (LwF, LwM, EWC, SI, MAS, and PIGWM) using Taylor expansion and investigate their performances in 2 classic MIS scenarios, namely retinal vessel segmentation (RVS) and cardiac left ventricle segmentation (CLVS) on 8 datasets (CHASE, DRHAGIS, RITE and STARE for the former and M&Ms, LVSC, ACDC and SCD for the latter). We also explore the influence of different task orders (easy to hard or hard to easy), optimizers (Adam or SGD), and parameter capacities (2, 3, 4 or 5 down- and up-sampling pairs) on the performance of these methods. Our experimental results show that these methods are capable of mitigating catastrophic forgetting to a certain extent. Comparing to a hard-to-easy order, most of the methods perform better on all of the already known tasks in an easy-to-hard order. Optimizer Adam performs better on RVS and CLVS. Capacity increases are obviously effective for CLVS, but they have no significant impact on RVS.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient Quantum Simulation Algorithms in the Path Integral Formulation

arXiv

引用

arXiv 2024年

作者： Shum, Serene Wiebe, Nathan University of Toronto Department of Physics Toronto Canada University of Toronto Department of Computer Science Toronto Canada Pacific Northwest National Laboratory High Performance Computing Division Richland United States Canadian Institute for Advanced Study Toronto Canada

We provide a new paradigm for quantum simulation that is based on path integration that allows quantum speedups to be observed for problems that are more naturally expressed using the path integral formalism rather than the conventional sparse Hamiltonian formalism. We provide a quantum algorithm for Lagrangians of the form ∑γ mγ/2 x 2γ − V (x), as well as two novel quantum algorithms based on Hamiltonian versions of the path integral formulation. The Lagrangian path integral algorithm is based on a new rigorous derivation of a discrete version of the Lagrangian path integral. We show that for the time evolution of a system with η particles in D + 1 dimensions for time T, our Lagrangian simulation algorithm requires a number of queries to an oracle that computes the discrete Lagrangian that scales in the continuum limit as Oe(ηDT2/ϵ), if V (x) is bounded and finite and the wave function obeys appropriate position and momentum cutoffs. This shows that Lagrangian dynamics can be efficiently simulated on quantum computers and opens up the possibility for quantum field theories for which the Hamiltonian is unknown to be efficiently simulated on quantum computers. Our first Hamiltonian path integral method breaks up the paths into short time steps. It is efficient under appropriate sparsity assumptions and requires a number of queries to oracles that give the eigenvalues and overlaps between the eigenvectors of the Hamiltonian terms that scales as to(1)/ϵo(1) for simulation time t and error ϵ. The second approach uses long-time path integrals for near-adiabatic systems and has query complexity that scales as O(1/√ϵ) if the energy eigenvalue gaps and simulation time is sufficiently long. © 2024, CC BY.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

Secure and Efficient Data Storage and Sharing Scheme Based on Double Blockchain

引用

computers, Materials & Continua 2021年第1期66卷 499-515页

作者： Lejun Zhang Minghui Peng Weizheng Wang Yansen Su Shuna Cui Seokhoon Kim College of Information Engineering Yangzhou UniversityYangzhou225127China School Math&Computer Science Quanzhou Normal UniversityQuanzhou362000China Division of Computer Science University of AizuAizu–Wakamatsu9658580Japan Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and TechnologyAnhui UniversityHefei230601China Medical College of Yangzhou University Yangzhou225001China Department of Gynecology and Obstetrics Affiliated Hospital of Yangzhou UniversityYangzhouChina Department of Computer Software Engineering Soonchunhyang UniversityAsanKorea

In the digital era,electronic medical record(EMR)has been a major way for hospitals to store patients’medical *** traditional centralized medical system and semi-trusted cloud storage are difficult to achieve dynamic balance between privacy protection and data *** storage capacity of blockchain is limited and single blockchain schemes have poor scalability and low *** address these issues,we propose a secure and efficient medical data storage and sharing scheme based on double *** our scheme,we encrypt the original EMR and store it in the *** storage blockchain stores the index of the complete EMR,and the shared blockchain stores the index of the shared part of the *** with different attributes can make requests to different blockchains to share different parts according to their own *** experiments,it was found that cloud storage combined with blockchain not only solved the problem of limited storage capacity of blockchain,but also greatly reduced the risk of leakage of the original *** Extraction Signature(CES)combined with the double blockchain technology realized the separation of the privacy part and the shared part of the original *** symmetric encryption technology combined with Ciphertext-Policy Attribute-Based Encryption(CP–ABE)not only ensures the safe storage of data in the cloud,but also achieves the consistency and convenience of data update,avoiding redundant backup of *** analysis and performance analysis verified the feasibility and effectiveness of our scheme.

关键词： Cloud storage blockchain electronic medical records access control data sharing privacy

来源：评论

学校读者我要写书评

暂无评论

Family of Mutually Uncorrelated Codes for DNA Storage Address Design

IEEE Transactions on Nanobioscience

引用

IEEE Transactions on Nanobioscience 2025年第3期PP卷 PP页

作者： Liu, Zhenlu Cao, Ben Shao, Qi Zheng, Yanfen Wang, Bin Zhou, Shihua Zheng, Pan Dalian University Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education School of Software Engineering Dalian116622 China Dalian University of Technology School of Computer Science and Technology Dalian116024 China University of Canterbury Upper Riccarton Department of Accounting and Information Systems Christchurch8140 New Zealand

Deoxyribonucleic acid (DNA) has become an ideal medium for long-term storage and retrieval due to its extremely high storage density and long-term stability. But access efficiency is an existing bottleneck in DNA storage, especially the lack of high-quality random access address sequences. Therefore, in this paper, we report a series of approaches based on k-weakly mutually uncorrelated (k-WMU) codes to design the address sequence to improve the access efficiency of DNA storage. To address the problem of DNA sequences that are poorly scalable at the base level, we propose a 0-m-ruling coding scheme combined with k-WMU codes that can make address sequences avoid generating secondary structure with stem lengths ranging from 3 to 9. Based on the decoupled structure, We further extend the k-WMU codes with error correction function while satisfying combinatorial biological constraints. In order to investigate the performance of the designed address sequences for real-world applications, we perform simulation experiments based on thermodynamic properties and error correction capability as well as compared the minimum free energy (MFE), melting temperature (TM), and average decoding success rate (ADSR) with previous work. The results show that designed address sequences have a high MFE value and ADSR and a substantial reduction in TM-variance while satisfying the combinatorial biological constraints. As the quality of address sequences improves, this will help to achieve accurate random access as well as enhance the robustness of the DNA storage system. © 2002-2011 IEEE.

关键词： DNA sequences

来源：评论

学校读者我要写书评

暂无评论

Generalization Boosted Adapter for Open-Vocabulary Segmentation

arXiv

引用

arXiv 2024年

作者： Xu, Wenhao Wang, Changwei Feng, Xuxiang Xu, Rongtao Huang, Longzhao Zhang, Zherui Guo, Li Xu, Shibiao School of Artificial Intelligence Beijing University of Posts and Telecommunications Beijing100876 China The 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 Jinan250013 China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan China The Aerospace Information Research Institute Chinese Academy of Sciences China The State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences Beijing China

Vision-language models (VLMs) have demonstrated remarkable open-vocabulary object recognition capabilities, motivating their adaptation for dense prediction tasks like segmentation. However, directly applying VLMs to such tasks remains challenging due to their lack of pixel-level granularity and the limited data available for fine-tuning, leading to overfitting and poor generalization. To address these limitations, we propose Generalization Boosted Adapter (GBA), a novel adapter strategy that enhances the generalization and robustness of VLMs for open-vocabulary segmentation. GBA comprises two core components: (1) a Style Diversification Adapter (SDA) that decouples features into amplitude and phase components, operating solely on the amplitude to enrich the feature space representation while preserving semantic consistency;and (2) a Correlation Constraint Adapter (CCA) that employs cross-attention to establish tighter semantic associations between text categories and target regions, suppressing irrelevant low-frequency "noise" information and avoiding erroneous associations. Through the synergistic effect of the shallow SDA and the deep CCA, GBA effectively alleviates overfitting issues and enhances the semantic relevance of feature representations. As a simple, efficient, and plug-and-play component, GBA can be flexibly integrated into various CLIP-based methods, demonstrating broad applicability and achieving state-of-the-art performance on multiple open-vocabulary segmentation benchmarks. © 2024, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

RNTrajRec: Road Network Enhanced Trajectory Recovery with Spatial-Temporal Transformer

arXiv

引用

arXiv 2022年

作者： Chen, Yuqi Zhang, Hanyuan Sun, Weiwei Zheng, Baihua School of Computer Science Shanghai Key Laboratory of Data Science Fudan University China Shanghai Institute of Intelligent Electronics & Systems China School of Computing and Information Systems Singapore Management University Singapore

GPS trajectories are the essential foundations for many trajectory-based applications, such as travel time estimation, traffic prediction and trajectory similarity measurement. Most applications require a large number of high sample rate trajectories to achieve a good performance. However, many real-life trajectories are collected with low sample rate due to energy concern or other constraints. We study the task of trajectory recovery in this paper as a means to increase the sample rate of low sample trajectories. Currently, most existing works on trajectory recovery follow a sequence-to-sequence diagram, with an encoder to encode a trajectory and a decoder to recover real GPS points in the trajectory. However, these works ignore the topology of road network and only use grid information or raw GPS points as input. Therefore, the encoder model is not able to capture rich spatial information of the GPS points along the trajectory, making the prediction less accurate and lower spatial consistent. In this paper, we propose a road network enhanced transformer-based framework, namely RNTrajRec, for trajectory recovery. RNTrajRec first uses a graph model, namely GridGNN, to learn the embedding features of each road segment. It next develops a spatial-temporal transformer model, namely GPSFormer, to learn rich spatial and temporal features along with a Sub-Graph Generation module to capture the spatial features for each GPS point in the trajectory. It finally forwards the outputs of encoder model to a multi-task decoder model to recover the missing GPS points. Extensive experiments based on three large-scale real-life trajectory datasets confirm the effectiveness of our approach. Copyright © 2022, The Authors. All rights reserved.

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

Ciphertext-only fault analysis on the Midori lightweight cryptosystem

引用

science China(Information sciences) 2020年第3期63卷 288-292页

作者： Wei LI Linfeng LIAO Dawu GU Shan CAO Yixin WU Jiayao LI Zhihong ZHOU Zheng GUO Ya LIU Zhiqiang LIU School of Computer Science and Technology Donghua University Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Key Laboratory of Integrate Administration Technologies for Information Security School of Microelectronics Shanghai Jiao Tong University Department of Computer Science and Engineering University of Shanghai for Science and Technology

Dear editor,The Midori lightweight cipher can be applied in the RFID tags and other low-resource devices to protect information on the Internet. This cipher was proposed by Banik et al. and presented at the ASIACRYPT conference [1]. It has a Substitution Permutation Network structure with a 128-bit keysize, and two block-size variants, 64 bits

关键词： CFA Ciphertext-only fault analysis on the Midori lightweight cryptosystem

来源：评论

学校读者我要写书评

暂无评论

Improving Accuracy-robustness Trade-off via Pixel Reweighted Adversarial Training

arXiv

引用

arXiv 2024年

作者： Zhang, Jiacheng Liu, Feng Zhou, Dawei Zhang, Jingfeng Liu, Tongliang School of Computing and Information Systems The University of Melbourne Australia State Key Laboratory of Integrated Services Networks Xidian University China School of Computer Science The University of Auckland RIKEN AIP New Zealand Sydney AI Centre The University of Sydney Australia

Adversarial training (AT) trains models using adversarial examples (AEs), which are natural images modified with specific perturbations to mislead the model. These perturbations are constrained by a predefined perturbation budget ϵ and are equally applied to each pixel within an image. However, in this paper, we discover that not all pixels contribute equally to the accuracy on AEs (i.e., robustness) and accuracy on natural images (i.e., accuracy). Motivated by this finding, we propose Pixel-reweighted AdveRsarial Training (PART), a new framework that partially reduces ϵ for less influential pixels, guiding the model to focus more on key regions that affect its outputs. Specifically, we first use class activation mapping (CAM) methods to identify important pixel regions, then we keep the perturbation budget for these regions while lowering it for the remaining regions when generating AEs. In the end, we use these pixel-reweighted AEs to train a model. PART achieves a notable improvement in accuracy without compromising robustness on CIFAR-10, SVHN and TinyImagenet-200, justifying the necessity to allocate distinct weights to different pixel regions in robust classification. © 2024, CC BY.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Secure Resource Management in Cloud computing: Challenges, Strategies and Meta-Analysis

arXiv

引用

arXiv 2025年

作者： Saxena, Deepika Swain, Smruti Rekha Kumar, Jatinder Patni, Sakshi Gupta, Kishu Singh, Ashutosh Kumar Lindenstruth, Volker Division of Information Systems University of Aizu Aizuwakamatsu9650006 Japan Department of Computer Science The University of Economics and Human Sciences Warsaw01-043 Poland Department of Computer Applications National Institute of Technology Kurukshetra Kurukshetra136119 India Department of Computing Gachon University Seongnam461701 Korea Republic of Department of Computer Science and Engineering National Sun Yat-sen University Kaohsiung804 Taiwan Department of Computer Science and Engineering Indian Institute of Information Technology Bhopal Bhopal462003 India Department of Computer Science and Engineering Goethe University Frankfurt60438 Germany

Secure resource management (SRM) within a cloud computing environment is a critical yet infrequently studied research topic. This paper provides a comprehensive survey and comparative performance evaluation of potential cyber threat countermeasure strategies that address security challenges during cloud workload execution and resource management. Cybersecurity is explored specifically in the context of cloud resource management, with an emphasis on identifying the associated challenges. The cyber threat countermeasure methods are categorized into three classes: defensive strategies, mitigating strategies, and hybrid strategies. The existing countermeasure strategies belonging to each class are thoroughly discussed and compared. In addition to conceptual and theoretical analysis, the leading countermeasure strategies within these categories are implemented on a common platform and examined using two real-world virtual machine (VM) data traces. Based on this comprehensive study and performance evaluation, the paper discusses the trade-offs among these countermeasure strategies and their utility, providing imperative concluding remarks on the holistic study of cloud cyber threat countermeasures and secure resource management. Furthermore, the study suggests future methodologies that could effectively address the emerging challenges of secure cloud resource management. © 2025, CC BY-SA.

关键词： Cloud security

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：