• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.208-210
• /
• 2001

본 논문은 기존에 운영되고 있는 접근 제한을 고려하지 않고 만들었던 웹사이트를 회전 접근 관리가 가능한 웹사이트로 확장하는 방법을 제안한다. 제시하는 방법은 확장에 필요한 모듈들을 컴포넌트 방식으로 추가하여 기존의 사이트의 수정이 필요 없이 회원관리가 가능하도록 한다. 특히 기존의 ACL(Access Control List)에 없는 새로운 방식인 Resource Grouping 방식을 제시하여 좀더 체계적이고 일괄적인 리소스 관리가 가능하게 한다. 이 Resource Grouping 방식은 Simple Resource Grouping, Resource Grouping With Attributes, Resource Grouping with Parameter로 세부 분류되어 소개된다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2A
• /
• pp.147-154
• /
• 2009

Antenna grouping algorithm is hybrid of beamforming and spatial multiplexing. In antenna grouping system, we partition $N_t$ transmit antennas into $N_r$ groups and use beamforming in a group, spatial multiplexing between groups. We can transmit $N_r$ data streams in the $N_t{\times}N_r$ antenna grouping system. With antenna grouping, we can achieve diversity gain through beamforming, and high spectral efficiency through spatial multiplexing. But if channel is ill-conditioned or there are some correlations between antennas, the performance of antenna grouping is seriously degraded and in that case, beamforming is the best transmit strategy. By selecting the antenna grouping mode when channel is well-conditioned and by selecting the beamforming mode when channel is ill-conditioned, we can prevent serious fluctuation of BER performance caused by varying channel condition and achieve the best BER performance. In this paper, we investigate mode selection algorithm which can select antenna grouping mode or beamforming mode. we also propose a simple mode selection criterion.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.61
• /
• pp.137-146
• /
• 2000

One of the problems faced in implementing cellular manufacturing systems is machine-part group formation. This paper proposes machine-part grouping algorithms based on Self-Organizing Map(SOM) neural networks and K-Means algorithm in cellular manufacturing systems. Although the SOM spreads out input vectors to output vectors in the order of similarity, it does not always find the optimal solution. We rearrange the input vectors using SOM and determine the number of groups. In order to find the number of groups and grouping efficacy, we iterate K-Means algorithm changing k until we cannot obtain better solution. The results of using the proposed approach are compared to the best solutions reported in literature. The computational results show that the proposed approach provides a powerful means of solving the machine-part grouping problem. The proposed algorithm Is applied by simple calculation, so it can be for designer to change production constraints.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.4
• /
• pp.3-9
• /
• 2014

ECMA-392 is the first cognitive radio (CR) specification for personal/portable devices in TV white space. It supports two transmit antennas, for which only open-loop transmit diversity schemes are included. In this paper, we design a simple closed-loop transmit diversity scheme using sub-carrier grouping for ECMA-392 systems. First, sub-carrier grouping types suitable for ECMA-392 systems are described, and then a transmit antenna selection scheme is proposed. In order to reduce feedback information, decision on the transmit antenna selection in the given channel environments is made at the receiver side and the only index of the decided transmit antenna is sent to the transmit side. Through performance comparison to open-loop transmit diversity schemes of ECMA-392, it will be shown that with only a slight feedback overhead, the proposed scheme can improve receiver performance of ECMA-392 systems.

• Journal of Korean Institute of Industrial Engineers
• /
• v.17 no.1
• /
• pp.75-82
• /
• 1991

This research is concerned with Machine-Part Group Formation(MPGF) methodology for Flexible Manufacturing Systems(FMS). The purpose of the research is to develop a new heuristic algorithm for effectively solving MPGF problem. The new algorithm is proposed and evaluated by 100 machine-part incidence matrices generated. The performance measures are (1) grouping ability of mutually exclusive block-diagonal form. (2) number of unit group and exceptional elements, and (3) grouping time. The new heuristic algorithm has the following characteristics to effectively conduct MPGF : (a) The mathematical model is presented for rapid forming the proper number of unit groups and grouping mutually exclusive block-diagonal form, (b) The simple and effective mathematical analysis method of Rank Order Clustering(ROC) algorithm is applied to minimize intra-group journeys in each group and exceptional elements in the whole group. The results are compared with those from Expert System(ES) algorithm and ROC algorithm. The results show that the new algorithm always gives the group of mutually exclusive block-diagonal form and better results(85%) than ES algorithm and ROC algorithm.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.04a
• /
• pp.394-396
• /
• 2007

