• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.4
• /
• pp.12-18
• /
• 2008

Researches on particle physics have benefited our everyday life in many aspects. They have tested the safety of the objects we use everyday, conducted experiments to examine harmful environments to man, and treated diseases. Despite the usefulness of particle physics in a range of fields, however, it's difficult to conduct researches and experiments directly. But the advancements in the computer industry have allowed for experiments of particle physics in virtual simulations. One of the foremost simulation libraries for particle physics that have been researched actively these days, Geant4 has been put to diverse uses in particle physics. This study designed GUI so that physicists, who were not good at programming, could use a simulation library faster, more accurately, and more conveniently. It also developed the Geant4Editor, a simulation automation framework. The advantages of the Geant4Editor include automatic generations of essential classes in a simulation using Geant4 libraries and real-time reflection of user demands in a simulation. It also allows for efficient management of resources(user-created data) through the Data Manager.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.5
• /
• pp.232-242
• /
• 2002

In a MPLS(Multiprotocol Label Switching) network, it is important to reduce the number of labels and LSP(Lable Switched Path)s for network resource management. MTP(Multipoint-to-Point) LSP can be used to solve this problem. In consideration of traffic engineering, MTP LSP must be chosen to enhance the availability of network and link utilization. Also, a fast mechanism to setup MTP LSPs is required for rerouting capability against link failure. In this paper, we propose a fast MTP LSP traffic engineering of multipath MTP LSP by using a mapping of a MTP LSP upon Diffserv PHBs(Per Hop Behavior) in a Diffserv-capable MPLS network. In the proposed traffic engineering, we determine multiple MTP LSPs in a hierarchical manner according to the characteristics of different services. By using Monte-Carlo method for traffic load balancing process, it provides fast rerouting capability in case of frequent link failure across large network. Out method produces to be nearly optimal within reasonable run-times. It's time complexity is in O( Cn$^2$logn) as conventional multipath routing and it is much faster than Linear Programming approach. Simulation results show that the proposed traffic engineering can be controlled effectively in an administrative manner and enhance the availability of network in comparison with conventional multipath routing.

• Journal of Korean Society of Steel Construction
• /
• v.18 no.6
• /
• pp.697-706
• /
• 2006

Tower crane's wall tie is generally used for extending of mast height according to rising of lifting height. In order to get wall tie member force this problem, this study concerning wall tie is based on load data described in manual book of 290HC model. This study made the equation of wall tie member force and computer programming for calculating wall tie member force and then get ${\theta}-P$ curves(angle-wall tie force). After considering the ${\theta}-P$ curves, optimum angle range ($48.4^{\circ}{\sim}77.2^{\circ}$) about wall ties (A), (C) members was obtained. Member force of wall tie (B) was changed from tension to compression or from compression to tension at $74^{\circ}$ in service and $54^{\circ}$ in out of service. When both horizontal force($H_A$) and torsional moment ($M_D$) were varied from (+) to (-), wall tie force(A, B, C) were changed almost symmetrically about ${\theta}$-axis. Because this study was based on wall tie analysis conditions, wall tie members in symmetric and ideal geometry shape used for analizing wall tie of tower crane, it is necessary to have more careful verification in order to apply generally the results of this study.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.155-162
• /
• 2016

In recent years, hoping the interaction of individuals and rather than software development process and tools, and customers want software that works first, rather than a comprehensive document, in cooperation with the customer, rather than the developer negotiate a contract, to each other stick to the plan I think even more so than the value that corresponds to the change. In view of this, software development is given the autonomy and motivation to project team rather than process-oriented and have a passion and vision and human relations oriented management approach is required. In recent years, increasing the productivity benefits of agile development processes, improved quality, efficiency and customer satisfaction as is demonstrated in the methodology selected to promote the project, attention was given to the experts. Contemporary demands with regard to the methodology chosen to meet your needs, in this paper in the organization, and to solve the problems of product-based Cross functional team proposed methodology Feature Team model, this model is an organizational Cross functional team and the team is not the outcome (product) basis, were examined for the model that points to progress the development across multiple product as a functional unit, value-plan through the driven agile technique-based model and proposed a difference. And the domain analysis, required extraction by conventional JAD (joint application development) meeting the targets for the object-oriented modeling, in modeling and organize, review, aware in advance and the UML Structure and Behavior Diagrams and proposed to proceed with the project.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2011.05a
• /
• pp.18-18
• /
• 2011

