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

13th International Conference on Advanced computer Information Technologies, ACIT 2023

作者： Shinde, Tejas Gambo, Yaknan John Rasch, Kevin Liebelt, Helena Li, Rui Deggendorf Institute of Technology High Performance Computing and Quantum Computing Deggendorf Germany Quantum Computing Research Intel Inc HillsboroOR United States Deggendorf Institute of Technology Department of Applied Computer Science Deggendorf Germany

Quantum technologies are moving towards enabling real world uses and as these technologies develop. The most important thing that differs Quantum from classical computers is that Quantum computers can do 'multiple' tasks at the same time as opposed to the classical computers doing a single task at a time. This phenomenon has led to the discovery of a few algorithms that are faster than regular computers. One such algorithm is the Grover's Algorithm[l]. This algorithm has shown a few real-world applications such as Quantum Search Algorithm, Travelling salesman, etc[2]. In this paper, Grover's algorithm is introduced, and a 2 x 2 Sudoku example is solved using Intel Quantum Software Development Kit[3]. The Intel Quantum SDK is quite new and in this paper we show how a simple Grover's Problem can be implemented in the SDK. Sudoku is a popular number-based puzzle game played on a grid consisting of nine squares subdivided into smaller 3x3 grids. The objective is to fill the grid with numbers from 1 to 9, ensuring that each row, column, and 3x3 grid contains all numbers exactly once. © 2023 IEEE.

关键词： Qubits

来源：评论

学校读者我要写书评

暂无评论

Recent Advances in In-Memory computing:Exploring Memristor and Memtransistor Arrays with 2D Materials

引用

Nano-Micro Letters 2024年第7期16卷 1-30页

作者： Hangbo Zhou Sifan Li Kah-Wee Ang Yong-Wei Zhang Institute of High Performance Computing(IHPC) Agency for ScienceTechnology and Research(A*STAR)1 Fusionopolis Way#16-16 ConnexisSingapore 138632Republic of Singapore Department of Electrical and Computer Engineering National University of Singapore4 Engineering Drive 3Singapore 117583Republic of Singapore Institute of Materials Research and Engineering Agency for ScienceTechnology and Research(A*STAR)2 Fusionopolis WaySingapore 138634Republic of Singapore

The conventional computing architecture faces substantial chal-lenges,including high latency and energy consumption between memory and processing *** response,in-memory computing has emerged as a promising alternative architecture,enabling computing operations within memory arrays to overcome these *** devices have gained significant attention as key components for in-memory computing due to their high-density arrays,rapid response times,and ability to emulate biological *** these devices,two-dimensional(2D)material-based memristor and memtransistor arrays have emerged as particularly promising candidates for next-generation in-memory computing,thanks to their exceptional performance driven by the unique properties of 2D materials,such as layered structures,mechanical flexibility,and the capability to form *** review delves into the state-of-the-art research on 2D material-based memristive arrays,encompassing critical aspects such as material selection,device perfor-mance metrics,array structures,and potential ***,it provides a comprehensive overview of the current challenges and limitations associated with these arrays,along with potential *** primary objective of this review is to serve as a significant milestone in realizing next-generation in-memory computing utilizing 2D materials and bridge the gap from single-device characterization to array-level and system-level implementations of neuromorphic computing,leveraging the potential of 2D material-based memristive devices.

关键词： 2D materials Memristors Memtransistors Crossbar array In-memory computing

来源：评论

学校读者我要写书评

暂无评论

PEPC: Parallel and Extensible PC Implementation for Causal Structure Learning 23

PEPC: Parallel and Extensible PC Implementation for Causal S...

引用

7th International Conference on high performance Compilation, computing and Communications, HP3C 2023

作者： Feng, Yongquan Xu, Liyang Huang, Wanrong Yang, Wenjing Lu, Yutong Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha China School of Computer Science and Engineering Sun Yat-sen University Guangzhou China

ISBN: (纸本)9781450399883

