• Journal of KIISE:Databases
• /
• v.36 no.2
• /
• pp.123-138
• /
• 2009

In recent years, the web services composition search has become an issue of great interest. The web services composition search is the process of integrating individual web services to yield desired behavior. Through the web services composition search, more sophisticated functionalities can be provided. Current solutions can be classified into three main classes: forward chaining approach, backward chaining approach and two-phase approach. However one-way chaining approaches, such as forward chaining approach and backward chaining approach have limitations of searching irrelevant web services. And two-phase approach has limitations of including redundant web services. In this paper, we propose an unredundant web services composition search based on the two-phase algorithm. The algorithm consists of a forward phase and a backward phase. In the forward phase, the candidate web services participating composition will be found efficiently by searching the Link Index. In the backward phase, unredundant web services compositions will be generated from candidate web services by using the Token Manager. The experimental results show that our proposed algorithm is more efficient than one-way chaining approaches. The experimental results also show that our algorithm can provide more solutions than previous two-phase approach and is comparable to previous one in execution time.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.11
• /
• pp.962-966
• /
• 2001

The major problem at a branch point for point-to-multipoint available bit rate(ABR) services in asynchronous transfer mode (ATM) networks is how to consolidate backward resource management(BRM) cells from each branch for a multicast connection. In this paper, we propose an efficient feedback consolidation algorithm based on an adaptive dynamic threshold(ADT) to eliminate the consolidation noise and the reduce the consolidation delay. The main idea of the ADT algorithm lies in that each branch point estimates the ABR traffic condition of the network through the virtual queue estimation and the transmission threshold of the queue level in branch points is adaptively controlled according to the estimation. Simulation results show that the proposed ADT algorithm can achieve a faster response in congestion status and a higher link utilization compared with the previous works.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.11a
• /
• pp.215-218
• /
• 2004

본 논문은 자산의 메타데이터 편집 시, 자산의 백 워드 링크(backward-link) 파일을 이용하여 동일한 자산(asset)에 링크된 파일들의 메타데이터간 동기화 방법에 관한 것으로서, 본 논문에 따른 방법은, 편집된 메타데이터를 갖는 제 1 자산의 백 워드 링크 정보 파일에 상기 제 1 자산과 동일한 제 2 자산이 존재하는지 체크하고, 백 워드 링크 정보 파일에 제 2 자산이 적어도 하나 존재하면, 제 2 자산의 메타데이터를 제 1 자산의 편집된 메타데이터에 동기화 시키도록 함으로써, 동일한 자산에 링크되어 있는 파일들의 메타데이터를 용이하게 동기 시킬 수 있다.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.59.4-59
• /
• 2001

In this paper, wireless interface of the motion between human and robot is implemented. The idea is that if a human who is equiped with device including accelerometer and rate-gyro sensor move his/her arm, then the robot follows human motion. The robot is designed as wheeled type mobile robot with two link arms. The robot´s basic movements such as forward, backward, left, right movement can be controlled from foot sensor which human steps on. Arm movements can be controlled by arm motion of human motion. In order to detect human motion, sensor data analysis from gyro and accelerometer has to be done. Data from sensors are transferred through wireless communication to activate the robot.

• Journal of KIISE:Information Networking
• /
• v.27 no.1
• /
• pp.98-107
• /
• 2000

This paper compares the performance of feedback consolidation algorithms with or without a fast overload indication function which has been recently proposed in the ATM Forum for multicast ABR (Available Bit Rate) services in ATM networks. We use the performance criteria such as the ACR (Allowed Cell Rate) of a source, queue length at a switch, link utilization, fairness, and BRM (Backward Resource Management) cell overhead. Simulation results show that performance of the feedback consolidation algorithms with a fast overload indication function can be improved sign.ificantly than that of algorithms without this function in terms of ramp-down delay, particularly in initial start-up period or under a severe overload situation. The fast overload indication function can be combined with any feedback consolidation algorithm, whereas its performance is highly dependent on an underlying basic feedback consolidation algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8S
• /
• pp.2608-2619
• /
• 2000

This paper proposes the Handover Scheme for the mobile and describes the result of the performance analysis. In the conventional scheme of handover request, the withdrawal of terminal may occur because handover request is performed based on fixed signal level without considering network load and terminal mobility. The proposed scheme offers the minimization of withdrawal and handover blocking probability by means of the handover request of terminal based on the network load and terminal mobility. Conventional handover scheme has the sequential procedure that network performs resource check and path rerouting on the handover by MT(Mobile Terminal). Proposed handover scheme pre-processes the resource check before the handover request by predicting the handover request timo so that handover latency can be reduced. Moreover, path optimization is executed after the completion of handover in order to reduce handover latency. The rdduction of handover latency prevents the dropping of service by minimizing backward handover blocking. In summary, we propose the prediction of handover request time and decision method based on terminal, validating the performance of proposed scheme considering various cases of simulation.

