{"title":"在复杂函数过程算法化方面引入离散连续拓扑的论证","authors":"Natalia L. Malinina","doi":"10.22363/2312-8143-2021-22-3-270-282","DOIUrl":null,"url":null,"abstract":"The main aim of the research is to show and prove the necessity of introducing a new, discrete-continuous topological structure to describe complicated systems and processes of their functioning. Currently, there are two topological structures: continuous and discrete. At the same time, there are functional approaches in order to describe complicated systems and processes of their functioning, based on continuous topology. Until now, it has not been possible to build full functionality for the design of complicated technical objects. Therefore, the functional approach does not fully correspond to the increasingly complicated tasks of our time. The introduction of discrete-continuous topology is especially important for the exploring and modeling of complicated systems and processes of their functioning. In order to prove this fact, the present study describes the properties of complicated processes using examples of the flight process and the design process. The examination of these processes, as the most complicated, proves that the complicated systems and processes are topological spaces with metric, so they can be represented in the form of an oriented progressively bounded graph. Also, it proves the topological invariants of complicated systems and the processes of functioning. Presentation of the complicated processes in the form of a directed graph allows getting shorter path to their algorithmicization and programming, which is necessary for existing practice. In addition, the presentation of a complicated process as a directed graph will allow using the apparatus of graph theory for such purpose and will significantly expand the capabilities of programmers.","PeriodicalId":53011,"journal":{"name":"RUDN Journal of Engineering Researches","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Argumentation of introducing a discrete-continuous topology in the interests of algorithmization of complex functioning processes\",\"authors\":\"Natalia L. Malinina\",\"doi\":\"10.22363/2312-8143-2021-22-3-270-282\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The main aim of the research is to show and prove the necessity of introducing a new, discrete-continuous topological structure to describe complicated systems and processes of their functioning. Currently, there are two topological structures: continuous and discrete. At the same time, there are functional approaches in order to describe complicated systems and processes of their functioning, based on continuous topology. Until now, it has not been possible to build full functionality for the design of complicated technical objects. Therefore, the functional approach does not fully correspond to the increasingly complicated tasks of our time. The introduction of discrete-continuous topology is especially important for the exploring and modeling of complicated systems and processes of their functioning. In order to prove this fact, the present study describes the properties of complicated processes using examples of the flight process and the design process. The examination of these processes, as the most complicated, proves that the complicated systems and processes are topological spaces with metric, so they can be represented in the form of an oriented progressively bounded graph. Also, it proves the topological invariants of complicated systems and the processes of functioning. Presentation of the complicated processes in the form of a directed graph allows getting shorter path to their algorithmicization and programming, which is necessary for existing practice. In addition, the presentation of a complicated process as a directed graph will allow using the apparatus of graph theory for such purpose and will significantly expand the capabilities of programmers.\",\"PeriodicalId\":53011,\"journal\":{\"name\":\"RUDN Journal of Engineering Researches\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"RUDN Journal of Engineering Researches\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22363/2312-8143-2021-22-3-270-282\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"RUDN Journal of Engineering Researches","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22363/2312-8143-2021-22-3-270-282","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Argumentation of introducing a discrete-continuous topology in the interests of algorithmization of complex functioning processes
The main aim of the research is to show and prove the necessity of introducing a new, discrete-continuous topological structure to describe complicated systems and processes of their functioning. Currently, there are two topological structures: continuous and discrete. At the same time, there are functional approaches in order to describe complicated systems and processes of their functioning, based on continuous topology. Until now, it has not been possible to build full functionality for the design of complicated technical objects. Therefore, the functional approach does not fully correspond to the increasingly complicated tasks of our time. The introduction of discrete-continuous topology is especially important for the exploring and modeling of complicated systems and processes of their functioning. In order to prove this fact, the present study describes the properties of complicated processes using examples of the flight process and the design process. The examination of these processes, as the most complicated, proves that the complicated systems and processes are topological spaces with metric, so they can be represented in the form of an oriented progressively bounded graph. Also, it proves the topological invariants of complicated systems and the processes of functioning. Presentation of the complicated processes in the form of a directed graph allows getting shorter path to their algorithmicization and programming, which is necessary for existing practice. In addition, the presentation of a complicated process as a directed graph will allow using the apparatus of graph theory for such purpose and will significantly expand the capabilities of programmers.