• Title/Summary/Keyword: refining time

Search Result 143, Processing Time 0.029 seconds

The conservation for excavated objects on foundation parts of three-story stone pagoda on Kamunsa temple site (감은사지 동삼층석탑 기단부 출토 유물 보존처리)

  • Moon, Whan-Suk;You, In-Sook
    • 보존과학연구
    • /
    • s.19
    • /
    • pp.159-177
    • /
    • 1998
  • Three-story Stone Pagoda(East) on Kamǔnsa temple constructed in A.D. 682 during the reign of King Shinmun-wang of the Unified Shilla period(668~935) was repaired by Cultural Properties Office in 1996. At that time, 27 objectsincluding sari case, small Buddha etc. were excavated. The 26 objects on foundation parts have been treated. Several objects were analyzed by EDXRF. As a result, the small Buddha of gilt bronze was proved to be an gold amalgam. The degree of gold purity was about 22K, and the excellence of gold-refining technique of that day was verified.

  • PDF

Segmenting Layers of Retinal OCT Images using cGAN (cGAN을 이용한 OCT 이미지의 층 분할)

  • Kwon, Oh-Heum;Kwon, Ki-Ryong;Song, Ha-Joo
    • Journal of Korea Multimedia Society
    • /
    • v.23 no.12
    • /
    • pp.1476-1485
    • /
    • 2020
  • Segmenting OCT retinal images into layers is important to diagnose and understand the progression of retinal diseases or identify potential symptoms. The task of manually identifying these layers is a difficult task that requires a lot of time and effort even for medical professionals, and therefore, various studies are being conducted to automate this using deep learning technologies. In this paper, we use cGAN-based neural network to automatically segmenting OCT retinal images into seven terrain-type regions defined by six layer boundaries. The network is composed of a Segnet-based generator model and a discriminator model. We also proposed a dynamic programming algorithm for refining the outputs of the network. We performed experiments using public OCT image data set and compared its performance with the Segnet-only version of the network. The experimental results show that the cGAN-based network outperforms Segnet-only version.

EXAMINING THE BOUNDARIES OF INSTRUMENT-TO-INSTRUMENT CALIBRATION TRANSPORT

  • Kester, Michael D.;Baudais, Fred L.;Simpson, Michael B.
    • Proceedings of the Korean Society of Near Infrared Spectroscopy Conference
    • /
    • 2001.06a
    • /
    • pp.1191-1191
    • /
    • 2001
  • Generation of precise, accurate, and robust calibration models for spectroscopic methods of analysis can be time-consuming, expensive, and sometimes difficult to achieve. For these reasons, efforts have been made to find ways in which the calibration from one instrument can be moved to another with minimal performance reduction. A slight shift in nomenclature from the common term calibration transfer to the term calibration transport is used here to help resolve the subtle difference between two means of moving a calibration from one instrument to another. The former term denotes a transfer procedure that includes mathematical manipulation of the calibration data via some determined transfer function, whereas the latter term does not. Todays generation of process and laboratory FTNIR analyzers is capable of not only achieving calibration transfer, but also calibration transport often without the need of slope or bias adjustments. Several studies are used to examine the boundaries of the extent to which calibration transport is achieved in the refining industry. Data collected on multiple on-line and laboratory FTNIR analyzers located in multiple countries are considered, and the ultimate limitations discussed.

  • PDF

Towards A Dichotomy for the List Switch Homomorphism Problem for Signed Graphs

  • Hyobeen Kim;Mark Siggers
    • Kyungpook Mathematical Journal
    • /
    • v.63 no.3
    • /
    • pp.355-372
    • /
    • 2023
  • We make advances towards a structural characterisation of the signed graphs H for which the list switch H-colouring problem List-S-Hom(H) can be solved in polynomial time. We conjecture two different characterisations, the second refining the first, in the case that the graph H can be switched to a graph in which every negative edge is also positive. Using a recent proof of the first characterisations for reflexive signed graphs, by Bok et. al., we prove the second characterisation for reflexive signed graphs. We also provide several tools for reducing the problem to the bipartite case, and prove a full complexity dichotomy for a related problem.

