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

19th European Conference on computer Systems, EuroSys 2024

作者： Qi, Hao Wu, Yiyang He, Ligang Zhang, Yu Luo, Kang Cai, Minzhi Jin, Hai Zhang, Zhan Zhao, Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China Department of Computer Science University of Warwick United Kingdom Zhejiang Lab China

ISBN: (纸本)9798400704376

Streaming graph has been broadly employed across various application domains. It involves updating edges to the graph and then performing analytics on the updated graph. However, existing solutions either suffer from poor data locality and high computation complexity for streaming graph analytics, or need high overhead to search and move graph data to ensure ordered neighbors during streaming graph update. This paper presents a novel locality-centric streaming graph engine, called LSGraph, to enable efficient both graph analytics and graph update. The main novelty of this engine is a differentiated hierarchical indexed streaming graph representation approach to achieve efficient data search and movement for graph update and also maintain data locality and ordered neighbors for efficient graph analytics simultaneously. Besides, a locality-aware streaming graph data update mechanism is also proposed to efficiently regulate the distance of data movement, minimizing the overhead of memory access during graph update. We have implemented LSGraph and conducted a systematic evaluation on both real-world and synthetic datasets. Compared with three cutting-edge streaming graph engines, i.e., Terrace, Aspen, and PaC-tree, LSGraph achieves 2.98×-81.08×, 1.46×-12.56×, and 1.26×-10.31× speedups during graph update, while obtaining 1.02×-4.28×, 1.58×-3.55×, and 1.20×-2.72× speedups during graph analytics, respectively. © 2024 Owner/Author.

关键词： Engines

来源：评论

学校读者我要写书评

暂无评论

Hamiltonian learning using machine-learning models trained with continuous measurements

引用

Physical Review Applied 2024年第4期22卷 044080页

作者： Kris Tucker Amit Kiran Rege Conor Smith Claire Monteleoni Tameem Albash Department of Applied Mathematics Department of Computer Science Center for Quantum Information and Control Department of Electrical and Computer Engineering Paris France Center for Computing Research

We build upon recent work on the use of machine-learning models to estimate Hamiltonian parameters using continuous weak measurement of qubits as input. We consider two settings for the training of our model: (1) supervised learning, where the weak-measurement training record can be labeled with known Hamiltonian parameters, and (2) unsupervised learning, where no labels are available. The first has the advantage of not requiring an explicit representation of the quantum state, thus potentially scaling very favorably to a larger number of qubits. The second requires the implementation of a physical model to map the Hamiltonian parameters to a measurement record, which we implement using an integrator of the physical model with a recurrent neural network to provide a model-free correction at every time step to account for small effects not captured by the physical model. We test our construction on a system of two qubits and demonstrate accurate prediction of multiple physical parameters in both the supervised context and the unsupervised context. We demonstrate that the model benefits from larger training sets, establishing that it is “learning,” and we show robustness regarding errors in the assumed physical model by achieving accurate parameter estimation in the presence of unanticipated single-particle relaxation.

关键词： Entanglement detection Nonlocality Quantum parameter estimation Machine learning Weak measurements

来源：评论

学校读者我要写书评

暂无评论

Blocky Volume Package: a Web-friendly Volume Storage and Compression Solution

Blocky Volume Package: a Web-friendly Volume Storage and Com...

引用

作者： Lesar, Žiga Bohak, Ciril Marolt, Matija University of Ljubljana Faculty of Computer and Information Science Večna pot 113 Ljubljana1000 Slovenia King Abdullah University of Science and Technology Visual Computing Center Thuwal23955 Saudi Arabia

