ADVANCED TECHNOLOGIES AND COMPUTER SCIENCE
Scientific, educational, interdisciplinary journal with a basic specialization in the field of computer science, automation and applied mathematics. Published in print and online versions. The print version has been published since 2020. Online version published since 2020. Published 1 time per quarter. No manuscript publication or processing fee. The maximum review period for an article is 3 months.
RSE "Institute of Information and Computational Technologies" SC MES RK
the METHOD OF CONSTRUCTING MODELS OF INFORMATION ATTACKS
The existing approaches to the construction of formal models of information attacks are considered and analyzed. The basic requirements for information attack models are formulated. A method is proposed for constructing models of information attacks based on control E-network transitions and multi-agent management, taking into account the formulated requirements. The considered approaches to modeling allow describing the process of an information attack with varying degrees of detail. The models use different mathematical bases, but most of them are based on finite automata and represent the attack as a sequence of automaton states. None of the models makes it possible to take into account the vulnerability activated by such a complex, the method of its implementation and possible consequences. The models allow us to more accurately determine the effectiveness of existing and developed means of protection against simulated information attacks
Information Security and Data Protection
attack, modeling, information attack model, managing E-network, agent, multi-agent management.
Copyright (c) 2023 ADVANCED TECHNOLOGIES AND COMPUTER SCIENCE https://creativecommons.org/licenses/by-nc/4.0
ПРИМЕНЕНИЕ ТЕХНОЛОГИЙ МАШИННОГО ОБУЧЕНИЯ ПРИ ДИАГНОСТИКЕ ГЛАУКОМЫ
Glaucoma is a progressive eye disease that, if left untreated, can lead to permanent vision loss or total blindness. Early detection and treatment of glaucoma is critical to preventing vision loss. However, diagnosing and treating glaucoma requires extensive testing and regular monitoring, which can be time consuming and costly. Diagnosis of glaucoma is a complex process that requires high accuracy and efficiency in identifying the symptoms of the disease. In recent years, the application of machine learning technologies has become increasingly popular in the field of glaucoma diagnostics. This article provides an overview of recent research that has applied machine learning algorithms to diagnose glaucoma, including classifying glaucoma and predicting its progression. The article highlights the benefits of applying modern machine learning technologies, such as improving accuracy, efficiency and objectivity in the diagnosis of glaucoma. It also describes some of the problems and limitations of these technologies and suggests potential solutions. Overall, the article highlights the potential of deep learning technologies in diagnosing glaucoma and their role in improving patient outcomes.
machine learning, glaucoma, eye diseases, diagnostics, progression prediction.
The article deals with Bayesian networks (hereinafter BS) with additional limitations due to the ideas of Markov networks (hereinafter MS). Graph models described by such networks will be called Bayesian Markov networks (BMS). These models describe many real-world problems with different types of uncertainties having different cause-and-effect relationships. The limitations imposed by the Markov property in many cases make it possible to significantly simplify calculations in Bayesian networks in the presence of evidence. At the same time, practice shows that most models reflecting real processes and built on the apparatus of Bayesian networks actually have the Markov property. The article describes the ideas of calculations in Bayesian networks with restrictions imposed by the Markov property. The differences in calculations in Bayesian networks without Markov constraints and with Markov constraints are described. The work was written within the framework of grant funding AP19679142 "Search for optimal solutions in Bayesian networks in models with linear constraints and linear functionals. Development of algorithms and programs" (2023-2025) MONV RK.
Information and telecommunication technologies
Artificial Intelligence for Complexity Theory
In this continued series of work, we present the theoretical and practical results towards reasoning with modern methods of Artificial Intelligence (AI). We justify our methodology with help of illustrative examples from Computer Science relying on the regular expression matching algorithm and application of the proposed solution for the task of identifying files consistency according to the unknown format. We will also give several notable proofs to the classical theorems which in some sense are coherent to the terms like AI and algorithmic complexity, however, or at least, nowadays they’re solved involving the huge amount of hardware resources and together constitute the new formation in the modern age with help of specifically crafter hardware modules – we’re still about to represent the model in more classical understanding from the point of view of computational complexity, concise reasoning and computer logic within the classical models, theorems and proofs as the base approach of estimating the costs needed to build Artificial Neural Networks (ANN) or Machine Learning (ML) data.
Operational Calculus of Modified Subset Construction
We present the continuation of studying Extended Regular Expression (ERE) on the view of modified subset construction within the overridden operators like intersection, subtraction, and re-written complement. As before we have stated that in this case the complexity has a decreasing nature and tendency. We will give the strict definition of the operational part of this modified subset construction which is due to Rabin and Scott. The complexity of algorithm remains a magnitude less than NP-hard problems for which we have given the strict proof of equivalence in the prior work, so this work continues the studying of the comparable proof for a variety of problems to be computationally complex, however, explainable in terms of unified approach like operational calculus. In this calculus the general points of research are given to the representation of modified subset construction with at least two operands which are to be computed by subset construction and in terms of complexity of the effective algorithm they are computed using modified subset construction.
Applied mathematics, computer science and control theory
On Successful P versus NP within Finite Automata and Regular Expressions
In this article the final proof of the equivalence of polynomial (P) and non-polynomial classes (NP) are provided within the given Klaus Schneider’s regular expression forms which tend to be exponential in size and the problem in overall is seen to be in EXPTIME and EXPSPACE and, thus, NP-complete. We provide the full history of this proof with the experimentally obtained results. Our application of the obtained singular algorithm in terms of computational complexity responds to the famous theorem like “P versus NP” which wasn’t solved before and now is resolved in this work. We will also discuss the future of the question from past as the novel proof is given.
METHODOLOGICAL FOUNDATIONS OF THE TRAINING OF FUTURE COMPUTER SCIENCE TEACHERS FOR THE FORMATION OF PROFESSIONAL COMPETENCIES IN CYBERSECURITY
информация. Информационная безопасность является глобальной проблемой в связи с опасной зависимостью общества от глобальной сети Интернет, а киберугрозы сети одной из самых серьезных проблем экономики и национальной безопасности. Информационная безопасность стала избирательным избирательным приоритетом. Всем организациям, включающим образовательные учреждения, работающим с использованием цифровых компьютерных технологий, требующих специалистов, обладающих компетенциями и навыками, включающими познавательные, управленческие и технические знания для борьбы с кибератаками в динамичной среде киберугроз.В связи с этим растет спрос не только на квалифицированных специалистов, но и на преподавателей, обладающих компетенциями в области информационной безопасности, способных обучать основам кибербезопасности со школьной скамьи. The existing contradictions between the widespread use of digital technologies that are vulnerable to cyber attacks, and the lack of use of the educational process for teaching information security, as well as between the increasing demand for training computer science teachers in information security and the lack of readiness of the university's teaching staff to train relevant specialists, allow us to formulate an urgent problem of scientific research. The problem lies in the need for systematic training of future teachers of computer science and the formation of their professional competencies in information security in the modern conditions of the development of the information society. The novelty of the research is the development of an approach to teaching future computer science teachers the basics of cybersecurity and the formation of their competencies in information security in the context of digitalization of education.
Cubic spline interpolation analysis using maple package
We talk about using the Maple package for abstract cubic interpolation analysis. We review the capabilities of the package and provide an in-depth analysis of cubic spline interpolation. Our analysis shows the effectiveness of this method in solving complex problems in different fields. In this analysis, we will examine the basics of cubic spline interpolation, including how it works, its advantages and disadvantages, and how to implement it using the Maple software package. We will also discuss some real-world applications of cubic spline interpolation, such as data smoothing and curve fitting. Through this analysis, we hope to provide a comprehensive understanding of cubic spline interpolation and its importance in various contexts. Using Maple, cubic splines can be easily calculated, plotted, and even manipulated to suit specific needs. In addition, Maple allows the creation of interactive graphs, which can be used to explore the properties of cubic lines and gain a deeper understanding of their behavior.
Cubic spline interpolation, maple package, Polyinterp
This article is devoted to the top 5 open source MFA solutions. Technology is changing rapidly, so we will need to adapt open source MFA solutions. Multi-factor authentication (MFA) is a method and technology used to verify the identity of a user. Users need at least two or more types of credential categories to log in or make transactions. A successful combination of at least two independent credentials is a mandatory requirement for the MFA method. It usually combines one of the following three categories of credentials: What the user knows: password or code phrase What does a person have: security badge, keychain or SIM card 3.What the user means: biometric data such as fingerprints, retina or iris, voice or face recognition. MFA requires the user to provide two or more verification factors to access a resource, such as an app or an online account. MFA requires one or more additional verification criteria in addition to the login and password, which reduces the likelihood of a successful cyber attack. Public code is considered"open source". In addition, open source tools and solutions are safe because the code can be tested and verified by anyone.
УДК 378.147 ВИРТУАЛДЫ ШЫНДЫҚ. БІЛІМ БЕРУ САЛАСЫНДАҒЫ ЖАҢА ТЕХНОЛОГИЯЛЫҚ ӘЗІРЛЕМЕЛЕРДІ ПАЙДАЛАНУ
In this publication, the reasons for the spread of virtual reality technologies in the field of education, the classification of virtual reality technologies and their functionality, and the applications of virtual reality technologies used in the education of future architects are presented.These attributes of modernity expand the understanding of technology in education, which so far includes distance learning, electronic technologies, mobile applications, and e-textbooks. Taking into account the new technological realities, it is necessary to consider the necessary changes in the content of education, the management of the learning process should also approach the indicators of online interaction.
білім берудегі иммерсивті технологиялар,
INNOVATIVE DEVELOPMENTS IN THE FIELD OF INTELLECTUAL AND INFORMATION TECHNOLOGIES AND INNOVATIONS IN METHODS OF FORECASTING BUSINESS PROCESSES BASED ON THEIR SOFTWARE IMPLEMENTATION
This article will focus on innovative developments in the field of intellectual and information technologies and methods of forecasting business processes based on their software implementation. Innovations in their forecasting methods and neural networks are also revealed. Solving the problems of economic analysis at the enterprise is a factor that ensures the competitiveness of any organization at every stage of its development. This article reveals the main features of the application of data mining methods in forecasting the activities of an enterprise, and also provides a list of typical tasks and algorithms used in their solution.
Splines interpolation analysis using Maple package
.Expressing relationships in data with functions is both useful and convenient. It allows us to estimate dependent variables at values of independent variables not given in the data, take derivatives, integrate, and even solve differential equations. This is done by interpolation in a precise way. Interpolation is a set of function points that passes through each data point. Linear polynomial interpolation, cubic spline, Lagrange and Newton are common interpolation methods. In interpolation problems, spline interpolation is often preferred over polynomial interpolation because it gives similar results even when using low-order polynomials, while avoiding the phenomenon common at higher orders. will be We used simple linear functions to introduce some basic concepts and issues related to spline interpolation. Then we derive an algorithm for fitting quadratic lines to the data. Finally, we present material on the cubic spline, which is the most common and useful version in engineering practice. Cubic spline is easy to display and calculate by Maple package. Because Maple is closed, the same math symbols used in classrooms can be used to enter data. In addition, the Maple package has many features, including converting outputs to MATLAB codes and LaTeX commands, where computational problems related to the subject are presented with precise and explicit answers.
TECHNOLOGIES FOR STORING AND QUERYING LARGE COLLECTIONS OF XML DOCUMENTS
Currently, web applications using XML repositories (banking, accounting, personnel management, airline reservations, weather monitoring and forecasting, electronic control and e-commerce) process a huge amount of temporary information and need a complete history of data and schema changes for effective and transparent management of the information system. Existing XML DBMS and XML tools do not support this function, which makes it difficult to build a history of changes, difficult to return to the previous state, and the possibility of data loss. As a result, there is a problem of effective management of temporary data storage when working with a large number of small XML documents and many additional elements /attributes.
Survey of Modern Trends in Computer Security and Artificial Intelligence
In this article we present the modern trends like Explainable Machine Learning (EML) versus classical Machine Learning (ML), the computer security is to be evaluated from the point of view of the hashing and authentication schemes in Hyper-Text Transfer Protocol (HTTP), most of the emphasis of this work is made towards hashing in representing the identity of data sources and making possible to use these hashes as crypto currencies in block-chaining technology, the survey also gives the definition of the basic hashing algorithm in the assumption that P not equals NP, where P is the polynomial class of complexity and NP is a non-polynomial class, since this fact was proved before as equality between P and NP, this is still remains challenging to prove that hashing function can be dual for either input or output, thus giving the possibility of compromising the computer security system and obtain the prior hash in hashing queue in block-chaining and, probably, partial chunks of the hashed data.
Review of Perspectives of Programming Olympiads in Kazakhstan
We present the research aimed at the current status of the programming Olympiads in which Kazakhstan is involved and holds a positive line, we propose various pros and cons for the training of the participants of these events. Since the participation of Kazakhstan in the International Olympiad in Informatics (IOI) for schoolers and International Collegiate Programming Contest (ICPC), which is upheld by Association of Computing Machinery (ACM), most of the better results were shown on IOI rather than ACM ICPC, where still participants from our country demonstrate stable tendency at gaining finals, however, still not receiving the prize pool consisting of the first twelve teams in the final rating. The problem which is to be solved by participants can be also classified as polynomial (P-complete) or non-polynomial (NP-complete), which, in turn, gives us the observation of what could be solved using rational solution. We demonstrate this fact on examples of two problems from ACM ICPC.
Equivalence of Complexity Classes via Finite Automata Derivatives
In this article practical, experimental and theoretical results of the conducted research are presented, these results refer to the main question in complexity theory like the “P versus NP” theorem, first proposed by Stephen Cook in his seminal paper, we give concise question of the equivalence of these classes from the state of conversion algorithm of non-deterministic finite automata (NFA) to deterministic finite automata (DFA), we do it by considering the canonical regular expression form presented by Schneider Klaus and do the derivative processing from the Berry-Sethi algorithm, the result gives P-complete algorithm along the canonical form of regular expressions when applying subset construction for specific regular expressions or NFA, DFA in this case remains applicable even for Turing tape machines, however, due to the past statement of the “P versus NP” theorem given by author in previous work this leads to the conclusion of the equivalence of complexity classes like P and NP as in canonical form the subset construction produces exponential growth of the number of states of DFA
ОРГАНИЗАЦИЯ И ОБЕСПЕЧЕНИЕ БЕЗОПАСНОСТИ ОБЛАЧНЫХ ВЫЧИСЛЕНИЙ
Annotation. The relevance of this study lies in the fact that today not only certain groups of users use cloud systems, but also many companies use them as a data warehouse and use them to exchange data. Cloud computing consists of such basic components as the platform core, interface, data storage, user management, application operation, which must monitor the system as a whole and ensure their protection. Accordingly, in this article, special attention has been paid to cloud computing and its various security approaches, as well as data encryption methods that perform encryption with symmetric and asymmetric keys. A cloud computing system can be exposed to various security threats, namely confidentiality, integrity, data availability and cloud infrastructure threats.
облачные вычисления, безопасность, конфиденциальность, Docker, Kubernetes
STUDY OF CRITICAL POINTS IN THE DIFFERENTIAL CRYPTOANALYSIS OF S-BLOCKS IN HASHING ALGORITHM "HBC-256"
In this work described a differential cryptanalysis of the "HBC-256" algorithm one of the hashing algorithms developed at the Institute of Information and Computing Technologies of the RK MES CS, is provided. Taking into account the main properties of differential cryptanalysis and based on the conclusions of other scientific works, the situation of pairs of open and corresponding closed texts at critical points is studied. In the conclusion of the article, it is concluded that the S-boxes of the hashing algorithm are resistant to situations where it is possible to cause a collision through critical points in the table of differences.
Modern Review of Past Problems in Applied Mathematics and Computer Science
In this article we present the novel model of studying the past problems in present. These problems are very well handled by many authors; however, the result remains unproved. The problems are as follows: Nash equilibria in co-operative games and P versus NP theorem by Stephen Cock. We show that there is a solution for both classical problem in a partial case for “P versus NP”-theorem and co-operative games equilibria for all cases. Since partial case for P-NP problem could be proved by showing that Bellman’s dynamic programming (DP) is the most optimal algorithm for composite tasks and problems. We also show that same equation by Bellman within the pre-defined parameter can be valid for both P and NP classes of problem according to the ordered sets of arbitrary variables which are compound to Bellman’s equation, which was studied well in prior works by the same author, who holds the position of IT-analyst at the present time.
THEORETICAL APPROACHES TO THE DEFINITION OF BLOCKCHAIN TECHNOLOGIES
The article presents an analysis of blockchain technology. Blockchain is the best tool of the current decade. The possibility of using this innovative technology to ensure information security is shown. Blockchain technology was created to store transaction data. However, the structure of block chains using blockchain technology allows you to store various other metadata – catalogs, registries, directories, metadata databases, etc. This makes it possible to use blockchain technology for backup, information protection. The use of blockchain technology can provide complete decentralization of domain names and distribution of content across a larger number of nodes, which will make it virtually invulnerable to cyber attacks The article identifies the technological aspects of the introduction of Blockchain technology, substantiates the main characteristics of this technology, and notes the accepted typology of Blockchain varieties depending on the specifics of implementation and technological features. There are varieties of algorithms for "consensus" agreements, both in the context of technologies.
blockchain technologies, private, public and consortium Blockchain, consensus matching algorithm
Copyright (c) 2022 ADVANCED TECHNOLOGIES AND COMPUTER SCIENCE https://creativecommons.org/licenses/by-nc/4.0
ON SOME ISSUES OF RESOURCE ALLOCATION IN THE MANAGEMENT OF COMPLEX PROCESSES
With the emergence of new time requirements for the quality of educational services, which is affected by management in functioning business processes, the available research in the field of resource allocation in the management of complex processes was studied. An overview of the basic concepts is made, a classification of resource allocation tasks and methods of their solution is given. According to the publications, it can be said that for a long time the issues of management in organizations based on the effective allocation of resources remain relevant. Many approaches and methods have been used to solve problems in this area. This article analyzes published articles on problematic issues of resource allocation in organizations. The formulation of the task of managing the allocation of resources in the organization of the educational process is defined, which requires the development of new approaches and methods – planning the optimal teaching load of the teacher under given constraints
Modeling and optimization of complex systems and business processes
resource allocation, complex processes, optimization methods, management, planning, decision-making
A, The MULTIPARAMETER BIOMETRIC PERSONALITY IDENTIFICATION
The article is devoted to the development of a system for biometric identification of a person by face, fingerprints and voice. As informative signs of biometric identification of a person by face, two-dimensional and three-dimensional characteristics of a person's face were used, taking into account the area and volume. A sophisticated identification algorithm has been developed to take into account such phenomena as portrait shift, different photo scales and the tilt of the identified person. For biometric identification of a person by fingerprints, an FPM10A scanner and an Arduino microcontroller were used. Identification signs are based on the analysis of the structure of papillary patterns on the finger: type and type of papillary pattern; direction and steepness of streams of papillary lines; the structure of the central pattern of the pattern; delta structure; the number of papillary lines between the center and the delta and many other signs. Each print can contain up to 70 or more minutes. For biometric identification of a person by voice, the MFCC and PLP algorithms are used for digital processing and analysis of audio recordings. Various algorithms are used for acoustic analysis of speech: hidden Markov models, a model of a mixture of Gaussian distributions. The result of determining the tone of speech and the content of speech for the purposes of identification by voice is obtained. The “Multiparameter automated system of biometric identification of a person” has been developed on the Visual FoxPro DBMS.
information security, two-dimensional and three-dimensional image, identification, papillary patterns, voice characteristics, human speech, acoustic modeling.
A METHOD FOR CALCULATING THE INFORMATION SECURITY RISK
The article discusses the issues of identifying threats and vulnerabilities of information security violations. To protect information, it is necessary to create computer attack detection systems. Explanations were given on the concept of cyber attacks and their types were affected. No organization is currently sufficiently protected from cyber attacks. All organizations should develop a special plan to combat cybercriminals. A special plan allows you to prepare for emergencies, resist emerging threats and quickly restore the effect of the attack. The need to know the threatening factors and understand their tactics, methods and procedures to protect against cyber attacks is emphasized. The process of information protection should be comprehensive and continuous, carried out at all stages of the creation and use of automated data processing tools. The main methods of information protection are given.
Information security, cyber attacks, cybercrime, information protection, threats, vulnerability.
FORMATION OF PROFESSIONAL COMPETENCE OF A FUTURE COMPUTER SCIENCE TEACHER IN TEACHING THE SUBJECT OF INFORMATION SECURITY
The article is devoted to the consideration of the issues of designing and creating a methodological system for preparing future teachers to ensure the information security of students. The formation of competencies of future computer science teachers in the field of information security will be more effective if the developed and implemented model of the competence formation methodology includes normative-target, methodological, content-organizational and evaluation. In our study, the design and development of a methodological system is based on the provisions of competence-based, modular, personality-oriented, activity-based and system approaches, as well as the concept of informatization of education. The analysis of the relationship of structural components made it possible to determine the systemic role of the goal, which determines the content of training, the choice of methods, means and forms of training that ensure its achievement. The presented model reflects the structural and functional components of the methodological system, in which its components are goals, content, methods, means, forms, learning outcomes in the form of meaningful content of the structural components of the training of future teachers.
education, educational process, information security, training of computer science teachers, competence in the field of information security, methodological model.
INTRODUCING PQI-OPERATOR IN THEORY OF COMPUTATIONAL COMPLEXITY
In this article we describe the notion of PQI-operator used before in application role for implementing extended finite state automatons within the subset construction; we give precise definition of this operator and prove important complexity theorems according to the model provided and prior work; the presented operation method can be used for the estimation of the overridden complexity as per automatons constructed through modified subset construction which was well studied before. The complexity, thus, can be of different type according to the classification which was presented earlier in this research of the decidability of complex algorithms which are impractical due to the state explosion, for example, in Rabin-Scott subset construction. These algorithms' complexity can be the type of factorial also. We will show that there exists a PQI-operator followed from the approach presented in the cycle of these works, thus, this work can be seen as the continuation of the study of the theory of automatons and state complexity.
computational complexity, operator, theoretical computer science, subset construction, finite state automatons.
Internal Workload of NoSQL Relational Database
In this article we present the scheme of internal workload of typical relational database supporting NoSQL human interaction protocol, we state that the production consumption of query complexity cannot be avoided and modern techniques like explain plan play vital role in bringing the functionality of database server to the end-user with support of open data storage like CSV file format which, in turn, is textual – thus, the question of open storage is discussed in this work within the unlimited support of table sheet formats like CSV, as to the modern Big Data trends we propose the solution used supposedly empirically by popular SQL database systems – this is a plan to run the incoming query and transform the result to the format which can be adopted for final output; we also develop the end programmable product using C# programming language and .NET framework which are the modern programming environments for proper development of platform independent software – the proof of important theorems of relational database query complexity processing and optimization is also given.
The NEWTON–COTES FORMULAS FOR NUMERICAL INTEGRATION IN MAPLE
Abstract. This article discusses the Newton-Coates formulas for the numerical integration of the Maple package, which have been discussed. In this study, for the purpose of numerical integration of trapezoidal method, Simpson method and Simpson 3/8 method, we examined. We analyzed the function f defined in the interval [a, b] at point f (x) by presenting several analyzes. The Maple package provides the latest applications of numerical analysis in a shorter and more efficient way, which has led to the solution of important scientific and technical problems today. With the help of Maple software, we solved our desired changes on its clear and reliable forms.
Maple, Newton-Coates formula, Trapezoid, Simpson's Rule, Simpson's 3/8 Rule.
A The ACCOUNTING FOR THE TEMPERATURE DISTRIBUTION OF A BODY IN THE FORM OF A RECTANGULAR PARALLELEPIPED, TAKING INTO ACCOUNT HEAT TRANSFER USING A VARIATIONAL APPROACH
Finite element method is a numerical method solutions of differential equations, found in physics and technology. The emergence of this method associated with solving problems of space research. It was first published in the work of Turner, Cluj, Martin and Topp. This work contributed to the emergence of other works; a number of articles have been published with examples of the finite element method to the problems of construction mechanics of continuous media. The main idea behind the finite element method is that any continuous quantity such,like temperature pressure and displacement, can be approximated by a discrete model, which is built into a set of piece-continuous functions defined on a finite number of subdomains. The main idea of the finite element method is that any continuous quantity, such as temperature, pressure and displacement, can be approximated by a discrete model, which is built on a set of piece-continuous functions definedon a finite number of subdomains.
Finite element, pipe, motion, cross section, compression, lubrication, system, vibration, equilibrium, continuous value, discrete model, node.
IMAGE PROCESSING TECHNOLOGY BASED ON CONVOLUTIONAL NEURAL NETWORK
As a popular deep learning method for processing image information, convolutional neural networks can learn the features in the image after training, and complete the extraction and classification of image features. Therefore, it is widely used in the research of computer vision fields such as picture processing and pattern recognition. The purpose of this article is to sort out convolutional neural networks and their structural characteristics and introduce and analyze the basic working principles of convolutional neural networks and realize examples of the application of CNN model training in image feature extraction and recognition.
Deep learning; Convolutional neural network; image processing; image recognition
Key tools in the development of educational platforms "Up skills"
This research is aimed at developing unique software to eliminate the problem when choosing one or another platform for the implementation of this kind of educational services. When developing software products, you never act on a whim - at least not unless you are planning business suicide. There is always a step-by-step plan that you follow to move from one stage to the next, making sure you don't slip as you move from idea to implementation. This article is an immersive overview of the software development process. As part of the product discovery process, it's all about connecting the dots between what you intend to build and whether or not someone will ever want you to use it. At this point, you should already know enough why you are creating a product and who its end users are. But you need a more coherent strategy to speed up the design process with your team. In addition to paid educational courses with documentary evidence of learning outcomes, there are also opportunities for free online education. Educational programs involve several levels of training, different in duration and quality.
Courses, video tutorials, trainings, gamification, distance learning, curator, programming, educational platform.