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

20th International Joint Conference on computer science and Software Engineering, JCSSE 2023

作者： Mekruksavanich, Sakorn Jitpattanakul, Anuchit School of Information and Communication Technology University of Phayao Department of Computer Engineering Thailand King Mongkut's University of Technology North Bangkok Intelligent and Nonlinear Dynamic Innovations Research Center Faculty of Applied Science Department of Mathematics Bangkok Thailand

ISBN: (纸本)9798350300505

The field o f human activity recognition (HAR) is a priority for cutting-edge study because of its potential to revolutionize the way we understand and improve our everyday lives. A large variety of ordinary, everyday tasks has been classified using H AR. Nevertheless, inc ontrast to basic human actions, the increasing demands of numerous real-world applications have attracted the interest of the HAR area of study. Electrical line workers (ELWs) face a variety of challenges, including long hours, working in isolated locations, and performing particularly hazardous tasks. Wearable sensor-based HAR allows for unobtrusive tracking of ELW efficiency and security. This study explores deep learning strategies for automatically categorizing ELWs' complicated actions through sensor data collected through a wrist-worn device. We propose ResNeXt, a deep residual neural network, and evaluate it with other deep learning networks for their ability to categorize ELW activities effectively. We employ a publicly available benchmark dataset that includes 10 ELW tasks. The results of the experiment demonstrate that the proposed ResNeXt achieved the highest accuracy (98.74%) and F1-score (98.81%) compared to other deep learning networks studied. © 2023 IEEE.

关键词： Wearable sensors

来源：评论

学校读者我要写书评

暂无评论

Automated File Labeling for Heterogeneous Files Organization Using Machine Learning

引用

computers, Materials & Continua 2023年第2期74卷 3263-3278页

作者： Sagheer Abbas Syed Ali Raza MAKhan Muhammad Adnan Khan Atta-ur-Rahman Kiran Sultan Amir Mosavi School of Computer Science National College of Business Administration&EconomicsLahore54000Pakistan Department of Computer Science GC University LahorePakistan Riphah School of Computing&Innovation Faculty of ComputingRiphah International UniversityLahore CampusLahore54000Pakistan Department of Software Pattern Recognition and Machine Learning LabGachon UniversitySeongnam13120Korea Department of Computer Science College of Computer Science and Information Technology(CCSIT)Imam Abdulrahman Bin Faisal University(IAU)P.O.Box 1982Dammam31441Saudi Arabia Department of CIT The Applied CollegeKing Abdulaziz UniversityJeddah31261Saudi Arabia John von Neumann Faculty of Informatics Obuda UniversityBudapest1034Hungary Institute of Information Engineering Automation and MathematicsSlovak University of Technology in BratislavaBratislava81107Slovakia Faculty of Civil Engineering TU-DresdenDresden01062Germany