The Blocky Volume Package (BVP) format is a distributed, platform-independent and API-independent format for storing static and temporal volumetric data. It is designed for efficient transfer over a network by supporting sparse volumes, multiple resolutions, random access, and streaming, as well as providing a strict framework for supporting a wide palette of encoding formats. The BVP format achieves this by dividing a volume or a volume sequence into blocks that can be compressed and reused. The metadata for the blocks are stored in separate files so that a client has all the information required for loading and decoding the blocks before the actual transmission, decoding and rendering take place. This design allows for random access and parallel loading and has been specifically designed for efficient use on the web platform by adhering to the current living standards. In the paper, we compare the BVP format with some of the most often implemented volume storage formats, and show that the BVP format supports most major features of these formats while at the same time being easily implementable and extensible. © 2023 The Author(s).

关键词： Volumetric analysis

来源：评论

学校读者我要写书评

暂无评论

Traffic Management in Internet of Vehicles Using Improved Ant Colony Optimization

引用

computers, Materials & Continua 2023年第6期75卷 5379-5393页

作者： Abida Sharif Imran Sharif Muhammad Asim Saleem Muhammad Attique Khan Majed Alhaisoni Marriam Nawaz Abdullah Alqahtani Ye Jin Kim Byoungchol Chang Department of Computer Science COMSATS University IslamabadPakistan Faculty of Computing Riphah International UniversityFaisalabadPakistan Department of Computer Science HITEC UniversityTaxilaPakistan Computer Sciences Department College of Computer and Information SciencesPrincess Nourah bint Abdulrahman UniversityRiyadh11671Saudi Arabia Department of Computer Science UET TaxilaTaxilaPakistan Department of Software Engineering UET TaxilaTaxilaPakistan Software Engineering Department College of Computer Engineering and SciencesPrince Sattam bin Abdulaziz UniversityP.O.Box 151Al-Kharj11942KSA Department of Computer Science Hanyang UniversitySeoul04763Korea Center for Computational Social Science Hanyang UniversitySeoul04763Korea

The Internet of Vehicles(IoV)is a networking paradigm related to the intercommunication of vehicles using a *** a dynamic network,one of the key challenges in IoV is traffic management under increasing vehicles to avoid ***,optimal path selection to route traffic between the origin and destination is *** research proposed a realistic strategy to reduce traffic management service response time by enabling real-time content distribution in IoV systems using heterogeneous network ***,this work proposed a novel use of the Ant Colony Optimization(ACO)algorithm and formulated the path planning optimization problem as an Integer Linear Program(ILP).This integrates the future estimation metric to predict the future arrivals of the vehicles,searching the optimal *** the mobile nature of IOV,fuzzy logic is used for congestion level estimation along with the ACO to determine the optimal *** model results indicate that the suggested scheme outperforms the existing state-of-the-art methods by identifying the shortest and most cost-effective ***,this work strongly supports its use in applications having stringent Quality of Service(QoS)requirements for the vehicles.

关键词： Internet of vehicles internet of things fuzzy logic optimization path planning

来源：评论

学校读者我要写书评

暂无评论

Making Large Language Models Better Reasoners with Orchestrated Streaming Experiences

arXiv

引用

arXiv 2025年

作者： Liu, Xiangyang He, Junliang Qiu, Xipeng School of Computer Science Fudan University Shanghai Collaborative Innovation Center of Intelligent Visual Computing China

Large language models (LLMs) can perform complex reasoning by generating intermediate thoughts under zero-shot or few-shot settings. However, zero-shot prompting always encounters low performance, and the superior performance of few-shot prompting hinges on the manual-crafted demonstrations. In this paper, we present RoSE (Reasoning with Orchestrated Streaming Experiences), a general framework for solving reasoning tasks that can self-improve without complex external efforts. To enable RoSE, we describe an architecture that extends an LLM to store all answered questions and their thoughts in a streaming experience pool then orchestrates helpful questions from the pool to assist in answering new questions. To set up a question-aware orchestration mechanism, RoSE first calculates the similarity of each question in the pool with a new test question. Since the solution to each answered question is not always correct, RoSE will sort the questions according to their similarity with the new question, and then uniformly divide them into multiple buckets. It finally extracts one question from each bucket to make these extracted questions more diverse. To make these extracted questions help RoSE answer new questions as much as possible, we introduce two other attributes of uncertainty and complexity for each question. RoSE will preferentially select the questions with low uncertainty and high complexity from each bucket. We evaluate the versatility of RoSE in various reasoning tasks, LLMs, and CoT methods. Copyright © 2025, The Authors. All rights reserved.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

