• Proceedings of the Korean Information Science Society Conference
• /
• 한국정보과학회 2001년도 봄 학술발표논문집 Vol.28 No.1 (A)
• /
• pp.436-438
• /
• 2001

최근 인터넷을 이용한 분산처리와 멀티미디어에 대한 연구가 활성화됨에 따라 비디오 컨텐츠는 원활한 제공과 편리한 검색방법이 요구되고 있다. 기존의 비디오 검색 시스템은 사용자가 원하는 비디오 컨텐츠를 찾는데 많은 시간이 소요되는 문제점을 안고 있다. 이러한 문제점을 해결하기 위하여 본 논문에서는 실시간으로 웹 서비스를 지원하는 클립 기반 비디오 검색 시스템을 설계 및 구현한다. VCRS(Video Clip Retrieval System)는 비디오 분할에 의한 대표 프레임 추출과 연관된 정보의 클러스터링에 의한 클립 파일생성 및 클립단위의 비디오 데이터베이스 구축 방법으로 비디오 컨텐츠 제공자의 원활한 서비스를 지원하는 내용기반 인덱싱 시스템과 사용자의 다양한 검색을 지원하는 웹 기반 검색 시스템으로 구성된다. 결론적으로 본 논문에서 제안한 시스템은 비디오 컨텐츠를 제공하는데 있어서 유용성을 보이며, 웹 기반에서 범용 데이터베이스를 이용하여 비디오 내용을 검색할 수 있도록 하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 한국정보과학회 2007년도 가을 학술발표논문집 Vol.34 No.2 (A)
• /
• pp.13-14
• /
• 2007

• Journal of KIISE:Computing Practices and Letters
• /
• 제14권4호
• /
• pp.412-429
• /
• 2008

As the amount of electronic documents increases rapidly with the growth of the Internet, a parallel search engine capable of handling a large number of documents are becoming ever important. To implement a parallel search engine, we need to partition the inverted index and search through the partitioned index in parallel. There are two methods of partitioning the inverted index: 1) document-identifier based partitioning and 2) keyword-identifier based partitioning. However, each method alone has the following drawbacks. The former is convenient in inserting documents and has high throughput, but has poor performance for top h query processing. The latter has good performance for top-k query processing, but is inconvenient in inserting documents and has low throughput. In this paper, we propose a hybrid partitioning method to compensate for the drawback of each method. We design and implement a parallel search engine that supports the hybrid partitioning method using the Odysseus DBMS tightly coupled with information retrieval capability. We first introduce the architecture of the parallel search engine-Odysseus/parallel-OOSQL. We then show the effectiveness of the proposed system through systematic experiments. The experimental results show that the query processing time of the document-identifier based partitioning method is approximately inversely proportional to the number of blocks in the partition of the inverted index. The results also show that the keyword-identifier based partitioning method has good performance in top-k query processing. The proposed parallel search engine can be optimized for performance by customizing the methods of partitioning the inverted index according to the application environment. The Odysseus/parallel OOSQL parallel search engine is capable of indexing, storing, and querying 100 million web documents per node or tens of billions of web documents for the entire system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제11권5호
• /
• pp.940-948
• /
• 2007

Many real world problems can be modeled as a graph and traversals on the graph. The structure of Web pages can be represented as a graph, for example, and user's navigation paths on the Web pages can be model as a traversal on the graph. It is interesting to discover valuable patterns, such as frequent patterns, from such traversals. In this paper, we propose an algorithm to discover frequent traversal patterns when a directed graph and weighted traversals on the graph are given. Furthermore, we propose a performance enhancement by traversal split and then verify it through experiments.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• 제27권1호
• /
• pp.701-711
• /
• 2009

The inner space of building is increasingly becoming complex as urban activities increase in variety, and the actual space size also increases. This trend necessitate the utilization of three dimensional position information within the inner space of buildings. Standard GIS web service technology and visualization technology are applied to 3D inner space building data to share these information for better decision making in building related applications such as fire evacuation, facilities management and market analysis. This study aims to effectively model and visualize the three dimensional space of building interiors in the GIS aspect, and to be able to share the information through standard GIS web service. The various elements of inner model was assigned and stored into pre-designed spatial database tables respectively. GIS web server was then configured to service the database which was populated with 3D inner model data. On the client side, 3D visualization modules was developed using a 3D graphic rendering S/W engine.

• Journal of Korea Society of Industrial Information Systems
• /
• 제18권3호
• /
• pp.57-66
• /
• 2013

