• Title/Summary/Keyword: 코드 최적화

Search Result 476, Processing Time 0.023 seconds

Application of Response Surface Methodology for Optimization of Nature Dye Extraction Process (천연색소 추출공정 최적화를 위한 반응표면분석법의 적용)

  • Lee, Seung Bum;Lee, Won Jae;Hong, In Kwon
    • Applied Chemistry for Engineering
    • /
    • v.29 no.3
    • /
    • pp.283-288
    • /
    • 2018
  • As the use of environmentally friendly and non-disease natural pigments grows, various methods for extracting natural pigments have been studied. The natural color was extracted from parsley, a vegetable ingredient containing natural dyes. Target color codes of green series of natural dyes extracted as variables #50932C (L = 55.0, a = -40.0, b = 46.0) were set with the pH and temperature of extracted natural color coordinates (of the extracted), and the quantitative intensities of natural dyes were analyzed. During the colorimetric analysis predicted by the reaction surface analysis method, a color coordinate analysis was conducted under the optimal conditions of pH 8.0 and extraction temperature of $60.9^{\circ}C$. Under these conditions, predicted figures of L, a, and b were 55.0, -36.3, and 36.8, respectively, while actual experimental ones confirmed were 69.0, -35.9, and 31.4, respectively. In these results, the theory accuracy and actual error rate were confirmed to be 73.0 and 13.8%, respectively. The theoretical optimization condition of the color difference (${\Delta}E$) was at the pH of 9.2 and extraction temperature of $55.2^{\circ}C$. Under these conditions the predicted ${\Delta}E$ figure was 12.4 while the experimental one was 13.0. The difference in color analysis showed 97.5% of the theoretical accuracy and 4.5% of the actual error rate. However, the combination of color coordinates did not represent a desired target color, but rather close to the targeted color by means of an arithmetic mean. Therefore, it can be said that when the reaction surface analysis method was applied to the natural dye extraction process, the use of color coordinates as a response value can be a better method for optimizing the dye extraction process.

A Customized Cancer Radiation Treatment Planning Simulation (ccRTPs) System via Web and Network (웹과 네트워크 기술을 이용한 환자 맞춤식 암치료 계획 시뮬레이션 시스템)

  • Khm, O-Yeon
    • Progress in Medical Physics
    • /
    • v.17 no.3
    • /
    • pp.144-152
    • /
    • 2006
  • The telemedicine using independent client-server system via networks can provide high quality normalized services to many hospitals, specifically to local/rural area hospitals. This will eventually lead to a decreased medical cost because the centralized institute can handle big computer hardware systems and complicated software systems efficiently and economically, Customized cancer radiation treatment planning for each patient Is very useful for both a patient and a doctor because it makes possible for the most effective treatment with the least possible dose to patient. Radiation planners know that too small a dose to the tumor can result in recurrence of the cancer, while too large a dose to healthy tissue can cause complications or even death. The best solution is to build an accurate planning simulation system to provide better treatment strategies based on each patient's computerized tomography (CT) image. We are developing a web-based and a network-based customized cancer radiation therapy simulation system consisting of four Important computer codes; a CT managing code for preparing the patients target data from their CT image files, a parallel Monte Carlo high-energy beam code (PMCEPT code) for calculating doses against the target generated from the patient CT image, a parallel linear programming code for optimizing the treatment plan, and scientific data visualization code for efficient pre/post evaluation of the results. The whole softwares will run on a high performance Beowulf PC cluster of about 100-200 CPUs. Efficient management of the hardware and software systems is not an easy task for a hospital. Therefore, we integrated our system into the client-sewer system via network or web and provide high quality normalized services to many hospitals. Seamless communication with doctors is maintained via messenger function of the server-client system.

  • PDF

