This paper addresses the problem of efficient data transmission under dynamically changing network and computational conditions by proposing an adaptive data compression method based on context-aware selection of compression algorithms and their parameters. Unlike conventional static approaches, the proposed method performs real-time analysis of data characteristics, network bandwidth, latency, and available computational resources, enabling dynamic selection of the optimal compression strategy through multi-criteria optimization. The scientific novelty of the work lies in the integration of data-driven and environment-aware adaptation within a unified decision-making framework that simultaneously minimizes end-to-end transmission delay while balancing compression ratio and processing overhead. Experimental evaluation was conducted using both synthetic datasets and the standard Silesia Corpus benchmark. The synthetic datasets included repetitive low-entropy text (repeated.txt), structured JSON data (structured.json), moderate-complexity text (example.txt), and high-entropy binary streams (random.bin), representing realistic web content and raw data transmission scenarios. The Silesia Corpus, containing approximately 200 MB of heterogeneous real-world files, including text, binaries, and images, was used for validation and benchmarking. The proposed method was evaluated using compression algorithms such as LZ4, Zstandard, Brotli, and ZSTD under different network conditions and system loads. Experimental results show that the adaptive approach reduces total transmission time by an average of 23%, improves compression efficiency by 16%, and decreases computational resource consumption by 13% compared to conventional static compression methods. The software implementation is based on a modular service-oriented architecture that supports real-time monitoring, dynamic algorithm switching, and scalable deployment in distributed, cloud, streaming, and Internet of Things environments.

This paper presents a set of feature selection methods for intelligent software performance monitoring based on machine learning models, with a focus on improving interpretability, scalability, and adaptability in high-dimensional telemetry analysis. The research addresses limitations of traditional statistical and rule-based approaches, which are often unable to capture nonlinear dependencies and dynamic interactions in modern distributed architectures. A unified methodology is proposed that integrates several complementary techniques for adaptive feature selection in intelligent monitoring systems. These include a topology-aware method based on graph neural networks for modeling structural dependencies in microservice architectures, a correlation-driven approach for reducing feature redundancy, a multifactor fusion method combining statistical significance, temporal stability, and predictive contribution, a cost-efficient strategy for serverless environments, and a context-aware reinforcement learning approach for dynamic feature adaptation. The proposed methods are evaluated on a large-scale dataset exceeding 3.5 TB, collected from 42 real-world applications representing monolithic, microservice, cloud-native, and serverless architectures. The results show an average reduction in feature dimensionality of 37%, while maintaining over 95% predictive accuracy across multiple models. Additional improvements include, on average, a 21% increase in dependency modeling accuracy, an 18% gain in feature relevance estimation, a 26% reduction in feature instability under dynamic workloads, and up to 42% cost reduction in serverless environments, as observed across repeated experiments under controlled workload variability and consistent evaluation settings. While the results demonstrate the effectiveness of adaptive feature selection, further validation in diverse real-world conditions is required to confirm the generalizability of the proposed framework.

This article introduces a novel variational approach for solving the inverse geodesic problem on a transcendental surface shaped as a cylindrical structure with a cycloidal generatrix, a type of geometry that has not been previously studied in this context. Unlike classical models that rely on symmetric surfaces such as spheres or spheroids, this method formulates the geodesic path as a functional minimization problem. By applying the Euler–Lagrange equation, an analytical integration of the corresponding second-order differential equation is achieved, resulting in a parametric expression that satisfies boundary conditions. The effectiveness of the proposed method for computing geodesic curves on transcendental surfaces has been rigorously evaluated through a series of numerical experiments. Analytical validation has been carried out using MathCad, while simulation and three-dimensional visualization have been implemented in Python. Numerical experiments are conducted and 3D visualizations of the geodesic lines are presented for multiple point pairs on the surface, demonstrating the accuracy and computational efficiency of the proposed solution. This enables a closed-form analytical representation of the geodesic curve, significantly reducing computational complexity compared to existing numerical-heuristic methods.
The obtained results offer clear advantages over existing studies in the field of computational geometry and variational calculus. Specifically, the proposed method enables the construction of geodesic curves on complex transcendental surfaces where traditional methods either fail or require intensive numerical approximation. 
The analytical integration of geodesic equations enhances both accuracy and performance, achieving an average computational cost reduction of approximately 27-30% and accuracy improvement of around 20% in comparison with previous models utilizing non-polynomial metrics. These enhancements are especially relevant in applications requiring real-time response and precision, such as robotics, CAD systems, computer graphics, and virtual environment simulation. The method’s ability to deliver compact and exact solutions for boundary value problems positions it as a valuable contribution for both theoretical and applied sciences.

Medical image segmentation is a significant and complex challenge in medical imaging. In recent years, deep learning models have been applied to image segmentation and have shown exceptional performance. However, medical image segmentation has a scarcity of expert-labeled data compared to other deep learning research fields. Therefore, augmenting medical expert-labeled data are primarily the easiest and fastest way to improve the deep learning model’s performance. In this paper, computed tomography image segmentation technology based on the ResNet network integrated into the probabilistic model has been proposed. The proposed segmentation technology is based on the deep learning model of the ResNet50 architecture to extract features from images and initially detect objects of interest and on the probabilistic model with weighted parameters that employs conditional random fields, the GrabCut algorithm, and the argmax function to perform the final detection of objects of interest.
To train, test, and evaluate the effectiveness of the proposed method, appropriate chest CT datasets were identified to solve the task of segmenting the lung cavity, the liver and areas affected by COVID-19. The proposed image segmentation technology demonstrates segmentation accuracy results of 73.12% by Dice Score for the COVID-19 disease dataset, 97.71% for the lung cavity dataset, and 98.36% for the liver dataset, which perform better than state-of-the-art solutions.
The proposed image segmentation technology has been compared with state-of-the-art technologies (SegNet, UNet, and FCN-ResNet50) for CT segmentation to demonstrate the effectiveness of the method. The positive outcomes strongly suggest the significant potential of the proposed image segmentation technology. According to the obtained results, the proposed image segmentation technology can be a useful auxiliary tool for doctors to segment CT images for further analysis and monitoring of statistical and dynamic indicators.