发布求助
文献互助 智能选刊 最新文献

Mathematical foundations of computing最新文献

筛选
英文 中文
Approximation by modified Bernstein polynomials based on real parameters 基于实参数的修正Bernstein多项式近似
Mathematical foundations of computing Pub Date : 2023-01-01 DOI: 10.3934/mfc.2023005
Ruchi Singh Rajawat, Karunesh Singh, V. Mishra
{"title":"Approximation by modified Bernstein polynomials based on real parameters","authors":"Ruchi Singh Rajawat, Karunesh Singh, V. Mishra","doi":"10.3934/mfc.2023005","DOIUrl":"https://doi.org/10.3934/mfc.2023005","url":null,"abstract":"","PeriodicalId":93334,"journal":{"name":"Mathematical foundations of computing","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70220168","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Deferred statistical boundedness on time scales 时间尺度上的延迟统计有界性
Mathematical foundations of computing Pub Date : 2023-01-01 DOI: 10.3934/mfc.2023006
Pallav Bhattarai, H. Dutta
{"title":"Deferred statistical boundedness on time scales","authors":"Pallav Bhattarai, H. Dutta","doi":"10.3934/mfc.2023006","DOIUrl":"https://doi.org/10.3934/mfc.2023006","url":null,"abstract":"","PeriodicalId":93334,"journal":{"name":"Mathematical foundations of computing","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70220237","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Single-machine scheduling with coupled task and rejection 具有耦合任务和拒绝的单机调度
Mathematical foundations of computing Pub Date : 2023-01-01 DOI: 10.3934/mfc.2023008
Fanyu Kong, Cuixia Miao, Yujia Huo, Jiaxin Song
{"title":"Single-machine scheduling with coupled task and rejection","authors":"Fanyu Kong, Cuixia Miao, Yujia Huo, Jiaxin Song","doi":"10.3934/mfc.2023008","DOIUrl":"https://doi.org/10.3934/mfc.2023008","url":null,"abstract":"","PeriodicalId":93334,"journal":{"name":"Mathematical foundations of computing","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70220443","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Numerical method for the solution of nonlinear boundary value Problems (ODE) 非线性边值问题(ODE)的数值解法
Mathematical foundations of computing Pub Date : 2023-01-01 DOI: 10.3934/mfc.2023022
S. Dutta, B. Mishra
{"title":"Numerical method for the solution of nonlinear boundary value Problems (ODE)","authors":"S. Dutta, B. Mishra","doi":"10.3934/mfc.2023022","DOIUrl":"https://doi.org/10.3934/mfc.2023022","url":null,"abstract":"","PeriodicalId":93334,"journal":{"name":"Mathematical foundations of computing","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70220822","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Role of federated learning in healthcare systems: A survey 联合学习在医疗保健系统中的作用:一项调查
Mathematical foundations of computing Pub Date : 2023-01-01 DOI: 10.3934/mfc.2023023
Neeta Rana, Hitesh Marwaha
{"title":"Role of federated learning in healthcare systems: A survey","authors":"Neeta Rana, Hitesh Marwaha","doi":"10.3934/mfc.2023023","DOIUrl":"https://doi.org/10.3934/mfc.2023023","url":null,"abstract":"","PeriodicalId":93334,"journal":{"name":"Mathematical foundations of computing","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70220884","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Unified fast algorithms for building concept lattices 构建概念格的统一快速算法
Mathematical foundations of computing Pub Date : 2023-01-01 DOI: 10.3934/mfc.2023037
Xifeng Wang, Jianqin Zhou, Sichun Yang
{"title":"Unified fast algorithms for building concept lattices","authors":"Xifeng Wang, Jianqin Zhou, Sichun Yang","doi":"10.3934/mfc.2023037","DOIUrl":"https://doi.org/10.3934/mfc.2023037","url":null,"abstract":"","PeriodicalId":93334,"journal":{"name":"Mathematical foundations of computing","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70221160","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Generalized Kantorovich modifications of positive linear operators 正线性算子的广义Kantorovich修正
Mathematical foundations of computing Pub Date : 2023-01-01 DOI: 10.3934/mfc.2021042
A. Acu, Ioan Cristian Buşcu, I. Raşa
{"title":"Generalized Kantorovich modifications of positive linear operators","authors":"A. Acu, Ioan Cristian Buşcu, I. Raşa","doi":"10.3934/mfc.2021042","DOIUrl":"https://doi.org/10.3934/mfc.2021042","url":null,"abstract":"Starting with a positive linear operator we apply the Kantorovich modification and a related modification. The resulting operators are investigated. We are interested in the eigenstructure, Voronovskaya formula, the induced generalized convexity, invariant measures and iterates. Some known results from the literature are extended.","PeriodicalId":93334,"journal":{"name":"Mathematical foundations of computing","volume":"1044 1","pages":"54-62"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77639254","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Machine scheduling with job rejection and DeJong's learning effect 具有作业拒绝的机器调度与DeJong学习效应
Mathematical foundations of computing Pub Date : 2023-01-01 DOI: 10.3934/mfc.2022024
Jie Gao, Juan Zou, Xiaoxuan Cheng
{"title":"Machine scheduling with job rejection and DeJong's learning effect","authors":"Jie Gao, Juan Zou, Xiaoxuan Cheng","doi":"10.3934/mfc.2022024","DOIUrl":"https://doi.org/10.3934/mfc.2022024","url":null,"abstract":"<p style='text-indent:20px;'>This paper mainly discusses machine scheduling problems with job rejection and DeJong's learning effect. The goal is to determine the job sequence of the accepted jobs so as to minimize the scheduling cost of the accepted jobs plus the total rejection penalty of the rejected jobs. The scheduling costs of the accepted jobs are the makespan and the total completion time. For the single-machine setting, we show that both of the objectives can be optimally solved in polynomial time. For the parallel-machine setting, we show that minimizing the total completion time of the accepted jobs plus the total rejection penalty of the rejected jobs is still polynomially solvable, whereas the other problem is <inline-formula><tex-math id=\"M1\">begin{document}$ NP $end{document}</tex-math></inline-formula>-hard, for which we provide a fully polynomial-time approximation scheme (FPTAS).</p>","PeriodicalId":93334,"journal":{"name":"Mathematical foundations of computing","volume":"124 1","pages":"253-267"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77973230","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Error analysis of kernel regularized pairwise learning with a strongly convex loss 具有强凸损失的核正则化成对学习的误差分析
Mathematical foundations of computing Pub Date : 2023-01-01 DOI: 10.3934/mfc.2022030
Shuhua Wang, B. Sheng
{"title":"Error analysis of kernel regularized pairwise learning with a strongly convex loss","authors":"Shuhua Wang, B. Sheng","doi":"10.3934/mfc.2022030","DOIUrl":"https://doi.org/10.3934/mfc.2022030","url":null,"abstract":"This paper presents a detailed performance analysis for the kernel-based regularized pairwise learning model associated with a strongly convex loss. The robustness for the model is analyzed by applying an improved convex analysis method. The results show that the regularized pairwise learning model has better qualitatively robustness according to the probability measure. Some new comparison inequalities are provided, with which the convergence rates are derived. In particular an explicit learning rate is obtained in case that the loss is the least square loss.","PeriodicalId":93334,"journal":{"name":"Mathematical foundations of computing","volume":"18 1","pages":"625-650"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81807464","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Almost sure convergence for the maxima and minima of strongly dependent nonstationary multivariate Gaussian sequences 强相关非平稳多元高斯序列的极大值和极小值的几乎肯定收敛性
Mathematical foundations of computing Pub Date : 2023-01-01 DOI: 10.3934/mfc.2022044
Zhicheng Chen, Hongyun Zhang, Xinsheng Liu
{"title":"Almost sure convergence for the maxima and minima of strongly dependent nonstationary multivariate Gaussian sequences","authors":"Zhicheng Chen, Hongyun Zhang, Xinsheng Liu","doi":"10.3934/mfc.2022044","DOIUrl":"https://doi.org/10.3934/mfc.2022044","url":null,"abstract":"","PeriodicalId":93334,"journal":{"name":"Mathematical foundations of computing","volume":"13 1","pages":"728-741"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85001335","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信