Development of a Core management Algorithm for Optimal Design of AMBIDEXTER Transient Cores (AMBIDEXTER 천이노심 설계최적화를 위한 노심관리 알고리즘 개발)

  • Yu, Geuk-Jong;Sin, Dong-Hun;So, Sun-Gyu;Lee, Yeong-Jun;Kim, Jin-Seong;O, Se-Gi
    • Proceedings of the Korean Nuclear Society Conference
    • /
    • 2004.10a
    • /
    • pp.99-100
    • /
    • 2004
  • AMBIDEXTER-NEC의 천이노심은 $^{Nat}Th$$^{Nat}U$의 주입만으로 전 출력의 Break-even 노심에 도달하기위한 중간 단계이다. 선행연구에서 수행한 전 출력노심인 평형노심의 핵종수밀도에 도달하기 위해서 평형노심에서의 기저물질, 잠재핵분열성물질, 핵분열물질의 수밀도를 각 SEU-기반, Pu-기반, ADS-기반에서 그대로 유지하여 초기노심을 구성하였다. 또 각 시나리오에 대해 최대첨두출력과 원자로의 안전성을 고려해 Excess Reactivity를 5mk 내에서 초기노심을 결정하였다. 각 노심은 주 핵분열성물질 $^{235}U$, $^{239}Pu$$^{233}U$의 핵반응단면적 특성에 따라 평균 전환율이 각각 0.95, 0.83 및 1 .21 로서 핵연료물질의 적절한 선택만으로도 전환로, 연소로 및 증식로로 설계할 수 있음을 보여준다. 이러한 $Th/^{233}U$, U/Pu 핵연료주기를 사용하는 AMBIDEXTER-NEC 용융염핵연료 원자로의 초기노심에서 시작한 천이노심은 평형노심에장전할 충분한 $^{233}U$ 양을 확보해야 하므로 천이노심의 목표는 평형노심 $^{233}U$의 요구량에 최소한의 기간에 가장 적은 외부주입을 통해 도달하는 것이다. 천이노심에서 임계가 유지되는 AMBIDEXTER-NEC 원자로시스템의 3군 핵종변환 코드인 HELIOS-SQUID-AMBIBURN 체제를 개발하였고 그림 1.에 나타내었다. 이 알고리즘은 각 초기노심 중원소의 미시단면적, 중원소를 제외한 원소들의 거시단면적, 임계도를 만족하는 중성자속 및 외부주입율을 계산하여 SQUID 및 AMBIBURN 입력자료를 제공한다. 또한 일정시간 중원소의 핵종농도, 외부주입율과 중성자속이 일정하다는 가정 하 에 반복수행 하고 SEU-기반과 Pu-기반의 경우에는 각각 핵변환을 거쳐 재순환되는 $^{233}U$$^{239}Pu$의 양을 바로 주입하는 최대재순환 경우와 평형노심 요구 장전량에 이를 때까지 시설 내 저장하는 최소재순환 경우로 상황을 모사하였다. 그림 2 는 각 시나리오별 초기노심에서부터 200FPD까지 단위 용융염 체적당 $^{233}U$의 수밀도 시간변화를 나타낸 것이다. 그림을 보면 50일 이후부터는 수밀도의 변화가 일정한 기울기를 보이고 있고 재처리공정에서 $^{233}Pa$를 분리하는 최소재순환의 경우에는 최대재순환보다 2-3%정도에 지나지않아 그림에서 나타내지않았다. SEU-기반 및 Pu-기반에서 $^{233}U$의 증가율이 각각 2.54E+13, 2.81E+13 #/cc/d 로 Pu 기반이 조금 더 큰 증가율을 나타내고 있지만 평형노심 농도 1.04E+20 #/cc/d 에 도달하기 위해서는 두 경우 모두 매우 긴 시간이 걸릴 것을 예상할 수 있다. 요컨대 250MWth AMBIDEXTER-NEC가 평형노심을 이루기 위해 필요로 하는 $^{233}U$을 생산하는데 제안한 SEU-기반, Pu-기반 시나리오는 천이노심주기기간이 전형적인 원자로 수명 3-40년 보다 매우 큰 것으로 나타났다. 따라서 장전될 $^{233}U$의 확보를 위한 최적옵션은 초기노심부터 ADS와 같은 외부생산시설로부터 전량을 공급 받아 운전하는 것이라 판단된다.

  • PDF

Coded Aperture Gamma Camera for Thyroid Imaging: Monte Carlo Simulation (갑상선 영상 획득을 위한 부호화 구경 감마카메라: 몬테칼로 시뮬레이션 연구)

  • Beak, Cheol-Ha;Lee, Seung-Jae;Chung, Yong-Hyun
    • Progress in Medical Physics
    • /
    • v.19 no.4
    • /
    • pp.247-255
    • /
    • 2008
  • A coded aperture camera has been developed to improve the signal-to-noise ratio (SNR) while keeping the spatial resolution of a pinhole gamma camera. The purpose of this study was to optimize a coded aperture camera and to evaluate its possibility for thyroid imaging by Monte Carlo simulation. A clinical gamma camera, a pinhole collimator with 1.0 mm hole diameter, and a $79{\times}79$ modified uniformly redundant array (MURA) mask were designed using GATE (Geant4 Application for Tomographic Emission). The penetration ratio, spatial resolution, integral uniformity and signal-to-noise ratio (SNR) were simulated and evaluated as a function of the mask thickness. The spatial resolution of the coded aperture camera was consistent with the various mask thickness, SNR showed a maximum value at 1.2 mm mask thickness and integral uniformity was improved by increasing mask thickness. Compare to the pinhole gamma camera, the coded aperture camera showed improved SNR by a factor of 30 while keeping almost the same spatial resolution. In this simulation study, the results indicated that high spatial resolution and ultra-high SNR of the thyroid imaging are feasible using a coded aperture camera.

  • PDF