Many researchers have investigated and studied on the knowledge and skills required for IT workforce, such as programmers, systems analysts, and IT managers. The results of these studies helped us not only to understand the changes of IT trends and to prepare IT workers for their future careers. But, the web developer, which is a newly evolving job title, has little been studied. This research is intended to look into the knowledge and skills for web developers by collecting and analyzing the job advertisements posted the commercial job boards in the Internet. The specific technical requirements for Web developers are programming languages knowledge/skills such as Java and JSP, database, and Internet/Web. Knowledge/skills for general development and knowledge on information technology are required in System section. The results of this research is expected to help us understand the knowledge and skills related to web development.

• The KIPS Transactions:PartD
• /
• 제14D권4호
• /
• pp.447-458
• /
• 2007

The objective of this study is to provide faster mobile web service by improving performance of Contents Cache used for mobile web service in the existing Mobile Gate System. It was found that two elements existed in Mark-Up page transcoded by Contents Generator. One of the elements was dependent only on the requested DIDL page and Mark-Up type. The other was dependent on each of the requested DIDL page, Mark-Up type, size of mobile display 모바일 장치 to request service, type of images available and color depth count of the images available. The conventional Contents Cache saved the entire Mark-Up page to hold both of the two elements. This caused the problem where storage space was not effectively used because reusable elements were repetitively saved in cache memory domain due to change in one of the elements even though all the other elements were the same. As a result, a larger number of transcoded Mark-Up pages could not be saved in the same cache memory size. Therefore, in this study, Mark-Up pages transcoded by Contents Generator were divided into two elements and were separately saved. Also, in order to respond to the demand for replacing data in cache with new data, this study applied two algorithms of LFU and LRU. This study proposed the method to implement cache performance of faster speed by enabling to save more number of the transcoded Mark-Up pages in the same cache storage space.

• Journal of the Korean School Mathematics Society
• /
• 제10권1호
• /
• pp.27-43
• /
• 2007

The aim of this paper is to develop a web-based learning system in order to motivate college students in the area of science and engineering to study college calculus. We designed and developed web-based contents, named MathBooster, using Mathematica, webMathematica and phpMath taking advantages of rapid computation and symbolic computation. The features of MathBooster consists of four parts: graphical representation of calculus concepts, textual illustrations of conceptual understanding, example-based step-by-step learning with phpMath, and quizzes with diagnostic feedback. After the MathBooster was practiced with engineering students, the formative evaluation was conducted with survey items composed in four categories: user responses, screen layout, practicing examples and diagnostic feedback in solving quizzes. The overall level of user satisfaction was statistically measured using SPSS. Those results indicate which parts of MathBooster are needed for future enhancement.

• Proceedings of the Korean Information Science Society Conference
• /
• 한국정보과학회 1999년도 가을 학술발표논문집 Vol.26 No.2 (1)
• /
• pp.42-44
• /
• 1999

인터넷이 급속히 성장함에 따라 대량의 SGML/XML 문서를 보다 효과적으로 다룰 필요성이 증대하고 있다. SGML/XML 문서를 데이터베이스에 저장하는 경우에 문서를 파싱하여 파싱된 결과를 모두 분리하여 저장하고 서로의 연관관계를 모두 구분하는 경우 구조화 정보를 최대한 이용할 수 있는 등 여러 가지 장점을 지니게 된다. 하지만, 이 경우 분할단위의 폭발적인 증가로 인한 시스템 성능 저하와 내용중복으로 인한 색인저장 오버헤드가 문제이다. 이런 문제점을 해결방안의 하나로서 본 논문에서는 RDF 메타데이타를 통하여 검색시 의미가 있는 단위로 분할 단위를 축소 지정하고 이 축소된 정보를 기반으로 인덱스를 생성하여 내용중복을 방지하는 방법을 제안하였다. 이 방법은 RDF메타데이타를 통해 이루어짐으로서 웹기반에서 자동으로 이루어질 수가 있으며, 이를 통해서 기존의 방법보다 자동화된 검색을 할 수 있다.

• Journal of the Korea Society of Computer and Information
• /
• 제14권3호
• /
• pp.57-64
• /
• 2009

XML has become a do facto standard for structured document and data on the Web. An XML data deluge over the network will be more, since XML based standards such as Web Service and Semantic Web gets popular. There are efforts to store and query XML documents in a relational database system and recent efforts focus on how to provide such operations using XPath and XQuery. In this paper, we present study about those research efforts and we propose a new scheme to stoγe and query XML documents in a relational database using XPath query. The scheme uses a 'shred' method to store and translates XPath queries to SQL. We also present our empirical experiments using a RDBMS.