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

Dynamic mode decomposition of nonequilibrium electron-phonon dynamics:accelerating the firstprinciples real-time Boltzmann equation

引用

npj Computational Materials 2024年第1期10卷 1970-1977页

作者： Ivan Maliyov Jia Yin Jia Yao Chao Yang Marco Bernardi Department of Applied Physics and Materials Science California Institute of TechnologyPasadenaCA 91125USA Applied Mathematics and Computational Research Division Lawrence Berkeley National LaboratoryBerkeleyCA 94720USA Department of Physics California Institute of TechnologyPasadenaCA 91125USA

Nonequilibrium dynamics governed by electron–phonon(e-ph)interactions plays a key role in electronic devices and spectroscopies and is central to understanding electronic excitations in *** real-time Boltzmann transport equation(rt-BTE)with collision processes computed from first principles can describe the coupled dynamics of electrons and atomic vibrations(phonons).Yet,a bottleneck of these simulations is the calculation of e–ph scattering integrals on dense momentum grids at each time *** we show a data-driven approach based on dynamic mode decomposition(DMD)that can accelerate the time propagation of the rt-BTE and identify dominant electronic *** apply this approach to two case studies,high-field charge transport and ultrafast excited electron *** both cases,simulating only a short time window of~10%of the dynamics suffices to predict the dynamics from initial excitation to steady state using DMD *** of the momentum-space modes extracted from DMD sheds light on the microscopic mechanisms governing electron relaxation to a steady state or *** combination of accuracy and efficiency makes our DMD-based method a valuable tool for investigating ultrafast dynamics in a wide range of materials.

关键词： materials dynamics phonon

来源：评论

学校读者我要写书评

暂无评论

DP-ARTS: Dynamic Prioritization for Adaptive Resource Allocation and Task Scheduling in Cloud Computing

IAENG International Journal of Computer Science

引用

IAENG International Journal of computer science 2025年第3期52卷 793-807页

作者： BEN ALLA, Hicham BEN ALLA, Said EZZATI, Abdellah Computer Science Mathematics and Computer Science Department Science and Technical Faculty Hassan 1 University Settat Morocco Embedded Systems and Computer Science National School of Applied Sciences of Berrechid Hassan 1 University Settat Morocco

Efficient task scheduling and resource allocation are essential for optimizing performance in cloud computing environments. The presence of priority constraints necessitates advanced solutions capable of addressing the increased complexity in the task scheduling process and resource allocation management. In this paper, we propose a novel approach, Dynamic Prioritization and Adaptive Resource Allocation and Task Scheduling (DP-ARTS), to tackle these challenges by integrating dynamic task prioritization with adaptive resource allocation and scheduling strategies. Our approach introduces a scoring mechanism to prioritize tasks based on deadlines, resource requirements, and other critical characteristics. Furthermore, we utilize K-means clustering to group Virtual Machines (VMs) according to their capabilities, facilitating more efficient task-to-VM mapping. Through simulations conducted with real-world workload traces in the CloudSim toolkit, DP-ARTS demonstrates superior performance in reducing makespan and energy consumption, while also improving resource utilization and load balancing compared to existing solutions. © (2025), (International Association of Engineers). All rights reserved.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

Mathematical modelling of the dynamics of typhoid fever and two modes of treatment in a Health District in Cameroon

引用

Mathematical Biosciences and Engineering 2025年第2期22卷 477-510页

作者： Tsafack, Thierry Jimy Kum, Cletus Kwa Tassé, Arsène Jaurès Ouemba Tsanou, Berge Department of Mathematics and Computer Science Faculty of Science University of Dschang P.O. Box 67 Dschang Cameroon Department of Mathematics Higher Teacher Training College - Bambili The University of Bamenda P.O. Box 39 Bambili Cameroon School of Computer Science and Applied Mathematics University of the Witwatersrand Johannesburg South Africa Department of Mathematics and Applied Mathematics University of Pretoria South Africa IRD Sorbonne University UMMISCO BondyF-93143 France

