This study proves the existence of geodesic (i.e., shortest) paths in a compact metric space based on an introduced path measure defined as a fuzzy measure of possibility. An analogue of the Hopf–Rinow condition for a fuzzy path measure is proved. An example of using a fuzzy path measure to determine the geodesic properties of space is given.
This paper presents a comprehensive overview of the software ecosystem and services provided by the Aznavour supercomputer at the Armenian National Supercomputing Center. Building upon the hardware architecture described in our previous work, we detail the software stack that enables researchers across multiple disciplines to leverage high-performance computing resources. The paper covers the module-based software management system, available scientific applications for molecular dynamics, weather modeling, quantum chemistry, and computational physics, as well as containerization services and big data analytics capabilities. We present usage statistics demonstrating the growing adoption of supercomputing resources by the Armenian scientific community, with over 70 active users from more than 10 organizations achieving 70–80
This paper explores the challenges in the formalization of constrained adversarial attacks against machine learning-based intrusion detection systems for network traffic analysis. While effective at detecting anomalies and zero-day attacks in network traffic, such systems are vulnerable to adversarial attacks, particularly evasion attacks that introduce carefully designed perturbations into input data to cause misclassification. The structured and heterogeneous nature of network traffic and the complexity of extracted traffic features complicate the generation of functionally valid adversarial examples that represent realistic attack scenarios. Crafting realistic adversarial examples requires incorporating domain-specific constraints into the attack. This transforms the underlying optimization problem into a constrained optimization problem whose solution is non-trivial and does not guarantee convergence. This paper reviews existing approaches to incorporating domain constraints, discusses the limitations of traditional distance metrics in the context of network traffic, and highlights challenges arising from differences between feature-space and traffic-space attacks. We conclude that domain constraints must be accounted for as comprehensively as possible while preserving practical applicability, and that the effectiveness of constrained attack methods and constraint-handling approaches remains an open question.
This paper presents a sequential speaker diarization framework designed to improve robustness and computational efficiency in multi-speaker recordings containing overlapping speech, varying speaker counts, and diverse acoustic conditions. Unlike conventional clustering-based approaches, which often suffer from error propagation and limited overlap handling, and end-to-end neural systems that typically impose fixed speaker capacity constraints, the proposed framework combines adaptive speaker assignment strategies with dual speaker embedding representations to achieve stable speaker tracking while remaining sensitive to previously unseen speakers. The system further incorporates an explicit overlap-handling mechanism based on softmax-weighted cosine-similarity aggregation over previously assigned speaker embeddings. The proposed framework is compatible with multiple segmentation front-ends, including Pyannote and DiariZen, and is evaluated on eight benchmark datasets: VoxConverse, AMI-IHM, AMI-SDM, CallHome, MSP-Podcast, AISHELL-4, AliMeeting, and MSDWild. Experimental results demonstrate diarization error rates competitive with state-of-the-art systems across most datasets while significantly reducing inference latency, achieving processing speeds 2.5 × faster than standalone DiariZen and 1.6 × faster than Pyannote. In addition, the proposed system outperforms Ultra-SortFormer on most of the evaluated datasets.
CLOS is a technology and family of embedded operating systems supporting multicore architectures, with enhanced safety (DO-178C) and secure software development lifecycle (SSDL) requirements. CLOS provides spatial (memory) and temporal (response time guarantees) isolation of functional and system software. RTOS overhead is minimized through static memory configuration and nonperiodic timers with quantization. This article briefly describes the history of work on operating systems based on the microkernel approach, which began under the leadership of Academician V.P. Ivannikov in the 1970s and the development they have undergone to date. The main architectural solutions used in CLOS versions developed at the Institute of System Programming of the Russian Academy of Sciences for aerospace systems over the past ten years are described in more detail.
