• 응용통계연구
• /
• 제21권6호
• /
• pp.1007-1014
• /
• 2008

Usability evaluation(UE) experiments are conducted to provide UE practitioners with guidelines for better outcomes. In UE research, significant quantities of empirical results have been accumulated in the past decades. While those results have been anticipated to integrate for producing generalized guidelines, traditional meta-analysis has limitations to combine UE empirical results that often show considerable heterogeneity. In this study, a new data mining method called weighted bi-clustering(WBC) was proposed to partition heterogeneous studies into homogeneous subsets. We applied the WBC to UE empirical results and identified two homogeneous subsets, each of which can be meta-analyzed. In addition, interactions between experimental conditions and UE methods were hypothesized based on the resulting partition and some interactions were confirmed via statistical tests.

• 전기전자학회논문지
• /
• 제5권1호
• /
• pp.1-7
• /
• 2001

본 논문에서 역 방향 링크 채널에 대해 비 선형 등화기를 이용하여 CDMA 셀룰라 시스템을 연구하였다. 일반적으로 무선 통신에서 불확실한 채널 특성 때문에 Observable 들의 확률분포는 유한 세트의 파라미터로 규정될 수 없다. 대신에 training 샘플에 기반을 둔 Quantile과 Vector Quantizer를 사용함으로서 유한 수의 disjoint된 영역으로 m차 샘플 공간으로 분할하였다. 제안된 알고리듬은 RMSA 알고리즘에 의해 예측된 Quantile와 조건부 분할 모멘트에 따른 regression function의 부분적인 근사에 근간을 두고 있다. 본 논문의 등화기와 검출기는 잡음 분포의 Variation에 민감하지 않다는 관점에서 상당히 강한 특성을 보여 준다. 주요 아이디어는 Robust equalizer와 Robust partition detector가 어떤 환경의 무선 채널 하에서도 partition되지 않은 Observation space의 일반적인 등화기 보다 Observation의 등 확률로 분할된 부 공간에서 더 낳은 성능을 보여 준다. 또한 이런 개념을 CDMA 시스템에 적용하여 BER 성능을 분석하였다.

• 인터넷정보학회논문지
• /
• 제5권6호
• /
• pp.1-10
• /
• 2004

A web robot is a software that has abilities of tracking and collecting web documents on the Internet(l), The performance scalability of recent web robots reached the limit CIS the number of web documents on the internet has increased sharply as the rapid growth of the Internet continues, Accordingly, it is strongly demanded to study on the performance scalability in searching and collecting documents on the web. 'Design of web robot based on Multi-Agent to speed up documents collection ' rather than 'Sequentially executing Web Robot based on the existing Fork-Join method' and the results of analysis on its performance scalability is presented in the thesis, For collection speedup, a Multi-Agent based web robot performs the independent process for inactive URL ('Dead-links' URL), which is caused by overloaded web documents, temporary network or web-server disturbance, after dividing them into each agent. The agents consist of four component; Loader, Extractor, Active URL Scanner and inactive URL Scanner. The thesis models a Multi-Agent based web robot based on 'Amdahl's Law' to speed up documents collection, introduces a numerical formula for collection speedup, and verifies its performance improvement by comparing data from the formula with data from experiments based on the formula. Moreover, 'Dynamic URL Partition algorithm' is introduced and realized to minimize the workload of the web server by maximizing a interval of the web server which can be a collection target.

• 한국항해학회지
• /
• 제24권5호
• /
• pp.361-371
• /
• 2000

This paper treats a genetic algorithm for ship scheduling problem in set packing formulation. We newly devised a partition based representation of solution and compose initial population using a domain knowledge of problem which results in saving calculation cost. We established replacement strategy which makes each individual not to degenerate during evolutionary process and applied adaptive mutate operator to improve feasibility of individual. If offspring is feasible then an improve operator is applied to increase objective value without loss of feasibility. A computational experiment was carried out with real data and showed a useful result for a large size real world problem.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2012년도 추계학술대회
• /
• pp.35-36
• /
• 2012

