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

3rd International Conference on Integrated Circuits and Communication Systems, ICICACS 2025

作者： Mahendran, A. Nalla, Sridhar Babu Trivedi, Lalit Mohan Mohankumar, S. Williams, D.R. Mohan Renuka, Manne Sona College of Arts and Science Department of Computer Science Salem India Sr University Department of Computer Science and Engineering Hyderabad India Moradabad Institute of Technology Department of Ash Mathematics Moradabad India Erode Sengunthar Engineering College Department of Computer Science and Engineering Perundurai India College of Computing and Information Sciences University of Technology and Applied Science-Sohar Department of Information Technology Sohar Oman Vidya Jyothi Institute of Technology Department of Electronics and Communication Engineering Hyderabad India

ISBN: (纸本)9798331508456

Medical treatment costs are rising for many reasons. These include an increasing world population, an aging population, greater healthcare needs, more diseases, and inflation. With AI's emergence in navigation, voice recognition, image lesion segmentation, ride-sharing, and smartphone personal assistants, the healthcare industry has quickly adopted it. Initial preprocessing includes standardization, missing values, and discarding anomalies. Next, the model is trained using the obtained features. Spearman correlation, a rank-based nonparametric statistic, can quantify monotonic correlation strength and direction. Even with missing values, the Graph Convolutional Network (GCN) performs well in model training. The suggested model outperformed state-of-the-art alternatives with 93.48% accuracy. It outperformed TransLSTM and GraphSAGE on complex datasets. This research stresses the system's ability to improve healthcare forecast accuracy through preprocessing, feature extraction, and GCN model training. Results show that AI can improve healthcare analytics despite lacking data. © 2025 IEEE.

关键词： Patient treatment

来源：评论

学校读者我要写书评

暂无评论

Brain-O-Vision: Brain Tumor Detection 1st

Brain-O-Vision: Brain Tumor Detection

引用

1st International Research Conference on computing Technologies for Sustainable Development, IRCCTSD 2024

作者： Angelin Claret, S.P. Datta, Swati Kwatra, Ish Department of Computational Intelligence Faculty of Engineering and Technology School of Computing SRM Institute of Science and Technology Kattankulathur Tamil Nadu Chengalpattu India

ISBN: (纸本)9783031823886

Sophisticated methods utilizing deep learning neural networks have surfaced as viable options for precise and automated brain tumor identification. This study, which employed use of MobileNetV2, EfficientNet, ResNet50 and VGG16 for the comparitive analysis and select the one which gives highest accuracy. We address the need for more advanced diagnostic techniques by automatically extracting pertinent characteristics from MRI scans and making accurate predictions using deep learning and Grad-Cam segmentation. Our approach entails preprocessing MRI data, CNN architecture design, and model training and assessment with dataset. Our methodology is successful, as seen by the accuracies of MobileNetV2 at 86%, EfficientNet at 84%, ResNet50 at 80%, VGG16 at 88%. The Grad-Cam segmentation performed at the final stage helps in identifying the presence of tumor. All things considered, this study advances the area of medical image analysis and emphasizes how critical it is to use MRI and deep learning to combat brain cancers. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

The impact of dwell time on the contextual effect of visual and passive lead-in movements

引用

Journal of Neurophysiology 2025年第5期133卷 1520-1537页

作者： Alvarez-Hidalgo, Laura Franklin, David W. Howard, Ian S. School of Computing Engineering and Mathematics University of Plymouth Plymouth United Kingdom Neuromuscular Diagnostics TUM School of Medicine and Health Technical University of Munich Munich Germany Munich Institute of Robotics and Machine Intelligence (MIRMI) Technical University of Munich Munich Germany Munich Data Science Institute (MDSI) Technical University of Munich Munich Germany

