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

arXiv 2025年

作者： Inie, Nanna Falk, Jeanette Selvan, Raghavendra IT University of Copenhagen Center for Computing Education Research Copenhagen Denmark Aalborg University Copenhagen Department of Computer Science Copenhagen Denmark University of Copenhagen Department of Computer Science Copenhagen Denmark

Increased usage of generative AI (GenAI) in Human-computer Interaction (HCI) research induces a climate impact from carbon emissions due to energy consumption of the hardware used to develop and run GenAI models and systems. The exact energy usage and and subsequent carbon emissions are difficult to estimate in HCI research because HCI researchers most often use cloud-based services where the hardware and its energy consumption are hidden from plain view. The HCI GenAI CO2ST Calculator is a tool designed specifically for the HCI research pipeline, to help researchers estimate the energy consumption and carbon footprint of using generative AI in their research, either a priori (allowing for mitigation strategies or experimental redesign) or post hoc (allowing for transparent documentation of carbon footprint in written reports of the research). © 2025, CC BY.

关键词： Carbon sequestration

来源：评论

学校读者我要写书评

暂无评论

Rethinking Tokenized Graph Transformers for Node Classification

arXiv

引用

arXiv 2025年

作者： Chen, Jinsong Li, Chenyang Li, GaiChao Hopcroft, John E. He, Kun School of Computer Science and Technology 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

Node tokenized graph Transformers (GTs) have shown promising performance in node classification. The generation of token sequences is the key module in existing tokenized GTs which transforms the input graph into token sequences, facilitating the node representation learning via Transformer. In this paper, we observe that the generations of token sequences in existing GTs only focus on the first-order neighbors on the constructed similarity graphs, which leads to the limited usage of nodes to generate diverse token sequences, further restricting the potential of tokenized GTs for node classification. To this end, we propose a new method termed SwapGT. SwapGT first introduces a novel token swapping operation based on the characteristics of token sequences that fully leverages the semantic relevance of nodes to generate more informative token sequences. Then, SwapGT leverages a Transformer-based backbone to learn node representations from the generated token sequences. Moreover, SwapGT develops a center alignment loss to constrain the representation learning from multiple token sequences, further enhancing the model performance. Extensive empirical results on various datasets showcase the superiority of SwapGT for node classification. © 2025, CC BY.

关键词： Distribution transformers

来源：评论

学校读者我要写书评

暂无评论

How CO2STLY Is CHI? The Carbon Footprint of Generative AI in HCI Research and What We Should Do About It 25

How CO2STLY Is CHI? The Carbon Footprint of Generative AI in...

引用

Proceedings of the 2025 CHI Conference on Human Factors in computing Systems

作者： Nanna Inie Jeanette Falk Raghavendra Selvan Center for Computing Education Research (CCER) IT University of Copenhagen Copenhagen Denmark Department of Computer Science Aalborg University Copenhagen Denmark Department of Computer Science University of Copenhagen Copenhagen Denmark

来源：评论

学校读者我要写书评

暂无评论

Time-aware Medication Recommendation via Intervention of Dynamic Treatment Regimes 25

Time-aware Medication Recommendation via Intervention of Dyn...

引用

34th ACM Web Conference, WWW 2025

作者： Li, Yishuo Zhang, Qi Lu, Wenpeng Peng, Xueping Zhang, Weiyu Si, Jiasheng Gong, Yongshun Hu, Liang Jinan China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan China Department of Computer Science and Technology Tongji University Shanghai China Australian Artificial Intelligence Institute University of Technology Sydney Sydney Australia School of Software Shandong University Jinan China

ISBN: (纸本)9798400712746

