• Journal of the Korean Society of Safety
• /
• v.30 no.6
• /
• pp.164-173
• /
• 2015

There exists required safety integrity level (SIL) to assure safety in accordance with international standards for every electrical / electronics / control equipment or systems with safety related functions. The SIL is allocated from lowest level (level 0) to highest level (level 4). In order to guarantee certain safety level that is internationally acceptable, application of methodology for SIL allocation and demonstration based on related international standards is required. However, application standard differs from every industry in domestic or international for application on mythology for allocation and demonstration of SIL. Application or assessment is not easy since absence on clear criteria or common definition. This research studied not only fundamental concept of SIL required to guarantee safety in accordance with international standards for safety related equipment and system, but different types of methodologies for SIL allocation. Specifically, SIL allocation for Platform Screen Door system of railway is studied applying methodology of severity of accidents and risk graph among different methodologies for SIL allocation.

• Journal of Broadcast Engineering
• /
• v.1 no.1
• /
• pp.74-83
• /
• 1996

In this paper, an effective color image retrieval algorithm is proposed based on the graph representation. Also we propose a color constancy algorithm to remove the effect of illumination change. Illumination condition of an image can be transformed to that of reference image using the proposed color constancy algorithm, so that the effect of dirrerent lighting is significantly alleviated. Then, we represent a color image as a graph with several nodes and edges in the histogram space, and finally two images are matched by compared two graphs representing them. The simulation results show that the proposed 3-step algorithm performs well for various conditions, including different lighting, translation, rotation, and scaling of the object in the image. In addition, the proposed algorithm is very fast compared to the geometry-based matching technique.

• School Mathematics
• /
• v.7 no.4
• /
• pp.353-373
• /
• 2005

The purpose of this paper is to analysis the basic network problem which can be applied to the mathematically gifted students in elementary school. Mainly, we discuss didactic transpositions of the double counting principle, the game of sprouts, Eulerian graph problem, and the minimum connector problem. Here the double counting principle is related to the handshaking lemma; in any graph, the sum of all the vertex-degree is equal to the number of edges. The selection of these subjects are based on the viewpoint; to familiar to graph theory, to raise algorithmic thinking, to apply to the real-world problem. The theoretical background of didactic transpositions of these subjects are based on the Polya's mathematical heuristics and Lakatos's philosophy of mathematics; quasi-empirical, proofs and refutations as a logic of mathematical discovery.

• Journal of Information Processing Systems
• /
• v.15 no.6
• /
• pp.1365-1377
• /
• 2019

Summarizing the differences in Chinese-Vietnamese bilingual news plays an important supporting role in the comparative analysis of news views between China and Vietnam. Aiming at cross-language problems in the analysis of the differences between Chinese and Vietnamese bilingual news, we propose a new method of summarizing the differences based on an undirected graph model. The method extracts elements to represent the sentences, and builds a bridge between different languages based on Wikipedia's multilingual concept description page. Firstly, we calculate the similarity between Chinese and Vietnamese news sentences, and filter the bilingual sentences accordingly. Then we use the filtered sentences as nodes and the similarity grade as the weight of the edge to construct an undirected graph model. Finally, combining the random walk algorithm, the weight of the node is calculated according to the weight of the edge, and sentences with highest weight can be extracted as the difference summary. The experiment results show that our proposed approach achieved the highest score of 0.1837 on the annotated test set, which outperforms the state-of-the-art summarization models.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.11
• /
• pp.2051-2057
• /
• 2007

In Oriental medicine, the status of a tongue is the important indicator to diagnose one's health like physiological and clinicopathological changes of inner parts of the body. The method of tongue diagnosis is not only convenient but also non-invasive and widely used in Oriental medicine. However, tongue diagnosis is affected by examination circumstances a lot like a light source, patient's posture and doctor's condition. To develop an automatic tongue diagnosis system for an objective and standardized diagnosis, segmenting a tongue is inevitable but difficult since the colors of a tongue, lips and skin in a mouth are similar. The proposed method includes preprocessing, graph-based over-segmentation, detecting positions with a local minimum over shading, detecting edge with color difference and estimating edge geometry from the probable structure of a tongue, where preprocessing performs down-sampling to reduce computation time, histogram equalization and edge enhancement. A tongue was segmented from a face image with a tongue from a digital tongue diagnosis system by the proposed method. According to three oriental medical doctors' evaluation, it produced the segmented region to include effective information and exclude a non-tongue region. It can be used to make an objective and standardized diagnosis.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.10 no.5
• /
• pp.281-296
• /
• 2015