In this paper, we propose a novel mathematical model for indirectly transmitted typhoid fever disease that incorporates the use of modern and traditional medicines as modes of treatment. Theoretically, we provide two Lyapunov functions to prove the global asymptotic stability of the disease-free equilibrium (DFE) and the endemic equilibrium (EE) when the basic reproduction number (R0) is less than one and greater than one, respectively. The model is calibrated using the number of cumulative cases reported in the Penka-Michel health district in Cameroon. The parameter estimates thus obtained give a value of R0 = 1.2058 > 1,which indicates that the disease is endemic in the region. The forecast of the outbreak up to November 2026 suggests that the number of cases will be 21,270, which calls for urgent attention on this endemic disease. A sensitivity analysis with respect to the basic reproduction number is conducted, and the main parameters that impact the widespread of the disease are determined. The analysis highlights that the environmental transmission rate β and the decay rate µb of the bacteria in the environment are the most influential parameters for R0. This underscores the urgent need for potable water and adequate sanitation within this area to reduce the spread of the disease. Numerically, we illustrate the usefulness of recourse to any mode of treatment to lessen the number of infected cases and the necessity of switching from modern treatment to the traditional treatment, a useful adjuvant therapy. Conversely, we show that the relapse phenomenon increases the burden of the disease. Hence adopting a synergistic therapy approach will significantly mitigate typhoid disease cases and overcome the cycle of poverty within the afflicted communities. © 2025 the Author(s)

关键词： Medicinal chemistry

来源：评论

学校读者我要写书评

暂无评论

Enhanced MADM Strategy with Heptapartitioned Neutrosophic Distance Metrics

引用

Neutrosophic Sets and Systems 2025年 78卷 74-96页

作者： Eassa, Mohamed Myvizhi, M. Elkholy, Mohamed Abdelhafeez, Ahmed Elbehiery, Hussam Computer Science Department Faculty of Information System and Computer Science October 6 University Giza12585 Egypt Applied Science Research Center Applied Science Private University Amman Jordan Department of Mathematics KPR Institute of Engineering and Technology Tamilnadu Coimbatore India Faculty of Computer Science& Engineering Alamein International University Egypt

In this work, a novel methodological approach to multi-attribute decision-making problems is developed and the notion of Heptapartitioned Neutrosophic Set Distance Measures (HNSDM) is introduced. By averaging the Penta-Partitioned Neutrosophic Distance Measures under particular conditional criteria, the suggested technique ranks the options. Additionally, we explore the fundamental characteristics of HNSDM and provide several illustrative theorems. The Heptapartitioned Neutrosophic Set Distance Measures are formulated based on the Hepta Neutrosophic Set. Lastly, a practical numerical example is provided to illustrate the efficacy of the suggested methodology. © 2025, University of New Mexico. All rights reserved.

关键词： Heptapartitioned Neutrosophic set Heptapartitioned Neutrosophic set and MADM strategy Heptapartitioned set Neutrosophic sine distance measure

来源：评论

学校读者我要写书评

暂无评论

Arbitrary style transfer system with split-and-transform scheme

引用

Multimedia Tools and Applications 2024年第23期83卷 62497-62517页

作者： Tu, Ching-Ting Lin, Hwei Jen Tsai, Yihjia Lin, Zi-Jun Department of Applied Mathematics National Chung Hsing University Taichung Taiwan Department of Computer Science and Information Engineering Tamkang University New Taipei Taiwan

For the subject of arbitrary image style transfer, there have been some proposed architectures that directly compute the transformation matrix of the whitening and coloring transformation (WCT) to obtain more satisfactory transformation results. However, calculating the transformation matrix of WCT is time-consuming. Li et al. trained a linear transformation module to generate a WCT transformation matrix for any pair of images, i.e., content image and style image, to avoid complex calculations and improves time efficiency. In this work, we introduce a flexible arbitrary image style transfer framework based on the LST, which uses deep neural networks to train a linear transformation matrix as the standard matrix for WCT. For the first part, inverse relationship between the Whitening matrix and the Coloring matrix w.r.t. the same image is enforced during the training of the linear transformation matrix, so that the resulting matrix will be more accurate and closer to the standard matrix of WCT. For the second part, a split-and-transform scheme is proposed. Unlike LST, which transforms the block of feature maps as a whole, the split-and-transform scheme divides the feature block into several smaller blocks and transforms them individually, so that the transformation is more localized, and the more the number of divided blocks, the more localized. In addition, the proposed split-and-transform scheme allows users to determine the number of divided blocks to flexibly control the locality of the transformations. Experimental results demonstrate the effectiveness and flexibility of the proposed framework by the high-quality stylized images and adjustable balance between globality and locality of transformations. The use of the split-and-transform scheme can reduce the computational time while preserving or even improving the stylization results. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Linear transformations

