• Title/Summary/Keyword: connected graphs

Search Result 134, Processing Time 0.018 seconds

Studies on the anodic oxidation of some volatile organic halogen compounds(THM) (휘발성 할로겐 화합물(THM)의 양극 산화에 관한 연구)

  • Yoo, K.S.;Park, S.Y.;Yang, S.B.;Woo, S.B.
    • Analytical Science and Technology
    • /
    • v.10 no.4
    • /
    • pp.264-273
    • /
    • 1997
  • Anodic oxidation reaction was applied to remove trihalomethanes in an aqueous solution. Each component was determined by using solid phase microextraction(SPME) fiber and GC-ECD. Anodic and cathodic compartments were separated in order to protect contaminants and connected by $KNO_3$-agar bridge. The calibration graphs of the 6 THM components were shown good linearlity from a few ppb up to a few hundreds ppb concentration level. Anodes such as platinum(Pt), titanium(Ti). zircornium(Zr), titanium metal coated with iridium(Ti-Ir), and glassy carbon coated with mixed valence ruthenium(mv Ru) were tried to remove the THMs at different potentials. The best result was obtained on the Ti-Ir anode applied 9 volts DC. The electrode could effectively remove almost all the THM components from the stirring solution within about 1.5 hours. The glassy carbon electrode coated with mixed valence ruthenium showed excellent removing effect at the begining, but the maximum removing level was remained at 60% probably due to the destruction of the electrode surface. The concentration of chloroform, however, tends to be increased due to the electrode reaction producing the component at the condition.

  • PDF

Minimum Cost Range Assignment for the Vertex Connectivity of Graphs (그래프의 정점 연결성에 대한 최소 범위 할당)

  • Kim, Jae-Hoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.11
    • /
    • pp.2103-2108
    • /
    • 2017
  • For n points $p_i$ on the m-dimensional plane $R^m$ and a fixed range r, consider a set $T_i$ containing points the distances from $p_i$ of which are less than or equal to r. In case m=1, $T_i$ is an interval on a line, it is a circle on a plane when m=2. For the vertices corresponding to the sets $T_i$, there is an edge between the vertices if the two sets intersect. Then this graph is called an intersection graph G. For m=1 G is called a proper interval graph and for m=2, it is called an unit disk graph. In this paper, we are concerned in the intersection graph G(r) when r changes. In particular, we consider the problem to find the minimum r such that G(r)is connected. For this problem, we propose an O(n) algorithm for the proper interval graph and an $O(n^2{\log}\;n)$ algorithm for the unit disk graph. For the dynamic environment in which the points on a line are added or deleted, we give an O(log n) algorithm for the problem.

Development of Integration Protocol of Nuclear Medicine Image with A Commercial PACS (핵의학 영상을 상용 PACS에 연동 전송하는 프로토콜 개발)

  • Im, Ki-Chun;Choi, Yong;Park, Jang-Chun;Song, Tae-Yong;Choi, Yeon-Sung;Lee, Kyung-Han;Kim, Sang-Eun;Kim, Byung-Tae
    • Journal of Biomedical Engineering Research
    • /
    • v.23 no.6
    • /
    • pp.431-436
    • /
    • 2002
  • The purpose of this study was to develop an integration protocol of Nuclear Medicine image with a commercial PACS. Two independent local networks. PACS network and Nuclear Medicine network, were connected using a Nuclear Medicine DICOM gateway A DICOM converter Program was developed to convert Interfile 3.3. which is used in nuclear medicine scanners in our hospital. to DICOM 3.0. The Program converts Interfile format images to those of DICOM format and also transfers converted DICOM files to PACS DICOM gateway. PACS DICOM gateway compares and matches the DICOM image information with patient information in Hospital Information System and then saves to PACS database. The transfer protocol was designed to be able to transfer Interfile. screen dumped file. and also scanned file. We successfully transferred Nuclear Medicine images to PACS. Images transferred by Interfile transfer protocol could be further processed using various tools in PACS. The graphs, numerical information and comments could be conveniently transferred by screen dumped file. The image in a hard copy can be transferred after scanning using an ordinary scanner. The developed protocol can easily transfer Nuclear Medicine images to PACS in various forms with low cost.

A Study on Projection Angles for an Optimal Image of PNS Water's View on Children (유.소아 부비강 Water's 영상의 이상적 구현을 위한 촬영기준각도 변화에 관한 연구)

  • Son, Sang-Hyuk;Song, Young-Geun;Kim, Sung-Kyu;Hong, Sang-Woo;Kim, Je-Bong
    • Journal of radiological science and technology
    • /
    • v.30 no.2
    • /
    • pp.105-111
    • /
    • 2007
  • This study is to calculate the proper angle for the optimal image of PNS Water's view on children, comparing and analyzing the PNS Water's projection angles between children and adults at every age. This study randomly selected 50 patients who visited the Medical Center from January to May in 2005, and examined the incidence path of central ray, taking a PNS Water's and skull trans-Lat. view in Water's filming position while attaching a lead ball mark on the Orbit, EAM, and acanthion of the patients's skull. And then, we calculated the incidence angles(Angle A) of the line connected from OML and the petrous ridge to the inferior margin of maxilla on general(random) patients's skull image, following the incidence path of central ray. Finally, we analyzed two pieces of the graphs at ages, developing out the patients' ideal images at PNS Water's filming position taken by a digital camera, and calculating the angle(Angle B) between OML and IP(Image Plate). The angle between OML and IP is about $43^{\circ} in 4-years-old children, which is higher than $37^{\circ}, as age increases the angle decreases, it goes to $37^{\circ} around 30 years of age. That is similar result to maxillary growth period. We can get better quality of Water's image for children when taking the PNS Water's view if we change the projection angles, considering maxillary growth for patients in every age stage.

  • PDF