• Molecules and Cells
• /
• v.27 no.6
• /
• pp.629-634
• /
• 2009

G protein-coupled receptors (GPCRs) are part of multi-protein networks called 'receptosomes'. These GPCR interacting proteins (GIPs) in the receptosomes control the targeting, trafficking and signaling of GPCRs. PDZ domain proteins constitute the largest protein family among the GIPs, and the predominant function of the PDZ domain proteins is to assemble signaling pathway components into close proximity by recognition of the last four C-terminal amino acids of GPCRs. We present here a machine learning based approach for the identification of GPCR-binding PDZ domain proteins. In order to characterize the network of interactions between amino acid residues that contribute to the stability of the PDZ domain-ligand complex and to encode the complex into a feature vector, amino acid contact matrices and physicochemical distance matrix were constructed and adopted. This novel machine learning based method displayed high performance for the identification of PDZ domain-ligand interactions and allowed the identification of novel GPCR-PDZ domain protein interactions.

• ETRI Journal
• /
• v.28 no.1
• /
• pp.51-58
• /
• 2006

In this paper, we propose a method of applying a lifting-based wavelet domain e-median filter (LBWDEMF) for image restoration. LBWDEMF helps in reducing the number of computations. An e-median filter is a type of modified median filter that processes each pixel of the output of a standard median filter in a binary manner, keeping the output of the median filter unchanged or replacing it with the original pixel value. Binary decision-making is controlled by comparing the absolute difference of the median filter output and the original image to a preset threshold. In addition, the advantage of LBWDEMF is that probabilities of encountering root images are spread over sub-band images, and therefore the e-median filter is unlikely to encounter root images at an early stage of iterations and generates a better result as iteration increases. The proposed method transforms an image into the wavelet domain using lifting-based wavelet filters, then applies an e-median filter in the wavelet domain, transforms the result into the spatial domain, and finally goes through one spatial domain e-median filter to produce the final restored image. Moreover, in order to validate the effectiveness of the proposed method we compare the result obtained using the proposed method to those using a spatial domain median filter (SDMF), spatial domain e-median filter (SDEMF), and wavelet thresholding method. Experimental results show that the proposed method is superior to SDMF, SDEMF, and wavelet thresholding in terms of image restoration.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.3
• /
• pp.71-82
• /
• 2009

As a solution to spectrum under-utilization problem, Cognitive radio (CR) introduces a dynamic spectrum access technology. In the area, one of the most important problems is how secondary users (SUs) should choose between the available channels, which means how to achieve load balancing between channels. We consider spectrum load balancing problem for CR system in frequency domain and especially in time domain. Our objective is to balance the load among the channels and balance the occupied time length of slots for a fixed channel dynamically in order to obtain a user-optimal solution. In frequency domain, we refer to Dynamic Noncooperative Scheme with Communication (DNCOOPC) used in distributed system and a distributed Dynamic Spectrum Load Balancing algorithm (DSLB) is formed based on DNCOOPC. In time domain, Spectrum Load Balancing method with QoS support is proposed based on Dynamic Feed Back theory and Hash Table (SLBDH). The performance of DSLB and SLBDH are evaluated. In frequency domain, DSLB is more efficient compared with existing Compare_And_Balance (CAB) algorithm and gets more throughput compared with Spectrum Load Balancing (SLB) algorithm. Also, DSLB is a fair scheme for all devices. In time domain, SLBDH is an efficient and precise solution compared with Spectrum Load Smoothing (SLS) method.

• Journal of the Ergonomics Society of Korea
• /
• v.30 no.1
• /
• pp.169-177
• /
• 2011

The aim of this study is to review previous studies on human errors in the service delivery processes. Service industry is sharply growing in the advanced countries. Many people are looking for something to contribute to the service industry. Although there are many research topics related to service domain that human factors and ergonomics specialists can do contribute, a few researchers are studying such topics. This paper indicated how previous researches on human factors and human errors have addressed the service domain, in order to prompt human factor study on the service domain. A variety of sources were inspected for literature reviews, including books and journals of managements, medicine, psychology, consumer behavior as well as human factor and ergonomics. The characteristics of human errors in the service domain were investigated. Human error studies in several service sectors were summarized such as medical service, automotive service operation, travel agent service and call center service. Until now, human factors community was not much interested in human errors in service domain. However, there is much space to contribute to service domain; human error identification, human error analysis and control of human error. The research of human error in service domain can provide clues to improve service quality. This paper helps to guide to identify human error of service domain and to design service systems.

• Proceedings of the KIEE Conference
• /
• 2011.07a
• /
• pp.872-873
• /
• 2011

This paper presents a multi-domain topology optimization using the harmonically excited coil and the iron in order to focus pulsed magnetic field (PMF). The design sensitivity of the harmonic magnetic field is derived by adjoint variable method. As a result of the optimization, PMF is considerably concentrated on the objective domain with much less leakage than the initial model.

• Bulletin of the Korean Mathematical Society
• /
• v.26 no.2
• /
• pp.135-137
• /
• 1989

Let R be a Krull domain with field of fractions K. By Br(R) we denote the Brauer group of R. Studying the Kernel of the homomorphism Br(R).rarw.Br(K), Orzech defined Brauer groups Br(M) for different categories M of R-modules [4]. In this paper we show that an algebra A in Br(D) is a maximal order in A K and that the map Br(D).rarw. Br(K) is one to one. We note here few conventions. All rings are Krull domains and all modules will be unitary. By Z we donote the set of height one prime ideals of a Krull domain.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.323-325
• /
• 2015

The purpose of the thesis is to suggest the algorithm that can be covered only by software instead of the function of pulse shaper that was used in the time domain. In order to implementing portable radiation detector for digital.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.26 no.4
• /
• pp.323-332
• /
• 2022

This paper presents a numerical study on multigrid algorithms of V-cycle type for problems posed in the Hilbert space H(curl) in three dimensions. The multigrid methods are designed for discrete problems originated from the discretization using the hexahedral Nédélec edge element of the lowest-order. Our suggested methods are associated with smoothers constructed by substructuring based on domain decomposition methods of nonoverlapping type. Numerical experiments to demonstrate the robustness and the effectiveness of the suggested algorithms are also provided.

• East Asian mathematical journal
• /
• v.39 no.1
• /
• pp.75-85
• /
• 2023

In this paper, a non-overlapping rectangular domain decomposition method is presented in order to numerically solve two-dimensional telegraph equations. The method is unconditionally stable and efficient. Spectral radius of the iteration matrix and convergence rate of the method are provided theoretically and confirmed numerically by MATLAB. Numerical experiments of examples are compared with several methods.

• Journal of the Korean Mathematical Society
• /
• v.61 no.4
• /
• pp.659-681
• /
• 2024

We propose V-cycle multigrid methods for vector field problems arising from the lowest order hexahedral Nédélec finite element. Since the conventional scalar smoothing techniques do not work well for the problems, a new type of smoothing method is necessary. We introduce new smoothers based on substructuring with nonoverlapping domain decomposition methods. We provide the convergence analysis and numerical experiments that support our theory.