来源：评论

学校读者我要写书评

暂无评论

Distilled Gradual Pruning With Pruned Fine-Tuning

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第8期5卷 4269-4279页

作者： Fontana, Federico Lanzino, Romeo Raoul Marini, Marco Avola, Danilo Cinque, Luigi Scarcello, Francesco Foresti, Gian Luca The Department of Computer Science Sapienza University of Rome Rome00198 Italy The Department of Computer Engineering Modeling Electronics and Systems University of Calabria Rende87030 Italy The Department of Mathematics Computer Science and Physics University of Udine Udine33100 Italy

—Neural networks (NNs) have been driving machine learning progress in recent years, but their larger models present challenges in resource-limited environments. Weight pruning reduces the computational demand, often with performance degradation and long training procedures. This work introduces distilled gradual pruning with pruned fine-tuning (DG2PF), a comprehensive algorithm that iteratively prunes pretrained NNs using knowledge distillation. We employ a magnitude-based unstructured pruning function that selectively removes a specified proportion of unimportant weights from the network. This function also leads to an efficient compression of the model size while minimizing classification accuracy loss. Additionally, we introduce a simulated pruning strategy with the same effects of weight recovery but while maintaining stable convergence. Furthermore, we propose a multistep self-knowledge distillation strategy to effectively transfer the knowledge of the full, unpruned network to the pruned counterpart. We validate the performance of our algorithm through extensive experimentation on diverse benchmark datasets, including CIFAR-10 and ImageNet, as well as a set of model architectures. The results highlight how our algorithm prunes and optimizes pretrained NNs without substantially degrading their classification accuracy while delivering significantly faster and more compact models. Impact Statement—In recent times, NNs have demonstrated remarkable outcomes in various tasks. Some of the most advanced possess billions of trainable parameters, making their training and inference both energy intensive and costly. As a result, the focus on pruning is growing in response to the escalating demand for NNs. However, most current pruning techniques involve training a model from scratch or with a lengthy training process leading to a significant increase in carbon footprint, and some experience a notable drop in performance. In this article, we introduce DG2PF. This unstruct

关键词： computer architecture

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Distributed Maximum Flow in Planar Graphs 38

Brief Announcement: Distributed Maximum Flow in Planar Graph...

引用

38th International Symposium on Distributed Computing, DISC 2024

作者： Abd-Elhaleem, Yaseen Dory, Michal Parter, Merav Weimann, Oren Department of Computer Science University of Haifa Israel Department of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot Israel

ISBN: (纸本)9783959773522

The dual of a planar graph G is a planar graph G∗ that has a vertex for each face of G and an edge for each pair of adjacent faces of G. The profound relationship between a planar graph and its dual has been the algorithmic basis for solving numerous (centralized) classical problems on planar graphs involving distances, flows, and cuts. In the distributed setting however, the only use of planar duality is for finding a recursive decomposition of G [DISC 2017, STOC 2019]. In this paper, we extend the distributed algorithmic toolkit (such as recursive decompositions and minor-aggregations) to work on the dual graph G∗. These tools can then facilitate various algorithms on G by solving a suitable dual problem on G∗. Given a directed planar graph G with hop-diameter D, our key result is an Õ(D2)-round algorithm1 for Single Source Shortest Paths on G∗, which then implies an Õ(D2)-round algorithm for Maximum st-Flow on G. Prior to our work, no Õ(Poly(D))-round algorithm was known for Maximum st-Flow. We further obtain a D·no(1)-rounds (1 + ϵ)-approximation algorithm for Maximum st-Flow on G when G is undirected and s and t lie on the same face. Finally, we give a near optimal Õ(D)-round algorithm for computing the weighted girth of G. The main challenges in our work are that G∗ is not the communication graph (e.g., a vertex of G is mapped to multiple vertices of G∗), and that the diameter of G∗ can be much larger than D (i.e., possibly by a linear factor). We overcome these challenges by carefully defining and maintaining subgraphs of the dual graph G∗ while applying the recursive decomposition on the primal graph G. The main technical difficulty, is that along the recursive decomposition, a face of G gets shattered into (disconnected) components yet we still need to treat it as a dual node. © Yaseen Abd-Elhaleem, Michal Dory, Merav Parter, and Oren Weimann.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Radial solution of the Logarithmic Laplacian system

