Introduction: This study aims to translate and investigate the validity and reliability of the Turkish version of the Clinical Assessment Interview for Negative Symptoms (CAINS), which has additional features compared to other scales in assessing negative symptoms in patients with schizophrenia.
Methods: The Turkish version of CAINS was constructed upon an initial translation to Turkish, and an English back translation of the scale was later conducted. The patients diagnosed with schizophrenia (n=79) according to Diagnostic and Statistical Manual of Mental Disorders, Fifth Edition (DSM-5) diagnostic criteria were administered the Turkish version of CAINS, the Positive and Negative Syndrome Scale (PANSS), the Scale for the Assessment of Negative Symptoms (SANS), the Scale for the Assessment of Positive Symptoms (SAPS), the Calgary Depression Scale for Schizophrenia (CDSS), the Clinical Global Impression Scale (CGI), the Global Assessment of Functioning Scale (GAF) and the Simpson-Angus Extrapyramidal Side Effects Assessment Scale (SAS). In addition, two interviewers assessed the video recordings of 11 patients for reliability analysis.
Results: Inter-rater reliability was found to be high (intraclass correlation coefficient (ICC): 0.831). Exploratory and confirmatory factor analyses indicated that Cronbach's alpha was 0.956 for the full scale, and the two-dimensional structure explained the scale better. In convergent validity analyses, CAINS overall scores correlated significantly with the SANS total score (r=0,932) and PANSS negative score (r=0,902). In discriminant validity analyses, CAINS overall scores markedly correlated with the SAPS total (r=0,615), PANSS positive (r=0,497) and PANSS general psychopathology (r=0,737) scores. Additionally, when CGI and GAF scores were considered covariant, the significant correlation of CAINS total scores with the SANS total and PANSS negative scores continued; however, the correlation with PANSS positive score was prominently reduced, and the correlation with PANSS general psychopathology disappeared.
Conclusion: The Turkish version of the CAINS appears to be a valid and reliable tool with strong psychometric properties in a sample consisting of patients with schizophrenia.
{"title":"Validity and Reliability Study of Turkish Version of Clinical Assessment Interview for Negative Symptoms (CAINS).","authors":"Sefa Vayisoğlu, Sevilay Karahan, Şeref Can Gürel, Ayşe Elif Anil Yağcioğlu","doi":"10.29399/npa.28438","DOIUrl":"10.29399/npa.28438","url":null,"abstract":"<p><strong>Introduction: </strong>This study aims to translate and investigate the validity and reliability of the Turkish version of the Clinical Assessment Interview for Negative Symptoms (CAINS), which has additional features compared to other scales in assessing negative symptoms in patients with schizophrenia.</p><p><strong>Methods: </strong>The Turkish version of CAINS was constructed upon an initial translation to Turkish, and an English back translation of the scale was later conducted. The patients diagnosed with schizophrenia (n=79) according to Diagnostic and Statistical Manual of Mental Disorders, Fifth Edition (DSM-5) diagnostic criteria were administered the Turkish version of CAINS, the Positive and Negative Syndrome Scale (PANSS), the Scale for the Assessment of Negative Symptoms (SANS), the Scale for the Assessment of Positive Symptoms (SAPS), the Calgary Depression Scale for Schizophrenia (CDSS), the Clinical Global Impression Scale (CGI), the Global Assessment of Functioning Scale (GAF) and the Simpson-Angus Extrapyramidal Side Effects Assessment Scale (SAS). In addition, two interviewers assessed the video recordings of 11 patients for reliability analysis.</p><p><strong>Results: </strong>Inter-rater reliability was found to be high (intraclass correlation coefficient (ICC): 0.831). Exploratory and confirmatory factor analyses indicated that Cronbach's alpha was 0.956 for the full scale, and the two-dimensional structure explained the scale better. In convergent validity analyses, CAINS overall scores correlated significantly with the SANS total score (r=0,932) and PANSS negative score (r=0,902). In discriminant validity analyses, CAINS overall scores markedly correlated with the SAPS total (r=0,615), PANSS positive (r=0,497) and PANSS general psychopathology (r=0,737) scores. Additionally, when CGI and GAF scores were considered covariant, the significant correlation of CAINS total scores with the SANS total and PANSS negative scores continued; however, the correlation with PANSS positive score was prominently reduced, and the correlation with PANSS general psychopathology disappeared.</p><p><strong>Conclusion: </strong>The Turkish version of the CAINS appears to be a valid and reliable tool with strong psychometric properties in a sample consisting of patients with schizophrenia.</p>","PeriodicalId":54874,"journal":{"name":"Journal of Automation and Information Sciences","volume":"43 1","pages":"59-65"},"PeriodicalIF":1.1,"publicationDate":"2024-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10943947/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89634169","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-03-01DOI: 10.34229/1028-0979-2022-2-1
V. Petrivskyi, Yaroslav Petrivskyi, V. Shevchenko, I. Sinitsyn
Due to the widespread use of sensors in data collection and processing, one of the key criteria is the amount of information accumulated and energy efficiency. While monitoring the territory, the movement of research objects is common. As a result there is a change in the probability of their detection in the segment of the territory. Also, segments may be of varying importance. Taking these factors into account will significantly increase the amount of information accumulated. The article presents a method of constructing the optimal trajectory of sensors motion taking into account the importance of territory segments and the probability of detection of objects. The method is based on the representation of distribution of the probability of detection of objects and the importance of territory segments in the form of layers and their integration into a layer of the probable value of detected objects. Seven classes of the probable value of detected objects with corresponding numerical and graphical equivalents are considered. As optimal trajectory of sensors motion the trajectory which provides minimum energy expenditure is meant. Energy efficiency is achieved by constructing a trajectory of minimum length as a solution to the salesman’s problem. The set of points at which the trajectory is built is formed on the basis of the layer of the probable value of the detected objects after the procedure of replacing the nodes. A separate node replacement class, or superposition of node replacement classes, is proposed for each class of probable value of detected objects. Replacement of five, three and two nodes is described. A genetic algorithm with modification of crossing and selection rules was used to find a solution to this problem. A set of trajectories is constructed using the proposed algorithm. The analysis of the obtained results confirmed the efficiency of the developed method and allowed to increase the energy efficiency when covering a given area by 76 %.
{"title":"OPTIMIZATION OF THE TRAJECTORY OF SENSORS MOTION TAKING INTO ACCOUNT THE IMPORTANCE OF THE AREAS OF THE MONITORING AREA SEGMENTS AND THE PROBABILITY OF DETECTION OF OBJECTS","authors":"V. Petrivskyi, Yaroslav Petrivskyi, V. Shevchenko, I. Sinitsyn","doi":"10.34229/1028-0979-2022-2-1","DOIUrl":"https://doi.org/10.34229/1028-0979-2022-2-1","url":null,"abstract":"Due to the widespread use of sensors in data collection and processing, one of the key criteria is the amount of information accumulated and energy efficiency. While monitoring the territory, the movement of research objects is common. As a result there is a change in the probability of their detection in the segment of the territory. Also, segments may be of varying importance. Taking these factors into account will significantly increase the amount of information accumulated. The article presents a method of constructing the optimal trajectory of sensors motion taking into account the importance of territory segments and the probability of detection of objects. The method is based on the representation of distribution of the probability of detection of objects and the importance of territory segments in the form of layers and their integration into a layer of the probable value of detected objects. Seven classes of the probable value of detected objects with corresponding numerical and graphical equivalents are considered. As optimal trajectory of sensors motion the trajectory which provides minimum energy expenditure is meant. Energy efficiency is achieved by constructing a trajectory of minimum length as a solution to the salesman’s problem. The set of points at which the trajectory is built is formed on the basis of the layer of the probable value of the detected objects after the procedure of replacing the nodes. A separate node replacement class, or superposition of node replacement classes, is proposed for each class of probable value of detected objects. Replacement of five, three and two nodes is described. A genetic algorithm with modification of crossing and selection rules was used to find a solution to this problem. A set of trajectories is constructed using the proposed algorithm. The analysis of the obtained results confirmed the efficiency of the developed method and allowed to increase the energy efficiency when covering a given area by 76 %.","PeriodicalId":54874,"journal":{"name":"Journal of Automation and Information Sciences","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41341343","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 : 2022-01-01DOI: 10.34229/1028-0979-2022-1-4
Oksana Kyrychenko, I. Malyk, S. Ostapov
The main attention is paid to the estimation of the optimal number of clusters for the system given by the node adjacency matrix Based on the assumptions about the similarity of connections in the cluster, the conclusion was drawn about optimal number of clusters for different applications. Poisson's network of connections is modeled and the optimal number of clusters is found. The simulation results indicate high accuracy in determining the optimal number of clusters. In the basic theorem, it is important to assume the existence of a moment above the second for each element of the matrix However, taking into account normalization, this condition can be reduced to the existence of a mathematical expectation of the matrix This weakening of the convergence conditions makes it possible to use a proven statement for a wider class of applied problems, where the presence of a finite variance is not required. Note that the emissions are valid eigenvalues for the normalized matrix, which allows you to localize quickly emissions with complexity where — the number of system nodes. Thus, we managed to weaken two important assumptions about the distribution of elements of a random matrix, namely the assumption about the equality of 0 mathematical expectations of the elements of the matrix and the independence of the elements of the matrix. In addition, the independence of the elements can be replaced by weak independence, which maintains convergence to the mean value in the law of large numbers.
{"title":"CLUSTER STRUCTURE ANALYSIS OF INTERNET NETWORKS BASED ON RANDOM MATRIXES","authors":"Oksana Kyrychenko, I. Malyk, S. Ostapov","doi":"10.34229/1028-0979-2022-1-4","DOIUrl":"https://doi.org/10.34229/1028-0979-2022-1-4","url":null,"abstract":"The main attention is paid to the estimation of the optimal number of clusters for the system given by the node adjacency matrix Based on the assumptions about the similarity of connections in the cluster, the conclusion was drawn about optimal number of clusters for different applications. Poisson's network of connections is modeled and the optimal number of clusters is found. The simulation results indicate high accuracy in determining the optimal number of clusters. In the basic theorem, it is important to assume the existence of a moment above the second for each element of the matrix However, taking into account normalization, this condition can be reduced to the existence of a mathematical expectation of the matrix This weakening of the convergence conditions makes it possible to use a proven statement for a wider class of applied problems, where the presence of a finite variance is not required. Note that the emissions are valid eigenvalues for the normalized matrix, which allows you to localize quickly emissions with complexity where — the number of system nodes. Thus, we managed to weaken two important assumptions about the distribution of elements of a random matrix, namely the assumption about the equality of 0 mathematical expectations of the elements of the matrix and the independence of the elements of the matrix. In addition, the independence of the elements can be replaced by weak independence, which maintains convergence to the mean value in the law of large numbers.","PeriodicalId":54874,"journal":{"name":"Journal of Automation and Information Sciences","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47243307","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 : 2022-01-01DOI: 10.34229/1028-0979-2022-1-8
V. Gubarev, S. Melnychuk, N. Salnikov
The problem of increasing the accuracy of determining the orientation of a spacecraft (SC) using a system of star trackers (ST) is considered. Methods are proposed that make it possible to use a joint field of view and refine the relative position of ST to improve the accuracy of orientation determination. The use of several star trackers leads to an increase in the angle between the directions to the stars into the joint field of view, which makes it possible to reduce the condition number of the matrices used in calculating the orientation parameters. The paper develops a combinatorial method for interval estimation of the SC orientation with an arbitrary number of star trackers. To calculate the ST orientation, a linear problem of interval estimation of the orthogonal orientation matrix for a sufficiently large number of stars is solved. The orientation quaternion is determined under the condition that the corresponding orientation matrix belongs to the obtained interval estimates. The case is considered when the a priori estimate of the mutual binding of star trackers can have an error comparable to or greater than the error in measuring the angular coordinates of stars. With inaccurately specified matrices of the mutual orientation of the star trackers, the errors in the mutual orientations of the STs are added to the errors of measuring the directions to the stars, which leads to an expansion of the uncertainty intervals of the right-hand sides of the system of linear algebraic equations used to determine the orientation parameters. A method is proposed for solving the problem of refining the mutual reference of the internal coordinate systems of a pair of ST as an independent task, after which the main problem of increasing the accuracy of spacecraft orientation is solved. The developed method and algorithms for solving such a complex problem are based on interval estimates of orthogonal orientation matrices. For additional narrowing of the intervals, the property of orthogonality of orientation matrices is used. The numerical simulation carried out made it possible to evaluate the advantages and disadvantages of each of the proposed methods.
{"title":"METHOD AND ALGORITHMS FOR CALCULATING HIGH-PRECISION ORIENTATION AND MUTUAL BINDING OF COORDINATE SYSTEMS OF SPACECRAFT STAR TRACKERS CLUSTER BASED ON INACCURATE MEASUREMENTS","authors":"V. Gubarev, S. Melnychuk, N. Salnikov","doi":"10.34229/1028-0979-2022-1-8","DOIUrl":"https://doi.org/10.34229/1028-0979-2022-1-8","url":null,"abstract":"The problem of increasing the accuracy of determining the orientation of a spacecraft (SC) using a system of star trackers (ST) is considered. Methods are proposed that make it possible to use a joint field of view and refine the relative position of ST to improve the accuracy of orientation determination. The use of several star trackers leads to an increase in the angle between the directions to the stars into the joint field of view, which makes it possible to reduce the condition number of the matrices used in calculating the orientation parameters. The paper develops a combinatorial method for interval estimation of the SC orientation with an arbitrary number of star trackers. To calculate the ST orientation, a linear problem of interval estimation of the orthogonal orientation matrix for a sufficiently large number of stars is solved. The orientation quaternion is determined under the condition that the corresponding orientation matrix belongs to the obtained interval estimates. The case is considered when the a priori estimate of the mutual binding of star trackers can have an error comparable to or greater than the error in measuring the angular coordinates of stars. With inaccurately specified matrices of the mutual orientation of the star trackers, the errors in the mutual orientations of the STs are added to the errors of measuring the directions to the stars, which leads to an expansion of the uncertainty intervals of the right-hand sides of the system of linear algebraic equations used to determine the orientation parameters. A method is proposed for solving the problem of refining the mutual reference of the internal coordinate systems of a pair of ST as an independent task, after which the main problem of increasing the accuracy of spacecraft orientation is solved. The developed method and algorithms for solving such a complex problem are based on interval estimates of orthogonal orientation matrices. For additional narrowing of the intervals, the property of orthogonality of orientation matrices is used. The numerical simulation carried out made it possible to evaluate the advantages and disadvantages of each of the proposed methods.","PeriodicalId":54874,"journal":{"name":"Journal of Automation and Information Sciences","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44787237","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 : 2022-01-01DOI: 10.34229/1028-0979-2022-1-5
Ya. M. Drin’, I. Drin, Svetlana Drin
Over the past few decades, the theory of pseudodifferential operators (PDO) and equations with such operators (PDE) has been intensively developed. The authors of a new direction in the theory of PDE, which they called parabolic PDE with non-smooth homogeneous symbols (PPDE), are Yaroslav Drin and Samuil Eidelman. In the early 1970s, they constructed an example of the Cauchy problem for a modified heat equation containing, instead of the Laplace operator, PDO, which is its square root. Such a PDO has a homogeneous symbol |σ|, which is not smooth at the origin. The fundamental solution of the Cauchy problem (FSCP) for such an equation is an exact power function. For the heat equation, FSCP is an exact exponential function. The Laplace operator can be interpreted as a PDO with a smooth homogeneous symbol |σ|^2, σ ∈ Rn. A generalization of the heat equation is PPDE containing PDO with homogeneous non-smooth symbols. They have an important application in the theory of random processes, in particular, in the construction of discontinuous Markov processes with generators of integro-differential operators, which are related to PDO; in the modern theory of fractals, which has recently been rapidly developing. If the PDO symbol does not depend on spatial coordinates, then the Cauchy problem for PPDE is correctly solvable in the space of distribution-type generalized functions. In this case, the solution is written as a convolution of the FSCP with an initial generalized function. These results belong to a number of domestic and foreign mathematicians, in particular S. Eidelman and Y. Drin (who were the first to define PPDO with non-smooth symbols and began the study of the Cauchy problem for the corresponding PPDE), M. Fedoruk, A. Kochubey, V. Gorodetsky, V . Litovchenko and others. For certain new classes of PPDE, the correct solvability of the Cauchy problem in the space of Hölder functions has been proved, classical FSCP have been constructed, and exact estimates of their power-law derivatives have been obtained [1–4]. Of fundamental importance is the interpretation of PDO proposed by A. Kochubey in terms of hypersingular integrals (HSI). At the same time, the HSI symbol is constructed from the known PDO symbol and vice versa [6]. The theory of HSI, which significantly extend the class of PDO, was developed by S. Samko [7]. We extends this concept to matrix HSI [5]. Generalizations of the Cauchy problem are non-local multipoint problems with respect to the time variable and the problem with argument deviation. Here we prove the solvability of a nonlocal problem using the method of steps. We consider an evolutionary nonlinear equation with a regularized fractal fractional derivative α ∈ (0, 1] with respect to the time variable and a general elliptic operator with variable coefficients with respect to the second-order spatial variable. Such equations describe fractal properties in real processes characterized by turbulence, in hydrology, ecology, geophys
在过去的几十年里，伪微分算子理论(PDO)和含伪微分算子的方程(PDE)得到了广泛的发展。Yaroslav Drin和Samuil Eidelman提出了PDE理论的一个新方向，他们称之为带非光滑齐次符号的抛物PDE (PPDE)。在20世纪70年代早期，他们构造了一个柯西问题的例子，用于一个修正的热方程，它包含了PDO，而不是拉普拉斯算子，它是它的平方根。这种PDO具有均匀的符号|σ|，在原点处不光滑。这种方程的柯西问题(FSCP)的基本解是一个精确幂函数。对于热方程，FSCP是精确指数函数。拉普拉斯算子可以被解释为具有光滑齐次符号|σ|^2， σ∈Rn的PDO。热方程的一种推广形式是含有非光滑齐次符号的PDO的PPDE。它们在随机过程理论中有重要的应用，特别是在构造与PDO有关的带有积分-微分算子生成器的不连续马尔可夫过程中;在现代分形理论中，近年来得到了迅速的发展。如果PDO符号不依赖于空间坐标，则PPDE的Cauchy问题在分布型广义函数空间中是正确可解的。在这种情况下，解被写成FSCP与初始广义函数的卷积。这些结果属于许多国内外数学家，特别是S. Eidelman和Y. Drin(他们首先用非光滑符号定义了PPDO，并开始了相应PPDE的柯西问题的研究)，M. Fedoruk, a . Kochubey, V. Gorodetsky, V。利托夫琴科和其他人。对于某些新的PPDE类，证明了Hölder函数空间中Cauchy问题的正确可解性，构造了经典的FSCP，并获得了它们幂律导数的精确估计[1-4]。最重要的是A. Kochubey用超奇异积分(HSI)来解释PDO。同时，恒生指数符号是由已知的PDO符号构建的，反之亦然。恒生指数理论是由S. Samko提出的，它极大地扩展了PDO的范畴。我们将这个概念扩展到矩阵HSI[5]。柯西问题的推广是关于时间变量的非局部多点问题和有参数偏差的问题。本文用分步法证明了一类非局部问题的可解性。考虑一个正则分形分数阶导数α∈(0,1)的演化非线性方程，其时间变量为正则分形，二阶空间变量为变系数椭圆算子。这些方程描述了以湍流为特征的实际过程中的分形性质，包括水文学、生态学、地球物理、环境污染、经济和金融等领域。
{"title":"THE NONLOCAL PROBLEM FOR FRACTAL DIFFUSION EQUATION","authors":"Ya. M. Drin’, I. Drin, Svetlana Drin","doi":"10.34229/1028-0979-2022-1-5","DOIUrl":"https://doi.org/10.34229/1028-0979-2022-1-5","url":null,"abstract":"Over the past few decades, the theory of pseudodifferential operators (PDO) and equations with such operators (PDE) has been intensively developed. The authors of a new direction in the theory of PDE, which they called parabolic PDE with non-smooth homogeneous symbols (PPDE), are Yaroslav Drin and Samuil Eidelman. In the early 1970s, they constructed an example of the Cauchy problem for a modified heat equation containing, instead of the Laplace operator, PDO, which is its square root. Such a PDO has a homogeneous symbol |σ|, which is not smooth at the origin. The fundamental solution of the Cauchy problem (FSCP) for such an equation is an exact power function. For the heat equation, FSCP is an exact exponential function. The Laplace operator can be interpreted as a PDO with a smooth homogeneous symbol |σ|^2, σ ∈ Rn. A generalization of the heat equation is PPDE containing PDO with homogeneous non-smooth symbols. They have an important application in the theory of random processes, in particular, in the construction of discontinuous Markov processes with generators of integro-differential operators, which are related to PDO; in the modern theory of fractals, which has recently been rapidly developing. If the PDO symbol does not depend on spatial coordinates, then the Cauchy problem for PPDE is correctly solvable in the space of distribution-type generalized functions. In this case, the solution is written as a convolution of the FSCP with an initial generalized function. These results belong to a number of domestic and foreign mathematicians, in particular S. Eidelman and Y. Drin (who were the first to define PPDO with non-smooth symbols and began the study of the Cauchy problem for the corresponding PPDE), M. Fedoruk, A. Kochubey, V. Gorodetsky, V . Litovchenko and others. For certain new classes of PPDE, the correct solvability of the Cauchy problem in the space of Hölder functions has been proved, classical FSCP have been constructed, and exact estimates of their power-law derivatives have been obtained [1–4]. Of fundamental importance is the interpretation of PDO proposed by A. Kochubey in terms of hypersingular integrals (HSI). At the same time, the HSI symbol is constructed from the known PDO symbol and vice versa [6]. The theory of HSI, which significantly extend the class of PDO, was developed by S. Samko [7]. We extends this concept to matrix HSI [5]. Generalizations of the Cauchy problem are non-local multipoint problems with respect to the time variable and the problem with argument deviation. Here we prove the solvability of a nonlocal problem using the method of steps. We consider an evolutionary nonlinear equation with a regularized fractal fractional derivative α ∈ (0, 1] with respect to the time variable and a general elliptic operator with variable coefficients with respect to the second-order spatial variable. Such equations describe fractal properties in real processes characterized by turbulence, in hydrology, ecology, geophys","PeriodicalId":54874,"journal":{"name":"Journal of Automation and Information Sciences","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69845346","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 : 2022-01-01DOI: 10.34229/1028-0979-2022-1-2
Volodymyr Stoyan, D. Cherniy, S. Voloshchuk, Arsen Stoian
The three-dimensional problem of elastic membrane dynamics of arbitrary boundary outline with a given superficially distributed external force effect on it, is solved. The three-dimensional field of elastic dynamic displacements of membrane points is described by a differential model, which is a degenerate case of the previously constructed equations of the spatial theory of elasticity concerning thick elastic plates. It is assumed that the latter are supplemented with the information on the initial-boundary condition of the membrane, which in the general case is not of a force nature, and its amount is not sufficient for a mathematically correct formulation of the initial-boundary value problem. The solution of these incompletely defined initial-boundary problems of membrane dynamics became possible after root-mean square mathematical modeling of existing spatial-dynamic observations for the initial condition and current dynamics of its outline by a system of discretely and continuously defined modeling functions. The field of elastic-dynamic displacements of membraneʼ points constructed in the work, being an accurate solution of its differential mathematical model, with the available information on the initial-boundary condition of the latter, is consistent with the root-mean square criterion. Estimations of the accuracy of such modeling are made and conditions for its uniqueness are formulated in the paper. Cases of purely transverse and purely planar oscillations of the membrane are considered. The numerical realization of the obtained considered problemsʼ solution is conducted even with a minimum number of observations for the membraneʼs condition confirms the simplicity and correctness of the approach to these mathematically complex problemsʼ research of elastic-dynamics of thick elastic plates.
{"title":"ON DEGENARATE CASE OF THREE-DIMENTIONAL PROBLEM OF THICK ELASTIC PLATESʼ DYNAMICS","authors":"Volodymyr Stoyan, D. Cherniy, S. Voloshchuk, Arsen Stoian","doi":"10.34229/1028-0979-2022-1-2","DOIUrl":"https://doi.org/10.34229/1028-0979-2022-1-2","url":null,"abstract":"The three-dimensional problem of elastic membrane dynamics of arbitrary boundary outline with a given superficially distributed external force effect on it, is solved. The three-dimensional field of elastic dynamic displacements of membrane points is described by a differential model, which is a degenerate case of the previously constructed equations of the spatial theory of elasticity concerning thick elastic plates. It is assumed that the latter are supplemented with the information on the initial-boundary condition of the membrane, which in the general case is not of a force nature, and its amount is not sufficient for a mathematically correct formulation of the initial-boundary value problem. The solution of these incompletely defined initial-boundary problems of membrane dynamics became possible after root-mean square mathematical modeling of existing spatial-dynamic observations for the initial condition and current dynamics of its outline by a system of discretely and continuously defined modeling functions. The field of elastic-dynamic displacements of membraneʼ points constructed in the work, being an accurate solution of its differential mathematical model, with the available information on the initial-boundary condition of the latter, is consistent with the root-mean square criterion. Estimations of the accuracy of such modeling are made and conditions for its uniqueness are formulated in the paper. Cases of purely transverse and purely planar oscillations of the membrane are considered. The numerical realization of the obtained considered problemsʼ solution is conducted even with a minimum number of observations for the membraneʼs condition confirms the simplicity and correctness of the approach to these mathematically complex problemsʼ research of elastic-dynamics of thick elastic plates.","PeriodicalId":54874,"journal":{"name":"Journal of Automation and Information Sciences","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41504460","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 : 2022-01-01DOI: 10.34229/1028-0979-2022-1-10
B. Yailymov, A. Shelestov, Mikhail Emelyanov, Oleksandr Parkhomchuk
Today there is a lot of satellite data and products based on it in the public domain. By integrating them with heterogeneous socio-economic information and soil maps, model biophysical data using modern machine learning methods and modern approaches to geospatial data processing, it becomes possible to create maps of land degradation. Considering that classification maps, productivity maps and deforestation maps are the main intellectual components to create a degradation map, it is these products that affect the overall reliability of the results. For their validation, the necessary quality metrics are determined in the work, and the corresponding calculations are made. To evaluate the land cover map, independent test data were used to build a confusion matrix, and the obtained areas of the main crops were compared with statistical data. Agricultural land productivity was estimated using time series land cover classification maps and Crop Growth Modeling System (CGMS) biophysical plant development, as well as biophysical plant growth parameters using satellite data and biophysical plant development models. The LAI Map Accuracy Assessment (based on CGMS) is based on the comparison of Leaf Area Index (LAI) values modeled using the CGMS software framework with LAI ground measurement data collected through ground surveys. Numerous experiments were carried out to assess the quality of models and the results of deforestation maps on an independent test sample, which was not used at the neural network training stage. Degradation maps for several years were also analyzed and their validation was carried out with respect to productivity, in particular for the region that has undergone significant changes for the territory of Ukraine.
{"title":"VALIDATION OF LAND DEGRADATION CARDS ON THE BASIS OF GEOSPATIAL DATA","authors":"B. Yailymov, A. Shelestov, Mikhail Emelyanov, Oleksandr Parkhomchuk","doi":"10.34229/1028-0979-2022-1-10","DOIUrl":"https://doi.org/10.34229/1028-0979-2022-1-10","url":null,"abstract":"Today there is a lot of satellite data and products based on it in the public domain. By integrating them with heterogeneous socio-economic information and soil maps, model biophysical data using modern machine learning methods and modern approaches to geospatial data processing, it becomes possible to create maps of land degradation. Considering that classification maps, productivity maps and deforestation maps are the main intellectual components to create a degradation map, it is these products that affect the overall reliability of the results. For their validation, the necessary quality metrics are determined in the work, and the corresponding calculations are made. To evaluate the land cover map, independent test data were used to build a confusion matrix, and the obtained areas of the main crops were compared with statistical data. Agricultural land productivity was estimated using time series land cover classification maps and Crop Growth Modeling System (CGMS) biophysical plant development, as well as biophysical plant growth parameters using satellite data and biophysical plant development models. The LAI Map Accuracy Assessment (based on CGMS) is based on the comparison of Leaf Area Index (LAI) values modeled using the CGMS software framework with LAI ground measurement data collected through ground surveys. Numerous experiments were carried out to assess the quality of models and the results of deforestation maps on an independent test sample, which was not used at the neural network training stage. Degradation maps for several years were also analyzed and their validation was carried out with respect to productivity, in particular for the region that has undergone significant changes for the territory of Ukraine.","PeriodicalId":54874,"journal":{"name":"Journal of Automation and Information Sciences","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41998840","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 : 2022-01-01DOI: 10.34229/1028-0979-2022-1-11
Yurii Krak, S. Yaremenko
The paper investigates the problems of creating a multimedia simulator with a laser emitter for training the correct use of various weapons in order to acquire the skills of targeted high-speed shooting. Specialized Software is designed to train novice shooters and improve the level of fire training in learning the techniques and rules of small arms shooting. The software component consists of separate software modules that allow the user to configure the interactive shooting range, create and run shooting exercises. Hitting the target is determined by the coincidence of the central pixel of the laser response (spot) on the projection image with one of the target pixels. Note that the laser emitter is attached to a real weapon and when you pull the trigger, a spot appears on the screen as a result of the shot. Along with the use of real weapons, computer graphics tools are used to create appropriate virtual environments and simulate a variety of situations in it, as close as possible to real conditions. Hardware and algorithmic shooting errors have been studied and methods for their reduction have been developed. Hardware depends on the parameters of the laser emitter, the size and characteristics of the projection screen, resolution and characteristics of the receiving camera-sensor. Algorithmic depends on the selected algorithm and frame processing methods. The hardware and algorithmic errors of shooting have been investigated and methods have been developed to reduce them. The analysis of the spots from the laser emitter on the projection image and the search for the centroid of the spot are carried out. An algorithm for determining the centroid of a spot through two-stage binarization of the image has been developed and tested, the thresholds of binarization that are optimal for solving the problem have been determined. The test results showed that the obtained accuracy is within the hardware component of the error, and the speed in decision-making is performed in real time.
{"title":"ALGORITHMIC AND HARDWARE TOOLS FOR MOVING TARGETS DETECTION ON THE PROJECTION SCREEN FROM THE LASER EMITTER OF THE MULTIMEDIA TRAINER","authors":"Yurii Krak, S. Yaremenko","doi":"10.34229/1028-0979-2022-1-11","DOIUrl":"https://doi.org/10.34229/1028-0979-2022-1-11","url":null,"abstract":"The paper investigates the problems of creating a multimedia simulator with a laser emitter for training the correct use of various weapons in order to acquire the skills of targeted high-speed shooting. Specialized Software is designed to train novice shooters and improve the level of fire training in learning the techniques and rules of small arms shooting. The software component consists of separate software modules that allow the user to configure the interactive shooting range, create and run shooting exercises. Hitting the target is determined by the coincidence of the central pixel of the laser response (spot) on the projection image with one of the target pixels. Note that the laser emitter is attached to a real weapon and when you pull the trigger, a spot appears on the screen as a result of the shot. Along with the use of real weapons, computer graphics tools are used to create appropriate virtual environments and simulate a variety of situations in it, as close as possible to real conditions. Hardware and algorithmic shooting errors have been studied and methods for their reduction have been developed. Hardware depends on the parameters of the laser emitter, the size and characteristics of the projection screen, resolution and characteristics of the receiving camera-sensor. Algorithmic depends on the selected algorithm and frame processing methods. The hardware and algorithmic errors of shooting have been investigated and methods have been developed to reduce them. The analysis of the spots from the laser emitter on the projection image and the search for the centroid of the spot are carried out. An algorithm for determining the centroid of a spot through two-stage binarization of the image has been developed and tested, the thresholds of binarization that are optimal for solving the problem have been determined. The test results showed that the obtained accuracy is within the hardware component of the error, and the speed in decision-making is performed in real time.","PeriodicalId":54874,"journal":{"name":"Journal of Automation and Information Sciences","volume":" 4","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41254199","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 : 2022-01-01DOI: 10.34229/1028-0979-2022-1-9
O. Zaritskyi, O. Ponomarenko
The article deals with the topical issue of quantitative assessment of technological singularity. The authors made an analysis of artificial intelligence tools and approaches affecting the development of superintelligence, which allowed for the first time to develop a general multifactor model of technological singularity and present it in the space of direct and indirect indicators of development. The developed approach makes it possible to move from expert judgments on the issue of technological singularity in the form of extrapolated complexity curves of various systems or qualitative description of possible scenarios of technological development to quantitative assessment of the state of technological singularity. The links between the relevant functional areas of human intelligence and modern expert systems are formalized, a structural-functional model of knowledge acquisition is developed. A conclusion is made about the real limits of the processes of modern "intelligent" systems at the level of artificial thinking and logical cognition, which corresponds to a weak artificial intelligence. The state and ways of hardware development were analyzed, which allowed making a conclusion about the complex use of different hardware architectures and information processing principles: supercomputer, neurosynaptic and quantum computers to implement the concept of technological singularity. Formalized in the form of a structural model the areas of research most influential in the development of artificial intelligence, and their relationship to existing approaches and methods of processing big data. For the first time proposed the classification of indicators of development of artificial intelligence within two classes: direct and indirect, grouped into three groups: the intensity of research and public activity; the level of applied (technological) solutions; practical implementation, most affecting the development of general artificial intelligence. The correlation between the formalized groups of indicators was revealed, which confirms the correctness of the hypothesis about the cause-effect relationship between the groups: theoretical research → applied solutions → practical implementation and their mutual influence.
{"title":"QUANTITATIVE ASSESSMENT OF TECHNOLOGICAL SINGULARITY","authors":"O. Zaritskyi, O. Ponomarenko","doi":"10.34229/1028-0979-2022-1-9","DOIUrl":"https://doi.org/10.34229/1028-0979-2022-1-9","url":null,"abstract":"The article deals with the topical issue of quantitative assessment of technological singularity. The authors made an analysis of artificial intelligence tools and approaches affecting the development of superintelligence, which allowed for the first time to develop a general multifactor model of technological singularity and present it in the space of direct and indirect indicators of development. The developed approach makes it possible to move from expert judgments on the issue of technological singularity in the form of extrapolated complexity curves of various systems or qualitative description of possible scenarios of technological development to quantitative assessment of the state of technological singularity. The links between the relevant functional areas of human intelligence and modern expert systems are formalized, a structural-functional model of knowledge acquisition is developed. A conclusion is made about the real limits of the processes of modern \"intelligent\" systems at the level of artificial thinking and logical cognition, which corresponds to a weak artificial intelligence. The state and ways of hardware development were analyzed, which allowed making a conclusion about the complex use of different hardware architectures and information processing principles: supercomputer, neurosynaptic and quantum computers to implement the concept of technological singularity. Formalized in the form of a structural model the areas of research most influential in the development of artificial intelligence, and their relationship to existing approaches and methods of processing big data. For the first time proposed the classification of indicators of development of artificial intelligence within two classes: direct and indirect, grouped into three groups: the intensity of research and public activity; the level of applied (technological) solutions; practical implementation, most affecting the development of general artificial intelligence. The correlation between the formalized groups of indicators was revealed, which confirms the correctness of the hypothesis about the cause-effect relationship between the groups: theoretical research → applied solutions → practical implementation and their mutual influence.","PeriodicalId":54874,"journal":{"name":"Journal of Automation and Information Sciences","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45562456","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 : 2022-01-01DOI: 10.34229/1028-0979-2022-1-7
D. Ratov
Researches of the subject area of lossless information compression and with data loss are carried out and data compression algorithms with minimal redundancy are considered: Shannon-Fano coding, Huffman coding and compression using a dictionary: Lempel-Ziv coding. In the course of the work, the theoretical foundations of data compression were used, studies of various methods of data compression were carried out, the best methods of archiving with encryption and storage of various kinds of data were identified. The method of archiving data in the work is used for the purpose of safe and rational placement of information on external media and its protection from deliberate or accidental destruction or loss. In the Embarcadero RAD Studio XE8 integrated development environment, a software package for an archiver with code protection of information has been developed. The archiverʼs mechanism of operation is based on the creation and processing of streaming data. The core of the archiver is the function of compressing and decompressing files using the Lempel-Ziv method. As a method and means of protecting information in the archive, poly-alphabetic substitution (Viziner cipher) was used. The results of the work, in particular, the developed software can be practically used for archival storage of protected information; the mechanism of data archiving and encryption can be used in information transmission systems in order to reduce network traffic and ensure data security. The resulting encryption and archiving software was used in the module of the software package «Diplomas SNU v.2.6.1», which was developed at the Volodymyr Dal East Ukrainian National University. This complex is designed to create a unified register of diplomas at the university, automate the creation of files-diplomas of higher education in the multifunctional graphics editor Adobe Photoshop. The controller exports all data for analysis and formation of diplomas from the parameters of the corresponding XML files downloaded from the unified state education database in compressed zip archives. The developed module performs the process of unzipping and receiving XML-files with parameters for the further work of the complex «Diplomas SNU v.2.6.1».
对无损信息压缩和数据丢失的主题领域进行了研究，并考虑了具有最小冗余的数据压缩算法：Shannon Fano编码、Huffman编码和使用字典的压缩：Lempel-Ziv编码。在工作过程中，利用了数据压缩的理论基础，对各种数据压缩方法进行了研究，确定了加密归档和存储各种数据的最佳方法。作品中的数据归档方法是为了将信息安全合理地放置在外部媒体上，并保护其免受故意或意外的破坏或丢失。在Embarcadero RAD Studio XE8集成开发环境中，开发了一个用于信息代码保护的归档程序的软件包。归档器的操作机制基于流数据的创建和处理。归档器的核心是使用Lempel-Ziv方法压缩和解压缩文件的功能。作为一种保护档案中信息的方法和手段，使用了多字母替换（Viziner密码）。工作成果，特别是开发的软件可以实际用于受保护信息的档案存储；数据存档和加密机制可以用于信息传输系统，以减少网络流量并确保数据安全。由此产生的加密和归档软件被用于Volodymyr Dal东乌克兰国立大学开发的软件包“Diplomas SNU v.2.6.1”的模块中。该综合体旨在创建一个统一的大学文凭登记册，在多功能图形编辑器Adobe Photoshop中自动创建高等教育文凭文件。控制器从压缩zip档案中的统一国家教育数据库下载的相应XML文件的参数中导出用于分析和形成文凭的所有数据。开发的模块执行解压缩和接收带有参数的XML文件的过程，用于复杂的«Diplomas SNU v.2.6.1»的进一步工作。
{"title":"DEVELOPMENT OF METHOD AND SOFTWARE FOR COMPRESSION AND ENCRYPTION OF INFORMATION","authors":"D. Ratov","doi":"10.34229/1028-0979-2022-1-7","DOIUrl":"https://doi.org/10.34229/1028-0979-2022-1-7","url":null,"abstract":"Researches of the subject area of lossless information compression and with data loss are carried out and data compression algorithms with minimal redundancy are considered: Shannon-Fano coding, Huffman coding and compression using a dictionary: Lempel-Ziv coding. In the course of the work, the theoretical foundations of data compression were used, studies of various methods of data compression were carried out, the best methods of archiving with encryption and storage of various kinds of data were identified. The method of archiving data in the work is used for the purpose of safe and rational placement of information on external media and its protection from deliberate or accidental destruction or loss. In the Embarcadero RAD Studio XE8 integrated development environment, a software package for an archiver with code protection of information has been developed. The archiverʼs mechanism of operation is based on the creation and processing of streaming data. The core of the archiver is the function of compressing and decompressing files using the Lempel-Ziv method. As a method and means of protecting information in the archive, poly-alphabetic substitution (Viziner cipher) was used. The results of the work, in particular, the developed software can be practically used for archival storage of protected information; the mechanism of data archiving and encryption can be used in information transmission systems in order to reduce network traffic and ensure data security. The resulting encryption and archiving software was used in the module of the software package «Diplomas SNU v.2.6.1», which was developed at the Volodymyr Dal East Ukrainian National University. This complex is designed to create a unified register of diplomas at the university, automate the creation of files-diplomas of higher education in the multifunctional graphics editor Adobe Photoshop. The controller exports all data for analysis and formation of diplomas from the parameters of the corresponding XML files downloaded from the unified state education database in compressed zip archives. The developed module performs the process of unzipping and receiving XML-files with parameters for the further work of the complex «Diplomas SNU v.2.6.1».","PeriodicalId":54874,"journal":{"name":"Journal of Automation and Information Sciences","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47852599","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号