• Journal of applied mathematics & informatics
• /
• v.40 no.1_2
• /
• pp.117-132
• /
• 2022

Reverse edge magic(REM) labeling of the graph G = (V, E) is a bijection of vertices and edges to a set of numbers from the set, defined by λ : V ∪ E → {1, 2, 3, …, |V| + |E|} with the property that for every xy ∈ E, constant k is the weight of equals to a xy, that is λ(xy) - [λ(x) + λ(x)] = k for some integer k. We given the construction of REM labeling for the Cartesian Product, Unions of Braids and Unions of Triangular Belts. The Kotzig array used in this paper is the 3 × (2r + 1) kotzig array. we test the konow results about REM labelling that are related to the new results we found.

• Convergence Security Journal
• /
• v.14 no.7
• /
• pp.37-43
• /
• 2014

Today, group research efforts are increasing for cutting edge technologies related to climate, radio astronomy, co-utilization of high performance computing resources and more. Accordingly, networks for cutting-edge researches a re also regarded as means for cutting-edge researches nowadays. Therefore, it is necessary for administrating cutti ng-edge network to be considered, reflecting such a current trend. In this sense, 'Research which can help to admin istrate the networks which are usually used as means for a lot researches' was set as a goal of this paper.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.75-79
• /
• 2009

In this paper the method was proposed which uses ${\lambda}$-fuzzy measure to detect the edge of the features of the face region. In the conventional method the features was founded using valley, brightness and edge. This method had its drawbacks that it is so sensitive to the external noises and environments. This paper proposed ${\lambda}$-fuzzy measure to cope with this drawbacks. By considering each weight of the pixels the integral evaluation was considered using the center of area method. Thus the continuity of the edge was kept by way of the neighborhood information and the reduction of time complexity wad resulted in.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.4
• /
• pp.107-116
• /
• 2013

This algorithm suggests a method in which a minimum spanning tree can be obtained fast by reducing the number of an algorithm execution. The suggested algorithm performs a select-and-delete process. In the select process, firstly, it performs Borůvka's first stage for all the vertices of a graph. Then it re-performs Borůvka's first stage for specific vertices and reduces the population of the edges. In the delete process, it deletes the maximum weight edge if any cycle occurs between the 3 edges of the edges with the reduced population. After, among the remaining edges, applying the valency concept, it gets rid of maximum weight edges. Finally, it eliminates the maximum weight edges if a cycle happens among the vertices with a big valency. The select-and-delete algorithm was applied to 9 various graphs and was evaluated its applicability. The suggested select process is believed to be the vest way to choose the edges, since it showed that it chose less number of big edges from 6 graphs, and only from 3 graphs, comparing to the number of edges that is to be performed when using MST algorithm. When applied the delete process to Kruskal algorithm, the number of performances by Kruskal was less in 6 graphs, but 1 more in each 3 graph. Also, when using the suggested delete process, 1 graph performed only the 1st stage, 5 graphs till 2nd stage, and the remaining till 3rd stage. Finally, the select-and-delete algorithm showed its least number of performances among the MST algorithms.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.4
• /
• pp.233-241
• /
• 2014

This paper suggests a fast minimum spanning tree algorithm which simplify the original graph to 2-edge connected graph, and using the cycling property. Borůvka algorithm firstly gets the partial spanning tree using cycle property for one-edge connected graph that selects the only one minimum weighted edge (e) per vertex (v). Additionally, that selects minimum weighted edge between partial spanning trees using cut property. Kruskal algorithm uses cut property for ascending ordered of all edges. Reverse-delete algorithm uses cycle property for descending ordered of all edges. Borůvka and Kruskal algorithms always perform |e| times for all edges. The proposed algorithm obtains 2-edge connected graph that selects 2 minimum weighted edges for each vertex firstly. Secondly, we use cycle property for 2-edges connected graph, and stop the algorithm until |e|=|v|-1 For actual 10 benchmark data, The proposed algorithm can be get the minimum spanning trees. Also, this algorithm reduces 60% of the trial number than Borůvka, Kruskal and Reverse-delete algorithms.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.10 no.5
• /
• pp.228-234
• /
• 2002

