• Journal of the Korean Institute of Gas
• /
• v.25 no.3
• /
• pp.9-15
• /
• 2021

In this paper, a study on the construction of a knowledge base based on natural language processing and the design of a chemical substance estimation system for the development of a knowledge service for a real-time sensor information fusion detection system and symptoms of contact with chemical substances in industrial sites. The information on 499 chemical substances contact symptoms from the Wireless Information System for Emergency Responders(WISER) program provided by the National Institutes of Health(NIH) in the United States was used as a reference. AllegroGraph 7.0.1 was used, input triples are Cas No., Synonyms, Symptom, SMILES, InChl, and Formula. As a result of establishing the knowledge base, it was confirmed that 39 symptoms based on ammonia (CAS No: 7664-41-7) were the same as those of the WISER program. Through this, a method of establishing was proposed knowledge base for the symptom extraction process of the chemical substance estimation system.

• Journal of Internet of Things and Convergence
• /
• v.8 no.2
• /
• pp.55-59
• /
• 2022

Recently, IoT technology has great attention and plays a key role in 4^th industrial revolution in order to design customized products and services. Additive Manufacturing (AM) is applied to fabricate IoT sensor directly or IoT sensor embedded structure. Also, design methods for AM are developing to consolidate various parts of IoT devices. Part consolidation leads to assembly time and cost reduction, reliability improvement, and lightweight. Therefore, a design method was proposed to guide designers to consolidate parts. The design method helps designers to define product architecture that consists of functions and function-part relations. The product architecture is converted to a network graph and then Girvan Newman algorithm is applied to cluster the graph network. Parts in clusters are candidates for part consolidation. To demonstrate the usefulness of the proposed design method, a case study was performed with e-bike fabricated by additive manufacturing.

• Journal of Korean Society for Quality Management
• /
• v.50 no.3
• /
• pp.473-490
• /
• 2022

Purpose: The purpose of this study is to propose a new useful suggestion to monitor the stability of process by developing a stability ratio or index related to investigating how well the process is controlled or operated to the specified target. Methods: The proposed method to monitor the stability of process is building up a new measure index which is making up for the weakness of the existing index in terms of short or long term period of production. This new index is a combined one considering both stability and capability of process to the specification limits. We suppose that both process mean and process variation(or deviation) are changing on time period. Results: The results of this study are as follows: regarding the stability of process as well as capability of process, it was shown that two indices, called SI(stability index) and PI(performance index), can be expressed in two-dimensional X-Y graph simultaneously. This graph is categorized as 4 separated partitions, which are characterized by its numerical value intervals of SI and PI which are evaluated by test statistics. Conclusion: The new revised index is more robust than the existing one in investigating the stability of process in terms of short and long period of production, even in case both process mean and variation are changing.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.8
• /
• pp.135-142
• /
• 2022

In this paper, we propose a graph-based user route control for rapidly conducting virus inspections in emergency situations (eg, COVID-19) and a framework that can simulate this on a city map. A^* and navigation mesh data structures, which are widely used pathfinding algorithms in virtual environments, are effective when applied to CS(Computer science) problems that control Agents in virtual environments because they guide only a fixed static movement path. However, it is not enough to solve the problem by applying it to the real COVID-19 environment. In particular, there are many situations to consider, such as the actual road traffic situation, the size of the hospital, the number of patients moved, and the patient processing time, rather than using only a short distance to receive a fast virus inspection.

• Journal of the Korean Society for information Management
• /
• v.40 no.4
• /
• pp.329-349
• /
• 2023

With the rapid development of information and communication technology, the speed of data production has increased rapidly, and this is represented by the concept of big data. Discussions on quality and reliability are also underway for big data whose data scale has rapidly increased in a short period of time. On the other hand, small data is minimal data of excellent quality and means data necessary for a specific problem situation. In the field of culture and arts, data of various types and topics exist, and research using big data technology is being conducted. However, research on whether basic information about culture and arts institutions is accurately provided and utilized is insufficient. The basic information of an institution can be an essential basis used in most big data analysis and becomes a starting point for identifying an institution. This study collected data dealing with the basic information of culture and arts institutions to define common metadata and constructed small data in the form of a knowledge graph linking institutions around common metadata. This can be a way to explore the types and characteristics of culture and arts institutions in an integrated way.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.7
• /
• pp.85-93
• /
• 2011

