• Title/Summary/Keyword: 리프로그래밍

Search Result 57, Processing Time 0.022 seconds

Development of a Pre-Processing Program for Flow Analysis Based on the Object-Oriented Programming Concept (OOP 개념에 기초한 유동해석용 전처리 프로그램 개발)

  • Myong, Hyon-Kook;Ahn, Jong-Ki
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.32 no.1
    • /
    • pp.70-77
    • /
    • 2008
  • A pre-processing program based on the OOP(object-oriented programming) concept has been developed. The program consists of the input of a 2D or 3D flow problem to a CFD program by means of an user-friendly interface and the subsequent transformation of this input into a form suitable for the solver(PowerCFD) using unstructured cell-centered method. User-friendly GUI(graphic user interface) has been built on the base of MFC(Microsoft Foundation Class). The program is organized as modules by classes based on VTK(Visualization ToolKit)-library, and these classes are made to function through inheritance and cooperation which is an important and valuable concept of object-oriented programming. The major functions of this program are introduced and demonstrated, which include mesh generation, boundary settings, solver settings, generation of grid connectivity and geometric data etc.

Design and Implementation of Remarkable Processor for Web page Code separation (웹페이지 코드 분리를 위한 리마커블 처리기의 설계 및 구현)

  • Kang, Dong-Hyeon;Lee, Kwan-Yong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.05a
    • /
    • pp.502-505
    • /
    • 2007
  • 웹프로그래밍 환경에서 프리젠테이션 로직을 구성하는 서버처리 웹페이지에는 디자인을 위한 HTML 요소와 로직을 구현하기 위한 서버측, 클라이언트측 스크립팅 요소가 혼합되어 있다. 이와 같은 경우 스파게티 코딩에 의해 웹디자이너와 웹프로그래머간의 작업의 경계가 불분명해지고 디자인과 로직의 구성이 정렬되지 못하는 문제점이 발생할 수 있다. 본 논문에서는 이러한 문제점을 해결하고 웹페이지의 가독성과 재사용성을 향상시키기 위한 리마커블 코드 분리 모델을 제안한다. 이를 통해 웹페이지 수준에서 HTML 요소와 스크립팅 요소를 완전하게 분리하고 관련 연구와 차별화되는 플랫폼 독립적이고 언어 중립적인 웹페이지 모듈화 과정을 소개하고자 한다.

Preprocessing of Transmitted Spectrum Data for Development of a Robust Non-destructive Sugar Prediction Model of Intact Fruits (과실의 비파괴 당도 예측 모델의 성능향상을 위한 투과스펙트럼의 전처리)

  • Noh, Sang-Ha;Ryu, Dong-Soo
    • Journal of the Korean Society for Nondestructive Testing
    • /
    • v.22 no.4
    • /
    • pp.361-368
    • /
    • 2002
  • The aim of this study was to investigate the effect of preprocessing the transmitted energy spectrum data on development of a robust model to predict the sugar content in intact apples. The spectrum data were measured from 120 Fuji apple samples conveying at the speed of 2 apples per second. Computer algorithms of preprocessing methods such as MSC, SNV, first derivative, OSC and their combinations were developed and applied to the raw spectrum data set. The results indicated that correlation coefficients between the transmitted energy values at each wavelength and sugar contents of apples were significantly improved by the preprocessing of MSC and SNV in particular as compared with those of no-preprocessing. SEPs of the prediction models showed great difference depending on the preprocessing method of the raw spectrum data, the largest of 1.265%brix and the smallest of 0.507% brix. Such a result means that an appropriate preprocessing method corresponding to the characteristics of the spectrum data set should be found or developed for minimizing the prediction errors. It was observed that MSC and SNV are closely related to prediction accuracy, OSC is to number of PLS factors and the first derivative resulted in decrease of the prediction accuracy. A robust calibration model could be d3eveloped by the combined preprocessing of MSC and OSC, which showed that SEP=0.507%brix, bias=0.0327 and R2=0.8823.

