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

第35届中国控制与决策会议

作者： Wantong Cheng Min Cheng Qirui Sun Xuanping Fan Yin Li Faculty of Applied Mathematics and Control Processes St.Petersburg State University Department of Mathematics and Computer Science Yan'an University School of Mathematics Harbin Institute of Technology

This article considers a Stackelberg game with dynamic spanning *** leader will identify the edges between some of the followers,which will be shown in *** the followers will play a two-stage spanning tree game with "shock",which means that after the first stage,a specific follower will leave the game with a certain probability,which depends on the behavior of all the followers in the first *** equilibrium of the Stackelberg game with dynamic spanning tree is defined,and correlative conclusions are given.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Majority Spanning Trees, Cotrees and Their Applications 15th

Majority Spanning Trees, Cotrees and Their Applications

引用

15th International Conference on Algorithms and Computation, WALCOM 2021

作者： Kaykobad, Mohammad Salzborn, F.J.M. Department of Computer Science and Engineering BRAC University Dhaka Bangladesh Department of Applied Mathematics University of Adelaide Adelaide Australia

ISBN: (纸本)9783030682101

We show that in any digraph on an underlying connected graph with non-negative weights on its edges, there is a Majority Spanning Tree for which sum of weights of edges of a fundamental cutset, running along each edge of the spanning tree determining the cutset, is not less than sum of those running in opposite direction. Similarly, there is a Majority Cotree, each fundamental cycle of which has non-negative weight. We further prove simultaneous existence of majority spanning trees and majority cotrees in any non-negative weighted digraph. We have shown how these structures can be used to solved scheduling transports by minimizing sum of weighted connection times, ranking round-robin tournaments by minimizing number of upsets, in settling multiple debts and in construction of transport networks with unbalanced road capacity. © 2021, Springer Nature Switzerland AG.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Correction to: Value dividends, the Harsanyi set and extensions, and the proportional Harsanyi solution

引用

International Journal of Game Theory 2022年第3期51卷 607-608页

作者： Besner, Manfred Department of Geomatics Computer Science and Mathematics HFT Stuttgart University of Applied Sciences Stuttgart Germany

来源：评论

学校读者我要写书评

暂无评论

Price Prediction of Seasonal Items Using Time Series Analysis

引用

computer Systems science & Engineering 2023年第7期46卷 445-460页

作者： Ahmed Salah Mahmoud Bekhit Esraa Eldesouky Ahmed Ali Ahmed Fathalla Faculty of Computers and Informatics Zagazig UniversitySharkeya44523Egypt Information Technology Department the University of Technology and Applied SciencesIbriOman School of Electrical and Data Engineering University of Technology SydneySydney2007Australia College of Computer Engineering and Sciences Prince Sattam Bin Abdulaziz UniversityAl-Kharj11942Saudi Arabia Computer Science Department Faculty of Computers and InformaticsSuez Canal UniversityIsmailia41522Egypt Higher Future Institute for Specialized Technological Studies Cairo3044Egypt Department of Mathematics Faculty of ScienceSuez Canal UniversityIsmailia41522Egypt

The price prediction task is a well-studied problem due to its impact on the business *** are several research studies that have been conducted to predict the future price of items by capturing the patterns of price change,but there is very limited work to study the price prediction of seasonal goods(e.g.,Christmas gifts).Seasonal items’prices have different patterns than normal items;this can be linked to the offers and discounted prices of seasonal *** lack of research studies motivates the current work to investigate the problem of seasonal items’prices as a time series *** proposed utilizing two different approaches to address this problem,namely,1)machine learning(ML)-based models and 2)deep learning(DL)-based ***,this research tuned a set of well-known predictive models on a real-life *** models are ensemble learning-based models,random forest,Ridge,Lasso,and Linear ***,two new DL architectures based on gated recurrent unit(GRU)and long short-term memory(LSTM)models are ***,the performance of the utilized ensemble learning and classic ML models are compared against the proposed two DL architectures on different accuracy metrics,where the evaluation includes both numerical and visual comparisons of the examined *** obtained results show that the ensemble learning models outperformed the classic machine learning-based models(e.g.,linear regression and random forest)and the DL-based models.

