• Title/Summary/Keyword: efficient translation

Search Result 172, Processing Time 0.026 seconds

Instruction Queue Architecture for Low Power Microprocessors (마이크로프로세서 전력소모 절감을 위한 명령어 큐 구조)

  • Choi, Min;Maeng, Seung-Ryoul
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.45 no.11
    • /
    • pp.56-62
    • /
    • 2008
  • Modern microprocessors must deliver high application performance, while the design process should not subordinate power. In terms of performance and power tradeoff, the instructions window is particularly important. This is because a large instruction window leads to achieve high performance. However, naive scaling conventional instruction window can severely affect the complexity and power consumption. This paper explores an architecture level approach to reduce power dissipation. We propose a low power issue logic with an efficient tag translation. The direct lookup table (DTL) issue logic eliminates the associative wake-up of conventional instruction window. The tag translation scheme deals with data dependencies and resource conflicts by using bit-vector based structure. Experimental results show that, for SPEC2000 benchmarks, the proposed design reduces power consumption by 24.45% on average over conventional approach.

XPERT : An XML Query Processing System using Relational Databases (관계형 DBMS를 이용한 XML 질의 처리 시스템 XPERT의 개발)

  • Jung Min-Kyoung;Hong Dong-Kweon
    • The KIPS Transactions:PartD
    • /
    • v.13D no.1 s.104
    • /
    • pp.1-10
    • /
    • 2006
  • This paper introduces the development XPERT(XML Query Processing Engine using Relational Technologies) which is based on relational model. In our system we have used a decomposed approach to store XML files in relational tables. XML queries are translated to SQLs according to the table schema, and then they are sent to the relational DBMS to get the results back. Our translation scheme produces AST(Abstract Syntax Tree) by analyzing XQuery expressions at first. And on traversing AST proper SQLs are generated. Translated SQLs can reduce the number of joins by using path information and utilize dewey number to preserve document originated orderings among compoments in XML. In addition we propose the efficient algorithms of XPath and XQuery translation. And finally we show the implementation of our prototype system for the functional evaluations.

Palmprint Verification Using the Histogram of Local Binary Patterns (국부 이진패턴 히스토그램을 이용한 장문인식)

  • Kim, Min-Ki
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.10
    • /
    • pp.27-34
    • /
    • 2010
  • This paper proposes an efficient method for verifying palmprint which is captured at the natural interface without any physical restriction. The location and orientation of the region of interest (ROI) in palm images are variously appeared due to the translation and rotation of hand. Therefore, it is necessary to extract the ROI stably for palmprint recognition. This paper presents a method that can extract the ROI, which is based on the reference points that are located at the center of the crotch segments between index finger and middle finger and between ring finger and little finger. It also proposes a palmprint recognition method using the histogram of local binary patterns (LBP). Experiments for evaluating the performance of the proposed method were performed on 1,597 palmprint images acquired from 100 different persons. The experimental results showed that ROI was correctly extracted at the rate of 99.5% and the equal error rate (EER) and the decidability index d' indicating the performance of palmprint verification were 0.136 and 3.539, respectively. These results demonstrate that the proposed method is robust to the variations of the translation and rotation of hand.

Design of an Efficient FTL Algorithm for Flash Memory Accesses Using Sector-level Mapping (섹터 매핑 기법을 적용한 효율적인 FTL 알고리듬 설계)

  • Yoon, Tae-Hyun;Kim, Kwang-Soo;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.12B
    • /
    • pp.1418-1425
    • /
    • 2009
  • This paper proposes a novel FTL (Flash Translation Layer) algorithm based on sector-level mapping to reduce the number of total erase operations in flash memory accesses. The proposed algorithm can reduce the number of erase operations by utilizing the sector-level mapping table when writing data at flash memory. Sector-level mapping technique reduces flash memory access time and extendsthe life time of the flash memory. In the algorithm, wear-leveling is implemented by selecting victim blocks having the minimal number of erase operations, when empty spaces for write are not available. To evaluate the performance of the proposed FTL algorithm, experiments were performed on several applications, such as MP3 players, MPEG players, web browsers and document editors. The proposed algorithm reduces the number of erase operations by 72.4% and 61.9%, when compared with well-known BAST and FAST algorithms, respectively.

