Results 31 to 40 of about 1,234 (232)
The development of enterprises in strategic industries depends on funding made innovative products that are in demand in the markets for high-tech products.
Oleg Fedorovich +3 more
doaj +1 more source
Lexicographical order, lexicographical index, and linear operators
Let \(E=\{e_ 1,...,e_ n\}\) be a basis of an n-dimensional real linear space. The authors define the lexicographical index of \(y=\eta_ 1e_ 1+...+\eta_ 1e_ n\neq 0\) with respect to E as the minimum \(j\in \{1,..,n\}\) such that \(\eta_ j\neq 0\). The lexicographical index of 0 is defined as \(\infty\).
Martínez-Legaz, Juan-Enrique +1 more
openaire +2 more sources
Symmetries and Scale Invariance in Global Maps of Quantum Circuits
We present a combinatorial analysis of any maximal set of gate compositions parameterized over a finite alphabet which revealed an underlying fractal structure. Results are presented as global maps in the form of large 2D arrays where each row stands for
Theophanes Raptis, Vasilios Raptis
doaj +1 more source
INVESTIGATION OF VULNERABILITIES AND LOSSES IN LOGISTICS OF DISTRIBUTED PRODUCTION
The problem of researching vulnerabilities and their impact on the occurrence of possible losses in the logistics of distributed production has been stated and solved.
Олег Евгеньевич Федорович +2 more
doaj +1 more source
Rozwijanie kompetencji frazeologicznej w nauczaniu języka polskiego jako obcego / Developing Phraseological Competence in Teaching Polish as a Foreign Language [PDF]
The purpose of this article is to present a book on teaching the phraseology of the Polish language, addressed to foreign students studying at Polish universities. This publication is a phraseological dictionary (glossary), compiled by a team of students,
Gabriela Dziamska-Lenart
doaj +1 more source
On Tight Tree‐Complete Hypergraph Ramsey Numbers
ABSTRACT Chvátal showed that for any tree T $T$ with k $k$ edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1 $R(T,n)=k(n-1)+1$. For r = 3 $r=3$ or 4, we show that, if T $T$ is an r $r$‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ) $R(T,n)={\rm{\Theta }}({n}^{r-1})$.
Jiaxi Nie
wiley +1 more source
On lexicographical ordering in multivariate mathematical morphology
Since mathematical morphology is based on complete lattice theory, a vector ordering method becomes indispensable for its extension to multivariate images. Among the several approaches developed with this purpose, lexicographical orderings are by far the most frequent, as they possess certain desirable theoretical properties.
Erchan Aptoula, Sébastien Lefèvre
openaire +3 more sources
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w ) $G=(V,E,w)$ has a bisection with weight at least θ ⋅ w (
Stefanie Gerke +3 more
wiley +1 more source
Modeling of project activities for UAV modernization to conduct swarm drone attack missions
This study addresses the critical issue of modernizing existing unmanned aerial vehicles (UAVs) to enhance their applicability in the contemporary conditions of hybrid warfare.
Oleg Fedorovych +3 more
doaj +1 more source
The task of creation of innovative order executors’ cooperation to create the new aerospace technique (AST) on the basis of the component-competence approach has been set and solved.
Олег Евгеньевич Федорович +2 more
doaj +1 more source

