• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.17 no.4
• /
• pp.266-274
• /
• 2024

In this paper, we designed a low-area 32-bit PF (Poly-fuse) OTP IP, a non-volatile memory that stores data required for analog circuit trimming and calibration. Since one OTP cell is constructed using two PFs in one select transistor, a 1cell-2bit multibit PF OTP cell that can program 2bits of data is proposed. The bitcell size of the proposed 1cell-2bit PF OTP cell is 1/2 of 12.69㎛ × 3.48㎛ (=44.161㎛2), reducing the cell area by 33% compared to that of the existing PF OTP cell. In addition, in this paper, a new 1 row × 32 column cell array circuit and core circuit (WL driving circuit, BL driving circuit, BL switch circuit, and DL sense amplifier circuit) are proposed to meet the operation of the proposed multbit cell. The layout size of the 32bit OTP IP using the proposed multibit cell is 238.47㎛ × 156.52㎛ (=0.0373㎛2) is reduced by about 33% compared that of the existing 32bit PF OTP IP using a single bitcell, which is 386.87㎛ × 144.87㎛ (=0.056㎛2). The 32-bit PF OTP IP, designed with 10 years of data retention time in mind, is designed with a minimum programmed PF sensing resistance of 10.5㏀ in the detection read mode and of 5.3 ㏀ in the read mode, respectively, as a result of post-layout simulation of the test chip.

• Journal of the Korean Applied Science and Technology
• /
• v.33 no.1
• /
• pp.1-12
• /
• 2016

This study is to make the liquid crystalline structure using sucrose distearate (Sucro-DS) emulsifier to create the hydrophilic type oil-in-water (O/W) emulsion, the droplets of the emulsion having a structure of a multi-lamellar structure. We have studied the physicochemical properties of Sucro-DS using those techniques. And it has been studied in the emulsion performance. In order to form the liquid crystalline structure applying 3 wt% of Sucro-DS, 5 wt% of glycerin, 5 wt% of squalane, 5 wt% of capric/caprylic triglyceride, 3wt% of cetostearyl alcohol, 1wt% of glyceryl mono-stearate, 78 wt% of pure water in mixture having the lamellar structure of stable multi-layer system was found to formed. By applying them, they were described how to create an unstable active material encapsulated cream. Further, the moisturizing cream was studied using this technique. It reported the results to the skin improvement effect by the human clinical trials. The pH range to produce a stable liquid crystal phase using a Sucro-DS was maintained in 5.2~7.5. In order to increase the stability of the liquid crystal, it was when behenyl alcohol containing 3 wt%, the hardness at this time was 13 kg/mm,min. Viscosity of the same amount was 25,000mPas/min. After a test for the effects of the emulsions, the concentration of 6 wt% Sucro-DS is that was appropriate, the particle size of the liquid crystal was 4~6mm. It was observed through a microscope analysis, reliability of the liquid crystal changes for 3 months was found to get stable at each $4^{\circ}C$, $25^{\circ}C$ and $45^{\circ}C$. In clinical trial test, before applying a moisturizing effect it was $13.4{\pm}7%$. Moisturizing cream liquid crystal was not formed in $14.5{\pm}5%$. Therefore, applying than ever before could see the moisture about 8.2% was improved. On the other hand, it was the moisturizing effect of the liquid cream is $19.2{\pm}7%$. The results showed that 43.3% improvement than that previously used. Applications fields, Sucro-DS emulsifier used liquid cream, lotion, eye cream and a variety of formulations can be developed, as well as the cosmetics industry is expected to be wide fields in the application of the external preparation for skin emulsion technology in the pharmaceutical industry and pharmaceutical industry.

• Journal of Life Science
• /
• v.25 no.8
• /
• pp.925-931
• /
• 2015

We performed a molecular marker-based analysis of quantitative trait loci (QTLs) for traits that determine the quality of the appearance of grains, using 120 doubled-haploid (DH) lines developed by another culture from the F1 cross between ‘Cheongcheong’ (Oryza sativa L. ssp. Indica) and ‘Nagdong’ (Oryza sativa L. ssp. Japonica). The traits studied included length, width, and thickness of the grains, as well as length-to-width ratio and 1,000-grain weight. The objective of this study was to determine the genetic control of these traits in order to formulate a strategy for improving the appearance of this hybrid. Within the DH population, five traits exhibited wide variation, with mean values occurring within the range of the two parents. Three QTLs were identified for grain length on chromosomes 2, 5, and 7. Three QTLs were mapped for grain width on chromosome 2: qGW2-1, qGW2-2, and qGW2-3. Six chromosomes were identified for the grain length-to-width ratio; four of these were on chromosome 2, whereas the other two were on chromosomes 7 and 12. One QTL influencing 1,000-grain weight was identified and located on chromosome 8. The results presented in the present study should facilitate rice-breeding, especially for improved hybrid-rice quality.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.21 no.2
• /
• pp.34-43
• /
• 2018

