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

8th International Conference on Communication and Electronics Systems, ICCES 2023

作者： Dandale, M.N. Mazharunnisa Daniel, D. J. Joel Devadass Priya, R. Sathya Walid, Md. Abul Ala Thulasimani, T. Yeshwantrao Chavan College of Engineering Applied Mathematics and Humanities Maharashtra Nagpur India Koneru Lakshmaiya Educational Foundation Kl University Kl Business School Vijayawada Andhra Pradesh Vaddeswaram India VelTech Rangarajan Dr. Sagunthala R&d Institute of Science and Technology Department of Electronics and Communication Engineering Tamilnadu Chennai India Knowledge Institute of Technology Department of Cse Tamilnadu Salem India Department of Computer Science and Engineering Bangladesh Bannari Amman Institute of Technology Mathematics Tamilnadu Erode India

ISBN: (纸本)9798350396638

Robotic Process Automation (RPA) bots automate mundane, rules-based operations, allowing workers more time to focus on high-level, strategic projects. Meanwhile, AI be used to analyze data and spot trends, resulting in better choices and increased productivity for enterprises. Previous researches are less efficient, slowly working algorithms when classification is performed in a large set of databases. The existing methods could be doing better while comparing the error factors, and in the cross-verification process, they have made inappropriate results, leading to wrong classifications. Robotic Process Automation (RPA) bots automate mundane, rules-based operations, allowing workers more time to focus on high-level, strategic projects. Meanwhile, AI be used to analyze data and spot trends, resulting in better choices and increased productivity for enterprises. Previous research on email automation and invoice process automation have needed to improve classification model efficiency and they have less efficient, slowly working algorithms when doing classification in a large set of databases. In this work, the Random Forest algorithm is used for classification, and the Quest method is used to segment texts in emails and invoices, both of which can be automated more effectively. The results of existing categorization algorithms have been less than ideal, especially when used to huge datasets, and are often completely inaccurate. The suggested method outperforms previous ML/AI approaches because it produces highly accurate outcomes with little resource investment. There are a number of benefits to utilizing RPA with AI, such as cost reduction, increased output, and streamlined operations. The advantages of this automation, challenges that must be met, and potential answers to those questions are discussed in this study. © 2023 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

A hybrid SIAC - data-driven post-processing filter for discontinuities in solutions to numerical PDEs

arXiv

引用

arXiv 2024年

作者： Terrab, Soraya Fung, Samy Wu Ryan, Jennifer K. Department of Applied Mathematics and Statistics Colorado School of Mines United States Department of Computer Science Colorado School of Mines United States Department of Mathematics KTH Royal Institute of Technology Sweden

We introduce a hybrid filter that incorporates a mathematically accurate moment-based filter with a data driven filter for discontinuous Galerkin approximations to PDE solutions that contain discontinuities. Numerical solutions of PDEs suffer from an O(1) error in the neighborhood about discontinuities, especially for shock waves that arise in inviscid compressible flow problems. While post-processing filters, such as the Smoothness-Increasing Accuracy-Conserving (SIAC) filter, can improve the order of error in smooth regions, the O(1) error in the vicinity of a discontinuity remains. To alleviate this, we combine the SIAC filter with a data-driven filter based on Convolutional Neural Networks. The data-driven filter is specifically focused on improving the errors in discontinuous regions and therefore only includes top-hat functions in the training dataset. For both filters, a consistency constraint is enforced, while the SIAC filter additionally satisfies r−moments. This hybrid filter approach allows for maintaining the accuracy guaranteed by the theory in smooth regions while the hybrid SIAC-data-driven approach reduces the 2 and ∞ errors about discontinuities. Thus, overall the global errors are reduced. We examine the performance of the hybrid filter about discontinuities for the one-dimensional Euler equations for the Lax, Sod, and sine-entropy (Shu-Osher) shock-tube *** Codes 65M99 © 2024, CC BY.

关键词： Euler equations

来源：评论

学校读者我要写书评

暂无评论

Predicting the Geometric Location of Critical Edges in Adaptive GDSW Overlapping Domain Decomposition Methods Using Deep Learning 26th

Predicting the Geometric Location of Critical Edges in Adapt...

引用

26th International Conference on Domain Decomposition Methods, 2020

