• Journal of Korean Tunnelling and Underground Space Association
• /
• v.15 no.3
• /
• pp.345-356
• /
• 2013

Numerical simulation on rock cutting by a TBM disc cutter was carried out using SPH (Smoothed Particle Hydrodynamics) code. AUTODYN3D, a commercial software program based on finite element method, was used in this study. The three-dimensional geometry of a disc cutter and a rock specimen were modeled by Lagrange and SPH code respectively. The numerical simulation was carried out for Hwangdeung granite for 10 different cutting conditions. The results of the numerical simulation, i.e. the relation between cutter force and failure behavior, had a good agreement with those from LCM test. The cutter forces measured in the numerical simulation had 10% deviation from the LCM test results. Moreover, the optimum cutter spacing was almost identical with the experimental results. These results indicate that SPH code can be successfully used had applicability for simulation on rock cutting by a TBM disc cutter. However, further study on Lagrange-SPH coupled modelling would be necessary to reduce the computation time.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.43 no.5
• /
• pp.440-448
• /
• 2015

Kinetic energy(KE) rod warhead system is a new interceptor which combines advantages of existing ones. This system is less dependant on a precision guidance than direct hit type warhead and gives high penetration rates than blast fragmentation type warhead. In this paper, isotropic KE rod warhead system is introduced with detonation/deployment model. A penetration effects of the deployed rods are calculated using TATE penetration equation. Also, an engagement performance analysis method is suggested. Finally, an optimal detonation time and engagement geometry is derived by Monte-Carlo simulation in various engagement situation using the performance analysis factor.

• Communications of the Korean Mathematical Society
• /
• v.25 no.1
• /
• pp.119-128
• /
• 2010

Let ${X_n,\;n\geq1}$ be a sequence of independent identically distributed (i.i.d.) random variables (r.vs.), defined on a probability space ($\Omega$,A,P), and let ${N_n,\;n\geq1}$ be a sequence of positive integer-valued r.vs., defined on the same probability space ($\Omega$,A,P). Furthermore, we assume that the r.vs. $N_n$, $n\geq1$ are independent of all r.vs. $X_n$, $n\geq1$. In present paper we are interested in asymptotic behaviors of the random sum $S_{N_n}=X_1+X_2+\cdots+X_{N_n}$, $S_0=0$, where the r.vs. $N_n$, $n\geq1$ obey some defined probability laws. Since the appearance of the Robbins's results in 1948 ([8]), the random sums $S_{N_n}$ have been investigated in the theory probability and stochastic processes for quite some time (see [1], [4], [2], [3], [5]). Recently, the random sum approach is used in some applied problems of stochastic processes, stochastic modeling, random walk, queue theory, theory of network or theory of estimation (see [10], [12]). The main aim of this paper is to establish some results related to the asymptotic behaviors of the random sum $S_{N_n}$, in cases when the $N_n$, $n\geq1$ are assumed to follow concrete probability laws as Poisson, Bernoulli, binomial or geometry.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.30 no.7
• /
• pp.44-50
• /
• 2002

Low-velocity impact on composite sandwich panel has been investigated. Contact force is computed from a proposed modified Hertzian contact law. The Hertzian contact law is constructed by adjusting numerical value of the exponent and reducing the through-the- thickness elastic constant of honeycomb core. The equivalent transverse elastic constant is calculated from the rule of mixture. Nonlinear equation to calculate the contact force is solved by the Newton-Raphson method and time integration is done by the Newmark-beta method. A finite element program for the low-velocity impact analysis is coded by implementing these techniques and an 18-node assumed strain solid element. Behaviors of composite sandwich panels subjected to low-velocity impact are analyzed for various cases with different geometry and lay-ups. It has been found that the present code with the proposed contact law can predict measured contact forces and contact times for most cases within reasonable error bounds.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.32 no.4_1
• /
• pp.363-371
• /
• 2014

Most space-borne optical scanning systems adopt linear arrayconfigurations. The well-knownthree different types of space-borne sensors arealong-track line scanner, across-track linescanner, and three line scanner. To acquire accurate location information of an object on the ground withthose sensors, the exterior and interior orientation parameters are critical factors for both of space-borne and airborne missions. Since the imaging geometry of sensors mightchange time to time due to thermal influence, vibration, and wind, it is very important to analyze the Interior Orientation Parameters (IOP) effects on the ground. The experiments based on synthetic datasets arecarried out while the focal length biases are changing. Also, both high and low altitudes of the imagingsensor were applied. In case with the along-track line scanner, the focal length bias caused errors along the scanline direction. In the other case with the across-track one, the focal length bias caused errors alongthe scan line and vertical directions. Lastly, vertical errors were observed in the case ofthree-line scanner. Those results from this study will be able to provide the guideline for developing new linearsensors, so as for improving the accuracy of laboratory or in-flight sensor calibrations.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.3
• /
• pp.134-142
• /
• 2002

