• Communications of the Korean Mathematical Society
• /
• v.15 no.2
• /
• pp.331-338
• /
• 2000

In the present paper, we investigate a problem in a sym-metric Finsler space, which is a special space. First we prove that if a symmetric space remains to be a symmetric one under the Z-projective change, then the space is of zero curvature. Further we will study W-recurrent space and D-recurrent space under the pro-jective change.

• Kyungpook Mathematical Journal
• /
• v.62 no.4
• /
• pp.673-687
• /
• 2022

In this study, we solve the Cayley inclusion problem and the fixed point problem in real Hilbert space using Tseng's technique with inertial extrapolation in order to obtain more efficient results. We provide a strong convergence theorem to approximate a common solution to the Cayley inclusion problem and the fixed point problem under some appropriate assumptions. Finally, we present a numerical example that satisfies the problem and shows the computational performance of our suggested technique.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.3_4
• /
• pp.145-151
• /
• 2004

We present an efficient data structure to obtain the range minima in an away in constant time. Recently, suffix ways are extensively used to search DNA sequences fast in bioinformatics. In constructing suffix arrays, solving the range minima problem is necessary When we construct suffix arrays, we should solve the range minima problem not only in a time-efficient way but also in a space-efficient way. The reason is that DNA sequences consist of millions or billions of bases. Until now, the most efficient data structure to find the range minima in an way in constant time is based on the method that converts the range minima problem in an array into the LCA (Lowest Common Ancestor) problem in a Cartesian tree and then converts the LCA problem into the range minima problem in a specific array. This data structure occupies O( n) space and is constructed in O(n) time. However since this data structure includes intermediate data structures required to convert the range minima problem in an array into other problems, it requires large space (=13n) and much time. Our data structure is based on the method that directly solves the range minima problem. Thus, our data structure requires small space (=5n) and less time in practice. As a matter of course, our data structure requires O(n) time and space theoretically.

• Publications of The Korean Astronomical Society
• /
• v.24 no.1
• /
• pp.65-81
• /
• 2009

We present the performance test results of VLBI Correlation Subsystem (VCS) trial product which was being developed for 1 year from August 2007. It is a core component of Korea-Japan Joint VLBI Correlator (KJJVC). The aim for developing VCS trial product is to improve the performance of VCS main product to reduce the efforts and cost, and to solve the design problems by performing the preliminary test of the manufactured trial product. The function of VCS trial product is that it is able to process the 2 stations-1 baseline, 8 Gbps/station speed, 1.2 Gbps output speed with FX-type. VCS trial product consists of Read Data Control Board (RDC), Fourier Transform Board (FTB), and Correlation and Accumulation Board (CAB). Almost main functions are integrated in the FTB and CAB board. In order to confirm the performance of VCS trial product functions, the spectral analysis, delay compensation and correlation processing experiments were carried out by using simulation and real observation data. We found that the overflow problem of re-quantization after FFT processing was occurred in the delay compensation experiment. We confirmed that this problem was caused by valid bit-expression of the re-quantized data. To solve this problem, the novel method will be applied to VCS main product. The effectiveness of VCS trial product has been verified through the preliminary experimental results, but the overflow problem was occurred.

• Journal of Practical Engineering Education
• /
• v.14 no.1
• /
• pp.91-97
• /
• 2022

Recently, as per a representative education method to develop core capabilities (such as critical thinking, communication, collaboration, and creativity) problem based learning (PBL) has been widely adopted in universities. Two important features of PBL are 'collaboration between team members' and 'participation based self-directed learning'. These two features should be satisfied in online education, although it is difficult due to the limitation on space and time in the COVID-19 pandemic. This paper presents a new design of PBL class in Metaverse, based on improving the online PBL class operated in the previous semesters in the H university. In the proposed PBL class, students are able to display materials (e.g., image, pdf, video files) in 3D virtual space, that are related to problem solving. The 3D virtual space is called gallery in this paper. The concept of gallery allows for active participation of students. In addition, the gallery can be used as a tool for collaborative meeting or for final presentation. If possible, the new design of PBL class will be applied and its effectiveness will be analyzed.

• Journal of Information Processing Systems
• /
• v.16 no.5
• /
• pp.1223-1230
• /
• 2020

