### ?

## Тестирование методов обмена данными между процессами на суперкомпьютере JETSON TX2 в сравнении с другими платформами

Т. 1.
ГНИИ "НацРазвитие", 2019.

Смирнов И. А., КРАВЧЕНКО В. О., Разумов П. В., Хилков Д. В., Черкесова Л. В.

this article will describe the various methods of exchanging data between

processes, with the subsequent conclusion about the speed of each. Tests were conducted on

different processors and different versions of operating systems. This study was conducted to find

out the fastest way to transfer data between processes on a Jetson TX2 supercomputer compared to

other platforms.

Gerasimov N. A., Российская экономическая академия имени Г.В.Плеханова, 2008

Added: January 23, 2013

Фотеева А. В., Феофилова А. Е., Ростова Н. Б. et al., Медико-фармацевтический журнал "Пульс" 2022 Т. 24 № 4 С. 38–43

Abstract. The modern regulatory requirements for pharmaceutical development, stricter of requirements of
medicinal products (MP) quality standards, the experience of manufacturers and development companies in terms of MP pharmaceutical development revealed need to create solutions that minimize the risk of medicinal product quality deviations, guaranteeing the release of effective and safe MP with the planned quality. The aim of these study is to ...

Added: May 13, 2022

Lazarev A. A., Baranov A. V., Amsterdam: University of Amsterdam, 2011

Added: March 4, 2013

Switzerland: Springer, 2015

Recent developments in theory, algorithms, and applications in optimization and control are discussed in this proceedings, based on selected talks from the ‘Optimization Control and Applications in the Information Age’ conference, organized in honor of Panos Pardalos’s 60th birthday. This volume contains numerous applications to optimal decision making in energy production and fuel management, data ...

Added: September 13, 2015

Nikolsky S. N., Tishkin A., Качество. Инновации. Образование 2013 № 9 С. 71–74

The decision two-criteria task of simultaneously reached maximum through the free point’s method modification is constructed using the principle of guaranteed result. ...

Added: October 24, 2013

Gabeydulin R., Труды ГосНИИАС. Серия: Вопросы авионики 2018 № 2(35) С. 39–53

The paper presents a brief introduction to the air traffic flow management problem, describes main terms, rules and also describes the main approaches for solving the problem. Author describes how flow management systems work in Europe, USA and in the Russian Federation. Author proposes a fast greedy algorithm for solving flow management problem defined in ...

Added: March 22, 2018

Gafarov E., Lazarev A. A., Werner F., / Otto-von-Guericke Universitaet. 2010. No. 10.

In this note, we consider a single machine scheduling problem with generalized total tardiness objective function. An NP-hardness proof and a pseudo-polynomial time solution algorithm are proposed for a special case of this problem. Moreover, we present a new graphical algorithm for another special case, which corresponds to the classical problem of minimizing the weighted ...

Added: March 4, 2013

Savrukov A., Савруков Н. Т., Финансы и кредит 2015 № 14 С. 42–45

Importance Assessing the effectiveness of public spending in the housing sector, as well as developing and substantiating the methods of State support to housing programs have recently become very important due to special social significance of the housing problem and continuing budget constraints.
Objectives The purpose of the paper is to develop a method of selecting ...

Added: October 20, 2015

Humboldt-Universität zu Berlin, 2016

This volume contains the papers presented at CS&P 2016, the 25th International Workshop on Concurrency, Speciﬁcation and Programming, held on September 28 - 30, 2016 in Rostock, Germany. Since the early seventies Warsaw University and Humboldt University have alternately organized an annual workshop - since the early nineties known as CS&P. Over time, it has ...

Added: October 13, 2016

Aksenov S. A., Logashina I. V., Chumachenko E. N. et al., Materials Science Forum 2012 No. 704-705 P. 1379–1386

The subject of the paper is a study of the material behavior during hot rolling. The process considered is a rolling of round bar in roughing mill group which consist of four passes. The computer simulation of the process shows that the local plastic deformations which appear in the material are extremely large. This fact ...

Added: April 12, 2012

Lazarev A. A., Arkhipov D. I., , in : 28th Conference of the European Chapter on Combinatorial Optimization. : Катания: University of Catania, 2015. P. 64.

The following classical NP-complete scheduling problem is considered. ...

Added: June 22, 2015

Gromov I.Yu., Romanova I.I., Lezhnev E.V., , in : 2019 International Russian Automation Conference (RusAutoCon). : IEEE, 2019. P. 1–6.

This paper presents a brief description of a method of automated parametric and structural optimization of temperature control systems of electronic equipment using criteria of solution effectiveness evaluation. Methods and models, that allow automating the process of choosing both thermal regulation (temperature control) tools for electronic equipment and their parameters, are proposed. The problems of ...

Added: October 23, 2019

Lazarev A. A., Gafarov E., , in : IFAC Symposium on Information Control Problems in Manufacturing (2009). : M.: [б.и.], 2009. P. 1512–1515.