FreqRISE: Explaining time series using frequency masking 6

FreqRISE: Explaining time series using frequency masking

引用

6th Northern Lights Deep Learning Conference, NLDL 2025

作者： Brüsch, Thea Wickstrøm, Kristoffer Knutsen Schmidt, Mikkel N. Alstrøm, Tommy Sonne Jenssen, Robert Department of Applied Mathematics and Computer Science Technical University of Denmark Denmark Department of Physics and Technology UiT The Arctic University of Norway Norway Norwegian Computing Center Oslo Norway

Time series data is fundamentally important for many critical domains such as healthcare, finance, and climate, where explainable models are necessary for safe automated decision-making. To develop explainable artificial intelligence in these domains therefore implies explaining salient information in the time series. Current methods for obtaining saliency maps assumes localized information in the raw input space. In this paper, we argue that the salient information of a number of time series is more likely to be localized in the frequency domain. We propose FreqRISE, which uses masking-based methods to produce explanations in the frequency and time-frequency domain, and outperforms strong baselines across a number of tasks. The source code is available here: https://***/theabrusch/FreqRISE. © NLDL *** rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Towards optimized tensor code generation for deep learning on sunway many-core processor

引用

Frontiers of computer science 2024年第2期18卷 1-15页

作者： Mingzhen LI Changxi LIU Jianjin LIAO Xuegui ZHENG Hailong YANG Rujun SUN Jun XU Lin GAN Guangwen YANG Zhongzhi LUAN Depei QIAN State Key Laboratory of Software Development Environment Beijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China National University of Singapore Singapore 119077Singapore State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi 214000China Science and Technology on Special System Simulation Laboratory Beijing Simulation Center Beijing 100854China Department of Computer Science and Technology Tsinghua UniversityBeijing 100084China

The flourish of deep learning frameworks and hardware platforms has been demanding an efficient compiler that can shield the diversity in both software and hardware in order to provide application *** the existing deep learning compilers,TVM is well known for its efficiency in code generation and optimization across diverse hardware *** the meanwhile,the Sunway many-core processor renders itself as a competitive candidate for its attractive computational power in both scientific computing and deep learning *** paper combines the trends in these two ***,we propose swTVM that extends the original TVM to support ahead-of-time compilation for architecture requiring cross-compilation such as *** addition,we leverage the architecture features during the compilation such as core group for massive parallelism,DMA for high bandwidth memory transfer and local device memory for data locality,in order to generate efficient codes for deep learning workloads on *** experiment results show that the codes generated by swTVM achieve 1.79x improvement of inference latency on average compared to the state-of-the-art deep learning framework on Sunway,across eight representative *** work is the first attempt from the compiler perspective to bridge the gap of deep learning and Sunway processor particularly with productivity and efficiency in *** believe this work will encourage more people to embrace the power of deep learning and Sunwaymany-coreprocessor.

关键词： sunway processor deep learning compiler code generation performance optimization

来源：评论

学校读者我要写书评

暂无评论

Leveraging Contrastive Learning for Enhanced Node Representations in Tokenized Graph Transformers 38

Leveraging Contrastive Learning for Enhanced Node Representa...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Chen, Jinsong Liu, Hanpeng Hopcroft, John E. He, Kun School of Computer Science and Technology Huazhong University of Science and Technology China Institute of Artificial Intelligence Huazhong University of Science and Technology China Hopcroft Center on Computing Science Huazhong University of Science and Technology China Department of Computer Science Cornell University United States

