• Industrial Engineering and Management Systems
• /
• v.7 no.2
• /
• pp.171-181
• /
• 2008

Home care, known also as domiciliary care, is part of the community care service that is a responsibility of the local government authorities in the UK as well as many other countries around the world. The aim is to provide the care and support needed to assist people, particularly older people, people with physical or learning disabilities and people who need assistance due to illness to live as independently as possible in their own homes. It is performed primarily by care workers visiting clients' homes where they provide help with daily activities. This paper is concerned with the dispatching of care workers to clients in an efficient manner. The optimized routine for each care worker determines a schedule to achieve the minimum total cost (in terms of distance traveled) without violating the capacity and time window constraints. A collaborative population-based meta-heuristic called Particle Swarm Optimization (PSO) is applied to solve the problem. A particle is defined as a multi-dimensional point in space which represents the corresponding schedule for care workers and their clients. Each dimension of a particle represents a care activity and the corresponding, allocated care worker. The continuous position value of each dimension determines the care worker to be assigned and also the assignment priority. A heuristic assignment scheme is specially designed to transform the continuous position value to the discrete job schedule. This job schedule represents the potential feasible solution to the problem. The Earliest Start Time Priority with Minimum Distance Assignment (ESTPMDA) technique is developed for generating an initial solution which guides the search direction of the particle. Local improvement procedures (LIP), insertion and swap, are embedded in the PSO algorithm in order to further improve the quality of the solution. The proposed methodology is implemented, tested, and compared with existing solutions for some 'real' problem instances.

• Journal of Internet Computing and Services
• /
• v.6 no.5
• /
• pp.11-25
• /
• 2005

In MIPv6 environment, an important design consideration for public key based binding update protocols is to minimize asymmetric cryptographic operations in mobile nodes with constraint computational power, such as PDAs and cellular phones, For that, public key based protocols such as CAM-DH. SUCV and Deng-Zhou-Bao's approach provides an optimization to offload asymmetric cryptographic operations of a mobile node to its home agent. However, such protocols have some problems in providing the optimization. Especially, CAM-DH with this optimization does not unload all asymmetric cryptographic operations from the mobile node, while resulting in the home agent's vulnerability to denial of service attacks. In this paper, we improve the drawbacks of CAM-DH. Furthermore, we adopt Aura's two hash-based CGA scheme to increase the cost of brute-force attacks searching for hash collisions in the CGA method. The comparison of our protocol with other public key based protocols shows that our protocol can minimize the MN's computation overhead, in addition to providing better manageability and stronger security than other protocols.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.35 no.2
• /
• pp.107-114
• /
• 2007

This paper focuses on the performance evaluation of various control allocation methods applied on DURUMI-II UAV system. In order to implement control allocation scheme to aircraft control system, control system can be designed through two step design procedure. The first step is to design a baseline control system for an aircraft without consideration of control surface failure. The second step is to design a control allocator that maps the total control command on the individual control surfaces. In this paper, several control allocation methods such as Psuedo-Inverse CA method, Direct CA method, and Optimization CA method are implemented and integrated to the baseline flight control system of DURUMI-II UAV. The performance of these control allocation methods is evaluated by nonlinear simulation under the flight scenario of control surface failure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9B
• /
• pp.834-844
• /
• 2003

Mobile IP has some performance degrade factors such as triangle routing and packet loss by the hand-off because the original IP was designed for the fixed network. The design goal for the next generation Internet service is to guarantee QoS. So, Mobile IP also should be able to provide the guaranteed QoS with performance enhancement because it is an IP-based mobile Internet service. In this paper, we propose route optimization, smooth hand-off scheme and MIP-LDP(Mobile IP-Label Distribution Protocol) on Mobile IP-over-MPLS framework to enhance the performance of the previously researched Mobile IP-over-MPLS schemes. The proposed framework enhanced long routing path problem and packet loss problem by the hand-off.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.266-274
• /
• 2003

One of the major issues in current on-demand routing protocols for ad hoc networks is the high resource consumed by route discovery traffic. In these protocols, flooding is typically used by the source to broadcast a route request (RREQ) packet in search of a route to the destination. Such network-wide flooding potentially disturbs many nodes unnecessarily by querying more nodes than is actually necessary, leading to rapid exhaustion of valuable network resources such as wireless bandwidth and battery power. In this paper, a simple optimization technique for efficient route discovery is proposed. The technique proposed herein is location-based and can be used in conjunction with the existing Location-Aided Routing (LAR) scheme to further reduce the route discovery overhead. A unique feature of our technique not found in LAR and most other protocols is the selective use of unicast instead of broadcast for route request/query transmission made possible by a novel reuse of routing and location information. We refer to this new optimization as the UNIQUE (UNIcast QUEry) technique. This paper studies the efficacy of UNIQUE by applying it to the route discovery of the Dynamic Source Routing (DSR) protocol. In addition, a comparative study is made with a DSR protocol optimized with only LAR. The results show that UNIQUE could further reduce the overall routing overhead by as much as 58% under highly mobile conditions. With less congestion caused by routing traffic, the data packet delivery performance also improves in terms of end-to-end delay and the number of data packets successfully delivered to their destinations.

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