Contextual cues arising from distinct movements are crucial in shaping control strategies for human movement. Here, we examine the impact of visual and passive lead-in movement cues on unimanual motor learning, focusing on the influence of “dwell time,” where two-part movements are separated by the interval between the end of the first movement and the start of the second. We used a robotic manipulandum to implement a point-to-point interference task with switching opposing viscous curl fields in male and female human participants. Consistent with prior research, in both visual and passive lead-in conditions, participants showed significant adaptation to opposing dynamics with short dwell times. As dwell time increased for both visual and passive signals, past movement information had less contextual influence. However, the efficacy of visual movement cues declined more rapidly as dwell times increased. At dwell times greater than 800 ms, the contextual influence of prior visual movement was small, whereas the effectiveness of passive lead-in movement was found to be significantly greater. This indicates that the effectiveness of sensory movement cues in motor learning is modality dependent. We hypothesize that such differences may arise because proprioceptive signals directly relate to arm movements, whereas visual inputs exhibit longer latency and, in addition, can relate to many aspects of movement in the environment and not just to our own arm movements. Therefore, the motor system may not always find visual movement cues as relevant for predictive control of dynamics. Copyright © 2025 The Authors.

关键词： dynamic learning lead-in context motor memory predictive compensation temporal decay

来源：评论

学校读者我要写书评

暂无评论

Time parallelization for hyperbolic and parabolic problems

arXiv

引用

arXiv 2025年

作者： Gander, Martin J. Wu, Shu-Lin Zhou, Tao Department of Mathematics University of Geneva CP64 Geneva 41211 Switzerland School of Mathematics and Statistics Northeast Normal University Changchun130024 China Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences China

Time parallelization, also known as PinT (Parallel-in-Time) is a new research direction for the development of algorithms used for solving very large scale evolution problems on highly parallel computing architectures. Despite the fact that interesting theoretical work on PinT appeared as early 1964, it was not until 2004, when processor clock speeds reached their physical limit, that research in PinT took off. A distinctive characteristic of parallelization in time is that information flow only goes forward in time, meaning that time evolution processes seem necessarily to be sequential. Nevertheless, many algorithms have been developed over the last two decades to do PinT computations, and they are often grouped into four basic classes according to how the techniques work and are used: shooting-type methods;waveform relaxation methods based on domain decomposition;multigrid methods in space-time;and direct time parallel methods. However, over the past few years, it has been recognized that highly successful PinT algorithms for parabolic problems struggle when applied to hyperbolic problems. We focus in this survey therefore on this important aspect, by first providing a summary of the fundamental differences between parabolic and hyperbolic problems for time parallelization. We then group PinT algorithms into two basic groups: the first group contains four effective PinT techniques for hyperbolic problems, namely Schwarz Waveform Relaxation with its relation to Tent Pitching;Parallel Integral Deferred Correction;ParaExp;and ParaDiag. While the methods in the first group also work well for parabolic problems, we then present PinT methods especially designed for parabolic problems in the second group: Parareal: the Parallel Full Approximation Scheme in Space-Time;Multigrid Reduction in Time;and Space-Time Multigrid. We complement our analysis with numerical illustrations using four time-dependent PDEs: the heat equation;the advection-diffusion equation;Burgers’ equa

关键词： Wave equations

来源：评论

学校读者我要写书评

暂无评论

Estimating Soil Organic Carbon from Multispectral Images Using Physics-Informed Neural Networks 17th

Estimating Soil Organic Carbon from Multispectral Images Us...

引用

17th Asian Conference on Computer Vision, ACCV 2024

作者： Sargeant, James Wei Teng, Shyh Murshed, Manzur Paul, Manoranjan Brennan, David Institute of Innovation Science and Sustainability Federation University Ballarat Australia School of Information Technology Deakin University Burwood Australia School of Computing Mathematics and Engineering Charles Sturt University BathurstNSW2795 Australia Wimmera Catchment Management Authority Horsham Australia

ISBN: (纸本)9789819609628

Understanding the amount of Soil Organic Carbon (SOC) at farm and field scale is a necessary precursor to effective management, important for both agricultural productivity and to reduce CO2 emissions. To avoid the prohibitive cost of measurement, SOC can be estimated by using multispectral images. In this study, we propose a novel Physics-Informed Convolutional Neural Network (CNN) to model well-known but noisy relationship between a soil index and SOC using the network’s loss function. This study is also conducted by resampling the European Land Use/Classification Area Survey (LUCAS) dataset to Sentinel-2 bands. Our experimental results show that our proposed network converges more quickly, has a lower root mean squared error (RMSE) and is more robust (as measured by the standard deviation of RMSE over multiple trials) than a compatible standard CNN. The operation of the novel Physics-Informed CNN is explained in terms of the components of the loss function. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Carbon sequestration