While tokenized graph Transformers have demonstrated strong performance in node classification tasks, their reliance on a limited subset of nodes with high similarity scores for constructing token sequences overlooks valuable information from other nodes, hindering their ability to fully harness graph information for learning optimal node representations. To address this limitation, we propose a novel graph Transformer called GCFormer. Unlike previous approaches, GCFormer develops a hybrid token generator to create two types of token sequences, positive and negative, to capture diverse graph information. And a tailored Transformer-based backbone is adopted to learn meaningful node representations from these generated token sequences. Additionally, GCFormer introduces contrastive learning to extract valuable information from both positive and negative token sequences, enhancing the quality of learned node representations. Extensive experimental results across various datasets, including homophily and heterophily graphs, demonstrate the superiority of GCFormer in node classification, when compared to representative graph neural networks (GNNs) and graph Transformers. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PraK Tool: An Interactive Search Tool Based on Video Data Services 30th

PraK Tool: An Interactive Search Tool Based on Video Data S...

引用

30th International Conference on MultiMedia Modeling, MMM 2024

作者： Lokoč, Jakub Vopálková, Zuzana Stroh, Michael Buchmueller, Raphael Schlegel, Udo SIRET Research Group Department of Software Engineering Faculty of Mathematics and Physics Charles University Prague Czech Republic Visual Computing Department of Computer Science Faculty of Natural Sciences Konstanz University Konstanz Germany Data Analysis and Visualization Department of Computer Science Faculty of Natural Sciences Konstanz University Konstanz Germany

ISBN: (纸本)9783031533013

This paper presents a tool relying on data service architecture, where technical details of all VBS datasets are completely hidden behind an abstract stateless data layer. The data services allow independent development of interactive search interfaces and refinement techniques, which is demonstrated by a smart front-end component. The component supports common search features and allows users to exploit content-based statistics for effective filtering. We believe that video data services might be a valuable addition to the open-source VBS toolkit, especially when available for the competition on a shared server with all VBS datasets, extracted features, and meta-data behind. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： Video recording

来源：评论

学校读者我要写书评

暂无评论

Empowering Diagnosis: Cutting-Edge Segmentation and Classification in Lung Cancer Analysis

引用

computers, Materials & Continua 2024年第6期79卷 4963-4977页

作者： Iftikhar Naseer Tehreem Masood Sheeraz Akram Zulfiqar Ali Awais Ahmad Shafiq Ur Rehman Arfan Jaffar Faculty of Computer Sciences&Information Technology The Superior UniversityLahore54000Pakistan Intelligent Data Visual Computing Research(IDVCR) Lahore54000Pakistan Information System Department College of Computer and Information SciencesImam Mohammad Ibn Saud Islamic University(IMSIU)Riyadh11432Saudi Arabia School of Computer Science and Electronic Engineering(CSEE) University of EssexWivenhoe ParkColchesterCO43SQUK

Lung cancer is a leading cause of global mortality *** detection of pulmonary tumors can significantly enhance the survival rate of ***,various computer-Aided Diagnostic(CAD)methods have been developed to enhance the detection of pulmonary nodules with high ***,the existing method-ologies cannot obtain a high level of specificity and *** present study introduces a novel model for Lung Cancer Segmentation and Classification(LCSC),which incorporates two improved architectures,namely the improved U-Net architecture and the improved AlexNet *** LCSC model comprises two distinct *** first stage involves the utilization of an improved U-Net architecture to segment candidate nodules extracted from the lung ***,an improved AlexNet architecture is employed to classify lung *** the first stage,the proposed model demonstrates a dice accuracy of 0.855,a precision of 0.933,and a recall of 0.789 for the segmentation of candidate *** suggested improved AlexNet architecture attains 97.06%accuracy,a true positive rate of 96.36%,a true negative rate of 97.77%,a positive predictive value of 97.74%,and a negative predictive value of 96.41%for classifying pulmonary cancer as either benign or *** proposed LCSC model is tested and evaluated employing the publically available dataset furnished by the Lung Image Database Consortium and Image Database Resource Initiative(LIDC-IDRI).This proposed technique exhibits remarkable performance compared to the existing methods by using various evaluation parameters.

关键词： Lung cancer segmentation AlexNet U-Net classification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：