• Journal of the Korea Society for Simulation
• /
• v.26 no.2
• /
• pp.59-65
• /
• 2017

Along with the development of M&S, modeling research utilizing AI technology is attracting attention because of the fact that the needs of fields including human decision making such as defense M&S are increased. Obviously AI is a way to solve complex problems. However, AI did not consider logical time such as input time and processing time required by M&S. Therefore, in this paper we proposed a "time-based expert system" which redesigned the representative AI technology rule-based expert system. It consists of a rule structure "IF-THEN-AFTER" and an inference engine, takes logical time into consideration. We also tried logical analysis using a simple example. As a result of the analysis, the proposal Time-based Expert System proved that the result changes according to the input time point and inference time.

• Journal of the Korean Geotechnical Society
• /
• v.27 no.11
• /
• pp.83-92
• /
• 2011

The random and heterogeneous pore structure is a significant factor that dominates physical and mechanical behaviors of soils such as fluid flow and geomechanical responses driven by loading. The characterization method using non-destructive testing such as micro X-ray CT technique which has a high resolution with micrometer unit allows to observe internal structure of soils. However, the application has been limited to qualitatively observe 2D and 3D CT images and to obtain the void ratio at macro-scale although the CT images contain enormous information of materials of interests. In this study, we constructed the 3D particle and pore structures based on sequentially taken 2D images of glass beads and quantitatively defined complex pore structure with void cell and void channel. This approach was enabled by implementing image processing techniques that include coordinate transformation, binarization, Delaunay Triangulation, and Euclidean Distance Transform. It was confirmed that the suggested algorithm allows to quantitatively evaluate the distribution of void cells and their connectivity of heterogeneous pore structures for glass beads.

• Journal of the Korea Computer Graphics Society
• /
• v.3 no.2
• /
• pp.1-13
• /
• 1997

Two factors are required for a virtual reality system; realism and immersion. Since realism is determined primarily by the realistic image, objects in a virtual environment should be represented with details by their own characteristics. Also, reflection on light must be considered. On the other hand, immersion is defined as realistic movements and fast interactions. Thus, virtual environment should be rendered as fast as possibl. Regular frame rate should also be kept to make moves as intended by the user. In a complex virtual environment composed of objects with various levels, the appropriate level for individual object should be assigned according to the view point, in other words, the selection of level-of-detail is needed. In this paper, the problem of determining the levels of detail is formalized in terms of error, cost and L -distance. Error is defined as the difference between the current level image and the highest level image, cost as rendering time, and L-distance as the level difference between the previous and the current level. To solve this problem, a new method called the well-distributed adaptive algorithmis proposed.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.9 no.5
• /
• pp.517-525
• /
• 1999

In this paper, we propose efficient total recognition system of handwritten and printed numerals for reducing the classification time. The proposed system consists of two-step neuroclassifier : Printed numerals classifier and handwritten numerals classifier. In the proposed scheme, the printed numerals classifier classifies the printed numerals rapidly with single MLP neural network by low-order feature vector and rejects handwritten numerals. The handwritten numerals classifier classifies the handwritten numerals which is rejected in printed numerals classifier with modularized cluster neural network by complex feature vector. In order to verify the performance of the proposed method,handwritten numerals database of NIST and printed numerals database which include various fonts are used in the experiments. In case of using the proposed classifier, the overall classification time was reduced by 49.1% - 65.5% in comparison of the existent handwritten classifier.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4C
• /
• pp.343-355
• /
• 2003

Fair bandwidth allocations at routers protect adaptive flows from non-adaptive ones and may simplify end-to end congestion control. However, traditional fair bandwidth allocation mechanisms, like Weighted Fair Queueing and Flow Random Early Drop, maintain state, manage buffera and perform packet scheduling on a per-flow basis. These mechanisms are more complex and less scalable than simple FIFO queueing when they are used in the interi or of a high-speed network. Recently, to overcome the implementation complexity problem and address the scalability and robustness, several fair bandwidth allocation mechanisms without per-flow state in the interior routers are proposed. Core-Stateless Fair Queueing and Rainbow Fair Queuing are approximates fair queueing in the core-stateless networks. In this paper, we proposed simple Layered Fair Queueing (SLFQ), another core-stateless mechanism to approximate fair bandwidth allocation without per-flow state. SLFQ use simple layered scheme for packet labeling and has simpler packet dropping algorithm than other core-stateless fair bandwidth allocation mechanisms. We presente simulations and evaluated the performance of SLFQ in comparison to other schemes. We also discussed other are as to which SLFQ is applicable.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.12 no.1
• /
• pp.92-98
• /
• 2001

