• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.1
• /
• pp.29-33
• /
• 2004

I propose a personalized digital library system (PDLS) based on an advanced distributed agent platform. The new platform is developed by improving the DECAF (Distributed Environment-Centered Agent Framework) which is one of the conventional distributed agent development toolkits. Also, a mobile ORB (Object Request Broker), Voyager, and a new multi agent negotiation algorithm are adopted to develop the advanced platform. The new platform is for mobile multi agents as well as the distributed environment, whereas the DECAF is for the distributed and non-mobile environment. From the results of the simulation the searched time of PDLS is lower, as the numbers of servers and agents are increased. And the user satisfaction is four times greater than the conventional client-server model. Therefore, the new platform has some optimality and higher performance in the distributed mobile environment.

• International Journal of Advanced Culture Technology
• /
• v.7 no.4
• /
• pp.321-326
• /
• 2019

As AI technology is recently introduced into various fields, it is being applied to the fashion field. This paper proposes a system for recommending cody clothes suitable for a user's selected clothes. The proposed system consists of user app, cody recommendation module, and server interworking of each module and managing database data. Cody recommendation system classifies clothing images into 80 categories composed of feature combinations, selects multiple representative reference images for each category, and selects 3 full body cordy images for each representative reference image. Cody images of the representative reference image were determined by analyzing the user's preference using Google survey app. The proposed algorithm classifies categories the clothing image selected by the user into a category, recognizes the most similar image among the classification category reference images, and transmits the linked cody images to the user's app. The proposed system uses the ResNet-50 model to categorize the input image and measures similarity using ORB and HOG features to select a reference image in the category. We test the proposed algorithm in the Android app, and the result shows that the recommended system runs well.

• Journal of Korea Multimedia Society
• /
• v.22 no.12
• /
• pp.1404-1414
• /
• 2019

Educational books commonly use some copyrighted images with various kinds of deformation for helping students understanding. When using several copyrighted images made by merging or editing distortion in legal, we need to pay a charge to original copyright holders for each image. In this paper, we propose an efficient matching algorithm by separating each copyrighted image with the merged and edited type including rotation, illumination change, and change of size. We use the Oriented FAST and Rotated BRIEF (ORB) method as a basic feature matching scheme. To improve the matching accuracy, we design a new MIN-MAX similarity in matching stage. With the distorted dataset, the proposed method shows up-to 97% of precision in experiments. Also, we demonstrate that the proposed similarity measure also outperforms compared to other measure which is commonly used.

• Journal of KIISE:Software and Applications
• /
• v.27 no.4
• /
• pp.315-326
• /
• 2000

As Internet is being widely used as an infra of distributed applications, the most of today's softwares are changing into Internet-based distributed applications. The development methods using the middleware, like CORBA ORB, make the development of the web-based software easy. However, the performance verification method useful for an optimized software distribution is not provided at software development. Additionally, monitoring methods and metrics for dynamic load-balancing are not presented at run-time. This paper presents the method to monitor the message between objects, load metric, and metrics for load-balancing. To calculate a load of a node, we define events occurred between applications, time between the events, then extract the data related to a load. And we derive formula calculating the load from the extracted data. Then using the formula, we present the metrics for dynamic load-balancing. Moreover, we observe the utilization and efficiency of the monitoring algorithm, load metric, and load-balancing metrics.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.307-318
• /
• 2003

In this paper, we design and construct a TMO object group that provides the guaranteed real-time services in the distributed object computing environments, and verify execution power of its model for the correct distributed real-time services. The TMO object group we suggested is based on TINA's object group concept. This model consists of TMO objects having real-time properties and some components that support the object management service and the real-time scheduling service in the TMO object group. Also TMO objects can be duplicated or non-duplicated on distributed systems. Our model can execute the guaranteed distributed real-time service on COTS middlewares without restricting the specially ORB or the of operating system. For achieving goals of our model. we defined the concepts of the TMO object and the structure of the TMO object group. Also we designed and implemented the functions and interactions of components in the object group. The TMO object group includes the Dynamic Binder object and the Scheduler object for supporting the object management service and the real-time scheduling service, respectively The Dynamic Binder object supports the dynamic binding service that selects the appropriate one out of the duplicated TMO objects for the clients'request. And the Scheduler object supports the real-time scheduling service that determines the priority of tasks executed by an arbitrary TMO object for the clients'service requests. And then, in order to verify the executions of our model, we implemented the Dynamic Binder object and the Scheduler object adopting the binding priority algorithm for the dynamic binding service and the EDF algorithm for the real-time scheduling service from extending the existing known algorithms. Finally, from the numerical analyzed results we are shown, we verified whether our TMO object group model could support dynamic binding service for duplicated or non-duplicated TMO objects, also real-time scheduling service for an arbitrary TMO object requested from clients.