引用

applied mathematics(A Journal of Chinese Universities) 2024年第1期39卷 114-124页

作者： ZHANG Li-hong NIE Xiao-feng WANG Guo-tao Bashir Ahmad School of Mathematics and Computer Science Shanxi Normal UniversityLinfen 041004China Nonlinear Analysis and Applied Mathematics(NAAM)Research Group Department of MathematicsFaculty of ScienceKing Abdulaziz UniversityJeddah 21589Saudi Arabia.

The paper generalizes the direct method of moving planes to the Logarithmic Laplacian ***,some key ingredients of the method are discussed,for example,Narrow region principle and Decay at ***,the radial symmetry of th... 详细信息

关键词： the Logarithmic Laplacian system radial symmetry the direct method of moving planes

来源：评论

学校读者我要写书评

暂无评论

Two Views on Unification: Terms as Strategies 44

Two Views on Unification: Terms as Strategies

引用

44th IARCS Annual Conference on Foundations of Software Technology and Theoretical computer science, FSTTCS 2024

作者： Honsell, Furio Lenisa, Marina Scagnetto, Ivan Department of Mathematics Computer Science and Physics University of Udine Italy

ISBN: (纸本)9783959773553

In [19], the authors have shown that linear application in Geometry of Interaction (GoI) models of λ-calculus amounts to resolution between principal types of linear λ-terms. This analogy also works in the reverse direction. Indeed, an alternative definition of unification between algebraic terms can be given by viewing the terms to be unified as strategies, i.e. sets of pairs of occurrences of the same variable, and verifying the termination of the GoI interaction obtained by playing the two strategies. In this paper we prove that such a criterion of unification is equivalent to the standard one. It can be viewed as a local, bottom-up, definition of unification. Dually, it can be understood as the GoI interpretation of unification. The proof requires generalizing earlier work to arbitrary algebraic constructors and allowing for multiple occurrences of the same variable in terms. In particular, we show that two terms σ and τ unify if and only if R(σ) ⊆ R(τ);(R(σ);R(τ))∗ and R(τ) ⊆ R(σ);(R(τ)b;R(σ))∗, where R(σ) denotes the set of pairs of paths leading to the same variable in the term σ, ⊆ denotes "inclusion up to substitution"and b;denotes "composition up to substitution". © 2024 Furio Honsell, Marina Lenisa, and Ivan Scagnetto.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

Modelling and simulation of energy management of power-split hybrid electric vehicles using the discrete EVent system specification

引用

International Journal of Vehicle Systems Modelling and Testing 2024年第1期18卷 33-61页

作者： Maatoug, Abdelfettah Kharoubi, Sahraoui Maaskri, Moustafa Belalem, Ghalem Mahmoudi, Said Faculty of Applied Sciences Science and Technology Department University of Tiaret Tiaret14000 Algeria Faculty of Mathematics and Computer Science Computer Science Department University of Tiaret Tiaret14000 Algeria Faculty of Applied Sciences Electrical Engineering Department University of Tiaret Tiaret14000 Algeria Faculty of Exact and Applied Sciences Computer Science Department University of Oran 1 Ahmed Ben Bella Oran31000 Algeria Faculty of Engineering Computer Science Department University of Mons Mons7000 Belgium

This work provides a basis for studying energy management optimisation in power-split hybrid electric vehicles (PSHEVs) to reduce fuel consumption and increase powertrain efficiency by enforcing a strategy related to battery level and vehicle speed. Three modes were used to operate the vehicle to meet different situations related to available energy and desired speed. These are particularly abundance mode, ascetic mode and optimal mode. For this, a system was designed based on several sub-models written in the discrete EVent system (DEVS) specification. The vehicle's power train and control strategy models were created in the DEVSimPy environment, and a joint simulation was carried out from the composite sub models until the overall model is reached. Simulation results under several driving cycles showed that the proposed system improves the energy consumption of the vehicle in different operating modes of the engines and gives more opportunities to adopt electric motors in vehicle transmission. © 2024 Inderscience Enterprises Ltd.

关键词： Energy management

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：