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

arXiv 2025年

作者： Chen, Chen Guan, Peiyuan Chen, Ziru Taherkordi, Amir Hou, Fen Cai, Lin X. Department of Computer Science and Technology University of Cambridge United Kingdom Department of Informatics University of Oslo Norway Department of Electrical and Computer Engineering Illinois Institute of Technology United States Department of Electrical and Computer Engineering University of Macau China

Serverless computing adopts a pay-as-you-go billing model where applications are executed in stateless and short-lived containers triggered by events, resulting in a reduction of monetary costs and resource utilization. However, existing platforms do not provide an upper bound for the billing model which makes the overall cost unpredictable, precluding many organizations from managing their budgets. Due to the diverse ranges of serverless functions and the heterogeneous capacity of edge devices, it is challenging to receive near-optimal solutions for deployment cost in a polynomial time. In this paper, we investigated the function scheduling problem with a budget constraint for serverless computing in wireless networks. Users and IoT devices are sending requests to edge nodes, improving the latency perceived by users. We propose two online scheduling algorithms based on reinforcement learning, incorporating several important characteristics of serverless functions. Via extensive simulations, we justify the superiority of the proposed algorithm by comparing with an ILP solver (Midaco). Our results indicate that the proposed algorithms efficiently approximate the results of Midaco within a factor of 1.03 while our decision-making time is 5 orders of magnitude less than that of Midaco. © 2025, CC BY.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Label-Free Biomolecule Detection With InP/AlGaAs Charge Plasma Dielectric-Modulated Vertical TFET Using TaN as Metal Gate

引用

IEEE Access 2025年 13卷 89667-89684页

作者： Hashim Elshafie Abdulrahman Saad Alqahtani Azath Mubarakali Adarsh Rag S M. Venkatesh P. Parthasarathy Department of Computer Engineering College of Computer Science King Khalid University Abha Saudi Arabia College of Computing and Information Technology University of Bisha Bisha Saudi Arabia Department of Informatics and Computer Systems College of Computer Science King Khalid University Abha Saudi Arabia Department of Data Science and Computer Applications Manipal Institute of Technology Manipal Academy of Higher Education Manipal India Department of Electronics and Communication Engineering CMR Institute of Technology Bengaluru Karnataka India

This study introduces a label-free biosensing method for biomolecule detection utilizing an InP/AlGaAs charge plasma dielectric-modulated vertical tunnel field-effect transistor (InP/AlGaAs VTFET) featuring TaN as the metal gate. The device comprises a nanocavity beneath the gate metal adjacent to the tunnelling junction, where biomolecules engage with the dielectric material, resulting in fluctuations in the drain current. A twin metal gate architecture with laterally split dielectrics is employed to eliminate short-channel effects. The biosensor has exceptional sensitivity, attaining a peak drain current sensitivity of $2.5 \times 10$ cm2 for biomolecules such as albumin (k = 7). The gadget proficiently identifies biomolecules with varying dielectric constants and charge distributions, enabling adaptable label-free detection of diverse targets. The study examines the influence of dielectric constant on critical metrics such as Energy Band Diagrams, Drain Current, Drain Sensitivity, and subthreshold swing (SS). The overlap between the source and pocket regions, along with the introduction of an auxiliary gate, optimizes the electrical characteristics. Simulation results show that the proposed InP/AlGaAs VTFET achieves a maximum sensitivity of $3.5 \times 10 ^{3}$ , outperforming configurations without overlap ( $2 \times 10 ^{3}$ ), highlights the potential of proposed InP/AlGaAs VTFET for scalable, high-sensitivity, label-free biomolecule detection.

关键词： Biosensors Logic gates Sensitivity Tunneling Dielectric constant Performance evaluation Metals Biological system modeling TFETs Electrostatics

来源：评论

学校读者我要写书评

暂无评论

TTT-SEG: A Multi-structure Segmentation on Cardiac MRI using Vision Testing-time Training Network

TTT-SEG: A Multi-structure Segmentation on Cardiac MRI using...

引用

Medical Imaging 2025: Clinical and Biomedical Imaging

作者： Su, Vanessa Yuan, Xiaohan Pan, Shaoyan Hu, Mingzhe Chen, Xiaoqian Tian, Sibo Yang, Xiaofeng Department of Computer Science Emory University AtlantaGA United States Department of Radiation Oncology School of Medicine Emory University AtlantaGA United States Department of Computer Science and Informatics Emory University AtlantaGA United States Department of Biomedical Engineering Georgia Institute of Technology AtlantaGA United States

