Pub Date : 2019-09-01DOI: 10.1109/CSITechnol.2019.8895168
A. Prangishvili, H. Meladze, R. Kakubava, T. Davitashvili, N. Svanidze
In the present paper, a multi-unit redundant system with unreliable, repairable units is considered. Two types of maintenance operations - the replacement of the failed main unit by the redundant one and the repair of the failed unit - are performed. The case of the system with one replacement server with arbitrary replacement time distribution function and repair server with an exponential distribution of repair time is considered. For this system mixed-type semi-Markov queuing model with the bifurcation of arrivals is constructed. It represents a non-classical boundary value problem of mathematical physics with non-local boundary conditions.
{"title":"Semi-Markov Queuing System with Bifurcation of Arrivals for Network Maintenance Problem","authors":"A. Prangishvili, H. Meladze, R. Kakubava, T. Davitashvili, N. Svanidze","doi":"10.1109/CSITechnol.2019.8895168","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8895168","url":null,"abstract":"In the present paper, a multi-unit redundant system with unreliable, repairable units is considered. Two types of maintenance operations - the replacement of the failed main unit by the redundant one and the repair of the failed unit - are performed. The case of the system with one replacement server with arbitrary replacement time distribution function and repair server with an exponential distribution of repair time is considered. For this system mixed-type semi-Markov queuing model with the bifurcation of arrivals is constructed. It represents a non-classical boundary value problem of mathematical physics with non-local boundary conditions.","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130896125","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 : 2019-09-01DOI: 10.1109/CSITechnol.2019.8895251
E. Haroutunian
Generalizing the result of D. Kazacos for two hypotheses we consider the ternary detection problem of the Neyman-Pearson type under mismatch. For the case of independent identically distributed observations the sufficiency condition of existence of test with an exponentially dicreasing probability of error is formulated in terms of the new notion of “divergence for three distributions in certain order”.
{"title":"On Three Hypotheses Robust Detection Design Under Mismatch","authors":"E. Haroutunian","doi":"10.1109/CSITechnol.2019.8895251","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8895251","url":null,"abstract":"Generalizing the result of D. Kazacos for two hypotheses we consider the ternary detection problem of the Neyman-Pearson type under mismatch. For the case of independent identically distributed observations the sufficiency condition of existence of test with an exponentially dicreasing probability of error is formulated in terms of the new notion of “divergence for three distributions in certain order”.","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123496045","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 : 2019-09-01DOI: 10.1109/CSITechnol.2019.8895055
D. Sargsyan, G. Harutyunyan
This paper presents an end-to-end test solution for an automotive system on chips (SoCs). The presented multipurpose solution provides the possibility to select the appropriate test mechanisms at design stage, detect manufacturing faults during the production, check the safety mechanisms during power-up, as well as run periodic test during mission mode. A software automation tool and its application to a safety critical SoC are demonstrated to show the effectiveness and completeness of the proposed flow.
{"title":"Unified Test Generation and Application Flow for Automotive SoCs","authors":"D. Sargsyan, G. Harutyunyan","doi":"10.1109/CSITechnol.2019.8895055","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8895055","url":null,"abstract":"This paper presents an end-to-end test solution for an automotive system on chips (SoCs). The presented multipurpose solution provides the possibility to select the appropriate test mechanisms at design stage, detect manufacturing faults during the production, check the safety mechanisms during power-up, as well as run periodic test during mission mode. A software automation tool and its application to a safety critical SoC are demonstrated to show the effectiveness and completeness of the proposed flow.","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"295 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123087622","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 : 2019-09-01DOI: 10.1109/CSITechnol.2019.8895074
Arsen H. Mokatsian
Let us adduce some definitions. If A is a nonrecursive computably enumerable (c.e.) set, then a splitting of A is a pair A1, A2 of disjoint c.e. sets such that A1 U A2 = A.A c.e. set A is T-mitotic (wtt-mitotic) if there is a splitting A1, A2 of A such that A1 ≡T A2≡T A (A1 ≡wtt A2≡wtt A).In this article it is proved, that there exists a low c.e. degree u such that if v is a c.e. degree and u ≤ v, then v contains a hypersimple T-mitotic set, which is not wtt-mitotic.
让我们引证一些定义。如果A是一个nonrecursive可计算的枚举(公元)组,然后分裂的是一对A1, A2的着力点的A1 U A2 =一位刚建成时设置一个T-mitotic (wtt-mitotic)如果有分裂A1, A2的(A1, A2≡≡T T (A1≡≡wtt A2 wtt)。本文证明,存在一个低石球学位你这样如果v是一个石球程度和U≤v, v包含hypersimple T-mitotic集,这不是wtt-mitotic。
{"title":"On the Upper Cone of Degrees Containing Hypersimple T-Mitotic Sets Which are not wtt-Mitotic","authors":"Arsen H. Mokatsian","doi":"10.1109/CSITechnol.2019.8895074","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8895074","url":null,"abstract":"Let us adduce some definitions. If A is a nonrecursive computably enumerable (c.e.) set, then a splitting of A is a pair A<inf>1</inf>, A<inf>2</inf> of disjoint c.e. sets such that A<inf>1</inf> U A<inf>2</inf> = A.A c.e. set A is T-mitotic (wtt-mitotic) if there is a splitting A<inf>1</inf>, A<inf>2</inf> of A such that A<inf>1</inf> ≡<inf>T</inf> A<inf>2</inf>≡<inf>T</inf> A (A<inf>1</inf> ≡<inf>wtt</inf> A<inf>2</inf>≡<inf>wtt</inf> A).In this article it is proved, that there exists a low c.e. degree u such that if v is a c.e. degree and u ≤ v, then v contains a hypersimple T-mitotic set, which is not wtt-mitotic.","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114702946","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 : 2019-09-01DOI: 10.1109/CSITechnol.2019.8895005
M. Haroutunian
The basic wiretap channel model is considered. The aim is to maximize the rate of the reliable communication from the source to the legitimate receiver, while keeping the confidential information as secret as possible from the wiretapper (eavesdroper). The E-capacity - equivocation region, which is the generalization of the capacity - equivocation region, is investigated. The outer bound of this region is constructed.
{"title":"Outer Bound for E-capacity - Equivocation Region of the Wiretap Channel","authors":"M. Haroutunian","doi":"10.1109/CSITechnol.2019.8895005","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8895005","url":null,"abstract":"The basic wiretap channel model is considered. The aim is to maximize the rate of the reliable communication from the source to the legitimate receiver, while keeping the confidential information as secret as possible from the wiretapper (eavesdroper). The E-capacity - equivocation region, which is the generalization of the capacity - equivocation region, is investigated. The outer bound of this region is constructed.","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"73 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126614913","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 : 2019-09-01DOI: 10.1109/CSITechnol.2019.8895164
H. Meladze, Guram Tsertsvadze, T. Davitashvili
In the present work is considered an approach, according to which canonically conjugate colors in the theory of fuzzy sets are related to the properties of information functions and non-commutative linear operators in Gilbert’s space: each information state corresponds to the estimation of compatibility function, every color – to the operator.It is supposed that color, as some property (attribute), characterizing a condition of a system, can receive different values called by eigenvalues of this color. The cases of discrete and continuous spectrum of eigenvalues of color are considered. The example of calculation of conditional computable values of color is given.
{"title":"About the Spectrum of the Eigenvalues of Color Operators in a Theory of Canonically Conjugate Fuzzy Subsets","authors":"H. Meladze, Guram Tsertsvadze, T. Davitashvili","doi":"10.1109/CSITechnol.2019.8895164","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8895164","url":null,"abstract":"In the present work is considered an approach, according to which canonically conjugate colors in the theory of fuzzy sets are related to the properties of information functions and non-commutative linear operators in Gilbert’s space: each information state corresponds to the estimation of compatibility function, every color – to the operator.It is supposed that color, as some property (attribute), characterizing a condition of a system, can receive different values called by eigenvalues of this color. The cases of discrete and continuous spectrum of eigenvalues of color are considered. The example of calculation of conditional computable values of color is given.","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114517589","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 : 2019-09-01DOI: 10.1109/CSITechnol.2019.8895099
T. Beregovskaya, S. Grishaeva, G. Margarov
The modern Internet environment has great potential for education, as the functionality of Internet communication allows to make the educational process more technical, practical, coordinated, expanding the possibilities of access to both teachers and students to high-tech content. The article considers the functions of Internet communication and provides data on the study of the implementation of these functions from the point of view of students of leading Moscow universities.
{"title":"Educational Potential of Internet Communications","authors":"T. Beregovskaya, S. Grishaeva, G. Margarov","doi":"10.1109/CSITechnol.2019.8895099","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8895099","url":null,"abstract":"The modern Internet environment has great potential for education, as the functionality of Internet communication allows to make the educational process more technical, practical, coordinated, expanding the possibilities of access to both teachers and students to high-tech content. The article considers the functions of Internet communication and provides data on the study of the implementation of these functions from the point of view of students of leading Moscow universities.","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130599810","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 : 2019-09-01DOI: 10.1109/CSITechnol.2019.8895093
V. Sahakyan, Artur Vardanyan
The queue state in multiprocessor computing systems is an actual problem for their use in the process of tasks scheduling. In this paper, a system of differential equations is obtained describing the probabilities of the system state at time t, which can be solved using numerical methods. However, the probabilities sought-for the system M|M|m|n with a constraint on the residence time can be obtained in terms of the Laplace- Stieltjes transform.
{"title":"The Queue State for Multiprocessor System with Waiting Time Restriction","authors":"V. Sahakyan, Artur Vardanyan","doi":"10.1109/CSITechnol.2019.8895093","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8895093","url":null,"abstract":"The queue state in multiprocessor computing systems is an actual problem for their use in the process of tasks scheduling. In this paper, a system of differential equations is obtained describing the probabilities of the system state at time t, which can be solved using numerical methods. However, the probabilities sought-for the system M|M|m|n with a constraint on the residence time can be obtained in terms of the Laplace- Stieltjes transform.","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122226724","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
扫码关注我们
求助内容：
应助结果提醒方式：