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

Optimal Lot Size and Backordered Quantity Under Carbon Tax

International Journal of applied and Computational mathematics 2024年第4期10卷 1-16页

作者： Raiya, Geetanjali Mittal, Mandeep Department of Mathematics Amity Institute of Applied Sciences Amity University Uttar Pradesh Noida 201313 India Department of Mathematics School of Computer Science Engineering and Technology Bennett University Uttar Pradesh Greater Noida India

Researchers and industry are working together to develop low carbon inventory models that comply with carbon pricing regulations while maintaining company profits. However, this task becomes more challenging when companies also face issues related to product quality imperfections. To address this issue, a new study has developed an economic order quantity (EOQ) model that takes into account carbon emission tax, defective rates, selling prices, imperfect items, scrap items and backordering. The objective of this mathematical model is reduce overall expenses, encompassing emissions-related costs. A numerical example is come up to adorn the model, based on previous data. Sensitivity analysis has also been performed to validate the model and understand system characteristics, identifying the factors that affect total emissions. © The Author(s), under exclusive licence to Springer Nature India Private Limited 2024.

关键词： Carbon tax Defective items EOQ Optimization Shortages

来源：评论

学校读者我要写书评

暂无评论

Precision spectral line-resolution to classify greenhouse gas species in broadband mid-infrared sensing

Precision spectral line-resolution to classify greenhouse ga...

引用

2023 Conference on Lasers and Electro-Optics, CLEO 2023

作者： Alexis, Al Juracka, Zayna Juracka, Zakaria Khan, Amir Division of Physics Engineering Mathematics and Computer Science Optical Science Center for Applied Research Delaware State University DoverDE19901 United States

ISBN: (纸本)9781957171258

We present a novel methodology to classify greenhouse gas species by investigating the structural complexity of broadband overlapping molecular lines in the spectral region of 7.0 μm to 8.0 urn. The structural information is classified by resolving peaks and zero crossings by adaptive learning methods. © Optica Publishing Group 2023 © 2023 The Author(s)

关键词： Greenhouse gases

来源：评论

学校读者我要写书评

暂无评论

Set-based Particle Swarm Optimization for Data Clustering: Comparison and Analysis of Control Parameters 23

Set-based Particle Swarm Optimization for Data Clustering: C...

引用

7th International Conference on Intelligent Systems, Metaheuristics and Swarm Intelligence, ISMSI 2023

作者： de Wet, Rijk Marius Engelbrecht, Andries Department of Industrial Engineering Stellenbosch University Stellenbosch South Africa Computer Science Division Stellenbosch University Stellenbosch South Africa Center for Applied Mathematics and Bioinformatics Gulf University for Science and Technology Kuwait

ISBN: (纸本)9781450399920

Data clustering is a highly studied field of data science and computational intelligence. Population-based algorithms such as particle swarm optimization (PSO) have shown to be effective at data clustering. Set-based particle swarm optimization (SBPSO) is a generic set-based PSO variant that has shown promise in clustering stationary and non-stationary data. In this paper, SBPSO is used to cluster fifteen datasets with diverse characteristics. The clustering ability of SBPSO is compared in depth to the performance of six other tuned clustering algorithms. A sensitivity analysis of the SBPSO control parameters is performed to determine the effect that variation in these control parameters have on swarm diversity and other measures. SBPSO ranked third from among the algorithms evaluated and proved a viable clustering algorithm. A trade-off between swarm diversity and clustering ability was discovered, and the control parameters that control this trade-off were determined. © 2023 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Sensitivity analysis

来源：评论

学校读者我要写书评

暂无评论

Time-Consistency in Dynamic Cooperative Games with Multiple Trajectories 1

引用

8th International Scientific Conference on Intelligent Information Technologies for Industry, IITI 2024

作者： Li, Zekun Li, Yin Qiao, Wenwen Cheng, Wantong Department of Applied Mathematics and Process Control Saint Petersburg State University Saint Petersburg Russia School of Mathematics Harbin Institute of Technology Harbin China School of Mathematics and Computer Science Yanan University Yanan China

ISBN: (数字)9783031776885

ISBN: (纸本)9783031776878

This paper considers the time consistency of multistage cooperative games in which there are multiple optimal trajectories with complete information. In dynamic cooperative games, an important condition for the distribution of players’ payoffs is that individual rationality needs to be satisfied. If the players’ payoffs do not satisfy individual rationality as the game progresses along the cooperative trajectory, some players will deviate from the cooperative trajectory. If there are multiple optimal trajectories in the multistage game, the situation is further complicated by the fact that the players’ payoffs always satisfy individual rationality on some of the optimal trajectories, but not on others. Alternatively, players’ individual rationality conditions are quite different along different optimal trajectories. Therefore, four different scenarios of multi-stage cooperative games with multiple optimal trajectories are set up in the study and analysed for each of the four different situations. Four different Payoff Distribution Procedure (PDP) formulations are proposed to modify the players’ payoff distributions so that the game satisfies time-consistency on different optimal trajectories. Several theorems are given, and proofs are provided, with corresponding examples. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： Multiple optimal trajectories Multistage cooperative games Time consistency

