Pub Date : 2023-12-18DOI: 10.31926/but.mif.2023.3.65.2.4
G. Anastassiou
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.
{"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}
Pub Date : 2023-12-18DOI: 10.31926/but.mif.2023.3.65.2.14
∗. AlexandraB˘AICOIANU, Ioana Plajer
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.
{"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}
Pub Date : 2023-12-18DOI: 10.31926/but.mif.2023.3.65.2.1
U. Abel, O. Agratini
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.
本说明涉及对帕尔塔内亚（R. Paltanea）于 2008 年提出的近似线性正过程的研究。考虑到这一类取决于两个参数的算子的影响，我们在一个单独的章节中简要介绍了不同论文中强调的主要性质。我们的贡献体现在对这些算子的 King 变体的近似性质的定义和研究上。
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：