Intra-Sentence Segmentation using Maximum Entropy Model for Efficient Parsing of English Sentences (효율적인 영어 구문 분석을 위한 최대 엔트로피 모델에 의한 문장 분할)

  • Kim Sung-Dong
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.5
    • /
    • pp.385-395
    • /
    • 2005
  • Long sentence analysis has been a critical problem in machine translation because of high complexity. The methods of intra-sentence segmentation have been proposed to reduce parsing complexity. This paper presents the intra-sentence segmentation method based on maximum entropy probability model to increase the coverage and accuracy of the segmentation. We construct the rules for choosing candidate segmentation positions by a teaming method using the lexical context of the words tagged as segmentation position. We also generate the model that gives probability value to each candidate segmentation positions. The lexical contexts are extracted from the corpus tagged with segmentation positions and are incorporated into the probability model. We construct training data using the sentences from Wall Street Journal and experiment the intra-sentence segmentation on the sentences from four different domains. The experiments show about $88\%$ accuracy and about $98\%$ coverage of the segmentation. Also, the proposed method results in parsing efficiency improvement by 4.8 times in speed and 3.6 times in space.

Automatic Estimation of Geometric Translations Between High-resolution Optical and SAR Images (고해상도 광학영상과 SAR 영상 간 자동 변위량 추정)

  • Han, You Kyung;Byun, Young Gi;Kim, Yong Il
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.20 no.3
    • /
    • pp.41-48
    • /
    • 2012
  • Using multi-sensor or multi-temporal high resolution satellite images together is essential for efficient applications in remote sensing area. The purpose of this paper is to estimate geometric difference of translations between high-resolution optical and SAR images automatically. The geometric and radiometric pre-processing steps were fulfilled to calculate the similarity between optical and SAR images by using Mutual Information method. The coarsest-level pyramid images of each sensor constructed by gaussian pyramid method were generated to estimate the initial translation difference of the x, y directions for calculation efficiency. The precise geometric difference of translations was able to be estimated by applying this method from coarsest-level pyramid image to original image in order. Yet even when considered only translation between optical and SAR images, the proposed method showed RMSE lower than 5m in all study sites.

Formal Semantics Based on Action Equation 2.0 for Python (작용식 2.0 기반 파이썬에 대한 형식 의미론)

  • Han, Jung Lan
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.10 no.6
    • /
    • pp.163-172
    • /
    • 2021
  • To specify a formal semantics for a programming language is to do a significant part for design, standardization and translation of it. The Python is popular and powerful, it is necessary to do research for a formal semantics to specify a static and dynamic semantics for Python clearly in order to design a similar language and do an efficient translation. This paper presents the Action Equation 2.0 that specifies a formal semantics for Python to change and update Action Equation. To measure the execution time for Python programs, we implemented the semantic structure specified in Action Equation 2.0 in Java, and prove through simulation that Action Equation 2.0 is a real semantic structure that can be implemented. The specified Action Equation 2.0 is compared to other descriptions, in terms of readability, modularity, extensibility, and flexibility and then we verified that Action Equation 2.0 is superior to other formal semantics.

A Disjoint Multi-path Routing Protocol for Efficient Transmission of Collecting Data in Wireless Sensor Network (무선 센서 네트워크에서 수집 데이터의 효과적인 전송을 위한 비겹침 다중경로 라우팅 프로토콜)

  • Han, Dae-Man;Lim, Jae-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.17C no.5
    • /
    • pp.433-440
    • /
    • 2010
  • Energy efficiency, low latency and scalability for wireless sensor networks are important requirements, especially, the wireless sensor network consist of a large number of sensor nodes should be minimized energy consumption of each node to extend network lifetime with limited battery power. An efficient algorithm and energy management technology for minimizing the energy consumption at each sensor node is also required to improve transfer rate. Thus, this paper propose no-overlap multi-pass protocol provides for sensor data transmission in the wireless sensor network environment. The proposed scheme should minimize network overhead through reduced a sensor data translation use to searched multi-path and added the multi-path in routing table. Proposed routing protocol may minimize the energy consumption at each node, thus prolong the lifetime of the sensor network regardless of where the sink node is located outside or inside the received signal strength range. To verify propriety proposed scheme constructs sensor networks adapt to current model using the real data and evaluate consumption of total energy.

