• 한국음향학회:학술대회논문집
• /
• 한국음향학회 1992년도 학술논문발표회 논문집 제11권 1호
• /
• pp.66-70
• /
• 1992

This paper describes the simplified DTW algorithm for real time korean digit recognition and construct the digit recognition system using that algorithm. The DTW algorithm which is used nowadays have problems on real time recognition because of its massive computation. But, simplified DTW algorithm, which is proposed in this paper, solved these problems. In the case of single syllable, we use the characteristic of uniform distribution of epansion and contraction on time ais, compare distance of input pattern and reference pattern using constrainedly restricted path. As a result, we can reduce a great deal of computation and achieved that the real time korean digit recognition system.

• 한국산학기술학회논문지
• /
• 제13권5호
• /
• pp.2403-2407
• /
• 2012

압축하중을 받는 말뚝의 하중-침하관계를 구하기 위한 하중전이법에서는 말뚝을 유한개의 요소로 분할하고 각각의 요소들에 대하여 말뚝주면변위와 주면 전이하중 그리고 말뚝선단변위와 선단저항력 사이의 적합조건으로부터 말뚝 요소의 단면력과 변위를 계산하게 된다. 통상적인 하중전이법에 의할 경우 모든 말뚝요소들에 대하여 하중-변위 사이의 적합조건을 만족하도록 반복계산을 수행해야 하므로 계산량이 과다한 단점이 있다. 본 연구에서는 압축하중을 받는 말뚝에 대한 미분방정식을 유한차분식으로 정식화하여 말뚝 바닥요소를 제외한 요소에 대해서는 반복계산 없이 직접 말뚝 단면력과 변위량을 계산할 수 있는 간편 계산법을 도입하였다. 간편 계산법에 의한 계산결과를 기존의 해석자료와 비교하여 보았는데 하중-침하관계와 말뚝 단면력 분포가 일치함을 알 수 있었다.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2003년도 추계 학술대회논문집
• /
• pp.43-48
• /
• 2003

When the Eulerian-Lagrangian method is used to analyze the particle laden two-phase flow, a large number of particles should be used to obtain statistically meaningful solutions. Then it takes too much time to track the particles and to average the particle properties in the numerical analysis of two-phase flow. The purpose of this paper is to reduce the computation time by means of a set of particle gird separate to the flow grid. Particle motion equation here is the simplified B-B-O equation, which is integrated to get the particle trajectories. Particle turbulent dispersion, wall collision, and wall roughness effects are considered but the two-way coupling effects between gas and particles are neglected. Particle laden 2-D channel flow is solved and it is shown that the computational efficiency is indeed improved by using the current method

• Structural Engineering and Mechanics
• /
• 제35권2호
• /
• pp.127-140
• /
• 2010

This paper focuses on a number of criteria that enable controlling the influence of geometric simplification on the quality of finite element (FE) computations. To perform the mechanical simulation of a component, the corresponding geometric model typically needs to be simplified in accordance with hypotheses adopted regarding the component's mechanical behaviour. The method presented herein serves to compute an a posteriori indicator for the purpose of estimating the significance of each feature removal. This method can be used as part of an adaptive process of geometric simplification. If a shape detail removed during the shape simplification process proves to be influential on mechanical behaviour, the particular detail can then be reinserted into the simplified model, thus making it possible to readapt the initial simulation model. The fields of application for such a method are: static problems involving linear elastic behaviour, and linear thermal problems with stationary conduction.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2013년도 춘계학술발표대회
• /
• pp.472-473
• /
• 2013

The growth in number and efficiency of smart devices such as GPS enabled smart phones and PDAs present an unparalleled opportunity for diverse areas of life. However extraction of GPS traces for provision of services demand a huge storage space as well as computation overhead. This is a challenging task especially for the applications which provide runtime services. In this paper we provide a simplified model to extract GPS traces of moving objects at runtime. Road segment partitioning and measure of deviation in angle of trajectory path is incorporated to identify the significant data points. The number of these data points is minimized by our proposed approach in an efficient manner to overwhelm the storage and computation overhead. Further, the competent reconstruction of complete itinerary based on gathered data, is also ensured by proposed method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권4호
• /
• pp.1504-1526
• /
• 2018