A Genetic Programming Approach to Blind Deconvolution of Noisy Blurred Images (잡음이 있고 흐릿한 영상의 블라인드 디컨벌루션을 위한 유전 프로그래밍 기법)

  • Mahmood, Muhammad Tariq;Chu, Yeon Ho;Choi, Young Kyu
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.3 no.1
    • /
    • pp.43-48
    • /
    • 2014
  • Usually, image deconvolution is applied as a preprocessing step in surveillance systems to reduce the effect of motion or out-of-focus blur problem. In this paper, we propose a blind-image deconvolution filtering approach based on genetic programming (GP). A numerical expression is developed using GP process for image restoration which optimally combines and exploits dependencies among features of the blurred image. In order to develop such function, first, a set of feature vectors is formed by considering a small neighborhood around each pixel. At second stage, the estimator is trained and developed through GP process that automatically selects and combines the useful feature information under a fitness criterion. The developed function is then applied to estimate the image pixel intensity of the degraded image. The performance of developed function is estimated using various degraded image sequences. Our comparative analysis highlights the effectiveness of the proposed filter.

Design of a redundancy control circuit for 1T-SRAM repair using electrical fuse programming (전기적 퓨즈 프로그래밍을 이용한 1T-SRAM 리페어용 리던던시 제어 회로 설계)

  • Lee, Jae-Hyung;Jeon, Hwang-Gon;Kim, Kwang-Il;Kim, Ki-Jong;Yu, Yi-Ning;Ha, Pan-Bong;Kim, Young-Hee
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.8
    • /
    • pp.1877-1886
    • /
    • 2010
  • In this paper, we design a redundancy control circuit for 1T-SRAM repair using electrical fuse programming. We propose a dual port eFuse cell to provide high program power to the eFuse and to reduce the read current of the cell by using an external program supply voltage when the supply power is low. The proposed dual port eFuse cell is designed to store its programmed datum into a D-latch automatically in the power-on read mode. The layout area of an address comparison circuit which compares a memory repair address with a memory access address is reduced approximately 19% by using dynamic pseudo NMOS logic instead of CMOS logic. Also, the layout size of the designed redundancy control circuit for 1T-SRAM repair using electrical fuse programming with Dongbu HiTek's $0.11{\mu}m$ mixed signal process is $249.02 {\times}225.04{\mu}m^{2}$.

Scalable RDFS Reasoning using Logic Programming Approach in a Single Machine (단일머신 환경에서의 논리적 프로그래밍 방식 기반 대용량 RDFS 추론 기법)

  • Jagvaral, Batselem;Kim, Jemin;Lee, Wan-Gon;Park, Young-Tack
    • Journal of KIISE
    • /
    • v.41 no.10
    • /
    • pp.762-773
    • /
    • 2014
  • As the web of data is increasingly producing large RDFS datasets, it becomes essential in building scalable reasoning engines over large triples. There have been many researches used expensive distributed framework, such as Hadoop, to reason over large RDFS triples. However, in many cases we are required to handle millions of triples. In such cases, it is not necessary to deploy expensive distributed systems because logic program based reasoners in a single machine can produce similar reasoning performances with that of distributed reasoner using Hadoop. In this paper, we propose a scalable RDFS reasoner using logical programming methods in a single machine and compare our empirical results with that of distributed systems. We show that our logic programming based reasoner using a single machine performs as similar as expensive distributed reasoner does up to 200 million RDFS triples. In addition, we designed a meta data structure by decomposing the ontology triples into separate sectors. Instead of loading all the triples into a single model, we selected an appropriate subset of the triples for each ontology reasoning rule. Unification makes it easy to handle conjunctive queries for RDFS schema reasoning, therefore, we have designed and implemented RDFS axioms using logic programming unifications and efficient conjunctive query handling mechanisms. The throughputs of our approach reached to 166K Triples/sec over LUBM1500 with 200 million triples. It is comparable to that of WebPIE, distributed reasoner using Hadoop and Map Reduce, which performs 185K Triples/sec. We show that it is unnecessary to use the distributed system up to 200 million triples and the performance of logic programming based reasoner in a single machine becomes comparable with that of expensive distributed reasoner which employs Hadoop framework.

Reprogramming of Cloned Embryos During Early Embryogenesis (초기 발생에 있어서 복제수정란의 리프로그래밍)

  • Han, Yong-Mahn;Kang, Yong-Kook;Koo, Deog-Bon;Lee, Kyung-Kwang
    • 대한생식의학회:학술대회논문집
    • /
    • 2002.05a
    • /
    • pp.11-17
    • /
    • 2002
  • Animal clones derived from somatic cells have been successfully produced in a variety of mammalian species such as sheep, cattle, mice, goats, pigs, cat and rabbits. However, there are still many unsolved problems in the present cloning technology. Somatic cell nuclear transfer has shown several developmental aberrancies including high rate of abortion in early gestation and increased perinatal death. These developmental failures of cloned embryos may arise from abnormal reprogramming of donor genome and/or incomplete cloning procedure. We have found that overall genomic methylation status of cloned bovine embryos is quite different from that of normal embryos in various genomic regions, suggesting that the developmental failures of cloned embryos may be due to incomplete reprogramming of donor genomic DNA. Many of the advances in understanding the molecular events for reprogramming of donor genome will more clarify the developmental defects of cloned embryos.

  • PDF