Climate change is impacting and will increasingly impact both the quantity and quality of the world's water resources in a variety of ways. In some areas warming climate results in increased rainfall, surface runoff, and groundwater recharge while in others there may be declines in all of these. Water quality is described by a number of variables. Some are directly impacted by climate change. Temperature is an obvious example. Notably, increased atmospheric concentrations of $CO_2$ triggering climate change increase the $CO_2$ dissolving into water. This has manifold consequences including decreased pH and increased alkalinity, with resultant increases in dissolved concentrations of the minerals in geologic materials contacted by such water. Climate change is also expected to increase the number and intensity of extreme climate events, with related hydrologic changes. A simple framework has been developed in New Zealand for assessing and predicting climate change impacts on water resources. Assessment is largely based on trend analysis of historic data using the non-parametric Mann-Kendall method. Trend analysis requires long-term, regular monitoring data for both climate and hydrologic variables. Data quality is of primary importance and data gaps must be avoided. Quantitative prediction of climate change impacts on the quantity of water resources can be accomplished by computer modelling. This requires the serial coupling of various models. For example, regional downscaling of results from a world-wide general circulation model (GCM) can be used to forecast temperatures and precipitation for various emissions scenarios in specific catchments. Mechanistic or artificial intelligence modelling can then be used with these inputs to simulate climate change impacts over time, such as changes in streamflow, groundwater-surface water interactions, and changes in groundwater levels. The Waimea Plains catchment in New Zealand was selected for a test application of these assessment and prediction methods. This catchment is predicted to undergo relatively minor impacts due to climate change. All available climate and hydrologic databases were obtained and analyzed. These included climate (temperature, precipitation, solar radiation and sunshine hours, evapotranspiration, humidity, and cloud cover) and hydrologic (streamflow and quality and groundwater levels and quality) records. Results varied but there were indications of atmospheric temperature increasing, rainfall decreasing, streamflow decreasing, and groundwater level decreasing trends. Artificial intelligence modelling was applied to predict water usage, rainfall recharge of groundwater, and upstream flow for two regionally downscaled climate change scenarios (A1B and A2). The AI methods used were multi-layer perceptron (MLP) with extended Kalman filtering (EKF), genetic programming (GP), and a dynamic neuro-fuzzy local modelling system (DNFLMS), respectively. These were then used as inputs to a mechanistic groundwater flow-surface water interaction model (MODFLOW). A DNFLMS was also used to simulate downstream flow and groundwater levels for comparison with MODFLOW outputs. MODFLOW and DNFLMS outputs were consistent. They indicated declines in streamflow on the order of 21 to 23% for MODFLOW and DNFLMS (A1B scenario), respectively, and 27% in both cases for the A2 scenario under severe drought conditions by 2058-2059, with little if any change in groundwater levels.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.5
• /
• pp.219-230
• /
• 2017

General-Purpose Graphics Processing Units (GPGPUs) build massively parallel architecture and apply multithreading technology to explore parallelism. By using programming models like CUDA, and OpenCL, GPGPUs are becoming the best in exploiting plentiful thread-level parallelism caused by parallel applications. Unfortunately, modern GPGPU cannot efficiently utilize its available hardware resources for numerous general-purpose applications. One of the primary reasons is the inefficiency of existing warp/thread block schedulers in hiding long latency instructions, resulting in lost opportunity to improve the performance. This paper studies the effects of hardware thread scheduling policy on GPGPU performance. We propose a novel warp scheduling policy that can alleviate the drawbacks of the traditional round-robin policy. The proposed warp scheduler first classifies the warps of a thread block into two groups, warps with long latency and warps with short latency and then schedules the warps with long latency before the warps with short latency. Furthermore, to support the proposed warp scheduler, we also propose a supplemental technique that can dynamically reduce the number of streaming multiprocessors to which will be assigned thread blocks when encountering a high contention degree at the memory and interconnection network. Based on our experiments on a 15-streaming multiprocessor GPGPU platform, the proposed warp scheduling policy provides an average IPC improvement of 7.5% over the baseline round-robin warp scheduling policy. This paper also shows that the GPGPU performance can be improved by approximately 8.9% on average when the two proposed techniques are combined.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.2
• /
• pp.67-74
• /
• 2013