Learning the causal relationships among variables from observational data has been a significant problem in statistics and data mining, and one such algorithm is the PC algorithm. However, the existing CPU-based implementations are difficult to support Causal Structure Learning(CSL) on complex observational data due to inefficiency. In this paper, we propose an efficient CPU-based parallel implementation of the PC algorithm, called PEPC. It has an extensible framework, and some optimizations are adopted to reduce the CSL computation of the PC algorithm. Moreover, our PEPC supports efficient multi-thread parallelism. The experimental results demonstrate that PEPC outperforms existing methods in serial efficiency and multi-thread parallelism. In serial tests, our method achieves the maximum speedup ratios of 577.26, 116.74, and 134.68 over three existing approaches, Stable, ***, and Tetrad. In parallel experiments, it achieves 10.66X speedup when running the PC algorithm with 12 threads. © 2023 ACM.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Bioinspired activation of silent synapses in layered materials for extensible neuromorphic computing

引用

Journal of Materiomics 2023年第4期9卷 787-797页

作者： Yan Kang Yabo Chen Yinlong Tan Hao Hao Cheng Li Xiangnan Xie Weihong Hua Tian Jiang College of Advanced Interdisciplinary Studies National University of Defense TechnologyChangsha410073China Institute for Quantum Information&State Key Laboratory of High Performance Computing College of ComputerNational University of Defense TechnologyChangsha410073China Institute for Quantum Science and Technology College of ScienceNational University of Defense TechnologyChangsha410073China

Activation of silent synapses is of great significance for the extension of neural plasticity related to learning and *** by the activation of silent synapses via receptor insertion in neural synapses,we propose an efficient method for activating artificial synapses through the intercalation of Sn in layered a-MoO_(3).Sn intercalation is capable of switching on the response of layered a-MoO_(3)to the stimuli of visible and near infrared light by decreasing the *** mimics the receptor insertion process in silent neural *** Sn-intercalated MoO_(3)(Sn-MoO_(3))exhibits persistent photoconductivity due to the donor impurity induced by Sn *** enables the two-terminal Sn-MoO_(3)device promising optoelectronic synapse with an ultrahigh paired pulse facilitation(PPF)up to 199.5%.On-demand activation and tunable synaptic plasticity endow the device great potentials for extensible neuromorphic *** performance of the extensible artificial neural network(ANN)based on the Sn-MoO_(3)synapses are demonstrated in pattern ***,the recognition accuracy increases from 89.7%to 94.8%by activating more nodes into the *** is consistent with the recognition process of physical neural network during brain *** intercalation engineering of MoO_(3)may provide inspirations for the design of high-performance neuromorphic computing architectures.

关键词： Activation of silent synapse Intercalation Layered materials Neuromorphic computing

来源：评论

学校读者我要写书评

暂无评论

Accumulative Time Based Ranking Method to Reputation Evaluation in Information Networks

引用

Journal of computer science & Technology 2022年第4期37卷 960-974页

作者： Hao Liao Qi-Xin Liu Ze-Cheng Huang Ke-Zhong Lu Chi Ho Yeung Yi-Cheng Zhang National Engineering Laboratory on Big Data System Computing Technology College of Computer Science and SoftwareEngineeringShenzhen UniversityShenzhen 518060China Guangdong Province Key Laboratory of Popular High Performance Computers Shenzhen UniversityShenzhen 518060China Guangdong Province Engineering Center of China-Made High Performance Data Computing System College of ComputerScience and Software EngineeringShenzhen UniversityShenzhen 518060China Institute of Big Data Intelligent Management and Decision Shenzhen UniversityShenzhen 518060China Department of Science and Environmental Studies The Education University of Hong KongHong Kong 999077China Department of Physics University of FribourgFribourg 1700Switzerland

