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

An infrastructure software perspective toward computation offloading between executable specifications and foundation models

引用

science China(Information sciences) 2025年第4期68卷 380-382页

作者： Dezhi RAN Mengzhou WU Yuan CAO Assaf MARRON David HAREL Tao XIE Key Laboratory of High Confidence Software Technologies (PKU) Ministry of Education School of Computer SciencePeking University School of Electronics Engineering and Computer Science Peking University Department of Computer Science and Applied Mathematics Weizmann Institute of Science

Foundation models(FMs) [1] have revolutionized software development and become the core components of large software systems. This paradigm shift, however, demands fundamental re-imagining of software engineering theories and methodologies [2]. Instead of replacing existing software modules implemented by symbolic logic, incorporating FMs' capabilities to build software systems requires entirely new modules that leverage the unique capabilities of ***, while FMs excel at handling uncertainty, recognizing patterns, and processing unstructured data, we need new engineering theories that support the paradigm shift from explicitly programming and maintaining user-defined symbolic logic to creating rich, expressive requirements that FMs can accurately perceive and implement.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Nonlinearity in Large-Cycle Cellular Automata

引用

Complex Systems 2025年第1期34卷 129-160页

作者： Mukherjee, Sukanya Adak, Sumit Department of Computer Science and Engineering Institute of Engineering and Management Kolkata University of Engineering and Management West Bengal Kolkata700091 India Department of Applied Mathematics and Computer Science DTU Compute Technical University of Denmark Kgs. Lyngby2800 Denmark

The class of maximal-length cellular automata (CAs) has gained significant attention over the last few years due to the fact that it can generate cycles with the longest possible lengths. For every l of the form l = 2n-1 where n ∈ , a cycle of length l can be generated by a cellular automaton (CA) of size ⌊log2 l⌋ + 1;this maximal-length CA is in fact the optimal (minimum-sized) CA to generate a cycle of length l. However, maximal-length CAs are, in general, linear and have some drawbacks. Moreover, it is nontrivial to address this problem for any l ∈ , that is, removing the constraint that l is of the form 2n-1. In this paper we therefore employ nonlinearity in the rules and aim to generate the near-optimal CA for any given cycle length l, meaning that the generated CAs will be of size n = (⌊log2 l⌋ + 1) + d, where the displacement d is as small as possible. We use a generic operator to concatenate a collection of component CAs of sizes n1, n2, …, nk by employing an evolutionary strategy. Here, n = n1 + n2 + ⋯ + nk and l ≥ lcm(1, 2, …, k ), where i (1 ≤ i ≤ k) is the maximum cycle length of a CA of size ni . An influencing factor in the design of component CAs is to achieve the near-optimal CA for a given cycle length. Here we consider nonlinear reversible large-cycle CAs as component CAs. We also measure the effectiveness of nonlinearity in large-cycle generation. © 2025, Complex Systems Publications, Inc. All rights reserved.

关键词： CAs cellular automata evolution large-cycle CA neighborhood dependent nonlinearity reversible CAs

来源：评论

学校读者我要写书评

暂无评论

Improved Bounds on the Size of Permutation codes under Kendall τ-metric

引用

IEEE Transactions on Information Theory 2025年第6期71卷 4156-4166页

作者： Parvaresh, Farzad Sobhani, Reza Abdollahi, Alireza Bagherian, Javad Jafari, Fatemeh Khatami, Maryam University of Isfahan Faculty of Engineering Department of Electrical Engineering Isfahan Iran School of Mathematics Tehran19395-5746 Iran University of Isfahan Faculty of Mathematics and Statistics Department of Applied Mathematics and Computer Science Isfahan81746-73441 Iran University of Isfahan Faculty of Mathematics and Statistics Department of Pure Mathematics Isfahan81746-73441 Iran

