• Journal of the Korea Computer Graphics Society
• /
• v.2 no.1
• /
• pp.7-14
• /
• 1996

A particle system is defined as a collection of primitive particles that together represent irregular and ever-changing objects such as smoke, clouds, waterfalls, and explosions. A particle system can be a powerful tool for modeling a deformable object's motion and change of form since it has dynamic properties with time. As an object becomes more complicated and shows more chaotic behavior, however, we need much more parameters for describing its characteristics completely. Consequently, the conventional particle system leads to difficulty in managing all of the parameters properly since one parameter can affect the others. Moreover, motion equations for representing particles' behavior are usually approximated to gain speed-ups. The inevitable errors in calculating the equations can cause an unexpected outcome. In this paper, we present a new approach of applying fuzzy contol to mage particles' motion and attributes changes over time. We also give an implementation result of a fuzzy particle system to show the feasibility of the proposed method. Applications of the system to explosions, nebulae, volcanos, and grass are presented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.8
• /
• pp.942-949
• /
• 2016

Efficient routing protocols designed for Wireless Sensor Networks (WSN) can be extended and applied to Internet of Things (IoT) data routing, as IoT can be considered to be an extension from WSN. When the size of the data in IoT is often bigger than in conventional WSNs, existing cluster routing protocol such as LEACH may cause high data loss rate due to its incomplete load balancing. We present an enhanced LEACH-based protocol which can minimize the data loss which is an important performance measure in IoT. In our proposed protocol, the base station estimates the location of nodes by the trilateration technique to make sure optimal number of cluster heads and members in a deterministic manner. We evaluate our proposed protocol via computer simulations in terms of data loss rate and average network lifetime.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.5
• /
• pp.1161-1171
• /
• 1993

Model materials are developed to achieve similarity of flow patterns for mild steels in forming processes at high temperatures. The model materials consist of pure plasticine and one or two additives such as resin and lanolin. To verify the similarity of flow patterns between physical modeling and compression of mild steels at high temperatures, ring and compression tests have been carried out with the developed-model materials at various strain rates, temperatures and lubricants. The test results are in good agreement with the flow patterns obtained from upsetting of a mild steel at high temperatures.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.32 no.10
• /
• pp.28-37
• /
• 2004

A two-dimensional direct numerical simulation was performed to investigate the evolution and vortical structure of a single vortex in reacting and non-reacting jet flow fields. A predictor-corrector-type numerical scheme with a low Mach number approximation was used, and a two-step global reaction mechanism was adopted as the combustion model. Through the comparisons of single vortex behaviors in reacting and non-reacting jet flow fields, it was found that the evolution characteristics and vortical structure of the single vortex were significantly influenced by a outer vortex that was generated from the buoyance effect as well as the chemical heat release. Furthermore, it was also identified that the differences of the vortical structure in reacting and non-reacting jet flow fields were mainly attributed to the thermal expansion, Baroclinic torque and buoyance effect.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.17 no.4
• /
• pp.11-17
• /
• 1980

This paper describes realization of digital filter using $\mu$p controler and discusses measured characteristics of this filter, The idea of P. L. implementation[1] is used in realization, and in this system we utilize a DMA and arithmatic control program of $\mu$p. In this way, we can get more flexible capability than the basic PL method, and higher speed than a filter using general purpose $\mu$p in hardware, Furthermore, we get a 15 KHz sampling frequency(fs) as speed limit in real time processing, and know that this limitation is restricted by execution time (58$\mu$ sec) of DMA control statement. As for filter charateristics, maximum stop band frequencies (fsp) are 1665 Hz, 1445 Hz in Butterworth and Tchebichef approximation, respectively, when fs = 14 KHz. Measured errors between the design specification and the actual result are 0.2dB, 0.1 dB in pass band (when cufoff frequency is 500Hz),-1.1dB (when fsp is 1000Hz), 0.4dB(when fsp is 750 Hz) in stop band frequency of Butterworth and Tchebichef, respectively.

• Journal of the Korea Computer Graphics Society
• /
• v.15 no.1
• /
• pp.7-15
• /
• 2009

