• Journal of applied mathematics & informatics
• /
• v.39 no.1_2
• /
• pp.13-29
• /
• 2021

For a graph G = (V, E), a vertex coloring (or, simply, a coloring) of G is a function C : V (G) → {1, 2, …, k} (using the non-negative integers {1, 2, …, k} as colors). We say that a coloring of a graph G is injective if for every vertex v ∈ V (G), all the neighbors of v are assigned with distinct colors. The injective chromatic number χi(G) of a graph G is the least k such that there is an injective k-coloring [6]. In this paper, we study a natural variation of the injective coloring problem: coloring the edges of a graph under the same constraints (alternatively, to investigate the injective chromatic number of line graphs), we define the k- injective edge coloring of a graph G as a mapping C : E(G) → {1, 2, …, k}, such that for every edge e ∈ E(G), all the neighbors edges of e are assigned with distinct colors. The injective chromatic index χ′in(G) of G is the least positive integer k such that G has k- injective edge coloring, exact values of the injective chromatic index of different families of graphs are obtained, some related results and bounds are established. Finally, we define the injective clique number ωin and state a conjecture, that, for any graph G, ωin ≤ χ′in(G) ≤ ωin + 2.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.10
• /
• pp.120-129
• /
• 1996

This paper presents an efficient block segmentation and classification using the edge information of the document image. We extract four prominent features form the edge gradient and orientaton, all of which, and thereby the block clssifications, are insensitive to the background noise and the brightness variation of of the image. Using these four features, we can efficiently classify a document image into the seven categrories of blocks of small-size letters, large-size letters, tables, equations, flow-charts, graphs, and photographs, the first five of which are text blocks which are character-recognizable, and the last two are non-character blocks. By introducing the clumn interval and text line intervals of the document in the determination of th erun length of CRLA (constrained run length algorithm), we can obtain an efficient block segmentation with reduced memory size. The simulation results show that the proposed algorithm can rigidly segment and classify the blocks of the documents into the above mentioned seven categories and classification performance is high enough for all the categories except for the graphs with too much variations.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.1
• /
• pp.99-103
• /
• 2012

The electromagnetic topology and the BLT equation has been used as useful techniques to analyze coupling effects of huge devices. But in the case of systems including complex parts, applying the BLT equation can be difficult to manifest the complex parts with analytic solutions. To resolve this problem, a numerical method can be used to parts of the whole system in advance. In this paper, a microstrip line filter is analyzed using the BLT equation combined with numerical solutions. Consequently, achieved graphs from the BLT equation show good agreements with graphs obtained using a numerical method only.

• Journal of Korean Elementary Science Education
• /
• v.31 no.3
• /
• pp.321-333
• /
• 2012

The purpose of this study was to examine elementary school students' characteristics and difficulties in drawing and interpreting a line graph, and to present educational implications. Twenty five students(4th grader: 6, 5th grader: 9, and 6th grader: 10) at an elementary school participated in this study. We used a student's task which was about graphing on a given data table and interpreting his/her graph. The data table was on heating 200mL and 500mL of water and measuring their temperature at regular time intervals. We collected multiple source of data, and data analyzed based on the sub-variables of TOGS. The some results of this study are as follows: First, five children (20.0%), especially two of 10 sixth graders (20.0%), could not construct a line graph about a given data table. Second, twenty students (80.0%) had the ability on 'Scaling axes' and on 'Assigning variables to the axes', however, only a student understood why the time is on the longitudinal axis and the temperature is on the vertical axis. Third, in the case of 'Plotting points', twelve children (48.0%) could drew two graphs on a coordinate. Fourth, in the case of 'Selecting the corresponding value for Y (or X)', twenty student had little difficulty. on 'Describing the relationship between variables', seventeen students (68.0%) understood the relationship between time and temperature of water, and the relationship between temperature and amount of water. Finally, eleven students (44%) had the ability on 'Interrelating and extrapolation graphs.' Educational implications are also presented in this paper.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.6
• /
• pp.57-65
• /
• 2019

In this paper, we study on finding the rail space in elevators by analyzing each image captured with CCD camera. We propose a method that applies one-dimensional matched filter to the pixels of a selected search space in the vertical line at a horizontal position and decides the position with the thickness of the space being represented by a black thick line in captured images. The pattern similarity representing how strongly the associated image pixels resemble with the thick line is defined and calculated with respect to each position along the vertical line of pixels. The position and thickness of the line are decided from the point having the maximum in pattern similarity graph. In the experiments of the proposed method under different illuminational conditions, it is observed that all the pattern similarity graphs show similar shape around door area independent of the conditions and the method can effectively detect the rail space if the rails are illuminated with even weak light. The method can be used for real-time embedded systems because of its simple algorithm, in which it is implemented in simple structure of program with small amount of operations in comparison with the conventional approaches using Canny edge detection and Hough transform.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.14 no.4
• /
• pp.401-412
• /
• 2003

