• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.11
• /
• pp.7718-7728
• /
• 2015

Semantic similarity between words can be applied in many fields including computational linguistics, artificial intelligence, and information retrieval. In this paper, we present weighted method for measuring a semantic similarity between words in a document. This method uses edge distance and depth of WordNet. The method calculates a semantic similarity between words on the basis of document information. Document information uses word term frequencies(TF) and word concept frequencies(CF). Each word weight value is calculated by TF and CF in the document. The method includes the edge distance between words, the depth of subsumer, and the word weight in the document. We compared out scheme with the other method by experiments. As the result, the proposed method outperforms other similarity measures. In the document, the word weight value is calculated by the proposed method. Other methods which based simple shortest distance or depth had difficult to represent the information or merge informations. This paper considered shortest distance, depth and information of words in the document, and also improved the performance.

• Journal of KIISE:Software and Applications
• /
• v.31 no.5
• /
• pp.563-569
• /
• 2004

A set of Zernike moments has been successfully used for object recognition or content-based image retrieval systems. Real time applications using Zernike moments, however, have been limited due to its complicated definition. Conventional methods to compute Zernike moments fast have focused mainly on the radial components of the moments. In this paper, utilizing symmetric/anti-symmetric properties of Zernike basis functions, we propose a fast and efficient method for Zernike moments. By reducing the number of operations to one quarter of the conventional methods in the proposed method, the computation time to generate Zernike basis functions was reduced to about 20% compared with conventional methods. In addition, the amount of memory required for efficient computation of the moments is also reduced to a quarter. We also showed that the algorithm can be extended to compute the similar classes of rotational moments, such as pseudo-Zernike moments, and ART descriptors in same manner.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.75-77
• /
• 2021

A variety of search engines are currently in use. The search engine supports the retrieval of data required by users through three stages: crawling, index generation, and output of search results based on meta-tag information. However, a large number of documents obtained by searching for keywords are often unrelated or scarce. Because of these problems, it takes time and effort to grasp the content from the search results and classify the accuracy. The index of search engines is updated periodically, but the criteria for weighted values and update periods are different from one search engine to another. Therefore, this paper uses the LSTM model, which extracts the relationship between keywords entered by the user and documents instead of the existing search engine, and improves the relationship between keywords and documents by entering keywords that the user wants to find.

• Journal of Korea Multimedia Society
• /
• v.14 no.1
• /
• pp.54-75
• /
• 2011

PoC(Push-to-talk Over Cellular) is an integrated technology of group voice calls, video calls and internet based multimedia services. If a PoC user can not participate in the PoC session for various reasons such as an emergency situation, lack of battery capacity, then the user can use the PoC Box which has a similar functionality to the MM Box in the MMS(Multimedia Messaging Service). The RTSP(Real-Time Streaming Protocol) method is recommended to be used when there is a transmission session between the PoC box and a terminal. Since the existing VOD service uses a wired network, the packet size of RTSP-based VOD service is huge, however, the PoC service has wireless communication environments which have general characteristics to be used in RTSP method. Packet loss in a wired communication environments is relatively less than that in wireless communication environment, therefore, a buffering latency occurs in PoC service due to a play-out delay which means an asynchronous play of audio & video contents. Those problems make a user to be difficult to find the information they want when the media contents are played-out. In this paper, the following techniques and methods were proposed and their performance and superiority were verified through testing: cross-over dual reception buffering technique, advance partition multi-reception buffering technique, and on-demand multi-reception buffering technique, which are designed for effective picking up of information in media content being transmitted in short amount of time using RTSP when a user searches for media, as well as for reduction in playback delay; and same-priority packetization transmission method and priority-based packetization transmission method, which are media data packetization methods for transmission. From the simulation of functional evaluation, we could find that the proposed multiple receiving buffering and packetizing methods are superior, with respect to the media retrieval inclination, to the existing single receiving buffering method by 6-9 points from the viewpoint of effectiveness and excellence. Among them, especially, on-demand multiple receiving buffering technology with same-priority packetization transmission method is able to manage the media search inclination promptly to the requests of users by showing superiority of 3-24 points above compared to other combination methods. In addition, users could find the information they want much quickly since large amount of informations are received in a focused media retrieval period within a short time.

• The KIPS Transactions:PartD
• /
• v.10D no.1
• /
• pp.1-12
• /
• 2003

