• Archives of design research
• /
• v.14 no.2
• /
• pp.209-216
• /
• 2001

With rapid growth of internet uses and the new media, web has become a new medium of communicating and sharing of information. Therefore, the methodology of web interface design must be set to improve the efficiency of communicating and sharing information The study has researched on analyzing method of web interface design for effective uses of web. The study is a precedent research of methodology of web interface design based on the following structures-grouping web contents, information architecture, web page design, structural elements of interface design. Accordingly, the study provides the analyzing method of web interface design with the basis of its structural elements. The analyzing method of web interface design is divided into three steps-grouping of web sites, analyzing structural elements, and evaluation. As a result, grouping and embodying of interface design brings usability guideline for design development as well as collecting of data for examining further results through design processes.

• Journal of Environmental Science International
• /
• v.26 no.2
• /
• pp.133-146
• /
• 2017

This study aimed to develop strategies to re-establish the Park Nature Conservation Area in Bukhansan National Park, reflecting landscape ecological value by using the zonation program Marxan with Zones. Planning unit was set by watershed, and the basic data were mapped, considering topographical and ecological values. Mapped indicators were analyzed with the application framework of Marxan with Zones by indexing some indicators. The zones divided into Park Nature Conservation Area (Zone A), Park Nature Environment Area I(Zone B) which is reflected on the concept of Potential Park Nature Conservation Area and Park Nature Environment Area II(Zone C). The best solution for each of the scenarios was fixed through the sensitiveness analysis. From these, the final solution was selected considering five criteria including area ratio of conservation area and grouping. Lastly, the final solution was verified in the overlapped analysis with recent zonation. According to the results, the number of watersheds was 77, with an average area of $1,007,481m^2$. In terms of basic mapping and indexation, the slope index and number of landscape resources for topographical property were average 0.22 and 38 places, respectively. Biotope index was average 0.69 and legally protected species was 14 species, reflecting ecological values. As the social and economic indicators, trail index was average 0.04, and the number of tour and management facilities was 43 places. Through the framework of Marxan with Zones, the best solution for scenario 1 which was set by the highest conservation criteria was selected as the final solution, and the area ratio of Park Nature Conservation Area and grouping was excellent. As the result of overlapped analysis, suggested zonation of the Park Nature Conservation was better than the recent zonation in the area raito (28.3%), biotope grade I(15.4%) and the distribution points (10 places) of legally protected species with verification of proper distribution of conservation features according to the zone.

• Convergence Security Journal
• /
• v.10 no.3
• /
• pp.51-60
• /
• 2010

The expansion of internet technology has made convenience. On the one hand various malicious code is produced. The number of malicious codes occurrence has dramadically increasing, and new or variant malicious code circulation very serious, So it is time to require analysis about malicious code. About malicious code require set criteria for judgment, malicious code taxonomy using Algorithm of weakness difficult to new or variant malicious code taxonomy but already discovered malicious code taxonomy is effective. Therefore this paper of object is various malicious code analysis besides new or variant malicious code type or form deduction using visualization of strong. Thus this paper proposes a malicious code analysis and grouping method using visualization.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.13 no.4
• /
• pp.13-23
• /
• 2017

In order to protect personal information and important information (confidential information, sales information, user information, etc.) in the internal network, companies and organizations apply encryption to the Server-To-Server or Server-To-Client communication section, And are experiencing difficulties due to the increasing number of known attacks and intelligent security attacks. In order to apply the existing S / W encryption technology, it is necessary to modify the application. In the financial sector, "Comprehensive Measures to Prevent the Recurrence of Personal Information Leakage in the Domestic Financial Sector" has been issued, and standard guidelines for financial computing security have been laid out, and it is required to expand the whole area of encryption to the internal network. In addition, even in environments such as U-Health and Smart Grid, which are based on the Internet of Things (IoT) environment, which is increasingly used, security requirements for each collection gateway and secure transmission of the transmitted and received data The requirements of the secure channel for the use of the standard are specified in the standard. Therefore, in this paper, we propose a secure encryption algorithm through mutual authentication and grouping for each node through H / W based Network Control Server (NCS) applicable to internal system and IoT environment provided by enterprises and organizations. We propose a protocol design that can set the channel.

• The Plant Pathology Journal
• /
• v.23 no.2
• /
• pp.45-50
• /
• 2007