File labeling techniques have a long history in analyzing the anthological trends in computational *** situation becomes worse in the case of files downloaded into systems from the ***,most users either have to change file names manually or leave a meaningless name of the files,which increases the time to search required files and results in redundancy and duplications of user ***,no significant work is done on automated file labeling during the organization of heterogeneous user files.A few attempts have been made in topic ***,one major drawback of current topic modeling approaches is better *** rely on specific language types and domain similarity of the *** this research,machine learning approaches have been employed to analyze and extract the information from heterogeneous corpus.A different file labeling technique has also been used to get the meaningful and`cohesive topic of the *** results show that the proposed methodology can generate relevant and context-sensitive names for heterogeneous data files and provide additional insight into automated file labeling in operating systems.

关键词： Automated file labeling file organization machine learning topic modeling

来源：评论

学校读者我要写书评

暂无评论

Quantum Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees 4

Quantum Distributed Algorithms for Approximate Steiner Trees...

引用

4th IEEE International Conference on Quantum Computing and Engineering, QCE 2023

作者： Kerger, Phillip A. Bernal Neira, David E. Izquierdo, Zoe Gonzalez Rieffel, Eleanor G. Johns Hopkins University Department of Applied Mathematics and Statistics United States Research Institute of Advanced Computer Science Usra United States Nasa Ames Research Center Quantum Artificial Intelligence Laboratory United States

ISBN: (纸本)9798350343236

We present two algorithms in the Quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability;one for producing an approximately optimal Steiner Tree, and one for producing an exact directed minimum spanning tree, each of which uses O(n1/4) rounds of communication and Õ(n9/4) messages, achieving a lower asymptotic round and message complexity than any known algorithms in the classical CONGEST-CLIQUE model. At a high level, we achieve these results by combining classical algorithmic frameworks with quantum subroutines. Additionally, we characterize the constants and logarithmic factors involved in our algorithms as well as related classical algorithms, otherwise obscured by O notation, revealing that advances are needed to render both the quantum and classical algorithms practical. © 2023 IEEE.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

Geometric Spanning Trees Minimizing the Wiener Index 1

引用

18th International Symposium on Algorithms and Data Structures, WADS 2023

作者： Abu-Affash, A. Karim Carmi, Paz Luwisch, Ori Mitchell, Joseph S. B. Software Engineering Department Shamoon College of Engineering Beer-Sheva84100 Israel Department of Computer Science Ben-Gurion University Beer-Sheva84105 Israel Department of Applied Mathematics and Statistics Stony Brook University Stony BrookNY United States

ISBN: (数字)9783031389061

ISBN: (纸本)9783031389054

The Wiener index of a network, introduced by the chemist Harry Wiener [30], is the sum of distances between all pairs of nodes in the network. This index, originally used in chemical graph representations of the non-hydrogen atoms of a molecule, is considered to be a fundamental and useful network descriptor. We study the problem of constructing geometric networks on point sets in Euclidean space that minimize the Wiener index: given a set P of n points in Rd, the goal is to construct a network, spanning P and satisfying certain constraints, that minimizes the Wiener index among the allowable class of spanning networks. In this work, we focus mainly on spanning networks that are trees and we focus on problems in the plane (d= 2 ). We show that any spanning tree that minimizes the Wiener index has non-crossing edges in the plane. Then, we use this fact to devise an O(n4) -time algorithm that constructs a spanning tree of minimum Wiener index for points in convex position. We also prove that the problem of computing a spanning tree on P whose Wiener index is at most W, while having total (Euclidean) weight at most B, is NP-hard. Computing a tree that minimizes the Wiener index has been studied in the area of communication networks, where it is known as the optimum communication spanning tree problem. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Atoms

来源：评论

学校读者我要写书评

暂无评论

Mitigating Gradient Overlap in Deep Residual Networks with Gradient Normalization for Improved Non-Convex Optimization

arXiv

引用

arXiv 2024年

作者： Yun, Juyoung Stony Brook University Department of Computer Science United States Stony Brook University Department of Applied Mathematics and Statistics United States

In deep learning, Residual Networks (ResNets) have proven effective in addressing the vanishing gradient problem, allowing for the successful training of very deep networks. However, skip connections in ResNets can lead to gradient overlap, where gradients from both the learned transformation and the skip connection combine, potentially resulting in overestimated gradients. This overestimation can cause inefficiencies in optimization, as some updates may overshoot optimal regions, affecting weight updates. To address this, we examine Z-score Normalization (ZNorm) as a technique to manage gradient overlap. ZNorm adjusts the gradient scale, standardizing gradients across layers and reducing the negative impact of overlapping gradients. Our experiments demonstrate that ZNorm improves training process, especially in non-convex optimization scenarios common in deep learning, where finding optimal solutions is challenging. These findings suggest that ZNorm can affect the gradient flow, enhancing performance in large-scale data processing where accuracy is critical. © 2024, CC0.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Modelling the progression of Alzheimer's disease using Neutrosophic hidden Markov models

引用

Neutrosophic Sets and Systems 2023年 56卷 31-40页

作者： Nagarajan, D. Kavikumar, J. Tom, Mary Mahmud, Mufti Broumi, S. Department of Mathematics Rajalakshmi Institute of Technology Tamil Nadu Chennai India Department of Mathematics and Statistics Faculty of Applied Sciences and Technology Universiti Tun Hussein Onn Malaysia Campus Pagoh84600 Malaysia College of Information and Communication Technology School of Engineering & Technology |Higher Education Division CQUniversity Brisbane Campus BrisbaneQLD4000 Australia Department of Computer Science Nottingham Trent University United Kingdom United Kingdom Laboratory of Information Processing Faculty of Science Ben M’Sik University of Hassan II Casablanca Morocco

Alzheimer's disease is the primary cause of dementia. Due to the sluggish rate of progression of Alzheimer's disease, individuals have the opportunity to start receiving therapy early through routine testing. procedures since they are pricy and difficult to find. For many slowly advancing disorders, such as Alzheimer's disease (AD), the capacity to recognise changes in disease progression is essential. Machine learning methods with a high degree of modularity were used throughout the pipeline. We propose the use of Neutrosophic hidden Markov models (NHMMs) to simulate disease progression in a more thorough manner than the clinical phases of the disease. Due to the complexity and ambiguity of reality, decision-makers find it challenging to draw conclusions from precise data. Since they cannot be computed directly, the variables are encoded using a single interval Neutrosophic set. We showed that the trained HMM can imitate sickness development more accurately than the commonly acknowledged clinical phases. © (2023). All Rights Reserved.

关键词： Hidden Markov models

来源：评论

学校读者我要写书评

暂无评论

ON NON-REFLECTIVE BOUNDARIES FOR OUTDOOR SOUND PROPAGATION USING THE DISCONTINUOUS GALERKIN METHOD 10

ON NON-REFLECTIVE BOUNDARIES FOR OUTDOOR SOUND PROPAGATION U...

引用

10th Convention of the European Acoustics Association, EAA 2023

作者： Feriani, Sophia Julia Engsig-Karup, Allan P. Pind, Finnur Cosnefroy, Matthias Jeong, Cheol-Ho Acoustic Technology Department of Electrical and Photonics Engineering Technical University of Denmark Denmark Scientific Computing Department of Applied Mathematics and Computer Science Technical University of Denmark Denmark Treble Technologies Hafnartorg Kalkofnsvegur 2 Reykjavík101 Iceland

ISBN: (纸本)9788888942674

In environmental acoustics, sound propagates in open air and can be mathematically modelled in terms of a semi-infinite domain. The calculations for accurate numerical solutions for outdoor acoustics are computationally heavy when the chosen computation domain is large enough to fulfil the Sommerfeld radiation condition. To lower the computational cost, the domain must therefore be truncated to not significantly impact the numerical solution inside the domain and allow outgoing acoustic waves to leave the domain undisturbed. Various radiation conditions (sometimes considering the wind) have been developed to achieve this goal such as the Perfectly Matched Layer method. The aim of this study is to compare the accuracy of different non-reflecting boundaries using the high-order nodal discontinuous Galerkin finite element method (DG-FEM) for the case of an acoustic pulse propagating in a static and moving medium in an unstructured mesh. For each boundary treatment, the tunable parameters of the methods are defined to balance accuracy and computational cost. © 2023 S.J. Feriani et al. This is an open-access article distributed under the terms of the Creative Commons Attribution 3.0 Unported License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

关键词： Galerkin methods

来源：评论

学校读者我要写书评

暂无评论

Recognizing H-Graphs – Beyond Circular-Arc Graphs 48

Recognizing H-Graphs – Beyond Circular-Arc Graphs

引用

48th International Symposium on Mathematical Foundations of computer science, MFCS 2023

作者： Çağırıcı, Deniz Ağaoğlu Çağırıcı, Onur Derbisz, Jan Hartmann, Tim A. Hliněný, Petr Kratochvíl, Jan Krawczyk, Tomasz Zeman, Peter Faculty of Informatics Masaryk University Brno Czech Republic Toronto Metropolitan University Canada Theoretical Computer Science Department Faculty of Mathematics and Computer Science Jagiellonian University Kraków Poland CISPA Helmholtz Center for Information Security Saarbrücken Germany Doctoral School of Exact and Natural Sciences Jagiellonian University Kraków Poland Department of Applied Mathematics Faculty of Mathematics and Physics Charles University Prague Czech Republic Technical University of Denmark Lyngby Denmark

ISBN: (纸本)9783959772921

In 1992 Biró, Hujter and Tuza introduced, for every fixed connected graph H, the class of H-graphs, defined as the intersection graphs of connected subgraphs of some subdivision of H. Such classes of graphs are related to many known graph classes: for example, K2-graphs coincide with interval graphs, K3-graphs with circular-arc graphs, the union of T-graphs, where T ranges over all trees, coincides with chordal graphs. Recently, quite a lot of research has been devoted to understanding the tractability border for various computational problems, such as recognition or isomorphism testing, in classes of H-graphs for different graphs H. In this work we undertake this research topic, focusing on the recognition problem. Chaplick, Töpfer, Voborník, and Zeman showed an XP-algorithm testing whether a given graph is a T-graph, where the parameter is the size of the tree T. In particular, for every fixed tree T the recognition of T-graphs can be solved in polynomial time. Tucker showed a polynomial time algorithm recognizing K3-graphs (circular-arc graphs). On the other hand, Chaplick et al. showed also that for every fixed graph H containing two distinct cycles sharing an edge, the recognition of H-graphs is NP-hard. The main two results of this work narrow the gap between the NP-hard and P cases of H-graph recognition. First, we show that the recognition of H-graphs is NP-hard when H contains two distinct cycles. On the other hand, we show a polynomial-time algorithm recognizing L-graphs, where L is a graph containing a cycle and an edge attached to it (which we call lollipop graphs). Our work leaves open the recognition problems of M-graphs for every unicyclic graph M different from a cycle and a lollipop. © Deniz Ağaoğlu Çağırıcı, Onur Çağırıcı, Jan Derbisz, Tim A. Hartmann, Petr Hliněný, Jan.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Fine-Tuned MobileNetV2 and VGG16 Algorithm for Fish Image Classification 4

Fine-Tuned MobileNetV2 and VGG16 Algorithm for Fish Image Cl...

引用

4th International Conference on Informatics, Multimedia, Cyber and Information System, ICIMCIS 2022

作者： Fitrianah, Devi Suryaningrum, Kristien Margi Sagala, Noviyanti Tri Maretta Ayumi, Vina Lim, Siew Mooi School of Computer Science Bina Nusantara University Computer Science Department Jakarta Indonesia School of Computer Science Bina Nusantara University Mathematics Statistics Department Jakarta Indonesia Universitas Mercu Buana Informatics Engineering Program Faculty of Computer Science Jakarta Indonesia Tunku Abdul Rahman University College Faculty of Computing and Information Technology Computer Science Department Kuala Lumpur Malaysia

ISBN: (纸本)9781665473279

Study on the identification and classification of fish is challenging and valuable because of its role in advancing the marine and agricultural fields. This research has benefits interms of monitoring fish populations and ecosystems in a particular area. Furthermore, this research helps monitor fish that are considered threatened or endangered so that it makes iteasier to map prohibited areas for fishing. This research aims to know performance of MobileNetV2 and VGG16 with parameter tuning process by identifying the value of batch size, epoch, learning rate, and optimizer for fish image dataset. The proposed research phase consists of five main stages, including experimental setup, dataset construction, dataset preprocessing, dataset training and modelling and evaluation. As the result, VGG16 obtained the highest accuracy value. For VGG16 without fine-tuning, the testing accuracy is 98.07%. For VGG16 with fine-tuning, the testing accuracy is 96.56%. © 2022 IEEE.

关键词： Fish

来源：评论

学校读者我要写书评

暂无评论

Surrogate-based multilevel Monte Carlo methods for uncertainty quantification in the Grad-Shafranov free boundary problem

arXiv

引用

arXiv 2025年

作者： Elman, Howard C. Liang, Jiaxing Sánchez-Vizuet, Tonatiuh Department of Computer Science Institute for Advanced Computer Studies University of Maryland College Park United States Department of Computational Applied Mathematics & Operations Research Rice University United States Department of Mathematics The University of Arizona United States

We explore a hybrid technique to quantify the variability in the numerical solutions to a free boundary problem associated with magnetic equilibrium in axisymmetric fusion reactors amidst parameter uncertainties. The method aims at reducing computational costs by integrating a surrogate model into a multilevel Monte Carlo method. The resulting surrogate-enhanced multilevel Monte Carlo methods reduce the cost of simulation by factors as large as 104 compared to standard Monte Carlo simulations involving direct numerical solutions of the associated Grad-Shafranov partial differential equation. Accuracy assessments also show that surrogate-based sampling closely aligns with the results of direct computation, confirming its effectiveness in capturing the behavior of plasma boundary and geometric *** Codes 65Z05, 65C05, 62P35, 35R35, 35R60 Copyright © 2025, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：