来源：评论

学校读者我要写书评

暂无评论

Improve Harris Hawkes optimizer algorithm via Laplace crossover

引用

Journal of Ambient Intelligence and Humanized Computing 2024年第4期15卷 2057-2072页

作者： Nasab, Seyed Taha Mousavi Abualigah, Laith Department of Applied Mathematics Iran University of Science and Technology Tehran Iran Computer Science Department Al al-Bayt University Mafraq25113 Jordan Hourani Center for Applied Scientific Research Al-Ahliyya Amman University Amman19328 Jordan MEU Research Unit Middle East University Amman11831 Jordan Department of Electrical and Computer Engineering Lebanese American University Byblos Lebanon

Nowadays, the speed of solving optimization problems by increasing various issues and the number of variables is critical. The Harris Hawk optimization method is a brand-new, intelligent system that resolves optimization issues by mathematically simulating the natural behavior of hawks. In this study, the Harris Hawks optimization method and the Laplace crossover operator are merged, and a new enhanced Harris Hawks algorithm (LX-HHO) based on the Laplace optimization algorithm is suggested. The purpose of improving this algorithm is to increase the convergence speed while maintaining good accuracy in achieving the optimal solution. The results of the proposed method on the test functions demonstrate that the algorithm has achieved faster convergence than the original version of the Harris Hawks algorithm and other meta-heuristic algorithms. This is due to the algorithm's accuracy in obtaining the best answer in these functions and to a reduction in the evaluation of the optimization function. Also, comparing and evaluating the proposed algorithm with other algorithms by Friedman and MAE test shows the superiority of the LX-HHO algorithm. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Adaptive energy-preserving algorithms for guiding center system

引用

Plasma science and technology 2023年第4期25卷 11-22页

作者：朱贝贝刘健张嘉炜祝爱卿唐贻发 Department of Applied Mathematics School of Mathematics and PhysicsUniversity of Science and Technology BeijingBeijing 100083Peopleʼs Republic of China School of Nuclear Science and Technology University of Science and Technology of ChinaHefei 230026Peopleʼs Republic of China Advanced algorithm Joint Lab Shandong Computer Science CenterQilu University of TechnologyJinan 250014Peopleʼs Republic of China The State Key Laboratory of Scientific and Engineering Computing The Institute of Computational Mathematics and Scientific/Engineering ComputingAcademy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing 100190Peopleʼs Republic of China School of Mathematical Sciences University of Chinese Academy of SciencesBeijing 100049Peopleʼs Republic of China

We develop two types of adaptive energy preserving algorithms based on the averaged vector field for the guiding center dynamics,which plays a key role in magnetized *** adaptive scheme is applied to the Gauss Legendre’s quadrature rules and time stepsize respectively to overcome the energy drift problem in traditional energy-preserving *** new adaptive algorithms are second order,and their algebraic order is carefully *** results show that the global energy errors are bounded to the machine precision over long time using these adaptive algorithms without massive extra computation cost.

关键词： guiding center system energy-preserving methods adaptive energy conservation

来源：评论

学校读者我要写书评

暂无评论

A DYNAMICAL SYSTEM APPROACH WITH FINITE-TIME STABILITY FOR SOLVING GENERALIZED MONOTONE INCLUSION WITHOUT MAXIMALITY

Applied Set-Valued Analysis and Optimization

引用

applied Set-Valued Analysis and Optimization 2024年第3期6卷 371-383页

作者： Tran, Nam V. Le, Hai T.T. Faculty of Mathematics and Computer Science University of Science Ho Chi Minh City Viet Nam Vietnam National University Ho Chi Minh City Viet Nam Faculty of Applied Sciences HCMC University of Technology and Education Ho Chi Minh City Viet Nam

In this paper, we introduce a forward-backward splitting dynamical system designed to address the inclusion problem of the form 0 ∈ G(x) + F(x), where G is a multi-valued operator and F is a single-valued operator in Hilbert spaces. The involved operators are required to satisfy a generalized monotonicity condition, which is less restrictive than standard monotone assumptions. Also, the maximality property does not impose on our involved operators. With mild conditions on parameters, we demonstrate the finite-time stability of the proposed dynamical system. We also present some applications to other optimization problems, such as Constrained Optimization Problems (COPs), Mixed Variational Inequalities (MVIs), and Variational Inequalities (VIs). ©2024 applied Set-Valued Analysis and Optimization.

关键词： Dynamical systems

来源：评论

学校读者我要写书评

暂无评论

An Attention Mechanism Based AVOD Network for 3D Vehicle Detection

IEEE Transactions on Intelligent Vehicles

引用

IEEE Transactions on Intelligent Vehicles 2023年 1-13页