来源：评论

学校读者我要写书评

暂无评论

LLM in the Loop: A Framework for Contextualizing Counterfactual Segment Perturbations in Point Clouds

引用

IEEE Access 2025年 13卷 85507-85525页

作者： Kočić, Veljka Lukač, Niko Rožajac, Dž Schweng, Stefan Gollob, Christoph Nothdurft, Arne Stampfer, Karl Ser, Javier Del Holzinger, Andreas University of Natural Resources and Life Sciences Vienna Human-Centered AI Lab Institute of Forest Engineering Department of Ecosystem Management Climate and Biodiversity Vienna1190 Austria TU Graz Institute of Human-Centered Computing Graz8010 Austria University of Maribor Faculty of Electrical Engineering and Computer Science Maribor2000 Slovenia Institute of Forest Growth Department of Ecosystem Management Climate and Biodiversity University of Natural Resources and Life Sciences Vienna Vienna1190 Austria TECNALIA Derio48160 Spain Department of Mathematics Leioa48940 Spain

Point Cloud Data analysis has seen a major leap forward with the introduction of PointNet algorithms, revolutionizing how we process 3D environments. Yet, despite these advancements, key challenges remain, particularly in optimizing segment perturbations to influence model outcomes in a controlled and meaningful way. Traditional methods struggle to generate realistic and contextually appropriate perturbations, limiting their effectiveness in critical applications like autonomous systems and urban planning. This paper takes a bold step by integrating Large Language Models into the counterfactual reasoning process, unlocking a new level of automation and intelligence in segment perturbation. Our approach begins with semantic segmentation, after which LLMs intelligently select optimal replacement segments based on features such as class label, color, area, and height. By leveraging the reasoning capabilities of LLMs, we generate perturbations that are not only computationally efficient but also semantically meaningful. The proposed framework undergoes rigorous evaluation, combining human inspection of LLM-generated suggestions with quantitative analysis of semantic classification model performance across different LLM variants. By bridging the gap between geometric transformations and high-level semantic reasoning, this research redefines how we approach perturbation generation in Point Cloud Data analysis. The results pave the way for more interpretable, adaptable, and intelligent AI-driven solutions, bringing us closer to real-world applications where explainability and robustness are paramount. © 2013 IEEE.

关键词： k-nearest neighbors

来源：评论

学校读者我要写书评

暂无评论

Comments and extensions on "State-equivalent form and minimum-order compensator design for rectangular descriptor systems"

arXiv

引用

arXiv 2025年

作者： Shi, Shuo Zhang, Juan Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing Ministry of Education School of Mathematics and Computational Science Xiangtan University Xiangtan411105 China

This technical note presents a counterexample showing that the equivalence conditions proposed by Geng et al. (IEEE Trans. Automat. Control, 2024), which use a minimum-order compensator (MOC) to achieve desired designs, including generalized regularity or both generalized regularity and free of impulse, are sufficient but not necessary. Furthermore, revised equivalence conditions are introduced, along with an equivalence condition ensuring the closed-loop system remains generalized regular, impulse-free, and stable using MOC. Additionally, it is shown that output feedback can replace the MOC, achieving the same design without increasing dimensionality. These findings are validated through a circuit *** Codes 93B05, 93B52, 15A03 Copyright © 2025, The Authors. All rights reserved.

关键词： Feedback

来源：评论

学校读者我要写书评

暂无评论

THREE-PRECISION ITERATIVE REFINEMENT WITH PARAMETER REGULARIZATION AND PREDICTION FOR SOLVING LARGE SPARSE LINEAR SYSTEMS

arXiv

引用

arXiv 2025年

作者： Ge, Jifeng Zhang, Juan Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Hunan KeyLaboratory for Computation and Simulation in Science and Engineering School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China

