• Journal of the Korean Society for Heat Treatment
• /
• v.7 no.2
• /
• pp.88-95
• /
• 1994

In order to compare mechanical properties of ausformed martensite with those of marformed martemsite in Fe-30%Ni-0.1%C alloy and to investigate their strengthening mechanisms, ausformed martensite and marformed martensite were prepared by ausforming treatment and marforming treatment respectively. The microstructures were observed and the quantities of retained austenite, hardness, yield strength, ultimate tensile strength and elongation were examined. The strength of ausformed martensite was mainly increased because of the lattice defects inherited from austenite. The ductility of ausformed martensite was constant at the rate of 7-8% by ductile matrix formation of the retained austenite in spite of the increase in strength. The strength of marformed martensite was increased by the increment in dislocation density, the crossing of transformation twin with deformation twin and the mutual crossing of deformation twin. The ductility of mar formed martensite was slightly lower than that of ausformed martensite, but the strength of mar formed martensite was prominently higher.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.3
• /
• pp.95-101
• /
• 2024

The numberlink puzzle(NLP), which non-crossings with other numbers of connection in connecting lines through empty cells between a given pair of numbers, is an NP-complete problem with no known way to solve the puzzle in polynomial time. Until now, arbitrary numbers have been selected and puzzles have been solved using trial-and-error methods. This paper converts empty cells into vertices in lattice graphs connected by edge between adjacent cells for a given problem. Next, a straight line was drawn between the pairs of numbers and divided into groups of numbers where crossing occurred. A bypass route was established to avoid intersection in the cross-number group. Applying the proposed algorithm to 18 benchmarking data showed that the puzzle could be solved with a linear time complexity of O(n) for all data.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.4
• /
• pp.89-97
• /
• 2024

The problem of the spokes puzzle(SP), which connects the spokes(edges) required by the wheel axis (hub, vertex) without intersection to form a network in which all the hubs are connected, can be said to be a wasteland of research. For this problem, there is no algorithm that presents a brute-force search or branch-and-bound method that takes exponential time. This paper proposes an algorithm to plot a lattice graph with cross-diagonal lines of m×n for a given SP and to pruning(delete) the surplus edges(spokes). The proposed algorithm is a simple way to select an edge of a hub whose number of edges matches the hub requirement and delete the edge crossing it. If there is no hub with an edge that meets the hub requirement, a strategy was adopted to preferentially delete(pruning) the edge of the hub with the maximum amount of spare. As a result of applying the proposed algorithm to 20 benchmarking experimental data, it was shown that a solution that minimizes the number of trials and errors can be obtained for all problems.

• Progress in Superconductivity
• /
• v.9 no.2
• /
• pp.140-145
• /
• 2008

We report on the Josephson vortex dynamics in $Bi_2Sr_2CaCuO_{8+\delta}$ natural Josephson junctions by c-axis tunneling measurements. Beside the quasiparticle branches in the current-voltage characteristics, a new set of multiple branches, referred to as Josephson-vortex-flow branches (JVFBs), are observed. The JVFBs emerge in an in-plane magnetic field above $H_0\;=\;{\Phi}_0/{\gamma}s^2$ and show highly hysteretic behavior, which can be explained in terms of the recently proposed dynamic-phase-separation model. In this work we examined the effect on the JVFBs by the presence of pancake vortices generated as the external magnetic field was applied slightly tilted from the in-plane direction. JVFBs were found to become larger and prominent with increasing pancake vortex density as the tilt angle increased, which were presumably caused by slowing down of a Josephson vortex lattice in the presence of pancake vortices.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.4
• /
• pp.99-106
• /
• 2024

The problem of the bridges(Hasjiwokakero, Hasi) puzzle, which connects the bridge(edge) required by the island(vertex) without crossing the horizontal and vertical straight bridges except for the diagonal to form a connected network, is a barren ground for research without any related research. For this problem, there is no algorithm that presents a generalized exponential time brute-force or branch-and-bound method. This paper obtained the initial solution of the lattice graph by drawing a grid without diagonal lines for a given BP, removing unnecessary edges, and supplementing essential bridges. Next, through insufficient island pair path matching, the method of adding insufficient edges to the route and deleting the crossed surplus edges(bridges) was adopted. Applying the proposed algorithm to 24 benchmarking experimental data showed that accurate solutions can be obtained for all problems.