作者： Heinlein, Alexander Klawonn, Axel Lanser, Martin Weber, Janine Faculty of Electrical Engineering Mathematics & Computer Science Delft Institute of Applied Mathematics Delft University of Technology Mekelweg 4 CD Delft72628 Netherlands Department of Mathematics and Computer Science University of Cologne Weyertal 86-90 Köln50931 Germany Center for Data and Simulation Science University of Cologne Köln Germany

ISBN: (纸本)9783030950248

For complex model problems with coefficient or material distributions with large jumps along or across the domain decomposition interface, the convergence rate of classic domain decomposition methods for scalar elliptic problems usually deteriorates. In particular, the classic condition number bounds [1, 12] will depend on the contrast of the coefficient function. As a remedy, different adaptive coarse spaces, e.g. [4, 13], have been developed which are obtained by solving certain generalized eigenvalue problems on local parts of the interface, i.e., edges and/or faces. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Domain decomposition methods

来源：评论

学校读者我要写书评

暂无评论

CAPE: Commitment-based Privacy-Preserving Payment Channel Scheme in Blockchain

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Gai, Keke Guo, Yunwei Yu, Jing Chan, Weilin Zhu, Liehuang Zhang, Yinqian Meng, Weizhi The School of Cyberspace Science and Technology Beijing Institute of Technology Beijing100081 China The Institute of Information Engineering Chinese Academy of Sciences Beijing China The Department of Computer Science and Engineering Southern University of Science and Technology Guangdong Shenzhen China Department of Applied Mathematics and Computer Science Cybersecurity Engineering Technical University of Denmark Kongens Lyngby Denmark

Ensuring scalability in cryptocurrency systems is significant in guaranteeing real-world utility along with the remarkable increment of cryptographic currency. As an alternative in solving scalability issue, payment channel allows users to deliver extensive offline transactions without uploading massive transaction details to the blockchain, such that increasing efficiency can be achieved. However, the implementation of payment channel still encounters privacy concerns when considering the publicly available transaction amounts and the potentials in mining associations between transaction parties. In this paper, we propose a novel payment channel scheme, entitled Commitment-based Anonymous Payment ChannEl (CAPE), to facilitate unlimited off-chain bidirectional payments while guaranteeing participants’ privacy. The proposed scheme adopts zero-knowledge proof (zk-SNARKs) and verifiable timed (VTD) commitments to ensure the anonymity of the relationship between on-chain and off-chain transactions, privacy of transaction amounts, and security of balances. We comprehensively formalize security definitions and present rigorous proofs for each security attribute. Experiment results further demonstrate the practical viability of CAPE. © 2025 IEEE. All rights reserved.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Learning Diverse Fine-Grained Features for Thermal Infrared Tracking

SSRN

引用

SSRN 2023年

作者： Yang, Chao Liu, Qiao Li, Gaojun Pan, Honghu He, Zhenyu School of Computer Science and Technology Harbin Institute of Technology Shenzhen518055 China National Center for Applied Mathematics Chongqing Normal University China

Existing feature models used in thermal infrared (TIR) tracking struggle to get strong discriminative feature of TIR objects, because TIR image has few details and low contrast. This characteristic makes the existing TIR tracking methods easy to drift to similar distractors. To tackle this problem, we introduce a novel diverse fine-grained feature network for TIR tracking. Our proposed method emphasizes extracting fine-grained features from multiple local regions of the target to improve its ability in discriminating against distractors. Specifically, our feature model consists of a specific-designed fine-grained feature network architecture and an auxiliary diverse loss function. Firstly, the fine-grained feature network learns to explore the subtle clues of the infrared target through a mask suppression mechanism. This mechanism can force the network to learn subtle cues of the target. Secondly, to guarantee the learned fine-grained features are various, we propose a diversity loss to force all fine-grained features are unique. These two modules help the feature model learn diverse fine-grained features from two complementary aspects. To prove that the method we proposed is effective, we evaluate it on four benchmarks. The relevant experimental results proves that our proposed method achieves the best performance compared to the state-of-the-art methods. © 2023, The Authors. All rights reserved.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Quantum Perfect Matchings

arXiv

引用

arXiv 2025年

