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

On Error-Based Step Size Control for Discontinuous Galerkin Methods for Compressible Fluid Dynamics

应用数学与计算数学学报 2025年第1期7卷 3-39页

作者： Hendrik Ranocha Andrew R.Winters Hugo Guillermo Castro Lisandro Dalcin Michael Schlottke-Lakemper Gregor J.Gassner Matteo Parsani Applied Mathematics University of HamburgBundesstr.5520146 HamburgGermany Department of Mathematics Applied Mathematics Linköping UniversityLinköpingSweden Extreme Computing Research Center(ECRC) Computer Electrical and Mathematical Science and Engineering Division(CEMSE)King Abdullah University of Science and Technology(KAUST)Thuwal 23955-6900Saudi Arabia Applied and Computational Mathematics RWTH Aachen UniversityAachenGermany High-Performance Computing Center Stuttgart University of StuttgartStuttgartGermany Department of Mathematics and Computer Science University of CologneCologneGermany Center for Data and Simulation Science University of CologneCologneGermany Extreme Computing Research Center(ECRC) Computer Electrical and Mathematical Science and Engineering Division(CEMSE)King Abdullah University of Science and Technology(KAUST)Thuwal 23955-6900Saudi Arabia Physical Science and Engineering Division(PSE) King Abdullah University of Science and Technology(KAUST)Thuwal 23955-6900Saudi Arabia

We study a temporal step size control of explicit Runge-Kutta(RK)methods for com-pressible computational fluid dynamics(CFD),including the Navier-Stokes equations and hyperbolic systems of conservation laws such as the Euler *** demonstrate that error-based approaches are convenient in a wide range of applications and compare them to more classical step size control based on a Courant-Friedrichs-Lewy(CFL)*** numerical examples show that the error-based step size control is easy to use,robust,and efficient,e.g.,for(initial)transient periods,complex geometries,nonlinear shock captur-ing approaches,and schemes that use nonlinear entropy *** demonstrate these properties for problems ranging from well-understood academic test cases to industrially relevant large-scale computations with two disjoint code bases,the open source Julia pack-ages *** with *** and the C/Fortran code SSDC based on PETSc.

关键词： Explicit Runge-Kutta(RK)methods Step size control Compressible fluid dynamics Adaptivity in space and time Shock capturing

来源：评论

学校读者我要写书评

暂无评论

An Elite Archive-Assisted Multi-Objective Evolutionary Algorithm for mRNA Design 13

An Elite Archive-Assisted Multi-Objective Evolutionary Algor...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Hong, Wenjing Chen, Cheng Zhu, Zexuan Tang, Ke Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen China Research Institute of Trustworthy Autonomous Systems Southern University of Science and Technology Shenzhen China Southern University of Science and Technology Department of Computer Science and Engineering Shenzhen China

ISBN: (纸本)9798350308365

Messenger RNA (mRNA) vaccines have emerged as highly effective strategies in the prophylaxis and treatment of diseases. mRNA design, a key to the success of mRNA vaccines, in-volves finding optimal codons and increasing secondary structure stability to lengthen mRNA half-life, ultimately enhancing protein expression. Despite receiving widespread attention, most methods primarily rely on manual design, which is time-consuming and labor-intensive. While optimization approaches can alleviate this issue, existing methods still exhibit critical limitations caused by conflicts between codon usage and mRNA structural stability, compounded by the vast design space of mRNA resulting from the presence of synonymous codons. In this paper, a novel multi-objective evolutionary optimization-based mRNA design method is proposed. We first formulate the mRNA design problem as a multi-objective optimization problem and then develop an Elite Archive-Assisted Multi-Objective Evolutionary algorithm for mRNA Design, namely EAA-MOED, by incorporating a novel elite archive-assisted method into a weighted optimization framework to improve search efficiency. Experimental studies, involving two state-of-the-art mRNA design methods and five well-known MOEAs, show the competitiveness of the proposed EAA-MOED in mRNA design. © 2024 IEEE.

关键词： Vaccines

来源：评论

学校读者我要写书评

暂无评论

Distributed and Localized Model Predictive Control - Part II: Theoretical Guarantees

引用

IEEE Transactions on Control of Network Systems 2023年第3期10卷 1113-1123页