In this paper, a broadband phase shifter structure using a new switched network was proposed. A new reference network is composed of coupled lines and 45$^{\circ}$open and short stubs, which are shunted at the edge points of a main line, respectively, A delay network is composed of only a standard transmission line. It is possible to design a broadband 180$^{\circ}$phase shifter that phase dispersive characteristics by an impedance ratio R of coupled lines and greater phase dispersive characteristics by characteristic impedances Zm, Zs of a main line and stubs are used together. By considering a structure symmetry, the even and odd mode analysis was performed to obtain theoretical S-parameters of the proposed phase shifter. Also, through computer simulation on the basis of derived equations, design graphs were presented to optimally design a 180$^{\circ}$broadband phase shifter. Design graphs provide the values of characteristic impedances Zm, Zs, and I/O match and phase bandwidths. To verify electrical performances of the broadband phase shifter proposed in this paper, low different 180$^{\circ}$phase shifters, operated at the center frequency 3 GHz were designed and fabricated using design graphs, and were experimented. One of them was designed as a standard Schiffman structure to compare with electrical performances. Measured results of each phase shifter to satisfy simultaneously design conditions of I/O match （VSWR=1.15:1) and maximum phase deviation $({\varepsilon}_{{\Delta}{\phi}}＝{\pm}2^{\circ})$ were well in agreement with corresponding simulation results over impedance match and phase error bandwidths, and showed broadband characteristics.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.11
• /
• pp.1571-1576
• /
• 2022

This study aims to analyze the interest of modern people in non-face-to-face medical counseling in the medical industrys. Big data was collected on two social platforms, 지식인, a platform that allows experts to receive medical counseling, and YouTube. In addition to the top five keywords of telephone counseling, "internal medicine", "general medicine", "department of neurology", "department of mental health", and "pediatrics", a data set was built from each platform with a total of eight search terms: "specialist", "medical counseling", and "health information". Afterwards, pre-processing processes such as morpheme classification, disease extraction, and normalization were performed based on the crawled data. Data was visualized with word clouds, broken line graphs, quarterly graphs, and bar graphs by disease frequency based on word frequency. An emotional classification model was constructed only for YouTube data, and the performance of GRU and BERT-based models was compared.

• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.4
• /
• pp.381-388
• /
• 1997

This paper proposes a heuristic algorithm to efficiently perform line balancing in the PCB assembly line including multiple surface mounters efficiently. Generally, the problems in line balancing are classified into two kinds. Firstly, is the determining of the minimum number of machines required for achieving the desired production rate. Secondly, is the assign of jobs to multiple machines in order to minimize the cycle time which is defined as a maximum among the working times of machines when the number of machines is fixed. In this paper, we deal with the latter. We consider a PCB assembly line, including the multiple surface mounters arranged serially as a target system. Also, the conveyor is assumed to move at a constant speed and have no buffer. Considering that the minimum number of machines required for the desired production rate is a discrete nonincreasing function which is inversely proportional to the cycle time, we propose an optimization algorithm for line balancing by using the binary search method. The algorithm is validated through computer simulation, the results of which show that their shapes coincide nearly with those of optimal line balancing efficiency graphs regardless of the number of components, the performance of surface mounters, and the structure of assembly line.

• Phonetics and Speech Sciences
• /
• v.5 no.1
• /
• pp.91-98
• /
• 2013

This paper investigated Korean prosody as it relates to graded internal structure in an identification function. Within Korean prosody, variants regarded as dialectal variations can appear as different prosodic scales, which contain the range of within-category variations. The current experiment was intended to show how the prosodic scale corresponding to the range of within-category differences relates to f0 contours for speakers of two Korean dialects, North Kyungsang and South Cholla. In an identification task, participants responded by selecting an item from two answer choices. The probability of choosing the correct response from the two choices was computed by a logistic regression analysis using intercepts and slopes. That is, the correct response between two choices was used to show a linear line with an s-shape presentation. In this paper, to investigate the graded internal structure of labeling, 25%, 50%, and 75% of predicted probability were assessed. Listeners from North Kyungsang showed progressive variations, whereas listeners from South Cholla revealed random patterns in the internal structure of the identification function. In this paper, the results were plotted using scatterplot graphs, applying the range of within-category variation and predicted probability obtained from the logistic regression analyses. The scatterplot graphs showed the different degree of the responses for f0 scales (i.e., variations within categories). The results demonstrate that the gradient structures of native pitch accent users become more progressive in response to f0 scales.

• Journal of Information Technology Applications and Management
• /
• v.17 no.1
• /
• pp.11-33
• /
• 2010

The majority of graphs and visuals made publicly available by Thai listed companies tend to be disjointed and minimal. Only a little over fifty percent of the total 478 companies included graphic representations of their business operations and performance in the form of two or three dimensional spreadsheet based graphs in their annual reports, investor relations documents, websites and so on. For novice users, these visual representations are unlikely to give the big picture of what is the company's financial position and performance. Neither will they tell where the company stands in its own operating environment. The existing graphics and visuals, in very rare cases, can provide a sense of the company's future outlook. For boundary users such as audit committees whose duty is to promote good governance through transparency and disclosure, preliminary interview results show that there is some doubt as to whether the inclusion of big-picture visuals can really be of use to minority shareholders. These boundary users expect to see more insightful visuals beyond those produced by traditional spreadsheets which will enable them to learn to cope with the on-going turbulence in today's business environment more quickly. However, the debate is still going on as to where to draw the line between internal or external reporting visuals.