• Title/Summary/Keyword: 최대 거리

Search Result 1,618, Processing Time 0.022 seconds

Evaluation of the Radiant Heat Effects according to the Change of Wind Velocity in Forest Fire by using WFDS (WFDS를 이용한 풍속에 따른 산림화재 복사열 강도 평가)

  • Song, Dong-Woo;Lee, Su-Kyung
    • Fire Science and Engineering
    • /
    • v.27 no.3
    • /
    • pp.1-7
    • /
    • 2013
  • The wildland fire intensity and scale are getting bigger owing to climate change in the world. In the case of domestic, the forest is distributed over approximately 63.7 % of country and the main facilities like a industrial facility or gas facility abuts onto it. Therefore there is potential that the wildland fire is developed to a large-scale disaster. In this study, the effect distances of the radiant heat flux from the crown fire are analysed according to the change of wind velocity. The safety criteria concerning the radiant heat flux to influence on the surrounding were researched to analyse the effect distances. The criteria of radiant heat flux were chosen $5kW/m^2$, $12.5kW/m^2$, $37.5kW/m^2$. WFDS, which is an extension of NIST's Fire Dynamics Simulator, was used to consequence analysis of the forest fire. In order to apply the analysis conditions, it is researched the forest conditions that is generally distributed in domestic region. As the result, the maximum effect distances by radiant heat were showed at the horizontal and vertical direction. When the wind velocity varied from 0 to 10 m/s, the maximum effect distance increased as the wind velocity increases. Interesting point is that the maximum effect distance were shown at the wind velocity of 8 m/s. The maximum effect distance was decreased according as the fuel moisture of trees increase. This study can contribute to analyse quantitative risk about the damage effect of the surrounding facilities caused by wildland fire.

Defining the Tumour and Gross Tumor Volume using PET/CT : Simulation using Moving Phantom (양전자단층촬영장치에서 호흡의 영향에 따른 종양의 변화 분석)

  • Jin, Gye-Hwan
    • Journal of the Korean Society of Radiology
    • /
    • v.15 no.7
    • /
    • pp.935-942
    • /
    • 2021
  • Involuntary movement of internal organs by respiration is a factor that greatly affects the results of radiotherapy and diagnosis. In this study, a moving phantom was fabricated to simulate the movement of an organ or a tumor according to respiration, and 18F-FDG PET/CT scan images were acquired under various respiratory simulating conditions to analyze the movement range of the tumor movement by respiration, the level of artifacts according to the size of the tumor and the maximum standardized uptake value (SUVmax). Based on Windows CE 6.0 as the operating system, using electric actuator, electric actuator positioning driver, and programmable logic controller (PLC), the position and speed control module was operated normally at a moving distance of 0-5 cm and 10, 15, and 20 reciprocations. For sphere diameters of 10, 13, 17, 22, 28, and 37 mm at a delay time of 100 minutes, 80.4%, 99.5%, 107.9%, 113.1%, 128.0%, and 124.8%, respectively were measured. When the moving distance was the same, the difference according to the respiratory rate was insignificant. When the number of breaths is 20 and the moving distance is 1 cm, 2 cm, 3 cm, and 5 cm, as the moving distance increased at the sphere diameters of 10, 13, 17, 22, 28, and 37 mm, the ability to distinguish images from smaller spheres deteriorated. When the moving distance is 5 cm compared to the still image, the maximum values of the standard intake coefficient were 18.0%, 23.7%, 29.3%, 38.4%, 49.0%, and 67.4% for sphere diameters of 10, 13, 17, 22, 28, and 37 mm, respectively.