This study presents a novel mixed-precision iterative refinement algorithm, GADI-IR, within the general alternating-direction implicit (GADI) framework, designed for efficiently solving large-scale sparse linear systems. By employing low-precision arithmetic, particularly half-precision (FP16), for computationally intensive inner iterations, the method achieves substantial acceleration while maintaining high numerical accuracy. Key challenges such as overflow in half-precision and convergence issues for low precision are addressed through careful backward error analysis and the application of a regularization parameter α. Furthermore, the integration of low-precision arithmetic into the parameter prediction process, using Gaussian Process Regression (GPR), significantly reduces computational time without degrading performance. The method is particularly effective for large-scale linear systems arising from discretized partial differential equations and other high-dimensional problems, where both accuracy and efficiency are critical. Numerical experiments demonstrate that the use of mixed-precision strategies not only accelerates computation but also ensures robust convergence, making the approach advantageous for various applications. The results highlight the potential of leveraging lower-precision arithmetic to achieve superior computational efficiency in high-performance computing. © 2025, CC BY.

关键词： Convergence of numerical methods

来源：评论

学校读者我要写书评

暂无评论

An Overview of Security Threats, Attack Detection and Defense for Large-Scale Multi-Agent Systems (LSMAS) in Internet of Things (IoT)

IEEE Transactions on Industrial Cyber-Physical Systems

引用

IEEE Transactions on Industrial Cyber-Physical Systems 2025年 3卷 70-81页

作者： Cai, Jijing Wen, Long Feng, Hailin Fang, Kai Chen, Junxin Wei, Wei Wang, Wei Zhejiang A and F University College of Mathematics and Computer Science Hangzhou311300 China Macau University of Science and Technology School of Innovation Engineering Macau999078 China Dalian University of Technology School of Software Dalian116621 China Xi'an University of Technology School of Computer Science and Engineering Xi'an710048 China Beijing Institute of Technology School of Medical Technology Beijing100081 China Artificial Intelligence Research Institute Shenzhen MSU-BIT University Guangdong-Hong Kong-Macao Joint Laboratory for Emotion Intelligence and Pervasive Computing Shenzhen518172 China

With the global advancement of the Internet of Things (IoT), large-scale multi-agent systems (LSMAS) technology has been increasingly adopted across various industries. Despite the widespread use of IoT, vulnerabilities in its software and hardware components pose significant challenges to ensuring security. To address the security concerns faced by LSMAS, this article explores its application in IoT domains such as smart grids, smart manufacturing, and smart healthcare. By examining the structural layers of IoT-the perception layer, network layer, and application layer-this paper analyzes the specific security threats encountered by each layer, along with the defense strategies designed to counter these attacks. Furthermore, we categorize and compare both traditional and AI-based attack detection methods, dividing the latter into machine learning-based, deep learning-based, and transfer learning-based approaches. This analysis highlights the strengths and weaknesses of the various attack detection methods currently deployed in LSMAS, identifying the existing challenges they face. Finally, we outline potential trends for the future development of LSMAS in IoT, offering research directions for experts in related fields. © 2023 IEEE.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Admissibly Randomized Coordinate Descent Methods for computing Extreme Eigenpairs of Symmetric Matrices

引用

Numerical Linear Algebra with Applications 2025年第2期32卷

作者： Bai, Zhong-Zhi Chen, Yan-Qi State Key Laboratory of Mathematical Sciences State Key Laboratory of Scientific/Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China School of Mathematical Sciences University of Chinese Academy of Sciences Beijing China

For solving symmetric eigenvalue problems of extremely large matrices that cannot be stored in a whole in the computer memory, we propose a class of admissibly randomized coordinate descent methods by minimizing the corresponding Rayleigh quotients. These iteration methods only call of and operate on a column of the matrix at each of their iteration steps, so they require a small computer memory and have a small computational complexity. We analyze the convergence property of these admissibly randomized coordinate descent methods and confirm their implemental effectiveness by numerical experiments. © 2025 John Wiley & Sons Ltd.

关键词： convergence property coordinate descent method randomized iteration symmetric eigenvalue problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：