• Asian review of World Histories
• /
• v.4 no.1
• /
• pp.125-132
• /
• 2016

This paper, as a conlcusion to this special issue, presents the future work that is being carried out at NTU Singapore in collaboration with Microsoft Research and Microsoft Azure for Research. For our research team the real frontier research in world histories starts when we want to use computers to structure historical information, model historical narratives, simulate theoretical large scale hypotheses, and incent world historians to use virtual assistants and/or engage them in teamwork using social media and/or seduce them with immersive spaces to provide new learning and sharing environments, in which new things can emerge and happen: "You do not know which will be the next idea. Just repeating the same things is not enough" (Carlo Rubbia, 1984 Nobel Price in Physics, at Nanyang Technological University on January 19, 2016).

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.12
• /
• pp.1083-1087
• /
• 2005

As development of digital technology, many kinds of multimedia data are used variously and requirements for effective use by user are increasing. In order to transfer information fast and precisely what user wants, effective retrieval method is required. As existing multimedia data are impossible to apply the MPEG-1, MPEG-2 and MPEG-4 technologies which are aimed at compression, store and transmission. So MPEG-7 is introduced as a new technology for effective management and retrieval of multimedia data. In this paper, we extract content-based features using color descriptor among the MPEG-7 standardization visual descriptor, and reduce feature data applying PCA(Principal Components Analysis) technique. We model the cerebral cortex and hippocampal neural network in engineering domain, and team content-based feature vectors fast and apply the hippocampal neural network algorithm to compose of optimized feature. And then we present fast and precise retrieval effect when indexing and retrieving.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.8
• /
• pp.878-882
• /
• 2010

DaaS model that surrogates their data has a problem of privacy leakage by service provider. In this paper, we analyze inference attack that can occur on encrypted data that consist of multiple column through index, and we suggest b-anonymity to protect data against inference attack. We use R+-tree technique to minimize false-positive that can happen when we use an index for efficiency of data processing.

• Journal of the Korean Society for information Management
• /
• v.5 no.1
• /
• pp.131-152
• /
• 1988

It is purposed in this paper to improve the retrieval cffect~venebs through the use of the seman-- t r knowledge of search terms in a computerbased search system. This study is developed it1 three stages include the experimentation of index terms or1 the probab~listir model, indexing with relational operators, and knowledgebase design. The sl~bject experimerltrd is the specific fklds of Chemical Engineering, ' Fluid Flow' and 'Combustion: As for the system ~rnplementatlon. two kinds of search method a r e done. Orie is to search terms related to one specialty word, the other is to retriele the articles based or1 the gueries.

• Journal of the Korean Society for information Management
• /
• v.8 no.2
• /
• pp.3-31
• /
• 1991

A prototype model of intelligent information retrieval system is presented with the definition of intelligent information retrieval. An intelligent information retrieval system for Korean documents was designed, and the system was implemented with Turbo Prolog 2.0 and Turbo Pascal 5.5. The characteristics of the system include natural language interface, user modeling, automatic indexing by case relationship, and multiple retrieval techniques.

• International Journal of Contents
• /
• v.11 no.1
• /
• pp.69-72
• /
• 2015

Generally, existing parallel main-memory spatial index structures to avoid the trade-off between query freshness and CPU cost uses light-weight locking techniques. However, still, the lock based methods have some limits such as thrashing which is a well-known problem in lock based methods. In this paper, we propose a distributed index structure for moving objects exploiting the parallelism in multiple machines. The proposed index is a lock free multi-version concurrency technique based on the D-Stream model of Spark Stream. The proposed method exploits the multiversion nature of D-Stream of Spark Streaming.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11c
• /
• pp.1895-1898
• /
• 2002

웹 환경에서 처리하는 데이터의 종류가 텍스트에서 비디오, 오디오와 같은 멀티미디어 데이터까지 다양해지면서 데이터를 효율적으로 표현, 저장 및 검색하기 위한 다양한 방법이 연구되고 있다. 이 논문에서는 동영상 데이터의 구조적인 형태를 고려하여 XML 문서로 표현하고 XML 문서를 데이터베이스에 저장하기 위한 데이터베이스 스키마를 설계하였다. 그래서 XML 문서내의 각 노드에 엘리먼트의 고유성을 나타내기 위한 고유식별자와 부모노드와 자식노드들 간의 관계를 표현하여 주기 위한 엘리먼트 식별자와 ETID를 결합하여 멀티미디어 데이터에 대한 XML 문서의 부모와 자식의 관계를 표현하여 준다. 그리고 부모가 같은 형제간의 순서 정보와 형제들 간의 동일한 타입을 구별하고 정보를 표현하기 위한 관계 테이블을 설계하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11b
• /
• pp.721-724
• /
• 2003

대부분의 이미지 검색은 질의 키워드를 이용하여 이루어지기 때문에 웹으로부터 수집한 이미지에는 미리 주제와 연관된 적절한 색인어를 부여하는 것이 필요하다. 웹 문서의 키워드를 이용하는 방법은 이미지와 연관성이 높은 것으로 간주되는 주변 키워드에 대해 각각의 연관도를 계산하여 색인어를 선정하는 방법이다. 본 논문에서는 이미지 주변의 키워드를 이용하여 이미지를 인덱싱한 후 유저 피드백을 통해 정확도를 높이는 웹 이미지 검색 모델을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.18-20
• /
• 2000

XML 문서의 구조검색을 위한 기존 방법들은 특정 엘리먼트의 조상, 자손, 형제에 대한 다양한 구조검색을 효율적으로 지원하지 못한다. 본 논문에서는 XML 문서의 효율적인 관리와 구조검색을 위해 DTD(Document Type Definition)의 논리적 구조를 따르는 XML 문서에 대해 구조정보를 표현하기 위한 방법을 제시한다. 구조정보는 엘리먼트 이름을 식별할 수 있는 EID, 부모와 자식 엘리먼트간의 계층정보를 위한 ETID, 동일한 부모 엘리먼트를 갖는 자식 엘리먼트들의 순서정보를 위한 SORD, 그리고 동일한 부모 엘리먼트를 갖는 자식들 중 동일한 타입의 엘리먼트들에 대한 순서정보를 위한 SSORD로 구성된다. 이런 구조정보를 이용해 빠른 검색을 위한 내용 색인, 구조 색인, 애트리뷰트 색인을 설계한다. 설계된 색인을 통하여 질의를 처리하는 과정을 설명함으로써 다양한 구조적 질의를 효과적으로 처리할 수 있음을 보인다.

• Journal of Internet Computing and Services
• /
• v.8 no.4
• /
• pp.159-171
• /
• 2007

This paper proposes a software tool MADE that is useful to develop a practical Korean morphological analyzer. A morphological analysis is performed by using adjacency conditions provided by a morphological dictionary. This means that developing a morphological analyzer is reduced merely to constructing a morphological dictionary. No programming skill is required in this process, MADE provides with useful functions that facilitate the construction of a dictionary. Once a dictionary is constructed, the morphological analysis engine embedded in MADE may be used as a stand-alone morphological analyzer or be integrated into an application software which requires a Korean morphological analysis module.