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

12th IEEE/ACM International Workshop on Runtime and Operating Systems for Supercomputers, ROSS 2022

作者： Gordon, Nicholas Pedretti, Kevin Lange, John R. University of Pittsburgh Department of Computer Science PittsburghPA United States Sandia National Laboratories Center for Computing Research AlbuquerqueNM United States Oak Ridge National Laboratory Oak RidgeTN United States

ISBN: (纸本)9781665475662

Hardware design in high-performance computing (HPC) is often highly experimental. Exploring new designs is difficult and time-consuming, requiring lengthy vendor cooperation. RISC-V is an open-source processor ISA that improves the accessibility of chip design, including the ability to do hardware/software co-design using open-source hardware and tools. Co-design allows design decisions to easily flow across the hardware/software boundary and influence future design ideas. However, new hardware designs require corresponding software to drive and test them. Conventional operating systems like Linux are massively complex and modification is time-prohibitive. In this paper, we describe our port of the Kitten lightweight kernel operating system to RISC-V in order to provide an alternative to Linux for conducting co-design research. Kitten's small code base and simple resource management policies are well matched for quickly exploring new hardware ideas that may require radical operating system modifications and restructuring. Our evaluation shows that Kitten on RISC-V is functional and provides similar performance to Linux for single-core benchmarks. This provides a solid foundation for using Kitten in future co-design research involving RISC-V. © 2022 IEEE.

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

CLDG: Contrastive Learning on Dynamic Graphs 39

CLDG: Contrastive Learning on Dynamic Graphs

引用

39th IEEE International Conference on Data Engineering, ICDE 2023

作者： Xu, Yiming Shi, Bin Ma, Teng Dong, Bo Zhou, Haoyi Zheng, Qinghua Xi'an Jiaotong University Department of Computer Science and Technology China Xi'an Jiaotong University Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering China Xi'an Jiaotong University Department of Distance Education China Beihang University School of Software China Beihang University Advanced Innovation Center for Big Data and Brain Computing China

ISBN: (纸本)9798350322279

The graph with complex annotations is the most potent data type, whose constantly evolving motivates further exploration of the unsupervised dynamic graph representation. One of the representative paradigms is graph contrastive learning. It constructs self-supervised signals by maximizing the mutual information between the statistic graph's augmentation views. However, the semantics and labels may change within the augmentation process, causing a significant performance drop in downstream tasks. This drawback becomes greatly magnified on dynamic graphs. To address this problem, we designed a simple yet effective framework named CLDG. Firstly, we elaborate that dynamic graphs have temporal translation invariance at different levels. Then, we proposed a sampling layer to extract the temporally-persistent signals. It will encourage the node to maintain consistent local and global representations, i.e., temporal translation invariance under the timespan views. The extensive experiments demonstrate the effectiveness and efficiency of the method on seven datasets by outperforming eight unsupervised state-of-the-art baselines and showing competitiveness against four semi-supervised methods. Compared with the existing dynamic graph method, the number of model parameters and training time is reduced by an average of 2,001.86 times and 130.31 times on seven datasets, respectively. The code and data are available at: https://***/yimingxu24/CLDG. © 2023 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

A Data-Driven Approach Towards Software Regression Testing Quality Optimization 25

A Data-Driven Approach Towards Software Regression Testing Q...

引用

25th International Arab Conference on Information Technology, ACIT 2024

作者： Moubayed, Abdallah Alhindawi, Nouh Alsakran, Jamal Injadat, MohammadNoor Kanan, Mohammad King Fahd University of Petroleum & Minerals Computer Engineering Department Interdisciplinary Research Center for Intelligent Secure Systems Dhahran Saudi Arabia Arizona State University School of Computing and Augmented Intelligence GilbertAZ United States Jadara University Department of Software Engineering Irbid Jordan Fairleigh Dickinson University Canada Zarqa University Data Science & Artificial Intelligence Department Zarqa Jordan University of Business and Technology Department of Industrial Engineering Jeddah Saudi Arabia

ISBN: (纸本)9798331540012