본 논문은 레이더를 통해 입력받은 데이터를 분석하여 같은 물체에 관한 데이터를 구분하는 방법을 제시한다. 큰 영역을 감시하는 레이더에 비해 영역이 좁을 때 레이더는 한 물체에 대해서 물체 형태에 따라 데이터가 들어오게 된다. 이 데이터들은 같은 물체인지 아닌지 구분이 없어서 응용된 알고리즘을 적용하기 힘들다. 따라서 응용된 알고리즘을 적용하기 전 하나의 물체에 대한 데이터의 그룹핑 작업이 필요하다. 본 논문에서 그룹핑 방법을 제시하며 실제 도로에서 취득한 데이터를 가지고 시뮬레이션을 하였다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.4
• /
• pp.409-415
• /
• 2003

Recently, the modular learning are very popular and receive much attention for pattern classification. The modular learning method based on the "divide and conquer" strategy can not only solve the complex problems, but also reach a better result than a single classifier′s on the learning quality and speed. In the neural network area, some researches that take the modular learning approach also have been made to improve classification performance. In this paper, we propose a simple modular neural network for characters recognition of vehicle number plate and evaluate its performance on the clustering methods of feature vectors used in constructing subnetworks. We implement two clustering method, one is grouping similar feature vectors by K-means clustering algorithm, the other grouping unsimilar feature vectors by our proposed algorithm. The experiment result shows that our algorithm achieves much better performance.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.26 no.11
• /
• pp.1558-1569
• /
• 2002

Two components of brand image are brand association related to brand properties and brand persona which is measured by descriptive words. The purpose of this study is to analyze the brand image of apparel by qualitative approach including natural grouping method suggested by Aaker. For this, face-to-face interviews were carried out in March and April 200l.11 interviewees were respectively asked to classify' pre-selected several tens of apparel brands based on their image differentiation, and then to explain the reason of grouping and to describe resultant brand groups. In this process, many brand image associations and brand persona-descriptive words were collected. 9 types of brand association were identified, and these were summarized as three factors suggested by Keller -attributes, benefits, and attitudes/evaluations. And 3 words which used to refer brand image frequently -dokteukhan (unique), simple, and yeosungseureowoon (feminine)- were interpreted in their meaning. Brand persona-descriptive words implied diverse meaning which were dependent on context.

• Journal of Information Technology and Architecture
• /
• v.10 no.1
• /
• pp.123-135
• /
• 2013

This paper presents a two-dimensional grouping index(2DG-index) for efficient processing of XML filtering queries. Recently, many index techniques have been suggested for the efficient processing of structural relationships among the elements in the XML database such as an ancestor- descendant and a parent-child relationship. However, these index techniques focus on simple path queries, and don't consider the path queries that include a condition value for filtering. The 2DG-index is an index structure that deals with the problem of clustering index entries in the twodimensional domain space that consists of a XML path identifier domain and a filtering data value domain. For performance evaluation, we have compared our proposed 2DG-index with the conventional one dimensional index structure such as the data grouping index (DG-index) and the path grouping index (PG-index). As the result of the performance evaluations, we have verified that our proposed 2DG-index can efficiently support the query processing in XML databases according to the query types.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.145-148
• /
• 2000

This paper presents the performance of a GHICW(Group-wise Hybrid Interference Cancellation scheme based on Wiener filtering) receiver for the multi-rate DS-CDMA system. Our scheme has a small processing delay and a simple hardware complexity compared to ordinary interference cancellation schemes by grouping users with the same date rate. The performance improvement of the low rate user is obtained by using a Wiener filter which precisely estimates the high rate users' bit.