Pub Date : 2017-09-01DOI: 10.1109/csitechnol.2017.8312142
D. Hayrapetyan, A. Manukyan
The main purpose of this paper is to introduce a new method of static and dynamic fault representation with the help of deterministic finite automata (DFA) formalization. This method can be used during memory behavior simulation at register transfer level.
{"title":"Modeling dynamic single-cell and coupling faults via automata models","authors":"D. Hayrapetyan, A. Manukyan","doi":"10.1109/csitechnol.2017.8312142","DOIUrl":"https://doi.org/10.1109/csitechnol.2017.8312142","url":null,"abstract":"The main purpose of this paper is to introduce a new method of static and dynamic fault representation with the help of deterministic finite automata (DFA) formalization. This method can be used during memory behavior simulation at register transfer level.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121035027","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 : 2017-09-01DOI: 10.1109/CSITECHNOL.2017.8312133
H. Nahapetyan, J. Jessel, S. Poghosyan, Yu. H. Shoukourian
In this paper, a software package for cellular automata simulation, 2D/3D visualization with a shared work support system was introduced, that was designed considering the needs of researchers in both local and virtual laboratories. As an example of cellular automata, abelian sandpile model has been chosen. An appropriate software package has been developed using Microsoft .Net and C# enabling users to work at the same time on the same models independent of the geographical location of users within the public network.
{"title":"A multi-user and multi-purpose CA simulator","authors":"H. Nahapetyan, J. Jessel, S. Poghosyan, Yu. H. Shoukourian","doi":"10.1109/CSITECHNOL.2017.8312133","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312133","url":null,"abstract":"In this paper, a software package for cellular automata simulation, 2D/3D visualization with a shared work support system was introduced, that was designed considering the needs of researchers in both local and virtual laboratories. As an example of cellular automata, abelian sandpile model has been chosen. An appropriate software package has been developed using Microsoft .Net and C# enabling users to work at the same time on the same models independent of the geographical location of users within the public network.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122495742","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 : 2017-09-01DOI: 10.1109/CSITECHNOL.2017.8312157
S. Solodusha, I. Orlova
The paper is focused on the possibility of integrating situation control and simulation modeling based on the Volterra integro-power series when describing transient processes in a nonlinear dynamic object of input-output type. A reference object was represented by a model of horizontal-axis wind turbine. The research deals with nonlinear dynamics of a rotation speed of wind turbine components depending on the blade angle and wind speed. A two-level technology is applied to prevent emergency situations. It consists of a quantitative analysis and a qualitative analysis. The first level is implemented using the situation analysis tools based on semantic modeling. At the second level the simulation modeling is performed. An algorithm for construction of a set of current situations in the semantic model is based on the Volterra polynomial integral equations. The Newton-Kantorovich method was applied to develop an iterative method to approximately solve respective nonlinear equations. The paper demonstrates the specific features of numerically solving the studied equations with a fixed length of mantissa in machine representation of a floating-point number.
{"title":"Volterra polynomials in the intelligent control system of wind power plant operation","authors":"S. Solodusha, I. Orlova","doi":"10.1109/CSITECHNOL.2017.8312157","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312157","url":null,"abstract":"The paper is focused on the possibility of integrating situation control and simulation modeling based on the Volterra integro-power series when describing transient processes in a nonlinear dynamic object of input-output type. A reference object was represented by a model of horizontal-axis wind turbine. The research deals with nonlinear dynamics of a rotation speed of wind turbine components depending on the blade angle and wind speed. A two-level technology is applied to prevent emergency situations. It consists of a quantitative analysis and a qualitative analysis. The first level is implemented using the situation analysis tools based on semantic modeling. At the second level the simulation modeling is performed. An algorithm for construction of a set of current situations in the semantic model is based on the Volterra polynomial integral equations. The Newton-Kantorovich method was applied to develop an iterative method to approximately solve respective nonlinear equations. The paper demonstrates the specific features of numerically solving the studied equations with a fixed length of mantissa in machine representation of a floating-point number.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126093359","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 : 2017-09-01DOI: 10.1109/csitechnol.2017.8312128
A. Kostanyan
The string matching problem is one of the widely-known symbolic computation problems having applications in many areas of artificial intelligence. The most famous algorithms solving the string matching problem are the finite automata method, Knuth-Morris-Pratt and Rabin-Karp's algorithms. In this paper we focus on applying the finite automata method to find a fuzzy pattern in a text.
{"title":"Fuzzy string matching with finite automat","authors":"A. Kostanyan","doi":"10.1109/csitechnol.2017.8312128","DOIUrl":"https://doi.org/10.1109/csitechnol.2017.8312128","url":null,"abstract":"The string matching problem is one of the widely-known symbolic computation problems having applications in many areas of artificial intelligence. The most famous algorithms solving the string matching problem are the finite automata method, Knuth-Morris-Pratt and Rabin-Karp's algorithms. In this paper we focus on applying the finite automata method to find a fuzzy pattern in a text.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124284357","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 : 2017-09-01DOI: 10.1109/CSITECHNOL.2017.8312161
D. Asatryan, Grigor Sazhumyan, Lusine Aznauryan
Nowadays lots of handwritten and printed ancient documents needs to perform to digitized form for automated processing and analysis. In this paper, an approach to background-text-nontext separation procedure based on differences of presented in a document image objects sizes which can be obtained by binarization and segmentation algorithms, is proposed. After binarization by a proper method, it is segmented and the distribution of segments sizes is obtained. It is assumed that the three types of objects presented in an image have significantly different sizes; therefore, the problem of separation comes to discrimination of the set of segments into three groups. The thresholds for the separation of these groups can be found by minimizing the intrasample variation which is used in discriminant analysis. Some examples of images from the Matenadaran collection are considered and the separated parts of the image are illustrated and interpreted.
{"title":"Novel approach to background-text-nontext separation in ancient degraded document images","authors":"D. Asatryan, Grigor Sazhumyan, Lusine Aznauryan","doi":"10.1109/CSITECHNOL.2017.8312161","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312161","url":null,"abstract":"Nowadays lots of handwritten and printed ancient documents needs to perform to digitized form for automated processing and analysis. In this paper, an approach to background-text-nontext separation procedure based on differences of presented in a document image objects sizes which can be obtained by binarization and segmentation algorithms, is proposed. After binarization by a proper method, it is segmented and the distribution of segments sizes is obtained. It is assumed that the three types of objects presented in an image have significantly different sizes; therefore, the problem of separation comes to discrimination of the set of segments into three groups. The thresholds for the separation of these groups can be found by minimizing the intrasample variation which is used in discriminant analysis. Some examples of images from the Matenadaran collection are considered and the separated parts of the image are illustrated and interpreted.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121668402","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 : 2017-09-01DOI: 10.1109/CSITECHNOL.2017.8312132
Yu. M. Movsisyan
In this paper we characterize the variety of Belousov quasigroups by bigroups and finite fields.
本文用大群和有限域刻画了Belousov拟群的变化。
{"title":"On Belousov quasigroups and bigroups","authors":"Yu. M. Movsisyan","doi":"10.1109/CSITECHNOL.2017.8312132","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312132","url":null,"abstract":"In this paper we characterize the variety of Belousov quasigroups by bigroups and finite fields.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116192862","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 : 2017-09-01DOI: 10.1109/CSITECHNOL.2017.8312147
S. Zelenov, D. Buzdalov
In the paper, we describe a metamodel to represent dynamics of AADL-models. The metamodel allows to visualize step-by-step a process of models' behavioral aspects analysis. In particular, it essentially helps to debug behavioral specifications. In the paper, we consider examples of the metamodel usage to represent dynamics for the following two aspects of AADL-models: 1) simulation of a modelled system on the basis of a Behavior Annex specification; 2) failure modes and effects analysis on the basis of an Error Model Annex specification. We also present a stepwise visualization tool (engine and applications for both mentioned examples) that is implemented in MASIW framework for design of modern avionics systems.
{"title":"Visualization of behavioral aspects of AADL-models","authors":"S. Zelenov, D. Buzdalov","doi":"10.1109/CSITECHNOL.2017.8312147","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312147","url":null,"abstract":"In the paper, we describe a metamodel to represent dynamics of AADL-models. The metamodel allows to visualize step-by-step a process of models' behavioral aspects analysis. In particular, it essentially helps to debug behavioral specifications. In the paper, we consider examples of the metamodel usage to represent dynamics for the following two aspects of AADL-models: 1) simulation of a modelled system on the basis of a Behavior Annex specification; 2) failure modes and effects analysis on the basis of an Error Model Annex specification. We also present a stepwise visualization tool (engine and applications for both mentioned examples) that is implemented in MASIW framework for design of modern avionics systems.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129434511","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 : 2017-09-01DOI: 10.1109/CSITECHNOL.2017.8312141
A. Gerasimov, L. Kruglov
Static and dynamic analysis of programs are well known approaches to the problem of automatic program behaviour analysis. Both methods have advantages and limitations. Static analysis has lack of precision for the sake of scalability. On the other hand, dynamic analysis has 100% precision while reaching defect point, but suffers from scalability issues. This paper describes an approach to confirmation of reachability of source-sink defects that were found by static analysis with help of dynamic analysis. The combination of methods allows to circumvent limitations and multiply their advantages. Preliminary experiments on several open source projects show that real true positive defects can be confirmed to be reachable using the approach and some false positives can be proved.
{"title":"Reachability confirmation of statically detected defects using dynamic analysis","authors":"A. Gerasimov, L. Kruglov","doi":"10.1109/CSITECHNOL.2017.8312141","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312141","url":null,"abstract":"Static and dynamic analysis of programs are well known approaches to the problem of automatic program behaviour analysis. Both methods have advantages and limitations. Static analysis has lack of precision for the sake of scalability. On the other hand, dynamic analysis has 100% precision while reaching defect point, but suffers from scalability issues. This paper describes an approach to confirmation of reachability of source-sink defects that were found by static analysis with help of dynamic analysis. The combination of methods allows to circumvent limitations and multiply their advantages. Preliminary experiments on several open source projects show that real true positive defects can be confirmed to be reachable using the approach and some false positives can be proved.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128419083","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 : 2017-09-01DOI: 10.1109/CSITECHNOL.2017.8312135
I. Zaslavsky
The principles of constructive mathematics are applied to the fuzzy constructive logic. The preceding results of the author in fuzzy constructive logic are generalized for predicate formulas including (in general) functional symbols and symbols of constants. The constructive (intuitionistic) predicate calculus on the base of such formulas is considered; it is denoted by H(fcon). The notion of identically f-true predicate formula is introduced. It is proved that any predicate formula deducible in H(fcon) is identically f-true.
{"title":"Functional system of the fuzzy constructive logic","authors":"I. Zaslavsky","doi":"10.1109/CSITECHNOL.2017.8312135","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312135","url":null,"abstract":"The principles of constructive mathematics are applied to the fuzzy constructive logic. The preceding results of the author in fuzzy constructive logic are generalized for predicate formulas including (in general) functional symbols and symbols of constants. The constructive (intuitionistic) predicate calculus on the base of such formulas is considered; it is denoted by H(fcon). The notion of identically f-true predicate formula is introduced. It is proved that any predicate formula deducible in H(fcon) is identically f-true.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130826781","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 : 2017-09-01DOI: 10.1109/CSITECHNOL.2017.8312140
K. Amirkhanyan, S. Shoukourian, V. Vardanian
In this paper, we proposed a method for implementation of a mechanism for “redundancy sharing” allowing to repair a fault/defect in a memory instance from a memory system with hundreds/thousands of memory instances with an available shared redundant element of another memory instance in the same group of the Memory System that has been preliminarily grouped with respect to its main parameters, e.g. clock, power and position of instances. The calculations showed that the hardware is saved to a great extent with a negligible impact on memory's functional performance. Not only excluded redundancies contribute in the area saving but also reduction of the redundancy registers due to reduction of redundancies, as well as reduction of the control logic and the number of necessary fuses.
{"title":"A mechanism of row redundancy sharing for reparable memory systems","authors":"K. Amirkhanyan, S. Shoukourian, V. Vardanian","doi":"10.1109/CSITECHNOL.2017.8312140","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312140","url":null,"abstract":"In this paper, we proposed a method for implementation of a mechanism for “redundancy sharing” allowing to repair a fault/defect in a memory instance from a memory system with hundreds/thousands of memory instances with an available shared redundant element of another memory instance in the same group of the Memory System that has been preliminarily grouped with respect to its main parameters, e.g. clock, power and position of instances. The calculations showed that the hardware is saved to a great extent with a negligible impact on memory's functional performance. Not only excluded redundancies contribute in the area saving but also reduction of the redundancy registers due to reduction of redundancies, as well as reduction of the control logic and the number of necessary fuses.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128726180","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
扫码关注我们
求助内容：
应助结果提醒方式：