The CO$_2$ laser beam irradiation strengthening of 35kgf/mm$_2$ grade steel sheet is investigated to reduce the weight of bumper beam. The increase of tensile strength is dominated by the number of fully penetrated melting lines. The optimal laser irradiation pattern is obtained by 3-point bending test of hat-type specimens. Laser should be irradiated not only on the center specimen densely in the width direction, but also on the edge densely in the longitudinal direction. Local laser strengthening may be effective for the weight reduction of automobile bumper beam.

• Journal of Ocean Engineering and Technology
• /
• v.23 no.1
• /
• pp.146-151
• /
• 2009

In this paper, a weight function theory for the calculation of the mode III stress intensity factor in a rectilinear anisotropic body is formulated. This formulation employs Lekhnitskii's formalism for two dimensional anisotropic materials. To illustrate the method used for the weight function theory, we calculated the mode III stress intensity factor in a single edge-notched configuration.

• Journal of Korea Multimedia Society
• /
• v.16 no.6
• /
• pp.782-794
• /
• 2013

This paper proposes the wafer position recognition algorithm using camera. First, for eliminating the image distortions caused by the illumination and the irregular camera position, the wafer image is restored as a circle through projective transformation. Next, we use edge detection algorithm to extract the wafer's edge and then apply Generalized Symmetry Transform(GST) to extract a circle. The GST evaluates symmetry between two points by combining a distance weight function, a phase weight function, and a logarithmic mapping of the points' intensities and detecting interest regions. Trough several experiments, we found out the proposed method is able to prevent the cleaning system and the wafer from damaging.

• Transactions of Materials Processing
• /
• v.19 no.6
• /
• pp.337-343
• /
• 2010

Current need of weight reduction in automotive part increases the application for high strength steel (HSS). The various types of high strength steels have been used to produce chassis part, control arms and trailing arms for weight reduction and increasing of fatigue durability such as dual phase steel (DP) and ferrite bainite steel (FB). But, DP and FB steels have proven to show inferiority in durability as well as press formability. Edge cracking occurred often in flange forming and hole expansion processes is the major failure encountered. This paper discussed the behavior of edge stretchability of high strength steel of DP and FB steels. Experimental works have been conducted to study the effect of punch clearance and burr direction on hole expansion ratio (HER). Also finite element simulation (FEM) has been preformed to clarify the mechanism of flange crack and support the experimental results on HER of DP and FB steels. It was simulated the whole process of blanking process following by hole expansion process and ductile fracture criterion named the modified Cockcroft-Latham model which was used to capture the fracture initiation. From the hole expansion tests and FEM simulation studies it was concluded that ferrite bainite steel showed better stretch-flangeability than dual phase steel. It was attributed to the lower work hardening rate of ferrite bainite steel than dual phase steel at the sheared edge.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.32 no.5
• /
• pp.331-339
• /
• 2020

In this study, ways to reduce the edge pressure at the bottom plate of the caisson breakwater were considered. The water depth, freeboard, design wave height and period, and the location of the center of gravity on the super-structure of the breakwater were selected as key design variables that influence the edge pressure, and analyzed how the edge pressure changes according to the change of this key variables. The pressure distribution formulae suggested in the design standard was applied for the calculation of design wave forces. Based on the wave forces, the required effective self-weight of the super-structure and the minimum width of the caisson were determined to have a safety factor of 1.2 against sliding and overturning. From the results, it was found that the edge pressure rapidly increased as the water depth increased, and could exceed the allowable bearing capacity when it reached a certain water depth which is 20 m within the analysis conditions. It was also confirmed that the edge pressure gradually increased linearly as the freeboard increased, but decreased with the increase of the wave height and period. This edge pressure could be significantly reduced up to more than 20% by moving the center of gravity of the super-structure to the seaside, which is 5% of the caisson width. Based on the analysis results and the recently conducted research results, a method was proposed to reduce the edge pressure that can be used in the design.