Quadtree, which is a hierarchical data structure, is a very important data structure to represent binary images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The window operation is one of important geometry operations in image processing, which extracts a sub-image indicated by a window in the image. In this paper, we present an algorithm to perform the window operation of binary images represented by quadtrees, using three-dimensional $n{\times}n{\times}n$ processors on RMESH(Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to route the locational codes of quardtree on the hierarchical structure of $n{\times}n{\times}n$ RMESH.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.4
• /
• pp.753-758
• /
• 2017

The ray-shooting problem is to find the first intersection point on the surface of given geometric objects where a ray moving along a straight line hits. Since rays are usually given in the form of queries, this problem is typically solved as follows. First, a data structure for a collection of objects is constructed as preprocessing. Then, the answer for each query ray is quickly computed using the data structure. In this paper, we consider the ray-shooting problem about the set of vertical line segments on the x-axis. We present a new data structure called a convex layer tree for n vertical line segments given by input. This is a tree structure consisting of layers of convex hulls of vertical line segments. It can be constructed in O(n log n) time and O(n) space and is easy to implement. We also present an algorithm to solve each query in O(log n) time using this data structure.

• Journal of Digital Convergence
• /
• v.14 no.2
• /
• pp.209-216
• /
• 2016

In these days, considering the trend to make various information blended based on spatial information like road, buildings and geography, it is to be very important to visualize maps for showing the information efficiently. However, geometry which is composed with line, polygon commonly used on web service has limitation to express information by limit of usage as well as spending certain time to show the information via map. That's why this study develops the efficient way to visualize huge and complex spatial information. This way is to bring partial space with spatial query, and then query and expand information excluded the former area after detecting movement event based on client. When the way is implemented, it will be expected to make efficient visualization in entire system by not bringing unnecessary information but shortening spending time to show area because it just shows areas which clients want to see.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.29 no.3
• /
• pp.181-185
• /
• 2016

One of the important issues for fabricating the microelectronic display devices such as FED, PDP, and VFD is to obtain a high vacuum level inside the panel. In addition, sustaining the initial high vacuum level permanently is also very important. In the conventional packing technology using a tabulation method, it is not possible to obtain a satisfiable vacuum level for a proper operation. In case of FED, the poor vacuum level results in the increase of operating voltage for electron emission from field emitter tips and an arcing problem, resultantly shortening a life time. Furthermore, the reduction of a sealing process time in the PDP production is very important in respect of commercial product. The most probable method for obtaining the initial high vacuum level inside the space with such a miniature and complex geometry is a vacuum in-line sealing which seals two glass plates within a high vacuum chamber. The critical solution for the vacuum sealing is to develop a frit glass to avoid the bubbling or crack problems during the sealing process at high temperature of about $400^{\circ}C$ under the vacuum environment. In this study, the suitable frit power was developed using a mixture of vitreous and crystalline type frit powders, and a vacuum sealed CNT FED with 2 inch diagonal size was fabricated and successfully operated.

• Journal of the Korea Society for Simulation
• /
• v.15 no.2
• /
• pp.31-39
• /
• 2006

The visibility graph is a well-known method for efficient path-finding with the minimum search space modelling the game world. The generalized visibility graph is constructed on the expanded obstacle boundaries to eliminate the "wall-hugging" problem which is a major disadvantage of using the visibility graph. The paths generated by the generalized visibility graph are guaranteed to be near optimal and natural-looking. In this paper we propose the method to apply the generalized visibility graph efficiently for game characters who moves among static obstacles between varying start and goal points. Even though the space is minimal once the generalized visibility graph is constructed, the construction itself is time-consuming in checking the intersection between every two links connecting nodes. The idea is that we build the map for static obstacles first and then incorporate start and goal nodes quickly. The incorporation of start and goal nodes is the part that must be executed repeatedly. Therefore we propose to use the rotational plane-sweep algorithm in the computational geometry for incorporating start and goal nodes efficiently. The simulation result shows that the execution time has been improved by 39%-68% according to running times in the game environment with multiple static obstacles.