ISBN: (纸本)9781510685987

We propose TTT-SEG, a Test-Time Training Segmentation model, for automatic cardiac organ segmentation on MRIs. Manual contouring in MR imaging is time-consuming and labor-intensive, making automatic segmentation crucial for efficient therapy workflows. Despite advancements in Convolutional Neural Networks (CNNs) and Vision Transformer-based Networks achieving state-of-the-art accuracy, their performance is hindered by the lack of large-scale MRI datasets, leading to poor generalization on new patients. TTT-SEG addresses this issue by integrating a CNN with a novel learning-to-learn strategy. Our model features a dual-loop mechanism: a Reconstruction Learning Loop (RLL) for learning self-supervised features and an Adaptive Learning Loop (ALL) for segmentation features. Unlike the traditional networks, the RLL learns even during testing, improving segmentation accuracy for specific samples. Evaluating TTT-SEG on the Automated Cardiac Diagnosis Challenge (ACDC) dataset shows superior performance in segmenting the left and right ventricles and myocardium, outperforming methods like Vnet, nnUnet, SwinUNETR, and nnFormer. These results demonstrate TTT-SEG's potential to enhance cardiac organ segmentation and improve cardiac-related diagnosis and therapy workflows. © 2025 SPIE.

关键词： Electrocardiography

来源：评论

学校读者我要写书评

暂无评论

Analysis of the Performance of Transformers and Ensemble Schemes for Twitter US Airlines Sentiment Analysis 24

Analysis of the Performance of Transformers and Ensemble Sch...

引用

Proceedings of the 28th Pan-Hellenic Conference on Progress in Computing and informatics

作者： Konstantinos Kyritsis Isidoros Perikos Charalampos M. Liapis Vaggelis Kapoulas Michael Paraskevas Electrical and Computer Engineering University of the Peloponnese Patras Greece Computer Engineering and Informatics Department University of Patras Patras Greece and Computer Technology Institute and Press Diophantus Patras Greece Department of Mathematics University of Patras Patras Greece and Computer Technology Institute and Press Diophantus Patras Greece Computer Technology Institute and Press Diophantus Patras Greece Electrical and Computer Engineering University of the Peloponnese Patras Greece and Computer Technology Institute and Press Diophantus Patras Greece

来源：评论

学校读者我要写书评

暂无评论

A Convolutionaly-Informed XLM-RoBERTa for Classifying Short Text Inquires in Greek School Network 24

A Convolutionaly-Informed XLM-RoBERTa for Classifying Short ...

引用

Proceedings of the 28th Pan-Hellenic Conference on Progress in Computing and informatics

作者： Charalampos M. Liapis Isidoros Perikos Konstantinos Kyritsis Vaggelis Kapoulas Michael Paraskevas Department of Mathematics University of Patras Patras Greece and Computer Technology Institute and Press Diophantus Patras Greece Computer Engineering and Informatics Department University of Patras Patras Greece and Computer Technology Institute and Press Diophantus Patras Greece Electrical and Computer Engineering University of the Peloponnese Patras Greece Computer Technology Institute and Press Diophantus Patras Greece Electrical and Computer Engineering University of the Peloponnese Patras Greece and Computer Technology Institute and Press Diophantus Patras Greece

来源：评论

学校读者我要写书评

暂无评论

Exploring Children’s Strategies in Response to Robot’s Advice During a Group Task with iCub and Nao 16th

Exploring Children’s Strategies in Response to Robot’s A...

引用

16th International Conference on Social Robotics, ICSR + AI 2024

作者： Pusceddu, Giulia Sangineto, Mariapia Cocchella, Francesca Bogliolo, Michela Belgiovine, Giulia Lastrico, Linda Casadio, Maura Rea, Francesco Gena, Cristina Sciutti, Alessandra Robotics Brain and Cognitive Science Department Italian Institute of Technology Genoa Italy Department of Informatics Bioengineering Robotics and Systems Engineering University of Genoa Genoa Italy Department of Computer Science University of Turin Turin Italy Cognitive Architecture for Collaborative Technologies Unit Italian Institute of Technology Genoa Italy Scuola di Robotica Genoa Italy

ISBN: (纸本)9789819635184

