• Journal of KIISE:Databases
• /
• v.36 no.2
• /
• pp.123-138
• /
• 2009

In recent years, the web services composition search has become an issue of great interest. The web services composition search is the process of integrating individual web services to yield desired behavior. Through the web services composition search, more sophisticated functionalities can be provided. Current solutions can be classified into three main classes: forward chaining approach, backward chaining approach and two-phase approach. However one-way chaining approaches, such as forward chaining approach and backward chaining approach have limitations of searching irrelevant web services. And two-phase approach has limitations of including redundant web services. In this paper, we propose an unredundant web services composition search based on the two-phase algorithm. The algorithm consists of a forward phase and a backward phase. In the forward phase, the candidate web services participating composition will be found efficiently by searching the Link Index. In the backward phase, unredundant web services compositions will be generated from candidate web services by using the Token Manager. The experimental results show that our proposed algorithm is more efficient than one-way chaining approaches. The experimental results also show that our algorithm can provide more solutions than previous two-phase approach and is comparable to previous one in execution time.

• Journal of KIISE:Software and Applications
• /
• v.31 no.9
• /
• pp.1180-1195
• /
• 2004

Due to the exponential increase of information, search and access for the Web information or service takes much time. Web information is represented through several web pages using hyperlinks and each web page is contains several topics. However. most existing web tools don't reflect such web authoring tendencies and treat it as an independent information unit. This inconsistency yields inherent problems in web browsing and searching. In this paper, we propose a web surfing assistant called LinkBroker that provides collodion pages. They are composed of relevant information extracted from several web pages that have table and frame structure in order to improve accessibility to web information. Especially, the system extracts a set of web pages that are logically connected and groups those pages using table and frame tags. Then, essential information blocks in each page of a group are extracted to construct an integrated summary page. It Provides a comprehensive view to user and one cut way to access distributed information. Experimental results show the effectiveness and usefulness of LinkBroker system.

• 한국정보교육학회:학술대회논문집
• /
• 2006.01a
• /
• pp.249-254
• /
• 2006

본 연구는 초등학교 컴퓨터 교과의 제재를 주제로 한 웹 기반 프로젝트 학습을 설계하는데 목적이 있다. 이에 따라 본 연구에서는 프로젝트 학습과 웹 기반 프로젝트 학습에 대한 제이론을 고찰하고 이를 바탕으로 웹 기반 프로젝트 학습 모형을 설계하여 초등학교 컴퓨터 교과의 주제를 중심으로 웹 기반 프로젝트 학습을 설계하였다. 설계 단원은 초등학교 6학년 컴퓨터 교과(재량교과)의 '정보의 이해와 윤리', '컴퓨터 기초', '소프트웨어의 활용' 영역을 예비 학습으로 학습하고, 주제별로 그룹별 프로젝트 활동을 함으로써 학습자 중심의 학습이 가능하도록 하였다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2004.05a
• /
• pp.413-416
• /
• 2004

REST(Representational State Transfer)는 분산 컴퓨팅 플랫폼 모델이며, 세계에서 가장 큰 분산 응용인 Web에서 사용하고 있는 웹 구조 스타일 모델이다. 현재 웹의 기본 요소는 URI, HTTP, XML(HTML) 이며, REST는 이러한 인터넷 표준만을 사용한다. REST 에서 리소스의 식별은 URI로, 상태는 상태가 표현된 문서(리소스)로써 HTTP를 통해 전달된다. 리소스의 내용은 XML로 기술하며, 리소스 탐색 및 참조에는 HTTP의 표준 메서드인 GET, PUT, POST, DELETE 등만을 이용하는 것으로 분산 컴퓨팅을 모델링하고 있다. 따라서 서비스마다 다양한 메서드를 기억하여야 하는 SOAP 기반 웹 서비스에 비해 REST 모델의 분산 컴퓨팅 응용은 확장성 및 웹 친화성 측면에 있어서 매우 유리함을 알 수 있다.

• Journal of Intelligence and Information Systems
• /
• v.12 no.3
• /
• pp.95-110
• /
• 2006