By estimating probability distributions of the good solutions in the current population, some researchers try to find the optimal solution more efficiently. Particularly, finite mixtures of distributions have a very useful role in dealing with complex problems. However, it is difficult to choose the number of components in the mixture models and merge superior partial solutions represented by each component. In this paper, we propose a new continuous evolutionary optimization algorithm with distribution estimation by variational Bayesian mixtures of factor analyzers. This technique can estimate the number of mixtures automatically and combine good sub-solutions by sampling new individuals with the latent variables. In a comparison with two probabilistic model-based evolutionary algorithms, the proposed scheme achieves superior performance on the traditional benchmark function optimization. We also successfully estimate the parameters of S-system for the dynamic modeling of biochemical networks.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2006.11a
• /
• pp.127-132
• /
• 2006

Quantization in video coding plays an important role in controlling the bit-rate of compressed video bit-streams. It has been used as an important control means to adjust the amount of bit-streams to at]owed bandwidth of delivery networks and storage. Due to the dependent nature of video coding, dependent quantization has been proposed and applied for MPEG-2 video coding to better maintain the quality of reconstructed frame for given constraints of target bit-rate. Since Scalable Video Coding (SVC) being currently standardized exhibits highly dependent coding nature not only between frames but also lower and higher scalability layers where the dependent quantization can be effectively applied, in this paper, we propose a dependent quantization scheme for SVC and compare its performance in visual qualities and bit-rates with the current JSVM reference software for SVC. The proposed technique exploits the frame dependences within each GOP of SVC scalability layers to formulate dependent quantization. We utilize Lagrange optimization, which is widely accepted in R-D (rate-distortion) based optimization, and construct trellis graph to find the optimal cost path in the trellis by minimizing the R-D cost. The optimal cost path in the trellis graph is the optimal set of quantization parameters (QP) for frames within a GOP. In order to reduce the complexity, we employ pruning procedure using monotonicity property in the trellis optimization and cut the frame dependency into one GOP to decrease dependency depth. The optimal Lagrange multiplier that is used for SVC is equal to H.264/AVC which is also used in the mode prediction of the JSVM reference software. The experimental result shows that the dependent quantization outperforms the current JSVM reference software encoder which actually takes a linear increasing QP in temporal scalability layers. The superiority of the dependent quantization is achieved up to 1.25 dB increment in PSNR values and 20% bits saving for the enhancement layer of SVC.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.63-72
• /
• 2005

In this paper, we propose the bit-rate control algorithm for the block based image compression like H.263, H.263+ or MPEG-4. The proposed algorithm is designed to identify the quantization parameter set through the Lagrangian optimization technique based on the well-known linear source model. We set the Lagrangian cost function with the rates and distortion calculated from the linear source model. We calculate the quantization parameter set using the Vitervi algorithm to solve the Lagrangian optimization problem considering the Dquant method of H.263 and MPEG-4. The proposed algorithm improves the video quality by up to 1.5 dB compared with the TMN8 scheme, and is more effective in the video sources with dynamic activities than the consistent quality approaches.

• Journal of Korea Water Resources Association
• /
• v.35 no.4 s.129
• /
• pp.345-358
• /
• 2002

The flow apportioning algorithms with digital elevation models have been developed to reflect reasonable flow divergence properties but they showed several defects related to the connectivity of channel cells, various divergence features along to local topography and channel cells' size etc. Topographic data used by existing flow apportioning algorithms are flow accumulation area and local slope. However, the size and location of channel cells which play the dominant role in the flow pathway were not properly considered. Therefore, a new flow apportioning algorithm considering various flow divergence characteristics in the complicate terrain is proposed. The GA optimization scheme is used to represent the location and scale of the channel pixel. Improved result can be obtained by using both a new flow apportioning algorithm and optimization.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.35 no.9
• /
• pp.1007-1013
• /
• 2011

Because of their high flexibility and durability, multilayer bellows are manufactured for use in commercial vehicles, while single-layer bellows are manufactured for use in passenger vehicles. A study based on the finite element method (FEM) and shape optimization for the single-layer bellows has been actively performed; however, until now, a study based on the FEM has rarely been performed for the multilayer bellows with gaps between the layers. This paper presents a finite-element modeling scheme for the multilayer bellows to improve simulation reliability during the evaluation of stress and flexibility. For performing shape optimization for the multilayer bellows, DOE (design of experiment) and the Kriging metamodel followed by the D-optimal method are used.