For uplink multi-user massive MIMO systems, conventional minimum mean square error (MMSE) linear detection method achieves near-optimal performance when the number of antennas at base station is much larger than that of the single-antenna users. However, MMSE detection involves complicated matrix inversion, thus making it cumbersome to be implemented cost-effectively and rapidly. In this paper, we first summarize in detail the state-of-the-art simplified MMSE detection algorithms that circumvent the complicated matrix inversion and hence reduce the computation complexity from ${\mathcal{O}}(K^3)$ to ${\mathcal{O}}(K^2)$ or ${\mathcal{O}}(NK)$ with some certain performance sacrifice. Meanwhile, we divide the simplified algorithms into two categories, namely the matrix inversion approximation and the classical iterative linear equation solving methods, and make comparisons between them in terms of detection performance and computation complexity. In order to further optimize the detection performance of the existing detection algorithms, we propose more proper solutions to set the initial values and relaxation parameters, and present a new way of reconstructing the exact effective noise variance to accelerate the convergence speed. Analysis and simulation results verify that with the help of proper initial values and parameters, the simplified matrix inversion based detection algorithms can achieve detection performance quite close to that of the ideal matrix inversion based MMSE algorithm with only a small number of series expansions or iterations.

• Journal of information and communication convergence engineering
• /
• 제5권3호
• /
• pp.239-244
• /
• 2007

In the telematics system, a reasonable path search time should be guaranteed from a great number of user's queries, even though the optimal path with minimized travel time might be continuously changed by the traffic flows. Thus, the path search method should consider traffic flows of the roads and the search time as well. However, the existing path search methods are not able to cope efficiently with the change of the traffic flows and to search rapidly paths simultaneously. This paper proposes a new path search method for fast computation. It also reflects the traffic flows efficiently. Especially, in order to simplify the computation of variable heuristic values, it employs a simplification method for estimating values of traffic-adaptable heuristics. The experiments are carried out with the $A^*$ algorithm and the proposed method in terms of the execution time, the number of node accesses and the accuracy. The results obtained from the experiments show that the method achieves very fast execution time and the reasonable accuracy as well.

• 대한기계학회논문집A
• /
• 제27권10호
• /
• pp.1661-1666
• /
• 2003

The purpose of this study is to develop the simplified model of the crankshaft in the large marine engine for dynamic analysis. Because the actual engine system is under complex dynamic loading condition and it has multi-cylinder, the dynamic analysis is purchased at a high computation cost. In spite of this burden, the dynamic analysis must be perfonned to assure structural integrity of operating marine engine. Therefore, simplification of the analytic model is necessary for dynamic analysis. Beam-mass model, which is generated with the section property method, is the model simplified effectively. Section property method can provide desired section information by optimization technique. By applying beam-mass model to the crankshaft in the large marine engine, the usefulness of the proposed method was proven.

• Journal of applied mathematics & informatics
• /
• 제29권3_4호
• /
• pp.847-858
• /
• 2011

We make use of the simplified Hirota's bilinear method with computer symbolic computation to study a variety of coupled potential KdV (pKdV) equations. Each coupled equation is completely integrable and gives multiple soliton solutions and multiple singular soliton solutions. The phase shifts for all coupled pKdV equations are identical whereas the coefficients of the obtained solitons are not identical. The four coupled pKdV equations are resonance free.

• Journal of Power Electronics
• /
• 제19권6호
• /
• pp.1429-1439
• /
• 2019

Buck-Boost LLC (BBLLC) converters based on a PWM + phase control strategy are good candidates for high efficiency, high power density and wide input range applications. Nevertheless, they suffer from large computational complexity when it comes to calculating the optimal phase for ZVS of all the switches. In this paper, a method is proposed for a microcontroller unit (MCU) to calculate the optimal phase quickly and accurately. Firstly, a 2-D lookup table of the phase is established with an index of the input voltage and output current. Then, a bilinear interpolation method is applied to improve the accuracy. Meanwhile, simplification of the phase equation is presented to reduce the computational complexity. When compared with conventional curve-fitting and LUT methods, the proposed method makes the best tradeoff among the accuracy of the optimal phase, the computation time and the memory consumption of the MCU. Finally, A 350V-420V input, 24V/30A output experimental prototype is built to verify the proposed method. The efficiency can be improved by 1% when compared with the LUT method, and the computation time can be reduced by 13.5% when compared with the curve-fitting method.