关键词： Deep learning price prediction seasonal goods time series analysis

来源：评论

学校读者我要写书评

暂无评论

Generation and New Infinite Families of K2-hypohamiltonian Graphs

arXiv

引用

arXiv 2023年

作者： Goedgebeur, Jan Renders, Jarne Zamfirescu, Carol T. Department of Computer Science KU Leuven Campus Kulak-Kortrijk Kortrijk8500 Belgium Department of Applied Mathematics Computer Science and Statistics Ghent University Ghent9000 Belgium Department of Mathematics Babeş-Bolyai University Cluj-Napoca Romania

We present an algorithm which can generate all pairwise non-isomorphic K2-hypohamiltonian graphs, i.e. non-hamiltonian graphs in which the removal of any pair of adjacent vertices yields a hamiltonian graph, of a given order. We introduce new bounding criteria specifically designed for K2-hypohamiltonian graphs, allowing us to improve upon earlier computational results. Specifically, we characterise the orders for which K2-hypohamiltonian graphs exist and improve existing lower bounds on the orders of the smallest planar and the smallest bipartite K2-hypohamiltonian graphs. Furthermore, we describe a new operation for creating K2-hypohamiltonian graphs that preserves planarity under certain conditions and use it to prove the existence of a planar K2-hypohamiltonian graph of order n for every integer n ≥ 134. Additionally, motivated by a theorem of Thomassen on hypohamiltonian graphs, we show the existence K2-hypohamiltonian graphs with large maximum degree and *** Codes 05C38, 05C45, 05C85, 05C30, 05C76, 05C10 Copyright © 2023, The Authors. All rights reserved.

关键词： Hamiltonians

来源：评论

学校读者我要写书评

暂无评论

A Finite Difference Method for a Normalized Time-Fractional Black–Scholes Equation

引用

International Journal of applied and Computational mathematics 2025年第3期11卷 1-17页

作者： Nam, Yunjae Wang, Jian Lee, Chaeyoung Choi, Yongho Bang, Minjoon Li, Zhengang Kim, Junseok Program in Actuarial Science and Financial Engineering Korea University Seoul 02841 South Korea School of Mathematics and Statistics Nanjing University of Information Science and Technology Nanjing 210044 China Department of Mathematics Kyonggi University Suwon 16227 South Korea Computer and Information Engineering Daegu University Gyeongsan 38453 South Korea Department of Mathematics Korea University Seoul 02841 South Korea

In this article, we propose a normalized time-fractional Black–Scholes (TFBS) equation. The proposed model uses a normalized time-fractional derivative which has a distinctive feature wherein a weight function possesses the property that its integral with respect to time is always equal to one. This feature ensures a well-balanced integration over time and provides a fair comparison between different fractional orders. An implicit finite difference method is used for the numerical solution of the TFBS equation. We perform several standard numerical tests to examine the effect of the fractional parameter on the option pricing. These experiments are designed to investigate how variations in the fractional parameter influence pricing outcomes and provide valuable insights into the model’s behavior under different conditions. The computational results demonstrate the model’s potential for capturing more intricate market dynamics, which makes the proposed model a promising tool for financial analysis. In the appendix, we provide a computer program that implements the numerical methods discussed in the paper for interested readers. © The Author(s), under exclusive licence to Springer Nature India Private Limited 2025.

关键词： Implicit finite difference method Memory effect Normalized time-fractional Black–Scholes equation

来源：评论

学校读者我要写书评

暂无评论

No Imputation Without Representation 35th

No Imputation Without Representation

引用

35th Benelux Conference on Artificial Intelligence and Machine Learning, BNAIC/Benelearn 2023