Due to over-abundant information on the Web, information filtering becomes a key task for online users to obtain relevant suggestions and how to extract the most related item is always a key topic for researchers in various fields. In this paper, we adopt tools used to analyze complex networks to evaluate user reputation and item quality. In our proposed Accumulative Time Based Ranking (ATR) algorithm, we take into account the growth record of the network to identify the evolution of the reputation of users and the quality of items, by incorporating two behavior weighting factors which can capture the hidden facts on reputation and quality dynamics for each user and item respectively. Our proposed ATR algorithm mainly combines the iterative approach to rank user reputation and item quality with temporal dependence compared with other reputation evaluation methods. We show that our algorithm outperforms other benchmark ranking algorithms in terms of precision and robustness on empirical datasets from various online retailers and the citation datasets among research publications. Therefore, our proposed method has the capability to effectively evaluate user reputation and item quality.

关键词： temporal network behavior dynamics reputation evaluation ranking algorithm

来源：评论

学校读者我要写书评

暂无评论

How to Steal CPU Idle Time When Synchronous I/O Mode Becomes Promising 24

How to Steal CPU Idle Time When Synchronous I/O Mode Becomes...

引用

61st ACM/IEEE Design Automation Conference, DAC 2024

作者： Wu, Chun-Feng Chang, Yuan-Hao Yang, Ming-Chang Kuo, Tei-Wei Department of Computer Science National Yang Ming Chiao Tung University Taiwan Institue of Information Science Academia Sinica Taiwan Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong Department of Computer Science and Information Engineering National Taiwan University Taiwan High Performance and Scientific Computing Center National Taiwan University Taiwan Delta Electronics Taiwan

ISBN: (纸本)9798400706011

The advent of Ultra-Low-Latency storage devices has narrowed the performance gap between storage and CPU in computing platforms, facilitating synchronous I/O adoption. Yet, this approach introduces substantial busy waiting time and underutilizes computing units. To address this, we propose a light-weighted Idle-Time-Stealing (ITS) design. This involves a self-improving thread conducting prefetching for high-priority processes during synchronous I/O, and an I/O-waiting process continuing subsequent instruction executions when justifiable. Another thread, the self-sacrificing thread, proactively switches low-priority process I/O requests from synchronous to asynchronous mode, prioritizing high-priority executions. Experimental results demonstrate the effectiveness of our ITS design in reducing CPU idle time. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.

关键词： Data storage equipment

来源：评论

学校读者我要写书评

暂无评论

Experimental review on Majorana zero-modes in hybrid nanowires

引用

science China(Physics,Mechanics & Astronomy) 2021年第10期64卷 38-53页

作者： Ji-Bang Fu Bin Li Xin-Fang Zhang Guang-Zheng Yu Guang-Yao Huang Ming-Tang Deng Institute for Quantum Information&State Key Laboratory of High Performance Computing College of Computer Science and TechnologyNational University of Defense TechnologyChangsha 410073China

As the condensed matter analog of Majorana fermion, the Majorana zero-mode is well known as a building block of fault-tolerant topological quantum computing. This review focuses on the recent progress of Majorana experiments, especially experiments about semiconductor-superconductor hybrid devices. We first sketch Majorana zero-mode formation from a bottom-up view,which is more suitable for beginners and experimentalists. Then, we survey the status of zero-energy state signatures reported recently, from zero-energy conductance peaks, the oscillations, the quantization, and the interactions with extra degrees of freedom. We also give prospects of future experiments for advancing one-dimensional semiconductor nanowire-superconductor hybrid materials and devices.

关键词： electronic transport in nanoscale materials and structures quantum wires proximity efect superconducting low-dimensional structures

来源：评论

学校读者我要写书评

暂无评论

Automatic APT Attack Reconstruction Supporting Lateral Movement 2nd

Automatic APT Attack Reconstruction Supporting Lateral Movem...

引用

2nd International Conference on Security and Information Technologies with AI, Internet computing and Big-data Applications, SITAIBA 2023

作者： Fan, Chun-I Wu, Wei-Chen Shie, Cheng-Han Kuo, Hsin-Nan Lee, Bo-Yi Department of Computer Science and Engineering National Sun Yat-sen University Kaohsiung Taiwan National Center for High-Performance Computing Hsinchu Taiwan Information Security Research Center National Sun Yat-sen University Kaohsiung Taiwan

ISBN: (纸本)9789819777853

