• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.6
• /
• pp.407-411
• /
• 2007

Over the years, great attention has been paid to the question of exploiting inherent semantic of HTML in the area of web document retrieval. Although HTML is mainly presentation oriented, HTML tags implicitly contain useful semantics that can be catch meaning of text. Focusing on this idea. in this paper we define 'markup pattern' and try to improve performance of web document retrieval using markup patterns. Markup pattern is a mirror of intends of web document publisher and an internal semantic of text on web document. To discover the markup pattern and exploit it, we suggest a new scheme for extracting concepts and weighting documents. For evaluation task, we select two domains-BBC and CNN web sites, and use their search engines to gather domain documents. We re-weight and re-score documents using proposed scheme, and show the performance improvement in the two domains.

• Journal of Internet Computing and Services
• /
• v.1 no.1
• /
• pp.35-46
• /
• 2000

One of the main chalenges in personal communication services (PCS) is to locate many mobile terminals that may move frequently from place to place. Such a system operation is called location management. Many network signaling traffic, and database queries are required to achieve such a task. Several strategies have been proposed to improve the efficiency of location management. These strategies use location register databases to store the current location on mobile terminals, and are vulnerable to failure of the location registers. In this paper, we propose a fault-tolerant pointer forwarding with distributed home location register (FT-RFDHLR) to tolerate the failure of location registers. The performance of the proposed method is evaluated by an analytical model, and is compared with thew pointer forwarding with the single home location register (PFSHLR), the pointer forwarding with distributed home location register (PFDHLR), Biaz's bypass forwarding strategy (BFS) and two-path forwarding strategy (TPFS).

• Journal of Internet Computing and Services
• /
• v.7 no.5
• /
• pp.135-145
• /
• 2006

This paper presents a novel approach to real-time recognition of 3D environment and objects for intelligent robots. First. we establish the three fundamental principles that humans use for recognizing and interacting with the environment. These principles have led to the development of an integrated approach to real-time 3D recognition and modeling, as follows: 1) It starts with a rapid but approximate characterization of the geometric configuration of workspace by identifying global plane features. 2) It quickly recognizes known objects in environment and replaces them by their models in database based on 3D registration. 3) It models the geometric details on the fly adaptively to the need of the given task based on a multi-resolution octree representation. SIFT features with their 3D position data, referred to here as stereo-sis SIFT, are used extensively, together with point clouds, for fast extraction of global plane features, for fast recognition of objects, for fast registration of scenes, as well as for overcoming incomplete and noisy nature of point clouds. The experimental results show the feasibility of real-time and behavior-oriented 3D modeling of workspace for robotic manipulative tasks.

• Journal of Internet Computing and Services
• /
• v.12 no.5
• /
• pp.87-100
• /
• 2011

In this paper, we address a video summarization task as generating both visually salient and semantically important video segments. In order to find salient data points, one can use the OC-SVM (One-class Support Vector Machine), which is well known for novelty detection problems. It is, however, hard to incorporate into the OC-SVM process the importance measure of data points, which is crucial for video summarization. In order to integrate the importance of each point in the OC-SVM process, we propose a fuzzy version of OC-SVM. The Importance-based Fuzzy OC-SVM weights data points according to the importance measure of the video segments and then estimates the support of a distribution of the weighted feature vectors. The estimated support vectors form the descriptive segments that best delineate the underlying video content in terms of the importance and salience of video segments. We demonstrate the performance of our algorithm on several synthesized data sets and different types of videos in order to show the efficacy of the proposed algorithm. Experimental results showed that our approach outperformed the well known traditional method.

• Journal of Internet Computing and Services
• /
• v.3 no.2
• /
• pp.97-108
• /
• 2002

A user with a specific information need will often need to query several search engines before finding relevant documents. To address the problem of navigating the search engines, agents are used. In general, an agent is a program that can perform a particular task automatically, when appropriate or upon request by another program. In this paper, we design and implement the education information search system for children: using Information gathering agent that is called Edulnfo4k. The information gathering agent periodically visits several portal web sites for children: Ggureogi of Yahoo Korea, Junior of Naver and Gaegujaengi of Hanmir, collects the education or learning information for children, stores the collected information into database. Then, causal users can search the education information for children from database through a uniform user interface, conveniently. As the result, we know that Edulnfo4k provides integrated search without query in several search engines.

• Journal of Internet Computing and Services
• /
• v.8 no.2
• /
• pp.15-22
• /
• 2007

