• Proceedings of the Korean Society of Applied Pharmacology
• /
• 1994.11a
• /
• pp.143-145
• /
• 1994

Chimeric fusion proteins involving IgG have proven valuable in studying protein-protein interactions and may possess therapeutic applications as well. For example, three receptor subtypes for the natriuretic peptides, when fused to the Fc portion of human IgG ${\gamma}$ chain, were quantitatively and qualitatively indistinguishable from the native receptor, thus allowing detailed structure-function studies of the receptor. In an attempt to block human immunodeficiency virus infectivity with soluble derivatives of CD4, a CD4/IgG Fc chimeric molecule was shown to increase the plasma half life of soluble CD4 and possessed the added advantage of IgG Fc-mediated placental transfer. In the case of the KGFR, this approach provided a framework for dissection of its ligand binding domains and made it possible to demonstrate that high affinity binding sites for two ligands, aFGF and KGF, reside within different receptor Ig-like domains. Chimeric molecules fused to immunoglobulins would have the advantages of secretion from transfected cells as well as detection and purification from medium utilizing Staphylococcus aureus Protein A. In addition, where highly related receptors make their discrimination very hard due to the difficulties in generating specific immunochemical probes, IgG fusion protein with tailor-made specificities confers particular advantages to elucidate patterns of receptor distribution and expression. The approach described here may have general applications in defining ligand-receptor interactions as well as searching for specific agonists and antagonists of receptor function.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.5
• /
• pp.423-428
• /
• 2005

This paper proposes a new edge detection method using a $3{\times}3$ ideal binary pattern and lookup table (LUT) for the mobile robot localization without any parameter adjustments. We take the mean of the pixels within the $3{\times}3$ block as a threshold by which the pixels are divided into two groups. The edge magnitude and orientation are calculated by taking the difference of average intensities of the two groups and by searching directional code in the LUT, respectively. And also the input image is not only partitioned into multiple groups according to their intensity similarities by the histogram, but also the threshold of each group is determined by fuzzy reasoning automatically. Finally, the edges are determined through non-maximum suppression using edge confidence measure and edge linking. Applying this edge detection method to the mobile robot localization using projective invariance of the cross ratio. we demonstrate the robustness of the proposed method to the illumination changes in a corridor environment.

• The Korean Journal of Pain
• /
• v.26 no.2
• /
• pp.164-168
• /
• 2013