Software testing is very important in software development to ensure its quality and reliability. As software systems have become more complex, the number of test cases has increased, which presents the challenge of executing all the tests in a limited time frame. Various test case prioritization techniques have been introduced to solve this problem. These methods aim to identify and implement the most critical tests first. In this paper, we propose an implementation of a dynamic test case prioritization strategy to improve software quality by increasing code coverage with special attention to edge case handling. Edge case test prioritization is a technique that improves test efficiency by selecting extreme case scenarios that can reveal critical bugs or unexpected behavior early in development, improving overall software reliability and dependability. In order to prioritize test cases, this paper presents a regression-based method that makes use of machine learning algorithms. The approach leverages previous performance data to optimize regression testing efficiency by examining variables like test time and execution status. Performance evaluations, when compared against industry standards and cutting-edge techniques, show how effective these algorithms are at correctly prioritizing test cases and identifying faults. This study offers simplified yet reliable solutions for regression testing optimization by shedding light on the efficacy of regression algorithms, such as Random Forest and decision trees. © 2024 IEEE.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

VDN: Variant-depth network for motion deblurring

VDN: Variant-depth network for motion deblurring

引用

作者： Guo, Cai Wang, Qian Dai, Hong-Ning Li, Ping School of Computer Science and Engineering Macau University of Science and Technology Taipa China Network and Educational Technology Center Hanshan Normal University Chaozhou China Department of Computing The Hong Kong Polytechnic University Kowloon Hong Kong Department of Computing and Decision Sciences Lingnan University Tuen Mun Hong Kong School of Design The Hong Kong Polytechnic University Kowloon Hong Kong

Motion deblurring is a challenging task in vision and graphics. Recent researches aim to deblur by using multiple sub-networks with multi-scale or multi-patch inputs. However, scaling or splitting operations on input images inevitably loses the spatial details of the images. Meanwhile, their models are usually complex and computationally expensive. To address these problems, we propose a novel variant-depth scheme. In particular, we utilize the multiple variant-depth sub-networks with scale-invariant inputs to combine into a variant-depth network (VDN). In our design, different levels of sub-networks accomplish progressive deblurring effects without transforming the inputs, thereby effectively reducing the computational complexity of the model. Extensive experiments have shown that our VDN outperforms the state-of-the-art motion deblurring methods while maintaining a lower computational cost. The source code is publicly available at: https://***/CaiGuoHS/VDN. © 2022 John Wiley & Sons, Ltd.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Groundbreaking taxonomy of metaverse characteristics

引用

Artificial Intelligence Review 2025年第8期58卷 1-50页

作者： Sadeghi-Niaraki, Abolghasem Rahimi, Fatema Azlan, Nur Alya Emanuelle Binti Song, Houbing Ali, Farman Choi, Soo-Mi Department of Computer Science and Engineering and Convergence Engineering for Intelligent Drone XR Research Center Sejong University Seoul Korea Republic of BaltimoreMD21250 United States Department of Applied AI School of Convergence College of Computing and Informatics Sungkyunkwan University Seoul03063 Korea Republic of

The Metaverse, a dynamic and immersive virtual realm, has captured the imagination of researchers and enthusiasts worldwide. This survey paper aims to introduce a groundbreaking taxonomy for the characteristics of the Metaverse offering a structured and adaptable framework that extends beyond existing categorizations by incorporating dynamic transformations. Unlike prior taxonomies, which often focus on fixed attributes, our approach emphasizes the dynamic evolution of Metaverse characteristics. Through an extensive review of published literature, this study explores key technological, social, economic, and ethical dimensions of the Metaverse. It introduces a process-oriented classification based on 23 distinct characteristics, including immersification, spatiotemporalification, interactification, persistentification, presentification, personification, unification, imaginification, economification, uncertaintification, and credification. By mapping these evolving aspects, we provide a structured and future-proof foundation for understanding the Metaverse’s continuous development. This survey establishes a new standard for comprehensiveness and innovation, shedding light on the diverse facets that have been explored in literature. Through this novel taxonomy, we provide a detailed map of the current landscape and offer insights that pave the way for future research and development in this burgeoning digital frontier. © The Author(s) 2025.

关键词： Comprehensive analysis Futuristic exploration Metaverse characteristics Paradigm-shifting taxonomy Revolutionary categorization

来源：评论

学校读者我要写书评

暂无评论

High Performance computing Framework for Variable Selection on Genome-wide Association Studies

