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

Energy Oriented Three-Tier Computation Offloading Scheme in Maritime Edge Computing Network

IEEE Transactions on Vehicular Technology 2025年第5期74卷 8126-8140页

作者： Zhang, Hongxia Xi, Shiyu Shang, Bodong Zhang, Peiying Wu, Sheng Jiang, Chunxiao Qingdao Institute of Software College of Computer Science and Technology Qingdao266580 China Eastern Institute of Technology Eastern Institute for Advanced Study Ningbo315200 China Beijing University of Posts and Telecommunications School of Information and Communication Engineering Beijing100876 China Tsinghua University Beijing National Research Center for Information Science and Technology Beijing100084 China

With the development of maritime continuing to grow, large-scale maritime wireless devices (MWDs) are being deployed for various maritime applications. The rapid development of maritime Internet of Things (IoT) and growing demand for these applications have led to an increasing number of computation-intensive and resource-sensitive tasks. Considering the limited computing capacity and energy of MWDs, it is challenging to transmit and process massive maritime computing tasks in an energy efficient manner. In this paper, we propose a three-tier maritime edge computing system in which low earth orbit (LEO) satellite and offshore base station (OBS) support to provide communication and computing services for MWDs. The system optimizes association variable, task partitioning, transmission power, and computing resource allocation to reduce system energy consumption under latency constraints. The optimization problem is formulated as a mixed integer non-linear programming (MINLP) optimization problem. We decompose the original problem into four subproblems and design algorithms to solve them. Firstly, the association variable optimization subproblem is solved by slack variable method. Then, we adopt quadratic transformation and design a difference of convex algorithm to solve transmission power optimization subproblem. Further, task partitioning subproblem is solved by obtaining upper and lower bounds of offloading task size by strict deduction, and then solved by the standard convex method. Finally, Lagrangian dual method is utilized to deal with joint computing resource optimization subproblem of LEO satellite and OBS. In simulation results, the proposed algorithm saves 39.3% of system energy consumption compared to benchmark schemes. © 1967-2012 IEEE.

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

IoT-Supported Indoor Navigation System Using Machine Learning Technique 12th

IoT-Supported Indoor Navigation System Using Machine Learnin...

引用

12th International Conference on Recent Trends in Computing, ICRTC 2024

作者： Christy Jeba Malar, A. Deva Priya, M. Bhuvana, S. Vidhya, K. Sudharsan, S. Suhita, S. Department of Information Technology Sri Krishna College of Technology Tamilnadu Coimbatore India Department of Computer Science and Engineering Karpagam College of Engineering Tamilnadu Coimbatore India School of Computer Science Engineering and Information Systems Vellore Institute of Technology Vellore India

ISBN: (纸本)9789819788354

Indoor Navigation System (INS) supports seamless movement of objects within confined spaces in smart environments. In this paper, a novel INS that relies on ESP32-based Received Signal Strength Indication (RSSI) measurements for precise estimation of distance using K-Nearest Neighbour (K-NN) algorithm is proposed. The system architecture includes three ESP32 nodes functioning as clients, and ESP8266 combined with ESP32 acting as a server. To overcome the limitations of Global Positioning System (GPS) within an indoor environment, Machine Learning (ML)-based prediction models are employed to estimate distance between nodes and predict user locations along with the distance between source and destination. This approach not only addresses the challenges posed by GPS in indoor settings, but also shows the potential of ESP32 devices and predictive algorithms for enhancing navigation accuracy and reliability. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Global positioning system

来源：评论

学校读者我要写书评

暂无评论

Ecology, Spatial Structure, and Selection Pressure Induce Strong Signatures in Phylogenetic Structure

引用

Artificial life 2025年第2期31卷 129-152页

作者： Moreno, Matthew Andres Rodriguez-Papa, Santiago Dolson, Emily University of Michigan Department of Ecology and Evolutionary Biology Center for the Study of Complex Systems Michigan Institute for Data and AI in Society Michigan State University Department of Computer Science and Engineering Michigan State University Department of Computer Science and Engineering Program in Ecology Evolution Behavior

