• ETRI Journal
• /
• v.28 no.6
• /
• pp.709-720
• /
• 2006

In this paper, we suggest a simple and efficient multiple-forwarder-based file distribution method which can work with a tree-based application layer multicast. Existing multiple-forwarder approaches require high control overhead. The proposed method exploits the assumption that receivers join a session at different times. In tree-based application layer multicast, a set of data packets is delivered from its parent after a receiver has joined but before the next receiver joins without overlapping that of other receivers. The proposed method selects forwarders from among the preceding receivers and the forwarder forwards data packets from the non-overlapping data packet set. Three variations of forwarder selection algorithms are proposed. The impact of the proposed algorithms is evaluated using numerical analysis. A performance evaluation using PlanetLab, a global area overlay testbed, shows that the proposed method enhances throughput while maintaining the data packet duplication ratio and control overhead significantly lower than the existing method, Bullet.

• ETRI Journal
• /
• v.29 no.4
• /
• pp.445-451
• /
• 2007

An adaptive modulation scheme is presented for multiuser orthogonal frequency-division multiplexing systems. The aim of the scheme is to minimize the total transmit power with a constraint on the transmission rate for users, assuming knowledge of the instantaneous channel gains for all users using a combined bit-loading and subcarrier allocation algorithm. The subcarrier allocation algorithm identifies the appropriate assignment of subcarriers to the users, while the bit-loading algorithm determines the number of bits given to each subcarrier. The proposed bit-loading algorithm is derived from the geometric progression of the additional transmission power required by the subcarriers and the arithmetic-geometric means inequality. This algorithm has a simple procedure and low computational complexity. A heuristic approach is also used for the subcarrier allocation algorithm, providing a trade-off between complexity and performance. Numerical results demonstrate that the proposed algorithms provide comparable performance with existing algorithms with low computational cost.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.7
• /
• pp.1840-1850
• /
• 1994

Enhancement of numerical algorithms for low speed compressible flow will be considered. Contemporary time-marching algorithm has been widely accepted and applied as the method of choice for transonic, supersonic and hypersonic flows. In the low Mach number regime, time-marching algorithms do not fare as well. When the velocity is small, eigenvalues of the system of compressible equations differ widely so that the system becomes very stiff and the convergence becomes very slow. This characteristic can lead to difficulties in computations of many practical engineering problems. In the present approach, the time-derivative preconditioning method will be used to control the eigenvalue stiffness and to extend computational capabilities over a wide range of flow conditions (from very low Mach number to supersonic flow). Computational capabilities of the above algorithm will be demonstrated through computation of a variety of practical engineering problems.

• Journal of Mechanical Science and Technology
• /
• v.15 no.8
• /
• pp.1119-1131
• /
• 2001

In this paper we formulate an optimization based approach to determining the maximally inscribed rectangle in a robots workspace. The size and location of the maximally inscribed rectangle is an effective index for evaluating the size and quality of a robots workspace. Such information is useful for, e. g., optimal worktable placement, and the placement of cooperating robots. For general robot workspaces we show how the problem can be formulated as a constrained nonlinear optimization problem possessing a special structure, to which standard numerical algorithms can be applied. Key to the rapid convergence of these algorithms is the choice of a starting point; in this paper we develop an efficient computational geometric algorithm for rapidly obtaining an approximate solution suitable as an initial starting point. We also develop an improved version of the algorithm of Haug et al. for calculating a robots workspace boundary.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2003.04a
• /
• pp.279-287
• /
• 2003

This paper deals with a comparative study on coupling of Element-free Galerkin(EFG) method and Infinite Element(IE) by IE's shape function. In this study, mapped infinite elements(mapped IE) and decay function infinite elements(decay IE) are coupled with the EFG method. A coupling procedure of EFG-Mapped IE is much easier to be integrated than a coupled EFG-Decay IE. A coupled EFG-IE method used well-defined functions to preserve the continuity and linear consistency on the interface of the EFG region and IE region. Several benchmark problems are solved to verify the effectiveness and accuracy of the coupling algorithms by IE's shape function. The numerical results show that the developed algorithms work well for the elastic problems with infinite boundaries.

• Journal of Magnetics
• /
• v.19 no.3
• /
• pp.266-272
• /
• 2014

In this paper, we suggest reliability as a metric to evaluate the robustness of a design for the optimal design of electromagnetic devices, with respect to constraints under the uncertainties in design variables. For fast numerical efficiency, we applied the sensitivity-assisted Monte Carlo simulation (S-MCS) method to perform reliability calculation. Furthermore, we incorporated the S-MCS with single-objective and multi-objective particle swarm optimization algorithms to achieve reliability-based optimal designs, undertaking probabilistic constraint and multi-objective optimization approaches, respectively. We validated the performance of the developed optimization algorithms through application to the optimal design of a superconducting magnetic energy storage system.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.3
• /
• pp.154-161
• /
• 2010

This paper considers the simultaneously firing model for the artillery operations. The objective of this paper is to find the optimal fire sequence minimizing the final completion time of the firing missions of multiple artillery units for multiple targets. In the problem analysis, we derive several solution properties to reduce the solution space. Moreover, two lower bounds of objective are derived and tested along with the derived properties within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed branch-and-bound and heuristic algorithms are evaluated through various numerical experiments.

• Proceedings of the Korean Society of Medical Physics Conference
• /
• 2005.04a
• /
• pp.79-82
• /
• 2005

In this study, we have tested the feasibility of the convex non-linear objective model and the line search optimization method for the fluence map optimization (FMO). We've created the convex nonlinear objective function with simple bound constraints and attained the optimal solution using well-known gradient algorithms with an Armijo line search that requires sufficient objective function decrease. The algorithms were applied to 10 head-and-neck cases. The numbers of beamlets were between 900 and 2,100 with a 3 mm isotropic dose grid. Nonlinear optimization methods could efficiently solve the IMRT FMO problem in well under a minute with high quality for clinical cases.

• Proceedings of the KSME Conference
• /
• 2003.11a
• /
• pp.1286-1290
• /
• 2003

This paper presents a newly implemented parallel finite element procedure for contact-impact problems. Three sub-algorithms are includes in the proposed parallel contact-impact procedure, such as a parallel Belytschko-Lin-Tsay (BLT) shell element generation, a parallel explicit time integration scheme, and a parallel contact search algorithm based on the master slave slide-line algorithm. The underlying focus of the algorithms is on its effectiveness and efficiency for inclusion in future finite element systems on parallel computers. Throughout this research, a prototype code, named GT-PARADYN, is developed on the IBM SP2, a distributed-memory computer. Some numerical examples are provided to demonstrate the timing results of the procedure, discussing the accuracy and efficiency of the code.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.7 no.3
• /
• pp.34-42
• /
• 1997

This paper presents new fuzzy learning algorithms and their applications to time series prediction. During generating fuzzy rules from numerical data, there is a tendency to produce conflicting rules which have same premise but different consequence. To resolve the problem, we propose MCM(Modified Center Method) which is proven to reduce the error in the prediction. We have applied MCM to the analysis of Mackey-Glass time series and Gas Furnace da.ta to verify its efficiency.