Recently, there have been many indexing schemes for multimedia data such as image, video data. But recent database applications, for example data mining and multimedia database, are required to support multi-user environment. In order for indexing schemes to be useful in multi-user environment, a concurrency control algorithm is required to handle it. So we propose a concurrency control algorithm that can be applied to CBF (cell-based filtering method), which uses the signature of the cell for alleviating the dimensional curse problem. In addition, we extend the SHORE storage system of Wisconsin university in order to handle high-dimensional data. This extended SHORE storage system provides conventional storage manager functions, guarantees the integrity of high-dimensional data and is flexible to the large scale of feature vectors for preventing the usage of large main memory. Finally, we implement the web-based image retrieval system by using the extended SHORE storage system. The key feature of this system is platform-independent access to the high-dimensional data as well as functionality of efficient content-based queries. Lastly. We evaluate an average response time of point query, range query and k-nearest query in terms of the number of threads.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.3
• /
• pp.189-199
• /
• 2009

The amount of information on the Web is explosively growing as the Internet gains in popularity. However, only a small portion of the information on the Web is truly relevant or useful to the user. Thus, offering suitable information according to user demand is an important subject in information retrieval. In e-commerce, the recommender system is essential to revitalize commercial transactions, raise user satisfaction and loyalty towards the information provider. The existing recommender systems are mostly based on user data collected at servers, so user data are dispersed over several servers. Therefore, web servers that lack sufficient user behavior data cannot easily infer user preferences. Also, if the user visits the server infrequently, it may be hard to reflect the dynamically changing user's interest. This paper proposes a novel personalization system analyzing the user preference based on web documents that are accessed by the user on a user device. The system also identifies non-content blocks appearing repeatedly in the dynamically generated web documents, and adds weight to the keywords extracted from the hyperlink sentence selected by the user. Therefore, the system establishes at an early stage recommendation strategies for the web server that has little user data. Also, user profiles are generated rapidly and more accurately by identifying the information blocks. In order to evaluate the proposed system, this study collected web data and purchase history from users who have current purchase activity. Then, we computed the similarity between purchase data and the user profile. We confirm the accuracy of the generated user profile since the web page containing the purchased item has higher correlation than other item pages.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.453-463
• /
• 2002

With the prevalence of multi-dimensional data such as images, content-based retrieval of data is becoming increasingly important. To handle multi-dimensional data, multi-dimensional index structures such as the R-tree, Rr-tree, TV-tree, and MVP-tree have been proposed. Numerous research results on how to effectively manipulate these structures have been presented during the last decade. Query processing strategies, which is important for reducing the processing time, is one such area of research. In this paper, we propose query processing algorithms for R-tree based structures. The novel aspect of these algorithms is that they make use of the notion of VP filtering, a concept borrowed from the MVP-tree. The filtering notion allows for delaying of computational overhead until absolutely necessary. By so doing, we attain considerable performance benefits while paying insignificant overhead during the construction of the index structure. We implemented our algorithms and carried out experiments to demonstrate the capability and usefulness of our method. Both for range query and incremental query, for all dimensional index trees, the response time using VP filtering was always shorter than without VP filtering. We quantitatively showed that VP filtering is closely related with the response time of the query.

• Journal of Information Management
• /
• v.41 no.4
• /
• pp.227-249
• /
• 2010

Scholarly information has increased tremendously according to the development of IT, especially the Internet. However, simultaneously, people have to spend more time and exert more effort because of information overload. There have been many research efforts in the field of expert systems, data mining, and information retrieval, concerning a system that recommends user-expected information items through presumption. Recently, the hybrid system combining a content-based recommendation system and collaborative filtering or combining recommendation systems in other domains has been developed. In this paper we resolved the problem of the current recommendation system and suggested a new system combining collaborative filtering and Naive Bayes Classification. In this way, we resolved the over-specialization problem through collaborative filtering and lack of assessment information or recommendation of new contents through Naive Bayes Classification. For verification, we applied the new model in NDSL's paper service of KISTI, especially papers from journals about Sitology and Electronics, and witnessed high satisfaction from 4 experimental participants.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2005.05b
• /
• pp.1317-1322
• /
• 2005