作者： Cui, David Mančinska, Laura Nezhadi, Seyed Sajjad Roberson, David E. Department of Mathematics Massachusetts Institute of Technology United States Department of Mathematical Sciences University of Copenhagen Denmark University of Maryland United States Department of Applied Mathematics and Computer Science Technical University of Denmark Denmark

We investigate quantum and nonsignaling generalizations of perfect matchings in graphs using nonlocal games. Specifically, we introduce nonlocal games that test for L-perfect matchings in bipartite graphs, perfect matchings in general graphs and hypergraphs, and fractional perfect matchings. Our definitions come from the fact that these games are classical property tests for the corresponding matching conditions. We use the existence of perfect quantum and nonsignaling strategies for these games to define quantum and nonsignaling versions of perfect matchings. Finally, we provide characterizations of when graphs exhibit these extended properties: • For nonsignaling matchings, we give a complete combinatorial characterizations. In particular, a graph has a nonsignaling perfect matching if and only if it admits a fractional perfect matching that has bounded value on triangles. • In bipartite graphs, the nonsignaling L-perfect matching property is achieved exactly when the left component of the graph can be split into two disjoint subgraphs: one with a classical L-perfect matching and another with left-degree 2. • In the quantum setting, we show that complete graphs Kn with odd n ≥ 7 have quantum perfect matchings. We prove that a graph has a quantum perfect matching if and only if the quantum independence number of its line graph is maximal, extending a classical relationship between perfect matchings and line graph independence numbers. • For bipartite graphs, we establish that the L-perfect matching game does not exhibit quantum pseudotelepathy, but we characterize the quantum advantage for complete bipartite graphs Kn,2. • Additionally, we prove that deciding quantum perfect matchings in hypergraphs is undecidable and leave open the question of its complexity in graphs. Copyright © 2025, The Authors. All rights reserved.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

CONVERGENCE OF DISCONTINUOUS GALERKIN METHODS FOR QUASICONVEX AND RELAXED VARIATIONAL PROBLEMS

arXiv

引用

arXiv 2025年

作者： Grekas, Georgios Koumatos, Konstantinos Makridakis, Charalambo Vikelis, Andreas Computer Electrical Mathematical Sciences and Engineering Division KAUST Saudi Arabia Department of Mathematics University of Sussex United Kingdom Institute of Applied & Computational Mathematics Foundation for Research & Technology-Hellas Greece Department of Mathematics and Applied Mathematics University of Crete Greece Faculty of Civil Engineering Czech Technical University of Prague Czech Republic

In this work, we establish that discontinuous Galerkin methods are capable of producing reliable approximations for a broad class of nonlinear variational problems. In particular, we demonstrate that these schemes provide essential flexibility by removing inter-element continuity while also guaranteeing convergent approximations in the quasiconvex case. Notably, quasiconvexity is the weakest form of convexity pertinent to elasticity. Furthermore, we show that in the non-convex case discrete minimisers converge to minimisers of the relaxed problem. In this case, the minimisation problem corresponds to the energy defined by the quasiconvex envelope of the original energy. Our approach covers all discontinuous Galerkin formulations known to converge for convex energies. This work addresses an open challenge in the vectorial calculus of variations: developing and rigorously justifying numerical schemes capable of reliably approximating nonlinear energy minimization problems with potentially singular solutions, which are frequently encountered in materials science. © 2025, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Federated Multi-Agent Mapping for Planetary Exploration

arXiv

引用

arXiv 2024年

作者： Szatmari, Tiberiu-Ioan Cauligi, Abhishek Department of Applied Mathematics and Computer Science Technical University of Denmark Eriksholm Research Centre Denmark Jet Propulsion Laboratory California Institute of Technology United States

Multi-agent robotic exploration stands to play an important role in space exploration as the next generation of robotic systems ventures to far-flung environments. A key challenge in this new paradigm will be to effectively share and utilize the vast amount of data generated onboard while operating in bandwidth-constrained regimes typical of space missions. Federated learning (FL) is a promising tool for bridging this gap. Drawing inspiration from the upcoming CADRE Lunar rover mission, we propose a federated multi-agent mapping approach that jointly trains a global map model across agents without transmitting raw data. Our method leverages implicit neural mapping to generate parsimonious, adaptable representations, reducing data transmission by up to 93.8% compared to raw maps. Furthermore, we enhance this approach with meta-initialization on Earth-based traversability datasets to significantly accelerate map convergence—reducing iterations required to reach target performance by 80% compared to random initialization. We demonstrate the efficacy of our approach on Martian terrains and glacier datasets, achieving downstream path planning F1 scores as high as 0.95 while outperforming on map reconstruction losses. © 2024, CC BY-NC-SA.