High Performance Computing Framework for Variable Selection ...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Liu, Xiang Liu, Xueling Diao, Jing Zheng, Mengyao Li, Jihe Wei, Dehui Xie, Qipeng Li, Xia Jiang, Linshan National University Health System Group Technology Office Singapore National University of Singapore School of Computing Singapore Peking University School Hospital of Stomatology National Center for Stomatology National Clinical Research Center for Oral Diseases Department of Preventive Dentistry China Harvard University Harvard T.H. Chan School of Public Health United States Peking University School of Software and Microelectronics China Hong Kong University of Science and Technology IoT Thrust Information Hub Guangzhou China Eth Zurich Department of Computer Science Switzerland National University of Singapore Institute of Data Science Singapore

ISBN: (纸本)9798350386226

Variable selection for genome-wide association studies (GWAS) has been a major research focus for decades. With the exponential growth of biological and biomedical data in the era of big data, scientists are confronted with the challenge of extracting meaningful information from vast datasets while managing the inherent heterogeneity in bioinformatics. To date, there are no highly effective tools that support high-dimensional datasets and achieve robust variable selection performance, all while accounting for the non-i.i.d. features and structured relatedness among explanatory and response *** address these challenges, we introduce the first high-performance computing framework for variable selection in GWAS. Our framework integrates various state-of-the-art methods, allowing researchers to easily combine different techniques and fully explore their potential. Additionally, our approach employs novel optimization strategies to solve the problem efficiently, even for high-dimensional data with sparse characteristics. By processing the data holistically, the framework delivers comprehensive analysis and accurate linkage mapping associations. Designed for ease of use, the framework is implemented in Python and offers seamless deployment, making it accessible to a wide range of researchers. © 2024 IEEE.

关键词： Confounding factors genome-wide association study structured relatedness variable selection

来源：评论

学校读者我要写书评

暂无评论

HAPIC: A Scalable, Lightweight and Reactive Cache for Persistent-Memory-Based Index

HAPIC: A Scalable, Lightweight and Reactive Cache for Persis...

引用

IEEE International Conference on computer-Aided Design

作者： Chih-Ting Lo Yun-Chih Chen Yuan-Hao Chang Tei-Wei Kuo Department of Computer Science and Information Engineering National Taiwan University Academia Sinica Institute of Information Science Taiwan Department of Computer Science Mohamed bin Zayed University of Artificial Intelligence NTU High Performance and Scientific Computing Center National Taiwan University

In-memory index delivers low-latency responses for data services. It has been ported to high-capacity persistent memory (PM) to accommodate more data. However, read-heavy, extremely-skewed, and highly-dynamic workloads can suffer from degraded performance on PM-based indexes. We present HAPIC, a scalable cache over PM-based indexes to capture the constantly-changing query hotspots in skewed workloads. HAPIC embodies the data access frequency gradient in a hierarchy of hash tables to efficiently identify hotspots and reacts quickly to workload changes with epoch-based promotion. Compared with the state-of-the-art strategy, HAPIC reacts to hotspot shifts significantly faster, with up to 14% higher stable read throughput, 26% lower median latency, and 13% lower P99 latency.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Provably Transformers Harness Multi-Concept Word Semantics for Efficient In-Context Learning

arXiv

引用

arXiv 2024年

作者： Bu, Dake Huang, Wei Han, Andi Nitanda, Atsushi Suzuki, Taiji Zhang, Qingfu Wong, Hau-San Department of Computer Science City University of Hong Kong Hong Kong Center for Advanced Intelligence Project RIKEN Japan Singapore College of Computing and Data Science Nanyang Technological University Singapore Department of Mathematical Informatics The University of Tokyo Japan