Improvement of doses rate prediction using the Kalman Filter-based algorithm and effective decay constant correction

  • Cheol-Woo Lee;Hyo Jun Jeong;Sol Jeong;Moon Hee Han
    • Nuclear Engineering and Technology
    • /
    • v.56 no.7
    • /
    • pp.2659-2665
    • /
    • 2024
  • This study proposes an algorithm that combines a Kalman Filter method with effective decay constant correction to improve the accuracy of predicting radiation dose rate distribution during emergencies. The algorithm addresses the limitations of relying solely on measurement data by incorporating calculation data and refining the estimations. The effectiveness of algorithm was assessed using hypothetical test scenarios, which demonstrated a significant improvement in the accuracy of dose rate prediction compared to the model predictions. The estimates generated by the algorithm showed a good agreement with the measured data, and the discrepancies tend to decrease over time. Furthermore, the application of the effective decay constant correction accelerated the reduction of prediction errors. In conclusion, it was confirmed that the combined use of the Kalman filter method and effective decay constant correction is an effective approach to improve the accuracy of dose rate prediction.

단일개체군 생물막 반응기를 이용한 페놀폐수의 효율적 처리

  • Park, Geun-Tae;Lee, Jun-Hun;Lee, Hui-Jeong;Choe, Jeong-Sun;Son, Hong-Ju;Lee, Sang-Jun
    • 한국생물공학회:학술대회논문집
    • /
    • 2000.11a
    • /
    • pp.520-523
    • /
    • 2000
  • Phenol and other phenolic compounds are common constituents of aqueous effluents from processes such as polymeric resin production, oil refining and cokeing plants. Phenol is a both toxic and lethal of fish at relatively low concentrations e.g. 5-25 mg/L and imparts objectionable tastes to drinking water at far lower concentration. Therefore, the treatment of phenol effluent is important. Among the various techniques of phenol wastewater treatment, microbial teratment is a popular process. The breakdown of phenols by microorganisms has recived considerable attention, because of its biochemical interest and its industrial importance in effluent treatment. This research was performed to investigate the dynamics of microbial community, biofilm growth and the comparison of phenol removal efficiency by RBC (Rotating Biological Contactor) using Rhodococcus sp. EL-GT The experiment was carried out at rotating speed of 10ppm and hydraulic retention time of 7 hours. As time passed, phenol removal efficiency was gained highly. The RBC using Rhodococcus sp. EL-GT completely degraded 15 mM.

  • PDF

Mixed-Integer programming model for scheduling of steelmaking processes (철강 공정의 일정계획을 위한 혼합정수계획 모델)

  • Bok, Jin-Gwang;Lee, Dong-Yeop;Park, Seon-Won
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.5 no.6
    • /
    • pp.714-723
    • /
    • 1999
  • This paper presents a short-term scheduling algorithm for the operation of steelmaking processes. The scope of the problem covers refining of the hot iron transferred form a blast furnace, ladle treatment, continuous casting, hot-rolling, and coiling for the final products that should satisfy the given demand. The processing time at each unit depends on how much the batch amount is treated, and te dedicated intermediate storage with finite capacity between the units is considered. Resource constraints and initial amount of each state are incorporated into the presented scheduling model for the algorithm of on-line scheduling. We propose amixed integer linear programming (MILP) model with two objectives for the scheduling. The first is to maximize the total profit while atisfying the due date constraint for each product. And the second is to minimize the total processing time, makespan, while satisfying the demand for each product. Especially, we observe the effect of penalizing the intermediate storage and the inventory level of the final product on the scheduling results.

  • PDF