Establishement of Antibody Selection by Ribosome Display (Ribosome Display를 이용한 항체선별 방법의 확립)

  • Lee, Myung-Shin;Kwon, Myung-Hee;Hwang Kim, Kyongmin;Park, Sun;Shin, Ho-Joon;Kim, Hyung-Il
    • IMMUNE NETWORK
    • /
    • v.3 no.3
    • /
    • pp.219-226
    • /
    • 2003
  • Background: Phage display is the most widely used technique among display methods to produce monoclonal antibody fragment with a specific binding activity. Having a large library for efficient antibody display/selection is quite laborious process to have more than $10^9$ members of transformants. To overcome these limitations, several in vitro selection approaches have been reported. Ribosome display that links phenotypes, proteins, directly to genotype, mRNA, is one of the in vitro display methods. Ribosome display can reach the size of scFv library up to $10^{14}$ molecules and it can be further diversified during PCR steps. To select the high affinity scFv from one pot library, we established ribosome display technique by modifying the previously reported eukaryotic translation system. Methods: To establish the antibody selection system by ribosome display, we used 3D8, anti-DNA antibody. A 3D8 scFv was synthesized in vitro by an in vitro transcription-translation system. The translated 3D8 scFv and the encoding 3D8 mRNA are connected to the ribosome. These scFv-ribosome-mRNA complexes were selected by binding to their specific antigens. The eluted mRNAs from the complexes are reverse transcribed and re-amplified by PCR. To apply this system, antibody library from immunized mouse with terminal protein (TP)-peptide of hepatitis B virus DNA polymerase TP domain was also used. This TP-peptide encompasses the 57~80 amino acid residues of TP. These mRNA/ribosome/scFv complexes by our system were panned three times against TP-peptide. The enrichment of antibody from library was determined by radioimmunoassay. Results: We specifically selected 3D8, anti-DNA antibody, against ssDNA as a model system. The selected 3D8 RNAs sequences from translation complexes were recovered by RT-PCR. By applying this model system, we enriched TP-peptide-specific scFv pools through three cycles of panning from immunized library. Conclusion: We show that our translating ribosome complexes are well maintained and we can enrich the TP-specific scFv pools. This system can be applied to select specific antibody from an antibody library.

The Efficient Merge Operation in Log Buffer-Based Flash Translation Layer for Enhanced Random Writing (임의쓰기 성능향상을 위한 로그블록 기반 FTL의 효율적인 합병연산)

  • Lee, Jun-Hyuk;Roh, Hong-Chan;Park, Sang-Hyun
    • The KIPS Transactions:PartD
    • /
    • v.19D no.2
    • /
    • pp.161-186
    • /
    • 2012
  • Recently, the flash memory consistently increases the storage capacity while the price of the memory is being cheap. This makes the mass storage SSD(Solid State Drive) popular. The flash memory, however, has a lot of defects. In order that these defects should be complimented, it is needed to use the FTL(Flash Translation Layer) as a special layer. To operate restrictions of the hardware efficiently, the FTL that is essential to work plays a role of transferring from the logical sector number of file systems to the physical sector number of the flash memory. Especially, the poor performance is attributed to Erase-Before-Write among the flash memory's restrictions, and even if there are lots of studies based on the log block, a few problems still exists in order for the mass storage flash memory to be operated. If the FAST based on Log Block-Based Flash often is generated in the wide locality causing the random writing, the merge operation will be occur as the sectors is not used in the data block. In other words, the block thrashing which is not effective occurs and then, the flash memory's performance get worse. If the log-block makes the overwriting caused, the log-block is executed like a cache and this technique contributes to developing the flash memory performance improvement. This study for the improvement of the random writing demonstrates that the log block is operated like not only the cache but also the entire flash memory so that the merge operation and the erase operation are diminished as there are a distinct mapping table called as the offset mapping table for the operation. The new FTL is to be defined as the XAST(extensively-Associative Sector Translation). The XAST manages the offset mapping table with efficiency based on the spatial locality and temporal locality.