• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2011년도 춘계학술발표대회
• /
• pp.990-992
• /
• 2011

In this paper, we introduce a new Tabu method to get K-anonymity character in database information privacy protection. We use the conception of lattice to form the solution space for K-anonymity Character and search the solution area in this solution space to achieve the best or best approach modification solution for the information in the database. We then compared the Tabu method with other traditional heuristic method and our method show a better solution in most of the cases.

• 한국컴퓨터정보학회논문지
• /
• 제8권1호
• /
• pp.20-29
• /
• 2003

웹에서 정보의 양이 급속히 증대됨에 따라 자신에게 맞는 정보를 찾는데 더 많은 시간을 투자하고 있다. 이러한 문제를 해결하기 위해서는 검색에이전트가 사용자의 선호도나 검색 목적에 따라 개인화된 검색기능을 제공하여야한다. 따라서 검색에이전트가 이러한 기능을 제공하기 위해 본 연구에서는 사용자가 과거에 검색과 관련된 경험적 지식을 축적하고 이 지식을 이용하여 새로운 질의어가 주어졌을 때 가장 관련성이 높은 카테고리 그룹을 결정하는 유사도 평가 방법을 통해 각 개인의 검색성향을 통계적으로 고려한 사례기반 추론기법을 제안한다. 사례기반 추론기법과 다른 일반검색 방법이 함께 적용된 검색엔진에서 실시한 성능 평가는 사례기반 추론기법이 일반 검색 방법에 비해 정확률에서 우수한 결과를 보였다.

• 반도체디스플레이기술학회지
• /
• 제7권4호
• /
• pp.57-62
• /
• 2008

Image retrieval is one of the most exciting and rapidly growing research issues in the field of multimedia technology. This paper proposes a new method that performs search the relevant images by using query-by-example. The proposed method for search and retrieval of images utilizes the location information where the image had been taken. The system associates the photo images with their corresponding GPS coordinates that are used as metadata for searching. Experimental results show that the proposed method demonstrates better performance improving up to 59% of average recall and 49% of average precision. Moreover, we learned from the experimental results geo-location information embedded within the image header is more effective and positive on the search and storage.

• EDISON SW 활용 경진대회 논문집
• /
• 제5회(2016년)
• /
• pp.183-189
• /
• 2016

In this paper, an optimization study on a helicopter rotor blade cross-section was made. Generalization was made to the baseline cross-section to simplify the analysis. To have better performance in aeroelastic response, with the aerodynamic center being the origin of the baseline, the distance between aerodynamic center and shear center, and the distance between mass center and shear center of the blade were minimized. For efficient searching of optimum solutions over the design space, grid search method, which is a method of graphical search was used. Two design variables, radius of balancing weight at leading edge, and offset of the spar from leading edge were selected for the study. Cubic spline interpolation method was used to accommodate searching of the optimum solution. 2-Leveled searching system was devised in accordance with the interpolation method. Optimum solution was found to show 6% decrease in both distance between aerodynamic center and shear center, and mass center and shear center to the baseline.

• 한국정보처리학회논문지
• /
• 제6권11S호
• /
• pp.3399-3409
• /
• 1999

Information filtering for internet search, in which new information retrieval environment is given, is different from traditional methods such as bibliography information filtering, news-group and E-mail filtering. Therefore, we cannot expect high performance from the traditional information filtering models when they are applied to the new environment. To solve this problem, we inspect the characteristics of the new filtering environment, and propose a semantic-based filtering model which includes a new filtering method using WordNet. For extracting keywords from documents, this model uses the SDCC(Semantic Distance for Common Category) algorithm instead of the TF/IDF method usually used by traditional methods. The world sense ambiguation problem, which is one of causes dropping efficiency of internet search, is solved by this method. The semantic-based filtering model can filter web pages selectively with considering a user level and we show in this paper that it is more convenient for users to search information in internet by the proposed method than by traditional filtering methods.

