A software emulator of an educational digital computer and a software simulator of an educational digital processor are proposed, ensuring the development of the basic principles of construction and operation of computer equipment implemented in the laboratory simulator “Educational Digital Computer”. Modern processors, microprocessors and their software are extremely complex objects to study and practically master. One of the main directions in overcoming this problem in universities is the use of simulators and software models of educational computers at the initial stages of teaching the basics of information technology. The proposed software models, provided with comparative simple and a clear visual interface, help students successfully master the basic concepts of computer organization and architecture, such as command system, command and data formats, data representation, addressing methods, and the basics of special number coding.

Geomagnetic pulsations, which usually mean a change in the strength of the geomagnetic field in different frequency ranges depending on time and various factors, can be formally represented as magnetohydrodynamic waves in the near-Earth plasma. On the Earth’s surface, geomagnetic pulsations can be isolated from ultra-low-frequency electromagnetic oscillations recorded, for example, in geomagnetic observatories. Geomagnetic pulsations contain various information, for example, about environmental parameters in the areas of their generation; about the features of the development of geomagnetic storms and substorms. The features of working with one of the most common types of geomagnetic pulsations — type Pc4, with an oscillation period of 45–150 s, are analyzed. The processed data is obtained from the international INTERMAGNET network. Since the volume of such data exceeds the amount of computer RAM, BigData technologies implemented in the MATLAB environment are used.

Navigation is the core of mobile robot applications, but traditional configurations have great difficulties in dealing with dynamic human factors. This means that new service robots must not only undertake the task of autonomous navigation, but also be good at social interaction and consider harmonious coexistence with others. This paper designs a social navigation based on improving the comfort of human–robot interaction. The social space costs and constraints are modeled using asymmetric Cauchy functions, and predictions are made using human–human or human–robot interaction, and pedestrian encounters are considered. The difference in the degree of attention paid to oneself, front, rear, left, and right when encountering obstacles or pedestrians establishes the benchmark for the corresponding model. On this basis, a map cost function is constructed, which can use different constraints on the path and specify that the robot does not enter certain spaces, or enter specific spaces under certain circumstances. The A* and jump algorithms were modified based on the map cost function, and experiments were conducted in MATLAB. The experimental results show that the designed social comfort navigation can effectively realize the function, pedestrians’ personal space is guaranteed, and goal-oriented intentionality is understood by the robot. Understanding, coexistence and adaptability of mobile service robots are significantly improved.

Приведены результаты синтеза алгоритма оптимального обнаружения сигналов, заключающегося в знакопеременном преобразовании принимаемых сигналов во времени и компенсации помехового сигнала при накоплении в фильтре. Физической основой синтеза алгоритма являются различия между частотно-временными характеристиками сигналов, отраженных от движущейся цели и земной поверхности, проявляющиеся во временном сдвиге максимумов полезного и помехового сигналов с равными доплеровскими сдвигами частоты. В алгоритме обработки выполняется сравнение модуля весового интеграла с порогом. Разработана структурная схема оптимального обнаружителя. Рассмотрена зависимость нормированного по амплитуде весового вектора оптимальной обработки от времени. Проведена оценка потенциальных характеристик обнаружения движущихся целей. Показано, что при обнаружении малоскоростных целей существуют оптимальные скорости сканирования, при которых вероятность правильного обнаружения максимальна.