DEM(Digital Elevation Model) being fundamental data in geospatial domain is produced from different data and using various methods. As they are derived their precision varies and altering derivative in application. In this work, we compare two widely used DEMs namely(Advanced Land Observing Satellite World 3D 30m and Shuttle Radar Topography Mission Global 30m) around coastal islands in Gyeongsangnam-do, South Korea. First statistics of each DEM were calculated and later overlapped in Landsat image for visual comparison of areas below and above zero-meter elevation. As a result, it was found that DEMs were highly correlated with each other and had similar statistics. Besides having few high differences in hilly land area, they were able to represent the coastal lines. It has also been noted that they have many negative values and should carefully select study area covering full watershed in coastal regions to avoid negative elevation even after filling the sinks.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.04a
• /
• pp.320-323
• /
• 2007

웹 서비스와 같은 분산된 환경에서, 특정 서비스를 수행하기 위해서는 원격의 컴퓨터나 사이트상에서 다중 에이전트들의 협업을 통해 이루어진다. 이때 서비스는 여러 에이전트들의 복잡한 행위들에 의해 구성된다. 또한 지능적인 서비스를 위해서는 에이전트들의 상태정보, 목적정보, 그리고 계획정보 등을 이용한다. 특히 계획정보는 에이전트들이 일련의 행위들로 구성된다. 하지만 계획수립을 위한, 기존 연구들 대부분은 정적으로 기술된 서비스 명세와 초기상태 정보를 이용하여 특정 목표를 만족시키는 단일 계획 생성 방법을 연구해왔다. 따라서 계획수립이 실행 도중에 기대하지 않은 네트워크 장애나 방해 등으로 서비스 수행을 실패하는 경우, 그 계획은 무효가 되고 다시 계획을 생성 해야만 한다. 그러나 다시 계획을 생성하기 위해서는 많은 시간을 소비하게 될 뿐만 아니라 태스크 중복이 불가피하므로 매우 비효율적이다. 이 논문에서는 강건한 계획수립과 그 계획을 실행하기 위한 효과적인 방법을 제안한다. 즉, 계획수립의 재생성을 피하기 위한 방법으로 단일 계획수립 대신에 실행 가능한 다중 계획들로 표현된 강건한 계획을 생성하는 것이다. 강건한 계획의 행위들이 실행되는 동안, 각 단계마다 실행 가능한 행위를 선택한 후, 그 행위를 실행한다. 그러나 선택된 행위가 실행결과를 낼 수 없을 경우, 대체 가능한 서브 계획 경로를 선택하여 실행한다. 강건한 계획을 표현하기 위해 페트리 넷 기반의 방법을 제안한다. 강건한 계획 생성 방법에서는 이용 가능한 모든 계획들을 입력으로 사용한다. 그 계획수립 방법은 HTN 계획수립기로 잘 알려진 JSHOP2 계획수립기내에 구현하였다. 계획 실행 방법으로는 주어진 강건한 계획에 대하여 행위들이 직접 실행하수 있도록 한다.며 용량에 의존하는 양상을 보였다. $H_2O_2$에 의해 유발(誘發)된 DNA의 손상은 catalase와 deferoxamine에 의해 억제되었지만 DPPD는 억제시키지 못했다. 배기음(排氣飮)은 $H_2O_2$에 의해 유발(誘發)된 ATP의 소실을 회복시켰다. 이러한 실험결과 $H_2O_2$에 의해 유발(誘發)된 세포(細胞)의 손상(損傷)은 지질(脂質)의 과산화(過酸化)와는 다른 독립적인 기전에 의해 일어남을 나타낸다. 결론 : 이러한 결과들로 볼 때 Caco-2 세포(細胞)에서 배기음(排氣飮)이 항산화작용(亢酸化作用)보다는 다른 기전을 통하여 Caco-2 세포안에서 산화제(酸化劑)에 의해 유발(誘發)된 세포(細胞)의 사망(死亡)와 DNA의 손상(損傷)을 방지할 수 있다는 것을 가리킨다. 따라서 본 연구(硏究)는 배기음(排氣飮)이 반응성산소기(反應性酸素基)에 의해 매개된 인체(人體) 위장관질환(胃腸管疾患)의 치료(治療)에 사용할 수 있을 가능성(可能性)이 있음을 제시하고 있다.에 이를 이용하여 유가배양시 기질을 공급하는 공정변수로 사용하였다 [8]. 생물학적인 폐수처리장치인 활성 슬러지법에서 미생물의 활성을 측정하는 방법은 아직 그다지 개발되어있지 않다. 본 연구에서는 슬러지의 주 구성원이 미생물인 점에 착안하여 침전시 슬러지층과 상등액의 온도차를 측정하여 대사열량의 발생량을 측정하고 슬러지의 활성을 측정할 수 있는 방법을 개발하였다.enin과 Rhaponticin의 작용(作用)에 의(依)한 것이며, 이는 한의학(韓醫學) 방제(方劑) 원리(原理)인 군신좌사(君臣佐使) 이론(理論)에서 군약(君藥)이 주증(主症)에 주(主)로 작용(作用)하는 약물(藥物)이라는 것을 밝혀주는

• Journal of Korea Spatial Information System Society
• /
• v.11 no.1
• /
• pp.127-136
• /
• 2009