When analyzing the scatting problem of multi-layered planar structures using closed-form Green's function, one of the main difficulties is that the numerical integrations for the evaluation of diagonal matrix elements converge slowly and are not so stable. Accordingly, even when the integration fur the singularity of type $e^{-jkr}/{\gamma}$, corresponding to the source dipole itself, is performed using such a method, this difficulty persists in the integration corresponding to the finite number of complex images. In order to resolve this difficulty, a new technique based upon the Gaussian quadrature in polar coordinates for the evaluation of the two-dimensional generalized exponential integral is presented. Stability of the algorithm and convergence is discussed. Performance is demonstrated for the example of a microstrip patch antenna.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.2
• /
• pp.299-307
• /
• 2012

Data mining is a method of searching for an interesting relationship among items in a given database. The decision tree is a typical algorithm of data mining. The decision tree is the method that classifies or predicts a group as some subgroups. In general, when researchers create a decision tree model, the generated model can be complicated by the standard of model creation and the number of input variables. In particular, if the decision trees have a large number of input variables in a model, the generated models can be complex and difficult to analyze model. When creating the decision tree model, if there are marginally conditional variables (intervening variables, external variables) in the input variables, it is not directly relevant. In this study, we suggest the method of creating a decision tree using marginally conditional variables and apply to actual data to search for efficiency.

• Journal of Korean Institute of Industrial Engineers
• /
• v.39 no.4
• /
• pp.271-277
• /
• 2013

In spite of the emphasis on quality control in auto-industry, most of subcontract enterprises still lack a systematic in-process quality monitoring system for predicting the product/part quality for their customers. While their manufacturing processes have been getting automated and computer-controlled ever, there still exist many uncertain parameters and the process controls still rely on empirical works by a few skilled operators and quality experts. In this paper, a real-time product quality monitoring system for auto-manufacturing industry is presented to provide the systematic method of predicting product qualities from real-time production data. The proposed framework consists of a product quality ontology model for complex manufacturing supply chain environments, and a real-time quality prediction tool using support vector machine algorithm that enables the quality monitoring system to classify the product quality patterns from the in-process production data. A door trim production example is illustrated to verify the proposed quality prediction model.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.22 no.10
• /
• pp.118-125
• /
• 2008

The outages of transmission lines give big damages to the industrial world Lightning outages occupy above 50[%] among the outages of transmission lines. To decrease the lightning outage rates, it is necessary to try countermeasures considering economical points. For the lightning protection of power transmission lines, it is very important to accurately predict the lightning outage rate because the reliability criterion for transmission line is normally specified as the number of flashovers per 100[km] per year. The phenomenon of an insulator flashover by a lightning stroke is a very complex electromagnetic event. And to calculate the lightning outage rates of transmission lines, so many calculation should be repeated because there are many overhead lines and power lines. Therefore it is necessary to develope a program for it. In this paper, we briefly introduce the basic concept for lightning outage calculation algorithm and the program.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.23 no.4
• /
• pp.407-416
• /
• 2020

Recent complex battle field demands Network Centric Warfare(NCW) ability to control various parts into a cohesive unit. In path planning filed, the NCW ability increases complexity of path planning algorithm, and it has to consider a communication coverage map as well as traditional parameters such as minimum radar exposure and survivability. In this paper, pros and cons of various propagation models are summarized, and we suggest a coverage map generation method using a Longley-Rice propagation model. Previous coverage map based on line of sight has significant discontinuities that limits selection of path planning algorithms such as Dijkstra and fast marching only. If there is method to remove discontinuities in the coverage map, optimization based path planning algorithms such as trajectory optimization and Particle Swarm Optimization(PSO) can also be used. In this paper, the Longley-Rice propagation model is used to calculate continuous RF strengths, and convert the strength data using smoothed leaky BER for the coverage map. In addition, we also suggest other types of rough coverage map generation using a lookup table method with simple inputs such as terrain type and antenna heights only. The implemented communication coverage map can be used various path planning algorithms, especially in the optimization based algorithms.