Iskanje po katalogu digitalne knjižnice

Opis: There are two most commonly used methods for calibration of thread rings, with different measuring uncertainty. The method of mechanical sensing with two balls is mostly used on one-axial measuring machines and on coordinate measuring machines. However, the method of calculating the core diameter of the thread ring combined with the technique of adaptation (in accordance with the method of the smallest squares) is used on the profile scanner. The required tolerances, which are very narrow for adjustable and laboratory thread ring, so the measuring uncertainty may be too high when using the method of mechanical sensing with two balls, and the low quality of some control rings, are the decisive factors for choosing an appropriate method in the industry. This also depends on the laboratoryćs capability of executing a specific method. The measurements of the core diameter of thread rings, which are the main topic of this article, were included into an international inter-comparison in which the main subject was the same thread ring as the one mentioned in this article.
Ključne besede: thread ring gauge, calibration, pitch diameter, measurement uncertainty, dimensional measurements
Objavljeno: 31.05.2012; Ogledov: 1082; Prenosov: 16
Povezava na celotno besedilo

Opis: Fault tolerance and transmission delay of networks are important concepts in network design. The notions are strongly related to connectivity and diameter of a graph, and have been studied by many authors. Wide diameter of a graph combines studying connectivity with the diameter of a graph. Diameter with width ▫$k$▫ of a graph ▫$G$▫, ▫$k$▫-diameter, is defined as the minimum integer ▫$d$▫ for which there exist at least ▫$k$▫ internally disjoint paths of length at most ▫$d$▫ between any two distinct vertices in ▫$G$▫. Denote by ▫${mathscr D}_c(G)$▫ the ▫$c$▫-diameter of ▫$G$▫ and ▫$kappa(G)$▫ the connectivity of ▫$G$▫. In the context of computer networks, wide diameters of Cartesian graph products have been recently studied by many authors. Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph products. Let ▫$G$▫ be a Cartesian graph bundle with fiber ▫$F$▫ over base ▫$B$▫, ▫$0 < a le kappa(F)$▫, and ▫$0 < b le kappa(B)$▫. We prove that ▫${mathscr D}_{a+b}(G) le {mathscr D}_a(F) + {mathscr D}_b(B) + 1$▫. Moreover, if ▫$G$▫ is a graph bundle with fiber ▫$F ne K_2$▫ over base ▫$B ne K_2$▫, then ▫${mathscr D}_{a+b}(G) le {mathscr D}_a(F) + {mathscr D}_b(B)$▫. The bounds are tight.
Ključne besede: mathematics, graph theory, Cartesian graph products, Cartesian graph bundles, wide diameter
Objavljeno: 07.06.2012; Ogledov: 922; Prenosov: 26
Povezava na celotno besedilo

Opis: Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph products. Let ▫$G$▫ be a ▫$k_G$▫-connected graph and ▫${mathcal{D}}_c(G)$▫ denote the diameter of ▫$G$▫ after deleting any of its ▫$c < k_G$▫ vertices. We prove that if ▫$G_1, G_2, dots, G_q$▫ are ▫$k_1$▫-connected, ▫$k_2$▫-connected,...,▫$k_q$▫-connected graphs and ▫$0 leq a_1 < k_1$▫, ▫$0 leq a_2 < k_2$▫,...,▫$0 leq a_q < k_q$▫ and ▫$a = a_1 + a_2 + dots + a_q + (q-1)$▫, then the fault diameter of ▫$G$▫, a Cartesian product of ▫$G_1$▫, ▫$G_2$▫,...,▫$G_q$▫, with ▫$a$▫ faulty nodes is ▫${mathcal{D}}_{a}(G) leq {mathcal{D}}_{a_1}(G_1)+{mathcal{D}}_{a_2}(G_2) + dots + {mathcal{D}}_{a_q}(G_q) + 1$▫. We also show that ▫${mathcal{D}}_{a+b+1}(G) leq {mathcal{D}}_a(F) + {mathcal{D}}_b(B) + 1$▫ if ▫$G$▫ is a graph bundle with fibre ▫$F$▫ over base ▫$B$▫, ▫$a leq k_F$▫, and ▫$b leq k_B$▫. As an auxiliary result we prove that connectivity of graph bundle ▫$G$▫ is at least ▫$k_F+k_B$▫.
Ključne besede: mathematics, graph theory, Cartesian graph bundles, Cartesian graph products, fault diameter, interconnection network
Objavljeno: 10.07.2015; Ogledov: 299; Prenosov: 12
Povezava na celotno besedilo

Opis: Routing is a problem domain with an infinite number of final-solutions. One of the possible approaches to solving such problems is using graph theory. This paper presents mathematical analysis methodologies based on circular graphs for solving a shortest path routing problem. The problem is focused on searching for the shortest path within a circular graph. Such a search coincides with the network routing problem domain. In this paper, we introduce in the detail all necessary parts needed to understand such an approach. This includes: definition of the routing problem domain, introduction to circular graphs and their usage, circular graphʼs properties, definition of walks through a circular graph, searching and determining the shortest path within a circular graph, etc. The state of the art routing methods, implemented in contemporary highly sophisticated routers, includes well-known weight-based algorithms and distance-vectors-based algorithms. The proposed solution can be placed between the two abovementioned methods. Each of these known methods strives for optimal results, but each of them also has its own deficiencies, which should be rectified with the proposed new method. This theoretically presented method is argued by a practical example and compared with the RIP (Routing Information Protocol) technique, where we look for the shortest path and possible walks through a specified circular graph.
Ključne besede: circular graphs, shortest path, graph diameter, walk through, CIGRP, connectivity matrix, network topology, symmetry, fully connected graph
Objavljeno: 10.07.2015; Ogledov: 857; Prenosov: 37
Povezava na celotno besedilo

Opis: Kartezični svežnji so posplošitev krovnih grafov in kartezičnih grafovskih produktov. Naj bo ▫$G$▫ nek s povezavami ▫$k_G$▫-povezan graf in ▫${bar{mathcal{D}}_c(G)}$▫ največji premer podgrafov grafa ▫$G$▫ dobljenih z odstranitvijo $▫c < k_G$▫ povezav. Dokazano je, da je ▫${bar{mathcal{D}}_{a+b+1}(G)} le {bar{mathcal{D}}_a(F)} le {bar{mathcal{D}}_b(B)} + 1$▫, če je ▫$G$▫ grafovski sveženj z vlaknom ▫$F$▫ in bazo ▫$B$▫, ▫$a < k_F$▫, ▫$b < k_B▫$. Dokazano je tudi, da je povezanost s povezavami grafovskega svežnja ▫$G▫$ vsaj ▫$k_F + k_B$▫.
Ključne besede: matematika, teorija grafov, kartezični grafovski produkti, kartezični grafovski svežnji, povezavni okvarni premer, mathematics, graph theory, Cartesian graph products, Cartesian graph bundles, edge-fault diameter
Objavljeno: 10.07.2015; Ogledov: 364; Prenosov: 22
Povezava na celotno besedilo