This study investigates children’s trust in two humanoid robots, Nao and iCub, through a cooperative game designed to elicit spontaneous behaviors and group dynamics. We investigate whether participants change their choices after hearing advice from a robot, considering rounds where the advice is correct or incorrect, with the robot apologizing for its mistakes. Results reveal that, in most cases, participants prefer not to change their moves after the robot’s advice. Additionally, after the robots made mistakes, participants are less likely to actively follow their advice and more likely to reject it. No significant differences in strategies among the iCub and Nao samples are evidenced. Furthermore, we examine the influence of group dynamics, identifying "Proactive Players" who consistently initiated moves. A significant association between the strategies of this player and their teammates is found, suggesting potential influence. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

A Contend Node-Restricted Receiver-Initiated MAC Protocol With Consecutive Packet Transmission

IEEE Transactions on Green Communications and Networking

引用

IEEE Transactions on Green Communications and Networking 2025年

作者： Liu, Yuxin Ota, Kaoru Dong, Mianxiong Wang, Ruoyu Changsha University College of Computer Science and Engineering Changsha410022 China Muroran Institute of Technology Department of Sciences and Informatics Japan Central South University School of Computer Science and Engineering Changsha410083 China

The medium access control (MAC) protocol plays a crucial role in wireless communications, influencing key performance metrics, such as energy consumption, delay, collision, and throughput. This paper introduces the Contend Node Restricted Joint Consecutive Packet Transmissions Receiver-Initiated (CNR-CPT-RI) protocol, specifically designed to minimize collisions and reduce energy consumption in wake-up radio-enabled wireless sensor networks (WSNs). The CNR-CPT-RI protocol is an effective communication protocol that is mainly applied with nodes in the one-hop range of the sink. Since the sink has the ability to control each node, it becomes feasible to manage the nodes in a way that effectively reduces collisions and enhances network lifetime as well as throughput. Moreover, the CNR-CPT-RI protocol can adaptively adjust the number of nodes participating in channel contention, maintaining it within an optimal range to balance reduced collisions, decreased energy consumption, and sustained high throughput. Furthermore, the winning node in channel contention employs Consecutive Packet Transmissions (CPTs) method to further diminish competition. Comprehensive theoretical and experimental results demonstrate that the number of collisions of the CNR-CPT-RI protocol is only 42.4%, 35.9%, and 32.5% of the baseline protocol when the number of nodes is 10, 20, and 30, respectively. The energy consumption of the CNR-CPT-RI protocol is reduced by 5.7%, 15%, and 22.6%, and the delay is decreased by 6.7%, 16%, and 32%, respectively, compared with that of the existing protocol. © 2017 IEEE.

关键词： Internet protocols

来源：评论

学校读者我要写书评

暂无评论

Leveraging LLM in Genetic Programming Hyper-heuristics for Dynamic Microservice Deployment 37th

Leveraging LLM in Genetic Programming Hyper-heuristics for...

引用

37th Australasian Joint Conference on Artificial Intelligence, AJCAI 2024

作者： Fang, Zhengxin Ma, Hui Chen, Gang Hartmann, Sven Wang, Chen Centre for Data Science and Artificial Intelligence and School of Engineering and Computer Science Victoria University of Wellington Wellington New Zealand Department of Informatics Clausthal University of Technology Clausthal-Zellerfeld Germany National Institute of Water and Atmospheric Research Wellington New Zealand

ISBN: (纸本)9789819603473

Microservice deployment in cloud computing is a challenging combinatorial optimization problem due to the complex dependencies among microservices and the intricate trade-offs among different QoS requirements, e.g., minimizing Energy Consumption (EC) vs. minimizing Communication Overhead (CO). Recently, some hyper-heuristics methods, particularly Genetic Programming Hyper-Heuristics (GPHH), have been proposed to automatically generate heuristics for solving dynamic microservice deployment problems. Meanwhile, Large Language Models (LLMs) are becoming popular for solving various domain-specific problems thanks to their strong ability to learn problem-related knowledge. However, hybridizing GPHH with LLM by combining their abilities in solving complex optimization problems remains unexplored. In this paper, we propose an LLM-enhanced Genetic Programming Hyper-Heuristic (LLM-GPHH) algorithm to evolve heuristics for the dynamic deployment of applications composed of microservices, to jointly optimize EC and CO. Our experiments on real-world datasets demonstrate the effectiveness of the newly proposed LLM-GPHH. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Genetic programming

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Survey on Federated Learning Applications in Computational Mental Healthcare