Evolutionary dynamics are shaped by a variety of fundamental, generic drivers, including spatial structure, ecology, and selection pressure. These drivers impact the trajectory of evolution and have been hypothesized to influence phylogenetic structure. For instance, they can help explain natural history, steer behavior of contemporary evolving populations, and influence the efficacy of application-oriented evolutionary optimization. Likewise, in inquiry-oriented Artificial Life systems, these drivers constitute key building blocks for open-ended evolution. Here we set out to assess (a) if spatial structure, ecology, and selection pressure leave detectable signatures in phylogenetic structure;(b) the extent, in particular, to which ecology can be detected and discerned in the presence of spatial structure;and (c) the extent to which these phylogenetic signatures generalize across evolutionary systems. To this end, we analyze phylogenies generated by manipulating spatial structure, ecology, and selection pressure within three computational models of varied scope and sophistication. We find that selection pressure, spatial structure, and ecology have characteristic effects on phylogenetic metrics, although these effects are complex and not always intuitive. Signatures have some consistency across systems when using equivalent taxonomic unit definitions (e.g., individual, genotype, species). Furthermore, we find that sufficiently strong ecology can be detected in the presence of spatial structure. We also find that, while low-resolution phylogenetic reconstructions can bias some phylogenetic metrics, high-resolution reconstructions recapitulate them faithfully. Although our results suggest a potential for evolutionary inference of spatial structure, ecology, and selection pressure through phylogenetic analysis, further methods development is needed to distinguish these drivers' phylometric signatures from each other and to appropriately normalize phylogenetic metrics.

关键词： agent-based simulation Artificial Life Ecology evolution evolutionary dynamics phylogenetic analysis phylogeny metrics

来源：评论

学校读者我要写书评

暂无评论

High-accuracy face recognition with the MRYOLO-SCO algorithm: combining residual networks and YOLOv2 for improved precision

引用

Signal, Image and Video Processing 2025年第7期19卷 1-12页

作者： Ettiyappan, Anitha palani, Hari kumar Duraipandian, Kavitha Selvaganapathy, Nandhini Department of Information Technology Loyola - ICAM College of Engineering and Technology Nungambakkam Chennai600034 India Department of Computer Science and Engineering MIT School of Computing MIT Art Design and Technology University Loni Kalbhor Pune India Department of computer science and engineering Sathyabama Institute of Science and Technology Chennai India Department of Data Science and Business Systems SRM Institute of Science and Technology Kattankulathur Chengalpattu603203 India

Face recognition in real-world scenarios presents significant challenges due to variations in lighting conditions, occlusions, pose changes, and low-resolution images. To address these challenges, this study proposes a Modified Residual YOLO Network-based Single Candidate Optimization algorithm, which integrates a Modified Residual Network with YOLOv2 to improve recognition accuracy while maintaining computational efficiency. Unlike conventional YOLO models, the proposed framework introduces bipolar feature extraction, enabling the network to capture both high-level global features and low-level local details, thus improving robustness against occlusions and illumination variations. Atailored cost function is introduced to minimize bounding box localization errors and classification inaccuracies, incorporating weighted penalties to enhance model precision. Additionally, a Single Candidate Optimization algorithm is employed to fine-tune hyperparameters, ensuring faster convergence and lower computational complexity. The performance of the proposed technique is evaluated using the benchmark datasets and the simulation results that the proposed framework outperforms existing YOLO-based models, achieving an accuracy of 98.8%, a recall of 98.0%, and an F1-score of 98.1%while maintainingalower computational cost than YOLOv3, YOLOv4, and YOLOv5. The experimental results also indicate that the tailored cost function reduces misclassification errors by 6.1% and accelerates convergence by 20%, making the proposed framework highly suitable for real-time face recognition applications in resource-constrained environmentssuch asIoT-based surveillance and smart security systems. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of various classification algorithms for providing competency training to workplace risk prevention

引用

Multimedia Tools and Applications 2025年第15期84卷 15123-15149页

作者： Garg, Shruti Murugan, Prabhu Manimaran, A. Sundar, Ramesh Dakshinamoorthy, Prabakar Rajaram, Gnanajeyaraman Birla Institute of Technology Ranchi Mesra India Department of ECE Saveetha School of Engineering Saveetha Institute of Medical and Technical Sciences Saveetha University Chennai602105 India Department of Computer Science and Engineering Saveetha School of Engineering Saveetha Institute of Medical and Technical Sciences Saveetha University Chennai602105 India Department of Networking and Communication School of Computing SRM Institute of Science and Technology SRM Nagar Kattankulathur India Department of Data Science and Business Systems School of Computing SRM Institute of Science and Technology SRM Nagar Kattankulathur India