This work proposes a framework for generating datasets that allows users to adjust the APT attack techniques within it. The framework utilizes the MITRE ATT&CK framework to label the attack traffic based on the Tactics, Techniques, and Procedures (TTP), which facilitating researchers in using the datasets for model training. Meanwhile, this work uses the framework to reconstruct the APT29 attack process and collect a dataset to validate the framework’s feasibility. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Advanced Persistent Threat (APT) Dataset generation The APT29 attack Threat intelligence

来源：评论

学校读者我要写书评

暂无评论

CoChain: high Concurrency Blockchain Sharding via Consensus on Consensus 42

CoChain: High Concurrency Blockchain Sharding via Consensus ...

引用

42nd IEEE International Conference on computer Communications, INFOCOM 2023

作者： Li, Mingzhe Lin, You Zhang, Jin Wang, Wei Southern University of Science and Technology Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation Research Institute of Trustworthy Autonomous Systems Computer Science and Engineering Department China Hong Kong University of Science and Technology Computer Science and Engineering Department Hong Kong Institute of High Performance Computing and Agency for Science Technology and Research Singapore

ISBN: (纸本)9798350334142

Sharding is an effective technique to improve the scalability of blockchain. It splits nodes into multiple groups so that they can process transactions in parallel. To achieve higher parallelism and concurrency at large scales, it is desirable to maintain a large number of small shards. However, simply configuring small shards easily results in a higher fraction of malicious nodes inside shards, causing shard corruption and compromising system security. Existing sharding techniques hence demand large shards, at the expense of limited concurrency. To address this limitation, we propose CoChain: a blockchain sharding system that can securely configure small shards for enhanced concurrency. CoChain allows some shards to be corrupted. For security, each shard is monitored by multiple other shards. The latter reach a cross-shard Consensus on the Consensus results of their monitored shard. Once a corrupted shard is found, its subsequent consensus will be taken over by another shard, hence recovering the system. Via Consensus on Consensus, CoChain allows the existence of shards with more fraction of malicious nodes ( © 2023 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

ADAPTIVE STOCHASTIC GRADIENT ALGORITHM FOR BLACK-BOX MULTI-OBJECTIVE LEARNING 12

ADAPTIVE STOCHASTIC GRADIENT ALGORITHM FOR BLACK-BOX MULTI-O...

引用

12th International Conference on Learning Representations, ICLR 2024

作者： Ye, Feiyang Lyu, Yueming Wang, Xuehao Zhang, Yu Tsang, Ivor W. Department of Computer Science and Engineering Southern University of Science and Technology China Australian Artificial Intelligence Institute University of Technology Sydney Australia Centre for Frontier AI Research Agency for Science Technology and Research Singapore Institute of High Performance Computing Agency for Science Technology and Research Singapore Shanghai Artificial Intelligence Laboratory China School of Computer Science and Engineering Nanyang Technological University Singapore

Multi-objective optimization (MOO) has become an influential framework for various machine learning problems, including reinforcement learning and multitask learning. In this paper, we study the black-box multi-objective optimization problem, where we aim to optimize multiple potentially conflicting objectives with function queries only. To address this challenging problem and find a Pareto optimal solution or the Pareto stationary solution, we propose a novel adaptive stochastic gradient algorithm for black-box MOO, called ASMG. Specifically, we use the stochastic gradient approximation method to obtain the gradient for the distribution parameters of the Gaussian smoothed MOO with function queries only. Subsequently, an adaptive weight is employed to aggregate all stochastic gradients to optimize all objective functions effectively. Theoretically, we explicitly provide the connection between the original MOO problem and the corresponding Gaussian smoothed MOO problem and prove the convergence rate for the proposed ASMG algorithm in both convex and non-convex scenarios. Empirically, the proposed ASMG method achieves competitive performance on multiple numerical benchmark problems. Additionally, the state-of-the-art performance on the black-box multi-task learning problem demonstrates the effectiveness of the proposed ASMG method. © 2024 12th International Conference on Learning Representations, ICLR 2024. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：