作者： Alonso, Carmen Amo Li, Jing Shuang Matni, Nikolai Anderson, James California Institute of Technology Computing and Mathematical Sciences Department PasadenaCA91106 United States University of Pennsylvania Department of Electrical and Systems Engineering PhiladelphiaPA19104 United States Columbia University Department of Electrical Engineering and the Data Science Institute New YorkNY10027 United States

Engineered cyberphysical systems are growing increasingly large and complex. These systems require scalable controllers that robustly satisfy state and input constraints in the presence of additive noise: such controllers should also be accompanied by theoretical guarantees on feasibility and stability. In our companion paper, we introduced distributed and localized model predictive control (DLMPC) for large-scale linear systems;DLMPC is a scalable closed-loop MPC scheme in which subsystems need only exchange local information in order to synthesize and implement local controllers. In this article, we provide recursive feasibility and asymptotic stability guarantees for DLMPC. We leverage the system level synthesis framework to express the maximal positive robust invariant set for the closed-loop system and its corresponding Lyapunov function in terms of the closed-loop system responses. We use the invariant set as the terminal set for DLMPC, and show that this guarantees feasibility with minimal conservatism. We use the Lyapunov function as the terminal cost, and show that this guarantees stability. We provide fully distributed and localized algorithms to compute the terminal set offline, and also provide necessary additions to the online DLMPC algorithm to accommodate coupled terminal constraint and cost. In all algorithms, only local information exchange is necessary, and computational complexity is independent of the global system size: we demonstrate this analytically and experimentally. This is the first distributed MPC approach that provides minimally conservative yet fully distributed guarantees for recursive feasibility and asymptotic stability in the nominal and robust settings. © 2014 IEEE.

关键词： Lyapunov methods

来源：评论

学校读者我要写书评

暂无评论

Multi-Granularity History and Entity Similarity Learning for Temporal Knowledge Graph Reasoning

Multi-Granularity History and Entity Similarity Learning for...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Mingcong, Shi Zhu, Chunjiang Zhang, Detian Wen, Shiting Li, Qing School of Computer Science and Technology Soochow University Suzhou China Department of Computer Science University of North Carolina Greensboro United States School of Computer and Data Engineering NingboTech University Ningbo China Department of Computing The Hong Kong Polytechnic University Hong Kong

ISBN: (纸本)9798891761643

Temporal Knowledge Graph (TKG) reasoning, aiming to predict future unknown facts based on historical information, has attracted considerable attention due to its great practical value. Insight into history is the key to predict the future. However, most existing TKG reasoning models singly capture repetitive history, ignoring the entity's multi-hop neighbour history which can provide valuable background knowledge for TKG reasoning. In this paper, we propose Multi-Granularity History and Entity Similarity Learning (MGESL) model for Temporal Knowledge Graph Reasoning, which models historical information from both coarse-grained and fine-grained history. Since similar entities tend to exhibit similar behavioural patterns, we also design a hypergraph convolution aggregator to capture the similarity between entities. Furthermore, we introduce a more realistic setting for the TKG reasoning, where candidate entities are already known at the timestamp to be predicted. Extensive experiments on three benchmark datasets demonstrate the effectiveness of our proposed model. © 2024 Association for Computational Linguistics.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Empowering Oral Healthcare: CNN-Assisted Diagnosis for Improved Patient Outcomes 2

Empowering Oral Healthcare: CNN-Assisted Diagnosis for Impro...

引用

2nd International Conference on data science and Information System, ICDSIS 2024

作者： Garrepalli, Vaishnavi Gupta, Vishwanath Abhishek, S. Anjali, T. Amrita School Of Computing Amrita Vishwa Vidyapeetham Department Of Computer Science And Engineering Amritapuri India Verizon Data Services India Pvt Ltd Hyderabad India Rolls-Royce Inc Bangalore India

ISBN: (纸本)9798350381665

In today's world, health is very important, and among the many aspects of well-being, oral wellness is one of the crucial components. Diagnostic investigation in everyday clinical procedures primarily consists of reviewing periapical radiography, which visualizes dental anatomy such as teeth, bone, and soft tissues within the oral cavity. Nonetheless, subjective errors may arise during human interpretation of dental radiographs which also take a lot of time. Most of these dental X-rays have an important role in diagnosing various conditions like Implant, Fillings, Cavity, and Impacted teeth under accurate assessment of classification of dental radiographs. These imaging techniques can help dentists detect anomalies within the mouth through this diagnosis process. To improve the accuracy of diagnosis and reduce the costs of clinical operations, this study presents a novel approach that automates the detection of problematic teeth and other dental diseases using these x-ray images using CNN (Convolutional Neural Networks) architecture VGG19 for making the right diagnosis choices. © 2024 IEEE.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Recognition of American sign language using modified deep residual CNN with modified canny edge segmentation

