• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.12
• /
• pp.85-98
• /
• 1998

This paper proposes a new design method of neuro-FLC by the Lamarckian co-adaptation scheme that incorporates the backpropagation learning into the GA evolution in an attempt to find optimal design parameters (fuzzy rule base and membership functions) of application-specific FLC. The design parameters are determined by evolution and learning in a way that the evolution performs the global search and makes inter-FLC parameter adjustments in order to obtain both the optimal rule base having high covering value and small number of useful fuzzy rules and the optimal membership functions having small approximation error and good control performance while the learning performs the local search and makes intra-FLC parameter adjustments by interacting each FLC with its environment. The proposed co-adaptive design method produces better approximation ability because it includes the backpropagation learning in every generation of GA evolution, shows better control performance because the used COG defuzzifier computes the crisp value accurately, and requires small workspace because the optimization procedure of fuzzy rule base and membership functions is performed concurrently by an integrated fitness function on the same fuzzy partition. Simulation results show that the Lamarckian co-adapted FLC produces the most superior one among the differently generated FLCs in all aspects such as the number of fuzzy rules, the approximation ability, and the control performance.

• Journal of KIISE:Databases
• /
• v.31 no.5
• /
• pp.492-504
• /
• 2004

Recently, as growing of interest for LBS(location-based services) techniques, lots of works on moving objects that continuously change their information over time, have been performed briskly. Also, researches for NN(nearest neighbor) query which has often been used in LBS, are progressed variously However, the results of conventional NN Query processing techniques may be invalidated as the query and data objects move. Therefore, they are usually meaningless in moving object management system such as LBS. To solve these problems, in this paper we propose a new nearest neighbor query processing technique, called CTNN, which is possible to meet accurate and continuous query processing for moving objects. Our techniques include an Approximate CTNN(ACTNN) technique, which has quick response time, and an Exact CTNN(ECTNN) technique, which makes it possible to search nearest neighbor objects accurately. In order to evaluate the proposed techniques, we experimented with various datasets. Experimental results showed that the ECTNN technique has high accuracy, but has a little low performance for response time. Also the ACTNN technique has low accuracy comparing with the ECTNN, but has quick response time The proposed techniques can be applied to navigation system, traffic control system, distribution information system, etc., and specially are most suitable when both data and query are moving objects and when we already know their trajectory.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.3
• /
• pp.15-26
• /
• 2012

Recently, due to applicability increase of vector data based digital map for geographic information and evolution of geographic measurement techniques, large volumed GIS(geographic information service) services having high resolution and large volumed data are flowing actively. This paper proposed an efficient vector map compression technique using the SEC(spatial energy compaction) based on classified bins for the vector map having 1cm detail and hugh range. We encoded polygon and polyline that are the main objects to express geographic information in the vector map. First, we classified 3 types of bins and allocated the number of bits for each bin using adjacencies among the objects. and then about each classified bin, energy compaction and or pre-defined VLC(variable length coding) were performed according to characteristics of classified bins. Finally, for same target map, while a vector simplification algorithm had about 13%, compression ratio in 1m resolution we confirmed our method having more than 80% encoding efficiencies about original vector map in the 1cm resolution. Also it has not only higher compression ratio but also faster computing speed than present SEC based compression algorithm through experimental results. Moreover, our algorithm presented much more high performances about accuracy and computing power than vector approximation algorithm on same data volume sizes.

• Journal of the Korea Computer Graphics Society
• /
• v.11 no.2
• /
• pp.40-46
• /
• 2005

