The given paper shows the ability of construction of decorrelating transformation bases, which can be used for digital images compression, by means of cellular automata dynamics. We introduce the construction algorithms of decorrelating transformation bases, generated from evolving states of partitioning cellular automata, which is considered to be the extension of classical model of cellular automaton.
The appointment, structure an usage of applied pprogram packgare for queuing problems calculation are described. Special accent is done on principles and some results of its testing.
Formal modeling is very important part of program creation process in the all development steps. Functional testing, in one's turn, is integral part of quality assurance. Formal models translation mechanisms creating bring to necessity of validation control for functional transmission across models. This article describes methods for solving the problem by test scenarios modeling with formal models help.
Learning content creation process requires more than just collection and presentation of set of information. In order to gain knowledge, the learning content should be designed in such a way to meet predefined learning goals. Learning goals determine the entire process of learning. Bloom’s Taxonomy provides a description of a cognitive process with six hierarchical levels, each containing specific learning goal to achieve. It could be adapted into a model by which tutors create learning materials. However, when it comes to productivity of learning, it is important to consider the personalization of the presented content according to the learning style of the individual. This article analyzes the correlation between Bloom’s Taxonomy and Honey and Mumford’s learning cycle, providing a way to bind the structure of learning material to the personal preferences of learners. This novel way of creating learning materials is integrated into a model that is used for automatic generation of personalized learning materials. The effectiveness of the model is further verified through an experiment with real participants. The results of the experiment show promising potential in the way of how a learner’s capabilities may be enriched. However, while experimenting and rest of the work on the model outline some challenges before the model’s application and future work.
Recovery of a dynamic system from its functioning is a problem of current interest in the theory of control systems. As a behavior model of gene network regulatory circuit, a discrete dynamic system has been proposed, where coordinates correspond to the concentration of substances, while special functions, which depend on the system value in the previous moment, account for their increase or decrease. Pseudo-polynomial discrete dynamic system recovery algorithms with additive and multiplicative functions have been obtained earlier. The generalized case of arbitrary threshold functions is considered in this article. Algorithms for significant variables recovery and threshold functions weight regulation, having pseudo-polynomial testing complexity, are given. These algorithms allow one either to recover the system completely, or to lower the threshold function dimension.
In the article we consider the problem of vulnerabilities detection in machine code. In this paper, disadvantages of current solutions in case of possibility to detect vulnerabilities in view of threats to confidential information that is processed in vulnerable software are highlighted. To solve this problem, we propose original model of vulnerabilities detection in program trace, its algorithmic support and software implementation. The model provides formal criteria to distinct bug from vulnerability taking into account distribution of protected information in the memory of software under test. We use tainted data analysis technique to highlight such memory regions. In addition, we conduct experimental evaluation of developed system efficiency which demonstrates that our solution allows detecting 5 types of Windows software vulnerabilities more and 4 types Linux software vulnerabilities more than existing analogs.
This article considers approaches to information systems remote security analysis. The model of process of remote security analysis of information systems using decision making theory is proposed. Existing methods to solve partially observable Markov decision processes problem are reviewed.
Program code being of large amount and complexity, development of abstract model being impossible, dynamic analysis becomes of special importance. In this paper a technique is proposed for code vulnerabilities detection by means of dynamic analysis procedure. For each detected vulnerability risk assessment is carried out, some security metrics are applied to and decision is made concerning purposefulness and urgency of vulnerability problem solution.
After designing testing scripts, sometimes it is needed to analyze their properties. To make script specification formal, one can use left context terminal grammars. The article gives proof of left context terminal grammars and context free grammars equivalence and develops algorithms for analyzing properties of such grammars that are useful in analyzing testing script properties.
1 - 9 of 9 items