引用

Multimedia Tools and Applications 2025年 1-28页

作者： Hariharan, U. Devarajan, Devikanniga Kumar, P. Santhosh Rajkumar, K. Meena, M. Akilan, T. Department of Computer Science and Engineering Apex Institute of Technology Chandigarh University Punjab Mohali140413 India Department of Computer Science and Engineering GITAM University Karnataka Bengaluru561203 India Department of Information Technology Faculty of Engineering and technology SRM Institute of Science and Technology Ramapuram Tamil Nadu Chennai600089 India Department of Data Science and Business Systems School of Computing Faculty of Engineering and Technology SRM Institute of Science and Technology Kattankulathur Tamil Nadu Chennai603203 India Department of Computer Science and Engineering Sri Sairam Engineering College Tamil Nadu Tambaram602109 India Research Coordinator Dept. of IQAC Amity University Kolkata West Bengal 700135 India

American Sign Language (ASL) recognition aims to recognize hand gestures, and it is a crucial solution to communicating between the deaf community and hearing people. However, existing sign language recognition algorithms still have some drawbacks, such as difficulty recognizing hand movements and low recognition accuracy for most sign language recognition. A Modified Convolutional Neural Network (MCNN) deep residual 101 classifier-based American Sign Language identification system has been developed to address this problem. There are three main parts presents in the method. The first part is pre-processing the images to remove the noise, enhance the contrast of the picture, adjust the contrast level and smoothen the picture using various filters. The second part is the segmentation, and it’s used to partition the image using a modified canny edge detection method by removing all weak edges present in the image. Finally, classification will be done using the Modified CNN deep residual 101 classifiers. By classifying the image, the American Sign Language is accurately identified. This process is conducted through images. The outcome shows that the suggested approach has a 0.97% accuracy and a 0.05% False Positive Rate. Other CNN architectures such as resNet 50 and resNet 18 reached 0.90% and 0.80% accuracy, respectively, which is lower than our proposed method. In addition, the resNet 101 classifier effectively recognizes the difficult hand gestures through the image data. It obtains high recognition accuracy for 36 signs is 0 to 9 numbers and a to z alphabets from American Sign Language. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Hybrid Semantic/Bit Communication Based Networking Problem Optimization

Hybrid Semantic/Bit Communication Based Networking Problem O...

引用

2024 IEEE Global Communications Conference, GLOBECOM 2024

作者： Xia, Le Sun, Yao Niyato, Dusit Zhang, Lan Zhang, Lei Imran, Muhammad Ali University of Glasgow James Watt School of Engineering Glasgow United Kingdom Nanyang Technological University College of Computing and Data Science Singapore Clemson University Department of Electrical and Computer Engineering United States

ISBN: (纸本)9798350351255

This paper jointly investigates user association (UA), mode selection (MS), and bandwidth allocation (BA) problems in a novel and practical next-generation cellular network where two modes of semantic communication (SemCom) and conventional bit communication (BitCom) coexist, namely hybrid semantic/bit communication network (HSB-Net). Concretely, we first identify a unified performance metric of message throughput for both SemCom and BitCom links. Next, we comprehensively develop a knowledge matching-aware two-stage tandem packet queuing model and theoretically derive the average packet loss ratio and queuing latency. Combined with several practical constraints, we then formulate a joint optimization problem for UA, MS, and BA to maximize the overall message throughput of HSB-Net. Afterward, we propose an optimal resource management strategy by employing a Lagrange primal-dual method and devising a preference list-based heuristic algorithm. Finally, numerical results validate the performance superiority of our proposed strategy compared with different benchmarks. © 2024 IEEE.

关键词： Frequency allocation

来源：评论

学校读者我要写书评

暂无评论

Boosting Meaningful Dependency Mining with Clustering and Covariance Analysis 40

Boosting Meaningful Dependency Mining with Clustering and Co...

