• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.241-248
• /
• 2002

With the structure of tilde-area computing system which Is specified by a researching team in Vrije University, Netherlands, lots of researchers and developers have been progressing the studies of global location and interconnection services of distributed objects existing in global sites. Most of them halve focused on binding services of only non-duplicated computational objects existing wide-area computing sites without any consideration of duplication problems. But all of objects existing on the earth rave the duplicated characteristics according to how to categorize their own names or properties. These objects with the same property can define as duplicated computational objects. Up to now, the existing naming or trading mechanism has not supported the binding services of duplicated objects, because of deficiency of independent location service. For this reason, we suggest a new model that can not only manages locations of duplicated objects In wide-area computing environments, but also provide minimum binding time by considering both the optimal selection of one of duplicated objects and load balance among distributed systems. Our model is functionally divided into 2 parts, one part to obtain an unique object handle of duplicated objects with same property as a naming and trading service, and the other to search one or more contact addresses by a node manager using a liven object handle, as a location service For location transparency, these services are independently executing each other. Based on our model, we described structure of wide-area integrated tree and algorithms for searching and updating contact address of distributed object on this tree. finally, we showed a federation structure that can globally bind distributed objects located on different regions from an arbitrary client object.

• International conference on construction engineering and project management
• /
• 2022.06a
• /
• pp.1243-1244
• /
• 2022

In recent years, the growing interest in off-site construction has led to factories scaling up their manufacturing and production processes in the construction sector. Consequently, continuous large-scale site monitoring in low-variability environments, such as prefabricated components production plants (precast concrete production), has gained increasing importance. Although many studies on computer vision-based site monitoring have been conducted, challenges for deploying this technology for large-scale field applications still remain. One of the issues is collecting and transmitting vast amounts of video data. Continuous site monitoring systems are based on real-time video data collection and analysis, which requires excessive computational resources and network traffic. In addition, it is difficult to integrate various object information with different sizes and scales into a single scene. Various sizes and types of objects (e.g., workers, heavy equipment, and materials) exist in a plant production environment, and these objects should be detected simultaneously for effective site monitoring. However, with the existing object detection algorithms, it is difficult to simultaneously detect objects with significant differences in size because collecting and training massive amounts of object image data with various scales is necessary. This study thus developed a large-scale site monitoring system using edge computing and a small-object detection system to solve these problems. Edge computing is a distributed information technology architecture wherein the image or video data is processed near the originating source, not on a centralized server or cloud. By inferring information from the AI computing module equipped with CCTVs and communicating only the processed information with the server, it is possible to reduce excessive network traffic. Small-object detection is an innovative method to detect different-sized objects by cropping the raw image and setting the appropriate number of rows and columns for image splitting based on the target object size. This enables the detection of small objects from cropped and magnified images. The detected small objects can then be expressed in the original image. In the inference process, this study used the YOLO-v5 algorithm, known for its fast processing speed and widely used for real-time object detection. This method could effectively detect large and even small objects that were difficult to detect with the existing object detection algorithms. When the large-scale site monitoring system was tested, it performed well in detecting small objects, such as workers in a large-scale view of construction sites, which were inaccurately detected by the existing algorithms. Our next goal is to incorporate various safety monitoring and risk analysis algorithms into this system, such as collision risk estimation, based on the time-to-collision concept, enabling the optimization of safety routes by accumulating workers' paths and inferring the risky areas based on workers' trajectory patterns. Through such developments, this continuous large-scale site monitoring system can guide a construction plant's safety management system more effectively.

• Journal of Korea Society of Industrial Information Systems
• /
• v.13 no.5
• /
• pp.149-157
• /
• 2008

In the field of computing service, there is a copernican revolution indebted to development of network & computer technology. Computer system, which is set to mainframe in the 1960's, is advancing torwards to the paradigm of server based computing, so-called thin-client. In thin-client computing, network is the platform which is responsible for transfer of application, so that client execute application installed on server. It is also possible that each system share the computing resource connected with network. In this parer, we suggest component & distributed computing technology as a measn for the implementation of thin-client architecture hence, make the best use of COM(Component Object Model and PYRO(PYthon Remote Objects). We talk about the concept and mechanism of thin-client at the beginning, and propose the design of network architecture for the implementation thin-client.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.663-668
• /
• 2008

These days, computing systems need to be intelligent for satisfying general users' ambiguous requests. In order to make a system intelligent, several methods of managing knowledge have been proposed. Especially, in ubiquitous computing environment, where various computing objects are working together for achieving the given goal, ontology can be the best solutionfor knowledge management. In this paper, we proposed a novel reasoner processing ontology-based knowledge which is expressed in EOL. As this EOL reasoner uses less computing resource, it can be easily adapted to various computing objects in ubiquitous computing environment providing easy usability of knowledge.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.6
• /
• pp.555-568
• /
• 2000

