Pub Date : 2017-09-01DOI: 10.1109/CSITECHNOL.2017.8312143
A. Kostanyan, Sona Kurazyan
A slicing floorplan is a geometrical structure obtained by a series of successive dissections of a given rectangle by horizontal or vertical lines. The logical structure of a slicing floorplan can be represented by a binary tree whose leaves denote rectangles of the resulting floorplan and internal nodes specify horizontal and vertical cut lines. The slicing structure is widely used in digital circuit physical design to determine rectangles (or, rooms), where blocks (i.e., separated parts of the digital circuit) should be allocated. The quality of a floorplan is estimated based on the area of its enclosing rectangle and the closeness of logically connected blocks to each other. We suggest a method of transformation of a floorplan to solve several optimization problems such as concentration of predefined blocks around a target point, migration of predefined blocks towards each other, etc. All these transformations are done by keeping the bounding rectangle of the floorplan.
{"title":"Critical problems for a slicing floorplan","authors":"A. Kostanyan, Sona Kurazyan","doi":"10.1109/CSITECHNOL.2017.8312143","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312143","url":null,"abstract":"A slicing floorplan is a geometrical structure obtained by a series of successive dissections of a given rectangle by horizontal or vertical lines. The logical structure of a slicing floorplan can be represented by a binary tree whose leaves denote rectangles of the resulting floorplan and internal nodes specify horizontal and vertical cut lines. The slicing structure is widely used in digital circuit physical design to determine rectangles (or, rooms), where blocks (i.e., separated parts of the digital circuit) should be allocated. The quality of a floorplan is estimated based on the area of its enclosing rectangle and the closeness of logically connected blocks to each other. We suggest a method of transformation of a floorplan to solve several optimization problems such as concentration of predefined blocks around a target point, migration of predefined blocks towards each other, etc. All these transformations are done by keeping the bounding rectangle of the floorplan.","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":"124232745","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.8312149
H. Danoyan
The multiclass classification approach known as ECOC (error correcting output codes) is considered. The method solves the multiclass classification problem by combining binary classification algorithms according to some binary matrix. The framework is considered where the columns of the mentioned matrix are selected from the given set. It is proved that the algorithmic problem of column selection optimizing the training error is NP complete.
{"title":"On computational complexity of multiclass classification approach ECOC","authors":"H. Danoyan","doi":"10.1109/CSITECHNOL.2017.8312149","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312149","url":null,"abstract":"The multiclass classification approach known as ECOC (error correcting output codes) is considered. The method solves the multiclass classification problem by combining binary classification algorithms according to some binary matrix. The framework is considered where the columns of the mentioned matrix are selected from the given set. It is proved that the algorithmic problem of column selection optimizing the training error is NP complete.","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":"130462450","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.8312164
A. Khoroshilov
Operating systems are responsible for correct implementation of computation environment properties that are usually assumed during verification of application software like virtual address space, scheduling, time management, etc. Formal analysis of implementation of these aspects is often implemented using specific models and verification techniques. As a result comprehensive verification of operating systems requires a systematic combination of various verification techniques applied for checking different properties. The paper proposes a generic approach to formalization of operating systems behavioural properties verification that allows to apply wide range of verification techniques and to support formal reasoning of their compositions.
{"title":"On formalization of operating systems behaviour verification","authors":"A. Khoroshilov","doi":"10.1109/CSITECHNOL.2017.8312164","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312164","url":null,"abstract":"Operating systems are responsible for correct implementation of computation environment properties that are usually assumed during verification of application software like virtual address space, scheduling, time management, etc. Formal analysis of implementation of these aspects is often implemented using specific models and verification techniques. As a result comprehensive verification of operating systems requires a systematic combination of various verification techniques applied for checking different properties. The paper proposes a generic approach to formalization of operating systems behavioural properties verification that allows to apply wide range of verification techniques and to support formal reasoning of their compositions.","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":"116620073","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.8312139
S. Zolyan
We intend to concentrate on processes of interaction of lexical meanings within text and context. Based on the notion of semantic coercion, we propose to consider different types of semantic interaction of lexical meanings as a value of the compositional and/or decompositional functions from text, context, and prototypical meanings of the given expression. Some formal rules for its description are suggested.
{"title":"On the interaction of meanings in natural languages: Compositional rules, context dependence and coercion","authors":"S. Zolyan","doi":"10.1109/CSITECHNOL.2017.8312139","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312139","url":null,"abstract":"We intend to concentrate on processes of interaction of lexical meanings within text and context. Based on the notion of semantic coercion, we propose to consider different types of semantic interaction of lexical meanings as a value of the compositional and/or decompositional functions from text, context, and prototypical meanings of the given expression. Some formal rules for its description are suggested.","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":"131290335","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.8312169
Elena Mitrofanova, G. Zhaxybayeva
The effective system of work incentives corresponding to the specifics of the organization, the categories of personnel, types of his work, is the key to successful activity of the information technology company. Formation and development of work incentives complex system of specialists engaged in information technology project activities includes subsystems of material monetary and non-monetary stimulation. The presented orders and principles of development of the work incentives system of information technology experts occupied in project activities allow to solve the problem of increase in overall performance and interest of all participants of the project in its successful realization in the conditions of rigid temporary restrictions, at observance of the budget.
{"title":"Work incentives of specialist engaged in information technology project activities","authors":"Elena Mitrofanova, G. Zhaxybayeva","doi":"10.1109/CSITECHNOL.2017.8312169","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312169","url":null,"abstract":"The effective system of work incentives corresponding to the specifics of the organization, the categories of personnel, types of his work, is the key to successful activity of the information technology company. Formation and development of work incentives complex system of specialists engaged in information technology project activities includes subsystems of material monetary and non-monetary stimulation. The presented orders and principles of development of the work incentives system of information technology experts occupied in project activities allow to solve the problem of increase in overall performance and interest of all participants of the project in its successful realization in the conditions of rigid temporary restrictions, at observance of the budget.","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":"133528539","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.8312162
V. Grishkin, O. Iakushkin, N. Stepenko
Traditional methods for performing biofouling detection are based upon probing object surfaces for subsequent laboratory research. Such methods result in large effort, they are expensive, and require expert consultations. Knowledge of the type of biological contaminants is necessary to protect objects from their harmful impact. In this paper we propose a method for determination of types of biological contaminants existing on the objects surface. The proposed method uses a collection of object's images as input. The collection contains images obtained in the visible and near infrared spectral bands. During pre-processing the series, all images are converted to a selected shooting point, and the background is removed. Feature vector is built from combinations of formal vegetation indices. To recognize the type of biological contaminants, we used a pre-trained classifier based on SVM method with RBF kernel.
{"title":"Biofouling detection based on image processing technique","authors":"V. Grishkin, O. Iakushkin, N. Stepenko","doi":"10.1109/CSITECHNOL.2017.8312162","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312162","url":null,"abstract":"Traditional methods for performing biofouling detection are based upon probing object surfaces for subsequent laboratory research. Such methods result in large effort, they are expensive, and require expert consultations. Knowledge of the type of biological contaminants is necessary to protect objects from their harmful impact. In this paper we propose a method for determination of types of biological contaminants existing on the objects surface. The proposed method uses a collection of object's images as input. The collection contains images obtained in the visible and near infrared spectral bands. During pre-processing the series, all images are converted to a selected shooting point, and the background is removed. Feature vector is built from combinations of formal vegetation indices. To recognize the type of biological contaminants, we used a pre-trained classifier based on SVM method with RBF kernel.","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":"133830333","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.8312152
T. Kosovskaya
The paper is devoted to the use of the notion of a common up to the names of arguments sub-formula of two elementary conjunctions of predicate atomic formulas. It allows to construct a level description of a set of goal formulas and to decrease the number of proof steps for one of NP-complete problems. Logic-predicate networks which may change its configuration (the number of layers and the number of cells in the layer) during the process of training are described. The problem of multi-agent description when every agent can describe only a part of an object (these parts are intersected) but every agent gives its own names to the elements of the whole object may be solved with the use of the notion of such a common sub-formula.
{"title":"Extraction of a common up to the names of arguments sub-formula of two elementary conjunctions and some AI problems","authors":"T. Kosovskaya","doi":"10.1109/csitechnol.2017.8312152","DOIUrl":"https://doi.org/10.1109/csitechnol.2017.8312152","url":null,"abstract":"The paper is devoted to the use of the notion of a common up to the names of arguments sub-formula of two elementary conjunctions of predicate atomic formulas. It allows to construct a level description of a set of goal formulas and to decrease the number of proof steps for one of NP-complete problems. Logic-predicate networks which may change its configuration (the number of layers and the number of cells in the layer) during the process of training are described. The problem of multi-agent description when every agent can describe only a part of an object (these parts are intersected) but every agent gives its own names to the elements of the whole object may be solved with the use of the notion of such a common sub-formula.","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":"125659605","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.8312146
Sergey Vartanov
For the sake of better performance, platform-specific facilities support, or the use of legacy code, Java applications may use JNI (Java Native Interface) to call native functions. We present an approach to perform dynamic symbolic execution of a Java program that tracks tainted data flow through Java bytecode and native code of shared libraries. We propose a tool based on modified virtual machine and static binary code instrumentation. This allows us to collect path constraints for both bytecode and binary code execution but avoid redundant processing of virtual machine own code. Modified path constraints are checked for their satisfiability in order to generate new inputs and execute new paths (to cover new basic blocks of target program). We describe initial experiments with our implementation based on Avian virtual machine and Dyninst.
{"title":"Dynamic symbolic execution of Java programs using JNI","authors":"Sergey Vartanov","doi":"10.1109/CSITECHNOL.2017.8312146","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312146","url":null,"abstract":"For the sake of better performance, platform-specific facilities support, or the use of legacy code, Java applications may use JNI (Java Native Interface) to call native functions. We present an approach to perform dynamic symbolic execution of a Java program that tracks tainted data flow through Java bytecode and native code of shared libraries. We propose a tool based on modified virtual machine and static binary code instrumentation. This allows us to collect path constraints for both bytecode and binary code execution but avoid redundant processing of virtual machine own code. Modified path constraints are checked for their satisfiability in order to generate new inputs and execute new paths (to cover new basic blocks of target program). We describe initial experiments with our implementation based on Avian virtual machine and Dyninst.","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":"129152144","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.8312138
L. Yepiskoposyan
Here, we provide some examples of extracting demographic cognitive patterns from human genome data through applying traditional and recently developed statistical and bioinformatics tools. These methods were used to make inferences on the demographic history of Armenians (as a template population) based on uniparentally (through paternally inherited Y chromosome and maternally inherited mitochondrial DNA) and biparentally (through autosomes) transmitted genetic information.
{"title":"Demographic cognitive patterns revealed from human genome","authors":"L. Yepiskoposyan","doi":"10.1109/CSITECHNOL.2017.8312138","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312138","url":null,"abstract":"Here, we provide some examples of extracting demographic cognitive patterns from human genome data through applying traditional and recently developed statistical and bioinformatics tools. These methods were used to make inferences on the demographic history of Armenians (as a template population) based on uniparentally (through paternally inherited Y chromosome and maternally inherited mitochondrial DNA) and biparentally (through autosomes) transmitted genetic information.","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":"116986875","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.8312166
Michael Zheludev, Evgeny Nagradov
This paper provides a method of mathematical representation of the traffic flow of network states. The flow of states is represented as transitions to the Markov Chains. Anomalies are interpreted as graph transitions with low probabilities.
{"title":"Anomaly detection using Markov chain model","authors":"Michael Zheludev, Evgeny Nagradov","doi":"10.1109/CSITECHNOL.2017.8312166","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312166","url":null,"abstract":"This paper provides a method of mathematical representation of the traffic flow of network states. The flow of states is represented as transitions to the Markov Chains. Anomalies are interpreted as graph transitions with low probabilities.","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":"116649159","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
扫码关注我们
求助内容：
应助结果提醒方式：