In the workplace, risk prevention helps detect the risks and prevent accidents. To achieve this, workers' mental and physical parameters related to their health should be focused on and analyzed. It helps improve the workers' mental health and thus improves organizational performance. There are a lot of mental illnesses due to excess work and a lack of professional knowledge. It affects the performance of the worker. So, the organization needs to conduct competency training programs to improve their professional skills and the mindset to tackle the work pressure. There are several competency training programs given in various organizations to mold the workers, and it considerably reduces workplaces risks. Competency training in the workplace teaches integrity, honesty, managerial skills, and other workers. Developing organizational skills is the primary concern in this competency training. This paper enabled one of the best machine learning algorithms to be chosen to predict the hazards in the workplace and provide a healthy environment to the workers. For that, several classification methods such as Logistic Regression, Decision trees, AdaBoost classifier, Random Forest, Gradient Boosting classifier, and XGBoost classifier are implemented experimented with, and the performance is verified with python software. From the comparison, it has been found that the XGBoost classifier is selected as the best classifier and identified that it is highly suitable for analyzing and predicting workplace risks data. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Occupational risks

来源：评论

学校读者我要写书评

暂无评论

Minimum Initial Marking Estimation in Labeled Petri Nets Using Minimum Token Number Prediction

引用

IEEE Transactions on Automatic Control 2025年第5期70卷 3296-3302页

作者： Yue, Hao Xu, Yakun Hu, Hesuan Wu, Weimin Li, Lingxi College of Computer Science and Technology Qingdao266580 China Xidian University School of Electro-Mechanical Engineering Xi'an710071 China Nanyang Technological University School of Computer Science and Engineering College of Engineering 639798 Singapore Zhejiang University State Key Laboratory of Industrial Control Technology Hangzhou310027 China Zhejiang University Institute of Cyber-Systems and Control Hangzhou310027 China Purdue University Elmore Family School of Electrical and Computer Engineering College of Engineering IndianapolisIN46202 United States

This article proposes an approach to addressing the problem of minimum initial marking (MuIM) estimation for labeled Petri nets (LPNs). We introduce the important concept of a label synthesis net for LPNs and develop a method for predicting the minimum number of tokens. By using this prediction method, we develop an algorithm that has polynomial complexity in the length of the observed label sequence for estimating MuIMs. An illustrative example is provided to show the effectiveness and efficiency of our proposed approach. Moreover, experimental results demonstrate its advantage over existing work. Finally, we provide a comparison of some representative studies in the literature for MuIM estimation. © 1963-2012 IEEE.

关键词： Discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

YFLM: An Improved Levenberg-Marquardt Algorithm for Global Bundle Adjustment 41st

YFLM: An Improved Levenberg-Marquardt Algorithm for Global ...

引用

41st computer Graphics International Conference, CGI 2024

作者： Peng, Jiaxin Li, Tao Jiang, Qin Liu, Jie Wang, Ruibo Laboratory of Software Engineering for Complex Systems School of Computer Science National University of Defense Technology Hunan Changsha410073 China Parallel and Distributed Processing Laboratory School of Computer Science National University of Defense Technology Hunan Changsha410073 China

ISBN: (纸本)9783031820205

The conventional Levenberg-Marquardt (LM) algorithm is a state-of-the-art trust-region optimization method for solving bundle adjustment problems in the Structure-from-Motion community, which not only takes advantage of the fast convergence of the Gauss-Newton method, but also the stability of the gradient descent method when approaching optimal solutions. However, the damping ratio of LM is simply provided by trial-and-error, which causes slow convergence rate for large-scale problems. This paper proposes the Yamashita-Fukushima LM (YFLM) algorithm to reduce the time complexity for global bundle adjustment, where the damping factor is determined by Yamashita and Fukushima’s method. YFLM dynamically calculates a more reasonable and optimal damping ratio according to the newest reprojection error. The experimental results show that the YFLM algorithm outperforms the conventional LM algorithm for most public bundle adjustment datasets. Besides this, the convergence of the YFLM algorithm is also evaluated with different σ∈(0,2]. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Damping

来源：评论

学校读者我要写书评

暂无评论

Fractal dimension analysis for improved decision-making in non-stationary multi-arm bandit problems: a machine learning approach

引用

The European Physical Journal Special Topics 2025年 1-16页

