• Progress in Medical Physics
• /
• v.23 no.4
• /
• pp.309-316
• /
• 2012

Multimodal-imaging technique has been rapidly developed for improvement of diagnosis and evaluation of therapeutic effects. In despite of integrated hardware, registration accuracy was decreased due to a discrepancy between multimodal image and insufficiency of count in accordance with different acquisition method of each modality. The purpose of this study was to improve the PET image by event data resampling through analysis of data format, noise and statistical properties of small animal PET list data. Inveon PET listmode data was acquired as static data for 10 min after 60 min of 37 MBq/0.1 ml $^{18}F$-FDG injection via tail vein. Listmode data format was consist of packet containing 48 bit in which divided 8 bit header and 40 bit payload space. Realigned sinogram was generated from resampled event data of original listmode by using adjustment of LOR location, simple event magnification and nonparametric bootstrap. Sinogram was reconstructed for imaging using OSEM 2D algorithm with 16 subset and 4 iterations. Prompt coincidence was 13,940,707 count measured from PET data header and 13,936,687 count measured from analysis of list-event data. In simple event magnification of PET data, maximum was improved from 1.336 to 1.743, but noise was also increased. Resampling efficiency of PET data was assessed from de-noised and improved image by shift operation of payload value of sequential packet. Bootstrap resampling technique provides the PET image which noise and statistical properties was improved. List-event data resampling method would be aid to improve registration accuracy and early diagnosis efficiency.

• Journal of the Korean School Mathematics Society
• /
• v.18 no.1
• /
• pp.1-14
• /
• 2015

In this paper, in order to improve the teaching contents on even and odd number, composition and decomposition of numbers, and (1 digit)+(1 digit) with carrying, (10 and 1 digit)-(1 digit) with borrowing, the corresponding teaching contents in ${\ll}$Math 1-1${\gg}$, ${\ll}$Math 1-2${\gg}$ are critically reviewed. Implications obtained through this review can be summarized as follows. First, the current incomplete definition of even and odd numbers would need to be reconsidered, and the appropriateness of dealing with even and odd numbers in first grade would need to be reconsidered. Second, it is necessary to deal with composition and decomposition of numbers less than 20. That is, it need to be considered to compose (10 and 1 digit) with 10 and (1 digit) and to decompose (10 and 1 digit) into 10 and (1 digit) on the basis of the 10. And the sequence dealing with composition and decomposition of 10 before dealing with composition and decomposition of (10 and 1 digit) need to be considered. And it need to be considered that composing (10 and 1 digit) with (1 digit) and (1 digit) and decomposing (10 and 1 digit) into (1 digit) and (1 digit) are substantially useless. Third, it is necessary to eliminate the logical leap in the calculation process. That is, it need to be considered to use the composing (10 and 1 digit) with 10 and (1 digit) and decomposing (10 and 1 digit) into 10 and (1 digit) on the basis of the 10 to eliminate the leap which can be seen in the explanation of calculating (1 digit)+(1 digit) with carrying, (10 and 1 digit)-(1 digit) with borrowing. And it need to be considered to deal with the vertical format for calculation of (1 digit)+(1 digit) with carrying and (10 and 1 digit)-(1 digit) with borrowing in ${\ll}$Math 1-2${\gg}$, or it need to be considered not to deal with the vertical format for calculation of (1 digit)+(1 digit) with carrying and (10 and 1 digit)-(1 digit) with borrowing in ${\ll}$Math 1-2 workbook${\gg}$ for the consistency.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.6
• /
• pp.6-15
• /
• 2009

