Fig 5 - uploaded by Jarosław Mikołajczyk
Content may be subject to copyright.
Source publication
![Fig. 1. Box plot of the surface roughness value of Rz parameter [µm],...](profile/Jaroslaw-Mikolajczyk/publication/364928765/figure/fig3/AS:11431281093273706@1667153922337/Box-plot-of-the-surface-roughness-value-of-Rz-parameter-m-cutting-speed-v1-2356_Q320.jpg)
The article presents a method of determining a mathematical model of a seizure test which is a graph of the relationship between the moment of friction and pressure force for any construction material.
Similar publications
Let Γ = (G,σ) be a signed graph, where σ is the sign function on the edges of G. In this paper, we use the operation of partial transpose to obtain non-isomorphic Laplacian cospectral signed graphs. We will introduce two new operations on signed graphs. These operations will establish a relationship between the adjacency spectrum of one signed grap...
Let L(X) be the line graph of graph X. Let X ′′ be the Kronecker product of X by K2. In this paper, we see that L(X ′′) is a double cover of L(X). We define the symmetric edge graph of X, denoted as γ(X) which is also a double cover of L(X). We study various properties of γ(X) in relation to X and the relationship amongst the three double covers of...
In this paper, we consider the partial gathering problem of mobile agents in synchronous dynamic bidirectional ring networks. When k agents are distributed in the network, the partial gathering problem requires, for a given positive integer g (< k), that agents terminate in a configuration such that either at least g agents or no agent exists at ea...
Knowledge base question answering (KBQA) can be divided into two types according to the type of complexity: questions with constraints and questions with multiple hops of relationships. Previous work on knowledge base question answering have mostly focused on entities and relations. In a multihop question, it is insufficient to focus solely on topi...
In this paper, we determine the number of elements defined on each topology of a topological space for open and clopen topological spaces T(n) for 1≤n≤4, which is called k-element. A graph of the relationship between topologies for open and clopen set for n≤3 are discussed. Hence; T(n,k) is clopen for n≥1 if and only if k=2 n .