In order to overcome the challenges caused by flash memories and also to protect against errors related to reading information stored in DNA molecules in the shotgun sequencing method, the rank modulation method has been proposed. In the rank modulation framework, codewords are permutations. In this paper, we study the largest size P(n, d) of permutation codes of length n, i.e., subsets of the set Sn of all permutations on {1, ..., n} with the minimum distance at least (Formula presented) under the Kendall τ-metric. By presenting an algorithm and two theorems, we improve the known lower and upper bounds for P(n, d). In particular, we show that P(n, d) = 4 for all n ≥ 6 and (Formula presented). Additionally, we prove that for any prime number n and integer (Formula presented). This result greatly improves the upper bound of P(n, 3) for all primes n ≥ 37. © 1963-2012 IEEE.

关键词： Flash memory

来源：评论

学校读者我要写书评

暂无评论

Comparative analysis of carbon dioxide and hydrogen plume migration in aquifers inspired by the FluidFlower benchmark study

引用

International Journal of Hydrogen Energy 2025年 135卷 56-68页

作者： Misaghi Bonabi, Amin van Rooijen, Willemijn Al Kobaisi, Mohammed Vuik, Cornelis Hajibeygi, Hadi Department of Applied Mathematics Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Delft Netherlands Department of Geoscience and Engineering Faculty of Civil Engineering and Geosciences Delft University of Technology Delft Netherlands

Large-scale geological storages of hydrogen (H2) and carbon dioxide (CO2) in saline aquifers present feasible options for a sustainable energy future. We compared the plume migration of CO2 and H2 in aquifers using the FluidFlower benchmark, incorporating the state-of-the-art thermophysical and petrophysical properties. The H2 plume, with its higher buoyancy and mobility compared to CO2, remains predominantly in the gas phase due to its lower solubility, increasing the chances of escaping through fractures or migration to distant regions. This additionally leads to a higher pressurized reservoir, which, along with higher buoyancy, increases the chance of caprock penetration. Dissolution trapping of CO2 into brine increases over time due to its fingering, while H2 does not show fingering. Our findings show that while geological carbon storage (GCS) benefits significantly from all structural, dissolution, and residual trapping, underground hydrogen storage (UHS) relies mainly on structural trapping, making the integrity of sealing elements of the system a key factor in its performance. © 2025 The Authors

关键词： Two phase flow

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Degree reduction of ball Said-Ball surfaces using an enhanced coot optimization algorithm

Degree reduction of ball Said-Ball surfaces using an enhance...

引用

作者： Hu, Gang Dou, Wanting Du, Bo Department of Applied Mathematics Xi'an University of Technology Xi'an China School of Computer Science and Engineering Xi'an University of Technology Xi'an China

Degree reduction of ball Said-Ball (BSB) surface is a complex and unsolved problem in computer-aided design (CAD) and computer graphics (CG), which has potential application prospects in many engineering fields of geometric modeling. In this paper, the degree reduction of BSB surface is transformed into the optimization problems of center surface and radius function, and the improved coot optimization algorithm is used to solve it. An effective method to solve the degree reduction of BSB surface by intelligent optimization algorithm is proposed. Firstly, the degree reduction of BSB surface is decomposed into center surface reduction and radius function reduction, and the objective function and constraint conditions are determined according to the optimization idea, then the degree reduction optimization model of center surface and radius function is established. Secondly, an enhanced coot (ECOOT for short) algorithm is proposed, which combines chain strategy, dispersed foraging strategy, and quadratic interpolation strategy. Compared with the original algorithm, ECOOT algorithm has better convergence performance and higher calculation accuracy. Finally, the proposed ECOOT algorithm is used to solve the degree reduction optimization model, and the optimal center surface and minimum distance radius function of the BSB surface after degree reduction are obtained. The experimental results show that the ECOOT algorithm can effectively solve the problem of degree reduction for BSB surface, the degree reduction error is reduced by about 20% compared to the original COOT algorithm, and is superior to other intelligent optimization algorithms in accuracy, robustness, and convergence. © 2023 John Wiley & Sons, Ltd.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Enhancing Urban Air Quality with Smart Vehicle Exhaust Management

引用

Operations Research Forum 2025年第2期6卷 1-24页

