• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.12
• /
• pp.2836-2842
• /
• 2010

An NPC grouping method is proposed for various 3D games depending on their characteristics. Immovable objects tend to have particular orientation features in their Gabor filtering results whereas the movable objects controlled by AI appearing as a human or an animal do not. First of all, We analyzed directional and frequency domain features in the NPC object and configured them as 24 Gabor filter banks. Then, 24-dimensional feature vectors according to the scale and direction of the filter are calculated. Each extracted vector represents the energy of a certain direction. This energy indicates the particular direction strength of the object texture. Thus, using this property, NPCs could be grouped as artificial objects and natural objects effectively and it draws the game more speed and strategic actions as a result.

• Journal of the Korean Chemical Society
• /
• v.47 no.1
• /
• pp.72-78
• /
• 2003

In this study, the effects of grouping by extraversion and introversion in POE learning applied to elementary science class on students' achievement, the perception of learning environment and the attitude toward science instruction were investigated. Ninety-five 5th graders were assigned to the control group and the experimental groups, and taught about acid and base for 9 class hours. In the experimental groups, the homogeneous small group was composed of four introverts or four extroverts, and the heterogeneous small group was composed of two introverts and two extroverts. Two-way ANCOVA results revealed that the homogeneous group performed better than the control group in the application subtest of the achievement test. Significant difference in learning difficulty was found between the heterogeneous group and the control group. In the attitude toward science class, significant interaction effect was found between the instruction and the extraversion/introversion.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.7A
• /
• pp.640-648
• /
• 2011

We propose relay selection schemes using STBC (Space Time Block Coding) technique in OFDM (Orthogonal Frequency Division Multiplexing)-based wireless systems. The proposed schemes select the optimum relay having the maximum instantaneous equivalent channel gain among multiple candidate relays. Also, in order to reduce the system overhead, a symbol grouping method which groups some amount of symbols before selecting the optimum relay is proposed. The simulation results show that the proposed relay selection schemes can obtain more selection diversity gain as the number of selectable relay candidates increases. Furthermore, the proposed scheme with the symbol grouping can reduce system overhead without any degradation of the performance in fading channels with low frequency selectivity.

• The Journal of the Korea Contents Association
• /
• v.9 no.9
• /
• pp.9-17
• /
• 2009

RFID (Radio Frequency Identification) is a next generation technology that will replace barcode. RFID can identify an object by reading ID inside a RFID tag using radio frequency. However, because a RFID tag replies its unique ID to the request of any reader through wireless communication, it is vulnerable to attacks on security or privacy through wiretapping or an illegal reader's request. The RFID authentication protocol has been studied actively in order to solve security and privacy problems, and is used also in tag search. Recently, as the number of tags is increasing in RFTD systems and the cost of data collection is also rising, the importance of effective tag search is increasing. This study proposed an efficient search method that solved through ta9 group the problem of large volume of database computation in Miyako Ohkubo's hash chain mechanism, which meets requirements for security and privacy protection. When we searched first the group of tags with access rate of 5 or higher in a database with 100,000 records, search time decreased by around 30%.

• Korean Journal of Remote Sensing
• /
• v.19 no.2
• /
• pp.159-169
• /
• 2003

This paper presents a method for automatic 3-d building reconstruction using high resolution aerial imagery. First, by using edge preserving filtering, noise is eliminated and then images are segmented by watershed algorithm, which preserves location of edge pixels. To extract line segments between control points from boundary of each region, we calculate curvature of each pixel on the boundary and then find the control points. Line segment linking is performed according to direction and length of line segments and the location of line segments is adjusted using gradient magnitudes of all pixels of the line segment. Coplanar grouping and pplygonal patch formation are performed per region by selecting 3-d line segments that are matched using epipolar geometry and flight information. The algorithm has been applied to high resolution aerial images and the results show accurate 3D building reconstruction.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.9
• /
• pp.237-243
• /
• 2012

