• Smart Structures and Systems
• /
• v.17 no.6
• /
• pp.957-980
• /
• 2016

Structural damage detection (SDD) is a challenging task in the field of structural health monitoring (SHM). As an exploring attempt to the SDD problem, a hybrid self-adaptive Firefly-Nelder-Mead (SA-FNM) algorithm is proposed for the SDD problem in this study. First of all, the basic principle of firefly algorithm (FA) is introduced. The Nelder-Mead (NM) algorithm is incorporated into FA for improving the local searching ability. A new strategy for exchanging the information in the firefly group is introduced into the SA-FNM for reducing the computation cost. A random walk strategy for the best firefly and a self-adaptive control strategy of three key parameters, such as light absorption, randomization parameter and critical distance, are proposed for preferably balancing the exploitation and exploration ability of the SA-FNM. The computing performance of the SA-FNM is evaluated and compared with the basic FA by three benchmark functions. Secondly, the SDD problem is mathematically converted into a constrained optimization problem, which is then hopefully solved by the SA-FNM algorithm. A multi-step method is proposed for finding the minimum fitness with a big probability. In order to assess the accuracy and the feasibility of the proposed method, a two-storey rigid frame structure without considering the finite element model (FEM) error and a steel beam with considering the model error are taken examples for numerical simulations. Finally, a series of experimental studies on damage detection of a steel beam with four damage patterns are performed in laboratory. The illustrated results show that the proposed method can accurately identify the structural damage. Some valuable conclusions are made and related issues are discussed as well.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.9
• /
• pp.315-320
• /
• 2015

In cloud computing, server virtualization supports one or more virtual machines loaded on multiple operating systems on a single physical host server. Migration of a VM is moving the VM running on a source host to another physical machine called target host. A VM live migration is essential to support task performance optimization, energy efficiency and energy saving, fault tolerance and load balancing. In this paper, we propose open source based adaptive VM live migration technique. For this, we design VM monitoring module to decide VM live migration and open source based full-virtualization hypervisor.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.4
• /
• pp.1302-1320
• /
• 2015

In cloud, everything can be provided as a service wherein a large number of users submit their jobs and wait for their services. hus, scheduling plays major role for providing the resources efficiently to the submitted jobs. The brainwave of the proposed ork is to improve user satisfaction, to balance the load efficiently and to bolster the resource utilization. Hence, this paper roposes an Adaptive Multilevel Scheduling System (AMSS) which will process the jobs in a multileveled fashion. The first level ontains Preprocessing Jobs with Multi-Criteria (PJMC) which will preprocess the jobs to elevate the user satisfaction and to itigate the jobs violation. In the second level, a Deadline Based Dynamic Priority Scheduler (DBDPS) is proposed which will ynamically prioritize the jobs for evading starvation. At the third level, Contest Mapping Jobs with Virtual Machine (CMJVM) is roposed that will map the job to suitable Virtual Machine (VM). In the last level, VM Scheduler is introduced in the two-tier VM rchitecture that will efficiently schedule the jobs and increase the resource utilization. These contributions will mitigate job iolations, avoid starvation, increase throughput and maximize resource utilization. Experimental results show that the performance f AMSS is better than other algorithms.

• The KIPS Transactions:PartA
• /
• v.13A no.3 s.100
• /
• pp.211-222
• /
• 2006

The cluster system with shared-nothing storage cannot escape from the problem of skewed request toward specific contents. This paper, therefore, suggests streaming method using MDC (Multiple Description Coding) instead of using single original content; this method is able to cope with skewed request in shared-nothing storage server as well as to continue to provide services in case of the system failure. Also, the system can support adaptive streaming service according to user player type, network status, the load of server, and client.

• Journal of KIISE:Software and Applications
• /
• v.32 no.11
• /
• pp.1099-1110
• /
• 2005

As auctions become popular, developing good agent bidding strategies has been an important focus in agent-based electronic commerce research. Especially for the continuous double auctions where no single dominant strategy is known, the agent bidding strategy has practical significance. This paper introduces an adaptive agent strategy for the countinuous double auction. The central idea is to let the agent figure out at run time when the sophisticated strategy (called the p-strategy) is beneficial and when a simpler strategy is better. Balance between exploration and exploitation is achieved by using a heuristic exploration function that trades off the expected profits and the number of tries of each strategy. We have experimentally evaluated the performance of the adaptive strategy in a wide variety of environments. The experiment results indicate that the adaptive strategy outperforms the plain p-strategy when the p-strategy performs poorly, while it performs similar to the p-strategy when the p-strategy dominates the other simple strategies.