A Study on GPU Computing of Bi-conjugate Gradient Method for Finite Element Analysis of the Incompressible Navier-Stokes Equations (유한요소 비압축성 유동장 해석을 위한 이중공액구배법의 GPU 기반 연산에 대한 연구)

  • Yoon, Jong Seon;Jeon, Byoung Jin;Jung, Hye Dong;Choi, Hyoung Gwon
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.40 no.9
    • /
    • pp.597-604
    • /
    • 2016
  • A parallel algorithm of bi-conjugate gradient method was developed based on CUDA for parallel computation of the incompressible Navier-Stokes equations. The governing equations were discretized using splitting P2P1 finite element method. Asymmetric stenotic flow problem was solved to validate the proposed algorithm, and then the parallel performance of the GPU was examined by measuring the elapsed times. Further, the GPU performance for sparse matrix-vector multiplication was also investigated with a matrix of fluid-structure interaction problem. A kernel was generated to simultaneously compute the inner product of each row of sparse matrix and a vector. In addition, the kernel was optimized to improve the performance by using both parallel reduction and memory coalescing. In the kernel construction, the effect of warp on the parallel performance of the present CUDA was also examined. The present GPU computation was more than 7 times faster than the single CPU by double precision.

Identifying Risk Management Locations for Synthetic Natural Gas Plant Using Pipe Stress Analysis and Finite Element Analysis (배관응력해석 및 유한요소해석에 의한 SNG플랜트의 리스크 관리 위치 선정)

  • Erten, Deniz Taygun;Yu, Jong Min;Yoon, Kee Bong;Kim, Ji Yoon
    • Journal of Energy Engineering
    • /
    • v.26 no.2
    • /
    • pp.1-11
    • /
    • 2017
  • While they are becoming more viable, synthetic natural gas (SNG) plants, with their high temperatures and pressures, are still heavily dependent on advancements in the state-of-the-art technologies. However, most of the current work in the literature is focused on optimizing chemical processes and process variables, with little work being done on relevant mechanical damage and maintenance engineering. In this study, a combination of pipe system stress analysis and detailed local stress analysis was implemented to prioritize the inspection locations for main pipes of SNG plant in accordance to ASME B31.3. A pipe system stress analysis was conducted for pre-selecting critical locations by considering design condition and actual operating conditions such as heat-up and cool-down. Identified critical locations were further analyzed using a finite element method to locate specific high-stress points. Resultant stress values met ASME B31.3 code standards for the gasification reactor and lower transition piece (bend Y in Fig.1); however, it is recommended that the vertical displacement of bend Y be restricted more. The results presented here provide valuable information for future risk based maintenance inspection and further safe operation considerations.

Overproduction of Bacterial Trypsin in Streptomyces - Optimization for Streptomyces griseus Trypsin Production by Recombinant Streptomyces (미생물을 이용한 트립신 과대 생산 연구 - Streptomyces용 숙주-벡터계를 이용한 트립신 유전자의 대량발현 최적화 -)

  • Kim, Jong-Hee;Hong, Soon-Kwang
    • Microbiology and Biotechnology Letters
    • /
    • v.36 no.1
    • /
    • pp.28-33
    • /
    • 2008
  • The expression vector (pWHM3-TR1R2) for sprT gene encoding Streptomyces griseus trypsin (SGT) followed by two regulatory genes, sgtR1 and sgtR2, was introduced into Streptomyces lividans TK24 and Streptomyces griseus IFO 13350. Various media with different compositions were used to maximize the productivity of SGT in the recombinant trains. he SGT productivity was best when the transformant of S. lividans TK24 was cultivated in R2YE medium (0.74 unit/mL) at 5 days of cultivation. C5/L (0.66 unit/mL) medium also gave a good productivity, but Livid (0.08 unit/mL) and NDSK (0.06 unit/mL) yielded poor productivities. S. griseus IFO 13350/pWHM3-TR1R2 produced SGT by 1.518 unit/mL (C5/L), 1.284unit/mL (R2YE),0.932 unit/mL (NDSK), and 0.295 unit/mL (Livid) at 7 days of cultivation, which was much higher than those from S. lividans TK24/TR1R2. The SGT protein was purified from the culture broth of S. griseus IFO 13350/pWHM3-TR1R2 in C5/L to homogeneity via ammonium sulfate fractionation, and CM-sepharose and SP-sepharose column chromatographies. The specific activity of purified SGT was 69,252 unit/mg, and the final purification fold and recovery yield were 6.5 and 1.4%, respectively.

