• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.9
• /
• pp.873-880
• /
• 2008

This paper deals with the peer-to-peer data communication to connect each distributed levels of developed unmanned system according to the JAUS. The JAUS is to support the acquisition of unmanned system by providing a mechanism for reducing system life-cycle costs. Each of distributed levels of the JAUS protocol divides into a system, some of subsystems, nodes and components/instances, each of which may be independent or interdependence. We have to distribute each of the levels because high performance is supported in order to create several sub-processor computing data in one processor with high CPU speed performance. To complement such disadvantage, we must think the concept that a distributed processing agrees with separating each of levels from the JAUS protocol. Therefore, each of distributed independent levels send data to another level and then it has to be able to process the received data in other levels. So, peer-to-peer communication has to control a data flow of distributed levels. In this research, we explain each of levels of the JAUS and peer-to-peer communication structure among the levels using our developed unmanned ground vehicle.

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.427-432
• /
• 2005

I studied about existent load distribution algorithms and the WLC(Weighted Least Connection) algerian that is using much at present to distribute the connection request of users to real servers efficiently in web cluster system. The efficiency of web cluster system is fallen by load imbalance between servers, because there is problem In inaccurate load status measuring of servers and measuring timing at these load distribution algorithms. In this paper, I suggest an algorithm that distributes load base on various load state of servers by real time using broadcasting RPC(Remote Procedure Call) when a user requests connection, and implement a prototype and experiment its performance. The experiment result shows that load imbalance phenomenon between reai sowers was improved greatly than existing method, and performance of web cluster system was improved by efficiency that response time is shortened.

• Transactions of Materials Processing
• /
• v.17 no.8
• /
• pp.600-606
• /
• 2008

In closed-die hot forging, a billet is formed in dies such that the flow of metal from the die cavity is restricted. Some parts can be forged in a single set of dies, whilst others, due to shape complexity and material flow limitations, must be shaped in multi sets of dies. The purpose of a performing operation is to distribute the volume of the parts such that material flow in the finisher dies will be sound. This study focused on the design of preforms, flash thickness and land width by theoretical calculation and finite element analysis, to manufacture the super hot forging product, 70MC type piston crown used in marine engine. The optimal design of preforms by the finite element analysis and the design experiment achieves adequate metal distribution without any defects and guarantees the minimum forming load and fully filling of the cavity of the die for producing the large piston crown. The maximum loads obtained by finite element analysis are compared with the results of experiments. The loads of the analysis have good agreements with those of the experiment. Results obtained using DEFORM-2D enable the designer and manufacturer of super hot forging dies to be more efficient in this field.

• Transactions of Materials Processing
• /
• v.12 no.4
• /
• pp.277-283
• /
• 2003

In a closed-die forging process, blocker has been used to fill and distribute metal well in finisher die. Generally, the blocker shape was determined by an expert with many experiences. However, the manual blocker design process takes much time and efforts, so various automatic methods for the blocker design process have been suggested for the last three decades. The method with filtering in FFT (Fast Fourier Transform) for the blocker design provides general solution than other methods. But. due to the properties of FFT in time-frequency domain, this method has some drawbacks such as long calculation time, difficulty of local control and additional boundary process after filtering. In this study. DWT (Discrete Wavelet Transform), which is more flexible and is more wildly used than FFT, is applied to the blocker design. The method with filtering in DWT is very proper to design blocker in both 2-D and 3-D shapes. To verify the efficiency of this method, blockers of some models are designed and the results show that blocker design with DWT is effective for the blocker designs.

• ETRI Journal
• /
• v.29 no.5
• /
• pp.545-558
• /
• 2007

This paper presents an efficient semantic service discovery scheme called UbiSearch for a large-scale ubiquitous computing environment. A semantic service discovery network in the semantic vector space is proposed where services that are semantically close to each other are mapped to nearby positions so that the similar services are registered in a cluster of resolvers. Using this mapping technique, the search space for a query is efficiently confined within a minimized cluster region while maintaining high accuracy in comparison to the centralized scheme. The proposed semantic service discovery network provides a number of novel features to evenly distribute service indexes to the resolvers and reduce the number of resolvers to visit. Our simulation study shows that UbiSearch provides good semantic searchability as compared to the centralized indexing system. At the same time, it supports scalable semantic queries with low communication overhead, balanced load distribution among resolvers for service registration and query processing, and personalized semantic matching.

• Convergence Security Journal
• /
• v.19 no.3
• /
• pp.21-28
• /
• 2019

As the number of websites managed by organizations or organizations increases, so does the number of web application servers and containers. In checking the status of the web service of the web application server and the container, it is very difficult for the person to check the status of the web service after accessing the physical server at the remote site through the terminal or using other accessible software It. Previous research on crawler-related research is hard to find any reference to the processing of data from crawling. Data loss occurs when the crawler accesses the database and stores the data. In this paper, we propose a method to store the inspection data according to crawl - based web application server management without losing data.

• The KIPS Transactions:PartC
• /
• v.10C no.6
• /
• pp.739-746
• /
• 2003

In real life, we frequently use th proxy signatrue by delegating one's own privileges. It is necessary to distribute the data related to privilege delegation securely in order to use such a proxy signature in the Internet. However, inorder to use the secure proxy signature, we need to have some mechanism to prevent a proxy signer from misuse of privileges by applying proxy certificate and a privilege delegation mechanism to manage information with related to privilege delegarion. In addition, we have implemented the prototype to demonstrate the possible proxy signature service using proxy certificate.

• The KIPS Transactions:PartC
• /
• v.10C no.6
• /
• pp.763-768
• /
• 2003

In this paper, we propose a S/KEY based authentication protocol using smart cards to address the vulnerebilities of both the S/KEY authentication protocol and the secure one-time password protpcol which YEH, SHEN and HWANG proposed [1]. Because out protpcel is based on public key, it can authenticate the server and distribute a session key without any pre-shared secret. Also, it can prevent off-line dictionary attacks by using the randomly generated user is stored in the users smart card. More importantly, it can truly achieve the strength of the S/KEY scheme that no secret information need be stored on the server.

• The KIPS Transactions:PartB
• /
• v.10B no.1
• /
• pp.13-20
• /
• 2003

As it increase electronic commerce user rapidly, it is necessary to study on Improvement of performance for electronic commerce system. This paper suggests electronic commerce system using functionally distributed structure based on multi-agent and evaluate it's performance using prototype. In the suggested system, we use multi-agent using combined reasoning to offer a proper commodity information and meet the customer's requirement. And we can reduce load of the electronic commerce system with distribute agents both main server system and local server system functionally. In experiment result, we can confirm suggested electronic commerce system can prevent customer's unexpected long waiting causes by network traffic and server load, and can improve efficiency.

• The KIPS Transactions:PartA
• /
• v.9A no.4
• /
• pp.547-554
• /
• 2002

This paper proposes an efficient dynamic routing algorithm for Multistage Bus Networks(MBN's) in distributed shared memory environment. Our algorithm utilizes extra paths available on MBN and determines routing paths adaptively according to switch traffic in order to distribute traffic among switches. Precisely, a packet is transmitted to the next switch on an extra path having a lighter traffic. As a consequence the proposed algorithm reduces the mean response time and the average number of waiting tasks. The results of simulations, carried out with varying numbers of processors and varying switch sizes, show that the proposed algorithm improves the mean response time by 9% and the average number of waiting tasks by 21.6%, compared to the existing routing algorithms which do not consider extra paths on MBN.