The World Wide Web has become the largest virtual system that is almost universal in scope. In recent research, it has become effective to utilize idle hosts existing in the World Wide Web for running applications that require a substantial amount of computation. This novel computing paradigm has been referred to as the advent of global computing. In this paper, we implement and propose a mobile object-based global computing framework called Tiger, whose primary goal is to present novel object-oriented programming libraries that support distribution, dispatching, migration of objects and concurrency among computational activities. The programming libraries provide programmers with access, location and migration transparency for distributed and mobile objects. Tiger's second goal is to provide a system supporting requisites for a global computing environment - scalability, resource and location management. The Tiger system and the programming libraries provided allow a programmer to easily develop an objectoriented parallel and distributed application using globally extended computing resources. We also present the improvement in performance gained by conducting the experiment with highly intensive computations such as parallel fractal image processing and genetic-neuro-fuzzy algorithms.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.293-306
• /
• 2003

In recent years, distributed computing environments have been radically changing to a structure of global, heterogeneous, federative and wide-area systems. This structure's environments consist of a let of objects which are implemented on telecommunication network to provide a wide range of services. Furthermore, all of objects existing on the earth have the duplicated characteristics according to how to categorize their own names or properties. But, the existing naming or trading mechanism has not supported the binding services of duplicated objects, because of deficiency of independent location service. Also, if the duplicated objects which is existing on different nodes provide the same service, it is possible to distribute the client requests considering each system's load. For this reason, we designed and implemented a new model that can not only support the location management of replication objects, but also provide the dynamic binding service of objects located in a system with minimum overload for maintaining load balancing among nodes in wide-area object computing environments. Our model is functionally divided into two parts; one part is to obtain an unique object handle of replicated objects with same property as a naming and trading service, and the other is to search one or more contact addresses by a location service using a given object handle. From a given model mentioned above, we present the procedures for the integrated binding mechanism in design phase, that is, Naming/Trading Service and Location Service. And then, we described in details the architecture of components for Integrated Binding Service implemented. Finally, we showed our implement environment and executing result of our model.

• Journal of Computing Science and Engineering
• /
• v.5 no.2
• /
• pp.141-149
• /
• 2011

Many distributed and heterogeneous services and devices are accessible in ubiquitous computing environment, so interoperating those services and devices is one of the key tasks in implementing ubiquitous applications. We used to use script languages in integrating such interoperating components and services. However currently available most script languages are not suitable for ubiquitous environment because there are so diverse forms of interoperation targets such as service objects, web, legacy objects and programmable devices. So it is worthwhile designing a new script language well-suited to ubiquitous environment. In this paper, we propose a new script language, called Ubiscript, for the ubiquitous environment. We develop and adopt several unique language features such as remote scope, multiple contexts, web and legacy objects, remote exception handling, etc. in Ubiscript to overcome the limitations of conventional script languages. In this paper, we also describe the implementation of Ubiscript and its runtime system. A couple of ubiquitous applications were developed in Ubiscript, and the applications are tested on the runtime system. According to our experiences and evaluation, Ubiscript turned out to have a high potential in its expression power and contribution to improving ubiquitous application developers' productivity.

• Journal of KIISE:Software and Applications
• /
• v.33 no.3
• /
• pp.356-364
• /
• 2006

'Ubiquitous Computing' is the most important paradigm of the next generation Information-Communication technology. The one of important problems to develop ubiquitous computing service system get hold of relations between times of transfer objects and events of transfer objects. Another problem is what reason transfer-pattern through location data of transfer objects. In this paper, we propose an approach to offer temporal-relation service in ubiquitous computing environment. The first is temporal reasoning in service viewpoint. The second is temporal reasoning to record user's preference. Users have preferences that are closely connected with time. These preferences are recorded at user profile. Therefore, the user profile-based ubiquitous service system can offer suitable service to users.

• Journal of IKEEE
• /
• v.25 no.4
• /
• pp.598-606
• /
• 2021

In this paper, we presents a new service binding and resource management model for context based services in mobile edge computing (MEC) networks. The proposed control is composed of two layers: MEC service bindng control layer (MCL) and user context control layer (UCL). The MCL manages service binding construction, resource allocation, and service policy construction from a system point of view; and the UCL manages real-time service adaptation using meta-objects. Through simulations, we confirmed that the proposed control offers enhanced throughput and content transfer time when it is compared to the legacy computing and control models. The proposed control model can be employed as a key component for the context based various internet-of-things (IoT) services in MEC environments.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.49-56
• /
• 1999

Distributed object Computing, owing to the development of distributed computing, has improved the performance of distributed processing conducted between homogeneous and heterogeneous systems in network. However, it has failed to solve fundamental problems such as network overload and enormous requests demands by servers and clients. In this paper, we propose to design and implement an Object Migration system that uses the java language to tackle the mentioned problems. As the first step of the implementation of the system, we justify the characteristics of t도 mobile object model that keeps codes and states of an object. Implemented Object Migration System would accept objects being migrated to a specific node and support the virtual place in which objects could be executed automatically. Therefore, the Object Migration system we suggest could not only solve problems imposed to traditional distributed computing but also offer transparency of object migration between homogeneous and heterogeneous systems.