cage roll forming is one of the new methods of cold roll forming process which is widely used for producing erw pipes. in addition to less production cost and time, using cage roll forming provides smooth deformation on the strip. few studies can be found about cage roll forming because of its complexity, and the available knowledge is more experience-based and not science-based. in this paper,...

In this paper, we investigate the structure of minimum vertex and edge cuts of distance-regular digraphs. We show that each distance-regular digraph Γ, different from an undirected cycle, is super edge-connected, that is, any minimum edge cut of Γ is the set of all edges going into (or coming out of) a single vertex. Moreover, we will show that except for undirected cycles, any distance regular...

Colonization of potato (Solanum tuberosum [L.]) Þelds by Colorado potato beetle, Leptinotarsa decemlineata (Say) (Coleoptera: Chrysomelidae), has often been recognized as a process that initially results in an edge-biased spatial pattern. We modeled this spatial process by measuring distance of immigration for individual overwintered adults.Distancewasmeasured to the nearest Þeld edge or to the...

An edge-operation on a graph G is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs G, the editing distance from G to G is the smallest number of edge-operations needed to modify G into a graph from G. In this paper, we fix a graph H and consider Forb(n,H), the set of all graphs on n vertices that have no induced copy of H. We ...

This paper presents a video cut detection algorithm using multi-level Hausdor distance histograms (HDH). Hausdor distance is obtained by comparing edge points of successive frames, wherein the edge information is extracted from compressed frames directly. The use of Hausdor distance histogram instead of the comparison of entering/exiting edge pixel counts [9] makes the algorithm more robust to ...

In certain spaces using some distance measures, the sum of any two distances is always bigger than the third one. Such a special property is called as the tri-edge inequality (TEI). In this paper, the tri-edge inequality characterizing several binary distance measures is mathematically proven and experimentally verified, and the implications of TEI are discussed.

In this paper, we propose a new type of graph, denoted as ”embedded-graph”, and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated relations, which cannot be expressed by the existing edge-graphs or weighted-graphs. We introduce the mathematical definition of embedded-graph, translation, edg...