• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.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.

• The KIPS Transactions:PartB
• /
• v.17B no.1
• /
• pp.1-8
• /
• 2010

The researches about gaze recognition which current user gazes and finds the location have increasingly developed to have many application. The gaze recognition of existence all about researches have got problems because of using equipment that Infrared(IR) LED, IR camera and head-mounted of high price. This study propose and implement the gaze recognition system based on SVM using a single PC Web camera. The proposed system that divide the gaze location of 36 per 9 and 4 to recognize gaze location of 4 direction and 9 direction recognize user's gaze. Also, the proposed system had apply on image filtering method using difference image entropy to improve performance of gaze recognition. The propose system was implements experiments on the comparison of proposed difference image entropy gaze recognition system, gaze recognition system using eye corner and eye's center and gaze recognition system based on PCA to evaluate performance of proposed system. The experimental results, recognition rate of 4 direction was 94.42% and 9 direction was 81.33% for the gaze recognition system based on proposed SVM. 4 direction was 95.37% and 9 direction was 82.25%, when image filtering method using difference image entropy implemented. The experimental results proved the high performance better than existed gaze recognition system.

• Journal of Korea Multimedia Society
• /
• v.2 no.3
• /
• pp.277-288
• /
• 1999

A distributed multimedia school system is developed for the multimedia classroom at high school and university. The system is designed and implemented for students to improve the learning efficiency through the personalized multimedia contents and pace of learning. The previously developed multimedia information retrieval systems have some limitations on being applied to the multimedia classroom: expensive cost per stream or poor retrieval quality inappropriate for education, unscalability of system and service, unfamiliar proprietary client environment, and difficulty for teachers to use the authoring tools and manage the authored teaching materials. The system we developed overcomes the above problems. It is so scalable as to be applicable not only to a segmented classroom but also to the world wide Internet. The stream server is one of the components of the system: stream servers clients, a service gateway system, and a authoring management system. This paper describes the design and implementation of the stream server. A single stream server can simultaneously playback the multimedia streams as many as clients at one classroom. This is achieved only by the software engine without any changes of the hardware architecture. The systematic coupling with other components gives the scalability of the system and the flexibility of services.

• Journal of Korea Multimedia Society
• /
• v.7 no.2
• /
• pp.251-263
• /
• 2004

The Synchronized Multimedia Integration Language (SMIL), recommended by the World Wide Web Consortium (W3C) in 1998, is an XML-based declarative language to synchronize and present multimedia documents. SMIL can create new multimedia data integrating various types of multimedia objects which exist separately such as text, video, graphics and audio. It can support synchronization of multimedia data which are limited in current HTML-based Web technology. For its popularity, it is required to develop a multimedia server guaranteeing Quality of Service (QoS), authoring tool and player. For developing a SMIL authoring tool and player, the technologies are essentially required to read and analyze a SMIL document and to play synchronized various types of media objects in a timeline. In this paper, we describe a design and implementation of an event processor which supports SMIL 2.0 timing model. Moreover, we also develop a SMIL 2.0 player using the proposed event processor. This will facilitate the play of SMIL contents, so that it can contribute to the prosperity of SMIL technology It is possible to reuse in various language profiles defined in the SMIL standard. This player is expected to be utilized in other standard integrating SMIL such as XHTML＋SMIL and SMIL Animation.

• Journal of Intelligence and Information Systems
• /
• v.17 no.1
• /
• pp.17-35
• /
• 2011

The collective intelligence is a common-based production by the collaboration and competition of many peer individuals. In other words, it is the aggregation of individual intelligence to lead the wisdom of crowd. Recently, the utilization of the collective intelligence has become one of the emerging research areas, since it has been adopted as an important principle of web 2.0 to aim openness, sharing and participation. This paper introduces an approach to seek the collective intelligence by cognition of the relation and interaction among individual participants. It describes a methodology well-suited to evaluate individual intelligence in information retrieval and classification as an application field. The research investigates how to derive and represent such cognitive intelligence from individuals through the application of fuzzy relational theory to personal construct theory and knowledge grid technique. Crucial to this research is to implement formally and process interpretatively the cognitive knowledge of participants who makes the mutual relation and social interaction. What is needed is a technique to analyze cognitive intelligence structure in the form of Hasse diagram, which is an instantiation of this perceptive intelligence of human beings. The search for the collective intelligence requires a theory of similarity to deal with underlying problems; clustering of social subgroups of individuals through identification of individual intelligence and commonality among intelligence and then elicitation of collective intelligence to aggregate the congruence or sharing of all the participants of the entire group. Unlike standard approaches to similarity based on statistical techniques, the method presented employs a theory of fuzzy relational products with the related computational procedures to cover issues of similarity and dissimilarity.

• Korean Journal of Remote Sensing
• /
• v.27 no.2
• /
• pp.203-211
• /
• 2011