作者： Lenz, Oliver Urs Peralta, Daniel Cornelis, Chris Leiden Institute of Advanced Computer Science Leiden University Leiden Netherlands Research Group for Computational Web Intelligence Department of Applied Mathematics Computer Science and Statistics Ghent University Ghent Belgium Department of Information Technology Ghent University Ghent Belgium

ISBN: (纸本)9783031746499

By filling in missing values in datasets, imputation allows these datasets to be used with algorithms that cannot handle missing values by themselves. However, missing values may in principle contribute useful information that is lost through imputation. The missing-indicator approach can be used in combination with imputation to instead represent this information as a part of the dataset. There are several theoretical considerations why missing-indicators may or may not be beneficial, but there has not been any large-scale practical experiment on real-life datasets to test this question for machine learning predictions. We perform this experiment for three imputation strategies and a range of different classification algorithms, on the basis of twenty real-life datasets. In a follow-up experiment, we determine attribute-specific missingness thresholds for each classifier above which missing-indicators are more likely than not to increase classification performance. And in a second follow-up experiment, we evaluate numerical imputation of one-hot encoded categorical attributes. We reach the following conclusions. Firstly, missing-indicators generally increase classification performance. Secondly, with missing-indicators, nearest neighbour and iterative imputation do not lead to better performance than simple mean/mode imputation. Thirdly, for decision trees, pruning is necessary to prevent overfitting. Fourthly, the thresholds above which missing-indicators are more likely than not to improve performance are lower for categorical attributes than for numerical attributes. Lastly, mean imputation of numerical attributes preserves some of the information from missing values. Consequently, when not using missing-indicators it can be advantageous to apply mean imputation to one-hot encoded categorical attributes instead of mode imputation. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Position: Bayesian Deep Learning is Needed in the Age of Large-Scale AI 41

Position: Bayesian Deep Learning is Needed in the Age of Lar...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Papamarkou, Theodore Skoularidou, Maria Palla, Konstantina Aitchison, Laurence Arbel, Julyan Dunson, David Filippone, Maurizio Fortuin, Vincent Hennig, Philipp Hernández-Lobato, José Miguel Hubin, Aliaksandr Immer, Alexander Karaletsos, Theofanis Khan, Mohammad Emtiyaz Kristiadi, Agustinus Li, Yingzhen Mandt, Stephan Nemeth, Christopher Osborne, Michael A. Rudner, Tim G.J. Rügamer, David Teh, Yee Whye Welling, Max Wilson, Andrew Gordon Zhang, Ruqi Department of Mathematics The University of Manchester Manchester United Kingdom Eric and Wendy Schmidt Center Broad Institute of MIT and Harvard Cambridge United States Spotify London United Kingdom Computational Neuroscience Unit University of Bristol Bristol United Kingdom Centre Inria de l'Université Grenoble Alpes Grenoble France Department of Statistical Science Duke University United States Statistics Program KAUST Saudi Arabia Helmholtz AI Munich Germany Department of Computer Science Technical University of Munich Munich Germany Munich Center for Machine Learning Munich Germany Tübingen AI Center University of Tübingen Tübingen Germany Department of Engineering University of Cambridge Cambridge United Kingdom Department of Mathematics University of Oslo Oslo Norway Bioinformatics and Applied Statistics Norwegian University of Life Sciences Ås Norway Department of Computer Science ETH Zurich Switzerland Chan Zuckerberg Initiative CA United States Center for Advanced Intelligence Project RIKEN Tokyo Japan Vector Institute Toronto Canada Department of Computing Imperial College London London United Kingdom Department of Computer Science UC Irvine Irvine United States Department of Mathematics and Statistics Lancaster University Lancaster United Kingdom Department of Engineering Science University of Oxford Oxford United Kingdom Center for Data Science New York University New York United States Department of Statistics LMU Munich Munich Germany DeepMind London United Kingdom Department of Statistics University of Oxford Oxford United Kingdom Informatics Institute University of Amsterdam Amsterdam Netherlands Courant Institute of Mathematical Sciences Center for Data Science Computer Science Department New York University New York United States Department of Computer Science Purdue University West Lafayette United States