Transformation using Conjugal Transfer and attB Site Properties of Streptomyces natalensis ATCC27448 (접합전달을 이용한 Streptomyces natalensis ATCC27448의 형질전환 최적화 및 attB-site의 특성연구)

  • Lee Kang-Mu;Choi Sun-Uk;Park Hae-Ryong;Hwang Yong-Il
    • Korean Journal of Microbiology
    • /
    • v.41 no.2
    • /
    • pp.140-145
    • /
    • 2005
  • Streptomyces natalensis ATCC27448 produces natamycin, a commercially important macrolide antifungal antibiotic. For molecular genetic study of S. natalensis, we have developed a system for introducing DNA into S. natalensis via conjugal transfer from Escherichia coli. An effective transformation procedure for S. natalensis was established based on transconjugation from E, coli ET12567/pUZ8002 using a ${\Phi}C31$-derived integration vector, pSET152, containing oriT and attP fragments. The high frequency was obtained on MS medium containing 10 mM $MgCl_2$ using $6.25\times10^8$ of E.coli donor cells without heat treatment of spores. In addition, southern blot analysis of exconjugants and the sequence of plasmids containing DNA flanking the insertion sites from the chromosome revealed that S. natalensis contains a single ${\Phi}C31$ attB site and at least a secondary or pseudo attB site. Similar to the case of various Streptomyces species, a single ${\Phi}C31$ attB site of S. natalensis is present within an ORF encoding a pirin-homolog, but a pseudo-attB site is present within a distinct site (GenBank accession no. $YP\_117731$) and also its sequence deviates from the consensus sequences of attB sequence.

Visualization of Malwares for Classification Through Deep Learning (딥러닝 기술을 활용한 멀웨어 분류를 위한 이미지화 기법)

  • Kim, Hyeonggyeom;Han, Seokmin;Lee, Suchul;Lee, Jun-Rak
    • Journal of Internet Computing and Services
    • /
    • v.19 no.5
    • /
    • pp.67-75
    • /
    • 2018
  • According to Symantec's Internet Security Threat Report(2018), Internet security threats such as Cryptojackings, Ransomwares, and Mobile malwares are rapidly increasing and diversifying. It means that detection of malwares requires not only the detection accuracy but also versatility. In the past, malware detection technology focused on qualitative performance due to the problems such as encryption and obfuscation. However, nowadays, considering the diversity of malware, versatility is required in detecting various malwares. Additionally the optimization is required in terms of computing power for detecting malware. In this paper, we present Stream Order(SO)-CNN and Incremental Coordinate(IC)-CNN, which are malware detection schemes using CNN(Convolutional Neural Network) that effectively detect intelligent and diversified malwares. The proposed methods visualize each malware binary file onto a fixed sized image. The visualized malware binaries are learned through GoogLeNet to form a deep learning model. Our model detects and classifies malwares. The proposed method reveals better performance than the conventional method.

An Efficient Sequence Matching Method for XML Query Processing (XML 질의 처리를 위한 효율적인 시퀀스 매칭 기법)

  • Seo, Dong-Min;Song, Seok-Il;Yoo, Jae-Soo
    • Journal of KIISE:Databases
    • /
    • v.35 no.4
    • /
    • pp.356-367
    • /
    • 2008
  • As XML is gaining unqualified success in being adopted as a universal data representation and exchange format, particularly in the World Wide Web, the problem of querying XML documents poses interesting challenges to database researcher. Several structural XML query processing methods, including XISS and XR-tree, for past years, have been proposed for fast query processing. However, structural XML query processing has the problem of requiring expensive Join cost for twig path query Recently, sequence matching based XML query processing methods, including ViST and PRIX, have been proposed to solve the problem of structural XML query processing methods. Through sequence matching based XML query processing methods match structured queries against structured data as a whole without breaking down the queries into sub queries of paths or nodes and relying on join operations to combine their results. However, determining the structural relationship of ViST is incorrect because its numbering scheme is not optimized. And PRIX requires many processing time for matching LPS and NPS about XML data trees and queries. Therefore, in this paper, we propose efficient sequence matching method u sing the bottom-up query processing for efficient XML query processing. Also, to verify the superiority of our index structure, we compare our sequence matching method with ViST and PRIX in terms of query processing with linear path or twig path including wild-card('*' and '//').