• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.2
• /
• pp.107-116
• /
• 2016

Industrial robots have been usually controlled using text-based programming languages provided by each manufacturer with its button-based TP(Teaching Pendent) terminal. Unfortunately, when we consider that people who manipulate TPs in manufacturing sites are mostly unskilled with no background knowledge about computer programming, these text-based programming languages using button-based interaction on manufacturing sites are too difficult for them to learn and use. In order to overcome the weaknesses of the text-based programming language, we propose a visual programming language that can be easily used on gesture-enabled devices. Especially, in our visual programming environment, each command is represented as a block and robots are controlled by stacking those blocks using drag-and-drop gestures, which is easily learnable even by beginners. In this paper, we utilize a widely-spread device, Tablet PC as the gesture-enabled TP. Considering that Tablet PC has limited display space in contrast to PC environments, we designed different kinds of sets of command blocks and conducted user tests. Based on the experiment results, we propose an effective set of command blocks for Tablet PC environment.

• The KIPS Transactions:PartA
• /
• v.15A no.4
• /
• pp.227-238
• /
• 2008

Recently, as network environment has broadened, the demands on VOD have been increased. The VOD services can be categorized into two types, RVOD and NVOD. Practical VOD services adopt one of them exclusively. Since a method using only one of RVOD and NVOD is not able to deal with frequently variable demand of clients, it leads to a result of overload on a server and a waste of server bandwidth. The efficiency of the network resource usage becomes lower. Hence this paper presents a study on the protocol for efficient VOD services. We propose a new protocol appliable for the existing VOD service algorithm, analyze its performance through simulation, and developed server/client systems applying the new protocol. We propose a mode switching protocol combined with protocols used in RVOD and NVOD. The proposed protocol is not able only to control both RVOD and NVOD but also to change the mode between RVOD and NVOD. As a result of using the proposed protocol to meet frequently variable demand, server bandwidth can be used efficiently. Especially, it can be applied to the existing VOD service algorithms. Therefore, we expect that the proposed protocol in this paper will be widely used in emerging VOD markets.

• The KIPS Transactions:PartA
• /
• v.15A no.4
• /
• pp.199-210
• /
• 2008

A Clustering based wireless internet proxy server needs a layer-7 load balancer with URL hashing methods to reduce the total storage space for servers. Layer-4 load balancer located in front of server cluster is to distribute client requests to the servers with the same contents at transport layer, such as TCP or UDP, without looking at the content of the request. Layer-7 load balancer located in front of server cluster is to parse client requests in application layer and distribute them to servers based on different types of request contents. Layer 7 load balancer allows servers to have different contents in an exclusive way so that it can minimize the total storage space for servers and improve overall cluster performance. However, its scalability is limited due to the high overhead of parsing requests in application layer as different from layer-4 load balancer. In order to overcome its scalability limitation, in this paper, we propose a distributed layer-7 load balancer by replacing a single layer-7 load balancer in the conventional scheme by a single layer-4 load balancer located in front of server cluster and a set of layer-7 load balancers located at server cluster. In a clustering based wireless internet proxy server, we implemented the conventional scheme by using KTCPVS(Kernel TCP Virtual Server), a linux based layer-7 load balancer. Also, we implemented the proposed scheme by using IPVS(IP Virtual Server), a linux-based layer-4 load balancer, installing KTCPVS in each server, and making them work together. We performed experiments using 16 PCs. Experimental results show scalability and high performance of the proposed scheme, as the number of servers grows, compared to the conventional scheme.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.281-288
• /
• 2008

Recently, the advance of multimedia hardware has fostered the development of wireless multimedia sensor network which is able to ubiquitously obtain multimedia content such as image or audio from the environment. The multimedia data which has several characteristics such as large size and correlation between the data requires reliability in transmission. However, the existing solution which take the focus on the efficiency of network mainly, is not appropriate to transmit the multimedia data. In the paper, we proposes a reliable asynchronous image transfer protocol, RAIT. RAIT applies double sliding window method in node-to-node image tansfer to prevent the packet loss caused by network congestion. The double sliding window consists of one sliding window for the receiving queue, which is used for prevention of packet loss caused by communication failure between nodes and the other sliding window for the sending queue which prevents the packet loss caused by network congestion. the routing node prevents the packet loss and guarantees the fairness between the nodes by scheduling the packets based on the image non-preemptively. The RAIT implements the double sliding window method by cross layer design between RAIT layer, routing layer, and queue layer. The experiment shows that RAIT guarantees the reliability of image transmission compared with the existing protocol.

• The KIPS Transactions:PartB
• /
• v.15B no.3
• /
• pp.197-204
• /
• 2008

It is well known that the tracking a certain person is a vary needed technic in the humanoid robot. In robot technic, we should consider three aspects that is cloth color matching, face recognition and motion analysis. Because a robot technic use some sensors, it is many different with the robot technic to track a certain person through the CCTV images. A system speed should be fast in CCTV images, hence we must have small calculation numbers. We need the statistical variable for color matching and we adapt the eigen-face for face recognition to speed up the system. In this situation, motion analysis have to added for the propose of the efficient detecting system. But, in many motion analysis systems, the speed and the recognition rate is low because the system operates on the all image area. In this paper, we use the moving energy only on the face area which is searched when the face recognition is processed, since the moving energy has low calculation numbers. When the proposed algorithm has been compared with Girondel, V. et al's method for experiment, we obtained same recognition rate as Girondel, V., the speed of the proposed algorithm was the more faster. When the LDA has been used, the speed was same and the recognition rate was better than Girondel, V.'s method, consequently the proposed algorithm is more efficient for tracking a certain person.

