Computer Tools in Education最新文献

{"title":"Simulation of the Process of Growing Semiconductor Single Crystals by the Czochralski Method","authors":"Kirill Suchoruchenkov, Evgenia Maraeva, Olga Alexandrova","doi":"10.32603/2071-2340-2021-4-99-108","DOIUrl":"https://doi.org/10.32603/2071-2340-2021-4-99-108","url":null,"abstract":"The work is devoted to the creation of a virtual instrument in the LabVIEW environment, which makes it possible to simulate the process of growing a crystal depending on technological parameters. As the technological process under consideration, we chose the method of growing single crystals by pulling them up from the spare surface of a large volume of the melt with initiation of the onset of crystallization by introducing a seed crystal (or several crystals) of a given structure and crystallographic orientation, which is in contact with the spare surface of the melt (Czochralski method). The virtual instrument is intended for use by students and teachers in full-time mode and in distance learning.","PeriodicalId":319537,"journal":{"name":"Computer Tools in Education","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115206580","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}

{"title":"Computers as Novel Mathematical Reality. IV. Goldbach Problem","authors":"N. Vavilov","doi":"10.32603/2071-2340-2021-4-5-71","DOIUrl":"https://doi.org/10.32603/2071-2340-2021-4-5-71","url":null,"abstract":"In this part I pursue the discussion of the role of computers in additive number theroy. Here I sketch the definitive solution of the ternary = odd Goldbach problem, not in one of its XX century asymptotric reformulations, but in its original XVII century form. Namely, that every odd number n > 5 is a sum n = p1 + p2 + p3 of three positive rational primes. A solution of this problem was only completed by Harald Helfgott in 2013–2014 and there is no chance that it could be obtained without the use of computers. Apart from that, I discuss the status of the binary = even Goldbach problem, partial results towards its solution, as well as some further related proiblems.","PeriodicalId":319537,"journal":{"name":"Computer Tools in Education","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133468946","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}

{"title":"On Lessons Learned From Distance Teaching and Learning","authors":"Sofya Entina","doi":"10.32603/2071-2340-2021-2-66-83","DOIUrl":"https://doi.org/10.32603/2071-2340-2021-2-66-83","url":null,"abstract":"The coronavirus (COVID-19) epidemic in Russia forced colleges and universities to switch to distance teaching and learning. The instructors had to make an emergency move to the remote methods of teaching using various platforms. In the course of the distance learning period in midst of an on-going pandemic, the instructors acquired valuable experience in on-line lecturing, administering tests, conducting tutorials, examination sessions, office hours, etc. Distance teaching called for new educational technologies that would provide the quality of education comparable to the in-person teaching. Compared to the traditional teaching, the time needed to prepare for classes has increased. However, it turned out that thanks to the technologies developed to facilitate high-quality distance interaction, many of the methodologies developed for distance learning can be quite useful in traditional (in-person) learning as well. Using a course in Linear Algebra and Algebraic Structures taught to the freshmen at Saint Petersburg Electro-technical University as an example, this article demonstrates that it is possible to use some of the communication technologies–based methodologies to enhance in-person learning.","PeriodicalId":319537,"journal":{"name":"Computer Tools in Education","volume":"203 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131611484","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}

{"title":"Comparison of Different Knowledge Representations for Complex Structured Objects in Solving AI Problems","authors":"T. Kosovskaya","doi":"10.32603/2071-2340-2021-2-41-57","DOIUrl":"https://doi.org/10.32603/2071-2340-2021-2-41-57","url":null,"abstract":"The problem of knowledge representation for a complex structured object is one of the actual problems of AI. This is due to the fact that many of the objects under study are not a single indivisible object characterized by its properties, but complex structures whose elements have some known properties and are in some, often multiplace, relations with each other. An approach to the representation of such knowledge based on first-order logic (predicate calculus formulas) is compared in this paper with two currently widespread approaches based on the representation of data information with the use of finite-valued strings or graphs. It is shown that the use of predicate calculus formulas for description of a complex structured object, despite the NP-difficulty of the solved problems arising after formalization, actually have no greater computational complexity than the other two approaches, what is usually not mentioned by their supporters. An algorithm for constructing an ontology is proposed that does not depend on the methodof desc ribing an object, and is based on the selection of the maximum common property of objects from a given set.","PeriodicalId":319537,"journal":{"name":"Computer Tools in Education","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124310767","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}

{"title":"Analysis of Wheat Samples Using the Calculation of Multifractal Spectrum","authors":"I. Murenin, N. Ampilova","doi":"10.32603/2071-2340-2021-1-5-20","DOIUrl":"https://doi.org/10.32603/2071-2340-2021-1-5-20","url":null,"abstract":"The computational analysis of wheat images to identify wheat varieties and quality has wide applications in agriculture and production. This paper presents an approach to the analysis and classification of images of wheat samples obtained by the method of crystallization with additives. In tests 3 concentration and 4 times for each concentration were used, such that each type of wheat was characterized by 12 images. We used the images obtained for 5 classes. All the images have similar visual characteristics, that makes it difficult to use statistical methods of analysis. The multifractal spectrum obtained by calculating the local density function was used as a classifying feature. The classification was performed on a set of 60 wheat images corresponding to 5 different samples (classes) by various machine learning methods such as linear regression, naive Bayesian classifier, support vector machine, and random forest. In some cases, to reduce the dimension of the feature space the method of principal components was applied. To identify the relationships between wheat samples obtained at different concentrations, 3 different clustering methods were used. The classification results showed that the multifractal spectrum as classifying sign and using the random forest method in combination with the principal component analysis allow identifying wheat samples obtained by crystallization with additives, being the highest average classi- fication accuracy is 74 %.","PeriodicalId":319537,"journal":{"name":"Computer Tools in Education","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127485009","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}

{"title":"Ontology of Discrete Mathematics in Education","authors":"I. Molotkov, Fyodor Novikov","doi":"10.32603/2071-2340-2021-1-69-85","DOIUrl":"https://doi.org/10.32603/2071-2340-2021-1-69-85","url":null,"abstract":"Currently, ontologies are widely used in computer science for the formalized representati- on of knowledge about various subject areas. Special formal languages for describing ontologies have been developed and are successfully used, which allow describing ontologi- es in a form that is accessible for use by both humans and computers.Among the various options for using ontologies, a special place is occupied by the use of ontologies in educati- on, since the systematization and ordering of knowledge, being the main competitive advantage of the ontological approach, is at the same time one of the main goals of the educational process. The article proposes original methods of constructing ontologies for use in the educational process of higher education. The central idea is the construction of faceted, in other words, multifaceted ontologies, in which different aspects of the same subject area are described by conceptually similar, but syntactically different means. This approach provides a more accurate and semantically adequate description while maintaining the known brevity and clarity of designations. As a language for describing ontologies, it is proposed to use the unified modeling language UML 2, which has proven itself in formalization in many cases. The presentation is based on the example of constructing an ontology of discrete mathematics, and the ontology diagrams given in the article are introduced into the educational processes of the Academic and Polytechnic Universities of St. Petersburg.","PeriodicalId":319537,"journal":{"name":"Computer Tools in Education","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116048332","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}

{"title":"On the Classical Version of the Branch and Bound Method","authors":"B. Melnikov, E. Melnikova","doi":"10.32603/2071-2340-2021-1-21-45","DOIUrl":"https://doi.org/10.32603/2071-2340-2021-1-21-45","url":null,"abstract":"In the computer literature, a lot of problems are described that can be called discrete optimization problems: from encrypting information on the Internet (including creating programs for digital cryptocurrencies) before searching for “interests” groups in social networks. Often, these problems are very difficult to solve on a computer, hence they are called “intractable”. More precisely, the possible approaches to quickly solving these problems are difficult to solve (to describe algorithms, to program); the brute force solution, as a rule, is programmed simply, but the corresponding program works much slower. Almost every one of these intractable problems can be called a mathematical model. At the same time, both the model itself and the algorithms designed to solve it are often created for one subject area, but they can also be used in many other areas. An example of such a model is the traveling salesman problem. The peculiarity of the problem is that, given the relative simplicity of its formulation, finding the optimal solution (the optimal route). This problem is very difficult and belongs to the so-called class of NP-complete problems. Moreover, according to the existing classification, the traveling salesman problem is an example of an optimization problem that is an example of the most complex subclass of this class. However, the main subject of the paper is not the problem, but the method of its soluti- on, i.e. the branch and bound method. It consists of several related heuristics, and in the monographs, such a multi-heuristic branch and bound method was apparently not previously noted: the developers of algorithms and programs should have understood this themselves. At the same time, the method itself can be applied (with minor changes) to many other discrete optimization problems. So, the classical version of branch and bound method is the main subject of this paper, but also important is the second subject, i.e. the traveling salesman problem, also in the classical formulation. The paper deals with the application of the branch and bound method in solving the traveling salesman problem, and about this application, we can also use the word “classical”. However, in addition to the classic version of this implementation, we consider some new heuristics, related to the need to develop real-time algorithms.","PeriodicalId":319537,"journal":{"name":"Computer Tools in Education","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134353614","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}

{"title":"DBSCAN clustering method is applied to identify severe Traffic Accident (TA) hotpots on roads","authors":"A. Gershtein, A. Terekhov","doi":"10.32603/2071-2340-2021-1-46-58","DOIUrl":"https://doi.org/10.32603/2071-2340-2021-1-46-58","url":null,"abstract":"DBSCAN clustering method is applied to identify severe Traffic Accident (TA) hotpots on roads. The research examines severe TA, defined as those that led to human damage (injury or death), in the city of Newton, MA and in the entire state of Massachusetts, USA from 2013 to 2018. DBSCAN algorithm was also applied to network-constrained uniformly distributed over road network data to locate threshold in number of points per cluster so that all more populated clusters identified in real data can be treated as statistically significant. For DBSCAN algorithm two types of distance metrics, Euclidean and over Network, were compared. It is found that both distances are equivalent on scale of 10 meters, which justifies hybrid approach to clustering: using Network distance only to generate uniformly distributed points needed for Monte-Carlo simulations. All clustering can be performed using Euclidean distances which is much faster and more memory efficient. Subsequent years analysis demonstrates the extend that hotspots identified are stable and occur consecutively for several years and hence may possess predictive value.","PeriodicalId":319537,"journal":{"name":"Computer Tools in Education","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128544404","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}

{"title":"On the Question of Statistical Research in the School Course of Mathematics","authors":"S. B. Entina, Mark E. Yudodin","doi":"10.32603/2071-2340-2020-3-100-128","DOIUrl":"https://doi.org/10.32603/2071-2340-2020-3-100-128","url":null,"abstract":"Some elements of probability theory and statistics have been only recently included in high school curriculum. However, there so far have been no well-established textbooks and no clear consensus on the depth and breadth of the topics to be taught. As a result, the course gives students an incomplete picture of the subject. The article discusses some possible additions to the existing curriculum. The article also provides examples of assignments where mathematical statistics methods are used to study distribution laws and to solve geometry and extremum problems.","PeriodicalId":319537,"journal":{"name":"Computer Tools in Education","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123541697","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}

{"title":"Probability Chains with Polynomial Growth as a Model of Resource Distribution","authors":"N. Loginova","doi":"10.32603/2071-2340-2020-3-56-69","DOIUrl":"https://doi.org/10.32603/2071-2340-2020-3-56-69","url":null,"abstract":"The article is devoted to the method of discrete probability chains for constructing the forecast of changes in socio-economic data. Initial data about the distribution of the resource among several participants are presented in the form of the probabilistic vector, and its changing over time is described by a discrete dynamical system which is specified by a certain function. Chains with linear and logarithmic-linear growth have been well studied. In this paper, we consider the probabilistic chains in which the right-hand side is given by polynomials of a certain type. The results of the construction are applied to the research of the dynamics of the distribution of the national income of Canada, Great Britain, and the United States. The accuracy of the results obtained is estimated by using the correlation coefficient, and the dynamics of the process modeled is estimated by using Shannon’s entropy.","PeriodicalId":319537,"journal":{"name":"Computer Tools in Education","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125663427","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}