• 한국정보통신학회논문지
• /
• 제13권8호
• /
• pp.1527-1533
• /
• 2009

본 논문에서는 MVP 분포의 움직임 방향 치우침 특성을 이용한 방향성 탐색 패턴을 디자인하고, 탐색점의 이동 방향에 따라 탐색 패턴을 적응적으로 변화시키는 방향 적응적 십자형 다이아몬드 탐색 방법을 제안 한다. 제안한 방법은 이웃 매크로 블록으로부터 모션 벡터를 예측하고, 예측한 모션 벡터를 이용하여 초기 움직임 방향을 설정 한다. 탐색 과정에서 BMP의 이동 방향에 따라 제안한 탐색 패턴을 적응적으로 변화시킴으로써 탐색 효율을 향상시킨다. 실험 결과, 제안한 방법 은 움직임 추정에 소요되는 계산량을 기존의 십자형 다이아몬드 탐색에 비해 $0.43%{\sim}1.76%$ 감소시킴으로써 고속 움직임 추정이 가능함을 알 수 있었다.

• 정보통신설비학회논문지
• /
• 제10권4호
• /
• pp.128-134
• /
• 2011

Note that k-anonymity algorithm has been widely discussed in the area of privacy protection. In this paper, a new search algorithm to achieve k-anonymity for database application is introduced. A lattice is introduced to form a solution space for a k-anonymity problem and then a hybrid search method composed of tabu search and genetic algorithm is proposed. In this algorithm, the tabu search plays the role of mutation in the genetic algorithm. The hybrid method with independent tabu search and genetic algorithm is compared, and the hybrid approach performs the best in average case.

• Journal of information and communication convergence engineering
• /
• 제9권1호
• /
• pp.27-31
• /
• 2011

This paper describes the optimization of spectrum sensing in terms of the throughput of a cognitive radio (CR) system. Dealing with the optimization problem of spectrum sensing, this paper evaluates the throughput of a CR system by considering such situations as the penalty time of a channel search and incumbent user (IU) detection delay caused by a missed detection of an incumbent signal. Also, this paper suggests a serial channel search scheme as the search method for a vacant channel, and derives its mean channel search time by considering the penalty time due to the false alarm of a vacant channel search. The numerical results suggest the optimum sensing time of the channel search process using the derived mean channel search time of a serial channel search in the case of a sensing hardware structure with single radio frequency (RF) path. It also demonstrates that the average throughput is improved by two separate RF paths in spite of the hardware complexity of an RF receiver.

• 전자공학회논문지B
• /
• 제31B권8호
• /
• pp.129-136
• /
• 1994

In this paper an adaptive moving method of the search region tracking the motion is proposed. The search region in BMA is determined by the capability of hardware implementation and the degree of motion. But once determined nothing can be changed during coding procedure. In this paper we predict the level of motion of the current block using motion vectors of previous frames without overhead information and change the location of the search region according to the level of the motion predicted. In short the proposed method can be archieved the dsirable effect such that the size of search region gets large when the motion is large. Results of experiments show that prediction efficiency has been improved by using adaptive moving method resulting in reduced prediction error in the blocks with large motion.

• 한국통신학회논문지
• /
• 제15권4호
• /
• pp.267-277
• /
• 1990

이 논문에서는 인공지능의 기본적인 문제풀이 기법인 상태공간 탐색을 이용하여 한글을 구성하는 기본자소를 분리하여 인식하는 방법을 제안하였다. 자소분리와 인식과정을 보다 밀접하게 결합하기 위하여 문제를 상태공간에 표현하고, 이 공간을 탐색하여 풀이하였다. 그리고 탐색효율을 향상시키기 위하여 한글의 조합규칙에 입각한 구조정보와 매트릭스 평면에서 각 자소가 갖는 위치정보를 이용하였으며, 컴퓨터실험을 통하여 그 유용성을 확인하였다.