Recently, extensive studies have been conducted to apply deep learning to reinforcement learning to solve the state-space problem. If the state-space problem was solved, reinforcement learning would become applicable in various fields. For example, users can utilize dance-tutorial systems to learn how to dance by watching and imitating a virtual instructor. The instructor can perform the optimal dance to the music, to which reinforcement learning is applied. In this study, we propose a method of reinforcement learning in which the action space is dynamically adjusted. Because actions that are not performed or are unlikely to be optimal are not learned, and the state space is not allocated, the learning time can be shortened, and the state space can be reduced. In an experiment, the proposed method shows results similar to those of traditional Q-learning even when the state space of the proposed method is reduced to approximately 0.33% of that of Q-learning. Consequently, the proposed method reduces the cost and time required for learning. Traditional Q-learning requires 6 million state spaces for learning 100,000 times. In contrast, the proposed method requires only 20,000 state spaces. A higher winning rate can be achieved in a shorter period of time by retrieving 20,000 state spaces instead of 6 million.

• Journal of Engineering Education Research
• /
• v.26 no.1
• /
• pp.3-11
• /
• 2023

The purpose of this study is to develop Raspberry Pi-based CanSat instruction materials for liberal arts classes to be used in university space education. The educational satellite simulation program is developed by applying the ADDIE program consisting of analysis, design, development, execution, and evaluation of 15 lessons per semester. The usefulness of the instruction materials is evaluated by a validity test of a total of 6 experts. The proposed materials are applied to 100 college students from various majors. To analyze the impact on creative problem-solving ability, a questionnaire is conducted before and after class, and as a result, it is confirmed that there is a significant improvement in all areas after class. The class satisfaction survey is conducted for a total of 10 questions, and the average score is 4.41 out of 5, which is high. In conclusion, the proposed instruction materials make it possible to achieve successful space education using Raspberry Pi and improve creative problem-solving ability in universities.

• Journal of Korean Institute of Industrial Engineers
• /
• v.40 no.5
• /
• pp.481-491
• /
• 2014

In this paper, we discussed a problem for improving the throughput of a crankshaft manufacturing line in an automotive factory in which the budget for purchasing new machines and installing additional buffers is limited. We also considered the constraint of available space for both of machine and buffer. Although this problem seems like a kind of buffer allocation problem, it is different from buffer allocation problem because additional machines are also considered. Thus, it is not easy to calculate the throughput by mathematical model, and therefore simulation model was developed using $ARENA^{(R)}$ for estimating throughput. To determine the investment plan, a modified Arrow Assignment Rule under some constraints was suggested and it was applied to the real case.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.25 no.2
• /
• pp.117-124
• /
• 2022

Single-ring circular array antennas can be applied to direction finding systems in order to use nose-section in other purposes, and the interferometry is a proper direction finding method to those systems. We usually make the interferometer baseline long enough to achieve good angular accuracy. However, an interferometer with baseline longer than a half-wavelength has the ambiguity problem. In this paper, we present a novel method for solving the ambiguity problem in interferometry systems. This technique is based on the amplitude comparison method and the space division table, and it can place a target within the angular region in which the ambiguity problem does not occur by roughly estimating direction-of-arrival. The Monte Carlo simulation results show that proposed method can effectively remove the ambiguity problem in the system.

• Knowledge Management Research
• /
• v.15 no.4
• /
• pp.15-34
• /
• 2014

Creative problem solving has become an important issue in many fields. Among problems, dilemma need creative solutions. New creative and innovative problem solving strategies are required to handle the contradiction relations of the dilemma problems because most creative and innovative cases solved contradictions inherent in the dilemmas. Among various kinds of problem solving theories, TRIZ provides the concept of physical contradiction as a common problem solving principle in inventions and patents. In TRIZ, 4 separation principles solve the physical contradictions of given problems. The 4 separation principles are separation in time, separation in space, separation within a whole and its parts, and separation upon conditions. Despite this attention, an accurate definitions of the separation principles of TRIZ is missing from the literature. Thus, there have been several different interpretations about the separation principles of TRIZ. The different interpretations make problems more ambiguous to solve when the problem solvers apply the 4 separation principles. This research aims to fill the gap in several ways. First, this paper classify the types of contradiction relations and the contradiction solving dimensions based on the Butterfly model for contradiction solving. Second, this paper compares and analyzes each contradiction relation type with the Butterfly diagram. The contributions of this paper lies in reducing the problem space by recognizing the structures and the types of contradiction problems exactly.