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

Bulletin of the Transilvania University of Brasov. Series III: Mathematics and Computer Science最新文献

筛选
英文 中文
q-Deformed and λ-parametrized A-generalized logistic function based Banach space valued ordinary and fractional neural network approximation 基于巴纳赫空间值的普通和分数神经网络逼近的 q-变形和 λ-参数化 A 广义逻辑函数
Bulletin of the Transilvania University of Brasov. Series III: Mathematics and Computer Science Pub Date : 2023-12-18 DOI: 10.31926/but.mif.2023.3.65.2.4
G. Anastassiou
{"title":"q-Deformed and λ-parametrized A-generalized logistic function based Banach space valued ordinary and fractional neural network approximation","authors":"G. Anastassiou","doi":"10.31926/but.mif.2023.3.65.2.4","DOIUrl":"https://doi.org/10.31926/but.mif.2023.3.65.2.4","url":null,"abstract":"Here we research the univariate quantitative approximation, ordinary and fractional, of Banach space valued continuous functions on a compact interval or all the real line by quasi-interpolation Banach space valued neural network operators. These approximations are derived by establishing Jackson type inequalities involving the modulus of continuity of the engaged function or its Banach space valued high order derivative of fractional derivatives. Our operators are defined by using a density function generated by a q-deformed and λ-parametrized A-generalized logistic function, which is a sigmoid function. The approximations are pointwise and of the uniform norm. The related Banach space valued feed-forward neural networks are with one hidden layer.","PeriodicalId":505295,"journal":{"name":"Bulletin of the Transilvania University of Brasov. Series III: Mathematics and Computer Science","volume":"15 17","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139173634","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
Considerations on efficient lexical analysis in the context of compiler design 在编译器设计中对高效词法分析的考虑
Bulletin of the Transilvania University of Brasov. Series III: Mathematics and Computer Science Pub Date : 2023-12-18 DOI: 10.31926/but.mif.2023.3.65.2.14
∗. AlexandraB˘AICOIANU, Ioana Plajer
{"title":"Considerations on efficient lexical analysis in the context of compiler design","authors":"∗. AlexandraB˘AICOIANU, Ioana Plajer","doi":"10.31926/but.mif.2023.3.65.2.14","DOIUrl":"https://doi.org/10.31926/but.mif.2023.3.65.2.14","url":null,"abstract":"Each programming language needs a mechanism of translating source code into code understood by the computer, i.e., machine code or assembly. This is done by a compiler. A compiler is thus a fundamental tool for software development. Lexical analysis, as the first step of compilation, has an important role and should be performed in an optimal way. But not only compilers rely on lexical analysis. Its role lies nowadays also in pattern recognition or natural language processing. In this paper, we present some of the main aspects of lexical analysis and how to efficiently perform it. Our aim is to offer some guidelines in constructing a modern and efficient scanner (lexer), outlining the criteria, which should be considered, presenting some pitfalls, and comparing existent tools for compiler construction. The main contribution of the paper is to offer practical guidelines and recommendations, especially to graduate students and programmers, in constructing an efficient scanner (lexer), considering also the proper tools currently available.","PeriodicalId":505295,"journal":{"name":"Bulletin of the Transilvania University of Brasov. Series III: Mathematics and Computer Science","volume":"339 ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139174029","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
Paltanea’s operators: old and new results Paltanea 的运营商：新旧成果
Bulletin of the Transilvania University of Brasov. Series III: Mathematics and Computer Science Pub Date : 2023-12-18 DOI: 10.31926/but.mif.2023.3.65.2.1
U. Abel, O. Agratini
{"title":"Paltanea’s operators: old and new results","authors":"U. Abel, O. Agratini","doi":"10.31926/but.mif.2023.3.65.2.1","DOIUrl":"https://doi.org/10.31926/but.mif.2023.3.65.2.1","url":null,"abstract":"This note concerns the study of an approximation linear positive process introduced by R. Paltanea in 2008. Considering the impact of this class of operators that depends on two parameters, in a distinct section we present a brief radiograph of the main properties highlighted over time in various papers. Our contribution materializes in the definition and study of the approximation properties of the King variant of these operators.","PeriodicalId":505295,"journal":{"name":"Bulletin of the Transilvania University of Brasov. Series III: Mathematics and Computer Science","volume":"93 ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139175551","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学术官方微信