In this paper, a novel framework that synthesizes and clones facial expression in parameter spaces is presented. To overcome the difficulties in manipulating face geometry models with high degrees of freedom, many parameterization methods have been introduced. In this paper, a data-driven parameterization method is proposed that represents a variety of expressions with a small set of fundamental independent movements based on the ICA technique. The face deformation due to the parameters is also learned from the data to capture the nonlinearity of facial movements. With this parameterization, one can control the expression of an animated character's face by the parameters. By separating the parameterization and the deformation learning process, we believe that we can adopt this framework for a variety applications including expression synthesis and cloning. The experimental result demonstrates the efficient production of realistic expressions using the proposed method.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.10
• /
• pp.1012-1015
• /
• 2011

The decision-directed blind equalization algorithm is often used due to its simplicity and good convergence property when the eye pattern is open. However, in a channel where the eye pattern is closed, the decision-directed algorithm is not guaranteed to converge. Hence, a modified Bussgang-type algorithm using a hyperbolic tangent function for zero-memory nonlinear(ZNL) function has been proposed and applied to avoid this problem by Filho et al. But application of this algorithm includes the calculation of hyperbolic tangent function and its derivative or a look-up table which may need a large amount of memory due to channel variations. To reduce the computational and/or hardware complexity of Filho's algorithm, in this paper, an improved method for the decision-directed algorithm is proposed. In the proposed scheme, the ZNL function and its derivative are respectively set to be the original signum function and a narrow rectangular pulse which is an approximation of Dirac delta function. It is shown that the proposed scheme, when it is combined with decision-directed algorithm, reduces the computational complexity drastically while it retains the convergence and steady-state performance of the Filho's algorithm.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.6
• /
• pp.635-641
• /
• 2010

Time-varying channel characteristics in OFDM systems over doubly selective channels cause inter-carrier interferences(ICI) in the frequency domain. Time domain windowing gives rise to restriction on the bandwidth of the frequency domain channel matrix and makes it possible to approximate the OFDM system as a simplified linear input-output model. When successive interference cancellation based on linear MMSE estimation is employed for channel equalization in OFDM systems, symbol detection ordering produces considerable effects on overall system performances. In this paper, we show the reduction of the residual ICI by time domain windowing and the resultant performance improvements, and investigate the effects of SINR- and CSEP-based symbol detection ordering on the performance of successive interference cancellation.

• The Journal of Engineering Geology
• /
• v.29 no.4
• /
• pp.417-425
• /
• 2019

Agricultural groundwater use accounts for 51.8% of total groundwater use, so accurate estimation of groundwater use is important for efficient groundwater management. The purpose of this study is to develop a method for estimating the groundwater use of agricultural (rice farming and dry-field farming) wells using regression tree model based on the measured data of 370 wells. Three input variables of the model were evaluated as being significant: well depth, pipe diameter, and pump capacity, and the importance of each variable was 75% for well depth, 17% for pipe diameter, and 8% for pumping capacity. The daily usage of agricultural (rice farming and dry-field farming) wells by the regression tree model was estimated to be very similar to the actual usage, compared to the previous estimation method proposed by the Ministry of Construction and Transportation. In the future, it is expected that the reliability of the usage statistics will be improved if additional observed data is secured and this classification method is modified.

• Journal of Internet Computing and Services
• /
• v.17 no.1
• /
• pp.47-53
• /
• 2016

A type of workflow affiliation network is one of the specialized social network types, which represents the associative relation between actors and activities. There are many methods on a workflow affiliation network measuring centralities such as degree centrality, closeness centrality, betweenness centrality, eigenvector centrality. In particular, we are interested in the closeness centrality measurements on a workflow affiliation network discovered from enterprise workflow models, and we know that the time complexity problem is raised according to increasing the size of the workflow affiliation network. This paper proposes an estimated ranking algorithm and analyzes the accuracy and average computation time of the proposed algorithm. As a result, we show that the accuracy improves 47.5%, 29.44% in the sizes of network and the rates of samples, respectively. Also the estimated ranking algorithm's average computation time improves more than 82.40%, comparison with the original algorithm, when the network size is 2400, sampling rate is 30%.