作者： Nandhini, S. Kala Pandian, J. Arun Department of Computer Applications School of Computer Science Engineering and Information Systems Vellore Institute of Technology Vellore India School of Computer Science Engineering and Information Systems Vellore Institute of Technology Vellore India

In this research, we propose a novel approach to addressing the exploration–exploitation dilemma in multi-armed bandit (MAB) algorithms using fractal dimensions. The fractal dimension is used in the algorithms to represent the reward distributions of arms which represents the uncertainty of the arm in receiving the reward. The fractal dimension of the reward distribution is implemented in the most popular MAB optimization algorithms, such as Epsilon-Greedy, Upper Confidence Bound (UCB), Exponential-weight algorithm for Exploration and Exploitation (EXP3), and Thompson Sampling in this study. The algorithm prefers to choose arm with the least fractal dimension, as a lower fractal dimension represents less uncertainty of the arm. The performance of the fractal-enhanced MAB optimization algorithms is compared with traditional algorithms in non-stationary environments with various numbers of arms. The proposed approach provides a novel way to quantify and utilize the uncertainty of each arm in MAB problems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MPNAS: Multimodal Sentiment Analysis Pruning via Neural Architecture Search

MPNAS: Multimodal Sentiment Analysis Pruning via Neural Arch...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Zhang, Binyan Ren, Ao Zhang, Zihao Duan, Moming Liu, Duo Tan, Yujuan Zhong, Kan College of Computer Science Chongqing University Chongqing China School of Big Data Software & Engineering Chongqing University Chongqing China Institute of Data Science National University of Singapore Singapore

ISBN: (纸本)9798350368741

With the rapid development of social media, sentiment analysis from multimodal posts has garnered significant attention in recent years. However, the substantial size of these models impedes their deployment on resource-constrained embedded devices. Although pruning has been extensively studied to reduce the size of unimodal models, specific challenges remain for Multimodal Sentiment Analysis (MSA) models. First, existing techniques prune fixed original models into sparse models, while our findings indicate that different model architectures of identical size yield varying performance outcomes. Second, prior studies fail to explore the unique characteristics of MSA models, resulting in suboptimal pruning performance. To address these challenges, we propose MPNAS, a unified pruning framework via Neural Architecture Search (NAS) for MSA models. Specifically, we formulate pruning as a NAS problem and analyze MSA model characteristics to guide the subnet search. We conduct an initial coarse-grained NAS on the original model, expanding the search space slightly to identify suitable subnets that enhance pruning rates and accuracy. Subsequently, we refine coarse-grained subnets in a fine-grained NAS stage, where MSA model characteristics guide the search process. Extensive experiments on three representative datasets demonstrate the superiority of our approach over existing methods. © 2025 IEEE.

关键词： Multimodal Compression NAS

来源：评论

学校读者我要写书评

暂无评论

An Online Integrated Development Environment for Automated Programming Assessment systems 17

An Online Integrated Development Environment for Automated P...

引用

17th International Conference on computer Supported Education, CSEDU 2025

作者： Frankford, Eduard Crazzolara, Daniel Vierhauser, Michael Meißner, Niklas Krusche, Stephan Breu, Ruth University of Innsbruck Department of Computer Science Austria University of Stuttgart Institute of Software Engineering Germany Technical University of Munich School of Computation Information and Technology Germany

ISBN: (纸本)9789897587467

The increasing demand for programmers has led to a surge in participants in programming courses, making it increasingly challenging for instructors to assess student code manually. As a result, automated programming assessment systems (APASs) have been developed to streamline this process. These APASs support lecturers by managing and evaluating student programming exercises at scale. However, these tools often do not provide feature-rich online editors compared to their traditional integrated development environments (IDEs) counterparts. This absence of key features, such as syntax highlighting and autocompletion, can negatively impact the learning experience, as these tools are crucial for effective coding practice. To address this gap, this research contributes to the field of programming education by extracting and defining requirements for an online IDE in an educational context and presenting a prototypical implementation of an open-source solution for a scalable and secure online IDE. The usability of the new online IDE was assessed using the Technology Acceptance Model (TAM), gathering feedback from 27 first-year students through a structured survey. In addition to these qualitative insights, quantitative measures such as memory (RAM) usage were evaluated to determine the efficiency and scalability of the tool under varying usage conditions. Copyright © 2025 by SCITEPRESS - science and Technology Publications, Lda.

关键词： Teaching

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：