• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2001.11a
• /
• pp.155-160
• /
• 2001

Actual engineering structure is frequently very complex, and parts of structure are designed independently by different engineers. Also each structure contains so many degree of freedom. For these reason, methods have been developed which permits the structure to be divided into components or substructures, with analysis being done on a small substructure in order to obtain a full structural system. In such case, because of different mesh size among finite element model (FEM) or different matching points among FEM models and experimentally obtained models, their interfacing points may be non-matching. Solving this non-matching problem is useful to other application such as structural dynamic modification or model updating. In this work, virtual node concept is introduced. Lagrange multipliers are used to enforce the interface compatibility constraint, and interface displacement is approximated by polynomial presentation. The governing equation of whole structure is derived using hybrid variational principle. The eigenvalue of whole structure are calculated using the determinant search method. The number of degree of freedom in the eigenvalue problem can be drastically reduced to just the number of interface degree of freedom. Some numerical simulation is performed to show usefulness of synthesis method.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.4
• /
• pp.54-64
• /
• 1999

This paper proposes an efficient handwritten English word recognition scheme which can be applied practical applications. To effectively use the lexicon which is available in most handwriting related applications, the lexicon entries are introduced in the early stage of the recognition. Dynamic programming is used for matching between over-segmented character segments and letters in the lexicon entries. Character segmentation statistics which can be obtained while the training is being performed are used to adjust the matching window size. Also, the matching results between the character segments and the letters in the lexicon entries are cached to avoid repeat of the same computation. In order to verify the effectiveness of the proposed methods, several experiments were performed using thousands of word images with various writing styles. The results show that the proposed methods significantly improve the matching speed as well as the accuracy.

• The Journal of the Korean dental association
• /
• v.58 no.3
• /
• pp.152-168
• /
• 2020

The propensity score matching method is a statistical method used to reduce selection bias in observational studies and to show effects similar to random allocation. There are many observational studies in dentistry research, and differences in baseline covariates between the control and case groups affect the outcome. In order to reduce the bias due to confounding variables, the propensity scores are used by equating groups based on the baseline covariates. This method is effective, especially when there are many covariates or the sample size is small. In this paper, the propensity score matching method was explained in a simple way with a dental example by using R software. This simulated data were obtained from one of retrospective study. The control group and the case group were matched according to the propensity score and compared before and after treatment. The propensity score matching method could be an alternative to compensate for the disadvantage of the observation study by reducing the bias based on the covariates with the propensity score.

• International Journal of Computer Science & Network Security
• /
• v.21 no.8
• /
• pp.196-202
• /
• 2021

DNA sequencing provides fundamental data in genomics, bioinformatics, biology and many other research areas. With the emergent evolution in DNA sequencing technology, a massive amount of genomic data is produced every day, mainly DNA sequences, craving for more storage and bandwidth. Unfortunately, managing, analyzing and specifically storing these large amounts of data become a major scientific challenge for bioinformatics. Those large volumes of data also require a fast transmission, effective storage, superior functionality and provision of quick access to any record. Data storage costs have a considerable proportion of total cost in the formation and analysis of DNA sequences. In particular, there is a need of highly control of disk storage capacity of DNA sequences but the standard compression techniques unsuccessful to compress these sequences. Several specialized techniques were introduced for this purpose. Therefore, to overcome all these above challenges, lossless compression techniques have become necessary. In this paper, it is described a new DNA compression mechanism of pattern matching extended Compression algorithm that read the input sequence as segments and find the matching pattern and store it in a permanent or temporary table based on number of bases. The remaining unmatched sequence is been converted into the binary form and then it is been grouped into binary bits i.e. of seven bits and gain these bits are been converted into an ASCII form. Finally, the proposed algorithm dynamically calculates the compression ratio. Thus the results show that pattern matching extended Compression algorithm outperforms cutting-edge compressors and proves its efficiency in terms of compression ratio regardless of the file size of the data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.11
• /
• pp.1686-1696
• /
• 2022

The impedance matching circuit design technique based on the phasor plot introduced in this paper is based on the impedance triangle of electric circuit. It is a technique that designs through the construction of a phasor figure using the values given to the matching circuit design. The design pattern is based on L-type, inverted L-type, T-type, and 𝜋-type, and unknown reactance elements are determined through phasor shapes. In this paper, using a design by phasor plot, we design several cases, such as the case where the input and output ports are pure resistance and have reactance. It was confirmed that the design value was verified by serial-parallel equivalent conversion to achieve matching. This design technique can immediately grasp the phase or size of input/output power, so it is expected to be applied mainly in a low frequency band due to rapid design change and application.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.18 no.7
• /
• pp.828-833
• /
• 2007

