• Journal of Korean Society of Forest Science
• /
• v.96 no.1
• /
• pp.7-13
• /
• 2007

This study was done to develop PDA based application system for forest geographic information with GPS. The major results obtained in this study were as follows. A PDA based application program was developed to work on $Microsoft^{TM}$ PocketPC 2002 and 2003 operating system. The screen of PDA displays a 1:25,000 digital topographical map adopted DXF format converted from PC, and the map data with 1:2,500 to 1:30,000 on PDA can be zoomed in or out to five levels. Current position and navigating path received from GPS can be displayed on the screen and be saved in PDA. Information selected among layers of digital topographic map in DXF format can be converted into binary files which can be used on forest geographic information software. This can compress DXF files to 90% in size, and the processing speed of PDA was improved. The forest geographic information management system can be used to manage sample plots on which forest inventory is done, with the help of the sub-menus and grid index values with position information received from GPS. Forest workers can in quire forest geographic information such as forest type, location, forest roads, soil erosion control dams using forest geographic information management system in the field. The forest geographic information management system can provide current position and mobile path information to people who enjoy forest related activities like mountain-climbing, sightseeing, and visiting to historic spots.

• Journal of Korea Society of Industrial Information Systems
• /
• v.22 no.4
• /
• pp.117-129
• /
• 2017

The Purpose of this Study is to Identify the Learning Modules of the National Competency Standard (NCS) Related to the Information Systems Development Curriculum of 4-year Colleges, to Explore the Possibility of Applying NCS to the Curriculum, and to Examine Implications. The Importance of 26 Competency Units in the Applied SW Engineering of NCS was Compared by Area Experts Composed of 14 Information Systems Developers and Professors of 7 Universities who Teach Software Engineering Subjects Through the Hierarchical Analysis Process (AHP). The Results of the Study as Follows. First, the Relative Importance of the Competency Elements was in order of 'Confirming the Requirements', 'Checking the UI Requirements', 'Designing the Physical Data Repository', 'Testing Developer Integration', and 'Fixing Developer Defects'. Second, while the Entry and Intermediate Level Developer Group Determined that the Competency Elements Related to the IS Development Implementation Stage is more Important, the Advanced IS Developer Groups Consider the Competency Elements Related to the Theory-oriented Design Stage as Important Competency. In Addition, the Group of College Professors was Found to Choose all the Practical and Theoretical Competency Elements that Two Developers Groups Considered Important. Implications of the Study Suggested that the Job Performance Competence and Quality of Education Related to IS Development can be Enhanced.

• Journal of Dental Rehabilitation and Applied Science
• /
• v.35 no.4
• /
• pp.220-227
• /
• 2019

Purpose: The purpose of this study was to compare the degree of tooth preparation abilities of students according to three self-assessment methods. Materials and Methods: forty-eight sophomores in Kyungpook National University College of Dentistry were divided into three experimental groups. Students performed tooth preparation of the left mandibular first molar for full gold crown. They performed self-assessment using the three methods (visual, digital, and putty index self-assessment group), and reperformed tooth preparation. An intraoral scanner was used to scan each tooth model (prepared tooth and unprepared tooth), and data were acquired in standard tessellation language (STL) file format. The STL files of prepared tooth and unprepared tooth were superimposed using the 3-dimensional analysis software (Geomagic control X). And the reduction amount was measured. In the statistical analysis, all values of reduction amount were analyzed with the Wilcoxon signed rank test and Kruskal-Wallis test (α = 0.05). Results: The three self-assessment methods showed statistically significant differences (P < 0.001). The putty index self-assessment group showed the highest reduction in error than the digital self-assessment method. Conclusion: Within limitations of this study, students showed significant differences in improvement of tooth preparation ability according to the three self-evaluation methods.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.6
• /
• pp.95-102
• /
• 2012