The Vertex Coloring Problem hasn't been solved in polynomial time, so this problem has been known as NP-complete. This paper suggests linear time algorithm for Vertex Coloring Problem (VCP). The proposed algorithm is based on assumption that we can't know a priori the minimum chromatic number ${\chi}(G)$=k for graph G=(V,E) This algorithm divides Vertices V of graph into two parts as independent sets $\overline{C}$ and cover set C, then assigns the color to $\overline{C}$. The element of independent sets $\overline{C}$ is a vertex ${\upsilon}$ that has minimum degree ${\delta}(G)$ and the elements of cover set C are the vertices ${\upsilon}$ that is adjacent to ${\upsilon}$. The reduced graph is divided into independent sets $\overline{C}$ and cover set C again until no edge is in a cover set C. As a result of experiments, this algorithm finds the ${\chi}(G)$=k perfectly for 26 Graphs that shows the number of selecting ${\upsilon}$ is less than the number of vertices n.

• Korean journal of applied entomology
• /
• v.44 no.3 s.140
• /
• pp.177-187
• /
• 2005

For the comparison of feeding behavior of Nilaparvata lugens among different rice varieties, electrical penetration graph (EPG) technique was used. Ten rice varieties were selected from national-widely recommended rice varieties cultivating in Chungnam province. The correlation between feeding duration and honeydew amount excreted was investigated, and the types of EPG pattern were analyzed among rice varieties. The EPG patterns divided into 6 types according to electrical specific feature, respectively. Type 1 pattern was a searching feeding sites, resting or wandering on a rice plant. Type 2 pattern was appeared when the insect untaken from phloem sieve element. Type 3 pattern was observed when the insect piercing into the rice plant. Type 4 pattern was observed when the insect salivating in rice plant. Type 5 pattern was observed when the insect ingesting from the xylem. Type 6 pattern was observed when the stylet moving in cell. Feeding duration time on Gum-nam was significantly shorter than Dong-jin, Dae-ahn, Dong-ahn, Dae-san. Also, on Gun-nam, it was shown that the brown planthopper did not penetrate the cuticle for a long time. The total number of excreted honeydew droplets by the brown planthopper was the greatest in Dong-jin variety and the least in Gum-nam variety. In proportion to phloem feeding time, the number of honeydew droplets had been increased. According to the results of EPG patterns and honeydew droplets analysis, N. lugens seems to prefer Dong-jin, Dong-ahn, Dae-san, and Dae-ahn to Gum-nam, Da-san, and Nam-chun rice plant variety.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.2
• /
• pp.257-264
• /
• 2007

In order to obtain a fine picture, a camera has many convenient functions. Its representative functions are Auto Focus(AF), Auto White Balance(AWB) and Auto Exposure(AE). In this paper, we present the new algorithm of Auto Exposure control system, one of its useful functions The proposed algorithm of Auto Exposure control system is based on IIR Filter with Variable Time Constant. First, in order to establish the standards of exposure control, we compare change of the picture luminance with luminance of an object in the Zone system. Second, we make an ideal characteristic graph of luminance by using the results. Finally, we can find the value of the right exposure by comparing an ideal characteristic graph of the luminance with the value of the current expose of a scene. We can find an appropriate exposure as comparing the ideal characteristic graph of the luminance with current exposure of a scene. In order to find a suitable exposure state, we make use of IIR Filter instead of a conventional method using micro-controller. In this paper, the proposed system has therefore simple structure, we use it for compact image sensor module used in the handheld device.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.1
• /
• pp.37-42
• /
• 2024

This paper suggests polynomial time algorithm for cutwidth minimization problem that classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. To find the minimum cutwidth CW_f(G)=max_𝜈∈_VCW_f(𝜈)for given graph G=(V,E),m=｜V｜, n=｜E｜, the proposed algorithm divides neighborhood N_G[𝜈_i] of the maximum degree vertex 𝜈_i in graph G into left and right and decides the vertical cut plane with minimum number of edges pass through the vertex 𝜈_i firstly. Then, we split the left and right N_G[𝜈_i] into horizontal sections with minimum pass through edges. Secondly, the inner-section vertices are connected into line graph and the inter-section lines are connected by one line layout. Finally, we perform the optimization process in order to obtain the minimum cutwidth using vertex moving method. Though the proposed algorithm requires O(n²) time complexity, that can be obtains the optimal solutions for all of various experimental data

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1998.10a
• /
• pp.655-662
• /
• 1998

This paper is on the anlaysis for real-time software requirement . This method can be used for TNPIN(Timed Numerical Petri Net) as a easy communication means with a real-users. It is based on the RTTL(Real Time Temporal Logic) for correctness fo the system. TNPN is used to represent a behavior specification language, the validity of specified behaviors in TNPN is expressed in RTTL , and analyzed through the reachability graph. Thus , the requirement of between user and system is satisfied. By the example of shared track, the validity of the property of real-time (safetiness, responsiveness, liveness, priority) is verified. Also, this framework is give to connection with a object natually.