하수관거 설계시나 단지개발사업, 그리고 하수관거정비사업과 같이 오수처리시설의 적정 규모 결정을 위해서는 정확한 상수사용량 및 오수발생량 원단위가 요구되지만 국내의 경우 이러한 원단위에 대한 기초자료 부족과 자료의 신빙성 결여로 인해 적정 원단위를 결정하는데 어려움이 있다. 이러한 관점에서 단지개발이 이루어지는 도시에서는 도시의 규모, 입지조건, 기후조건, 생활양식 등 다양한 요인들이 고려된 오수발생패턴 및 발생량 조사가 필요하며, 조사된 원단위는 오수처리시설의 적정 규모 결정뿐 아니라 침입수/유입수 분석 및 하수관거정비에 대한 성과예측에도 활용될 수 있다. 본 연구에서는 현재 단지개발 및 하수관거정비사업이 진행중인 하남시의 표본이 될 수 있는 대표구역을 선정하고 그 지역에서 조사지역을 세부적으로 분류하여 각 지역별 오수발생특성을 분석하였다. 대상지역인 하남시는 총면적의 $97\%$가 자연녹지 및 생산녹지이며, 나머지 $3\%$는 일반주거지역 및 일반 상업지역으로 나뉜다. 그리고 도시계획상 공장지역으로 편성된 부분이 없어 앞으로도 하남시 대부분의 면적이 녹지와 주거/상업지역으로 구성될 것이다. 이러한 하남시의 특성을 고려하여 조사지역은 공장지역을 제외한 일반주거지역, 밀집주거지역, 영업지역으로 분류하였으며 이렇게 분류된 지역은 각각 오수발생패턴 및 오수농도에 대한 조사를 실시하여 오수발생특성을 분석하였고, 조사지역별 인구수 조사와 연계하여 원단위 자료를 추출하였다. 이렇게 조사된 자료들을 통해 침입수/유입수 분석에 요구되는 오수전환율, 야간생활하수량 비율을 산정하였으며, 차후 단지개발 및 관거정비 후에 발생하는 오수 발생특성과 비교분석을 통하여 하남시 지역의 오수발생특성에 대한 신뢰성 있는 자료로 활용될 것으로 기대된다. RMA2 모형을 이용하여 충주댐에서의 물의 흐름을 해석한 결과 옥순대교$\~$청풍대교 구간 사이에 댐 및 지형적 영향으로 인해 잘 발달된 와류가 하도 전체를 통하여 발생되고 있었고 이는 댐 부유물 정체현상이 나타나는 지점과 잘 일치하고 있었다.정함 후 감마분석에 의하여 구하였다. CF:CS 연령모델을 적용한 결과 깊이에 따른 supported $^{210}Pb$와 퇴적 속도는 0.91cm/year 인 것으로 산정 되었다.RS is a more advanced content-based image retrieval system than other systems which support only concepts or image features.방하는 것이 선계기준에 적합한 것으로 나타났다. 밸브 개폐에 따른 수압 변화를 모의한 결과 밸브 개폐도를 적절히 유지하여 필요수량의 확보 및 누수방지대책에 활용할 수 있을 것으로 판단된다.8R(mm)(r^2=0.84)$로 지수적으로 증가하는 경향을 나타내었다. 유거수량은 토성별로 양토를 1.0으로 기준할 때 사양토가 0.86으로 가장 작았고, 식양토 1.09, 식토 1.15로 평가되어 침투수에 비해 토성별 차이가 크게 나타났다. 이는 토성이 세립질일 수록 유거수의 저항이 작기 때문으로 생각된다. 경사에 따라서는 경사도가 증가할수록 증가하였으며 $10\% 경사일 때를 기준으로 $Ro(mm)=Ro_{10}{\times}0.797{\times}e^{-0.021s(\%)}$로 나타났다.천성 승모판 폐쇄 부전등을 초래하는 심각한 선천성 심질환이다. 그러나 진단 즉시 직접 좌관상동맥-대동맥 이식술로 수술적 교정을 해줌으로써 좋은 성적을 기대할 수 있음을 보여주

• Journal of the Korean Society for information Management
• /
• v.23 no.2
• /
• pp.21-37
• /
• 2006

Based upon the assumption that both theory building and theory use are intertwined to construct a cohesive body of knowledge in the filed, this study attempts to identify the state of theoretical framework by examining the number and the quality of theoretical articles by subfield. Theoretical article is characterized as an incident in which in which the author contributes to the development or the use of theory in his/her own paper. Theoretical incidents were identified by a content analysis of 1,661 articles in four LIS journals from 1984 to 2003. The findings suggest that the four subfields, such as information seeking/use, information retrieval, library management, and scholar communication had great contributions to both theory building and theory use. Also, two research areas such as bibliometrics and professionals are very likely to be theoretical. Further, the analysis of the name of theories used by subfields could give an insight into the understanding of how the theoretical frameworks of each subfield are related.