Recently, information communication technologies such as smartphone or mobile app greatly affect various application fields including geo-spatial domain. And development scheme of mobile web app or hybrid app regards as the most important computing technology which is combined each advantage of mobile app and mobile web. Despite these trends, it is general case that satellite images are used for the background image for other contents services. With this motivation, hybrid app for geo-metadata as the base for dissemination and service is designed and implemented as the prototype, in this study. At the design stage, HTML5, which is the core technology on an international standardization process for hybrid app, is applied. In the implementation, PhoneGap and Sencha Touch as mobile SDK(Software Development Kit) supporting HTML5 on cross-platform in open sources are used. In prototype, some KOMPSAT-2 images covering small area and mandatory elements in geo-metafata standard are tested. As mobile industry applications and business service models based on satellite images on mobile platform are progressing and diversifying, it is expected that this approach and implemented prototype are considered as an important reference.

• Journal of KIISE:Software and Applications
• /
• v.36 no.10
• /
• pp.800-815
• /
• 2009

Recently, Web services based service-oriented architecture is widely used to integrate effectively various applications distributed on the networks. In the service-oriented architecture BPEL as a standard modeling language for the business processes provides the way to integrate various services provided by applications. Over the past few years, some types of studies have been made on testing compatibility of services and on discriminating and tracing of the business processes in the services composition. Now a lot of studies about the services composition with BPEL are going on. However there were few efforts to solve the problems caused by the services composition. Especially, there is no effort to evaluate whether a composite service is reliable and whether it is robust against to exceptional situations. In this paper, we suggest a test framework and a testing method for robustness of the composite service written in WS-BPEL. For this, firstly we extract some information from the BPEL process and the participant services. Next, with the extracted information we construct the virtual testing environment that generates various faults and exceptional cases which may be raised within the real services. Finally the testing work for robustness of a composite service is performed on the test framework.

• Journal of Korea Multimedia Society
• /
• v.7 no.3
• /
• pp.368-376
• /
• 2004

Currently, the package tools and software development kits of Microsoft's Windows Media Technology provides users an environment to write, distribute and play multimedia contents. However, it is very difficult for common users to create a media streaming content using the Windows Media technology, because of its technical hardship. Therefore, we developed an easy-to-use authoring tool for multimedia streaming content which can be used in the Windows Media Technology environment. Our authoring tool is based on the web page templates by which HTML codes can be generated automatically. Using the existing streaming media authoring tool provided by the Microsoft, users have to code the temporal markers and the event script commands directly to the ASF(Advanced Systems Format) files or ASX (ASF Stream Redirector) format files. We developed an easy-to-use interface for insetting temporal markers and the event script commands to the ASF files by simple mouse clicking and dragging to minimize the effort of users for creating multimedia streaming content. In addition, we implemented an ASX file creation wizard that allows users to create ASX format file without coding ASX tags. We also implemented various web page templates where the ASF files and the ASX files can be embedded by just clicking the corresponding templates. The target web pages can be automatically generated from those templates and previewed directly on the web browser at the time of creation.

• Journal of the Korean Society for information Management
• /
• v.26 no.2
• /
• pp.27-41
• /
• 2009

With explosive growth in the area of the Internet and IT services, various types of digital contents are generated and circulated, for instance, as converted into digital-typed, secure electronic records or reports, which have high commercial value, e-tickets and so on. However, because those digital contents have commercial value, high-level security should be required for delivery between a consumer and a provider with non face-to-face method in online environment. As a digital contents, an e-ticket is a sort of electronic certificate to assure ticket-holder's proprietary rights of a real ticket. This paper focuses on e-ticket as a typical digital contents which has real commercial value. For secure delivery and use of digital contents in on/off environment, this paper proposes that 1) how to generate e-tickets in a remote e-ticket server, 2) how to authenticate a user and a smart card holding e-tickets for delivery in online environment, 3) how to save an e-ticket transferred through network into a smart card, 4) how to issue and authenticate e-tickets in offline, and 5) how to collect and discard outdated or used e-tickets.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.3
• /
• pp.135-139
• /
• 2009

The problems to compute the distances or similarities of multiple strings have been vigorously studied in such diverse fields as pattern matching, web searching, bioinformatics, computer security, etc. One well-known method to compare multiple strings in the given set is finding a consensus string which is a representative of the given set. There are two objective functions that are frequently used to find a consensus string, one is the radius and the other is the consensus error. The radius of a string x with respect to a set S of strings is the smallest number r such that the distance between the string x and each string in S is at most r. A consensus string based on radius is a string that minimizes the radius with respect to a given set. The consensus error of a string with respect to a given set S is the sum of the distances between x and all the strings in S. A consensus string of S based on consensus error is a string that minimizes the consensus error with respect to S. In this paper, we show that the problem of finding a consensus string based on radius is NP-complete when the distance function is a metric.