We consider some special cases of the NP-hard resource-constrained projects cheduling problem (RCPSP) to minimize the makespan. We show that a well-known lowerbounds for the problem may yield bad approximation ratios or its calculation is an NP-hardproblem too. We conjecture that the ratio of the optimal makespan of RCPSP to that of the preemptive version ...

Added: March 4, 2013

A. A. Lazarev, Lemtyuzhnikova D. V., N. A. Pravdivets, Computational Mathematics and Mathematical Physics 2021 Vol. 61 No. 7 P. 1169–1180

Metric functions are introduced for various classes of single-machine scheduling problems.It is shown how approximate solutions of NP-hard problems can be found using these functions. The metric value is determined by solving a linear programming problem with constraints being systems of linear inequalities for polynomial or pseudopolynomial solvable instances of the problem under study.In fact, ...

Added: February 4, 2022

Bochkarev A. A., Бочкарев П. А., М.: Юрайт, 2017

The last years are characterized by increase of interest in the logistics of city transport systems (city logistics) representing the complex of logistic decisions, actions and processes. In the manual methodological bases of control of regional transport logistic systems of city level are explained. The main attention is paid to the theory and methodology of ...

Added: October 31, 2017

Sotnikova S., Динамика сложных систем 2012 № 3 С. 84–87

In article is described designed programme complex of the physical processes modeling, which also allows to conduct the identification printed node parameters (the physical model). On printed node designed the on-board secondary power supply source is realized. For it are designed relationship interfaces of controlling program with the known program of modeling and optimization. ...

Added: December 5, 2014

Guimarães R. R., Passos L., Filho R. H. et al., IEEE Network 2019 Vol. 33 No. 2 P. 126–131

Distinguishing outliers from normal data in wireless sensor networks has been a big challenge in the anomaly detection domain, mostly due to the nature of the anomalies, such as software or hardware failures, reading errors or malicious attacks, just to name a few. In this article, we introduce an anomaly detection-based OPF classifier in the ...

Added: December 19, 2018

Gafarov E., Lazarev A. A., Information Processing Letters 2012 Т. 112 № 3 С. 72–76

In this note, we consider a single machine scheduling problem with generalized total tardiness objective function.
A pseudo-polynomial time solution algorithm is proposed for a special case of this problem. Moreover, we present a new
graphical algorithm for another special case, which corresponds to the classical problem of minimizing the weighted number
of tardy jobs on a single ...

Added: November 24, 2012

Kvaratskhelia A., Lazarev A. A., , in : Multidisciplinary International Conference on Scheduling: Theory and Application, Paris, France, 2009. : Dublin: [б.и.], 2009. P. 68–76.

In this paper, we consider the minimizing total weighted completion time inpreemptive equal-length job with release dates scheduling problem on a single machine. Before this paper the problem is known to be open. Here, we present a polynomial timealgorithm that solves the problem with O(n^7) operations. ...

Added: March 4, 2013

Gafarov E., Lazarev A. A., Werner F., Mathematical Social Sciences 2011 No. 62 P. 7–13

We consider single machine scheduling problems with a non-renewable resource. These types of problems have not been intensively investigated in the literature so far. For several problems of these types with standard objective functions (namely the minimization of makespan, total tardiness, number of tardy jobs, total completion time and maximum lateness), we present some complexity ...

Added: November 24, 2012

Lazarev A. A., , in : European Chapter on Combinatorial Optimization (ECCO 2009). : Jerusalem: [б.и.], 2009. P. 13–13.

In this paper, for $NP$-hardness single and multi-machine scheduling problems with the criterion of minimization maximum lateness the metrics $\rho$ has been used. We consider some approaches finding of the approximate solution for the problems. The idea of approaches consists in construction to a initial instance $A$ such instance $B$ (with the same number of ...

Added: March 4, 2013

Gafarov E., Lazarev A. A., Werner F., Annals of Operations Research 2012 Vol. 196 No. 1 P. 247–261

We consider the problem of maximizing total tardiness on a single machine, where the first job starts at time zero and idle times between the processing of jobs are not allowed.We present a modification of an exact pseudo-polynomial algorithm based on a graphical approach, which has a polynomial running time. This result settles the complexity ...

Added: November 24, 2012

Lazarev A. A., Журнал вычислительной математики и математической физики 2007 Т. 47 № 6 С. 1087–1099

The classical NP-hard (in the ordinary sense) problem of scheduling jobs in order to minimize the total tardiness for a single machine 1‖ΣT j is considered. An NP-hard instance of the problem is completely analyzed. A procedure for partitioning the initial set of jobs into subsets is proposed. Algorithms are constructed for finding ...

Added: November 23, 2012

Kofanov Y. N., Sotnikova S., Uvaysov S. U., Динамика сложных систем 2012 № 3 С. 80–84

In article are considered main questions of dynamic optimization process to identifications parameter for inaccuracy reduction of modeling electric, heat and mechanical processes under computer aided design electronic facilities. ...

Added: December 7, 2012