In the current landscape of deep learning research, there is a predominant emphasis on achieving high predictive accuracy in supervised tasks involving large image and language datasets. However, a broader perspective reveals a multitude of overlooked metrics, tasks, and data types, such as uncertainty, active and continual learning, and scientific data, that demand attention. Bayesian deep learning (BDL) constitutes a promising avenue, offering advantages across these diverse settings. This paper posits that BDL can elevate the capabilities of deep learning. It revisits the strengths of BDL, acknowledges existing challenges, and highlights some exciting research avenues aimed at addressing these obstacles. Looking ahead, the discussion focuses on possible ways to combine large-scale foundation models with BDL to unlock their full potential. Copyright 2024 by the author(s)

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Characterization of the Three-Dimensional Fivefold Translative Tiles

arXiv

引用

arXiv 2023年

作者： Han, Mei Sriamorn, Kirati Yang, Qi Zong, Chuanming Center for Applied Mathematics Tianjin University Tianjin300072 China Department of Mathematics and Computer Science Chulalongkorn University Thailand College of Mathematics and Statistics Chongqing University China

MSC Codes 52C22, 52C23, 05B45, 52C17, 11H31This paper proves the following statement: If a convex body can form a fivefold translative tiling in E3, it must be a parallelotope, a hexagonal prism, a rhombic dodecahedron, an elongated dodecahedron, a truncated octahedron, a cylinder over a particular octagon, or a cylinder over a particular decagon, where the octagon and the decagon are fivefold translative tiles in E2. Furthermore, it presents an example of multiple tiles in E3 with multiplicity at most 10 which is neither a parallelohedron nor a cylinder. Copyright © 2023, The Authors. All rights reserved.

关键词： Cylinders (shapes)

来源：评论

学校读者我要写书评

暂无评论

Mathematical modeling and analysis of schistosomiasis transmission dynamics

引用

International Journal of Modeling, Simulation, and Scientific Computing 2021年第4期12卷 58-76页

作者： Umar T.Mustapha Salihu S.Musa Muhammad A.Lawan Aliyu Abba Evren Hincal Musa D.Mohammed Bashir D.Garba Rabiu B.Yunus Shehu A.Adamu Daihai He Department of Mathematics Near East University TRNC Mersin 10 Turkey Department of Mathematics Federal University Dutse Nigeria Department of Applied Mathematics The Hong Kong Polytechnic University Hong Kong Department of Mathematics Kano University of Science and Technology Wudil Nigeria Department of Statistics Jigawa State Polytechnic DutseNigeria Department of Computer Engineering Institute of Continuing Education Kano University of Science and Technology Wudil Nigeria Department of Mathematics and Statistics Kano State Polytechnic Nigeria

Schistosomiasis is a parasitic disease from the family of Schistosomatidae and genus Schistosoma,which is caused by blood *** disease is endemic in many countries and still a serious threat to global public health and *** this paper,a new deterministic model is designed and analyzed qualitatively to explore the dynamics of schistosomiasis transmission in human,cattle and snail *** from our mathematical analysis show that the model has a disease-free equilibrium(DFE)which is locally asymptotically stable(LAS)whenever a particular epidemiological threshold quantity,also known as basic reproduction number(R0)is less than *** analysis shows that the model has a unique endemic equilibrium(EE)which is globally asymptotically stable whenever R0>1 and unstable when R0<***,we adopt partial rank correlation coefficient for sensitivity analysis to reveal the most important parameters for effective control and mitigation of schistosomiasis disease in a ***,we obtain some numerical results by simulating the entire dynamics of the model,which show that the infections in the compartments of each population decrease with respect to *** further indicates that avoiding contact with infected human,cattle or infested water is vital to prevent the spread of schistosomiasis disease infection.

关键词： Schistosomiasis disease basic reproduction number stability analysis sensitivity analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：