Transformer-based large language models (LLMs) have displayed remarkable creative prowess and emergence capabilities. Existing empirical studies have revealed a strong connection between these LLMs' impressive emergence abilities and their in-context learning (ICL) capacity, allowing them to solve new tasks using only task-specific prompts without further fine-tuning. On the other hand, existing empirical and theoretical studies also show that there is a linear regularity of the multi-concept encoded semantic representation behind transformer-based LLMs. However, existing theoretical work fail to build up an understanding of the connection between this regularity and the innovative power of ICL. Additionally, prior work often focuses on simplified, unrealistic scenarios involving linear transformers or unrealistic loss functions, and they achieve only linear or sub-linear convergence rates. In contrast, this work provides a fine-grained mathematical analysis to show how transformers leverage the multi-concept semantics of words to enable powerful ICL and excellent out-of-distribution ICL abilities, offering insights into how transformers innovate solutions for certain unseen tasks encoded with multiple cross-concept semantics. Inspired by empirical studies on the linear latent geometry of LLMs, the analysis is based on a concept-based low-noise sparse coding prompt model. Leveraging advanced techniques, this work showcases the exponential 0-1 loss convergence over the highly non-convex training dynamics, which pioneeringly incorporates the challenges of softmax self-attention, ReLU-activated MLPs, and cross-entropy loss. Empirical simulations corroborate the theoretical findings. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

On Statistical Rates and Provably Efficient Criteria of Latent Diffusion Transformers (DiTs)

arXiv

引用

arXiv 2024年

作者： Hu, Jerry Yao-Chieh Wu, Weimin Song, Zhao Liu, Han Center for Foundation Models Generative AI Department of Computer Science Department of Statistics and Data Science Northwestern University EvanstonIL60208 United States Simons Institute for the Theory of Computing UC Berkeley BerkeleyCA94720 United States

We investigate the statistical and computational limits of latent Diffusion Transformers (DiTs) under the low-dimensional linear latent space assumption. Statistically, we study the universal approximation and sample complexity of the DiTs score function, as well as the distribution recovery property of the initial data. Specifically, under mild data assumptions, we derive an approximation error bound for the score network of latent DiTs, which is sub-linear in the latent space dimension. Additionally, we derive the corresponding sample complexity bound and show that the data distribution generated from the estimated score function converges toward a proximate area of the original one. Computationally, we characterize the hardness of both forward inference and backward computation of latent DiTs, assuming the Strong Exponential Time Hypothesis (SETH). For forward inference, we identify efficient criteria for all possible latent DiTs inference algorithms and showcase our theory by pushing the efficiency toward almost-linear time inference. For backward computation, we leverage the low-rank structure within the gradient computation of DiTs training for possible algorithmic speedup. Specifically, we show that such speedup achieves almost-linear time latent DiTs training by casting the DiTs gradient as a series of chained low-rank approximations with bounded error. Under the low-dimensional assumption, we show that the statistical rates and the computational efficiency are all dominated by the dimension of the subspace, suggesting that latent DiTs have the potential to bypass the challenges associated with the high dimensionality of initial data. © 2024, CC BY-NC-SA.

关键词： Distribution transformers

来源：评论

学校读者我要写书评

暂无评论

SMOTE Oversampling and Near Miss Undersampling Based Diabetes Diagnosis from Imbalanced Dataset with XAI visualization

SMOTE Oversampling and Near Miss Undersampling Based Diabete...

引用

IEEE Symposium on computers and Communications (ISCC)

作者： Nasim Mahmud Nayan Ashraful Islam Muhammad Usama Islam Eshtiak Ahmed Mohammad Mobarak Hossain Md Zahangir Alam Department of Computer Science and Engineering University of Information Technology and Sciences Bangladesh Center for Computational and Data Sciences Independent University Bangladesh Department of Computer Science and Engineering Independent University Bangladesh School of Computing and Informatics University of Louisiana at Lafayette USA Department of Computer Science and Engineering Daffodil International University Bangladesh

This study investigated the predictive ability of ten different machine learning (ML) models for diabetes using a dataset that was not evenly distributed. Additionally, the study evaluated the effectiveness of two oversampling and undersampling methods, namely the Synthetic Minority Oversampling Technique (SMOTE) and the Near-Miss algorithm. Explainable Artificial Intelligence (XAI) techniques were employed to enhance the interpretability of the model's predictions. The results indicate that the extreme gradient boosting (XGB) model combined with SMOTE oversampling technique exhibited the highest accuracy and an F1-score of 99% and 1.00 respectively. Furthermore, the utilization of XAI methods increased the dependability of the model's decision-making process, rendering it more appropriate for clinical use. These results imply that integrating XAI with ML and oversampling techniques can enhance the early detection and management of diabetes, leading to better diagnosis and intervention.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：