• Title/Summary/Keyword: GP method

Search Result 466, Processing Time 0.022 seconds

The parallelization of binarization using a GP-GPU

  • Han, Seong Hyeon;Yoo, Suk Won
    • International Journal of Advanced Culture Technology
    • /
    • v.4 no.4
    • /
    • pp.57-63
    • /
    • 2016
  • In this paper, we propose the optimized binarization in the GP-GPU. Because the binarinztion is esily paralledlized, we propose two ways of binary operations that utilize GP-GPU. The first method was to divide data load, subtraction and conversion, data store. The second method was processed collectibely. The second method was 2.52 times faster than the first method. After synthesizing the GP-GPU to the FPGA, the GP-GPU on the binarization were compared with the binarization on the ODROID XU. The binarization on the GP-GPU was 1.89 times faster than the binarization on the ODROID XU.

Thread Distribution Method of GP-GPU for Accelerating Parallel Algorithms (병렬 알고리즘의 가속화를 위한 GP-GPU의 Thread할당 기법)

  • Lee, Kwan-Ho;Kim, Chi-Yong
    • Journal of IKEEE
    • /
    • v.21 no.1
    • /
    • pp.92-95
    • /
    • 2017
  • In this paper, we proposed a way to improve function of small scale GP-GPU. Instead of using superscalar which increase scheduling-complexity, we suggested the application of simple core to maximize GP-GPU performance. Our studies also demonstrated that simplified Stream Processor is one of the way to achieve functional improvement in GP-GPU. In addition, we found that developing of optimal thread-assigning method in Warp Scheduler for specific application improves functional performance of GP-GPU. For examination of GP-GPU functional performance, we suggested the thread-assigning way which coordinated with Deep-Learning system; a part of Neural Network. As a result, we found that functional index in algorithm of Neural Network was increased to 90%, 98% compared with Intel CPU and ARM cortex-A15 4 core respectively.

A firmware base address search technique based on MIPS architecture using $gp register address value and page granularity

  • Seok-Joo, Mun;Young-Ho, Sohn
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.2
    • /
    • pp.1-7
    • /
    • 2023
  • In this paper, we propose a base address candidate selection method using the $gp register and page granularity as a way to build a static analysis environment for firmware based on MIPS architecture. As a way to shorten the base address search time, which is a disadvantage of the base address candidate selection method through inductive reasoning in existing studies, this study proposes a method to perform page-level search based on the $gp register in the existing base address candidate selection method as a reference point for search. Then, based on the proposed method, a base address search tool is implemented and a static analysis environment is constructed to prove the validity of the target tool. The results show that the proposed method is faster than the existing candidate selection method through inductive reasoning.

Comparison Study of Parameter Estimation Methods for Some Extreme Value Distributions (Focused on the Regression Method) (극단치 분포의 모수 추정방법 비교 연구(회귀 분석법을 기준으로))

  • Woo, Ji-Yong;Kim, Myung-Suk
    • Communications for Statistical Applications and Methods
    • /
    • v.16 no.3
    • /
    • pp.463-477
    • /
    • 2009
  • Parameter estimation methods such as maximum likelihood estimation method, probability weighted moments method, regression method have been popularly applied to various extreme value models in numerous literature. Among three methods above, the performance of regression method has not been rigorously investigated yet. In this paper the regression method is compared with the other methods via Monte Carlo simulation studies for estimation of parameters of the Generalized Extreme Value(GEV) distribution and the Generalized Pareto(GP) distribution. Our simulation results indicate that the regression method tends to outperform other methods under small samples by providing smaller biases and root mean square errors for estimation of location parameter of the GEV model. For the scale parameter estimation of the GP model under small samples, the regression method tends to report smaller biases than the other methods. The regression method tends to be superior to other methods for the shape parameter estimation of the GEV model and GP model when the shape parameter is -0.4 under small and moderately large samples.

Genenal Pharmacological Action of Ginseng Preparation (인삼제제(人蔘製劑)의 일반약리(一般藥理)에 관(關)한 연구(硏究))

  • Shin, Sang-Chul;Han, Byung-Hoon
    • Journal of Pharmaceutical Investigation
    • /
    • v.14 no.2
    • /
    • pp.86-91
    • /
    • 1984
  • A ginseng preparation (GP) consisting of ginseng ex., lycium fructus ex., four kinds of vitamines and caffein was evaluated for acute toxicity and general pharmacology. Average lethal doses $(LD_{50})$ of GP in male mice were 2,988mg/kg (i.p.) and more than 3g/kg (p.o.). In dosage of 300 and 900mg/kg (p.o.) showed no analgesic activity in both tests of the writhing method induced by acetic acid and of tail pressure method and no effect on the pentetrazole-induced convulsion. However, it appeared to have a hypothermic action only in dose of 900mg/kg. The duration of hypnosis induced by hexobarbital sodium in mice was shortened by GP, being probably due to caffein. GP Produced no marked contraction of isolated ileum and uterus in high concentrations of up to $1{\pm}10^{-3}g/ml$. These results suggested that GP did not show any considerable central nervous depressant activity and exhibited very weak actue toxicity in mice.

  • PDF