It is easy to overlook osteochondral lesions (OCLs) of the ankle in patients with chronic lower limb pain, such as complex regional pain syndrome (CRPS) or thromboangiitis obliterans (TAO, Buerger's disease). A 57-year-old woman diagnosed with type 1 CRPS, and a 58-year-old man, diagnosed with TAO, complained of tactile and cold allodynia in their lower legs. After neurolytic lumbar sympathethic ganglion block and titration of medications for neuropathic pain, each subject could walk without the aid of crutches. However, they both complained of constant pain on the left ankle during walking. Focal tenderness was noted; subsequent imaging studies revealed OCLs of her talus and his distal tibia, respectively. Immediately after percutaneous osteoplasties, the patients could walk without ankle pain. It is important to consider the presence of a hidden OCL in chronic pain patients that develop weight-bearing pain and complain of localized tenderness on the ankle.

• ETRI Journal
• /
• v.45 no.3
• /
• pp.418-432
• /
• 2023

In this work, we proposed a low-complexity hybrid layered tabu-likelihood ascent search (LTLAS) algorithm for large multiple-input multiple-output (MIMO) system. The conventional layered tabu search (LTS) approach involves many partial reactive tabu searches (RTSs), and each RTS requires an initialization and searching phase. In the proposed algorithm, we restricted the upper limit of the number of RTS operations. Once RTS operations exceed the limit, RTS will be replaced by low-complexity likelihood ascent search (LAS) operations. The block-based detection approach is considered to maintain a higher signal-to-noise ratio (SNR) detection performance. An efficient precomputation technique is derived, which can suppress redundant computations. The simulation results show that the bit error rate (BER) performance of the proposed detection method is close to the conventional LTS method. The complexity analysis shows that the proposed method has significantly lower computational complexity than conventional methods. Also, the proposed method can reduce almost 50% of real operations to achieve a BER of 10^-3.

• Journal of Korea Multimedia Society
• /
• v.12 no.3
• /
• pp.354-361
• /
• 2009

Shot change detection is the main technique in the video segmentation which requirs real-time processing and automatical processing in hardware. Until now, there were few research reports about real-time shot change detection for applying to hardware terminals with low performance such as PMPs(Portable Media Player) and cellular phones. In this paper, we propose shot change detection technique using adaptive threshold setting method on variable reference block. Our proposed algorithm determines shot change detection by comparing the feature value of current frame and a mean of a feature value on variable reference blocks. The proposed method can be used independently from the feature value of frame, can adaptively set thresholds using a mean of a feature value on variable reference blocks. We obtained better detection ratio than the conventional methods maximally by precision 0.146, recall 0.083, F1 0.089 in the experiment with the same test sequences. We verified real-time operation of shot change detection by implementing our algorithm on the PMP from some company of H. Therefore, our proposing algorithm will be helpful in searching video data on portable media players such as PMPs and cellular phones.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.6
• /
• pp.1259-1270
• /
• 2019

The upper bound of differential characteristic probability is mainly used to determine the number of rounds when constructing a block cipher. As the number of rounds affects the performance of block cipher, it is critical to evaluate the tight upper bound in the constructing process. In order to calculate the upper bound of differential characteristic probability, the previous searching methods for minimum number of active S-boxes constructed constraint equations for non-linear operations and linear operations, independently. However, in the case of BOGI design strategy, where linear operation is dependent on non-linear operation, the previous methods may present the less tight upper bound. In this paper, we exploit the properties of BOGI strategy to propose a new method to evaluate a tighter upper bound of differential characteristic probability than previous ones. Additionally, we mathematically proved the validity of our method. Our proposed method was applied to GIFT-64 and GIFT-128, which are based on BOGI strategy, and the upper bounds of differential characteristic probability were derived until 9 round. Previously, the upper bounds of differential characteristic probability for 7-round GIFT-64 and 9-round GIFT-128 were 2^-18.395 and 2^-26.885, respectively, while we show that the upper bounds of differential characteristic probability are more tight as 2^-19.81 and 2^-28.3, respectively.

• Journal of KIISE
• /
• v.45 no.1
• /
• pp.53-60
• /
• 2018

This study describes a spatial web object retrieval system using Spark, an in - memory based distributed processing system. Development of social networks has created massive amounts of spatial web objects, and retrieval and analysis of data is difficult by using exist spatial web object retrieval systems. Recently, development of distributed processing systems supports the ability to analyze and retrieve large amounts of data quickly. Therefore, a method is promoted to search a large-capacity spatial web object by using the distributed processing system. Data is processed in block units, and one of these blocks is converted to RDD and processed in Spark. Regarding the discussed method, we propose a system in which each RDD consists of spatial web object index for the included data, dividing the entire spatial region into non-overlapping spatial regions, and allocating one divided region to one RDD. We propose a system that can efficiently use the distributed processing system by dividing space and increasing efficiency of searching the divided space. Additionally by comparing QP-tree with R-tree, we confirm that the proposed system is better for searching the spatial web objects; QP-tree builds index with both spatial and words information while R-tree build index only with spatial information.

• Journal of Plant Biotechnology
• /
• v.47 no.3
• /
• pp.218-226
• /
• 2020

This report describes methods for selecting informative single nucleotide polymorphisms (SNPs), and the development of an online Solanaceae genome database, using 234 tomato resequencing data entries deposited in the NCBI SRA database. The 126 accessions of Solanum lycopersicum, 68 accessions of Solanum lycopersicum var. cerasiforme, and 33 accessions of Solanum pimpinellifolium, which are frequently used for breeding, and some wild-species tomato accessions were included in the analysis. To select tag-SNPs, we identified 29,504,960 SNPs in 234 tomatoes and then separated the SNPs in the genic and intergenic regions according to gene annotation. All tag-SNP were selected from non-synonymous SNPs among the SNPs present in the gene region and, as a result, we obtained tag-SNP from 13,845 genes. When there were no non-synonymous SNPs in the gene, the genes were selected from synonymous SNPs. The total number of tag-SNPs selected was 27,539. To increase the usefulness of the information, a Solanaceae genome database website, TGsol (http://tgsol. seeders.co.kr/), was constructed to allow users to search for detailed information on resources, SNPs, haplotype, and tag-SNPs. The user can search the tag-SNP and flanking sequences for each gene by searching for a gene name or gene position through the genome browser. This website can be used to efficiently search for genes related to traits or to develop molecular markers.

• KIISE Transactions on Computing Practices
• /
• v.21 no.2
• /
• pp.126-131
• /
• 2015

As flash-based storage systems have been actively employed in large-scale servers and data centers, reliability has become an indispensable element. One promising technique for enhancing reliability is static wear-leveling, which distributes erase operations evenly among blocks so that the lifespan of storage systems can be prolonged. However, increasing the capacity makes the processing overhead of this technique non-trivial, mainly due to searching for blocks whose erase count would be minimum (or maximum) among all blocks. To reduce this overhead, we introduce a new randomized block selection method in static wear-leveling. Specifically, without exhaustive search, it chooses n blocks randomly and selects the maximal/minimal erased blocks among the chosen set. Our experimental results revealed that, when n is 2, the wear-leveling effects can be obtained, while for n beyond 4, the effect is close to that obtained from traditional static wear-leveling. For quantitative evaluation of the processing overhead, the scheme was actually implemented on an FPGA board, and overhead reduction of more than 3 times was observed. This implies that the proposed scheme performs as effectively as the traditional static wear-leveling while reducing overhead.

• Korean Journal of Social Welfare
• /
• v.53
• /
• pp.179-207
• /
• 2003

The purpose of this study is to find out the structural characteristics of interorganizational networks for women, and to identify the magnitude of efficient structure for network using 30 organizations for women in Buchon. This study attempted to examine the characteristic of interorganizational networks through searching out the central organization and block modeling. The research sample was 30 organizations, and the data analyzed by UCINET V and KP(Krack Plot) 3.1. The results show that public agencies are central organizations of all dimensions(information exchange, client referral, cooperation, resource exchange) and they also play an important part as intermediary of interorganizational network. A prominent characteristics of network is "ggiri-network" that means network between similar agencies. This finding provides important strategy to build and expand the network. Also this finding can be direction of network structure to meet women's needs and empower women.