To enhance the rule-based reasoning capability of Semantic Web, the XRML (eXtensible Rule Markup Language) approach embraces the meta-information necessary for the extraction of explicit rules from Web pages and its maintenance. To effectuate the automatic identification of rules from unstructured texts, this research develops a framework of using rule ontology. The ontology can be acquired from a similar site first, and then can be used for multiple sites in the same domain. The procedure of ontology-based rule identification is regarded as a graph search problem with incomplete nodes, and an A* algorithm is devised to solve the problem. The procedure is demonstrated with the domain of shipping rates and return policy comparison portal, which needs rule based reasoning capability to answer the customer's inquiries. An example ontology is created from Amazon.com, and is applied to the many online retailers in the same domain. The experimental result shows a high performance of this approach.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.4
• /
• pp.521-528
• /
• 2016

Web-based services are used widely in many computer application fields due to the increasing use of PCs and mobile devices. Accordingly, topics on the analysis of access logs generated in the application fields have been researched actively to support personalized services in the field, and analyzing techniques based on the weight differentiation of information in access logs have been proposed. This paper outlines an analysis technique for web-click streams, which is useful for finding high utility old item sets in web-click streams, whose data elements are generated at a rapid rate. Using the technique, interesting information can be found, which is difficult to find in conventional techniques for analyzing web-click streams and is used effectively in target marketing. The proposed technique can be adapted widely to analyzing the data generated in a range of computing application fields, such as IoT environments, bio-informatics, etc., which generated data as a form of data streams.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.749-751
• /
• 2016

Internet technology is universal, news from the Web browser, shopping, search, etc., various activities have been carried out. Its size becomes large, increasing the scale of information security incidents, as damage to this increases the safety for the use of the Internet is emphasized. IE browser is ASLR, such as Isolated Heap, but has been continually patch a number of vulnerabilities, such as various protection measures, this vulnerability, have come up constantly. And, therefore, in order to prevent security incidents, it is necessary to be removed to find before that is used to exploit this vulnerability. Therefore, in this paper, we introduce the purge is a technique that is used in the discovery of the vulnerability, we describe the automation technology related thereto. And utilizing the known vulnerabilities, and try to show any of the typical procedures for the analysis of the vulnerability.

• Journal of KIISE:Databases
• /
• v.32 no.6
• /
• pp.585-592
• /
• 2005

The Semantic Web is being studied as the next step in the evolution of the web. In the environment of the Semantic Web, the information must be understandable computers as well as a just human. So we use ontologies for describing the contents of the web resources. Among such ontologies, OWL is proposed as a recommendation by W3C. OWL data is represented as graph structure and the query is evaluated by traversing each node of the graph. In this paper, we propose the optimization technique based on signature to efficiently process the OWL data. Our approach minimizes traversing each node of the graph in query processing.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.11a
• /
• pp.752-757
• /
• 2001

본 논문은 웹 상에서 자기 주도적 문제풀이 학습을 통하여 학습자가 자기 주도적으로 학습할 수학교과의 학습목표 및 내용, 관련된 학습자료를 탐색하고, 교수자나 다근 학습자와 서로 상호작용을 하여 문제를 해결하기 위한 원격강의 프로그램을 개발하고자 일반적인 멀티미디어 체계적 교수설계 모형을 기초로 웹 기반 코스웨어 설계모형을 제시하고 학습자 중심의 실시간 수학문제 풀이 원격학습 시스템을 구현하였다. 이는 웹 기반의 수학 코스웨어 및 텍스트 모드로 제작 설계되었으며 자기 주도적인 수학 문제 풀이 단계학습을 목적으로 한다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.641-651
• /
• 2006

거대한 웹 컨텐츠 안에는 수많은 링크들로 인한 순환들이 존재하게 된다. 그 순환들은 강하게 뭉쳐있는 실타래 처럼, 강하게 결합한 순환들의 덩어리 형태로 존재하게 된다. 웹 컨텐츠는 흔히 방향그래프로 표현되는데, 즉 웹 컨텐츠에서 나타나는 수많은 링크둘을 방향그래프에서 강결합요소를 이용하면 모든 순환을 효율적으로 발견할 수 있다. 본 논문에서는 강결합요소를 이용하여 거대한 그래프에서 보다 효율적으로 모든 순환을 찾아낼 수 있는 방법을 제시하였다.