Performance Improvement of Bearing Fault Diagnosis Using a Real-Time Training Method (실시간 학습 방법을 이용한 베어링 고장진단 성능 개선)

  • Cho, Yoon-Jeong;Kim, Jae-Young;Kim, Jong-Myon
    • Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
    • /
    • v.7 no.4
    • /
    • pp.551-559
    • /
    • 2017
  • In this paper, a real-time training method to improve the performance of bearing fault diagnosis. The traditional bearing fault diagnosis cannot classify a condition which is not trained by the classifier. The proposed 4-step method trains and recognizes new condition in real-time, thereby it can classify the condition accurately. In the first step, we calculate the maximum distance value for each class by calculating a Euclidean distance between a feature vector of each class and a centroid of the corresponding class in the training information. In the second step, we calculate a Euclidean distance between a feature vector of new acquired data and a centroid of each class, and then compare with the allowed maximum distance of each class. In the third step, if the distance between a feature vector of new acquired data and a centroid of each class is larger than the allowed maximum distance of each class, we define that it is data of new condition and increase count of new condition. In the last step, if the count of new condition is over 10, newly acquired 10 data are assigned as a new class and then conduct re-training the classifier. To verify the performance of the proposed method, bearing fault data from a rotating machine was utilized.

An Synchronization Characteristics Analysis of Public NTP Servers in Internet (인터넷상의 공용 NTP서버가 동기화 특성 분석)

  • 오지석;성순용;김영호
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10a
    • /
    • pp.621-623
    • /
    • 1998
  • 본 논문에서는 공용 접근이 가능한 NTO 서버들에 대한 동기화 특성을 조사, 분석했다. 분석 주요 항목은 서버 신뢰도, 정확도 그리고 오프셋(offeset)과 전송지연의 관계이다. 이러한 분석을 위해 NTP알고리즘에서 최적 시간 동기를 위해 선택하는 값인 클럭 옻프셋, 일주지연, 분산 그리고 동기화 거리를 사용하였다. 분석 결과는동기화 거리 값의 경우 최대 700ms의 정도의 차이를 보이고, 분산의 경우 최대 300ms정도의 차이를 나타내었다. 또한 전송 지연과 오프셋은 타워 분포를 보이며, 이는 그간의 오프셋 근거의 단순 선택이 효율적이지 못할 수 있음을 보여주었다. 본 논문에서 살펴본 NTP서버 동기화 특성은 많은 NTP 서버중 최적의 조건을 찾는데 유용하게 쓰일 수 있다.

  • PDF

A Study on the Frictio Characteristics of Pitch/CVI and Phenolic Resin/CVI Hybrid Matrix Derived Carbon/Carbon Composites (핏치/CVI계 및 페놀/CVI계를 Matrix로 하는 탄소/탄소 복합재료의 마찰특성 연구)

  • Park, Jong-Gyu;Lee, Jin-Yong
    • Korean Journal of Materials Research
    • /
    • v.6 no.10
    • /
    • pp.986-990
    • /
    • 1996
  • 본 논문에서는 정속마찰 시험기를 사용하여 공기중에서 핏치/CVI계와 페놀/CVI계 낱소/탄소 복합재료의 마찰특성을 평가하고 상호 비교하였다. 운용조건(마찰거리, 마찰속도, 마찰압력)에 관계없이 페놀/CVI계의 평균 마찰계수가 핏치/CVI계 보다 높은 값을 나타내었다. 마찰거리가 4Km이하 일때는 평균 마찰계수가 불안정한 경향을 나타내고 그 이후에서는 안정한 평균 마찰계수 값을 갖는다. 또한 마찰속도와 마찰압력이 증가할수록 평균 마찰계수는 감소하는 경향을 나타내며, 페놀/CVI계의 평균 마찰계수가 핏치/CVI계 보다 높고 마찰면 온도 상승률과 최대 마찰면 온도도 높다. 마찰계수는 마찰면 온도의 영향을 받으며, 마찰속도와 3kg/$\textrm{cm}^2$이하에서 마찰압력이 커질수록 최대 마찰계수를 갖는 마찰면 온도는 높아진다.

  • PDF

Reliability and maximum transmission length analysis between adjacent optical solitons in nonlinear dispersive transmission materials (비선형 분산 광 전송 매질에 있어서 인접 광 솔리톤간의 신뢰도 및 최대 전송거리 분석)

  • 변승우;김종규;송재원
    • Electrical & Electronic Materials
    • /
    • v.9 no.3
    • /
    • pp.246-250
    • /
    • 1996
  • In optical soliton transmission systems with nonlinear dispersive materials, which is utilized for ultra-long and high bit rate transmission, it is shown that the value of initial time difference between adjacent solitons is analyzed for optimum bit rate. The method is inducted by uncorrelation condition with minimum interaction forces in initial covariance coefficient between adjacent solitons. When the initial time difference is 6 times of soliton pulse width by the results, it is shown that the reliability is maintained with more than 90% within transmission length of soliton period. multiplied by 93.

  • PDF

