• The Bulletin of The Korean Astronomical Society
• /
• v.38 no.1
• /
• pp.64.2-64.2
• /
• 2013

Korea Astnonomy and Space Science Institute (KASI) operates two solar radio observing facilities, the Korean station of the e-CALLISTO and the Korean Solar Radio Burst Locator (KSRBL). The e-CALLISTO station had suffered from tracking problem for past several years. Since 2011, KASI has developed a new tracking system, and recently the antenna has regained the its sun-tracking capability and full day-time coverage. The KSRBL also suffered from the control computer breakdown last year. After one year of operational gap, the KSRBL restored its normal daily observation. We also expanded the data server storage capacity, to store the full original data of 25 ms integration time and 0.25 MHz frequency resolution, amounting to about 80 GB per day.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.11
• /
• pp.1102-1110
• /
• 2006

This paper addresses the problem of computing grasp stability of the object for two-fingered robots in two dimensions. The concepts of force-closure and dual space are introduced and discussed in novel point of view, and we transform friction cones in a robot work space to line segments in a dual space. We newly define a grasp stability index by calculating intersection condition between line segments in dual space. Moreover, we propose a method to find the optimal grasp points of the given object by comparing the defined grasp stability index. Its validity and effectiveness are investigated and verified by simulations for quadrangle object and elliptic objects.

• Journal of Astronomy and Space Sciences
• /
• v.21 no.4
• /
• pp.399-416
• /
• 2004

The FIMS (Far-ultraviolet IMaging Spectrograph), the main payload onboard the first Korean science satellite STSAT-1, has performed various observations since its launch on September 2003. It has been found that the attitude informations provided by spacecraft bus system have a time offset problem, and the problem has been extensively studied. After the time offset correction, boresight offsets between FIMS fields of view, of long and short wavelength bands, respectivley, and spacecraft attitude systems, which are mainly due to alignment error between the FIMS and spacecraft mechanical systems, were calculated through the observations of well known calibration targets. Monthly status and precision of the attitude information are also described. Correction methods for spatially variable exposure, intrinsic to FIMS data, are discussed. These results are essential to the FIMS data analysis, and will be used as references for subsequent studies on more accurate attitude corrections.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.34 no.4
• /
• pp.221-230
• /
• 2021

This paper proposes full waveform inversion (FWI) for estimating the physical properties of a layered half-space. An FWI solution is obtained using a genetic algorithm (GA), which is a well-known global optimization approach. The dynamic responses of a layered half-space subjected to a harmonic vertical disk load are measured and compared with those calculated using the estimated physical properties. The responses are calculated using the thin-layer method, which is accurate and efficient for layered media. Subsequently, a numerical model is constructed for a layered half-space using mid-point integrated finite elements and perfectly matched discrete layers. An objective function of the global optimization problem is defined as the L2-norm of the difference between the observed and estimated responses. A GA is used to minimize the objective function and obtain a solution for the FWI. The accuracy of the proposed approach is applied to various problems involving layered half-spaces. The results verify that the proposed FWI based on a GA is suitable for estimating the material properties of a layered half-space, even when the measured responses include measurement noise.

• Journal of the Korean Institute of Rural Architecture
• /
• v.17 no.4
• /
• pp.67-74
• /
• 2015

Due to an inability to accommodate for the rapidly increasing number of printed materials, Korean academic libraries are facing serious space shortage problems. Very few academic institutions have the funds to expand existing libraries or construct new facilities in order to accommodate the influx of printed materials. Despite not having the luxury to create new space, many establishments continue to implement the open access system. Seeing that such a system is only user friendly when used in a spacious facility, the maintenance of the open access system is unreasonable. Only few libraries consider the space efficient closed access system which helps to resolve storage space shortage. In the current state of the problem, improving the efficiency to which books are stored in existing storage areas within a library facility is the only appropriate solution. Enacting methods to improve physical space utilization within a fixed volume library facility will undoubtedly diminish the space shortage issue at hand. In this article, several space efficiency improvement approaches are discussed. Methods of book storage plan re-layout (floor, plan, ceiling, height, bookshelf design), book arrangement possibilities, and the reduction of the physical volume of reserved materials are each examined.