• The KIPS Transactions:PartD
• /
• v.15D no.5
• /
• pp.713-720
• /
• 2008

Fingerprinting scheme uses digital watermarks to trace originator of unauthorized or pirated copies, however, multiple users may collude and escape identification by creating an average or median of their individually watermarked copies. Previous research works are based on ACC (anti-collusion code) for identifying each user, however, ACC are shown to be resilient to average and median attacks, but not to LCCA and cannot support large number of users. In this paper, we propose a practical SACC (scalable anti-collusion code) scheme and its angular decoding strategy to support a large number of users from basic ACC (anti-collusion code) with LCCA (linear combination collusion attack) robustness. To make a scalable ACC, we designed a scalable extension of ACC codebook using a Gaussian distributed random variable, and embedded the resulting fingerprint using human visual system based watermarking scheme. We experimented with standard test images for colluder identification performance, and our scheme shows good performance over average and median attacks. Our angular decoding strategy shows performance gain over previous decoding scheme on LCCA colluder set identification among large population.

• The KIPS Transactions:PartD
• /
• v.15D no.5
• /
• pp.705-712
• /
• 2008

Recently, interests in the notion of PKMS(Process based on Knowledge Management System) utilizing BPMS(Business Process Management System) and KMS(Knowledge Management System) have been significantly increased. Specially, most public organizations require their own effective knowledge management strategies since public business service needs various knowledge types. Based on a comprehensive framework that reflects lifecycle requirements of KMS and BPMS, we propose an PKMS system architecture, which performs step-by-step knowledge-providing strategy in public organization. To propose a PKMS architecture, this paper first investigates inter-relationships between public business and various knowledge types, and classifies knowledge types into three groups and then we suggest knowledge management strategies considering priority order among knowledge groups. Based on the proposed knowledge management, a PKMS system architecture can combine the advantages of the KM and BPM paradigms. This paper presents the PKMS system applied to employment insurance business part in real environment and demonstrated the advantages via inter-relationships between KM and BPM requirements.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.273-280
• /
• 2008

In WSN(Wireless Sensor Network) many routing algorithms such as LEACH, PEGASIS and PEDEP consisting of sensor nodes with limited energy have been proposed to extend WSN lifetime. Under the assumption of perfect fusion, these algorithms used convergecast that periodically collects sensed data from all sensor nodes to a base station. But because these schemes studied less energy consumption for a convergecast as well as fairly energy consumption altogether, the minimum energy consumption for a convergecast was not focused enough nor how topology influences to energy consumption. This paper deals with routing topology and energy consumption for a single convergecast in the following ways. We chose major WSN topology as MSC(Minimum Spanning Chain)s, MSTs, PEGASIS chains and proposed LECSEN chains. We solved the MSC length by Linear Programming(LP) and propose the LECSEN chain to compete with MST and MSC. As a result of simulation by Monte Carlo method for calculation of the topology length and standard deviation of link length, we learned that LECSEN is competitive with MST in terms of total energy consumption and shows the best with the view of even energy consumption at the sensor nodes. Thus, we concluded LECSEN is a very useful routing topology in WSN.

• The KIPS Transactions:PartD
• /
• v.16D no.5
• /
• pp.715-728
• /
• 2009

The Enterprise Service Bus based on Java Business Integration is an web service standard and one of the methods for implementing distribution channels of Service Oriented Architecture. Consisting of open source group, extensive venders and users, the ESB based JBI has the problems of ineffectiveness as well as advantages of extensibility of service plug-in. That is, in case users need to use Service plug-in, manual connection of packaging process and sequential distribution method is required. This study, therefore, proposes as a way of trouble-shooting the user-oriented component deployment tool which can manage entire process for deploying The ESB middleware platform to Service unit. At the same time, this study elicited the requirements based on issues of JBI-based ESB and has developed the modeling property, packaging, distribution and evaluation thru Schema analysis of JBI-compatible component. Using the deployment tool this study proposed, users will be able to perform and manage the whole deploying process without additional manual work for connecting component. Not only it is expected that interface based on Graphic User Interface provide usability and convenience but they can also minimize the errors rate through component and route validity verification function provided in deployment tool.

• The KIPS Transactions:PartD
• /
• v.16D no.2
• /
• pp.273-280
• /
• 2009

Today, many services and products that used to be only provided on offline have been being provided on the web according to the improvement of computing environment and the activation of web usage. These web-based services and products tend to be provided to customer by customer's preferences. This paradigm that considers customer's opinions and features in selecting is called personalization. The related research field is a recommendation. And this recommendation is performed by recommender system. Generally the recommendation is made from the preferences and tastes of customers. And recommender system provides this recommendation to user. However, the recommendation techniques have a couple of problems; they do not provide suitable recommendation to new users and also are limited to computing space that they generate recommendations which is dependent on ratings of products by users. Those problems has gathered some continuous interest from the recommendation field. In the case of new users, so similar users can't be classified because in the case of new users there is no rating created by new users. The problem of the limitation of the recommendation space is not easy to access because it is related to moneywise that the cost will be increasing rapidly when there is an addition to the dimension of recommendation. Therefore, I propose the solution of the recommendation problem of new user and the usage of item quality as weight to improve the accuracy of recommendation in this paper.