In this paper, a new 4-way search window is designed for the high-performance 2D PE architecture in H.264 Motion Estimation(ME) to improve the memory bandwidth. While existing 2D PE architectures reuse the overlapped data of adjacent search windows scanned in 1 or 3-way, the new window utilizes the overlapped data of adjacent search windows as well as adjacent multiple scanning (window) paths to enhance the reusage of retrieved search window data. In order to scan adjacent windows and multiple paths instead of single raster and zigzag scanning of adjacent windows, bidirectional row and column window scanning results in the 4-way(up. down, left, right) search window. The proposed 4-way search window could improve the reuse of overlapped window data to reduce the redundancy access factor by 3.1, though the 1/3-way search window redundantly requires $7.7{\sim}11$ times of data retrieval. Thus, the new 4-way search window scheme enhances the memory bandwidth by $70{\sim}58%$ compared with 1/3-way search window. The 2D PE architecture in H.264 ME for 4-way search window consists of $16{\times}16$ pe array. computing the absolute difference between current and reference frames, and $5{\times}16$ reusage array, storing the overlapped data of adjacent search windows and multiple scanning paths. The reference data could be loaded upward and downward into the new 2D PE depending on scanning direction, and the reusage array is combined with the pe array rotating left as well as right to utilize the overlapped data of adjacent multiple scan paths. In experiments, the new implementation of 4-way search window on Magnachip 0.18um could deal with the HD($1280{\times}720$) video of 1 reference frame, $48{\times}48$ search area and $16{\times}16$ macroblock by 30fps at 149.25MHz.

• Journal of Radiation Protection and Research
• /
• v.10 no.2
• /
• pp.96-108
• /
• 1985

A study for the assessment of natural environmental radiation exposure at a flat and open field of about $10,000m^2$ in area in CNU Daeduk campus has been carried out by means of gamma-ray scintillation spectrometry and thermoluminescence dosimetry for one year period of time from October 1984. The detectors used were 3'${\phi}{\times}$3' NaI(T1) and two different types of LiF TLD, namely, chip sealed in plastic sheet which tightly pressed on two open holes of a metal plate and Teflon disk. Three 24-hour cycles of in-situ spectrometry, and two 3-month and one 1-month cycles of field TL dosimetry were performed. All the spectra measured were converted into exposure rate by means of G(E) opertaion, and therefrom exposure rate due to terrestrial component of environmental radiation was figured out. Exposure rate determined by the spectrometry was, on average, $(10.54{\pm}2.96){\mu}R/hr$, and the rates of $(12.0{\pm}3.4){\mu}R/hr$ and $(11.0{\pm}3.6){\mu}R/hr$ were obtained from chip and disk TLD, respectively. Fluctuations in diurnal variation of the exposure rate measured by the spectrometry were noticeable sometime even in a single cycle of 24 hours. It is concluded that appropriately combined use of TLD with iu-sitn gamma-ray spectrometry system can give more accurate and precise measure of environmental radiation exposure, and further study for more adequate and sensitive TLD for environmental dosimetry, including improvement and elevation of accuracy in data assessment through inter-laboratory or international intercomparison is necessary.

• Journal of the Korean Institute of Traditional Landscape Architecture
• /
• v.30 no.4
• /
• pp.14-22
• /
• 2012

The position, size and landscape of the former Donam SeoWon as well as the physical organization of the old site, are studied to extract data for the enhancement of the authenticity of Donam SeoWon since its registration as a world heritage site. The results are as follows. The 'Donam(豚巖)' encaved rock, the tombstone of teacher Sagye(沙溪), Kimjipsadang(金集祠堂), the head of the Gwangsan Kim family, the Sagye stream in front of them, and the Gyeryong and Daedun mountains in the distance are united in the former Donam SeoWon as landscape elements that clearly show the characteristics of the former site, which was called 'Donam-Wollim(豚巖園林).' Moreover Yangseongdangsipyoung(養性堂十詠), adds the garden elements of a medical herb field, twins pond, a bamboo forest, a school, and a peach field. On this site, one can also engage in activities that are related to the land and are closely related to Neo-Confucianism such as fish watching, conferencing, visit in seclusion(訪隱), looking for monks, and overseeing farming. The former site facing east is assumed to have Sau(祠宇) - Eungdodang(凝道堂) - Ipdeokmum(入德門) - Sanangru(山仰樓: estimated). Jeonsacheong seems to have been located to the left of the Sau area, Yangseongdang, which contained upper and lower twin lotus ponds, on the right and was surrounded by various plants. As it has been used as a lecture hall for the past 250 years, the former Donam SeoWon, located 1.8km away from the current area, must be preserved, and the landscape should be formed to establish the authenticity of Donam SeoWon.

• Journal of KIISE:Databases
• /
• v.30 no.4
• /
• pp.381-396
• /
• 2003