Medication recommendation aims to suggest personalized drug combinations to patients based on their longitudinal medical histories stored in electronic health record (EHR) datasets. Patients’ Dynamic Treatment Regimes (DTRs) determine how patients’ drug combinations change along with the evolution of disease treatment. DTRs are effective for comprehending disease-treatment dynamics and for recommending a timely and personalized combination of medications for patients. However, existing medication recommender systems (MRSs) overlook the multiple treatment pathways generated by the intervention of DTRs and can only recommend a single treatment paradigm, ignoring the fact that patients may be at different treatment stages and thus require different treatment regime. Such disregard leads to a significant limitation in recommending personalized medication combinations tailored to different treatment stages, yielding greatly compromised accuracy and applicability of MRSs. Moreover, existing methods often overlook the time interval information over patients’ successive visits, which is critical to indicate patients’ treatment evolution. To address these significant gaps, we propose a Time-aware Medication Recommendation Framework via Intervention of Dynamic Treatment Regimes, called MR-DTR. To explicitly illustrate the intervention processes of DTRs on similar patients, we employ a co-guided graph to connect various patient sequences. In addition, to fully utilize the time interval information, we design a time-aware guidance mechanism dedicated to the co-guided graph to efficiently learn medication representation using the patient’s guidance information. We also introduce relative time intervals in the encoder to act as positional information. Extensive experiments on two real-world datasets demonstrate that MR-DTR surpasses state-of-the-art models in terms of recommendation performance. © 2025 Copyright held by the owner/author(s).

关键词： Electronic health record

来源：评论

学校读者我要写书评

暂无评论

Predictive modeling of MXene-based solar absorbers using a deep neural network

引用

Journal of the Optical Society of America B: Optical Physics 2025年第4期42卷 763-772页

作者： Waseer, Waleed Iqbal Baqir, Muhammad Abuzar Saqlain, Muhammad Mughal, Muhammad Junaid Khan, Shujaat School of Physics State Key Laboratory of Electronic Thin Films and Integrated Devices University of Electronic Science and Technology of China Chengdu China Department of Electrical Engineering COMSATS University Islamabad Sahiwal57000 Pakistan Department of Electrical and Computer Engineering COMSATS University Islamabad Islamabad45550 Pakistan Department of Computer Engineering College of Computing and Mathematics King Fahd University of Petroleum & Minerals Dhahran31261 Saudi Arabia SDAIA-KFUPM Joint Research Center for Artificial Intelligence King Fahd University of Petroleum & Minerals Dhahran31261 Saudi Arabia

Nanophotonic structures, such as photonic crystals, plasmonic nanostructures, and metamaterials, present transformative potential in advancing optical devices through innovative design capabilities. Among these, metamaterials—specifically metal–insulator–metal (MIM)-based absorbers—stand out for their ability to achieve high electromagnetic wave absorption across designated frequencies, proving valuable in applications ranging from solar cells to sensors. This study focuses on designing a high-efficiency MXene–SiO2–silver MIM metasurface absorber, leveraging deep learning techniques to streamline and enhance the simulation process traditionally reliant on finite-difference time-domain (FDTD) or finite-element methods (FEMs). By utilizing a deformable convolutional neural network (CNN), the proposed model predicts absorption spectra from metasurface geometries with superior accuracy and reduced computational demand while achieving dynamic spatial transformation handling. The model’s accuracy is further elucidated through Gradient-weighted Class Activation Mapping (Grad-CAM), which provides insights into the absorber’s most influential regions, supporting targeted optimization for specific applications. This deep learning approach demonstrates significant advantages over conventional methods in efficiency and adaptability, advancing the development of high-performance nanophotonic devices. © 2025 Optica Publishing Group. All rights, including for text and data mining (TDM), Artificial Intelligence (AI) training, and similar technologies, are reserved.

关键词： Time domain analysis

来源：评论

学校读者我要写书评

暂无评论

Hashgraph consensus-based simultaneous, asynchronous and big-data supported blockchain mechanism for IT-OT enabled critical infrastructure sectors

引用

Journal of Ambient Intelligence and Humanized computing 2025年 1-13页

作者： Hasan, Mohammad Kamrul Ghazal, Taher M. Issa, Ghassan Islam, Shayla Ismail, Ahmad Fadzil Kabir, S. Rayhan Bangi43600 Malaysia Hourani Center for Applied Scientific Research Al-Ahliyya Amman University Amman11937 Jordan School of Computing Skyline University College University City Sharjah Skyline University College Sharjah1797 United Arab Emirates Institue of Computer Science and Digitial Innovation UCSI University Malaysia Kuala Lumpur56000 Malaysia Department of Electrical and Computer Engineering International Islamic University of Malaysia Kuala Lumpur53000 Malaysia