본 논문에서는 스윕곡면(sweep surface)을 기반으로 복잡한 3차원 물체의 형상을 변형하는 새로운 자유형상 변형(free-form deformation)기법을 제시한다. 본 논문에서 제시한 방법은 기존의 격자점(control lattices)을 조정하는 체적기반의 방법에 비해 스윕기반의 절차적 (procedural) 모델링 기법의 직관성을 활용하여 사용자에게 보다 효율적인 형상변형 기법을 제공한다. 3차원 물체의 정점들은 스윕곡면의 단면(cross-section)에 바인딩(binding) 되어 곡면의 변화에 따라 형상변형을 한다. 본 논문에서 제시한 스윕기반 형상변형 기법은 3차원 물체를 부분적으로 변형하는 기법과 계층구조를 기반으로 전반적인 형상을 변형하는 기법으로 구분된다. 부분적인 형상변형 기법은 스윕곡면을 구성하는 성분의 다단계(multi-level) 표현을 통하여 사용자에게 다중해상도(multi-resolution) 형상변형 기능을 제공한다. 계층구조에 기반한 형상변형 기법은 복잡한 3차원 물체를 위상구조에 따라 여러 계층으로 분할하고, 각 부분의 형상을 근사하는 스윕곡면들을 생성한다. 분할된 각 부분의 정점(vertices)들은 해당 스윕곡면에 바인딩 되어 스윕곡면의 단면의 변화를 따르게 된다. 이러한 상황하에서 스윕곡면들은 3차원 물체의 계층구조에 따라서 서로 상호작용(interaction)을 하게 되고, 결과적으로 3차원 물체의 각부분은 상호반응적 형상변형을 한다. 이러한 계층구조에 기반한 상호반응적 형상변형 기법은 사용자의 의도에 부합하는 보다 사실적이고 기능적인 형상변형을 가능하게 한다. 본 논문에서는 다양한 3차원 물체에 대한 실험을 통해 제시된 방법의 효율성을 입증한다. 결과 막성 사구체병증과 같은 신질환이 발견될 수 있으므로 신조직검사의 적응증에 합당한 경우 적극적인 신조직검사를 시행하여 원인 질환을 찾는 노력이 필요할 것으로 사료된다.. 남아가 75명으로 남녀비는 3.6:1을 보였다. 임상병리학적 분류상 일차성 신증후군이 89명(92.7%), 이차성 신증후군이 7명(7.3%)이었으며 일차성 신증후군에서 minimal change nephrotic syndrome이 71명으로 79.8%, focal segmental glomerulosclerosis 11.2%, mesangial proliferation 4.5%, membranoprolifrative glomeulonephritis 3.4%, membranous nephropathy 1명 1.1%이었으며 2차성 신증후군은 $Henoch-Sch\"{o}nlein$ nephritis가 3례로 가장 많았다. 미세변화 신증후군 71명 중 비재발군이 16명으로 22.5%, 비빈발 재발군 49.3%, 빈발 재발군 18.3%, 스테로이드 의존군 9.9%를 보였다. 결론 : 대전시에서의 신증후군 환아의 발생빈도는 15세이하 소아 10만명당 약 5명으로 추정되었으며 10여 년전과 비교하여 큰 변화를 보이지는 않았다. 또한 저자들의 임상병리학적 연구결과가 다른 문헌에서 보고된 소아 신증후군의 연구결과와 큰 차이를 보이지 않음을 알 수 있었다. 자극에 차이가 있지 않나 추측되며 이에 관한 추후 연구가 요망된다. 총대장통과시간의 단축은 결장 분절 모두에서 줄어들어 나타났으나 좌측결장 통과시간의 감소 및 이로 인한 이 부위의 통과시간 비율의 저하가 가장 주요하였다. 이러한 결과는 차가운 생수 섭취가 주로 결장 근위부를 자극하는

• 전자공학회논문지 IE
• /
• v.43 no.3
• /
• pp.41-48
• /
• 2006

In this paper, we propose a new active queue management (AQM) scheme by utilizing the predictability of the Internet traffic. The proposed scheme predicts future traffic input rate by using the auto-regressive (AR) time series model and determines the future congestion level by comparing the predicted input rate with the service rate. If the congestion is expected, the packet drop probability is dynamically adjusted to avoid the anticipated congestion level. Unlike the previous AQM schemes which use the queue length variation as the congestion measure, the proposed scheme uses the variation of the traffic input rate as the congestion measure. By predicting the network congestion level, the proposed scheme can adapt more rapidly to the changing network condition and stabilize the average queue length and its variation even if the traffic input level varies widely. Through ns-2 simulation study in varying network environments, we compare the performance among RED, Adaptive RED (ARED), REM, Predicted AQM (PAQM) and the proposed scheme in terms of average queue length and packet drop rate, and show that the proposed scheme is more adaptive to the varying network conditions and has shorter response time.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.32 no.3B
• /
• pp.175-183
• /
• 2012

