• The Journal of Society for e-Business Studies
• /
• v.8 no.3
• /
• pp.117-130
• /
• 2003

It is not unusual to observe that there Is a great amount of redundant or inconsistent data even within an e-business system such as CRM(Customer Relationship Management) system. This problem becomes aggravate when we construct a system of which information are gathered from different sources. Data quality management is indeed needed to avoid any possible redundant or inconsistent data in such information system. A data quality process, in general, consists of three phases: data cleaning (scrubbing), matching, and integration phase. In this paper, we introduce and categorize data quality operators for each phase. Then, we describe our distance function used in the matching phase, and present a matching algorithm PRIMAL (a PRactical Matching Algorithm). And finally, we present a related work and future research.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.12
• /
• pp.2187-2192
• /
• 2006

This paper presents a method of constructing the universal multiple processing element unit(UMPEU) by De Bruijn Graph. The second method is as following. First, we propose transformation operators in order to construct the De Bruijn UMPEU using properties of graph. Second, we construct the transformation table of De Bruijn graph using above transformation operators. Finally we construct the De Bruijn graph using transformation table. The proposed UMPEU be able to construct the De Bruijn graph for any prime number and integer value of finite fields. Also the UMPEU is applied to fault-tolerant computing system, pipeline class. parallel processing network, switching function and its circuits.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.5
• /
• pp.67-75
• /
• 1999

This paper presents a production method to GRM coefficients which are consist of $P^n$ polarities to n variables over GF(p). In general production method to GRM coefficients is derived from RM coefficients to polarity 0 using RM expansion and extended to GRM coefficients. The procedure of proposed production method to GRM coefficients is consists of 2 steps. First, obtain the optimal polarity which is contains a minimal operation to single variable and then apply the same process to all generation process of GRM coefficients using cyclic property of the polarity. Proposed method simplify the generation procedure and reduces a number of operators because of the cyclic property of polarity.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.10
• /
• pp.1244-1251
• /
• 1988

Edge is one of the primitive features of an image and is widely used in image classification and analysis. New edge extration methods using central moments are presented and show various characteristics according to the order of moment, definition of both random variables and probability density functions. The proposed methods use the integral of differences between local mean and pixels in the window whereas most of conventional edge operators use only differential concepts. This gives good noise immunity and extracts fine edges.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.3
• /
• pp.549-555
• /
• 2006

An edge detection is an very important area in image processing and computer vision, General edge detection methods (Robert mask, Sobel mask, Kirsh mask etc) are a good performance to detect step edge in a image but are no good performance to detect step edge in a noses image. We suggested a step edge detection method based on image information measure and neutral network. Using these essential properties of step edges, which are directional and structural and whose gray level distribution in neighborhood, as a input vector to the BP neutral network we get the good result of proposed algorithm. And also we get the satisfactory experimental result using rose image and cell images an experimental and analysing image.

• Journal of the Korean Chemical Society
• /
• v.20 no.5
• /
• pp.340-350
• /
• 1976

Linear response theory is proposed to be applied for theoretical description of the phenomena in mechanical spectroscopy of solid high polymers below glass transition temperatures. The energy dissipation by sample is given in terms of certain time correlation functions. It is shown that the result leads to the result by Kirkwood on the energy loss and relaxation of cross-linked polymers, if the Liouville operator is replaced by the diffusion equation operator of Kirkwood. An approximation method of calculating the correlation functions is considered in order to show a way to calculate relaxation times. Using the approximation method, we consider a double-well potential model for energy relaxation, in order to see a connection between the present theory and a model theory used in mechanical energy relaxation phenomena of solid polymers containing pendant cyclohexyl groups at low temperature.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.6
• /
• pp.61-70
• /
• 2011

In this paper, it is realized an image filter for a noise elimination using a recurrent neural networks with fuzzy. The proposed fuzzy neural networks structure is to converge weights and the number of iteration for a certain value by using basically recurrent neural networks structure and is simplified computation and complexity of mathematics by applying the hybrid fuzzy membership function operator. In this paper, the proposed method, the recurrent neural networks applying fuzzy which is collected a certain value, has been proved improving average 0.38dB than the conventional method, the generalied recurrent neural networks, by using PSNR. Also, a result image of the proposed method was similar to the original image than a result image of the conventional method by comparing to visual images.

• Computational Structural Engineering
• /
• v.7 no.4
• /
• pp.85-101
• /
• 1994

A family of variational principles governing the dynamics of laminated plate has been derived using a variationally consistent shear deformable discrete laminated plate theory with particular reference to finite element procedures. The theoretical basis for the derivation is Sandhu's generalized procedure for the variational formulation of linear coupled boundary value problem. As the bilinear mapping to write the operator matrix of the field equations in self-adjoint form, convolution product was employed. Boundary conditions, initial conditions and probable internal discontinuity were explicitly included in the governing functionals. Some interesting extensions and specializations of the general variational principle were presented, which can provide many different finite element formulations for the problem.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.10 no.4
• /
• pp.550-563
• /
• 1999

A wavelet-Galerkin scheme based on the time-dependent Maxwell's equations is presented. Daubechies wavelet with two vanishing wavelet moments is expanded for basis function in spatial domain and Yee's leap-frog approach is applied. The shifted interpolation property of Daubechies wavelet family leads to the simplified formulations for inhomogeneous media without the additional matrices for the integral or material operator. The stability condition is formulated. The dispersion characteristics are analyzed and compared with those of finite difference time domain and multiresolution time domain methods. The analyses show the excellent trade-off between the regularity and the support width of the basis function. Although the basis function has only two vanishing wavelet moments, it is enough to provide negligible dispersive error in the numerical analysis and its compact support enables only several involved terms per nodes. The storage effectiveness, execution time reduction and accuracy of this scheme are demonstrated by calculating the resonant frequencies of the homogeneous and inhomogeneous cavities.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.1
• /
• pp.217-228
• /
• 2009

Data analysis applications typically aggregate data across many dimensions looking for unusual patterns in data. Even though such applications are usually possible with standard structured query language (SQL) queries, the queries may become very complex. A complex query may result in many scans of the base table, leading to poor performance. Because online analytical processing (OLAP) queries are usually complex, it is desired to define a new operator for aggregation, called the data cube or simply cube. Data cube supports OLAP tasks like aggregation and sub-totals. Many aggregate functions can be used to construct a data cube. Those functions can be classified into three categories, the distributive, the algebraic, and the holistic. It has been thought that the distributive functions such as SUM, COUNT, MAX, and MIN can be used to construct a data cube, and also the algebraic function such as AVG can be used if the function is replaced to an intermediate function. It is believed that even though AVG is not distributive, but the intermediate function (SUM, COUNT) is distributive, and AVG can certainly be computed from (SUM, COUNT). In this paper, however, it is found that the intermediate function (SUM COUNT) cannot be applied to OLAP cubes, and consequently the function leads to erroneous conclusions and decisions. The objective of this study is to identify some problems in applying aggregate function AVG to OLAP cubes, and to design a process for solving these problems.