Now showing 1 - 10 of 10
No Thumbnail Available
Publication

The Application of Simulated Annealing Method for Solving Travelling Salesman Problem

2016, Grabusts, Pēteris, Jurijs Musatovs

No Thumbnail Available
Publication

Using grid-clustering methods in data classification

2002, Grabusts, Pēteris, A. Borisov

This paper examines grid-clustering method. Unlike the conventional methods, this method organizes the space surrounding the patterns. It uses a multidimensional grid data structure. The resulting block partitioning of the value space is clustered via a neighbor search. The mathematical description of the algorithms employed is given. Some case studies and ideas on how to use the algorithms are described.

No Thumbnail Available
Publication

Comparative Evaluation of Four Methods for Exploratory Data Analysis

2021, Oleg Uzhga-Rebrov, Grabusts, Pēteris

Research activities in many areas are associated with the use of various types of data. This data may contain important information, but this information is hidden in the data. In order to extract relevant information, this data must be subjected to appropriate processing and analysis. Data analysis allows to clarify the data structure and, if necessary, transform the data into a form that allows to extract the required information. In recent years powerful data analysis techniques have been developed. Typically, these methods are computationally complex and require the use of suitable software to implement. This paper summarizes and analyses four widely used methods of exploratory data analysis: principal component analysis, singular value decomposition, factor analysis, and linear discriminant analysis.

No Thumbnail Available
Publication

Path Planning and Process Modelling for Chemical Engineering

2014, Edvards Valbahs, Ilo Dreyer, Grabusts, Pēteris

Usually, when the practical motion planning and the shortest path are discoursed, mainly the limited number of tasks is observed. Almost all the tasks associated with the path from one point in 2D or 3D space to another point can be attributed to the usual issue in the practical application. Motion planning and the shortest path have vivid and indisputable importance as human activity in such areas as logistics and robotics. In our work we would like to draw particular attention to the field of application seems to be unnoticeable for the task such as motion planning and the shortest path problem. Due to quite simple examples used, we would like to show that the task of motion planning can be used for simulation and optimization of multi-staged and restricted processes which are presented in chemical engineering accordingly. In the article the simulation and optimization of two important chemical-technological processes for the chemical industry are discussed. The work done gave us the possibility to work out software for simulation and optimization of processes that in some cases facilitates and simplifies the work of professionals engaged in the field of chemical engineering.

No Thumbnail Available
Publication

Path Planning Using Non-Euclidean Metric

2013, Edvards Valbahs, Grabusts, Pēteris

In order to achieve the wide range of the robotic application it is necessary to provide iterative motions among points of the goals. For instance, in the industry mobile robots can replace any components between a storehouse and an assembly department. Ammunition replacement is widely used in military services. Working place is possible in ports, airports, waste site and etc. Mobile agents can be used for monitoring if it is necessary to observe control points in the secret place. The paper deals with path planning software for mobile robots. The aim of the research paper is to analyze motion-planning algorithms that contain the design of modelling software. The software is needed as environment modelling to obtain the simulation data. The simulation data give the possibility to conduct the wide analyses for selected algorithm. Analysis means the simulation data interpretation and comparison with other data obtained using the motion planning. The results of the careful analysis were considered for optimal path planning algorithms. The experimental evidence was proposed to demonstrate the effectiveness of the algorithm for steady covered space. The results described in this work can be extended in a number of directions, and applied to other algorithms.

No Thumbnail Available
Publication

Evaluation of Clustering Results in the Aspect of Information Theory

2020, Grabusts, Pēteris

Clustering is the process of finding possible groups in a given set, taking into account the signs of similarity or difference between the elements of this set. In cluster analysis, it is necessary to classify the data in some way or to find regularities in given data, therefore the concept of “regularity” is gaining more and more importance in the context of intelligent data processing systems. It is necessary to find out how the data are related to each other, what is the similarity or difference of different data, what is the measure of comparison of these data. For such purposes, various clustering algorithms can be used, which divide the data into groups according to certain criteria - metrics. Metric in this context means the distance between the points in the cluster. The existing methods of entropy clustering is an information-theoretical approach to the problem of clustering. In the work the evaluation of clustering quality was performed with the help of clustering quality criteria and in the context of information theory concepts.