This paper proposes an on-line mining algorithm of moving trajectory patterns in RFID data streams considering changing characteristics over time and constraints of single-pass data scan. Since RFID, sensor, and mobile network technology have been rapidly developed, many researchers have been recently focused on the study of real-time data gathering from real-world and mining the useful patterns from them. Previous researches for sequential patterns or moving trajectory patterns based on stream data have an extremely time-consum ing problem because of multi-pass database scan and tree traversal, and they also did not consider the time-changing characteristics of stream data. The proposed method preserves the sequential strength of 2-lengths frequent patterns in binary relationship table using the time-evolving graph to exactly reflect changes of RFID data stream from time to time. In addition, in order to solve the problem of the repetitive data scans, the proposed algorithm infers candidate k-lengths moving trajectory patterns beforehand at a time point t, and then extracts the patterns after screening the candidate patterns by only one-pass at a time point t+1. Through the experiment, the proposed method shows the superior performance in respect of time and space complexity than the Apriori-like method according as the reduction ratio of candidate sets is about 7 percent.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.271-281
• /
• 2006

Recently the need for Location-Based Service (LBS) has increased due to the development and widespread use of the mobile devices (e.g., PDAs, cellular phones, labtop computers, GPS, and RFID etc). The core technology of LBS is a moving-objects database that stores and manages the positions of moving objects. To search for information quickly, the database needs to contain an index that supports both real-time position tracking and management of large numbers of updates. As a result, the index requires a structure operating in the main memory for real-time processing and requires a technique to migrate part of the index from the main memory to disk storage (or from disk storage to the main memory) to manage large volumes of data. To satisfy these requirements, this paper suggests a unified index scheme unifying the main memory and the disk as well as migration policies for migrating part of the index from the memory to the disk during a restriction in memory space. Migration policy determines a group of nodes, called the migration subtree, and migrates the group as a unit to reduce disk I/O. This method takes advantage of bulk operations and dynamic clustering. The unified index is created by applying various migration policies. This paper measures and compares the performance of the migration policies using experimental evaluation.

• The Journal of the Korea Contents Association
• /
• v.10 no.9
• /
• pp.68-78
• /
• 2010

As the IP multicast function is very slowly deployed in Internet due to its scalability problem and inter-domain interoperability problem, interest in the P2P(Peer-to-Peer) streaming technologies for the realtime multimedia multicast applications such as IPTV is highly growing. This paper proposes a P2P streaming method for the QoS-sensitive multimedia multicast applications such as highly-interactive personal IPTV and video conferences. The proposed P2P streaming method allows an application to construct a reliable streaming tree in which a proper number of backup peers are placed according to its reliability requirement. The reliable streaming tree reduces the reconnection delay, occurred in the case of a normal and/or abnormal peer leave, so as to minimize the loss of streaming data. In the proposed P2P streaming method, the join delay of a peer called startup delay is also substantially reduced because the bandwidth and end-to-end delay information of every peer kept in a distributed way allows the target peer for a joining peer to be able to be quickly determined. Moreover, the proposed method's peer admission control mechanism based on the bandwidth and end-to-end delay enables the delay-bounded streaming services to be provided for its corresponding applications.

• Journal of Broadcast Engineering
• /
• v.17 no.3
• /
• pp.503-518
• /
• 2012

In this paper, we propose a complexity-based parallelization method of the sample adaptive offset (SAO) algorithm which is one of HEVC in-loop filters. The SAO algorithm can be regarded as region-based process and the regions are obtained and represented with a quad-tree scheme. A offset to minimize a reconstruction error is sent for each partitioned region. The SAO of the HEVC can be parallelized in data-level. However, because the sizes and complexities of the SAO regions are not regular, workload imbalance occurs with multi-core platform. In this paper, we propose a LCU-based SAO algorithm and a complexity prediction algorithm for each LCU. With the proposed complexity-based LCU processing, we found that the proposed algorithm is faster than the sequential implementation by a factor of 2.38 times. In addition, the proposed algorithm is faster than regular parallel implementation SAO by 21%.

• Journal of KIISE:Information Networking
• /
• v.34 no.2
• /
• pp.110-119
• /
• 2007

Mobile IPv6 (MIPv6) enables a mobile node (MN) to maintain its connectivity with a correspondent node (CN) while changing its point of attachment. In MIPv6, packets sent from a CN to a MN during handover are lost. Several mechanisms including FMIPv6 and HMIPv6 have been proposed in order to minimize packet loss. However, such mechanisms still suffer from performance degradation due to not only packet loss but also out-of-sequence packets. In this paper, we propose I-FHMIPv6 to resolve packet loss as well as the out-of-sequence packet problem. In I-FHMIPv6, the flush message is newly defined in order to notify a home agent (HA) or CN of the fact that the binding cache entry of a MN is about to be updated. A MN receiving the flush message can know that there is no more packets transmitted via the previous route, which resolve the out-of-sequence packet problem. Moreover, with the proposed mechanism, we can minimize packet loss by integrating FMIPv6 and HMIPv6 efficiently. I-FHMIPv6 is evaluated by performing simulations, and the simulation results show that I-FHMIPv6 outperforms FMIPv6 and HMIPv6.