Subsequence matching is an operation that finds subsequences whose changing patterns are similar to a given query sequence from time-series databases. This paper points out the performance bottleneck in subsequence matching, and then proposes an effective method that improves the performance of entire subsequence matching significantly by resolving the performance bottleneck. First, we analyze the disk access and CPU processing times required during the index searching and post processing steps through preliminary experiments. Based on their results, we show that the post processing step is the main performance bottleneck in subsequence matching, and them claim that its optimization is a crucial issue overlooked in previous approaches. In order to resolve the performance bottleneck, we propose a simple but quite effective method that processes the post processing step in the optimal way. By rearranging the order of candidate subsequences to be compared with a query sequence, our method completely eliminates the redundancy of disk accesses and CPU processing occurred in the post processing step. We formally prove that our method is optimal and also does not incur any false dismissal. We show the effectiveness of our method by extensive experiments. The results show that our method achieves significant speed-up in the post processing step 3.91 to 9.42 times when using a data set of real-world stock sequences and 4.97 to 5.61 times when using data sets of a large volume of synthetic sequences. Also, the results show that our method reduces the weight of the post processing step in entire subsequence matching from about 90% to less than 70%. This implies that our method successfully resolves th performance bottleneck in subsequence matching. As a result, our method provides excellent performance in entire subsequence matching. The experimental results reveal that it is 3.05 to 5.60 times faster when using a data set of real-world stock sequences and 3.68 to 4.21 times faster when using data sets of a large volume of synthetic sequences compared with the previous one.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.2
• /
• pp.81-90
• /
• 2013

During the past decade, many changes and attempts have been tried and are continued developing new technologies in the computing area. The brick wall in computing area, especially power wall, changes computing paradigm from computing hardwares including processor and system architecture to programming environment and application usage. The high performance computing (HPC) area, especially, has been experienced catastrophic changes, and it is now considered as a key to the national competitiveness. In the late 2000's, many leading countries rushed to develop Exascale supercomputing systems, and as a results tens of PetaFLOPS system are prevalent now. In Korea, ICT is well developed and Korea is considered as a one of leading countries in the world, but not for supercomputing area. In this paper, we describe architecture design of MAHA supercomputing system which is aimed to develop 300 TeraFLOPS system for bio-informatics applications like human genome analysis and protein-protein docking. MAHA supercomputing system is consists of four major parts - computing hardware, file system, system software and bio-applications. MAHA supercomputing system is designed to utilize heterogeneous computing accelerators (co-processors like GPGPUs and MICs) to get more performance/$, performance/area, and performance/power. To provide high speed data movement and large capacity, MAHA file system is designed to have asymmetric cluster architecture, and consists of metadata server, data server, and client file system on top of SSD and MAID storage servers. MAHA system softwares are designed to provide user-friendliness and easy-to-use based on integrated system management component - like Bio Workflow management, Integrated Cluster management and Heterogeneous Resource management. MAHA supercomputing system was first installed in Dec., 2011. The theoretical performance of MAHA system was 50 TeraFLOPS and measured performance of 30.3 TeraFLOPS with 32 computing nodes. MAHA system will be upgraded to have 100 TeraFLOPS performance at Jan., 2013.

• Journal of Preventive Medicine and Public Health
• /
• v.22 no.3 s.27
• /
• pp.389-397
• /
• 1989

