The organization of security in distributed information and communication systems is often complicated by their scale, topological complexity, and the need to monitor large volumes of traffic. Classical perimeter-based placement of intrusion detection systems can be ineffective under resource constraints.
Due to the diversity of mobile ad hoc networks, its research interests have grown rapidly. MANETs use the traditional TCP/IP architecture to provide end-to-end communication between nodes. One of the interesting research areas in it is routing. Routing in MANETs is a complex task and has attracted enormous attention from researchers. This has led to the development of many different routing protocols for MANETs. It is quite difficult to determine which protocols can be best suited for different network scenarios, such as increasing node density and traffic.
This paper presents a comprehensive investi- gation and hardware implementation of a multi-bit Brawn matrix multiplier architecture. The research focuses on analyzing the system characteristics of binary multipliers realized with both conventional and optimized full and half adders. Particular attention has been given to the applicability of such multipliers within arithmetic logic units (ALUs) for vector and scalar processing architectures. Analytical models have been formulated to quantify hardware resource utilization and computational latency across various logic base configurations.
This paper provides an analysis of the system characteristics and functional capabilities of various types of adders for the high-speed component construction of arithmetic and logical devices in modern superscalar processors. The main features of parallel prefix adders (Sklansky, Brent Kung, Kogge Stone, Ladner Fisher, Han Carlson) and tree-like structures based on incomplete binary adders have been determined in this study. The structures of typical and improved incomplete binary adders have been shown and their complexity characteristics have been calculated as well.
Запропоновано методи розв’язання задачі побудови квазістаціонарних ділянок мовного сигналу, які ґрунтуються на характеристиках сингулярного розкладу квадратних дійсно визначених матриць операторів, визначених на елементарних ділянках. Особливістю цих методів є їх унезалежнення від моделі мовотворення.
Запропоновано модифікований алгоритм Гоморі-Ху для оптимізації мереж, орієн- тованих на технологію SDH.
Modified Gomory-Hu SDH oriented algorithm for network optimization is proposed.
Розроблено швидкий метод суміщення зображень у наборі однотипних зображень на основі розв’язання задачі майже факторизації простору топології зображень з подальшим звуженням цього простору через розв’язання задачі пошуку кореляційного максимуму. Задача майже факторизації формулюється через введення напівметрики стосовно дисперсії кольору елементів топології зображення.
Запропоновано модифікований алгоритм Гоморі–Ху для оптимізації топології мереж, орієнтованих на стандартну ієрархію швидкостей.
Modified Gomory–Hu standard bit rate oriented algorithm for network topology optimization is proposed.
The aim of this work – research of topological inconsistencies during adjustment and junction of adjacent map sheets of digital topographic maps of scale 1:50000 with the use of rigorous analytical geodetic methods on the reference ellipsoid in the geoinformation environment.
For the current financial and economic systems characterized by unstable processes both in behavior and in structure. Causes of global financial instability rooted in imbalances and contradictions of international monetary and financial relations, which creates random perturbation of a different nature and give rise to unstable processes. Instability accompanied usually nonlinearities, which requires the development and application of innovative approaches to modeling processes analyzed.