引用

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Wang, Xi Jin, Ruochun Huang, Wanrong Tang, Yuhua Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha China College of Computer Science and Technology Department of Intelligent Data Science National University of Defense Technology Changsha China

ISBN: (纸本)9798350317152

Functional dependencies (FDs) form a valuable ingredient for various data management tasks. However, existing methods can hardly discover practical and interpretable FDs, especially in large noisy real-life datasets. This paper studies the problem of discovering meaningful functional dependencies (FDms) that utilize support and error parameters to capture interesting dependencies in such datasets and proposes an efficient discovery algorithm called FDM?. In order to scale with large datasets, FDM ? employs an efficient sampling method with accuracy guarantees to capture the differences between tuple pairs and to quantify the connection between support/error of dependencies on samples and those on the entire dataset. Moreover, it adopts a clustering-based correlated attributes extraction to divide the exponentially large search space into multiple small sub-spaces and proposes an easy-first traversal strategy with covariance-based guidance that quickly detects candidate dependencies and validates them. Additionally, we prove a covariance lower bound as an additional pruning criterion to reduce the search space. Extensive experiments on real-life and synthetic datasets demonstrate that FDM ? is 14 times faster than existing discovery algorithms on average, up to 31 times, and scales to larger datasets with the least memory cost. © 2024 IEEE.

关键词： Large datasets

来源：评论

学校读者我要写书评

暂无评论

Note on a New Construction of Kantorovich Form q-Bernstein Operators Related to Shape Parameter λ

引用

Computer Modeling in Engineering & sciences 2022年第3期130卷 1479-1493页

作者： Qingbo Cai Resat Aslan Fujian Provincial Key Laboratory of Data-Intensive Computing Key Laboratory of Intelligent Computing and Information ProcessingSchool of Mathematics and Computer ScienceQuanzhou Normal UniversityQuanzhou362000China Department of Mathematics Faculty of Sciences and ArtsHarran UniversitySanlıurfa63300Turkey

The main purpose of this paper is to introduce some approximation properties of a Kantorovich kind q-Bernstein operators related to B′ezier basis functions with shape parameterλ∈[−1,1].Firstly,we compute some basic results such as moments and central moments,and derive the Korovkin type approximation theorem for these ***,we estimate the order of convergence in terms of the usual modulus of continuity,for the functions belong to Lipschitz-type class and Peetre’s K-functional,***,with the aid of Maple software,we present the comparison of the convergence of these newly defined operators to the certain function with some graphical illustrations and error estimation table.

关键词： q-calculus (λ,q)-Bernstein polynomials order of convergence Lipschitz-type function Peetre’s K-functional

来源：评论

学校读者我要写书评

暂无评论

Augmenting the Proficiencies of GANs Through Modernizing Agriculture and Healthcare

Augmenting the Proficiencies of GANs Through Modernizing Agr...

引用

International Conference on Trends in Electronics and Informatics (ICEI)

作者： M. Jothi T. Veeramakali Department of Data Science and Business Systems School of Computing SRM Institute of Science and Technology Kattankulathur Tamilnadu India

ISBN: (数字)9798331544607

ISBN: (纸本)9798331544614

Nowadays, generative models with deep learning have a focus and give enormous success in various real-time experience domains. Deep learning (DL) is a subdivision of machine learning that is inspired by the structure and function of human brain activity, known as artificial neural networks. It is a data-driven technique that achieves the best accuracy while using a large number of input samples. Generative Adversarial Networks (GANs) are a robust class of neural networks used for unsupervised learning under DL categories. GAN is one of the most influential architectures demonstrating remarkable success in generating high-quality data. The reusable feature learning process from a huge number of unlabelled data paves the way for research. This survey article discusses an overview of the GAN model, such as the original GAN, Conditional GANs, and resolution GANs, along with their specific adaptations for various tasks. Additionally, we examine the situations faced by Generative Adversarial Networks depending on various applications such as image and video generation, medical image analysis, text-to-image synthesis, agriculture, and creative industries such as music and art. This survey explores diverse applications of recently developed frameworks and benchmark datasets used for development, along with their architecture and metric evaluations.

关键词： Deep learning Surveys Measurement Image analysis Accuracy Generative adversarial networks Agriculture Real-time systems Medical diagnostic imaging Farming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：