As we detect defects and eliminate them in early stages, we can make better quality software. For doing this task, we need to use a defect tracking system which con effectively track and manage defects that give severe effects on software quality. Those existing defect tracking systems have some weaknesses as we apply them to organizations that use CMMI for process improvements. Major problems of those systems are that they require the organizations to collect many types of defect data at a time without providing the proper explanation and even without the support of defect management process. The organizations at CMMI maturity level 2 and 3 have problems for analyzing those defects because there is no specific process area at CMMI maturity level 2 and 3 which directly handles defect managing activites. This paper resolves those problems by developing a defect tracking system which offers methods of managing defects. And the system provides guidelines of which defects should be gathered for each CMMI mathurity levels. The system also has functions to generate various status and statistic information on defects, and to assign defect data to the person in charge so that he or she track the defect to the closure

• Journal of Internet Computing and Services
• /
• v.16 no.2
• /
• pp.85-98
• /
• 2015

Component technologies which enable quickly and effectively to develop software have begun to come into the spotlight since early 1990s. Currently, a number of software development works are performed on the J2EE/EJB environment. However component testing is a very complicated task, in addition it requires more efforts than the previous Java class testing. Thus many developers do not perform sufficiently testing works. In this paper we propose an automatic testing method for EJB components based on the in-container testing strategy and implement a testing tool. Since our method builds automatically the test environment for EJB components, it is possible for developers or testers to save their time and efforts at the test preparation phase. Therefore we are convinced that the reliability of EJB components can be increased through sufficient testings with our method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5537-5555
• /
• 2017

Having the characteristics of unlinkability, anonymity, and unforgeability, blind signatures are widely used for privacy-related applications such as electronic cash, electronic voting and electronic auction systems where to maintain the anonymity of the participants. Among these applications, the blinded message is needed for a certain purpose by which users delegate signing operation and communicate with each other in a trusted manner. This application leads to the need of proxy blind signature schemes. Proxy blind signature is an important type of cryptographic primitive to realize the properties of both blind signature and proxy signature. Over the past years, many proxy blind signature algorithms have been adopted to fulfill such task based on the discrete logarithm problem (DLP) and the elliptic curve discrete log problem (ECDLP), and most of the existing studies mainly aim to provide effective models to satisfy the security requirements concerning a single blinded message. Unlike many previous works, the proposed scheme applies the signcryption paradigm to the proxy blind signature technology for handling multiple blinded messages at a time based on elliptic curve cryptography (ECC). This innovative method thus has a higher level of security to achieve the security goals of both blind signature and proxy signature. Moreover, the evaluation results show that this proposed protocol is more efficient, consuming low communication overhead while increasing the volume of digital messages compared to the performance from other solutions. Due to these features, this design is able to be implemented in small low-power intelligent devices and very suitable and easily adoptable for e-system applications in pervasive mobile computing environment.

• Journal of Internet Computing and Services
• /
• v.21 no.5
• /
• pp.49-56
• /
• 2020

Detecting shadows in images and restoring or removing them was a very challenging task in computer vision. Traditional researches used color information, edges, and thresholds to detect shadows, but there were errors such as not considering the penumbra area of shadow or even detecting a black area that is not a shadow. Deep learning has been successful in various fields of computer vision, and research on applying deep learning has started in the field of shadow detection and removal. However, it was very difficult and time-consuming to collect data for network learning, and there were many limited conditions for shooting. In particular, it was more difficult to obtain shadow data from buildings and satellite images, which hindered the progress of the research. In this paper, we propose a method for generating shadow data from buildings and satellites using Unity3D. In the virtual Unity space, 3D objects existing in the real world were placed, and shadows were generated using lights effects to shoot. Through this, it is possible to get all three types of images (shadow-free, shadow image, shadow mask) necessary for shadow detection and removal when training deep learning networks. The method proposed in this paper contributes to helping the progress of the research by providing big data in the field of building or satellite shadow detection and removal research, which is difficult for learning deep learning networks due to the absence of data. And this can be a suboptimal method. We believe that we have contributed in that we can apply virtual data to test deep learning networks before applying real data.

• KIISE Transactions on Computing Practices
• /
• v.22 no.1
• /
• pp.38-43
• /
• 2016

Recent developments regarding transportation technology have positioned travel as a major leisure activity; however, trip-itinerary planning remains a challenging task for tourists due to the need to select Points of Interest (POI) for visits to unfamiliar cities. Meanwhile, due to the GPS functions on mobile devices such as smartphones and tablet PCs, it is now possible to collect a user's position in real time. Based on these circumstances, our research on an automatic itinerary-planning system to simplify the trip-planning process was conducted briskly. The existing studies that include research on itinerary schedules focus on an identification of the shortest path in consideration of cost and time constraints, or a recommendation of the most-popular travel route in the destination area; therefore, we propose a personalized itinerary-recommendation system for which the stay-time preference of the individual user is considered as part of the personalized service.