Critical Infrastructure (CI) refers to the essential areas made up of public, private, and business sectors for the security of a country's development, such as electricity, water, health, education, etc. where information technologies (ITs) and operational technologies (OTs) enable automation services of CI. Currently, blockchain is being experimented in various CI sectors and any CI sector accumulates the data of millions of people in a country or nation from which big data is being generated. Big data connections are seen with large-scale blockchain networks because as the size of the blockchain network increases, so does the amount of connected data. Typically, the blockchain does not support asynchronous and simultaneous processes that indicate multiple block compilation does not allow at the same time for the blockchain systems. That is why high energy consumption, high bandwidth dependency, long-time computation, high mining process, and system slowness issues are seen on large-scale blockchain networks where big data is also connected. However, Hashgraph is an alternative distributed ledger technology (DLT) to blockchain and is also considered a consensus method that supports Asynchronous Byzantine Fault Tolerance (ABFT) as well as simultaneous process. Moreover, Hashgraph does not need mining and network node verification processes which saves bandwidth. In this research, we proposed a Hashgraph-enabled blockchain model for reducing the above issues and illustrated the adoption of IT-enabled OT to support CI. In addition, this manuscript discusses how the proposed model can create positive impacts in CI areas by replacing traditional blockchain systems. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： Critical infrastructures

来源：评论

学校读者我要写书评

暂无评论

A Hierarchical Deep Learning Approach for Predicting Job Queue Times in HPC Systems 24

A Hierarchical Deep Learning Approach for Predicting Job Que...

引用

Proceedings of the SC '24 Workshops of the International Conference on High Performance computing, Network, Storage, and Analysis

作者： Austin Lovell Philip Wisniewski Sarah Rodenbeck Ashish Department of Computer Science Purdue University Indiana USA Rosen Center for Advanced Computing Purdue University Indiana USA

ISBN: (纸本)9798350355543

Accurate wait-time prediction for HPC jobs contributes to a positive user experience but has historically been a challenging task. Previous models lack the accuracy needed for confident predictions, and many were developed before the rise of deep *** this work, we investigate and develop TROUT, a neural network-based model to accurately predict wait times for jobs submitted to the Anvil HPC cluster. Data was taken from the Slurm Workload Manager on the cluster and transformed before performing additional feature engineering from jobs' priorities, partitions, and states. We developed a hierarchical model that classifies job queue times into bins before applying regression, outperforming traditional methods. The model was then integrated into a CLI tool for queue time prediction. This study explores which queue time prediction methods are most applicable for modern HPC systems and shows that deep learning-based prediction models are viable solutions.

关键词： High-performance computing

来源：评论

学校读者我要写书评

暂无评论

CHARACTERIZINGTRANSFERGRAPHS OF SUSPICIOUSERC-20TOKENS

arXiv

引用

arXiv 2025年

作者： Josenhans, Calvin Kuehlkamp, Andrey Nabrzyski, Jarek Department of Computer Science Indiana University IN United States Center for Research Computing University of Notre Dame IN United States

Ethereum is currently the second largest blockchain by market capitalization and a popular platform for cryptocurrencies. As it has grown, the high value present and the anonymity afforded by the technology have led Ethereum to become a hotbed for various cybercrimes. This paper seeks to understand how these fraudulent schemes may be characterized and develop methods for detecting them. One key feature introduced by Ethereum is the ability to use programmable smart contracts to execute code on the blockchain. A common use of smart contracts is implementing fungible tokens with the ERC-20 interface. Such tokens can be used to impersonate legitimate tokens and defraud users. By parsing the event logs emitted by these ERC-20 contracts over 20 different periods of 100K blocks, we construct token transfer graphs for each of the available ERC-20 tokens on the blockchain. By analyzing these graphs, we find a set of characteristics by which suspicious contracts are distinguished from legitimate ones. These observations result in a simple model that can identify scam contracts with an average of 88.7% accuracy. This suggests that the mechanism by which fraudulent schemes function strongly correlates with their transfer graphs and that these graphs may be used to improve scam-detection mechanisms, contributing to making Ethereum safer. © 2025, CC BY.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

