• 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.

• The KIPS Transactions:PartA
• /
• v.13A no.3 s.100
• /
• pp.253-260
• /
• 2006

In this paper, we analyze the Hamiltonian property of Pyramid graphs. We prove that it is always possible to construct a Hamiltonian cycle of length $(4^N-1)/3$ by applying the proposed algorithm to construct series of cycle expansion operations into two adjacent cycles in the Pyramid graph of height N.

• Journal of Welding and Joining
• /
• v.28 no.4
• /
• pp.18-25
• /
• 2010

Super-duplex stainless steels (SDSS) have a good balance of mechanical property and corrosion resistance when they consist of approximately equal amount of austenite and ferrite. The SDSS needs to avoid the detrimental phases such as sigma(${\sigma}$), chi(${\chi}$), secondary austenite(${\gamma}2$), chromium carbide & nitride and to maintain the ratio of ferrite & austenite phase as well known. However, the effects of the subsequent weld thermal cycle were seldom experimentally studied on the micro-structural variation of weldment & pitting corrosion property. Therefore, the present study investigated the effect of the subsequent thermal cycle on the change of weld microstructure and pitting corrosion property at $40^{\circ}C$. The thermal history of root side was measured experimentally and the change of microstructure of weld root & the weight loss by pitting corrosion test were observed as a function of the thermal cycle of each weld layer. The ferrite contents of root weld were reduced with the subsequent weld thermal cycles. The pitting corrosion was occurred in the weld root region in case of the all pitted specimen & in the middle weld layer in some cases. And the weight loss by pitting corrosion was increased in proportional to the time exposed at high temperature of the root weld and also by the decrease of ferrite content. The subsequent weld thermal cycles destroy the phase balance of ferrite & austenite at the root weld. Conclusively, It is thought that as the more subsequent welds were added, the more the phase balance of ferrite & austenite was deviated from equality, therefore the pitting corrosion property was deteriorated by galvanic effect of the two phases and the increase of 2nd phases & grain boundary energy.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.59
• /
• pp.1-10
• /
• 2000

The traveling salesman problem is a representative NP-Complete problem. It needs lots of time to get a solution as the number of city increase. So, we need an efficient heuristic algorithm that gets good solution in a short time. Almost edges that participate in optimal path have somewhat low value cost. This paper discusses the property of nearest neighbor and 3-opt. This paper uses nearest neighbor's property to select candidate edge. Candidate edge is a set of edge that has high probability to improve cycle path. We insert edge that is one of candidate edge into intial cycle path. As two cities are connected. It does not satisfy hamiltonian cycle's rule that every city must be visited and departed only one time. This paper uses 3-opt's method to sustain hamiltonian cycle while inserting edge into cycle path. This paper presents a highly efficient heuristic algorithm verified by numerous experiments.

• The KIPS Transactions:PartA
• /
• v.15A no.2
• /
• pp.119-124
• /
• 2008

In this paper, we analyze a cycle property embedded in pyramid graphs. We prove that it is always possible to construct diverse cycles of all lengths from 3 to ($4^N-1$)/3 by applying series of cycle expansion operations to the pyramid graph of height N. This means that the pyramid graph has the pancyclic property.

• Journal of the Chungcheong Mathematical Society
• /
• v.21 no.2
• /
• pp.259-268
• /
• 2008

To the design of secret key, there are two types of basic approaches called the tame approach and the wild approach. In the tame approach we try to use only simple primitives such as linear feedback shift registers and to prove mathematical theorems about their cryptographic properties. In the wild approach we try to use crazy compositions of operations which mix a variety of domains in a nonlinear and nonalgebraic way. There are several papers which try to bridge this gap by considering semi-wild constructions. A T-function on n-bit words plays an important role in semi-wild constructions. In this paper we study the invertibility and the period of some T-functions. Especially we characterize some polynomials which has a single cycle property.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1464-1473
• /
• 2000

In this paper, we analyze the cycle property of the (n,k)-star graph that has an attention as an alternative interconnection network topology in recent years. Based on the graph-theoretic properties in (n,k)-star graphs, we show the pancyclic property of the graph and also present the corresponding algorithm. Based on the recursive structure of the graph, we present such top-down approach that the resulting cycle can be constructed by applying series of "dimension expansion" operations to a kind of cycles consisting of sub-graphs. This processing naturally leads to such property that the resulting cycles tend to be integrated compactly within some minimal subset of sub-graphs, and also means its applicability of another classes of the disjoint-style cycle problems. This result means not only the graph-theoretic contribution of analyzing the pancyclic property in the underlying graph model but also the parallel processing applications such a as message routing or resource allocation and scheduling in the multi-computer system with the corresponding interconnection network.

• 한국기계연구소 소보
• /
• s.12
• /
• pp.3-10
• /
• 1984

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1474-1481
• /
• 2000

The number of keystream cycle sequences has been proposed as a characteristic of binary sequence generator for cryptographic application, but in general the most of binary sequence generators have a single cycle. On the other hand, S-box has been used to block cipher for a highly nonlinear element and then we apply it to the stream cipher with a high crypto-degree. In this paper, we propose a multiple-cycle binary sequence generator based on S-box which has a high nonlinearity containing SAC property and analyze its period, linear complexity, randomness and the number of keystream cycle sequences.

• Korean Journal of Materials Research
• /
• v.24 no.9
• /
• pp.481-487
• /
• 2014

The effect of alpha phase on the fatigue properties of Fe-29%Ni-17%Co low thermal expansion alloy was investigated. Two kinds of alloys (Base alloy and Alpha alloy) were prepared by controlling the minimal alloy composition. Microstructure observation, tensile, high-cycle fatigue, and low-cycle fatigue results were measured in this study. The Base alloy microstructure showed typical austenite ${\gamma}$ phase. Alpha alloy represented the dispersed phase in the austenite ${\gamma}$ matrix. As a result of tensile testing, Alpha alloy was found to have higher strengths (Y.S. & T.S.) and lower elongation compared to those of the Base alloy. High cycle fatigue results showed that Alpha alloy had a higher fatigue limit (360MPa) than that (330MPa) of the Base alloy. The Alpha alloy exhibited the superior high cycle fatigue property in all of the fatigue stress conditions. SEM fractography results showed that the alpha phase could act to effectively retard both fatigue crack initiation and crack propagation. In the case of low-cycle fatigue, the Base alloy had longer fatigue life in the high plastic strain amplitude region and the Alpha alloy showed better fatigue property only in the low plastic strain amplitude region. The fatigue deformation behavior of the Fe-29%Ni-17%Co alloy was also discussed as related with its microstructure.