• Journal of the Korea Society for Simulation
• /
• v.28 no.2
• /
• pp.59-69
• /
• 2019

Smoke grenade is the most primary counteract of tank for its survival against threats, therefore a number of related researches and developments of M&S are being conducted. In this research, a vehicle-launched smoke grenade model is developed, that covers the essential engineering-level parameters, and also is applicable to engagement-level simulations because of its unheavy computational load. First of all, input parameters of the model were determined to include the principal factors from engineering to engagement level. In the model, smoke and LOS are modeled as simple figures, a disk and a line, so that the computational load is not as much as that of particle-model-based M&Ss. A test simulation is also carried out to analyze the effect of smoke grenade for a tank. This model is to be inserted into a basic tank model on AddSIM. The users of AddSIM will be able to simulate various scenarios including smoke grenades.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.11
• /
• pp.1538-1543
• /
• 2018

For n pairs of points (a,b) on a circle, the line segment to connect two points is called a chord. These chords define a new graph G. Each chord corresponds to a vertex of G, and if two chords intersect, the two vertices corresponding to them are connected by an edge. This makes a graph, called by a circle graph. In this paper, we deal with the problem to find the connected components of a circle graph. The connected component of a graph G is a maximal subgraph H such that any two vertices in H can be connected by a path. When the adjacent matrix of G is given, the problem to find them can be solved by either the depth-first search or the breadth-first search. But when only the information for the chords is given as an input, it takes ${\Omega}(n^2)$ time to obtain the adjacent matrix. In this paper, we do not make the adjacent matrix and develop an $O(n{\log}^2n)$ algorithm for the problem.

• Smart Media Journal
• /
• v.12 no.4
• /
• pp.47-57
• /
• 2023

The hexagonal grid structure has been studied for processing and representing spatial information data in Geographic Information Systems. Visualization using a hexagonal grid has high visibility compared to other grid representation methods. However, it is difficult to effectively convey quantitative data and differences between grids depending on the geospatial data represented. In this paper, we propose a method to visually emphasize the hexagonal grid by generating shadow on the outside of the hexagonal grid. To do so, we offset the outer line segments of the hexagonal grid to be emphasized and generate a Bézier curve based on that information to determine the final shadow shape. We also apply variable transparency toward the edges of the shadow because the shadow gradually fades away from the hexagonal grid. We have shown that the proposed method can effectively generate shadow areas given not only a single hexagonal grid but also multiple hexagonal grids and can generate various shadow shapes based on user interface inputs. We apply the proposed method to Yongsan-gu, one of the districts of Seoul, and show the results of visually emphasizing it after generating shadow using the proposed method.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.11
• /
• pp.140-149
• /
• 1996

Cursive characters are written on an economical principle to reduce the motion of a pen in the limit of distinction between characters. That is, the pen is not lifted up to move for writing a next stroke, the pen is not moved at all, or connected two strokes chance their shapes to a similar and simple shape which is easy to be written. For these reasons, strokes and korean alphabets are not only easy to be changed, but also difficult to be splitted. In this paper, we propose a curvature stroke modeling method for splitting and matching by using a structural primitive. A curvature stroke is defined as a substroke which does not change its curvanture. Input strokes handwritten in a cursive style are splitted into a sequence of curvature strokes by segmenting the points which change the direction of rotation, which occur a sudden change of direction, and which occur an excessive rotation Each reference of korean alphabets is handwritten in a printed style and is saved as a sequence of curvature strikes which is generated by splitting process. And merging process is used to generate various sequences of curvature strikes for matching. Here, it is also considered that imaginary strokes can be written or omitted. By using a curvature stroke as a unit of recognition, redundant splitting points in input characters are effectively reduced and exact matching is possible by generating a reference curvature stroke, which consists of the parts of adjacent two korean alphasbets, even when the connecting points between korean alphabets are not splitted. The results showed 83.6% as recognition rate of the first candidate and 0.99sec./character (CPU clock:66MHz) as processing time.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.10
• /
• pp.63-70
• /
• 2014

Process of recognizing objects in binary images consists of image segmentation and pattern matching. If binary objects in the image are assumed to be separated, global features such as area, length of perimeter, or the ratio of the two can be used to recognize the objects in the image. However, if such an assumption is not valid, the global features can not be used but local features such as points or line segments should be used to recognize the objects. In this paper points with large curvature along the perimeter are chosen to be the feature points, and pairs of points selected from them are used as local features. Similarity of two local features are defined using elastic deformation energy for making the lengths and angles between gradient vectors at the end points same. Neighbour support value is defined and used for robust recognition of partially occluded binary objects. An experiment on Kimia-25 data showed that the proposed algorithm runs 4.5 times faster than the maximum clique algorithm with same recognition rate.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.5
• /
• pp.1102-1107
• /
• 2004

Fingerprint Recognition System is made up of Off-line treatment and On-line treatment; the one is registering all the information of there trieving features which are retrieved in the digitalized fingerprint getting out of the analog fingerprint through the fingerprint acquisition device and the other is the treatment making the decision whether the users are approved to be accessed to the system or not with matching them with the fingerprint features which are retrieved and database from the input fingerprint when the users are approaching the system to use. In matching between On-line and Off-line treatment, the most important thing is which features we are going to use as the standard. Therefore, we have been using “Delta” and “Core” as this standard until now, but there might have been some deficits not to exist in every person when we set them up as the standards. In order to handle the users who do not have those features, we are still using the matching method which enables us to make up of the spanning tree or the triangulation with the relations of the spanned feature. However, there are some overheads of the time on these methods and it is not sure whether they make the correct matching or not. Therefore, I would like to represent the more correct matching algorism in this paper which has not only better matching rate but also lower mismatching rate compared to the present matching algorism by selecting the line segment connecting two minutiae on the same ridge and furrow structures as the reference point.

• Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
• /
• v.15 no.3
• /
• pp.191-197
• /
• 2017

The Korea Atomic Energy Research Institute (KAERI) has developed a safeguards technology for pyroprocessing based on the Safeguards-By-Design (SBD) concept. KAERI took part in a Member-State Support Program (MSSP) to establish a pyroprocessing safeguards approach. A Reference Engineering-scale Pyroprocessing Facility (REPF) concept was designed on which KAERI developed its safeguards system. Recently the REPF is being upgraded to the REPF+, a scaled-up facility. For assessment of the nuclear-material accountancy (NMA) system, KAERI has developed a simulation program named Pyroprocessing Material Flow and MUF Uncertainty Simulation (PYMUS). The PYMUS is currently being upgraded to include a Near-Real-Time Accountancy (NRTA) statistical analysis function. The Advanced Spent Fuel Conditioning Process Safeguards Neutron Counter (ASNC) has been updated as Non-Destructive Assay (NDA) equipment for input-material accountancy, and a Hybrid Induced-fission-based Pu-Accounting Instrument (HIPAI) has been developed for the NMA of uranium/transuranic (U/TRU) ingots. Currently, performance testing of Compton-suppressed Gamma-ray measurement, Laser-Induced Breakdown Spectroscopy (LIBS), and homogenization sampling are underway. These efforts will provide an essential basis for the realization of an advanced nuclear-fuel cycle in the ROK.