To identify the problems in child rearing practice of employed mothers in urban poor area, all of 201 women with children under 6 years old living in Yun San 3 Dong, a poor area of Pusan city, were interviewed with a questionnaire by a trained interviewer from 10th April to 10th May 1989. Among 201 women, 51 women were employed and 150 women were unemployed. Of the employed mothers 78.5% got their jobs because of economical need and 31.4% of them worker for 60-69 hours per week. Their average monthly income was 100,000-190,000 Won in 33.4% and 200,000-290,000 Won in 25.4% Breast milk was fed in 66.0% of the children of unemployed mothers while 49.0 of the children of the employed mothers were breast-fed (p<0.05). The most common reason for not breast feeding was shortage of breast milk among unemployed mothers (58.9%) but that of the employed mothers was their job(63.6%). The basic immunization for children was completed in 70.5% of children of employed mothers as compared with 82.0% of the children of the unemployed mothers were completely immunized (p>0.1). Accident experience rate of children among the employed mothers was 23.5 a and that of the children of the unemployed mothers was 17.3% . The most common cause of acident in children of the unemployed mothers was carelessness while they were playing(34.6%) but in children of the employed mothers it was traffic accident(25.0%) and falling(25.0%). Most of the traffic accidents took place while the children's brother or sister of age under 14 years were baby sitting. When the accident took place 73.1% of the unemployed mothers were just at home, but 58.3% of the employed mothers were out of home for work. In case of the employed mothers, 58.7% of their children were looked after by an adult mainly grandparents, 15.7% by the children's brothers and sisters under 14 years old, and 3.9% of the children were left alone. A majority of the unemployed mothers wanted to get a job if someone could take care of their children. To facilitate the women employment and for the safety and health of the children, good nurseries for working mothers need to be established at a cost they can afford.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.102-116
• /
• 2006

Electronic catalogs (or e-catalogs) hold information about the goods and services offered or requested by the participants, and consequently, form the basis of an e-commerce transaction. Catalog management is complicated by a number of factors and product classification is at the core of these issues. Classification hierarchy is used for spend analysis, custom3 regulation, and product identification. Classification is the foundation on which product databases are designed, and plays a central role in almost all aspects of management and use of product information. However, product classification has received little formal treatment in terms of underlying model, operations, and semantics. We believe that the lack of a logical model for classification Introduces a number of problems not only for the classification itself but also for the product database in general. It needs to meet diverse user views to support efficient and convenient use of product information. It needs to be changed and evolved very often without breaking consistency in the cases of introduction of new products, extinction of existing products, class reorganization, and class specialization. It also needs to be merged and mapped with other classification schemes without information loss when B2B transactions occur. For these requirements, a classification scheme should be so dynamic that it takes in them within right time and cost. The existing classification schemes widely used today such as UNSPSC and eClass, however, have a lot of limitations to meet these requirements for dynamic features of classification. In this paper, we try to understand what it means to classify products and present how best to represent classification schemes so as to capture the semantics behind the classifications and facilitate mappings between them. Product information implies a plenty of semantics such as class attributes like material, time, place, etc., and integrity constraints. In this paper, we analyze the dynamic features of product databases and the limitation of existing code based classification schemes. And describe the semantic classification model, which satisfies the requirements for dynamic features oi product databases. It provides a means to explicitly and formally express more semantics for product classes and organizes class relationships into a graph. We believe the model proposed in this paper satisfies the requirements and challenges that have been raised by previous works.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.7
• /
• pp.1218-1226
• /
• 2008

With the development of semiconductor integrated technology and with the increasing use of multimedia functions in computer, more functions have been implemented as hardware. Nowadays, most microprocessors beyond 32 bits generally implement an integer multiplier as hardware. However, as for a divider, only specific microprocessor implements traditional SRT algorithm as hardware due to complexity of implementation and slow speed. This paper suggested an algorithm that uses a multiplier, 'w bit $\times$ w bit = 2w bit', to process $\frac{N}{D}$ integer division. That is, the reciprocal number D is first calculated, and then multiply dividend N to process integer division. In this paper, when the divisor D is '$D=0.d{\times}2^L$, 0.5 < 0.d < 1.0', approximate value of ' $\frac{1}{D}$', '$1.g{\times}2^{-L}$', which satisfies ' $0.d{\times}1.g=1+e$, $e<2^{-w}$', is defined as over reciprocal number and then an algorithm for over reciprocal number is suggested. This algorithm multiplies over reciprocal number '$01.g{\times}2^{-L}$' by dividend N to process $\frac{N}{D}$ integer division. The algorithm suggested in this paper doesn't require additional revision, because it can calculate correct reciprocal number. In addition, this algorithm uses only multiplier, so additional hardware for division is not required to implement microprocessor. Also, it shows faster speed than the conventional SRT algorithm and performs operation by word unit, accordingly it is more suitable to make compiler than the existing division algorithm. In conclusion, results from this study could be used widely for implementation SOC(System on Chip) and etc. which has been restricted to microprocessor and size of the hardware.