In recent system-on-chip (SoC) designs, several hundred embedded memory cores have occupied the largest portion of the chip area. Therefore, the yield of SoCs is strongly dependent on the yield of the embedded memory cores. If all memories had built-in self repair (BISR) with optimal repair rates, the area overhead would be very large. A bit-map sharing method using a memory grouping is proposed to reduce the area overhead. Since the bit-map memory occupies the largest portion of the area of the built-in redundancy analysis (BIRA), the proposed bit-map sharing method can greatly reduce the area overhead of the BIRA. Based on the experimental results, the proposed method can reduce the area overhead by about 80%.

• The KIPS Transactions:PartB
• /
• v.15B no.5
• /
• pp.493-500
• /
• 2008

Although modern day people gather many data from the network, the users want only the information needed. Using this technology, the users can extract on the data that satisfy the query. As the previous studies use the single data in the document, frequency of the data for example, it cannot be considered as the effective data clustering method. What is needed is the effective clustering technology that can process the electronic network documents such as the e-mail or XML that contain the tags of various formats. This paper describes the study of extracting the information from the user query based on the multi-attributes. It proposes a method of extracting the data such as the sender, text type, time limit syntax in the text, and title from the e-mail and using such data for filtering. It also describes the experiment to verify that the multi-attribute based clustering method is more accurate than the existing clustering methods using only the word frequency.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.2
• /
• pp.10-20
• /
• 2012

This study shows how to estimate AADT(Annual Average Daily Traffic) on temporary count data using new grouping method. This study deals with clustering permanent traffic counts using monthly adjustment factor, daily adjustment factor and a percentage of hourly volume. This study uses a percentage of hourly volume comparing with other studies. Cluster analysis is used and 5 groups is suitable. First, make average of monthly adjustment factor, average of daily adjustment factor, a percentage of hourly volume for each group. Next estimate AADT using 24 hour volume(not holiday) and two adjustment factors. Goodness of fit test is used to find what groups are applicable. MAPE(Mean Absolute Percentage Error) is 8.7% in this method. It is under 1.5% comparing with other method(using adjustment factors in same section). This method is better than other studies because it can apply all temporary counts data.

• The KIPS Transactions:PartD
• /
• v.18D no.5
• /
• pp.343-356
• /
• 2011

When preparing test cases and running the test the existing GUI test tools require many tester's interventions. To cope with such problem this paper suggests a new method to build test cases for GUI test. This method identifies the potential control flows within the GUI and constructs the GUI map. The UIA library in .NET Framework is used to extract information about the GUI controls and the GUI map is constructed by the extracted information. Test scenarios are generated from the extracted information about the GUI controls using the grouping mechanism. Based on the grouping mechanism, various test scenarios which are test cases in GUI tests can be made by replacing a GUI control by another one in the same group. The existing GUI test tools do not support the concept of test coverage. Since, however, our method survey which part of the GUI map is executed or not during running the test, the test coverage can be measured by using the GUI map.

• Journal of Internet of Things and Convergence
• /
• v.10 no.2
• /
• pp.109-114
• /
• 2024

Enterprise storage systems that require high data reliability are applying RAID (Redundant Array of Independent Disks) systems to recover from data loss and failure. In particular, RAID 5 ensures space efficiency and reliability by distributing parity across multiple storage devices. However, when storage devices have different capacities, RAID is built based on the smallest capacity storage device, resulting in wasted storage space. Therefore, research is needed to solve this resource management problem. In this paper, we propose a method for RAID grouping of each independent NAND flash memory block in a RAID consisting of SSD (Solid State Disk) with external SSDs as well as internal SSDs. This method is divided into a policy for delivering block information inside SSDs to the RAID system and a policy for RAID grouping of physical addresses delivered from the RAID system. This method allows us to maintain a RAID that does not waste resources when SSDs of different capacities are grouped into RAID5. Finally, we demonstrate the effectiveness of the proposed method through experiments.