• Journal of Korea Multimedia Society
• /
• v.21 no.5
• /
• pp.592-598
• /
• 2018

In wireless sensor networks where there is no centralized base station, each node has limited transmission range and the multi-hop routing for transmitting data to the destination is the one of the important technical issues. In particular, the wireless sensor network is not powered by external power source but operates by its own battery, so it is required to maximize the network life through efficient use of energy. To balance the power consumption, the residual power based adaptive power control is required in routing protocol. In this paper, we propose a routing protocol that prolongs the network lifetime by balancing the power consumption among the nodes by controlling the transmit power according to the residual power. We evaluate the proposed routing protocol using extensive simulation, and the results show that the proposed routing scheme can balance the power consumption and prolong network lifetime.

• Industrial Engineering and Management Systems
• /
• v.3 no.2
• /
• pp.116-122
• /
• 2004

This paper presents a process plan selection model with multiple objectives. The process plans for all parts should be selected under multiple objective environment as follows: (1) minimizing the sum of machine processing and material handling time of all the parts considering realistic shop factors such as production volume, processing time, machine capacity, and capacity of transfer device. (2) balancing the load between machines. A multiple objective mathematical model is proposed and an evolutionary algorithm with the adaptive recombination strategy is developed to solve the model. To illustrate the efficiency of proposed approach, numerical examples are presented. The proposed approach is found to be effective in offering a set of satisfactory Pareto solutions within a satisfactory CPU time in a multiple objective environment.

• International Journal of Aeronautical and Space Sciences
• /
• v.8 no.1
• /
• pp.129-139
• /
• 2007

In this paper, attitude control laws for simultaneous pointing of multiple spacecrafts are considered under a formation flying scenario. The basic approach lies in adaptive feedback gains using relative attitude information or maneuver time approximation for coordinated attitude control. Each control law is targeted to balancing mean motion or to correcting system response to the slowest satellite. The control gain adaptation is constructed by two approaches. The first one is using variable damping gain to manipulate speed of a fast system response, and the second one uses alternate natural frequency of the system under control. The validity and stability of the proposed approaches are examined analytically and tested through numerical simulations.

• Journal of the Korea Society for Simulation
• /
• v.12 no.4
• /
• pp.51-59
• /
• 2003

Real-Time applications on Grid environment have several problems in terms of resource management addressed as follows; (1) dynamic resource allocation to provide QoS objectives, (2) heterogeneous resources that is different scale, or capacity in same unit, and (3) resource availability, and resource needs. This paper describes the techniques of resource manager (RM) handling above problems to support QoS of dynamic real-time applications on Grid. The contributions of this paper to solve problems are as follows: unification of dynamic resource requirements among heterogeneous hosts, control of resources in heterogeneous environments, and dynamic load balancing/sharing. Our heuristic allocation scheme works not only 257% better than random, 142% better than round robin, and 36.4% better than least load in QoS sensitivity, but also 38.6% better than random, 28.5% better than round robin, and 31.6% better than least load in QoS.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11a
• /
• pp.183-186
• /
• 2002

클러스터는 부하 분산 스케줄링의 방법에 따라서 그 시스템의 성능이 달라진다. 본 논문에서는 클러스터의 한 종류인 LVS에서 제시되었던 RR, WRR, LC, WLC의 부하 분산 스케줄링을 이용하여 시스템의 각종 부하를 처리하는 방법과 클러스터의 각 서버의 성능을 측정하여 부하 분산을 결정하는 ALBM(Adaptive Load Balancing Mechanism) 방식을 비교하였다. 이 성능 평가를 하기 위하여 여러 실험 환경 설정을 하여 다양한 실험을 통하여 비교 분석 하였다. 실험을 통하여 ALMB 이 기존의 여러 스케줄링 방식에 비하여 전체적으로 좋은 성능 결과를 낳았으며 클러스터 서버간의 안정적인 부하 분산이 되는 결과를 얻었다.