关键词： NASA

来源：评论

学校读者我要写书评

暂无评论

Driving Activity Classification Using Deep Residual Networks Based on Smart Glasses Sensors

引用

Intelligent Automation & Soft Computing 2023年第11期38卷 139-151页

作者： Narit Hnoohom Sakorn Mekruksavanich Anuchit Jitpattanakul Department of Computer Engineering Image Information and Intelligence LaboratoryFaculty of EngineeringMahidol UniversityNakhon Pathom73170Thailand Department of Computer Engineering School of Information and Communication TechnologyUniversity of PhayaoPhayaoThailand Department of Mathematics Faculty of Applied ScienceKing Mongkut’s University of Technology North BangkokBangkok10800Thailand Intelligent and Nonlinear Dynamic Innovations Research Center Science and Technology Research InstituteKing Mongkut’s University of Technology North BangkokBangkok10800Thailand

Accidents are still an issue in an intelligent transportation system,despite developments in self-driving technology(ITS).Drivers who engage in risky behavior account for more than half of all road *** a result,reckless driving behaviour can cause congestion and *** vision and multimodal sensors have been used to study driving behaviour categorization to lessen this *** research has also collected and analyzed a wide range of data,including electroencephalography(EEG),electrooculography(EOG),and photographs of the driver’s *** the other hand,driving a car is a complicated action that requires a wide range of body *** this work,we proposed a ResNet-SE model,an efﬁcient deep learning classiﬁer for driving activity clas-siﬁcation based on signal data obtained in real-world trafﬁc conditions using smart ***-to-end learning can be achieved by combining residual networks and channel attention approaches into a single learning *** data from 3-point EOG electrodes,tri-axial accelerometer,and tri-axial gyroscope from the Smart Glasses dataset was utilized in this *** performed various experiments and compared the proposed model to base-line deep learning algorithms(CNNs and LSTMs)to demonstrate its *** to the research results,the proposed model outperforms the previous deep learning models in this domain with an accuracy of 99.17%and an F1-score of 98.96%.

关键词： Smart glasses human activity recognition deep learning wearable sensors driving activity

来源：评论

学校读者我要写书评

暂无评论

Para- and diamagnetic contributions to magnetic shielding constants of relativistic hydrogenlike atoms in some low-lying discrete energy eigenstates

arXiv

引用

arXiv 2024年

作者： Stefańska, Patrycja Institute of Physics and Computer Science Faculty of Applied Physics and Mathematics Gdańsk University of Technology Narutowicza 11/12 Gdańsk80–233 Poland

We present tabulated data for numerical calculations of relative para- and diamagentic contributions to the magnetic shielding constant (σ) of the Dirac one-electron atoms with a pointlike, spinless and motionless nuclei of charge Ze. Exploiting the analytical formulas for the diamagnetic (σd) and paramagnetic (σp) terms of σ, valid for an arbitrary discrete energy state, recently derived by us with the aid of the Gordon decomposition technique, we have found the numerical values of σd/σ and σp/σ for the ground state and for the first two sets of excited states (i.e.: 2s1/2, 2p1/2, 2p3/2, 3s1/2, 3p1/2, 3p3/2, 3d3/2, and 3d5/2) of the relativistic hydrogenic ions with the nuclear charge number from the range 1 6 Z 6 137. The comparisons of our results with those reported by other authors for some atomic states are also presented. We also compile here the numerical values of the total magnetic shielding constants for the ground state 1s1/2 and for each state belonging to the first set of excited states of selected hydrogenlike ions, obtained with the use of three different values of the fine-structure constant, i.e.: α−1 = 137.035 999 139 (from CODATA 2014), α−1 = 137.035 999 084 (from CODATA 2018) and α−1 = 137.035 999 177 (from CODATA 2024). Copyright © 2024, The Authors. All rights reserved.

关键词： Diamagnetism

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：