A small monopole antenna with a novel impedance matching structure is proposed in this paper. The proposed antenna is designed for W-LAN(IEEE 802.11b). The antenna design concept is based on a ${\lambda}/8$ folded monopole antenna with a self-impedance matching structure. The size of the proposed antenna is smaller than the resonant length, thus the impedance at the terminal of the antenna becomes very capacitive. To compensate fur this impedance mismatching, the proposed antenna employs a novel self-impedance matching structure. The self-impedance matching structure is located on the top of the antenna; it improves the impedance matching and ultimately the efficiency of the antenna. The measured results of the proposed antenna show reasonable agreement with prediction.

• Journal of Biomedical Engineering Research
• /
• v.28 no.5
• /
• pp.601-608
• /
• 2007

2 Dimensional Gel Electrophoresis(2DGE) is an essentialmethodology for analysis on the expression of various proteins. For example, information for the location, mass, expression, size and shape of the proteins obtained by 2DGE can be used for diagnosis, prognosis and biological progress by comparison of patients with the normal persons. Protein spot matching for this purpose is comparative analysis of protein expression pattern for the 2DGE images generated under different conditions. However, visual analysis of protein spots which are more than several hundreds included in a 2DGE image requires long time and heavy effort. Furthermore, geometrical distortion makes the spot matching for the same protein harder. In this paper, an iterative algorithm is introduced for more efficient spot matching. Proposed method is first performing global matching step, which reduces the geometrical difference between the landmarks and the spot to be matched. Thus, movement for a spot is defined by a weighted sum of the movement of the landmark spots. Weight for the summation is defined by the inverse of the distance from the spots to the landmarks. This movement is iteratively performed until the total sum of the difference between the corresponding landmarks is larger than a pre-selected value. Due to local distortion generally occurred in 2DGE images, there are many regions in whichmany spot pairs are miss-matched. In the second stage, the same spot matching algorithm is applied to such local regions with the additional landmarks for those regions. In other words, the same method is applied with the expanded landmark set to which additional landmarks are added. Our proposed algorithm for spot matching empirically proved reliable analysis of protein separation image by producing higher accuracy.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.40 no.3
• /
• pp.177-185
• /
• 2022

A method of restoring the occluded area was proposed by referring to images taken with the same types of sensors on high-resolution optical satellite images through deep learning. For the natural continuity of the simulated image with the occlusion region and the surrounding image while maintaining the pixel distribution of the original image as much as possible in the patch segmentation image, CycleGAN (Cycle Generative Adversarial Network) method with ConvNeXt block applied was used to analyze three experimental regions. In addition, We compared the experimental results of a training patch size of 512*512 pixels and a 1024*1024 pixel size that was doubled. As a result of experimenting with three regions with different characteristics,the ConvNeXt CycleGAN methodology showed an improved R² value compared to the existing CycleGAN-applied image and histogram matching image. For the experiment by patch size used for training, an R² value of about 0.98 was generated for a patch of 1024*1024 pixels. Furthermore, As a result of comparing the pixel distribution for each image band, the simulation result trained with a large patch size showed a more similar histogram distribution to the original image. Therefore, by using ConvNeXt CycleGAN, which is more advanced than the image applied with the existing CycleGAN method and the histogram-matching image, it is possible to derive simulation results similar to the original image and perform a successful simulation.

• Proceedings of the KIPE Conference
• /
• 1998.10a
• /
• pp.894-897
• /
• 1998

A conventional parallel hybrid active filter has an inherent problem of large current ratings of devices used in inverter. In general, this problem has been solved by adjusting turn ratio of a matching transformer. However, making the transformer with high turn ratio may be not available for high power system due to its requirement for high voltage insulation. In this paper, a new configuration is proposed for parallel hybrid active filter. In the proposed hybrid active filter, the active filter is connected to the passive filter inductor in parallel through a matching transformer for the aim of reducing the size of inverter. Through computer simulations, we have shown the outstanding performances of the proposed topology.

• The Journal of Society for e-Business Studies
• /
• v.4 no.1
• /
• pp.73-86
• /
• 1999

Inspired by the growth of the Internet, electronic commerce(EC) has grown rapidly over the last few years and has become a major Internet application domain. EC encompasses various profit-oriented activities such as purchase of goods and services over the network, banking, and business-to-business trade. The purpose of this research is to develop an electronic commerce merchant server for the small and medium size business. The proposed solution is designed to meet a cheap, simple, extensible, and interoperable requirement. Also, our solution supports one-to-one marketing concept by using matching technology. We expect that our solution makes the small and medium size EC market more easily.