퍼지 모델링을 하기 위해서는 퍼지 규칙의 생성이 필연적이며, 일반적으로 차원이 증가할수록 규칙의 수가 지수적으로 증가하는 문제를 가지고 있다. 이를 해결하기 위해, 시스템 데이터를 이용하여 입력 공간을 분산 형태로 분할하는 FCM 클러스터링 알고리즘을 기반으로 하여 퍼지 규칙을 생성하고 추론하는 시스템을 소개한다. 퍼지 규칙의 전반부 파라미터는 FCM 클러스터링 알고리즘에 의한 소속행렬로 결정되며 퍼지 규칙의 후반부는 다항식 함수의 형태로 표현된다. 제안된 모델은 수치 데이터를 이용하여 평가한다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 추계학술대회 논문집 학회본부 B
• /
• pp.657-659
• /
• 1998

In order to optimize fuzzy modeling of nonlinear system, we proposed a optimal fuzzy model according to the characteristic of I/O relationship, HCM method, the genetic algorithm, and the objective function with weighting factor. A conventional fuzzy model has difficulty in definition of membership function. In order to solve its problem, the premise structure of the proposed fuzzy model is selected by both the partition of input space and the analysis of input-output relationship using the clustering algorithm. The premise parameters of the fuzzy model are optimized respectively by the genetic algorithm and the consequence parameters of the fuzzy model are identified by the standard least square method. Also, the objective function with weighting factor is proposed to achieve a balance between the performance results for the training and testing data.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1997년도 춘계학술대회 학술발표 논문집
• /
• pp.111-114
• /
• 1997

Generally, fuzzy models have the capability of dividing input space into several subspaces. compared to liner ones. But hitherto suggested fuzzy modeling algorithms not take into consideration the correlations between components of sample input data and address them independently of each other, which results in ineffective partition of input space. Therefore, to solve this problem. this letter proposes a new fuzzy modeling algorithm which partitions the input space more efficiently than conventional methods by taking into consideration correlations between components of sample data. As a way to use correlation and divide the input space. the method of principal component is used. Finally, the results of computer simulation are given to demonstrate the validity of this algorithm.

• 한국공간정보시스템학회:학술대회논문집
• /
• 한국공간정보시스템학회 2005년도 추계학술대회
• /
• pp.61-66
• /
• 2005

Spatiotemporal data mining represents the confluence of several fields including spatiotemporal databases, machine loaming, statistics, geographic visualization, and information theory. Exploration of spatial data mining and temporal data mining has received much attention independently in knowledge discovery in databases and data mining research community. In this paper, we introduce an algorithm Max_MOP for discovering moving sequences in mobile environment. Max_MOP mines only maximal frequent moving patterns. We exploit the characteristic of the problem domain, which is the spatiotemporal proximity between activities, to partition the spatiotemporal space. The task of finding moving sequences is to consider all temporally ordered combination of associations, which requires an intensive computation. However, exploiting the spatiotemporal proximity characteristic makes this task more cornputationally feasible. Our proposed technique is applicable to location-based services such as traffic service, tourist service, and location-aware advertising service.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
• /
• pp.275-278
• /
• 2003

Terrestrial DMB(Digital Multimedia Broadcasting) system is the standard that offers multimedia broadcasting services at mobile environment and is based on Eureka-147 DAB(Digital Audio Broadcasting) for transmission method. Also DMB provides the error protection method of convolution coding. In this paper, we study on the effective error resilience coding of MPEG-4 video stream over DMB system. To accomplish error resilience, we first partition one data into several data using the data partitioning, and we control the coding rate of the convolution coding according to the importance of the partitioned data. In this algorithm, we suggest and analyze the efficient rate control algorithm considering convolution code rate.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
• /
• pp.279-282
• /
• 2003

Terrestrial DMB(Digital Multimedia Broadcasting) system is the standard that offers multimedia broadcasting services at mobile environment and is based on Eureka-147 DAB(Digital Audio Broadcasting) for transmission method. Also DMB provides the error protection method of convolution coding. In this paper, we study on the effective error resilience coding of MPEG-4 video stream over DMB system. To accomplish error resilience, we first partition one data into several data using the data partitioning, and we control the coding rate of the convolution coding according to the importance of the partitioned data. In this algorithm, we suggest and analyze the efficient rate control algorithm considering convolution code rate.