Approximate string matching problems have been studied in diverse fields. Recently, fast approximate string matching algorithms are being used to reduce the time and costs for the next generation sequencing. To measure the amounts of errors between two strings, we use a distance function such as the edit distance. Given two strings X(|X| = m) and Y(|Y| = n) over an alphabet ${\Sigma}$, the edit distance between X and Y is the minimum number of edit operations to convert X into Y. The edit distance between X and Y can be computed using the well-known dynamic programming technique in O(mn) time and space. The edit distance also can be computed using the Four-Russians' algorithm whose preprocessing step runs in $O((3{\mid}{\Sigma}{\mid})^{2t}t^2)$ time and $O((3{\mid}{\Sigma}{\mid})^{2t}t)$ space and the computation step runs in O(mn/t) time and O(mn) space where t represents the size of the block. In this paper, we present a parallelized version of the computation step of the Four-Russians' algorithm. Our algorithm computes the edit distance between X and Y in O(m+n) time using m/t threads. Then we implemented both the sequential version and our parallelized version of the Four-Russians' algorithm using CUDA to compare the execution times. When t = 1 and t = 2, our algorithm runs about 10 times and 3 times faster than the sequential algorithm, respectively.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.12
• /
• pp.726-734
• /
• 2004

This paper presents a facial animation method that enables the user to select a sequence of facial frames from the facial expression space, whose level of details the user can select hierarchically Our system creates the facial expression space from about 2400 captured facial frames. To represent the state of each expression, we use the distance matrix that represents the distance between pairs of feature points on the face. The shortest trajectories are found by dynamic programming. The space of facial expressions is multidimensional. To navigate this space, we visualize the space of expressions in 2D space by using the multidimensional scaling(MDS). But because there are too many facial expressions to select from, the user faces difficulty in navigating the space. So, we visualize the space hierarchically. To partition the space into a hierarchy of subspaces, we use fuzzy clustering. In the beginning, the system creates about 10 clusters from the space of 2400 facial expressions. Every tine the level increases, the system doubles the number of clusters. The cluster centers are displayed on 2D screen and are used as candidate key frames for key frame animation. The user selects new key frames along the navigation path of the previous level. At the maximum level, the user completes key frame specification. We let animators use the system to create example animations, and evaluate the system based on the results.

• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.5
• /
• pp.103-110
• /
• 2019

In this research, one common chapter, Problem Solving and Programming, in seven different types of high school informatics textbooks was analyzed in terms of the aspect of learners' explorations. These textbooks were newly developed based on the 2015 revised national curriculum. Romey's analysis was used to the textbooks along with four analytic elements: texts, data, activities, and evaluation. The study results showed that the textbooks can highly encourage learners' further explorations according to the four analytic elements reflected in the seven textbooks: one out of the six textbooks well designed for texts, three for data, six for activities, two for evaluation. In terms of Romey's involvement index points, six of the seven textbooks had low indexes of texts, ranging from 0.175 to 0.393. Data indexes were extremely low in four out of the seven textbooks, ranging from 0.058 to 0.226. Five out of the seven textbooks had very high indexes of evaluation in the broad range of 2 to 6.333 points. Furthermore, these newly designed textbooks can more greatly facilitate students' explorations than previously existing textbooks in three elements: texts, data, and activities. Evaluation indexes significantly increased in these new textbooks from 0.916 to 3.914, which had excessive points in terms of promoting students' explorations. Further methods to improve the textbook quality is proposed based on the results from this analysis.

• Journal of Internet of Things and Convergence
• /
• v.8 no.6
• /
• pp.49-54
• /
• 2022

Rapid changes in modern society after the COVID-19 have highlighted artificial intelligence talent as a major influencing factor in determining national competitiveness. Accordingly, the Ministry of Education planned a large-scale SW·AI camp education project to develop the digital capabilities of 4th to 6th grade elementary school students and middle and high school students who are in a vacuum in artificial intelligence education. Therefore, this study aims to develop a camp-type SW·AI education program for students in grades 4-6 of elementary school so that students in grades 4-6 of elementary school can acquire basic knowledge in artificial intelligence. For this, the meaning of SW·AI education in elementary school is defined and SW·AI contents to be dealt with in elementary school are: understanding of SW AI, 'principle and application of SW AI', and 'social impact of SW AI' was set. In addition, an attempt was made to link the set elements of elementary school SW AI education and learning with related subjects and units of textbooks currently used in elementary schools. As for the program used for education, entry, a software coding learning tool based on block coding, is designed to strengthen software programming basic competency, and all programs are designed to be operated centered on experience and experience-oriented participants in consideration of the developmental characteristics of elementary school students. In order for SW·AI education to be organized and operated as a member of the regular curriculum, it is suggested that research based on the analysis of regular curriculum contents and in-depth analysis of SW·AI education contents is necessary.