• Management Science and Financial Engineering
• /
• v.20 no.1
• /
• pp.17-19
• /
• 2014

In this paper, we consider an interesting variant of the inverse minimum traveling salesman problem. Given an instance (G, w) of the minimum traveling salesman problem defined on a metric space, we fix a specified Hamiltonian cycle $HC_0$. The task is then to adjust the edge cost vector w to w' so that the new cost vector w' satisfies the triangle inequality condition and $HC_0$ can be returned by the minimum spanning tree algorithm in the TSP-instance defined with w'. The objective is to minimize the total deviation between the original and the new cost vectors with respect to the $L_1$-norm. We call this problem the inverse metric traveling salesman problem against the minimum spanning tree algorithm and show that it is closely related to the inverse metric spanning tree problem.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.4
• /
• pp.709-717
• /
• 1997

For an undirected graph G=(V, E), the Rural Postman Problem (RPP) is a problem that finds a minimum cost tour that must pass edges in E'($\subseteq$ E) at least once. RPP, such as Traveling Salesman Problem (TSP), is known as an NP. Complete problem. In the previous study of RPP, he structure of the chromosome is constructed by E' and the direction of the edge. Hence, the larger the size of IE' I is, the larger the size of the chromosome and the size of the solution space are. In this paper, we transform the RPP into a Hamiltonian graph and use a genetic algorithm to solve the transformed problem using restructured chromosomes. In the simulations, we analyze our method and the previous study. From the simulation results, it is found that the results of the proposed method is better than those of the previous method and the proposed method also obtains the near optimal solution in earlier generations than the previous study.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.2
• /
• pp.125-137
• /
• 1997

We are concerned with the packing policy determines the optimal packing of products with variable sizes to minimize the penalty costs for idle space and product spliting. Optimal packing problem is closely related to the optimal packet/record sizing problem in that randomly generated data stream with variable bytes are divided into a unit of packet/record for transmitting or storing. Assuming the product size and the production period are independently determined by renewal process, we can approximate the renewal process and formulate the optimization problem that minimize the expected packing cost for a production period. The problem is divided into two cases according to whether a product is allowed to split or not. Computational results for various distributions will be given to verify the approximation procedure and the resulting optimization problem.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.3
• /
• pp.259-268
• /
• 1999

In order to reduce the cost of product and save the processing time, optimal nesting of two-dimensional part is an important application in number of industries like shipbuilding and garment making. There have been many studies on finding the optimal solution of two-dimensional nesting. The problem of two-dimensional nesting has a non-deterministic characteristic and there have been various attempts to solve the problem by reducing the size of problem rather than solving the problem as a whole. Heuristic method and linearlization are often used to find an optimal solution of the problem. In this paper, theoretical and practical nesting algorithm for rectangular, circular and irregular shape of two-dimensional parts is proposed. Both No-Fit-Polygon and Minkowski-Sum are used for solving the overlapping problem of two parts and the dynamic programming technique is used for reducing the number search spae in order to find an optimal solution. Also, nesting designer's expertise is complied into the proposed algorithm to supplement the heuristic method.

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.3
• /
• pp.226-237
• /
• 2004

If the topology changes in the re-generation step of the history-based and feature-based CAD systems, it is difficult to identify an entity in the old model and find the same entity in the new model. This problem is known as 'persistent naming problem'. To exchange parametric CAD models, the persistent naming problem and the naming mapping problem must be solved among different CAD system, which use different naming scheme. For CAD model exchange the persistent naming has its own characteristics compare to that for CAD system development. This paper analyses previous researches and proposes a solution to the persistent naming problem for CAD model exchanges and to the naming mapping problem among different naming schemes.