作者： Tyagi, Vaishali Dubey, Roshan Singh, Suraj Ram, Mangey Department of Applied Sciences & Humanities ABES Institute of Technology Uttar Pradesh Ghaziabad India Department of Computer Science & Engineering ABES Institute of Technology Uttar Pradesh Ghaziabad India Department of Mathematics Computer Science and Engineering Graphic Era Deemed to be University Uttarakhand Dehradun India

Air pollution is the contamination of the indoor or outdoor environment by any chemical, physical, or biological agent that modifies the natural characteristics of the atmosphere. Burning gasoline and diesel fuel creates harmful byproducts like nitrogen dioxide, carbon monoxide, hydrocarbons, benzene, and formaldehyde. This study proposes a sensor-based model to control vehicular pollution by monitoring emission levels and preventing vehicles from operating if their pollution exceeds government standards. The proposed model consists of a smoke sensor, particulate sensors, carbon monoxide sensors, along with Arduino based microcontroller, data logger, LCD display, and GPRS modem. Using the block diagram, a mathematical model has been developed and some differential equations by using Markov process have been generated. This Markov-based model gives the information about the failure causes and working of the proposed system. Some reliability matrices like availability, mean time between failure (MTBF), and sensitivity analysis have been evaluated with the help of Laplace transform and illustrated with the help of graphs. Also, the failure cases of the system and its cost analysis have been done along with all the numerical calculations required for the successful operation of the model. © The Author(s), under exclusive licence to Springer Nature Switzerland AG 2025.

关键词： Air pollution Cost analysis Failure cases Markov process Reliability Sensor system

来源：评论

学校读者我要写书评

暂无评论

Some Results on Ricci-Yamabe Soliton and Its Cosmological Models

引用

IAENG International Journal of applied mathematics 2025年第4期55卷 979-983页

作者： Pandey, Pankaj Yadav, Santosh Kumar Sharma, Kamakshi Chaturvedi, Braj Bhushan Department of Mathematics School of Chemical Engineering and Physical Sciences Lovely Professional University Punjab Phagwara144411 India Department of Mathematics School of Computer Science & Artificial Intelligence SR University Telangana Warangal506371 India Department of Pure & Applied Mathematics Guru Ghasidas Vishwavidyalaya Chhattisgarh Bilaspur495009 India

This article aims to investigate the characteristics of Ricci-Yamabe Soliton (briefly: (RYS)n). We study the cosmological models on (RYS)4 under Lorentzian para Sasakian (LPS)4 spacetime. Parallel Ricci tensor, Poisson structure and gradient property also reveal on (RYS)n. Example of (RYS)4 constructed to verify the results. © (2025), (International Association of Engineers). All rights reserved.

关键词： Solitons

来源：评论

学校读者我要写书评

暂无评论

Online Menu-Based Scheduling of Electric Vehicle Charging

引用

IEEE Transactions on Smart Grid 2025年第3期16卷 2478-2491页

作者： Mathioudaki, Angeliki Tsaousoglou, Georgios Varvarigos, Emmanouel Fotakis, Dimitris National Technical University of Athens School of Electrical and Computer Engineering Zografou15772 Greece Technical University of Denmark Department of Applied Mathematics and Computer Science Section for Dynamical Systems Kongens Lyngby2800 Denmark Archimedes Research Unit Athena Research Center Marousi15125 Greece

This paper addresses the problem of efficiently scheduling of EV charging requests in a single Charging Station (CS), also taking into consideration the inability of EV users to express their preferences in closed-form utility functions. We consider a paradigm where a menu of possible charging intervals, each associated with an urgency price, is generated online. By letting the EV users pick their most preferable menu option, the proposed algorithm commits on each EV’s charging completion time upon its arrival, achieves a near optimal total weighted charging completion time, and prevents the users from strategically misreporting their preferences, while offering a practical and implementable solution to the problem of EVs - charging station interaction. Our experimental evaluation demonstrates that our algorithmic approach performs nearly optimal in a variety of practically relevant scenarios. © 2010-2012 IEEE.

关键词： Charging stations

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：