Since 2012 NFV (Network Functions Virtualisation) technology has evolved significantly and became widespread. Before the advent of this technology, proprietary network devices had to be used to process traffic. NFV te...
Since 2012 NFV (Network Functions Virtualisation) technology has evolved significantly and became widespread. Before the advent of this technology, proprietary network devices had to be used to process traffic. NFV technology allows you to simplify the configuration of network functions and reduce the cost of traffic processing by using software modules running on completely standard datacenter servers (in virtual machines). However, deploying and maintaining virtualised network functions (such as firewall, NAT, spam filter, access speed restriction) in the form of software components, changing the configurations of these components, and manually configuring traffic routing are still complicated operations. The problems described exist due to the huge number of network infrastructure components and differences in the functionality of chosen software, network operating systems and cloud platforms. In particular, the problem is relevant for the biomedical data analysis platform of the world-class Scientific Center of Sechenov University. In this article, we propose a solution to this problem by creating a framework TOMMANO that allows you to automate the deployment of virtualised network functions on virtual machines in cloud environments. It converts OASIS TOSCA [5, 6] declarative templates in notation corresponding to the ETSI MANO [2] for NFV standard into normative TOSCA templates and sets of Ansible scripts. Using these outputs an application containing virtualised network functions can be deployed by the TOSCA orchestrator in any cloud environment it supports. The developed TOMMANO framework received a certificate of state registration of the computer program no. 2023682112 dated October 23, 2023. In addition, this article provides an example of using this framework for the automatic deployment of network functions. In this solution Cumulus VX is used as the provider operating system of network functions. Clouni is used as an orchestrator. Openstack is used as a
Data races represent a class of concurrency errors when two threads access a shared memory location without proper synchronization. Data races are hard to reveal and debug. This paper presents RaceHunter, a dynamic da...
详细信息
Data races represent a class of concurrency errors when two threads access a shared memory location without proper synchronization. Data races are hard to reveal and debug. This paper presents RaceHunter, a dynamic data race detection technique, which monitors executions of shared-memory concurrent programs, discovers pairs of conflicting memory accesses, and systematically checks them for data races. RaceHunter does not report false data races when the target software exploits nonstandard synchronization primitives or unknown synchronization protocols, and it can also detect data races missed by other approaches. Dynamic data race detectors can monitor continuous, e.g., real-life, program executions or they can verify relatively short program executions, e.g., organized by system tests. The latter is the primary use case scenario for RaceHunter.
We present a method of conformance testing of the cryptographic protocol implementations that ensures a high degree of automation of the testing process and provides criteria for the quality assessment of the generate...
详细信息
We present a method of conformance testing of the cryptographic protocol implementations that ensures a high degree of automation of the testing process and provides criteria for the quality assessment of the generated test suites. Our method is based on a kind of extended (non-finite) state machine which is specifically designed for the domain of cryptographic protocols. The key concept of the proposed machine is a built-in mechanism of sequences, which, firstly, sets an effective way to deal with the nondeterminism inherent in cryptographic protocols and, secondly, provides the means to express "inconvenient" (for the high-level declarative languages) requirements, such as e.g. "take the concatenation of the specified parts of all the previous messages which meet specified condition". Basing on this machine, we propose a high-level declarative language (embedded in Haskell) intended for development of interoperable protocol specifications used as input data for our testing tool. The protocol specification consists of two parts: a description of the structure of the protocol messages (this part, by virtue of its conciseness and declarativeness, can be directly incorporated in the primary specifications such as RFC) and a set of state machine transition functions binded to the sequences. In the paper, we present the principles of building of our machine and introduce the notion of sequences fuzzing. The proposed approach was successfully approved for the industrial cryptographic protocol TLS.
作者：
Epikhin, AndreyBut, IvanRAS
Ivannikov Inst Syst Programming Moscow Russia RAS
Keldysh Inst Appl Math Moscow Ctr Fundamental & Appl Math Moscow Russia
The paper presents an improved approach for modeling multicomponent gas mixtures based on quasi-gasdynamic equations. The proposed numerical algorithm is implemented as a reactingQGDFoam solver based on the open-sourc...
详细信息
The paper presents an improved approach for modeling multicomponent gas mixtures based on quasi-gasdynamic equations. The proposed numerical algorithm is implemented as a reactingQGDFoam solver based on the open-source OpenFOAM platform. The following problems have been considered for validation: the Riemann problems, the backward facing step problem, the interaction of a shock wave with a heavy and a light gas bubble, the unsteady underexpanded hydrogen jet flow in an air. The stability and convergence parameters of the proposed numerical algorithm are determined. The simulation results are found to be in agreement with analytical solutions and experimental data. The paper presents an improved approach for modelling multi-component gas mixtures based on quasi-gasdynamic equations. The proposed numerical algorithm is implemented as a reactingQGDFoam solver based on the open-source OpenFOAM platform. This solver has been extensively validated and verified through a variety of well-described test problems. The stability and convergence parameters of the proposed numerical algorithm are determined. The simulation results are found to be in agreement with analytical solutions and experimental data. image
Wave attractor, a phenomenon of internal/inertial wave self-focusing in a stratified/rotating fluid in non-trivial geometry, leads to the rapid turbulence development due to the energy accumulation on a limited area. ...
详细信息
Wave attractor, a phenomenon of internal/inertial wave self-focusing in a stratified/rotating fluid in non-trivial geometry, leads to the rapid turbulence development due to the energy accumulation on a limited area. It was believed until now that instability in a wave attractor should develop in the Triadic Resonance instability way. In this work it is shown that in a specific geometry, close to real water basins geometries, the instability behaviour can sufficiently differ from that observed in a trapezoid setup.
The development and use of scientific applications have become an integral part of conducting large-scale experiments in various fields of research that require high-performance computing and big data processing. In t...
详细信息
The development and use of scientific applications have become an integral part of conducting large-scale experiments in various fields of research that require high-performance computing and big data processing. In the context of developing such applications, non-trivial problems arise in the concerted description and further use of schemes, software, and computational resources to solve subject domain problems of a specific application. Research productivity has become highly dependent on the degree of automation in the preparation and execution of experiments in a computing environment whose resources may be distributed and heterogeneous. Many approaches to the experiment automation are based on workflows as a structure for formalizing and specifying data processing and high-performance computing using distributed applications. Within such approaches, developers and end-users work with workflow management systems for the collaborative development and use of distributed scientific applications. Nowadays, service-oriented applications are coming to the fore. However, there is a wide range spectrum of problems related to the support of modular scientific applications, the standardization of their components and interfaces, the use of heterogeneous information and computing resources, and organization of interdisciplinary research within service-oriented architecture. Known workflow management systems do not fully address the above problems. In this regards, we consider relevant aspects of organizing service-oriented computing in a heterogeneous distributed computing environment. We propose a new framework for creating service-oriented and workflow-based scientific applications. The paper shows that the proposed framework significantly extends and complements the capabilities of systems for such purposes. We also demonstrate the reduction in labour costs associated with the preparation and execution of experiments.
This article presents a novel method for detecting copied code fragments called clones, which is then utilized to identify known common vulnerabilities and exposures copies. The proposed method is versatile and applic...
详细信息
This article presents a novel method for detecting copied code fragments called clones, which is then utilized to identify known common vulnerabilities and exposures copies. The proposed method is versatile and applicable to both source and binary code. It overcomes the limitations of existing tools that typically focus on detecting entire function clones and specializing in either source or binary code, but not both. The method outputs all the detected clones by comparing the provided code fragment against the target project. It employs program dependence graphs-a data structure that unifies data and control dependencies for the function to achieve high accuracy. Experimental evaluations of real-world projects and benchmarks demonstrate the high precision of the proposed method. Furthermore, we successfully applied this method to detect clones of known common vulnerabilities and exposures in source code and uncovered vulnerabilities in actual software. The detected vulnerabilities were confirmed by the community, validating the effectiveness of the proposed method.
Automatic handwriting recognition is an important component in the process of electronic documents analysis, but its solution is still far from perfect. One of the main reasons for the complexity of Russian handwritin...
详细信息
Automatic handwriting recognition is an important component in the process of electronic documents analysis, but its solution is still far from perfect. One of the main reasons for the complexity of Russian handwriting recognition is the insufficient amount of data used to train recognition models. For the Russian language, the problem is even more challenging and is aggravated by a large variety of complex handwritings. This paper explores the impact of various methods of generating additional training datasets on the quality of recognition models: the method based on handwritten fonts, the StackMix method of gluing words from symbols, and the use of a generative adversarial network. As part of this work a new method was developed for creating images of hand-written texts in Russian based on fonts. In addition, an algorithm is proposed for forming a new Cyrillic handwritten font based on the existing images of handwritten characters. The effectiveness of the developed method was tested using experiments that were carried out on two publicly available Cyrillic datasets using two different recognition models. The results of the experiments showed that the developed method for generating images made it possible to increase the accuracy of handwriting recognition by 6% on average, which is comparable to the results of other more complex methods. The source code of the experiments, the proposed method, as well as the datasets generated during the experiments are publicly available and are ready for download.
The technologies of artificial intelligence and cloud computing systems have recently been actively developed and implemented. In this regard, the issue of their joint use, which has been topical for several years, ha...
详细信息
The technologies of artificial intelligence and cloud computing systems have recently been actively developed and implemented. In this regard, the issue of their joint use, which has been topical for several years, has become more acute. The problem of data privacy preservation in cloud computing acquired the status of critical long before the necessity of their joint use with artificial intelligence, which made it even more complicated. This paper presents an overview of both the artificial intelligence and cloud computing techniques themselves, as well as methods to ensure data privacy. The review considers methods that utilize differentiated privacy;secret sharing schemes;homomorphic encryption;and hybrid methods. The conducted research has shown that each considered method has its pros and cons outlined in the paper, but there is no universal solution. It was found that theoretical models of hybrid methods based on secret sharing schemes and fully homomorphic encryption can significantly improve the confidentiality of data processing using artificial intelligence.
This paper considers various numerical functions that determine the degree of similarity between two finite sequences. These similarity measures are based on the concept of embedding for sequences, which we define her...
详细信息
This paper considers various numerical functions that determine the degree of similarity between two finite sequences. These similarity measures are based on the concept of embedding for sequences, which we define here. A special case of this embedding is a subsequence. Other cases additionally require equal distances between adjacent symbols of a subsequence in both sequences. This is a generalization of the concept of the substring with unit distances. Moreover, equality of distances from the beginning of the sequences to the first embedded symbol or from the last embedded symbol to the end of the sequences may be required. In addition to the last two cases, an embedding can occur in the sequence more than once. In the literature, functions such as the number of common embeddings or the number of pairs of occurrences of embeddings in a sequence are used. We introduce three additional functions: the sum of lengths of common embeddings, the sum of the minimum numbers of occurrences of a common embedding in both sequences, and the similarity function based on the longest common embedding. In total, we consider 20 numerical functions;for 17 of these functions, algorithms (including new ones) of polynomial complexity are proposed;for two functions, algorithms of exponential complexity with a reduced exponent are proposed. In Conclusions, we briefly compare these embeddings and functions.
暂无评论