No Thumbnail Available
Publication

Using Path Planning for Process Modelling in Chemical Industry

2016, Edvards Valbahs, Ilo Dreyer, Grabusts, Pēteris

Usually, when the practical motion planning and the shortest path are discoursed, mainly the limited number of tasks is observed. Almost all the tasks associated with the path from one point in 2D or 3D space to another point can be attributed to the usual issue in the practical application. Motion planning and the shortest path have vivid and indisputable importance as human activity in such areas as logistics and robotics. In our work we would like to draw particular attention to the field of application seems to be unnoticeable for the task such as motion planning and the shortest path problem. Due to quite simple examples used, we would like to show that the task of motion planning can be used for simulation and optimization of multi-staged and restricted processes which are presented in chemical engineering accordingly. In the article the simulation and optimization of three important chemical-technological processes for the chemical industry are discussed. The work done gave us the possibility to work out software for simulation and optimization of processes that in some cases facilitates and simplifies the work of professionals engaged in the field of chemical engineering.

No Thumbnail Available
Publication

Security Protocols Analysis in Relation to Information Structures Protection

2019, Grabusts, Pēteris

The concept of information warfare encompasses the use of information and communication technologies to gain an advantage over a potential opponent. The information warfare is the manipulation with the information that trusts the goal, so that the goal should make decisions about its interests in the interests of opponents. Information structures are treated as systems that process different types of information, provide storage and access to users. Such structures may enclose neural networks, self-learning systems etc. They need to be ready to learn, respond to threats and ensure their safety, which is topical in today's information warfare. The paper will examine theoretical aspects of ensuring the security of information structures from the system theory point of view. The description of information structures, analysis of their security protocols will be given. The knowledge base of the information structure can be a neural network, the training of which is secured from external interference. The research presents a description of a potential counteraction against the threats of information warfare against information systems (AI based on artificial neural networks). The CORAS methodology for risk analysis in case of threats to information structures was discussed.

No Thumbnail Available
Publication

Ensuring the security of information structures in today's environment

2018, Grabusts, Pēteris

In the modern sense, the concept of information warfare includes the use and management of information and communication technologies to achieve a competitive advantage compared to the opponent. An information warfare is a manipulation with information that trusts a goal without an objective understanding, so that the goal is to take decisions against its own interests in the interests of the opponents. Information structures are considered as systems that produce and process various types of information, provide the storage of information and access to users. Such information structures may include neural networks, adaptive learning systems, etc. This analytical article will cover more theoretical aspects related to the security of information systems from the system theory point of view. The author considers artificial neural networks as one of the potential threats in the context of information warfare.

No Thumbnail Available
Publication

Path Planning for Process Modelling in Chemical Engineering

2014, Edvards Valbahs, Ilo Dreyer, Grabusts, Pēteris

Usually, when the practical motion planning and the shortest path are discoursed, mainly the limited number of tasks is observed. Almost all the tasks associated with the path from one point in 2D or 3D space to another point can be attributed to the usual issue in the practical application. Motion planning and the shortest path have vivid and indisputable importance as human activity in such areas as logistics and robotics. In our work we would like to draw particular attention to the field of application seems to be unnoticeable for the task such as motion planning and the shortest path problem. Due to quite simple examples used, we would like to show that the task of motion planning can be used for simulation and optimization of multi-staged and restricted processes which are presented in chemical engineering accordingly. In the article the simulation and optimization of two important chemical-technological processes for the chemical industry are discussed. The work done gave us the possibility to work out software for simulation and optimization of processes that in some cases facilitates and simplifies the work of professionals engaged in the field of chemical engineering.