引用

computer Modeling in engineering & Sciences 2025年第1期142卷 49-90页

作者： Vajratiya Vajrobol Geetika Jain Saxena Amit Pundir Sanjeev Singh Akshat Gaurav Savi Bansal Razaz Waheeb Attar Mosiur Rahman Brij B.Gupta Institute of Informatics and Communication University of DelhiDelhi110021India Maharaja Agrasen College University of DelhiDelhi110096India Computer Engineering Ronin InstituteMontclairNJ 07043USA Department of Research and Innovation Insights2TechinfoJaipur302001India University Centre for Research and Development(UCRD) Chandigarh UniversityChandigarh140413India Management Department College of Business AdministrationPrincess Nourah bint Abdulrahman UniversityRiyadh11671Saudi Arabia CCRI&Department of Computer Science and Information Engineering Asia UniversityTaichung413Taiwan Symbiosis Centre for Information Technology(SCIT) Symbiosis International UniversityPune411057India Center for Interdisciplinary Research University of Petroleum and Energy Studies(UPES)Dehradun248007India

Mental health is a significant issue worldwide,and the utilization of technology to assist mental health has seen a growing *** aims to alleviate the workload on healthcare professionals and aid *** applications have been developed to support the challenges in intelligent healthcare ***,because mental health data is sensitive,privacy concerns have *** learning has gotten some *** research reviews the studies on federated learning and mental health related to solving the issue of intelligent healthcare *** explores various dimensions of federated learning in mental health,such as datasets(their types and sources),applications categorized based on mental health symptoms,federated mental health frameworks,federated machine learning,federated deep learning,and the benefits of federated learning in mental health *** research conducts surveys to evaluate the current state of mental health applications,mainly focusing on the role of Federated Learning(FL)and related privacy and data security *** survey provides valuable insights into how these applications are emerging and evolving,specifically emphasizing FL’s impact.

关键词： Depression emotional recognition intelligent healthcare systems mental health federated learning stress detection sleep behaviour

来源：评论

学校读者我要写书评

暂无评论

Parameterized Saga of First-Fit and Last-Fit Coloring 42

Parameterized Saga of First-Fit and Last-Fit Coloring

引用

42nd International Symposium on Theoretical Aspects of computer Science, STACS 2025

作者： Agrawal, Akanksha Lokshtanov, Daniel Panolan, Fahad Saurabh, Saket Verma, Shaily Indian Institute of Technology Madras India University of California Santa BarbaraCA United States School of Computer Science University of Leeds United Kingdom The Institute of Mathematical Sciences HBNI Chennai India Department of Informatics University of Bergen Norway Algorithm Engineering Group Hasso Plattner Institute Potsdam Germany

ISBN: (纸本)9783959773652

The classic greedy coloring algorithm considers the vertices of an input graph G in a given order and assigns the first available color to each vertex v in G. In the Grundy Coloring problem, the task is to find an ordering of the vertices that will force the greedy algorithm to use as many colors as possible. In the Partial Grundy Coloring, the task is also to color the graph using as many colors as possible. This time, however, we may select both the ordering in which the vertices are considered and which color to assign the vertex. The only constraint is that the color assigned to a vertex v is a color previously used for another vertex if such a color is available. Whether Grundy Coloring and Partial Grundy Coloring admit fixed-parameter tractable (FPT) algorithms, algorithms with running time f(k)nO(1), where k is the number of colors, was posed as an open problem by Zaker and by Effantin et al., respectively. Recently, Aboulker et al. (STACS 2020 and Algorithmica 2022) resolved the question for Grundy Coloring in the negative by showing that the problem is W[1]-hard. For Partial Grundy Coloring, they obtain an FPT algorithm on graphs that do not contain Ki,j as a subgraph (a.k.a. Ki,j-free graphs). Aboulker et al. re-iterate the question of whether there exists an FPT algorithm for Partial Grundy Coloring on general graphs and also asks whether Grundy Coloring admits an FPT algorithm on Ki,j-free graphs. We give FPT algorithms for Partial Grundy Coloring on general graphs and for Grundy Coloring on Ki,j-free graphs, resolving both the questions in the affirmative. We believe that our new structural theorems for partial Grundy coloring and "representative-family" like sets for Ki,j-free graphs that we use in obtaining our results may have wider algorithmic applications. © Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, and Shaily Verma.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：