Pub Date : 2023-03-30DOI: 10.32523/2616-7182/bulmathenu.2023/1.3
N. Temirgaliyev, Sh. K. Abikenova, Sh.U. Azhgaliyev, Y. Y. Nurmoldin, G.Y. Taugynbayeva, A. Zhubanysheva
Computed tomography is a vital need to know the structure of the inside of the body from the information obtained from its transillumination without destroying the shell. The format presented here forsolving this massively understandable problem, which can only be theoretical and mathematical with subsequent engineering implementation, is fundamentally expressed in the approximate formula established by the authors in 2019 in approximate formula on a plane with a two-dimensional Cartesian coordinate system. In this article,this breakthrough is brought to a complete surprise in the equivalence of the fundamental problems of Computed Tomography and both widely known and developed in new content continuations of the problems of recovery functions by operators of the form of finite convolution of values approximated at the grid nodes with specially constructed kernels: [supleft{{left|fleft(xright)-sum^N_{k=1}{{left(R^2right)}^{-1}Rfleft({xi }_kright)}Rleft(textrm{Ф}left(y-{xi }_kright)right)(x)right|}_{W^{{left|yright|}^{frac{s-1}{2}}}_2left(S^{s-1}times R^1right)}: fin W^{әlpha left(yright) cdot{left|yright|}^{frac{s-1}{2}}}_2left(S^{s-1}times R^1right)right}әsymp ] [әsymp supleft{{left|f(x)-sum^N_{k=1}{fleft({xi }_kright)}textrm{Ф}(x-{xi }_k)right|}_{L^2left(E_sright)}: fin W^{әlpha left(yright)}_2left(E_sright)right},] As is customary in Mathematics (in other sciences too), any claim for a breakthrough must be demonstratedin results of fundamental importance. In the resulting equivalence, the working part turned out to be in astate of enough for illustrative and, necessary, fundamental conclusions readiness according to the ComputerScience offered by the first author (according to the list) in 1996 and filled in Kazakhstan with far from trivialcontent of the Computational (numerical) diameter (C(N)D). Namely, a wide range of developments in thetheory of C(N)D instantly automatically leads to new theoretical and direct practical applications of advances in Computed Tomography, including analytic expressibility in explicit formulas of the computational aggregates of Tomography in terms of scanned quantities. Among them is also the conclusion that in Computed Tomographythere is no better scanning method than the Radon transform.
在不破坏外壳的情况下，通过透视获得的信息来了解身体内部的结构，计算机断层扫描是至关重要的。本文提出的解决这个非常容易理解的问题的格式，在随后的工程实施中只能是理论和数学的，基本上用作者在2019年建立的二维笛卡尔坐标系平面上的近似公式来表示。在本文中，这一突破在计算机断层扫描基本问题的等价性方面带来了完全的惊喜，并且在恢复函数问题的新内容延续中得到了广泛的发展和发展，这些问题是由具有特殊构造核的网格节点近似值的有限卷积形式的算子实现的:[supleft{{left|fleft(xright)-sum^N_{k=1}{{left(R^2right)}^{-1}Rfleft({xi }_kright)}Rleft(textrm{Ф}left(y-{xi }_kright)right)(x)right|}_{W^{{left|yright|}^{frac{s-1}{2}}}_2left(S^{s-1}times R^1right)}: fin W^{әlpha left(yright) cdot{left|yright|}^{frac{s-1}{2}}}_2left(S^{s-1}times R^1right)right}әsymp ][әsymp supleft{{left|f(x)-sum^N_{k=1}{fleft({xi }_kright)}textrm{Ф}(x-{xi }_k)right|}_{L^2left(E_sright)}: fin W^{әlpha left(yright)}_2left(E_sright)right},]按照数学(在其他科学中也是如此)的惯例，任何突破性的主张都必须用具有根本重要性的结果来证明。在得到的等效中，根据第一作者(根据列表)在1996年提供的《计算机科学》(ComputerScience)，工作部分被证明处于足以进行说明性和必要的基本结论准备的状态，并在哈萨克斯坦填充了远不平凡的计算(数值)直径(C(N)D)内容。也就是说，C(N)D理论的广泛发展立即自动导致计算机断层扫描技术进步的新的理论和直接实际应用，包括以扫描量表示的断层扫描计算总量的显式公式的解析可表达性。其中还得出结论，在计算机层析成像中没有比Radon变换更好的扫描方法。
{"title":"Efficient reduction of Computed Tomography problems to the developed problem of recovery functions in the form of a finite convolution in the norms of \"flexible\" Hilbert Sobolev and Sobolev-Radon spaces according to the scheme of the Computational (numerical) diameter","authors":"N. Temirgaliyev, Sh. K. Abikenova, Sh.U. Azhgaliyev, Y. Y. Nurmoldin, G.Y. Taugynbayeva, A. Zhubanysheva","doi":"10.32523/2616-7182/bulmathenu.2023/1.3","DOIUrl":"https://doi.org/10.32523/2616-7182/bulmathenu.2023/1.3","url":null,"abstract":"Computed tomography is a vital need to know the structure of the inside of the body from the information obtained from its transillumination without destroying the shell. The format presented here forsolving this massively understandable problem, which can only be theoretical and mathematical with subsequent engineering implementation, is fundamentally expressed in the approximate formula established by the authors in 2019 in approximate formula on a plane with a two-dimensional Cartesian coordinate system. In this article,this breakthrough is brought to a complete surprise in the equivalence of the fundamental problems of Computed Tomography and both widely known and developed in new content continuations of the problems of recovery functions by operators of the form of finite convolution of values approximated at the grid nodes with specially constructed kernels: [supleft{{left|fleft(xright)-sum^N_{k=1}{{left(R^2right)}^{-1}Rfleft({xi }_kright)}Rleft(textrm{Ф}left(y-{xi }_kright)right)(x)right|}_{W^{{left|yright|}^{frac{s-1}{2}}}_2left(S^{s-1}times R^1right)}: fin W^{әlpha left(yright) cdot{left|yright|}^{frac{s-1}{2}}}_2left(S^{s-1}times R^1right)right}әsymp ] [әsymp supleft{{left|f(x)-sum^N_{k=1}{fleft({xi }_kright)}textrm{Ф}(x-{xi }_k)right|}_{L^2left(E_sright)}: fin W^{әlpha left(yright)}_2left(E_sright)right},] As is customary in Mathematics (in other sciences too), any claim for a breakthrough must be demonstratedin results of fundamental importance. In the resulting equivalence, the working part turned out to be in astate of enough for illustrative and, necessary, fundamental conclusions readiness according to the ComputerScience offered by the first author (according to the list) in 1996 and filled in Kazakhstan with far from trivialcontent of the Computational (numerical) diameter (C(N)D). Namely, a wide range of developments in thetheory of C(N)D instantly automatically leads to new theoretical and direct practical applications of advances in Computed Tomography, including analytic expressibility in explicit formulas of the computational aggregates of Tomography in terms of scanned quantities. Among them is also the conclusion that in Computed Tomographythere is no better scanning method than the Radon transform.","PeriodicalId":286555,"journal":{"name":"BULLETIN of the L N Gumilyov Eurasian National University MATHEMATICS COMPUTER SCIENCE MECHANICS Series","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124928167","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 : 2023-03-30DOI: 10.32523/2616-7182/bulmathenu.2023/1.2
D. Satybaldina, N.K. Bisenbaeva, Y. Seitkulov, A.K. Seksenbaeva
In modern conditions of digital technologies implementation in various sectors of the economy, the digitalization of public administration, healthcare, education, and science, the growth in the number of Internet services and mobile devices the issues of ensuring the security of cellular communication systems are becoming increasingly relevant. It is becoming increasingly difficult to detect multiple and complex cyber security threats as the sources and methods ofcyber-attacks evolve and expand. Classic network attack detection approaches that rely heavily on static matching, such as signature analysis, blacklisting, or regular expression patterns, are limited in flexibility and are ineffective for early anomaly detection and rapid response to information security incidents. To solve this problem, the use of machine learning (ML) algorithms is proposed. ML methods can provide new approaches and higher rates of detection of malicious activity on the network. In this work, the Splunk Enterprise data analysis platform and the Splunk Machine Learning Toolkit for creating, training, testing, and validating a network attack classifier are used. The performance of the proposed model was evaluatedby applying four machine learning algorithms such as a decision tree, a support vector machine, a random forest, and adouble random forest. Experimental results show that all used ML algorithms can be effectively used to detect network attacks, and the double random forest method has the best accuracy in detecting distributed denial-of-service attacks.
{"title":"Detecting and classifying network attacks with Splunk Machine Learning Toolkit","authors":"D. Satybaldina, N.K. Bisenbaeva, Y. Seitkulov, A.K. Seksenbaeva","doi":"10.32523/2616-7182/bulmathenu.2023/1.2","DOIUrl":"https://doi.org/10.32523/2616-7182/bulmathenu.2023/1.2","url":null,"abstract":"In modern conditions of digital technologies implementation in various sectors of the economy, the digitalization of public administration, healthcare, education, and science, the growth in the number of Internet services and mobile devices the issues of ensuring the security of cellular communication systems are becoming increasingly relevant. It is becoming increasingly difficult to detect multiple and complex cyber security threats as the sources and methods ofcyber-attacks evolve and expand. Classic network attack detection approaches that rely heavily on static matching, such as signature analysis, blacklisting, or regular expression patterns, are limited in flexibility and are ineffective for early anomaly detection and rapid response to information security incidents. To solve this problem, the use of machine learning (ML) algorithms is proposed. ML methods can provide new approaches and higher rates of detection of malicious activity on the network. In this work, the Splunk Enterprise data analysis platform and the Splunk Machine Learning Toolkit for creating, training, testing, and validating a network attack classifier are used. The performance of the proposed model was evaluatedby applying four machine learning algorithms such as a decision tree, a support vector machine, a random forest, and adouble random forest. Experimental results show that all used ML algorithms can be effectively used to detect network attacks, and the double random forest method has the best accuracy in detecting distributed denial-of-service attacks.","PeriodicalId":286555,"journal":{"name":"BULLETIN of the L N Gumilyov Eurasian National University MATHEMATICS COMPUTER SCIENCE MECHANICS Series","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127129948","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 : 2023-03-30DOI: 10.32523/2616-7182/bulmathenu.2023/1.1
I. Simonova, B. Simonov
The problem of estimating the moduli of smoothness of functions from Lqin terms of moduli of smoothness from the broader Lebesgue class Lph as been known for a long time. At the initial stage, in the works of Titchmarsh, Hardy, Littlewood, Nikolsky, the properties of functions from Lipschitz classes were studied and the corresponding embeddings were obtained. For moduli of continuity of functions of one variable P.L. Ulyanov proved an inequality later named after him - "Ulyanov’s inequality". The classical Hardy-Littlewood embedding for Lipschitz spaces is a consequence of Ulyanov’s inequality. As V.A. Andrienko showed, Ulyanov’s inequality is exact in the scale of classes Hωp. Further development of this direction is connected with the works of V.A. Andrienko, E.A. Storozhenko, M.K.Potapov, L. Leindler, V.I. Kolyada, P. Oswald, N. Temirgaliev, S.V. Lapin and other mathematicians. Kolyada proved that Ulyanov’s inequality can be strengthened and proved the corresponding "Kolyada’s inequality". Kolyada’s inequality is exact in the sense that there exists a function in Lp with any given order of the modulus of continuity for which this estimate cannot be improved for any value of δ .Yu.V. Netrusov, M.L. Goldman and W. Trebelz extended Kolyada’s inequality to the moduli of smoothness of higher orders. Another direction of research was the study of fractional moduli of smoothness in the works of M.K. Potapov, B.V. Simonov, S.Yu. Tikhonov. This made it possible to strengthen the Ulyanov inequality and showed the specificity and special significance of using fractional moduli of smoothness, without which, as it turned out, it was impossible to obtain final results. In this article, we study partial moduli of smoothness of functions of two variables. Inequalities are obtained that extend Kolyada’s inequality to partial moduli of smoothness for functions with monotone Fourier coefficients. Estimates are also obtained for the partial moduli of smoothness of the derivative ofa function with monotone Fourier coefficients in terms of the partial moduli of smoothness of the original function.
从广义勒贝格类Lph的光滑模的Lqin项估计函数的光滑模的问题早已为人所知。在初始阶段，Titchmarsh, Hardy, Littlewood, Nikolsky的著作中，研究了Lipschitz类中函数的性质，并得到了相应的嵌入。对于一元函数的连续模，乌里扬诺夫证明了一个不等式，后来以他的名字命名——乌里扬诺夫不等式。Lipschitz空间的经典Hardy-Littlewood嵌入是Ulyanov不等式的结果。正如V.A.安德里延科所证明的，乌里扬诺夫不等式在等级Hωp的尺度上是准确的。这一方向的进一步发展与V.A. Andrienko, E.A. Storozhenko, M.K.Potapov, L. Leindler, V.I. Kolyada, P. Oswald, N. Temirgaliev, S.V. Lapin和其他数学家的工作有关。Kolyada证明了Ulyanov不等式可以强化，并证明了相应的“Kolyada不等式”。Kolyada不等式是精确的，因为在Lp中存在一个连续模的任意阶的函数，对于任意的δ yu值，这个估计都不能改进。Netrusov, M.L. Goldman和W. Trebelz将Kolyada不等式推广到高阶平滑的模。另一个研究方向是M.K. Potapov, B.V. Simonov, s.u u的作品中关于光滑的分数模的研究。Tikhonov。这使得强化乌里扬诺夫不等式成为可能，也显示了使用光滑度分数模的专一性和特殊意义，没有分数模就不可能得到最终结果。本文研究了二元函数光滑性的偏模问题。得到了将Kolyada不等式推广到具有单调傅立叶系数函数的光滑偏模的不等式。对单调傅立叶系数函数的导数的平滑偏模也用原函数的平滑偏模进行了估计。
{"title":"Reletions between partial moduli of smoothness of functions with monotone Fourier coefficients","authors":"I. Simonova, B. Simonov","doi":"10.32523/2616-7182/bulmathenu.2023/1.1","DOIUrl":"https://doi.org/10.32523/2616-7182/bulmathenu.2023/1.1","url":null,"abstract":"The problem of estimating the moduli of smoothness of functions from Lqin terms of moduli of smoothness from the broader Lebesgue class Lph as been known for a long time. At the initial stage, in the works of Titchmarsh, Hardy, Littlewood, Nikolsky, the properties of functions from Lipschitz classes were studied and the corresponding embeddings were obtained. For moduli of continuity of functions of one variable P.L. Ulyanov proved an inequality later named after him - \"Ulyanov’s inequality\". The classical Hardy-Littlewood embedding for Lipschitz spaces is a consequence of Ulyanov’s inequality. As V.A. Andrienko showed, Ulyanov’s inequality is exact in the scale of classes Hωp. Further development of this direction is connected with the works of V.A. Andrienko, E.A. Storozhenko, M.K.Potapov, L. Leindler, V.I. Kolyada, P. Oswald, N. Temirgaliev, S.V. Lapin and other mathematicians. Kolyada proved that Ulyanov’s inequality can be strengthened and proved the corresponding \"Kolyada’s inequality\". Kolyada’s inequality is exact in the sense that there exists a function in Lp with any given order of the modulus of continuity for which this estimate cannot be improved for any value of δ .Yu.V. Netrusov, M.L. Goldman and W. Trebelz extended Kolyada’s inequality to the moduli of smoothness of higher orders. Another direction of research was the study of fractional moduli of smoothness in the works of M.K. Potapov, B.V. Simonov, S.Yu. Tikhonov. This made it possible to strengthen the Ulyanov inequality and showed the specificity and special significance of using fractional moduli of smoothness, without which, as it turned out, it was impossible to obtain final results. In this article, we study partial moduli of smoothness of functions of two variables. Inequalities are obtained that extend Kolyada’s inequality to partial moduli of smoothness for functions with monotone Fourier coefficients. Estimates are also obtained for the partial moduli of smoothness of the derivative ofa function with monotone Fourier coefficients in terms of the partial moduli of smoothness of the original function.","PeriodicalId":286555,"journal":{"name":"BULLETIN of the L N Gumilyov Eurasian National University MATHEMATICS COMPUTER SCIENCE MECHANICS Series","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126521066","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-10-09DOI: 10.32523/2616-7182/bulmathenu.2022/2.2
A. Nadjimzadah
A. Iosevich and K. Taylor showed that compact subsets of Rd with Hausdorff dimension greater than (d+1)/2 contain trees with gaps in an open interval. Under the same dimensional threshold, we prove the analogous result where distance is replaced by the dot product. We additionally show that the gaps of embedded trees of dot products are prevalentin a set of positive Lebesgue measure, and for Ahlfors-David regular sets, the number of treeswith given gaps agrees with the regular value theorem.
A. Iosevich和K. Taylor证明了Hausdorff维数大于(d+1)/2的Rd的紧子集包含开区间中有间隙的树。在相同的维数阈值下，我们证明了用点积代替距离的类似结果。此外，我们还证明了点积嵌入树的间隙在正Lebesgue测度集合中是普遍存在的，并且对于Ahlfors-David正则集，具有给定间隙的树的数量符合正则值定理。
{"title":"Trees of Dot Products in Thin Subsets of Rd","authors":"A. Nadjimzadah","doi":"10.32523/2616-7182/bulmathenu.2022/2.2","DOIUrl":"https://doi.org/10.32523/2616-7182/bulmathenu.2022/2.2","url":null,"abstract":"A. Iosevich and K. Taylor showed that compact subsets of Rd with Hausdorff dimension greater than (d+1)/2 contain trees with gaps in an open interval. Under the same dimensional threshold, we prove the analogous result where distance is replaced by the dot product. We additionally show that the gaps of embedded trees of dot products are prevalentin a set of positive Lebesgue measure, and for Ahlfors-David regular sets, the number of treeswith given gaps agrees with the regular value theorem.","PeriodicalId":286555,"journal":{"name":"BULLETIN of the L N Gumilyov Eurasian National University MATHEMATICS COMPUTER SCIENCE MECHANICS Series","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134238052","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 : 1900-01-01DOI: 10.32523/2616-7182/bulmathenu.2022/3.2
A. Zhubanysheva, G.E. Taugynbayeva, N. Nauryzbayev, N. Temirgaliyev
In the article is studied, according to our opinion, the problematic moment "An experiment was performed,the outcome is known. Did the event occur?" and the associated calculations of the frequencies of the occurrence of thisevent in the context of determining the probability. Namely, theoretical and practical detailed discussions of these topicsare justificated.
{"title":"About one Problematic Moment in Textbooks on Probability Theory","authors":"A. Zhubanysheva, G.E. Taugynbayeva, N. Nauryzbayev, N. Temirgaliyev","doi":"10.32523/2616-7182/bulmathenu.2022/3.2","DOIUrl":"https://doi.org/10.32523/2616-7182/bulmathenu.2022/3.2","url":null,"abstract":"In the article is studied, according to our opinion, the problematic moment \"An experiment was performed,the outcome is known. Did the event occur?\" and the associated calculations of the frequencies of the occurrence of thisevent in the context of determining the probability. Namely, theoretical and practical detailed discussions of these topicsare justificated.","PeriodicalId":286555,"journal":{"name":"BULLETIN of the L N Gumilyov Eurasian National University MATHEMATICS COMPUTER SCIENCE MECHANICS Series","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122909248","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 : 1900-01-01DOI: 10.32523/2616-7182/bulmathenu.2022/3.1
S. Lutsak, O. Voronina
A finite algebra A with discrete topology generates a topological quasivarietyconsisting of all topologically closed subalgebras of non-zero direct powers of A endowed withthe product topology. This topological quasivariety is standard if every Boolean topologicalalgebra with the algebraic reduct in Q(A) is profinite. In the article it is constructed the specificfinite modular lattice T that does not satisfy one of Tumanov’s conditions but quasivarietyQ(T) generated by this lattice is not finitely based. We investigate the topological quasivarietygenerated by the lattice T and prove that it is not standard. And we also would like to notethat there is an infinite number of lattices similar to the lattice T.
{"title":"On some properties of quasivarieties generated by specific finite modular lattices","authors":"S. Lutsak, O. Voronina","doi":"10.32523/2616-7182/bulmathenu.2022/3.1","DOIUrl":"https://doi.org/10.32523/2616-7182/bulmathenu.2022/3.1","url":null,"abstract":"A finite algebra A with discrete topology generates a topological quasivarietyconsisting of all topologically closed subalgebras of non-zero direct powers of A endowed withthe product topology. This topological quasivariety is standard if every Boolean topologicalalgebra with the algebraic reduct in Q(A) is profinite. In the article it is constructed the specificfinite modular lattice T that does not satisfy one of Tumanov’s conditions but quasivarietyQ(T) generated by this lattice is not finitely based. We investigate the topological quasivarietygenerated by the lattice T and prove that it is not standard. And we also would like to notethat there is an infinite number of lattices similar to the lattice T.","PeriodicalId":286555,"journal":{"name":"BULLETIN of the L N Gumilyov Eurasian National University MATHEMATICS COMPUTER SCIENCE MECHANICS Series","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115982784","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 : 1900-01-01DOI: 10.32523/2616-7182/bulmathenu.2022/3.3
A. Mussina, S. Aubakirov, P. Trigo
Nowadays social networks and media play significant role in daily life. All our life in the real world is recorded in the digital space as well. Scientists have enormous potential in researching issues such as social influence ontop news and top news influence on society. Its impact on daily life spans such diverse areas as digital marketing, publicopinion analysis, political monitoring and disaster notification. Any task of processing such a large data stream needs acoherent architecture that will fit the analyzed resource. In the presented work, we set ourselves the task of creating ahighly loaded, fault-tolerant, scalable system for extracting and processing data from various social networks and analyzing data in real time. The solution is architecture in the form of a set of modules. Modules have their own characteristics depending on the work performed, from collecting textual data to direct processing and extraction of knowledge.
{"title":"Architecture for enduring knowledge-extraction from online social networks","authors":"A. Mussina, S. Aubakirov, P. Trigo","doi":"10.32523/2616-7182/bulmathenu.2022/3.3","DOIUrl":"https://doi.org/10.32523/2616-7182/bulmathenu.2022/3.3","url":null,"abstract":"Nowadays social networks and media play significant role in daily life. All our life in the real world is recorded in the digital space as well. Scientists have enormous potential in researching issues such as social influence ontop news and top news influence on society. Its impact on daily life spans such diverse areas as digital marketing, publicopinion analysis, political monitoring and disaster notification. Any task of processing such a large data stream needs acoherent architecture that will fit the analyzed resource. In the presented work, we set ourselves the task of creating ahighly loaded, fault-tolerant, scalable system for extracting and processing data from various social networks and analyzing data in real time. The solution is architecture in the form of a set of modules. Modules have their own characteristics depending on the work performed, from collecting textual data to direct processing and extraction of knowledge.","PeriodicalId":286555,"journal":{"name":"BULLETIN of the L N Gumilyov Eurasian National University MATHEMATICS COMPUTER SCIENCE MECHANICS Series","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122324551","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 : 1900-01-01DOI: 10.32523/2616-7182/bulmathenu.2022/4.1
A.G. Yessengaliyev, A. Mukanov
In this paper is proposed to use a model of high-precision propagation of the satellite position, in which the disturbing accelerations are determined, and the obtained numerical results are presented. All disturbing forces acting on the satellite are modeled, the up-to-date data of the parameters of the atmospheric drag model, as well as the parameters IERS, EOP are used. The developed software for satellite orbit propagation is applicable to support the flight control of the satellite, while ensuring the accuracy of the level of 10-15 meters along the position vector of the satellite over a weekly time interval. With a given model of satellite motion and known statistical characteristics of orbit determination errors, the covariance matrix is predicted along with the state vector, which has found application in many applied tasks for support of Flight dynamics activities.
{"title":"High-precision satellite orbit propagation with estimation of the covariance matrix","authors":"A.G. Yessengaliyev, A. Mukanov","doi":"10.32523/2616-7182/bulmathenu.2022/4.1","DOIUrl":"https://doi.org/10.32523/2616-7182/bulmathenu.2022/4.1","url":null,"abstract":"In this paper is proposed to use a model of high-precision propagation of the satellite position, in which the disturbing accelerations are determined, and the obtained numerical results are presented. All disturbing forces acting on the satellite are modeled, the up-to-date data of the parameters of the atmospheric drag model, as well as the parameters IERS, EOP are used. The developed software for satellite orbit propagation is applicable to support the flight control of the satellite, while ensuring the accuracy of the level of 10-15 meters along the position vector of the satellite over a weekly time interval. With a given model of satellite motion and known statistical characteristics of orbit determination errors, the covariance matrix is predicted along with the state vector, which has found application in many applied tasks for support of Flight dynamics activities.","PeriodicalId":286555,"journal":{"name":"BULLETIN of the L N Gumilyov Eurasian National University MATHEMATICS COMPUTER SCIENCE MECHANICS Series","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128749018","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}
The article is devoted to the study of the hydrodynamics of heat carriers in heat exchangers. Giventhe widespread use of this device, increasing its thermal and hydraulic characteristics has become so important for theirdesigners. In the work, the calculation of non-stationary flows of liquids through the heat exchanger tubes is carried out.Water ("hot" coolant) and oil ("cold" coolant) are used as heat carriers, between which heat exchange occurs through thesolid surface of the pipeline, which is the boundary between the heat carriers. When calculating the movement of oil, thefact was taken into account that the dynamic viscosity depends very much on temperature and, depending on temperature,the Reynolds numbers also change. And, as a consequence, when flowing through a sufficiently thin channel, the flow regimechanges, namely, the transition from the laminar flow regime to the turbulent one is manifested, while this effect is notobserved with the analytical calculation method for constant viscosity. The Reynolds-averaged Navier-Stokes equations,closed using the turbulence model, were used for numerical modeling of fluid dynamics of heat carriers. Verification of theheat exchanger calculations was carried out in the software package "Ansys Fluent".
{"title":"Numerical calculation of the hydrodynamics of heat carriers, taking into account the dependence ofviscosity on temperature","authors":"D.Y. Кurmanova, N.Dzh. Jaichibekov, К.N. Volkov, А.G. Каrpenko","doi":"10.32523/2616-7182/bulmathenu.2022/4.2","DOIUrl":"https://doi.org/10.32523/2616-7182/bulmathenu.2022/4.2","url":null,"abstract":"The article is devoted to the study of the hydrodynamics of heat carriers in heat exchangers. Giventhe widespread use of this device, increasing its thermal and hydraulic characteristics has become so important for theirdesigners. In the work, the calculation of non-stationary flows of liquids through the heat exchanger tubes is carried out.Water (\"hot\" coolant) and oil (\"cold\" coolant) are used as heat carriers, between which heat exchange occurs through thesolid surface of the pipeline, which is the boundary between the heat carriers. When calculating the movement of oil, thefact was taken into account that the dynamic viscosity depends very much on temperature and, depending on temperature,the Reynolds numbers also change. And, as a consequence, when flowing through a sufficiently thin channel, the flow regimechanges, namely, the transition from the laminar flow regime to the turbulent one is manifested, while this effect is notobserved with the analytical calculation method for constant viscosity. The Reynolds-averaged Navier-Stokes equations,closed using the turbulence model, were used for numerical modeling of fluid dynamics of heat carriers. Verification of theheat exchanger calculations was carried out in the software package \"Ansys Fluent\".","PeriodicalId":286555,"journal":{"name":"BULLETIN of the L N Gumilyov Eurasian National University MATHEMATICS COMPUTER SCIENCE MECHANICS Series","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124125772","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 : 1900-01-01DOI: 10.32523/2616-7182/bulmathenu.2022/1.4
G.E. Taugynbayeva, A. Zhubanysheva, Zh.K. Tabyldiyeva, N. Temirgaliyev
What is the methodology of reaching the level of "mathematical perfection" in primary school,including the number, arithmetic operations used for them, the multiplication table, the displacement law ofaddition and multiplication operations, what principles should be taken as a basis during the education of thechild and their place in the field of modern science is widely stated.
{"title":"Methods of teaching numbers and the operations of addition and multiplication applied to them in elementary school and the general problems related to them","authors":"G.E. Taugynbayeva, A. Zhubanysheva, Zh.K. Tabyldiyeva, N. Temirgaliyev","doi":"10.32523/2616-7182/bulmathenu.2022/1.4","DOIUrl":"https://doi.org/10.32523/2616-7182/bulmathenu.2022/1.4","url":null,"abstract":"What is the methodology of reaching the level of \"mathematical perfection\" in primary school,including the number, arithmetic operations used for them, the multiplication table, the displacement law ofaddition and multiplication operations, what principles should be taken as a basis during the education of thechild and their place in the field of modern science is widely stated.","PeriodicalId":286555,"journal":{"name":"BULLETIN of the L N Gumilyov Eurasian National University MATHEMATICS COMPUTER SCIENCE MECHANICS Series","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133130103","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：