• Journal of the Society of Naval Architects of Korea
• /
• v.38 no.2
• /
• pp.79-86
• /
• 2001

This study shows an attempt to generate an assembly sequence and its model for a ship block assembly using the graph theory and graph algorithms. To generate the ship block assembly, we propose four levels of the ship block assembly model such as "geometry mode1", "relational model", "sequential mode1", and "hierarchical model". To obtain the relational model, we used surface and surface intersection algorithm. The sequential model that represents a possible assembly sequence is made by using several graph algorithms from the relational model. The hierarchical model will be constructed from the sequential model in order to represent the block assembly tree and so forth. The purpose of the hierarchical model is to define an assembly tree and to generate the Bill Of Material(BOM). Lastly, the validity of the method proposed in this study is examined with application to ship block assembly models of a single type and double type according to four models mentioned above.

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.329-336
• /
• 1998

The class of doubly chordal graphs is a subclass of chordal graphs and a superclass of strongly chordal graphs which arise in so many application areas. Many optimization problems like domination and Steiner tree are NP-complete on chordal graps but can be solved in polynomial time on doubly chordal graphs. The central to designing efficient algorithms for doulby chordal graphs is the concept of (canonical)doubly perfect elimination orderings. We present linear time algorithms to compute a (canonical) double perfect elimination ordering of a doubly chordal graph.

• Kyungpook Mathematical Journal
• /
• v.48 no.3
• /
• pp.337-357
• /
• 2008

We enumerate all algebraic tangles of seven crossings or less up to equivalence. These tangles are mutually distinguished by the corresponding links and their double. The result will be used for enumerating $\theta$-curves and handcuff graphs in a forthcoming paper.

• Journal of Astronomy and Space Sciences
• /
• v.40 no.4
• /
• pp.259-266
• /
• 2023

The Standard Model (SM) does not provide an information for 26% of dark matter of the universe. In the dark sector, dark matter is supposed to be linked with the hypothetical particles called dark photons that have similar role to photons in electromagnetic interaction in the SM. Besides astronomical observation, there are studies to find dark matter candidates using accelerators. In this paper, we searched for dark photons using future electron-positron colliders, including Circular Electron Positron Collider (CEPC)/CEPC, Future Circular Collider (FCC-ee)/Innovative Detector for Electron-positron Accelerator (IDEA), and International Linear Collider (ILC)/International Large Detector (ILD). Using the parameterized response of the detector simulation of Delphes, we studied the sensitivity of a double dark photon mode at each accelerator/detector. The signal mode is double dark photon decay channel, e⁺e^- → A'A', where A' (dark photon with spin 1) decaying into a muon pair. We used MadGraph5 to generate Monte Carlo (MC) events by means of a Simplified Model. We found the dark photon mass at which the cross-sections were the highest for each accelerator to obtain the maximum number of events. In this paper we show the expected number of dark photon signal events and the detector efficiency of each accelerator. The results of this study can facilitate in the dark photon search by future electron-positron accelerators.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.5
• /
• pp.38-45
• /
• 2012

Finding shortest paths on time dependent networks is an important task for scheduling and routing plan and real-time navigation system in ITS. In this research, one-to-one time dependent shortest path algorithms based on link flow speeds on urban networks are proposed. For this work, first we select three general shortest path algorithms such as Graph growth algorithm with two queues, Dijkstra's algorithm with approximate buckets and Dijkstra's algorithm with double buckets. These algorithms were developed to compute shortest distance paths from one node to all nodes in a network and have proven to be fast and efficient algorithms in real networks. These algorithms are extended to compute a time dependent shortest path from an origin node to a destination node in real urban networks. Three extended algorithms are implemented on a data set from real urban networks to test and evaluate three algorithms. A data set consists of 4 urban street networks for Anaheim, CA, Baltimore, MD, Chicago, IL, and Philadelphia, PA. Based on the computational results, among the three algorithms for TDSP, the extended Dijkstra's algorithm with double buckets is recommended to solve one-to-one time dependent shortest path for urban street networks.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.2
• /
• pp.335-341
• /
• 2017

This paper proposes an image-processing algorithm for inspecting double-cut defects in the motor shaft manufacturing process. The algorithm consists of extracting the outline using the brightness of the image, obtaining a binarized boundary graph using the extracted outline, and determining the defects from the graph. Defects in which two cut surfaces are separated are considered type 1 defects, and those in which two cut surfaces are connected are defined as type 2 defects. In an actual manufacturing process, 112 good samples and 44 defective samples (34 type 1 defects and 10 type 2 defects) were collected and used to verify the algorithm. The samples were judged with 100% accuracy for both type 1 and type 2 defects. The algorithm will be used in the field after securing reliability for various samples.

• Honam Mathematical Journal
• /
• v.41 no.3
• /
• pp.595-607
• /
• 2019

We consider quasigroups $Q({\Gamma})$ obtained as certain double covers of the symmetric group $S_3$ of degree 3, for directed graphs ${\Gamma}$ on the vertex set $S_3$. We completely characterize the strong compatibility of elements of $Q({\Gamma})$ for any quasigroup nonuniform homogeneous space of degree 4. For such homogeneous spaces, we classify all the strong and weak compatibility graphs of $Q({\Gamma})$.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.2
• /
• pp.11-23
• /
• 2011

In this paper, an accurate and fully automatic video object segmentation method is proposed for video conferencing systems in which the real-time performance is required. The proposed method consists of two steps: 1) accurate object extraction on the initial frame, 2) real-time object extraction from the next frame using the result of the first step. Object extraction on the initial frame starts with generating a cumulative edge map obtained from frame differences in the beginning. This is because we can estimate the initial shape of the foreground object from the cumulative motion. This estimated shape is used to assign the seeds for both object and background, which are needed for Graph-Cut segmentation. Once the foreground object is extracted by Graph-Cut segmentation, real-time object extraction is conducted using the extracted object and the double edge map obtained from the difference between two successive frames. Experimental results show that the proposed method is suitable for real-time processing even in VGA resolution videos contrary to previous methods, being a useful tool for immersive video conferencing systems.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.8
• /
• pp.426-431
• /
• 2005

A many-to-many k-disjoint path cover (k-DPC) of a graph G is a set of k disjoint paths joining k distinct source-sink pairs in which each vertex of G is covered by a path. In this paper, we investigate many-to-many 2-DPC in a double loop network G(mn;1,m), and show that every nonbipartite G(mn;1,m), $m{\geq}3$, has 2-DPC joining any two source-sink pairs of vertices and that every bipartite G(mn;1,m) has 2-DPC joining any two source-sink pairs of black-white vertices and joining any Pairs of black-black and white-white vertices. G(mn;l,m) is bipartite if and only if n is odd and n is even.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.18 no.7
• /
• pp.698-703
• /
• 2007

In this paper, a novel impedance tuner using a directional coupler is proposed. The design topology is analyzed by signal flow graph(SFG) and shows advantages compared with conventional single and double stub methods from the view points of easy implementation and wide tuning range, respectively. This impedance tuner consists of ten switches and its $2^{10}$ tuning points are distributed uniformly on the whole Smith chart. The measured maximum magnitude of the reflection coefficient is 0.9. And the fabricated impedance tuner has a wide bandwidth from 1.8 to 2.2 GHz. Using this impedance tuner, we did a load-pull measurement of a power transistor.