Refining Initial Seeds using Max Average Distance for K-Means Clustering (K-Means 클러스터링 성능 향상을 위한 최대평균거리 기반 초기값 설정)

  • Lee, Shin-Won;Lee, Won-Hee
    • Journal of Internet Computing and Services
    • /
    • v.12 no.2
    • /
    • pp.103-111
    • /
    • 2011
  • Clustering methods is divided into hierarchical clustering, partitioning clustering, and more. If the amount of documents is huge, it takes too much time to cluster them in hierarchical clustering. In this paper we deal with K-Means algorithm that is one of partitioning clustering and is adequate to cluster so many documents rapidly and easily. We propose the new method of selecting initial seeds in K-Means algorithm. In this method, the initial seeds have been selected that are positioned as far away from each other as possible.

Pattern Classification System for Remote Sensing Data using Voronoi Diagram (보로노이 공간분류를 활용한 원격 영상 패턴분류 시스템)

  • Baek, Ju-Hyeon;Kim, Hong-Gi
    • The KIPS Transactions:PartB
    • /
    • v.8B no.4
    • /
    • pp.335-342
    • /
    • 2001
  • 본 논문은 보로노이 공간분류를 활용하여 원격탐사 영상인식을 위한 다층 신경망 분류기를제안한다. 제안된 다층 신경망 분류기는 보로노이 다각형 영역으로 클래스를 구분하며, 초평면 방정식의 계수를 오류 역전과 학습 초기의 연결 강도, 임계치 그리고 은닉층의 노드 수로 결정한다. 제안된 방법은 오류역전과 학습 알고리즘에서 임의로 정해주던 초기 정보를 사전 분석에 의해 공학적으로 결정함으로써 느린 수렴 속도와 학습실패 등의 단점을 피할 수 있는 장점이 있다. 보로노이 다이어그램에 대한 경계선의 초평면 방정식은 훈련집합의 클래스별 평균값을 구하여 Mathematica 패키지로 계산하였다. 제안된 다층 신경망에 의한 영상분류기의 인식능력을 평가하기 위하여 원격탐사 영상인식에서 자주 활용되는 최소거리 분류 방법과 최대우도 분류 방법으로 처리해서 비교한 결과, 최소거리 분류 방법은 실험화상에 대해 81.4%, 최대우도 부류기에 의한 분류는 87.8%, 제안한 방법은 92.2% 정확성을 가진 분류결과를 나타냈다.

  • PDF

Algorithm for Finding K-Nearest Object Pairs in Circular Search Spaces (순환검색공간에서 K-최근접객체 쌍을 찾는 알고리즘에 관한 연구)

  • Seon, Hwi-Joon;Kim, Hong-Ki
    • Spatial Information Research
    • /
    • v.20 no.2
    • /
    • pp.165-172
    • /
    • 2012
  • The query of the K closest object pairs between two object sets frequently occurs at recently retrieval systems. The circular location property of objects should be considered for efficiently process queries finding such a K nearest object pair. In this paper, we propose the optimal algorithm finding the K object pairs which are closest to each other in a search space with a circular domain and show its performance by experiments. The proposed algorithm optimizes the cost of finding the K nearest object pairs by using the circular search distances which is much applied the circular location property.

Design of a hospital assignment scheme for ambulances based on minimum cost maximum flow algorithm (최소비용 최대유량 알고리즘에 기반한 구급차의 환자이송 병원 배정 기법의 설계)

  • Junghoon Lee
    • Smart Media Journal
    • /
    • v.12 no.9
    • /
    • pp.72-80
    • /
    • 2023
  • This paper presents a design and analyzes the performance of a hospital assignment and reassignment scheme for emergency rescue services based on minimum cost maximum flow algorithm. It consists of flow graph building, link capacity updating, and allocation discovering steps. The efficiency of the algorithm makes it possible to reallocate hospitals even in case of dynamic changes in the number of patients or hospitals. The performance measurement result obtained from a prototype implementation shows that the proposed scheme can reduce the transport time requirement miss by up to 24%.