Federated Meta Continual Learning for Efficient and Autonomous Edge Inference 24th

Federated Meta Continual Learning for Efficient and Autono...

引用

24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Li, Bingze Ho, Stella Qu, Youyang Xu, Chenhao Luan, Tom H. Gao, Longxiang Jinan China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan China Department of Biomedical Engineering The University of Melbourne VIC Melbourne Australia School of Information Technology Deakin University VIC Geelong Australia School of Cyber Engineering Xidian University Xi’an China

ISBN: (纸本)9789819615476

With an increasing volume of data being collected and processed on edge, Federated Learning (FL) has become a dominant approach to train shared global models on distributed data held by diverse edge clients without exposing privacy. However, with expectations of high-quality user experience, instantaneous intelligent decisions must be made at the network edge to meet performance, security, and latency requirements. Intuitively, this challenge becomes more daunting as edge devices are constrained by limited computing and storage resources. Furthermore, edge clients need to continuously acquire, update, accumulate, and apply knowledge in domains requiring the processing of sensitive data and long-term model training. It has been proven that edge clients often forget previous tasks knowledge after learning new tasks, resulting in catastrophic forgetting. To mitigate this, we propose a Federated Meta Continual Learning (FMCL) approach. It requires edge clients not only to learn new tasks quickly but also to memorize rapidly. Specifically, we adopted a MAML (Model-Agnostic Meta-Learning) framework with memory replay, setting up buffers at edge clients to consolidate old tasks. In such a way, the model learns optimal initialization to quickly adapt to all seen tasks while preventing catastrophic forgetting. Extensive evaluation results indicate that FMCL performs well in alleviating catastrophic forgetting and achieves a good balance between learning new tasks and remembering existing tasks. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

IIM-ARE: An Effective Interactive Incentive Mechanism based on Adaptive Reputation Evaluation for Mobile Crowd Sensing

引用

IEEE Internet of Things Journal 2025年第11期12卷 16181-16191页

作者： Tang, Xiangyan Liu, Jingxin Li, Keqiu Tu, Wenxuan Xu, Xinbin Xiong, Neal N. Tianjin University College of Intelligence and Computing Tianjin300350 China Hainan University School of Computer Science and Technology Haikou570228 China Hainan University Hainan Blockchain Technology Engineering Research Center Haikou570100 China Hainan University School of Cyberspace Security Haikou570228 China School of Cyberspace Security Hainan University Haikou570228 China Department of Computer Mathematical and Physical Sciences Sul Ross State University AlpineTX79830 United States

Mobile Crowd Sensing (MCS), as an innovative data acquisition model in the Internet of Things (IoT), employs an incentive mechanism based on users' reputation evaluation, which is a mainstream reward allocation method. However, in the existing incentive mechanisms based on reputation evaluation, uni-directional incentive strategies and non-Adaptive reputation models result in unequal reward allocation. To tackle this issue, we propose an effective interactive incentive mechanism based on adaptive reputation evaluation. Specifically, we generate user status thresholds to classify, rate, and weight user behaviors, based on the average quality thresholds of tasks released or data submitted by different users in each interaction round. Meanwhile, we achieve multi-party consensus by incorporating the obtained user reputation values and combining them with the cumulative reputation values from multiple rounds to obtain adaptive reputation evaluation results. Moreover, we design an interactive incentive strategy that measures users' incentive values based on their reputation evaluation results in each round, mutually punishing malicious behaviors from both the publisher's and the worker's perspectives. Extensive experiments have demonstrated that our method consistently outperforms existing advanced incentive mechanisms. © 2014 IEEE.

关键词： Sensors Evaluation models Internet of Things Adaptation models Resource management Reliability Mobile computing Particle measurements Mathematical models Data models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：