Change of Particle Size of Magnesium Silicate According to Reaction Conditions and Evaluation of Its Polyol Purification Ability (반응 조건에 따른 규산마그네슘의 입도 변화 및 폴리올 정제 능력평가)

  • Yoo, Jhongryul;Jeong, Hongin;Kang, Donggyun;Park, Sungho
    • Korean Chemical Engineering Research
    • /
    • v.58 no.1
    • /
    • pp.84-91
    • /
    • 2020
  • The efficiency of the synthetic magnesium silicate used in basic polyols and edible oil purification is evaluated by its purification ability and filtration rate and is affected by the particle size and surface area of magnesium silicate. In this study, it was investigated the change on the particle size of magnesium silicate was influenced by the reaction temperature, injection rate, injection order (Si, Mg) and Mg/Si reaction mole ratio. The synthesized magnesium silicate was compared and analyzed for the synthesis, grinding, and refining processes. In the synthesis process, the reaction temperature and feed rate did not affect the average particle size change of magnesium silicate, while the reaction molar ratio of Mg / Si and the order of injection acted as main factors for the change of average particle size. The average particle size of magnesium silicate increased by 8.7 ㎛ from 54.4 ㎛ to 63.1 ㎛ at Mg injection when Mg molar ratio increased from 0.125 to 0.500, and increased by about 4.8 ㎛ from 47.3 ㎛ to 52.1 ㎛ at Si injection. The average particle size according to the order of injection was 59.1 ㎛ for Mg injection and 48.4 ㎛ for Si injection and the difference was shown 10.7 ㎛, therefore the filtration rate was about 2 times faster under the condition of Mg injection. That is, as the particle size increases, the filtration time is shortened and washing filtration rate can be increased to improve the productivity of magnesium silicate. The cake form of separated magnesium silicate after filtration becomes a solid through drying process and is used as powdery adsorbent through the grinding process. As the physical strength of the dried magnesium silicate increased, the average particle size of the powder increased and it was confirmed that this strength was affected by the reaction molar ratio. As the reaction molar ratio of Mg / Si increased, the physical strength of magnesium silicate decreased and the average particle size after grinding decreased by about 40% compared to the average particle size after synthesis. This reduction of strength resulted in an improvement of the refining ability due to the decrease of the average particle size and the increase of the amount of fine particle after the pulverization, but it resulted in the decrease of the purification filtration rate. While the molar ratio of Mg/Si was increased from 0.125 to 0.5 at Mg injection, the refining ability increased about 1.3 times, but the purification filtration rate decreased about 1.5 times. Therefore, in order to improve the productivity of magnesium silicate, the reaction molar ratio of Mg / Si should be increased, but in order to increase the purification filtration rate of the polyol, the reaction molar ratio should be decreased. In the synthesis parameters of magnesium silicate, the order of injection and the reaction molar ratio of Mg / Si are important factors affecting the changes in average particle size after synthesis and the changes of particle size after grinding due to the changes of compressive strength, therefore the synthetic parameter is an important thing that determines productivity and refining capacity.

Verification of Reliability and Validity of KPCS-1 and Estimation of Nursing Time Conversion Index (한국형 환자분류도구-1(KPCS-1)의 신뢰도와 타당도 검증 및 간호시간 환산지수 산출)

  • Song, Kyung Ja;Kim, Eun Hye;Yoo, Cheong Suk;Park, Hyeoun Ae;Song, Mal Soon;Park, Kwang Ok
    • Journal of Korean Clinical Nursing Research
    • /
    • v.16 no.2
    • /
    • pp.127-140
    • /
    • 2010
  • Purpose: This study was performed to verify reliability and validity of Korean Patient Classification System for nurses(KPCS-1), to estimate nursing time conversion index, and to classify patients into groups according to KPCS-1 scores. Methods: KPCS-1 was revised from KPCS by a professional review team. Interrater reliability and construct validity of KPCS-1 were verified by data from 433 patients. Direct and indirect nursing time of 204 patients were measured by stopwatch observation and self reports for 24 hours. Nursing time conversion index was calculated. Results: KPCS-1 consisted of 12 area, 50 nursing activities, and 73 items. The interrater reliability was tested between two nurse group (r=.88, p<.001) and construct validity was verified according to medical department (F=10.97, p<.001) and patient pattern (F=5.54, p=.001). The correlation of nursing time and classification score was also statistically significant (r=.56, p<.001). The nursing time conversion index was 9.03 minutes per 1 classification score. The patients were classified into 4 groups by the classification scores. Conclusion: KPCS-1 can be a useful factor type patient classification system for general ward. Further study is needed to evaluate validity and reliability for refining KPCS-1 and to develop ways connecting the scores with nursing outcomes.

Improving Performance of Change Detection Algorithms through the Efficiency of Matching (대응효율성을 통한 변화 탐지 알고리즘의 성능 개선)

  • Lee, Suk-Kyoon;Kim, Dong-Ah
    • The KIPS Transactions:PartD
    • /
    • v.14D no.2
    • /
    • pp.145-156
    • /
    • 2007
  • Recently, the needs for effective real time change detection algorithms for XML/HTML documents and increased in such fields as the detection of defacement attacks to web documents, the version management, and so on. Especially, those applications of real time change detection for large number of XML/HTML documents require fast heuristic algorithms to be used in real time environment, instead of algorithms which compute minimal cost-edit scripts. Existing heuristic algorithms are fast in execution time, but do not provide satisfactory edit script. In this paper, we present existing algorithms XyDiff and X-tree Diff, analyze their problems and propose algorithm X-tree Diff which improve problems in existing ones. X-tree Diff+ has similar performance in execution time with existing algorithms, but it improves matching ratio between nodes from two documents by refining matching process based on the notion of efficiency of matching.