• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.2
• /
• pp.94-104
• /
• 2002

As a part of scientific data visualization automatic generation algorithms for a contour map have been investigated mainly on data which are defined at every lattice point. But in actual situation like weather data measurement. it is impossible to get data defined at every lattice point This is because the exact value on every lattice point can not be obtained due to characteristics in sampling devices or sampling methods. In order to define data on every lattice point where data were not sampled an interpolation method. was applied to the sample data to assign approximate values for some lattice type data but by using the non-lattice type of sample data sets. A triangle data link was defined by using non lattice points directly based on actually sample data set, not by using the pre-processed rectangle lattice points. The suggested algorithm generates a contour map a contour map only by using sample data set which are much smaller than old one without data interpolation and there is no skew on data any more since it does not need any interpolation to get the values of the defined lattice points.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.1
• /
• pp.26-33
• /
• 1992

This paper presents lattice structure of bilinear filter and the conversion equations from lattice parameters to direct-form parameters. Billnear models are attractive for adaptive filtering applications because they can approximate a large class of nonlinear systems adequately, and usually with considerable parsimony in the number of coefficients required. The lattice filter formulation transforms the nonlinear filtering problem into an equivalent multichannel linear filtering problem and then uses multichannel lattice filtering algorithms to solve the nonlinear filtering problem. The lattice filters perform a Gram-Schmidt orthogonalization of the input data and have very good easily extended to more general nonlinear output feedback structures.

• Journal of Mechanical Science and Technology
• /
• v.20 no.12
• /
• pp.2043-2051
• /
• 2006

This paper considered identification of vibration characteristics of flexible structure with vector channel periodic lattice filter. We present an algorithm for AR coefficients for the vector-channel lattice filters, and characteristic equation and transfer function are derived from these coefficients. Vibration lattice filter is then constructed from the vector channel lattice filter, and performance of this vibration filter is tested with a test signal which is a combination of many sine waves to compare the performance of scalar and vector channel lattice. Also it is applied to the cantilever data to identify properties of the system, such as natural frequencies and damping ratios, to show its performance.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10b
• /
• pp.451-455
• /
• 1987

In this Paper, recursive least-squares lattice algorithms for prewindowed given data case are considered, and some experimental results to linear prediction, the sequence of monthly electrical power sales is taken as time series, am presented.

• Journal of Korean Society for Atmospheric Environment
• /
• v.2 no.3
• /
• pp.52-56
• /
• 1986

In this paper a adaptive LMS(least mean-square) lattice predictor, which is composed of the adaptive lattice algorithm and LMS algorithm by Widrow-Hopf, is used to predict the future air pollution of the extraordinary levels in the environmental system. This prediction algorithm is applied to the one-step forward prediction of atmospheric CO concentration by using real observed data. Computer simulation proves that the power in the forward error sequences decreases as the number of stages in the lattice is increased.

• Journal of the Korean Ceramic Society
• /
• v.31 no.4
• /
• pp.420-426
• /
• 1994

A new method is proposed for the oxide lattice energy calculation. It is consisted of (1) setting a central and a computation domains in a real lattice, (2) calculation of inter-ionic potential producted by the associated portion of each ion to the relative domain, and (3) summing up the potential energies. Even with a slight expansion of the domain, the lattice energy converges to the published data. The method is superior than any other reported due to the simple and clear concept and the reduced computing.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.10
• /
• pp.1326-1337
• /
• 1995

In this paper, we transformed the bilinear filter into an equivalent linear multichannel filter and derived QR decomposition based recursive least squares algorithms for bilinear lattice filters. We also defined order update relation of the forward and the backward input vectors by using the channel decomposition. The forward and the backward data matrices were defined by using the forward and the backward input vectors and orthogonalized with the QR decomposition. we can obtain the lattice equations of the bilinear filters by using the channel decomposition. we can be derived the lattice equations of the bilinear filters using this decomposition process which are the same as the lattice equations derived by Baik, we can use the coefficient transformation algorithm proposed by Baik. We derived the equation error and the output error algorithm of the QRD based RLS bilinear lattice algorithm. Also, we evaluated the performance of the proposed algorithms through the system identification of the bilinear system.

• Journal of the Korean Statistical Society
• /
• v.28 no.4
• /
• pp.457-468
• /
• 1999

Autologistic lattice process is used to model binary spatial data. A conditional probability is derived for the incomplete data where the lattice consists of partially yet systematically observed sites. This result, which is interesting in its own right, is in turn applied to area prediction in the plane.

• Korean Journal of Materials Research
• /
• v.25 no.5
• /
• pp.221-225
• /
• 2015

In-situ neutron diffraction has been employed to examine the effect of strain path on lattice strain evolution during monotonic and cyclic tension in an extruded Mg-8.5wt.%Al alloy. In the cyclic tension test, the maximum applied stress increased with cycle number. Lattice strain data were acquired for three grain orientations, characterized by the plane normal to the stress axis. The lattice strain in the hard {10.0} orientation, which is unfavorably oriented for both basal slip and {10.2} extension twinning, evolved linearly throughout both tests during loading and unloading. The {00.2} orientation exhibited significant relaxation associated with {10.2} extension twinning. Coupled with a linear lattice strain unloading behavior, this relaxation led to increasingly compressive residual strains in the {00.2} orientation with increasing cycle number. The {10.1} orientation is favorably oriented for basal slip, and thus showed a soft grain behavior. Microyielding occurred in the monotonic tension test and in all cycles of the cyclic test at an applied stress of ~50 MPa, indicating that strain hardening in this orientation was not completely stable from one cycle to the next. The lattice strain unloading behavior was linear in the {10.1} orientation, leading to a compressive residual strain after every cycle, which, however, did not increase systematically from one cycle to the next as in the {00.2} orientation.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.2
• /
• pp.113-118
• /
• 2006

A new last design approach based on the Limb line FFD (LFFD) and Scale factor FFD (SFFD) is presented in this paper. The proposed last design method utilizes the dynamic trimmed parametric patches for the measured foot 3D data and last 3D data. Furthermore, the proposed last data generation system utilizes cross sectional data extracted obtained from the measured 3D foot data. First, the last design rule of the LFFD is constructed on the FFD lattice based on foot last shape analysis. Secondly, SFFD is constructed on the LFFD new lattice based on scale factor deformation. The scale factor is constructed on the boundary edges of polygonized patch and the cross section last data boundary edge of the polygon object. Suppose the two boundary curves have been preprocessed so that they run in the same direction and they forms the SF(Scale Factor). In addition, the control points of FFD lattice are derived with cross. sectional data interpolation methods from a finite set of 3D foot data.