Naive Bayes Learning Algorithm based on Map-Reduce Programming Model (Map-Reduce 프로그래밍 모델 기반의 나이브 베이스 학습 알고리즘)

  • Kang, Dae-Ki
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.10a
    • /
    • pp.208-209
    • /
    • 2011
  • In this paper, we introduce a Naive Bayes learning algorithm for learning and reasoning in Map-Reduce model based environment. For this purpose, we use Apache Mahout to execute Distributed Naive Bayes on University of California, Irvine (UCI) benchmark data sets. From the experimental results, we see that Apache Mahout' s Distributed Naive Bayes algorithm is comparable to WEKA' s Naive Bayes algorithm in terms of performance. These results indicates that in the future Big Data environment, Map-Reduce model based systems such as Apache Mahout can be promising for machine learning usage.

  • PDF

Performance Analysis on Hadoop with SSD for Interative Process (SSD 타입 저장장치를 포함하는 Hadoop 시스템의 Iterative Processing 처리 성능 분석)

  • Oh, Sangyoon;Kwon, Seong-Min;Lee, Sookyung
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2016.07a
    • /
    • pp.191-193
    • /
    • 2016
  • 본 논문에서는 SSD 저장장치를 포함하는 하둡의 Iterative Processing에 대한 성능 분석 결과를 소개한다. 하둡은 맵 리듀스 병렬 프로그래밍 모델을 통해 Batch Processing에 특화된 구조를 가지고 있는 프레임 워크이다. 이는 병렬/분산 환경에서 큰 성능향상을 보장하지만, 반복 작업을 수행하는 Iterative Processing에 대하여는 성능이 낮아지는 문제가 존재하고 있다. 이에 본 논문에서는 점차 낮아지는 가격으로 인해 하둡시스템에 적용 가능성이 타진되는 SSD를 통해 반복 작업의 성능이슈를 해결할 수 있는지 확인하고, SSD를 통한 성능향상의 요소가 존재하는지 알아보고자 실험을 진행하였다. 실험에서는 Batch Processing인 word count와 Iterative Processing인 Page Rank 알고리즘을 MapReduce로 구현하고 데이터 크기에 따른 성능 향상도를 측정하였고, SSD 추가와 같은 하드웨어적인 성능을 통한 하둡의 반복 작업은 큰 효율을 기대하기가 어렵다는 결론을 보였다.

  • PDF

Development of Finite Element Program for Automobile Crashworthiness(II) (자동차 충돌해석용 프로그램 개발(II))

  • 채수원;최형연;민동균
    • Journal of the korean Society of Automotive Engineers
    • /
    • v.18 no.4
    • /
    • pp.67-87
    • /
    • 1996
  • 본 연구에서는 차체의 충돌해석 및 모델링을 위하여 판/쉘 요소의 자동생성 모듈을 개발하고 재료의 변형특성 모델링 모듈 및 접촉처리 모듈을 개발하였다. 충돌해석용 전처리기능으로는 평면, 실린더 곡면, B-스플라인 곡면 및 블렌딩 (blending) 곡면상에서의 사각형 요소망 자동생성 기법과 프로그램을 개발하였다. 또한 차체를 구성하고 있는 여러가지 재료들의 변형거동을 모델링하여 개발중인 충돌해석전용프로그램인 Autocrash의 모듈로서 완성하였다. 이들은 변형률속도의 영향이 고려된 탄소성 재료, 강체 재료, 포옴 재료 및 이방성 재료등으로 정면충돌 해석 및 측면충돌 해석에 필요하다. 한편 접촉처리 모듈에서 접촉탐색법으로는 주종탐색법과 HITA 알고리즘을 병행하여 사용할 수 있도록 프로그래밍하였으며, 불침투 조건의 처리는 벌칙함 수법을 이용하였다.

  • PDF