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

Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics最新文献

筛选
英文 中文
Some Grüss type inequalities involving generalized fractional operator 涉及广义分数算子的几种gr<s:1> s型不等式
Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics Pub Date : 2019-07-30 DOI: 10.31926/but.mif.2019.12.61.1.4
S. Joshi, E. Mittal, R. Pandey, S. Purohit
{"title":"Some Grüss type inequalities involving generalized fractional operator","authors":"S. Joshi, E. Mittal, R. Pandey, S. Purohit","doi":"10.31926/but.mif.2019.12.61.1.4","DOIUrl":"https://doi.org/10.31926/but.mif.2019.12.61.1.4","url":null,"abstract":"","PeriodicalId":38784,"journal":{"name":"Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43802638","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}
引用次数: 2
Inverse maximum flow problem in planar networks 平面网络中的逆最大流问题
Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics Pub Date : 2019-07-30 DOI: 10.31926/but.mif.2019.12.61.1.10
L. Ciupala, Romania Brasov, A. Deaconu
{"title":"Inverse maximum flow problem in planar networks","authors":"L. Ciupala, Romania Brasov, A. Deaconu","doi":"10.31926/but.mif.2019.12.61.1.10","DOIUrl":"https://doi.org/10.31926/but.mif.2019.12.61.1.10","url":null,"abstract":"In this paper we consider the problem of inverse maximum flow in planar network (IMFPN), where upper bounds for the flow must be changed as little as possible so that a given feasible flow becomes a maximum flow in the modified network. A strongly polynomial algorithm for solving this problem is proposed. 2000 Mathematics Subject Classification: 90C27, 90C35, 68R10","PeriodicalId":38784,"journal":{"name":"Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46989770","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
Stability of essential spectra of closed operators under T-compact equivalence and applications T紧等价下闭算子本质谱的稳定性及其应用
Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics Pub Date : 2019-07-20 DOI: 10.31926/but.mif.2019.12.61.1.5
N. Khaldi, B. Messirdi
{"title":"Stability of essential spectra of closed operators under T-compact equivalence and applications","authors":"N. Khaldi, B. Messirdi","doi":"10.31926/but.mif.2019.12.61.1.5","DOIUrl":"https://doi.org/10.31926/but.mif.2019.12.61.1.5","url":null,"abstract":"The main subject of this paper is to introduce and study the concept of T -compact equivalence of closed linear operators in Hilbert spaces. Many results are proved via this equivalence, especially the invariance of essential spectra of T -compact equivalent closed operators. The results obtained are used to describe some Fredholm essential spectra of transport operators. 2000 Mathematics Subject Classification: 47A53, 47A55, 47N50","PeriodicalId":38784,"journal":{"name":"Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48159036","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
Rational approximation of the head equation in unbounded domain 无界域头部方程的有理逼近
Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics Pub Date : 2019-07-20 DOI: 10.31926/but.mif.2019.12.61.1.2
N. Arar
{"title":"Rational approximation of the head equation in unbounded domain","authors":"N. Arar","doi":"10.31926/but.mif.2019.12.61.1.2","DOIUrl":"https://doi.org/10.31926/but.mif.2019.12.61.1.2","url":null,"abstract":"In this paper, a Galerkin-type approximation using induced rational functions of Chebyshev polynomials is proposed and analyzed in order to deter-mine the solution of the heat equation over a whole R . We have shown by numerical tests that these new rational functions are very well adapted to approximations of PDEs in unbounded domain.","PeriodicalId":38784,"journal":{"name":"Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43902471","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
Parametric flows in static networks 静态网络中的参数流
Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics Pub Date : 2019-07-20 DOI: 10.31926/but.mif.2019.12.61.1.13
M. Parpalea
{"title":"Parametric flows in static networks","authors":"M. Parpalea","doi":"10.31926/but.mif.2019.12.61.1.13","DOIUrl":"https://doi.org/10.31926/but.mif.2019.12.61.1.13","url":null,"abstract":"Parametric flow problems may be regarded as some extensions of the classical maximum/minimum flow problems in which the capacities of certain arcs are not fixed but are functions of a parameter. Consequently, these problems consist of solving several nonparametric, ordinary maximum/min-imum flow problems for all the parameter values within certain subintervals of the parameter values. During the last few decades, research that has been conducted resulted in new solution methods and in improvements of the algorithms for known methods. This paper presents the continuous improvements that have been made during the last years as well as recent techniques and algorithms related to parametric maximum and minimum flow problems. The paper also constitutes a synthesis of the different approaches that have been proposed by us for solving the parametric flow problem in static networks.","PeriodicalId":38784,"journal":{"name":"Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45346175","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
Maximum flows in bipartite dynamic networks 二部动态网络中的最大流量
Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics Pub Date : 2019-07-20 DOI: 10.31926/but.mif.2019.12.61.1.14
Camelia Schiopu, Romania Brasov
{"title":"Maximum flows in bipartite dynamic networks","authors":"Camelia Schiopu, Romania Brasov","doi":"10.31926/but.mif.2019.12.61.1.14","DOIUrl":"https://doi.org/10.31926/but.mif.2019.12.61.1.14","url":null,"abstract":"In this paper we study maximum flow algorithms for stationary bipartite dynamic networks. In a bipartite static network the several maximum flow algorithms can be substantially improved. The basic idea in this improvement is a two arcs push rule. This idea is also extended to minimum cost flow. In the end of the paper we present an example. 2000 Mathematics Subject Classification: 0B10, 90C35, 05C35, 68R10.","PeriodicalId":38784,"journal":{"name":"Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49432529","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}
引用次数: 4
Example of routing protocols in delay tolerant networks 延迟容忍网络中的路由协议示例
Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics Pub Date : 2019-07-20 DOI: 10.31926/but.mif.2019.12.61.1.12
Corina-Stefania Nanau, Romania Brasov
{"title":"Example of routing protocols in delay tolerant networks","authors":"Corina-Stefania Nanau, Romania Brasov","doi":"10.31926/but.mif.2019.12.61.1.12","DOIUrl":"https://doi.org/10.31926/but.mif.2019.12.61.1.12","url":null,"abstract":"This paper is an extension of [7], which represents an overview of DTNs (Delay Tolerant Networks). The introduction of this article comes with a global view over this type of networks. The literature review section identifies some challenges that this type of network meets and one of the most important evaluation criteria for a DTN. This work comes with a new section which brings some examples of DTN routing algorithms that were introduced and presented in different papers. The personal remarks section contains some ideas about the routing algorithms and their performances in DTNs.","PeriodicalId":38784,"journal":{"name":"Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43430754","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
Minimum cost flow in a network with an overestimated arc capacity 过高估计电弧容量时网络的最小成本流
Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics Pub Date : 2019-07-20 DOI: 10.31926/but.mif.2019.12.61.1.9
L. Ciupala, Romania Brasov, A. Deaconu
{"title":"Minimum cost flow in a network with an overestimated arc capacity","authors":"L. Ciupala, Romania Brasov, A. Deaconu","doi":"10.31926/but.mif.2019.12.61.1.9","DOIUrl":"https://doi.org/10.31926/but.mif.2019.12.61.1.9","url":null,"abstract":"There are many situations in which minimum cost flows are solutions to real world problems. Sometimes, in these problems, minor data changes may occur and these will lead to corresponding changes in the networks, in which the practical problems are modeled as minimum cost flow problems. For instance, the capacity of an arc may increase or decrease in time. In this paper, the case in which the capacity of a given arc decreases by a given value a is studied. We focus on the problem of finding a minimum cost flow in a network that differs from the initial network G , in which a minimum cost flow has been already determined, only by the capacity of a given arc ( k, l ) which has been decreased by a units. We develop an algorithm for establishing a minimum cost flow in the modified network in O ( anm ) time, starting from the minimum cost flow in the original network.","PeriodicalId":38784,"journal":{"name":"Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43515966","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}
引用次数: 2
Computer consumer behavior modeling: multicriteria model for choosing ionizers 计算机消费者行为建模:选择电离器的多准则模型
Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics Pub Date : 2019-07-20 DOI: 10.31926/but.mif.2019.12.61.1.11
L. Dorokhova, O. Dorokhov
{"title":"Computer consumer behavior modeling: multicriteria model for choosing ionizers","authors":"L. Dorokhova, O. Dorokhov","doi":"10.31926/but.mif.2019.12.61.1.11","DOIUrl":"https://doi.org/10.31926/but.mif.2019.12.61.1.11","url":null,"abstract":"The object of the research in this article is the development of approaches, tools and instruments for computer modeling to predict the behavior of consumers (potential buyers and users) in the process of their implementation of consumer choice of technically complex household goods under circum-stances of broad supply in the retail market. Accordingly, the subject of this study was to consider the problem of multi-criteria choice of domestic appliances available on the Ukrainian home appliances market for monitoring and maintaining indoor air condition. The formulation and realization of relevant tasks with the subsequent development of applied program models were among the main goals of this work. As main methods we consistently used expert surveys of potential consumers, collection, processing, system-atization and analysis of information about the models of ionizers of air on the domestic market. Approaches to multi-criteria modeling of the process of consumer choice on a set of alternatives and their computer implementation in a specialized software product have also been taken into consideration. Computer simulation has confirmed the hypothesis that the approaches proposed makes it possible to obtain mathematically grounded generalized comparative estimates of the household appliances considered. This, in turn, allows consumers to make their choice more consciously, while manufacturers and sellers of such equipment are enabled to make a multi-criteria comparison between the products produced and sold by them.","PeriodicalId":38784,"journal":{"name":"Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44721184","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}
引用次数: 2
首页 上一页
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学术文献互助群
群 号：604180095
Book学术官方微信