• Korean Management Science Review
• /
• v.28 no.1
• /
• pp.1-10
• /
• 2011

One of the fundamental roles of web object navigation is to support what the user wants precisely and efficiently from the enormous web database to the web browser. As long as the web search results are a set of individual lists, it is all right to display each and every web result for the web browser to display a web object one by one. However, in case the search results are a collection of multiple interrelated web objects, then there is a need to represent for a new mechanism for linked web objects at a time. We define a unit of web objects derived from a Steiner tree where the web objects include a set of specific keywords calculated by the weight from which the solutions are extracted. Even if a web object does not include all the keywords, then the related hypertext linked web objects are derived and displayed onto the mobile web browser with meta data in one shot. In this paper, it is applied for the mobile browser that the web contents can dynamically be displayed with Steiner trees until each renewal of the navigation request may be issued. In this paper, a new synchronized mobile browsing method is developed so that the navigating time can drastically be reduced and the web navigating efficiency can be dramatically enhanced without sacrificing memory consumption.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.4
• /
• pp.63-82
• /
• 2008

The explosively growing attractiveness of the Web is commencing significant demands for a structuring analysis on various web objects. The larger the substantial number of web objects are available, the more difficult for the clients(i.e. common web users and web robots) and the servers(i.e. Web search engine) to retrieve what they really want. We have in mind focusing on the structure of web objects by introducing optimization models for more convenient and effective information retrieval. For this purpose, we represent web objects and hyperlinks as a directed graph from which the optimal structures are derived in terms of rooted directed spanning trees and Top-k trees. Computational experiments are executed for synthetic data as well as for real web sites' domains so that the Lagrangian Relaxation approaches have exploited the Top-k trees and Hop constraint resolutions. In the experiments, our methods outperformed the conventional approaches so that the complex web graph can successfully be converted into optimal-structured ones within a reasonable amount of computation time.

• Journal of Korea Multimedia Society
• /
• v.10 no.12
• /
• pp.1679-1686
• /
• 2007

In this paper, we introduce the sharable and reusable learning objects which are suitable for XML Web services in e-learning systems. These objects are extracted from the principles of pedagogical paradigms for reusable learning units. We call them LIO (Learning Item Object) objects. Existing models, such as Web-hosted and ASP-oriented service model, are difficult to cooperate and integrate among the different kinds of e-learning systems. So we developed the LIO objects that are suitable for XML Web services. The reusable units that are extracted from pedagogical paradigms are tutorial item, resource, case example, simulation, problems, test, discovery and discussion. And these units correspond to the LIO objects in our learning object model. As a result, the proposed model is that learner and instruction designer should increase the power of understanding about learning contents that are based on pedagogical paradigms. By using XML Web services, this guarantees the integration and interoperation of the different kinds of e-learning systems in distributed environments and so educational organizations can expect the cost reduction in constructing e-learning systems.

• The Journal of Society for e-Business Studies
• /
• v.13 no.2
• /
• pp.101-115
• /
• 2008

Recently in the human society, the crime using small arms has increased. Also, many accidents happen because of incomplete management of chemicals and radiation. Accordingly, it is necessary to manage dangerous objects by tracing the position of dangerous objects and rapidly providing the correct information for them. This paper presents a web-based system for real-time monitoring of dangerous objects using RFID in order to overcome the limitations and problems of current dangerous objects management techniques. In this paper, we define the architecture for web-based dangerous objects monitoring system and the scheme for storing information of a dangerous object in the RFID tag. We also implement the web-based monitoring system and present the execution result of the system. The proposed real-time monitoring system is composed of the dangerous objects monitoring server which manages information of dangerous objects and controls them, the dangerous objects monitoring middleware which is mediator between dangerous objects and the server, the RFID reader which reads information of dangerous objects from RFID tags attached to the objects and the database which stores information, status and position of dangerous object. The proposed system manages diverse dangerous objects such as small arms, radiation and harmful chemicals based on the position of them using RFID, so the user can check dangerous objects when they are checked in and checked out and the user can acquire the real-time position information of them through the system. Furthermore, the user can visually monitor dangerous objects through web browser from any where and at any time because the system is web-based system and it provides graphical user interface.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.10a
• /
• pp.325-330
• /
• 1999

Web-based simulation is one of the most interesting field of simulation research today. Among many research area of web-based simulation, we concern about what a effective way of building simulation model is since creating comprehensive simulation models can be expensive and time consuming. So this paper discusses how to integrate distributed simulation sub-models as objects for constructing the required simulation model which is more large and complex. We introduce two web-oriented methodologies (such as JIDL, CORBA) and the concepts of agent for assisting modelers to integrate simulation models scattered over the web. SINDBAD, which we designed, is a simulation environment which makes it possible constructing a simulation model with distributed model objects on the web and performing the parallel simulation in a distributed way. It is organized according to design patterns in the object oriented concept. Actually we are on the premise that all the distributed objects are originally composed in a CORBA-compatible way to start with our prototype of SINDBAD.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1379-1382
• /
• 2004