Genetic diversity among selected isolates of Macrophomina phaseolina, a causal agent of charcoal rot (stalk rot) disease in sorghum was studied using PCR-RAPD markers. A set of ten isolates, from ten different rabi sorghum genotypes representing two traditional sorghum growing situations viz., Dharwad- a transitional high rainfall region and Bijapur- a semi-arid low rainfall region in South India. From a set of 40 random primers tested, amplicon profiles of 15 were reproducible. A total of 149 amplicon levels, with an average of 9.9 bands per primer, were available for analysis, of which 148 were polymorphic (99.3%). It was possible to discriminate all the isolates with any of the 15 primers employed. UPGMA clustering of data indicated that the isolates shared varied levels of genetic similarity within a range of 0.14 to 0.72 similarity coefficient index and it was suggestive that grouping of isolates was not related to sampling location in anyway. A high level of genetic heterogeneity of 0.28 was recorded among the isolates.

• Journal of Industrial Technology
• /
• v.31 no.B
• /
• pp.37-43
• /
• 2011

In pattern analysis, dimensionality reduction and reasonable identification rule generation are very important parts. This paper performed effectively the dimensionality reduction by grouping the sensors of which the measured patterns are similar each other, where genetic algorithms were used for combination optimization. To identify the gas type, this paper constructed the hierarchically identifiable rule base with two frames by using rough set theory. The first frame is to accept measurement characteristics of each sensor and the other one is to reflect the identification patterns of each group. Thus, the proposed methods was able to accomplish effectively dimensionality reduction as well as accurate gas identification. In simulation, this paper demonstrated the effectiveness of the proposed methods by identifying five types of gases.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.5
• /
• pp.757-772
• /
• 1993

This paper describes the knowledge extraction for image understanding in knowledge based system. The current set of low level processes operate on the numerical pixel arrays, to segment the image into region and to convert the image into directional image, and to calculate feature for these regions. The current set of intermedate level processes operate on the results of earlier knowledge source to build more complex representations of the data. We have grouped into thee categories : feature based classification, geometric token relation, perceptual organization and grouping.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.14 no.3
• /
• pp.77-85
• /
• 2018

Multi-User Multiple-Input Multiple-Output (MU-MIMO) is the core technology for improving the channel capacity compared to Single-User MIMO (SU-MIMO) by using multiuser gain and spatial diversity. Key problem for the MU-MIMO is the user selection which is the grouping the users optimally. To solve this problem, we adopt Extreme Value Theory (EVT) at the beginning of the proposed algorithm, which defines a primary user set instead of a single user that has maximum channel power according to a predetermined threshold. Each user in the primary set is then paired with all of the users in the system to define user groups. By comparing these user groups, the group that produces a maximum sum rate can be determined. Through computer simulations, we have found that the proposed method outperforms the conventional technique yielding a sum rate that is 0.81 bps/Hz higher when the transmit signal to noise ratio (SNR) is 30 dB and the total number of users is 100.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.11
• /
• pp.507-520
• /
• 2017

The set-based similar sequence matching method measures similarity not for an individual data item but for a set grouping multiple data items. In the method, the similarity of two sets is represented as the size of intersection between them. However, there is a critical performances issue for the method in twofold: 1) calculating intersection size is a time consuming process, and 2) the number of set pairs that should be calculated the intersection size is quite large. In this paper, we propose an index-based search method for improving performance of set-based similar sequence matching in order to solve these performance issues. Our method consists of two parts. In the first part, we convert the set similarity problem into the intersection size comparison problem, and then, provide an index structure that accelerates the intersection size calculation. Second, we propose an efficient set-based similar sequence matching method which exploits the proposed index structure. Through experiments, we show that the proposed method reduces the execution time by 30 to 50 times then the existing methods. We also show that the proposed method has scalability since the performance gap becomes larger as the number of data sequences increases.

• Korean Journal of Remote Sensing
• /
• v.22 no.4
• /
• pp.265-274
• /
• 2006

Extracting ground points is the kernel of DTM generation being considered as one of the most popular LIDAR applications. The previous extraction approaches can be mostly characterized as a point based approach, which sequentially examines every individual point to determine whether it is measured from ground surfaces. The number of examinations to be performed is then equivalent to the number of points. Particularly in a large set, the heavy computational requirement associated with the examinations is obviously an obstacle to employing more sophisticated criteria for the examination. To reduce the number of entities to be examined and produce more robust results, we developed an approach based on features rather than points, where a feature indicates an entity constructed by grouping some points. In the proposed approach, we first generate a set of features by organizing points into surface patches and grouping the patches into surface clusters. Among these features, we then attempt to identify the ground features with the criteria based on the attributes of the features. The points grouped into these identified features are labeled ground points, being used for DTM generation afterward. The Proposed approach was applied to many real airborne LIDAR data sets. The analysis on the results strongly supports the prominent performance of the proposed approach in terms of not only the computational requirement but also the quality of the DTM.