This paper describes a novel disaster evacuation system using embedded systems such as smart devices for crisis and emergency management. In indoor environments deployed with the Bluetooth Low Energy(BLE) beacons, smart devices detect their indoor positions from beacon messages and interact with Map Server(MS) and Route Server(RS) in the Internet over the LTE and/or Wi-Fi functions. The MS and RS generate an optimal path to the nearest emergency exit based on a novel graph generation method for less route computation, called the Disaster Evacuation Graph(DEG), for each smart device. The DEG also enables efficient processing of some constraints in the computation of route, such as load balancing in situation of different capacities of paths or exits. All data interfaces among three system components, the MS, RS, smart devices, have been defined for modular implementation of our disaster evacuation system. Our experimental system has been deployed and tested in our building thoroughly and gives a good evidence that the modular design of the system and a novel approach to compute emergency route based on the DEG is competitive and viable.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.3
• /
• pp.437-444
• /
• 2014

In this paper, we introduce a Graph based Binary Code Execution Path Exploration Platform. In the graph, a node is defined as a conditional branch instruction, and an edge is defined as the other instructions. We implemented prototype of the proposed method and works well on real binary code. Experimental results show proposed method correctly explores execution path of target binary code. We expect our method can help Software Assurance, Secure Programming, and Malware Analysis more correct and efficient.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.8
• /
• pp.1774-1779
• /
• 2005

This paper propose the design method of the constructing the digital logic systems over galois fields using by the galois field decision diagram(GFDD) that is based on the graph theory. The proposed design method is as following. First of all, we discuss the mathematical properties of the galois fields and the basic properties of the graph theory. After we discuss the operational domain and the functional domain, we obtain the transformation matrixes, $\psi$GF(P)(1) and $\xi$GF(P)(1), in the case of one variable, that easily manipulate the relationship between two domains. And we extend above transformation matrixes to n-variable case, we obtain $\psi$GF(P)(1) and $\xi$GF(P)(1). We discuss the Reed-Muller expansion in order to obtain the digital switching functions of the P-valued single variable. And for the purpose of the extend above Reed-Muller expansion to more two variables, we describe the Kronecker product arithmetic operation.

• Journal of KIISE:Databases
• /
• v.32 no.6
• /
• pp.585-592
• /
• 2005

The Semantic Web is being studied as the next step in the evolution of the web. In the environment of the Semantic Web, the information must be understandable computers as well as a just human. So we use ontologies for describing the contents of the web resources. Among such ontologies, OWL is proposed as a recommendation by W3C. OWL data is represented as graph structure and the query is evaluated by traversing each node of the graph. In this paper, we propose the optimization technique based on signature to efficiently process the OWL data. Our approach minimizes traversing each node of the graph in query processing.

• The KIPS Transactions:PartA
• /
• v.13A no.2 s.99
• /
• pp.163-170
• /
• 2006

Most scheduling problems including DAG(Directed Acyclic Graph)-based are known to be NP-complete, so many heuristic-based scheduling algorithms have been researched. HEFT and CPOP are such algorithms which have been devised to be effective in heterogeneous environment. We proposed, in the previous research, three scheduling algorithms which are effective in realistic global heterogeneous environment: CPOC, eCPOPC and eCPOP. In this paper, the heuristics which are used in the above five algorithms will be systematically analyzed. Those algorithms will be also studied experimentally using various benchmarks. Experimental results show that the eCPOC generates better schedules than any other algorithms and the heuristics which are used in the proposed algorithms are effective in the global heterogeneous environment.