Response Surface Modeling by Genetic Programming I: A Directional Derivative-Based Smoothering Method (유전적 프로그래밍을 이용한 응답면의 모델링 I : 방향도함수 기반의 Smoothering 기법)

  • Yeun, Yun-Seog;Rhee, Wook
    • Journal of Information Technology Application
    • /
    • v.3 no.3
    • /
    • pp.1-24
    • /
    • 2001
  • This paper introduces the genetic programming algorithm(GP), which can approximate highly nonlinear functions, as a tool for the modeling of response surfaces. When the response surfaces is approximated, the very small or minimal teaming set should be used, and thus it is almost certain that GP trees will show overfilling that must be avoided at all costs. We present a novel method, calledDDBS(DirectionalDerivative-Based Smoothering), which very effectively eliminates the unwanted behaviors of GP trees such as large peaks, oscillations, and also overfitting. Four illustrative numerical examples are given to demonstrate the performance of the genetic programming algorithm that adopts DDBS.

  • PDF

Geometry Processing using Multi-Core GP-GPU (멀티코어 GP-GPU를 이용한 지오메트리 처리)

  • Lee, Kwang-Yeob;Kim, Chi-Yong
    • Journal of IKEEE
    • /
    • v.14 no.2
    • /
    • pp.69-75
    • /
    • 2010
  • A 3D graphics pipeline is largely divided into geometry stage and rendering stage. In this paper, we propose a method that accelerates a geometry processing in multi-core GP-GPU, using dual-phase structure. It can be improved by parallel data processing using SIMD of GP-GPU, dual-phase structure and memory prefetch. The proposed architecture improves approximately 19% of performance when it use all the features.

GP-GPU based Parallelization for Urban Terrain Atmospheric Model CFD_NIMR (도시기상모델 CFD_NIMR의 GP-GPU 실행을 위한 병렬 프로그램의 구현)

  • Kim, Youngtae;Park, Hyeja;Choi, Young-Jeen
    • Journal of Internet Computing and Services
    • /
    • v.15 no.2
    • /
    • pp.41-47
    • /
    • 2014
  • In this paper, we implemented a CUDA Fortran parallel program to run the CFD_NIMR model on GP-GPU's, which simulates air diffusion on urban terrains. A GP-GPU is graphic processing unit in the form of a PCI card, and a general calculation accelerator to perform a large amount of high speed calculations with low cost and electric power. The GP-GPU gives performance enhancement of speed by 15 times to compare the Nvidia Tesla C1060 GPU with Intel XEON 2.0 GHz CPU. In addition, the program on a GP-GPU shows efficient performance compared to an MPI parallel program on multiple CPU's. It is expected that a proposed programming method on the GP-GPU parallel program can be used for numerical models with a similar structure.

Improvement of Genetic Programming Based Nonlinear Regression Using ADF and Application for Prediction MOS of Wind Speed (ADF를 사용한 유전프로그래밍 기반 비선형 회귀분석 기법 개선 및 풍속 예보 보정 응용)

  • Oh, Seungchul;Seo, Kisung
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.64 no.12
    • /
    • pp.1748-1755
    • /
    • 2015
  • A linear regression is widely used for prediction problem, but it is hard to manage an irregular nature of nonlinear system. Although nonlinear regression methods have been adopted, most of them are only fit to low and limited structure problem with small number of independent variables. However, real-world problem, such as weather prediction required complex nonlinear regression with large number of variables. GP(Genetic Programming) based evolutionary nonlinear regression method is an efficient approach to attach the challenging problem. This paper introduces the improvement of an GP based nonlinear regression method using ADF(Automatically Defined Function). It is believed ADFs allow the evolution of modular solutions and, consequently, improve the performance of the GP technique. The suggested ADF based GP nonlinear regression methods are compared with UM, MLR, and previous GP method for 3 days prediction of wind speed using MOS(Model Output Statistics) for partial South Korean regions. The UM and KLAPS data of 2007-2009, 2011-2013 years are used for experimentation.

Modulation of Multidrug Resistance in Cancer by P-Glycoprotein

  • Gadhe, Changdev G.;Cho, Seung Joo
    • Journal of Integrative Natural Science
    • /
    • v.4 no.1
    • /
    • pp.23-30
    • /
    • 2011
  • Multidrug resistance (MDR) is one of the main obstacles in the chemotherapy of cancer. MDR is associated with the over expression of P-glycoprotein (P-gp), resulting in increased efflux of chemotherapy from cancer cells. Inhibiting P-gp as a method to reverse MDR in cancer patients has been studied extensively, but the results have generally been disappointing. First-generation agents were limited by unacceptable toxicity, whereas second-generation agents had better tolerability but were confounded by unpredictable pharmacokinetic interactions and interactions with other transporter proteins. Third-generation inhibitors have high potency and specificity for P-gp. Furthermore, pharmacokinetic studies to date have shown no appreciable impact on drug metabolism and no clinically significant drug interactions with common chemotherapy agents. Third-generation P-gp inhibitors have shown promise in clinical trials. The continued development of these agents may establish the true therapeutic potential of P-gp-mediated MDR reversal.