In this study, Galerkin scheme and SU/PG scheme of Petrov-Galerkin family were applied to the shallow water equations and a finite element model for shallow water flow was developed. Numerical simulations were conducted in several flumes with convection-dominated flow condition. Flow simulation of channel with slender structure in the water course revealed that Galerkin and SU/PG schemes showed similar results under very low Fr number and Re number condition. However, when the Fr number increased up to 1.58, Galerkin scheme did not converge while SU/PG scheme produced stable solutions after 5 iterations by Newton-Raphson method. For the transcritical flow simulation in diverging channel, the present model predicted the hydraulic jump accurately in terms of the jump location, the depth slope, and the flow depth after jump, and the numerical results showed good agreements with the hydraulic experiments carried out by Khalifa(1980). In the oblique hydraulic jump simulation, in which convection-dominated supercritical flow (Fr=2.74) evolves, Galerkin scheme blew up just after the first iteration of the initial time step. However, SU/PG scheme captured the boundary of oblique hydraulic jump accurately without numerical oscillation. The maximum errors quantified with exact solutions were less than 0.2% in water depth and velocity calculations, and thereby SU/PG scheme predicted the oblique hydraulic jump phenomena more accurately compared with the previous studies (Levin et al., 2006; Ricchiuto et al., 2007).

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.6
• /
• pp.307-317
• /
• 2002

In this paper we propose a new mesh reconstruction scheme that produces a displaced subdivision surface directly from unorganized points. The displaced subdivision surface is a new mesh representation that defines a detailed mesh with a displacement map over a smooth domain surface, but original displaced subdivision surface algorithm needs an explicit polygonal mesh since it is not a mesh reconstruction algorithm but a mesh conversion (remeshing) algorithm. The main idea of our approach is that we sample surface detail from unorganized points without any topological information. For this, we predict a virtual triangular face from unorganized points for each sampling ray from a parameteric domain surface. Direct displaced subdivision surface reconstruction from unorganized points has much importance since the output of this algorithm has several important properties: It has compact mesh representation since most vertices can be represented by only a scalar value. Underlying structure of it is piecewise regular so it ran be easily transformed into a multiresolution mesh. Smoothness after mesh deformation is automatically preserved. We avoid time-consuming global energy optimization by employing the input data dependant mesh smoothing, so we can get a good quality displaced subdivision surface quickly.

• Journal of Korean Society of Steel Construction
• /
• v.10 no.3 s.36
• /
• pp.451-461
• /
• 1998

The solution of anisotropic plate via the classical methods is limited to relatively load and boundary conditions. If these conditions are more complex, the analysis becomes increasingly tedious and even impossible. For many plate problems of considerable practical interest, analytic solutions to the governing differential equations cannot be found. Among the numerical techniques presently available, the finite difference method and the finite element method are powerful numerical methods. The objective of this paper is to compare with each numerical methods for the buckling load and modes of anisotropic composite laminated plates considering shear deformation. In applying numerical methods to solve differential equations of anisotropic plates, this study uses the finite difference method and the finite element method. In determining the eigenvalue by Finite Difference Method, this paper represent good convergence compared with Finite Element Method. Several numerical examples and buckling modes show the effectiveness of various numerical methods and they will give a guides in deciding minimum buckling load and various mode shapes.

• Journal of Korean Society for Geospatial Information Science
• /
• v.9 no.1 s.17
• /
• pp.39-47
• /
• 2001

DTM(Digital Terrain Model) can play a key rule in a great number of the fields of construction Engineering. One of the most important application fields is to determine volume in that the total construction expenses is usually calculated through this. It therefore is necessary to the study on improving the precise of the determination using DTM on account of saving time and cost. On this study, 1:5000 topographic maps issued by NGI in 15 districts involved in Pusan city was digitalized to generate DTM at first. After this step, not only was the determination of the volume as well as readjusted area and height done for the sake of estimating the changable topography caused by cut & fill volume in future but also provided the model to calculate it as results. In addition, comparison among the interpolations, such as Inverse Distance Method and Nearest Neighbor, was respectively done to look over the differences of the volume estimated from each interpolation and also to find the most suitable method. As a result, the former yielded the largest values of area and the volume while the latter gave the smallest ones. Moreover, the values estimated on this study were closely similar to ones obtained by the government of Pusan.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.37 no.4
• /
• pp.461-466
• /
• 2013

Advanced fiber-reinforced laminated composites are widely used in various fields of engineering to reduce weight. The material property of each ply is well known; specifically, it is known that ply is less reliable than metallic materials and very sensitive to the loading direction. Therefore, it is important to consider this uncertainty in the design of laminated composites. In this study, reliability analysis is conducted using COMSOL and MATLAB interactions for a laminated composite plate for the case in which the tip deflection is the design requirement and the material property is a random variable. Furthermore, the efficiency and accuracy of the approximation method is identified, and a probabilistic sensitivity analysis is conducted. As a result, we can prove the applicability of the advanced design method for the stabilizer of an underwater vehicle.