作者： Yuan, Di Zhang, Haiping Shu, Xiu Liu, Qiao Chang, Xiaojun He, Zhenyu Shi, Guangming Guangzhou Institute of Technology Xidian University Xian China School of Computer Science and Cyber Engineering Guangzhou University Guangzhou China National Center for Applied Mathematics Chongqing Normal University Chongqing China Faculty of Engineering and Information Technology University of Technology Sydney Broadway New South Wales Australia School of Computer Science and Technology Harbin Institute of Technology Shenzhen China

With the continuous advancement of autonomous driving technology, 3D vehicle detection has become of widespread interest. The traditional aggregate view object detection (AVOD) framework has achieved some good results in 3D vehicle detection tasks. However, the complexity of the 3D vehicle detection scenario makes the current detection methods still not meet the actual requirements. To enhance the detection accuracy of 3D vehicle targets, we propose to equip an attention mechanism to improve the representation capability of feature maps, thereby further increasing the precision of 3D vehicle detection. Specifically, we have added the channel attention ECANet, spatial attention SANet, and mixed attention ECANet+SANet respectively into the image-based feature pyramid network of the AVOD detection framework, which can enhance the feature maps representation and improve the detection accuracy observably. The improved AVOD network is verified using the KITTI dataset. By showing the detection results of these attention mechanisms, it is found that the feature pyramid networks (FPN) module in the AVOD network based on Image has the best performance when integrating a mixed attention mechanism. In comparison to the original AVOD network, the detection results on the average precision index of the proposed method have improved by 2.29%, 2.81%, and 1.32% in the three indexes of simple, medium, and difficult, respectively. Extensive experiments have confirmed the practicality and efficacy of the AVOD network to equip the attention mechanisms for 3D vehicle detection. IEEE

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

ROAR: A Benchmark for NFT Rarity Meters 6

ROAR: A Benchmark for NFT Rarity Meters

引用

6th IEEE International Conference on Blockchain and Cryptocurrency, ICBC 2024

作者： Belousov, Dmitry Shuklin, Maksim Stepin, Alexander Yanovich, Yury Moscow Institute of Physics and Technology Phystech School of Applied Mathematics and Informatics Moscow Russia Hse University Faculty of Computer Science Moscow Russia Skolkovo Institute of Science and Technology Wireless Center Moscow Russia

ISBN: (纸本)9798350316742

Rarity meters are incorporated by industry and discursive by academia. Rarity, as an intuitive term, attracted numerous researchers to present their own view of it. While there is existing literature on comparing rarity meters, it requires access to NFT collection data, which can be challenging for researchers without a background in blockchain technology. This has created a demand for an easily accessible rarity meter benchmark. In this paper, we introduce the Rating over all Rarities (ROAR) benchmark, which includes data from one hundred popular NFT collections from the Ethereum blockchain, implemented a weighted correlation-based performance measurement function, as well as four state-of-the-art rarity meters (***, Kramer, OpenRarity, and NFTGo), along with a new rarity meter called ROAR. Our experiments show that the ROAR rarity meter, an ensemble of the other four meters, outperforms its competitors, with *** and Kramer as runner-ups. The ROAR benchmark is a tool for examination and testing of rarity meter ideas, and we challenge readers to develop models that can outperform the ROAR rarity meter. © 2024 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

ILP-Based Heuristics for the Multi-Modal Stable Matching Problem

引用

Tsinghua science and technology 2025年第2期30卷 479-487页

作者： Yang Yang Rolf H.Möhring Junteng Song Yicheng Xu Yong Zhang Shenzhen Institute of Advanced Technology Chinese Academy of SciencesShenzhen 518055China University of Chinese Academy of Sciences Beijing 101408China School of Applied Mathematics and Computer Science Technische Universität BerlinBerlin 10623Germany School of Mathematics and Information Science Hebei UniversityBaoding 071002China Guangxi Key Laboratory of Cryptography and Information Security Guilin University of Electronic TechnologyGuilin 541004China

In this paper,we investigate the stable matching problem with multiple preferences in bipartite graphs,where each agent has various preference lists for all available partners with respect to different *** problem requires that each matched agent must have exactly one partner and the obtained matching should be stable for all *** our main contribution,we present an integer linear programming(ILP)model for determining whether there exists a globally stable matching in bipartite graphs,which has been proved to be *** the time consumed for solving ILPs might dramatically increase as the size of instances grows,we develop a preprocessing technique that helps to eliminate pairs that will never be a member of any globally stable matching and thus accelerates the computing *** perform experiments on randomly generated preference lists and observe a significant speedup when we preprocess the instance before solving the *** there does not need to exist a perfect matching that is stable for all given criteria,we extend our ILP to the optimized version of the aforementioned problem,which asks to find a matching with maximum cardinality that is stable among all matched agents.

关键词： stable matching multi-modal integer linear programming(ILP)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：