• Journal of Internet Computing and Services
• /
• v.9 no.4
• /
• pp.21-27
• /
• 2008

TCP receivers deliver ACK packets to senders for reliable end-to-end transfer. When ACK packets are not transferred properly because of network congestion, the performance of TCP degrades. This paper proposes a reverse congestion warning mechanism and a congestion handling mechanism in heterogeneous networks with heavy background traffic in the backward direction. Help from TCP receivers or hardware such as routers and gateways other than the ACK packets themselves is not necessary. TCP senders compare the arrival intervals of ACK data passed from receivers and the difference in t imestamp values echoed by receivers. According to the simulation results using the NS-2 network simulator, the proposed scheme shows a performance elevation of 20% greater than Reno, 150% greater than New Reno, and 450% greater than Westwood, respectively, under heterogeneous networks and that the error rate of the radio link is 1% when the backward network is congested.

• The Journal of the Korea Contents Association
• /
• v.4 no.2
• /
• pp.68-75
• /
• 2004

In this paper, n study a distributed establishment scheme to setup lightpath in WDM/TDM Network considering user traffic characteristics. We propose a GBTA(guaranteed-bandwidth time-slot allocation) algorithm which assigns time-slots according to the requred traffic so that it can utilize given network resources efficiently in RWTA(routing and wavelength time-slot assignment) schemes. We consider traffic specification on the basis of ATM traffic classes. Also, in order to increase link utilization and minimize blocking probability, we extend distributed lightpath establishment protocol based on GBTA algorithm. In order to establish lightpath in distributed WDM/IDM network, we use backward resonation protocol that resewes resource with recent information. We use DOWTns(Distributed Optical WDM/TDM ns) that is extended from NS(Network Simulator), in order to verify proposed GBTA-based optical wavelength routed network.

• Journal of Biosystems Engineering
• /
• v.9 no.2
• /
• pp.48-57
• /
• 1984

To analyze the grain transport velocity, which is valuable for optimizing the separation losses, an oscillating appratus for sieve was designed. The grain transport velocity was measured in each combination of three amplitude levels, three rpm levels and four projection angle levels. To analyze the grain transport velocity theortically, two computer programs were developed. And the results from experiment and theoretical analysis were compared. 1. The grain transport velocity was increased with the projection angle of oscillating sieve. Especially when the projection angle is higher than $45^{\circ}$ the grain transport velocity on the flat-plate was not increased but on the racked surface was increased persistently. 2. The grain transport velocity was increased linearly with the frequency of oscillating motion. The speed of driving link must be higher than 350 rpm at 24mm amplitude, 250 rpm at 36 mm amplitude to transport the grain efficiently. 3. The grain transport velocity was increased with the amplitude of oscillating motion. But if the amplitude was smaller than interval of racks, the grain on the racked surface was not transported, even though the projection angle or the speed of revolutionary link was increased. 4. The transport characteristics of a grain varied with the amplitude and projection angle. Especially in the range of 1.5 < K < 2.3 at $45^{\circ}$ projection angle the transportation of grain was successful and the grain motion consisted of sliding movement (forward, backward) and jumping movement, which is considered recommendable for separating process of a combine sieve. 5. The results from theoretical analysis were approximately in accord with that from experiment.

• Journal of information and communication convergence engineering
• /
• v.12 no.3
• /
• pp.154-160
• /
• 2014

The address resolution protocol (ARP) provides dynamic mapping between two different forms of addresses: the 32-bit Internet protocol (IP) address of the network layer and the 48-bit medium access control (MAC) address of the data link layer. A host computer finds the MAC address of the default gateway or the other hosts on the same subnet by using ARP and can then send IP packets. However, ARP can be used for network attacks, which are one of the most prevalent types of network attacks today. In this study, a new ARP algorithm that can prevent IP spoofing attacks is proposed. The proposed ARP algorithm is a broadcast ARP reply and an ARP notification. The broadcast ARP reply was used for checking whether the ARP information was forged. The broadcast ARP notification was used for preventing a normal host's ARP table from being poisoned. The proposed algorithm is backward compatible with the current ARP protocol and dynamically prevents any ARP spoofing attacks. In this study, the proposed ARP algorithm was implemented on the Linux operating system; here, we present the test results with respect to the prevention of ARP spoofing attacks.