In this paper, we propose a method that can construct efficiently a P2P overlay multicast network composed of many heterogeneous peers in communication bandwidth, processing power and a storage size by selecting a peer in a distributed fashion using an ant-colony theory that is one of the computational intelligence methods. The proposed method considers not only the capacity of a peer but also the number of children peers supported by the peer and the hop distance between a multicast source and the peer when selecting a parent peer of a newly joining node. Thus, an P2P multicast overlay network is constructed efficiently in that the distances between a multicast source and peers are maintained small. In addition, the proposed method works in a distributed fashion in that peers use their local information to find a parent node. Thus, compared to a centralized method where a centralized server maintains and controls the overlay construction process, the proposed method scales well. Through simulations, we show that, by making a few high capacity peers support a lot of low capacity peers, the proposed method can maintain the size of overlay network small even there are a few thousands of peers in the network.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.755-758
• /
• 2014

In this paper, we propose effective Deblocking Filter hardware architecture for High Efficiency Video Coding encoder. we propose Deblocking Filter hardware architecture with less processing time, filter ordering for low area design, effective memory architecture and four-pipeline for a high performance HEVC(High Efficiency Video Coding) encoder. Proposed filter ordering can be used to reduce delay according to preprocessing. It can be used for realtime single-port SRAM read and write. it can be used in parallel processing by using two filters. Using 10 memory is effective for solving the hazard caused by a single-port SRAM. Also the proposed filter can be used in low-voltage design by using clock gating architecture in 4-pipeline. The proposed Deblocking Filter encoder architecture is designed by Verilog HDL, and implemented by 100k logic gates in TSMC $0.18{\mu}m$ process. At 150MHz, the proposed Deblocking Filter encoder can support 4K Ultra HD video encoding at 30fps, and can be operated at a maximum speed of 200MHz.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.2
• /
• pp.11-21
• /
• 2009

The NTRU cryptosystem proposed by Hoffstein et al. in 1990s is a public key cryptosystem based on hard lattice problems. NTRU has many advantages compared to other public key cryptosystems such as RSA and elliptic curve cryptosystems. For example, it guarantees high speed encryption and decryption with the same level of security, and there is no known quantum computing algorithm for speeding up attacks against NTRD. In this paper, we analyze the security of NTRU against the simple power analysis (SPA) attack and the statistical power analysis (STPA) attack such as the correlation power analysis (CPA) attack First, we implement NTRU operations using NesC on a Telos mote, and we show how to apply CPA to recover a private key from collected power traces. We also suggest countermeasures against these attacks. In order to prevent SPA, we propose to use a nonzero value to initialize the array which will store the result of a convolution operation. On the other hand, in order to prevent STPA, we propose two techniques to randomize power traces related to the same input. The first one is random ordering of the computation sequences in a convolution operation and the other is data randomization in convolution operation.

• The Korean Journal of Nuclear Medicine Technology
• /
• v.14 no.2
• /
• pp.38-40
• /
• 2010

Purpose: This study was performed to find the current problems of PET/CT data from other hospitals. Materials and Methods: The subjects were acquired from 64 hospitals referred to our department for image interpretation. The formats and contents of PET/CT data were reviewed and the phone questionnaire survey about these were performed. Results: PET/CT data from 39 of 64 hospitals (61%) included all transaxial CT and PET images with DICOM (Digital Imaging Communications in Medicine) standard format which were required for authentic interpretation. PET/CT data from the others included only secondary capture images or fusion PET/CT images. Conclusion: The majority of hospitals provided limited PET/CT data which could be inadequate for accurate interpretation and clinical decision making. It is necessary to standardize the format of PET/CT data to transfer including all transaxial CT and PET images with DICOM standard format.

• Food Science and Preservation
• /
• v.22 no.2
• /
• pp.241-250
• /
• 2015

