• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.51-59
• /
• 2014

This paper suggests a method of lessening number of a graph's edges population in order to rapidly obtain the minimum spanning tree. The present minimum spanning tree algorithm works on all the edges of the graph. However, the suggested algorithm reduces the edges population size by means of applying a method of deleting maximum weight edges in advance from vertices with more than 2 valencies. Next, it applies a stopping criterion which ideally terminates Borůvka, Prim, Kruskal and Reverse-Delete algorithms for reduced edges population. On applying the suggested algorithm to 9 graphs, it was able to minimize averagely 83% of the edges that do not become MST. In addition, comparing to the original graph, edges are turned out to be lessened 38% by Borůvka, 37% by Prim, 39% by Kruskal and 73% by Reverse-Delete algorithm, and thereby the minimum spanning tree is obtained promptly.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.289-293
• /
• 2000

We propose two new algorithms for parallelism-independent scheduling. The machine code generated from the compiler using these algorithms in its scheduling phase is parallelism-independent code, executable in minimum time regardless of the number of the processors in the parallel computer. Our new algorithms have the following phases: finding the minimum number of processors on which the program can be executed in minimal time, scheduling by an heuristic algorithm for this predefined number of processors, and serialization of the parallel schedule according to the earliest start time of the tasks. At run time tasks are taken from the serialized schedule and assigned to the processor which allows the earliest start time of the task. The order of the tasks decided at compile time is not changed at run time regardless of the number of the available processors which means there is no out-of-order issue and execution. The scheduling is done predominantly at compile time and dynamic scheduling is minimized and diminished to allocation of the tasks to the processors. We evaluate the proposed algorithms by comparing them in terms of schedule length to the CP/MISF algorithm. For performance evaluation we use both randomly generated DAGs (directed acyclic graphs) and DACs representing real applications. From practical point of view, the algorithms we propose can be successfully used for scheduling programs for in-order superscalar processors and shared memory multiprocessor systems. Superscalar processors with any number of functional units can execute the parallelism-independent code in minimum time without necessity for dynamic scheduling and out-of-order issue hardware. This means that the use of our algorithms will lead to reducing the complexity of the hardware of the processors and the run-time overhead related to the dynamic scheduling.

• Journal of the Korean Geographical Society
• /
• v.44 no.3
• /
• pp.410-427
• /
• 2009

This study aims to rethink the meaning of graphicacy, discuss the possible criteria to evaluate the level of graphicacy, and show how the graphicacy differs through different grades. First, it finds that as school grades advance, implicit information processing abilities, and conceptual information processing abilities were more required comparing to explicit information processing abilities, when interpreting graphic data. Secondly, the percentage of items which examinee showed a proficient level, decreased as school grades advanced. Thirdly, the graphicacy level of sixth graders was the status of being able to derive explicit information from pictorial maps and read implicit information in simple contour map or line graphs. Ninth graders were able to infer causal relationship between geographic phenomenons by utilizing graphic materials. Tenth graders could read graphic materials by utilizing simple knowledge and experience.

• Earthquakes and Structures
• /
• v.9 no.3
• /
• pp.657-671
• /
• 2015

The level of ductility is determined by depending on the intended use of the building, the region's seismic characteristics and the type of structural system when buildings are planned by engineers. Major portion of seismic energy is intended to be consumed in the plastic zone in structural systems of high ductility, so the occurrence of damages in load bearing and non-load bearing structural elements is accepted in planning stage under severe earthquakes. However, these damages must be limited among specific values in order not to endanger buildings in terms of the bearing capacity. Isolators placed between the basement and upper structure make buildings behave elastically by reducing the effects of seismic loads and improving seismic performance of building significantly. Thus, damages can be limited among desired values. In this study, the effectiveness of seismic isolation is investigated on both fixed based and seismic isolated models of a hospital building with high ductility level with regard to lateral displacements, internal forces, structural periods and cost of the building. Layered rubber bearings are interposed between the base of the structure and foundation. Earthquake analysis of the building are performed using earthquake records in time domain (Kocaeli, Loma Prieta and Landers). Results obtained from three-dimensional finite element models are presented by graphs and tables in detail. That seismic isolation reduces significantly the destructive effects of earthquakes on structures is seen from the results obtained by seismic analysis.