The use of a cache for storing and processing of Web objects is becoming larger. Also, many studies on the efficient management of the storing scope of caches are being done. Web caching algorithms have many differences from traditional algorithms. Particularly, heterogeneity of Web objects that are processing units of Web caching, and a variation of Web object reference characteristic with time are the important causes of the decrease the performance of existing algorithms. In this study, we proposed the new web-caching algorithm. A heterogeneity variation of an object can be reduced as the proposed method dividedly managing Web objects and a cache scope with heterogeneity, and it is adaptively reflecting a variation of object reference characteristics with the flowing of time. In the experiments, we verified that the performance of the proposed method was more improved than existing algorithms through the two experiment models which considered heterogeneity of an object.

• International journal of advanced smart convergence
• /
• v.11 no.3
• /
• pp.1-6
• /
• 2022

In this paper, we estimate the mean number of objects in the M/H₂/1 model for web service when the mean object size in the M/H₂/1 model is equal to that of the M/G/1/PS and M/BP/1 models. To this end, we use the mean object size obtained by assuming that the mean latency of deterministic model is equal to that of M/H₂/1, M/G/1/PS, and M/BP/1 models, respectively. Computational experiments show that if the shape parameter of the M/BP/1 model is 1.1 and the system load is greater than 0.35, the mean number of objects in the M/H₂/1 model when mean object size of M/H₂/1 model is the same as that of M/G/1/PS model is almost equal to the mean number of objects in the M/H₂/1 model when the mean object size of M/H₂/1 model is the same as that of M/BP/1 model. In addition, as the upper limit of the M/BP/1 model increases, the number of objects in the M/H₂/1 model converges to one, which increases latency. These results mean that it is efficient to use small-sized objects in the web service environment.

• Journal of Communications and Networks
• /
• v.12 no.1
• /
• pp.52-66
• /
• 2010

Since large objects consume substantial resources, web proxy caching incurs a fundamental trade-off between performance (i.e., hit-ratio and latency) and overhead (i.e., resource usage), in terms of caching and relaying large objects to users. This paper investigates how and to what extent the current dedicated-server based web proxy caching scheme is affected by large file transfers in a high bandwidth campus network environment. We use a series of trace-based performance analyses and profiling of various resource components in our experimental squid proxy cache server. Large file transfers often overwhelm our cache server. This causes a bottleneck in a web network, by saturating the network bandwidth of the cache server. Due to the requests for large objects, response times required for delivery of concurrently requested small objects increase, by a factor as high as a few million, in the worst cases. We argue that this cache bandwidth bottleneck problem is due to the fundamental limitations of the current centralized web proxy caching model that scales poorly when there are a limited amount of dedicated resources. This is a serious threat to the viability of the current web proxy caching model, particularly in a high bandwidth access network, since it leads to sporadic disconnections of the downstream access network from the global web network. We propose a peer-to-peer cooperative web caching scheme to address the cache bandwidth bottleneck problem. We show that it performs the task of caching and delivery of large objects in an efficient and cost-effective manner, without generating significant overheads for participating peers.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.340-342
• /
• 2003

Location based services based on positions of moving objects are expanding the business area gradually. The location is included all estimate position of the future as well as the position of the present and the past. Location based routing service is active business application in which the position information of moving objects is applied efficiently. This service includes the trajectory of past positions, the real-time tracing of present position of special moving objects, and the shortest and optimized paths combined with map information. In this paper, we describes the location based routing services is extend in distributed web GIS environment. Web GIS service systems provide the various GIS services of analyzing and displaying the spatial data with friendly user - interface. That is, we propose the efficient architecture and technologies for servicing the location based routing services in distributed web GIS environment. The position of moving objects is acquired by GPS (Global Positioning System) and converted the coordinate of real world by map matching with geometric information. We suppose the swapping method between main memory and storages to access the quite a number of moving objects. And, the result of location based routing services is wrapped the web-styled data format. We design the schema based on the GML. We design these services as components were developed in object-oriented computing environment, and provide the interoperability, language-independent, easy developing environment as well as re - usability.

• Journal of the Korea Society for Simulation
• /
• v.9 no.4
• /
• pp.25-40
• /
• 2000

The cost of simulation modeling, the expertise required, and the pains of starting a new each time are impediments to more wide spread adoption of simulation technology. In addition, one of the most critical problems in the field of computer simulation today is the lack of published models and physical objects within the World Wide Web (WWW) allowing such distribution. From the viewpoint of WWW as distributed model repositories, it can be assumed that very many simulation models exist on the web. This paper is based on the premise that WWW is a distributed repository. Design Pattern, web-oriented technology like Java and CORBA, which are especially to cope with distributed objects, are introduced and discussed in detail for integration of simulation model. In this paper an architecture of model integration is proposed, which presents the whole procedure of model integration and how the Internet technologies are connected in. The central focus of this research is on the technical realization of integrating simulation models as distributed objects