This study investigated the sensory attributes of Satsuma mandarins to provide basic data for the establishment of a quality grade establishment of mandarins. Samples of the mandarins in different sizes (small, medium, and large) were collected via organic green house cultivation, conventional cultivation without pesticides and conventional cultivation in Jeju Island. Eight trained panels performed the triplicate measurements. From the results of the quantitative descriptive analysis, mandarin samples were selected with five types of appearances (gloss intensity, color intensity, peel width, damage degree, and peel texture), three types of odors (sour, sweet, fresh), six types of tastes (sour, sweet, bitter, fresh, tasteless, and off flavor) four types of texture (hardness, granule toughness, juicy, and tough feel), and three types of after-tastes (sour, sweet, and bitter). The results of the analysis of the quality characteristics of the samples showed that their, pH, total acidity and solids contents differed depending on the size of the samples more than their cultivation methods. The correlation coefficients between the quality properties of the mandarins showed that their, sample size was positively correlated with their peel width and toughness. Moreover, the soluble solid of sample was positively correlated with its color intensity, sweet and fresh orange flavor. However, soluble solid content of the samples was negatively coreelated with their bitter flavor, tastelessness, and off flavor. In the principal component analysis of the sensory attributes data, PC1 represented the soluble solid, gross intensity, orange color, sour and sweet odor, unique mandarin flavor (sweet and, fresh orange), etc., and PC2 (26.77%) the size, pH, sample acidity, and peel texture.

• 대한공업교육학회지
• /
• v.32 no.1
• /
• pp.134-152
• /
• 2007

This study deals with the development of computer program which can restrict students to access to the unallowable web sites during the Internet based class. Our suggested program can find the student's access list to the unallowable sites, display it on the teacher's computer screen. Through the limitation of the student's access, teacher can enhance the efficiency of class and fulfill his educational purpose for the class. The use of our results leads to the effective and safe utilization of the Internet as the teaching tools in the class. Meanwhile, the typical method is to turn off the LAN (Local Area Network) power in order to limit the student's access to the unallowable web sites. Our program has been developed on the Linux operating systems in the small network environment. The program includes following five functions: the translation function to change the domain name into the IP(Internet Protocol) address, the search function to find the active students' computers, the packet snoop to capture the ongoing packets and investigate their contents, the comparison function to compare the captured packet contents with the predefined access restriction IP address list, and the restriction function to limit the network access when the destination IP address is equal to the IP address in the access restriction list. Our program can capture all passing packets through the computer laboratory in real time and exactly. In addition, it provides teacher's computer screen with the all relation information of students' access to the unallowable sites. Thus, teacher can limit the student's unallowable access immediately. The proposed program can be applied to the small network of the elementary, junior and senior high school. Our research results make a contribution toward the effective class management and the efficient computer laboratory management. The related researches provides teacher with the packet observation and the access limitation for only one host, but our suggested program provides teacher with those for all active hosts.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.42-55
• /
• 2006

We propose a single Index approach for subsequence matching that supports moving average transform of arbitrary order in time-series databases. Using the single index approach, we can reduce both storage space overhead and index maintenance overhead. Moving average transform is known to reduce the effect of noise and has been used in many areas such as econometrics since it is useful in finding overall trends. However, the previous research results have a problem of occurring index overhead both in storage space and in update maintenance since tile methods build several indexes to support arbitrary orders. In this paper, we first propose the concept of poly-order moving average transform, which uses a set of order values rather than one order value, by extending the original definition of moving average transform. That is, the poly-order transform makes a set of transformed windows from each original window since it transforms each window not for just one order value but for a set of order values. We then present theorems to formally prove the correctness of the poly-order transform based subsequence matching methods. Moreover, we propose two different subsequence matching methods supporting moving average transform of arbitrary order by applying the poly-order transform to the previous subsequence matching methods. Experimental results show that, for all the cases, the proposed methods improve performance significantly over the sequential scan. For real stock data, the proposed methods improve average performance by 22.4${\~}$33.8 times over the sequential scan. And, when comparing with the cases of building each index for all moving average orders, the proposed methods reduce the storage space required for indexes significantly by sacrificing only a little performance degradation(when we use 7 orders, the methods reduce the space by up to 1/7.0 while the performance degradation is only $9\%{\~}42\%$ on the average). In addition to the superiority in performance, index space, and index maintenance, the proposed methods have an advantage of being generalized to many sorts of other transforms including moving average transform. Therefore, we believe that our work can be widely and practically used in many sort of transform based subsequence matching methods.