• Korean Journal of Environmental Agriculture
• /
• v.38 no.3
• /
• pp.133-138
• /
• 2019

BACKGROUND: Production function gives the equation that shows the relationship between the quantities of productive factors used and the amount of product obtained, and can answer a variety of questions. This study was carried out to evaluate the relationship between irrigation water used for rice production and rice productivity by the production function which shows the mathematical relation between input and output. METHODS AND RESULTS: The statistical data on rice production and on the amount of irrigation water were used for the production function analysis. The analysis period was separated for 1966-1981 and 1982-2011, based on goal's change on agriculture from 'increasing food' to 'complex farming'. The relation between irrigation and yield considering production function is a short-term production function both before and after 1982. These results can be expressed by the sigmoid relation. When comparing the graphs of the two analyzed periods, there are differences in quantity between the maximum point and the minimum point during the same analysis period, which can be called an 'Irrigation Effect' by the difference of irrigation, and 'Technical Effect' by the difference by inputs like as fertilizers etc. CONCLUSION: The results could be useful as information for assessing the relationship between agricultural water and the productivity of rice and predicting rice productivity by irrigation water in Korea.

• Journal of Korean Home Economics Education Association
• /
• v.30 no.4
• /
• pp.15-35
• /
• 2018

This study aims to provide an understanding and information of the new curriculum by comparing 12 kinds of Technology and Home Economics textbooks(Clothing Life section) that reflect the 2015 revised. Results revealed that most of the textbooks' unit arrangements consisted of the introduction, development, and summary. In addition, we examined the advantages of current textbooks and suggested future improvement directions. The analysis of volume revealed that the largest textbook was 38 pages and the smallest was 24 pages. In addition, the learning objectives by unit a little bit differed for each textbook. The illustrations in the textbooks were primarily figures followed by photographs, tables, and graphs. The number of textbooks with the largest amount of illustrations was 69 and those with the least were 38, indicating a significant difference. As for career, 8 textbooks of 12 textbooks reflected related contents. The number of units, volumes of the clothing life section, and ratio of illustrations used in each textbook were different, but the contents were similar. Most of the contents of the 2009 textbooks are mostly included and the meaning of clothing, clothing purchasing, dress code, and creative clothing life are added on 2015 revised textbooks. Furthermore the educational objectives have extended to wide range and provides concrete guidelines to foster human resources that will lead the future society.

• The KIPS Transactions:PartA
• /
• v.17A no.3
• /
• pp.159-166
• /
• 2010

In this paper, to obtain the Minimum Spanning Tree (MST) from the graph with several nodes having the same weight, I applied both Bor$\dot{u}$vka and Kruskal MST algorithms. The result came out to such a way that Kruskal MST algorithm succeeded to obtain MST, but not did the Prim MST algorithm. It is also found that an algorithm that chooses Inter-MSF MWE in the $2^{nd}$ stage of Bor$\dot{u}$vka is quite complicating. The $1^{st}$ stage of Bor$\dot{u}$vka has an advantage of obtaining Minimum Spanning Forest (MSF) with the least number of the edges, and on the other hand, Kruskal MST algorithm has an advantage of always obtaining MST though it deals with all the edges. Therefore, this paper suggests an Hybrid MST algorithm which consists of the merits of both Bor$\dot{u}$vka's $1^{st}$ stage and Kruskal MST algorithm. When applied additionally to 6 graphs, Hybrid MST algorithm has a same effect as that of Kruskal MST algorithm. Also, comparing the algorithm performance speed and capacity, Hybrid MST algorithm has shown the greatest performance Therefore, the suggested algorithm can be used as the generalized MST algorithm.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2012.02a
• /
• pp.239-240
• /
• 2012

