Pub Date : 2017-09-01DOI: 10.1109/CSITECHNOL.2017.8312145
D. Sargsyan
The modern automotive industry has entered an era where tendencies are towards the increased automation and connectivity. The proportion of electronics-controlled systems is steadily growing in vehicles. In parallel the safety and reliability requirements to automobiles are becoming more stringent due to the increased number of accidents with fatalities on the roads. The problem is complicated by the fact that automotive has started to use cutting-edge technologies irrespective of their maturity level. This paper describes the use of BIST implementations for self-test of memories in an automotive SoC, to support testing in mission mode. Case study at the end of the paper demonstrates a practical built-in self-test architecture implementation providing efficient solutions for both production and in-field testing.
{"title":"ISO 26262 compliant memory BIST architecture","authors":"D. Sargsyan","doi":"10.1109/CSITECHNOL.2017.8312145","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312145","url":null,"abstract":"The modern automotive industry has entered an era where tendencies are towards the increased automation and connectivity. The proportion of electronics-controlled systems is steadily growing in vehicles. In parallel the safety and reliability requirements to automobiles are becoming more stringent due to the increased number of accidents with fatalities on the roads. The problem is complicated by the fact that automotive has started to use cutting-edge technologies irrespective of their maturity level. This paper describes the use of BIST implementations for self-test of memories in an automotive SoC, to support testing in mission mode. Case study at the end of the paper demonstrates a practical built-in self-test architecture implementation providing efficient solutions for both production and in-field testing.","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":"123369272","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.8312129
A. Letichevsky
A new mathematical model for cyber-physical systems based on algebraic theory of interaction and the technology of insertion modeling is considered. It is based on the notion of a semigroup transition system and is abstract enough to describe a wide class of timed transition systems. Multi agent cyber-physical systems are formalized on a base of the theory of interaction of agents and environments. Using this new model allows efficient algorithms to analyze, synthesize, and verify models of cyber-physical systems.
{"title":"Semigroup models of cyber-physical systems","authors":"A. Letichevsky","doi":"10.1109/CSITECHNOL.2017.8312129","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312129","url":null,"abstract":"A new mathematical model for cyber-physical systems based on algebraic theory of interaction and the technology of insertion modeling is considered. It is based on the notion of a semigroup transition system and is abstract enough to describe a wide class of timed transition systems. Multi agent cyber-physical systems are formalized on a base of the theory of interaction of agents and environments. Using this new model allows efficient algorithms to analyze, synthesize, and verify models of cyber-physical 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":"123285522","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.8312153
H. Sahakyan, L. Aslanyan
In this paper we consider a discrete tomography problem, where a new constraint — the requirement of distinct rows is imposed. We focus on a relaxed version of the problem, where some constant number of repeated rows are allowed; and investigate the complexity of the relaxed problem, as well as obtain several properties/results.
{"title":"Discrete tomography with distinct rows: Relaxation","authors":"H. Sahakyan, L. Aslanyan","doi":"10.1109/CSITECHNOL.2017.8312153","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312153","url":null,"abstract":"In this paper we consider a discrete tomography problem, where a new constraint — the requirement of distinct rows is imposed. We focus on a relaxed version of the problem, where some constant number of repeated rows are allowed; and investigate the complexity of the relaxed problem, as well as obtain several properties/results.","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":"133229889","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.8312127
Elizaveta A. Kalinina, Gennady M. Khitrov
In this paper, we consider some known problems of graph theory from the linear algebra point of view. Studying features of vector spaces over characteristic-two finite field allows us to reprove the theorem on graph circuits and cut-sets and develop a new algorithm to recognize a line graph and construct its original graph.
{"title":"A linear algebra approach to some problems of graph theory","authors":"Elizaveta A. Kalinina, Gennady M. Khitrov","doi":"10.1109/csitechnol.2017.8312127","DOIUrl":"https://doi.org/10.1109/csitechnol.2017.8312127","url":null,"abstract":"In this paper, we consider some known problems of graph theory from the linear algebra point of view. Studying features of vector spaces over characteristic-two finite field allows us to reprove the theorem on graph circuits and cut-sets and develop a new algorithm to recognize a line graph and construct its original graph.","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":"129451607","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.8312163
Aghasi Poghosyan, H. Sarukhanyan
Automated caption generation for digital images is one of the fundamental problems in artificial intelligence. Most of the existing works use Long Short-Term Memory as a recurrent neural network cell to solve this task. After training, their deep neural models can generate an image caption. But there is an issue, the next predicted word of the caption depends mainly on the last predicted word, rather than the image content. In this paper we present model that can automatically generate an image description and is based on a recurrent neural network with modified LSTM cell with an additional gate responsible for image features. This modification results in generation of more accurate captions. We have trained and tested our model on MSCOCO image dataset by using only images and their captions.
{"title":"Short-term memory with read-only unit in neural image caption generator","authors":"Aghasi Poghosyan, H. Sarukhanyan","doi":"10.1109/CSITECHNOL.2017.8312163","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312163","url":null,"abstract":"Automated caption generation for digital images is one of the fundamental problems in artificial intelligence. Most of the existing works use Long Short-Term Memory as a recurrent neural network cell to solve this task. After training, their deep neural models can generate an image caption. But there is an issue, the next predicted word of the caption depends mainly on the last predicted word, rather than the image content. In this paper we present model that can automatically generate an image description and is based on a recurrent neural network with modified LSTM cell with an additional gate responsible for image features. This modification results in generation of more accurate captions. We have trained and tested our model on MSCOCO image dataset by using only images and their captions.","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":"114880604","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.8312158
A. Bogdanov, A. Degtyarev, V. Khramushin
Architecture of a digital computing system determines the technical foundation of a unified mathematical language for exact arithmetic-logical description of phenomena and laws of continuum mechanics for applications in fluid mechanics and theoretical physics. Deep parallelization of the computing processes serves to the revival of application of functional programming at a new technological level. The efficiency of computations is provided by true reproduction of the fundamental laws of physics and continuum mechanics. Tensor formalization of numerical objects and computing operations serves to spatial interpolation of rheological state parameters and laws of the fluid mechanics as mathematical models in the local coordinates of the elementary numeric cells — large liquid particles. The proposed approach allows the use of explicit numerical scheme, which is an important condition for increasing the efficiency of the algorithms developed by numerical procedures with natural parallelism.
{"title":"Direct computational experiments in fluid mechanics using three-dimensional tensor mathematics","authors":"A. Bogdanov, A. Degtyarev, V. Khramushin","doi":"10.1109/CSITECHNOL.2017.8312158","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312158","url":null,"abstract":"Architecture of a digital computing system determines the technical foundation of a unified mathematical language for exact arithmetic-logical description of phenomena and laws of continuum mechanics for applications in fluid mechanics and theoretical physics. Deep parallelization of the computing processes serves to the revival of application of functional programming at a new technological level. The efficiency of computations is provided by true reproduction of the fundamental laws of physics and continuum mechanics. Tensor formalization of numerical objects and computing operations serves to spatial interpolation of rheological state parameters and laws of the fluid mechanics as mathematical models in the local coordinates of the elementary numeric cells — large liquid particles. The proposed approach allows the use of explicit numerical scheme, which is an important condition for increasing the efficiency of the algorithms developed by numerical procedures with natural parallelism.","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":"114635164","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.8312151
G. Giorgobiani, V. Kvaratskhelia, M. Menteshashvili
A new numerical characterization for Hadamard matrices is introduced. Its estimations for different norms are established by use of appropriate maximal inequalities for the signed vector summands.
{"title":"Maximum inequalities and their applications to Hadamard matrices","authors":"G. Giorgobiani, V. Kvaratskhelia, M. Menteshashvili","doi":"10.1109/csitechnol.2017.8312151","DOIUrl":"https://doi.org/10.1109/csitechnol.2017.8312151","url":null,"abstract":"A new numerical characterization for Hadamard matrices is introduced. Its estimations for different norms are established by use of appropriate maximal inequalities for the signed vector summands.","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":"114799978","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.8312137
E. Pogossian
Mental systems represent realities, particularly, our utilities, have varying effectiveness with respect to our goals and are processed to support utilization and gaining the benefits from the utilities. Classifying mental systems are effective with respect to the goals insofar as they provide appropriate utilities regularly, i.e. are modeling the utilities constructively and adequately. In the paper we specify ontological, constructive and systemic models of mental systems comparable by expressiveness with algorithms and natural languages, provide arguments of their adequacy for explaining, understanding and human-computer interactions as well as convince to follow the ideas of inventors of algorithms in adequate modeling of mental behavior.
{"title":"Towards adequate constructive models of mental systems","authors":"E. Pogossian","doi":"10.1109/CSITECHNOL.2017.8312137","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312137","url":null,"abstract":"Mental systems represent realities, particularly, our utilities, have varying effectiveness with respect to our goals and are processed to support utilization and gaining the benefits from the utilities. Classifying mental systems are effective with respect to the goals insofar as they provide appropriate utilities regularly, i.e. are modeling the utilities constructively and adequately. In the paper we specify ontological, constructive and systemic models of mental systems comparable by expressiveness with algorithms and natural languages, provide arguments of their adequacy for explaining, understanding and human-computer interactions as well as convince to follow the ideas of inventors of algorithms in adequate modeling of mental behavior.","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":"128528020","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.8312160
Juri Koval
This paper provides the description of mechanism for virtual process controlling. The set of functions for such controlling is proposed and discussed.
本文描述了虚拟过程控制的机理。提出并讨论了这种控制的函数集。
{"title":"Virtual process controlling","authors":"Juri Koval","doi":"10.1109/CSITECHNOL.2017.8312160","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312160","url":null,"abstract":"This paper provides the description of mechanism for virtual process controlling. The set of functions for such controlling is proposed and discussed.","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":"122044225","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.8312136
Sedrak V. Grigoryan
We aim to construct adequate models of knowledge presentation. Language is one of the main spaces of knowledge transfer, thus we have developed a model based on main dimensions of verbs in English “have”, “be”, “do” (HBD). Below we purpose ways to enhance the existing HBD model to provide more flexible knowledge acquisition of it by integration of dynamic types.
{"title":"Dynamic knowledge integration into HBD knowledge presentation model","authors":"Sedrak V. Grigoryan","doi":"10.1109/CSITECHNOL.2017.8312136","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312136","url":null,"abstract":"We aim to construct adequate models of knowledge presentation. Language is one of the main spaces of knowledge transfer, thus we have developed a model based on main dimensions of verbs in English “have”, “be”, “do” (HBD). Below we purpose ways to enhance the existing HBD model to provide more flexible knowledge acquisition of it by integration of dynamic types.","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":"127586953","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
扫码关注我们
求助内容：
应助结果提醒方式：