With advancements in semiconductor device technologies, manufacturing processes are getting more complex and it became more difficult to maintain tighter process control. As the number of processing step increased for fabricating complex chip structure, potential fault inducing factors are prevail and their allowable margins are continuously reduced. Therefore, one of the key to success in semiconductor manufacturing is highly accurate and fast fault detection and classification at each stage to reduce any undesired variation and identify the cause of the fault. Sensors in the equipment are used to monitor the state of the process. The idea is that whenever there is a fault in the process, it appears as some variation in the output from any of the sensors monitoring the process. These sensors may refer to information about pressure, RF power or gas flow and etc. in the equipment. By relating the data from these sensors to the process condition, any abnormality in the process can be identified, but it still holds some degree of certainty. Our hypothesis in this research is to capture the features of equipment condition data from healthy process library. We can use the health data as a reference for upcoming processes and this is made possible by mathematically modeling of the acquired data. In this work we demonstrate the use of recurrent neural network (RNN) has been used. RNN is a dynamic neural network that makes the output as a function of previous inputs. In our case we have etch equipment tool set data, consisting of 22 parameters and 9 runs. This data was first synchronized using the Dynamic Time Warping (DTW) algorithm. The synchronized data from the sensors in the form of time series is then provided to RNN which trains and restructures itself according to the input and then predicts a value, one step ahead in time, which depends on the past values of data. Eight runs of process data were used to train the network, while in order to check the performance of the network, one run was used as a test input. Next, a mean squared error based probability generating function was used to assign probability of fault in each parameter by comparing the predicted and actual values of the data. In the future we will make use of the Bayesian Networks to classify the detected faults. Bayesian Networks use directed acyclic graphs that relate different parameters through their conditional dependencies in order to find inference among them. The relationships between parameters from the data will be used to generate the structure of Bayesian Network and then posterior probability of different faults will be calculated using inference algorithms.

• Journal of the Society of Disaster Information
• /
• v.19 no.1
• /
• pp.44-59
• /
• 2023

Purpose: In the event of mass casualties, triage must be done promptly and accurately so that as many patients as possible can be recovered and returned to the battlefield. However, medical personnel have received many tasks with less manpower, and the battlefield for classifying patients is too complex and uncertain. Therefore, we studied an artificial intelligence model that can assist and replace medical personnel on the battlefield. Method: The triage model is presented using reinforcement learning, a field of artificial intelligence. The learning of the model is conducted to find a policy that allows as many patients as possible to be treated, taking into account the condition of randomly set patients and the medical capability of the military hospital. Result: Whether the reinforcement learning model progressed well was confirmed through statistical graphs such as cumulative reward values. In addition, it was confirmed through the number of survivors whether the triage of the learned model was accurate. As a result of comparing the performance with the rule-based model, the reinforcement learning model was able to rescue 10% more patients than the rule-based model. Conclusion: Through this study, it was found that the triage model using reinforcement learning can be used as an alternative to assisting and replacing triage decision-making of medical personnel in the case of mass casualties.

• Journal of radiological science and technology
• /
• v.30 no.2
• /
• pp.105-111
• /
• 2007

This study is to calculate the proper angle for the optimal image of PNS Water's view on children, comparing and analyzing the PNS Water's projection angles between children and adults at every age. This study randomly selected 50 patients who visited the Medical Center from January to May in 2005, and examined the incidence path of central ray, taking a PNS Water's and skull trans-Lat. view in Water's filming position while attaching a lead ball mark on the Orbit, EAM, and acanthion of the patients's skull. And then, we calculated the incidence angles(Angle A) of the line connected from OML and the petrous ridge to the inferior margin of maxilla on general(random) patients's skull image, following the incidence path of central ray. Finally, we analyzed two pieces of the graphs at ages, developing out the patients' ideal images at PNS Water's filming position taken by a digital camera, and calculating the angle(Angle B) between OML and IP(Image Plate). The angle between OML and IP is about $43^{\circ} in 4-years-old children, which is higher than $37^{\circ}, as age increases the angle decreases, it goes to $37^{\circ} around 30 years of age. That is similar result to maxillary growth period. We can get better quality of Water's image for children when taking the PNS Water's view if we change the projection angles, considering maxillary growth for patients in every age stage.