• International Journal of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.8-13
• /
• 2023

We propose a method for removing interference and noise to estimate target information. In wireless channels, information signals are subject to interference and noise, making it is difficult to accurately estimate the desired signal. To estimate the desired information signal, it is essential to remove the noise and interference from the received signal, extracting only the desired signal. If the received signal noise and interference are not removed, the estimated information signal will have a large error in distance and direction, and the exact location of the target cannot be estimated. This study aims to accurately estimate the desired target in space. The objective is to achieve more presice target estimation than existing methods and enhance target resolution.An estimation method is proposed to improve the accuracy of target estimation. The proposed target estimation method obtains optimal weights using linear constraints and the minimum variance method. Through simulation, the performance of the proposed method and the existing method is analyzed. The proposed method successfully estimated all four targets, while the existing method only estimated two targets. The results show that the proposed method has better resolutiopn and superior estimation capability than the existing method.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.16 no.4
• /
• pp.630-648
• /
• 1992

The minimum weight design for simply-supported isotropic or symmetrically laminated stiffened cylindrical shells subjected to various loads (axial compression or combined loads) is studied by a nonlinear mathematical search algorithm. The minimum weight design in accomplished with the CONMIN optimizer by Vanderplaats. Several types of buckling modes with maximum allowable stresses and strains are included as constraints in the minimum weight design process, such as general buckling, panel buckling with either stingers or rings smeared out, local skin buckling, local crippling of stiffener segments, and general, panel and local skin buckling including stiffener rolling. The approach allows the consideration of various shapes of stiffening members. Rectangular, I, or T type stringers and rectangular rings are used for stiffened cylindrical shells. Several design examples are analyzed and compared with those in the previous literatures. The unstiffened glass/epoxy, graphite/epoxy(T300/5208), and graphite/epoxy aluminum honeycomb cylindrical shells and stiffened graphite/epoxy cyindrical shells under axial compression are analyzed through the present approach.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.3
• /
• pp.81-89
• /
• 2000

The real-time multicast problem is to construct a multicast tree starting from a source node and including multiple destination nodes and that has minimum network cost with delay constraints. It is known that to find a tree of the minimum network cost is the Steiner Tree problem which is NP-complete. In this paper, we propose a genetic algorithm to solve the multicast tree with minimum network cost and the delay constraints. The computational results obtained by comparing an existing algorithm. Kompella algorithm, and the proposed algorithm show that our algorithm tends to find lower network cost on the average than Kompella algorithm does.

• Structural Engineering and Mechanics
• /
• v.15 no.1
• /
• pp.39-52
• /
• 2003

A computer program has been developed for the optimum design of prestressed concrete beams under flexure. Optimum values of prestressing force, tendon configuration, and cross-sectional dimensions are determined subject to constraints on the design variables and stresses. 28 constraints have been used including flexural stresses, cover requirement, the aspect ratios for top and bottom flanges and web part of a beam and ultimate moment. The objective function contains cost of concrete, prestressing force and formwork. Using this function, it is possible to obtain minimum cost design, minimum weight or cross-sectional area of concrete design and minimum prestressing force design. Besides the idealized I-shaped cross-section, which is widely used in literature, a general I-shaped cross-section with eight geometrical design variables are used here. Four examples, one of which is available in the literature and the others are modified form of it, have been solved for minimum cost and minimum cross-sectional area designs and the results are compared. The computer program, which employs modified grid search optimization method, can assist a designer in producing efficient designs rapidly and easily. Considerable savings in computational work are thus made possible.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.3
• /
• pp.159-170
• /
• 1992

The size of time constaints is the critical bottleneck of the Crew Scheduling Problem (CSP). This paper deals with a method to extract the minimum required time constraints by k-shortest path algorithm. These time constraints are added as the "insurance constraints" to avoid the unnecessary tree search, which are very time-consuming procedures, for the integer solutions. The computational results show that the problem size in LP formulation could be reduced by our method.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.1
• /
• pp.78-86
• /
• 1998

This paper presents a numerical method of the minimum-time trajectory planning for a robot manipulator amid obstacles. Each joint displacement is represented by the linear combination of the finite-term quintic B-splines which are the known functions of the path parameter. The time is represented by the linear function of the same path parameter. Since the geometric path is not fixed and the time is linear to the path parameter, the coefficients of the splines and the time-scale factor span a finite-dimensional vector space, a point in which uniquely represents the manipulator motion. The displacement, the velocity and the acceleration conditions at the starting and the goal positions are transformed into the linear equality constraints on the coefficients of the splines, which reduce the dimension of the vector space. The optimization is performed in the reduced vector space using nonlinear programming. The total moving time is the main performance index which should be minimized. The constraints on the actuator forces and that of the obstacle-avoidance, together with sufficiently large weighting coefficients, are included in the augmented performance index. In the numerical implementation, the minimum-time motion is obtained for a planar 3-1ink manipulator amid several rectangular obstacles without simplifying any dynamic or geometric models.

• Steel and Composite Structures
• /
• v.19 no.2
• /
• pp.503-519
• /
• 2015

This paper presents an optimization process using Genetic Algorithm (GA) for minimum weight by selecting suitable standard sections from a specified list taken from American Institute of Steel Construction (AISC). The stress constraints obeying AISC-LRFD (American Institute of Steel Construction-Load and Resistance Factor Design), lateral displacement constraints being the top and inter-storey drift, mid-span deflection constraints for the beams and geometric constraints are considered for optimum design by using GA that mimics biological processes. Optimum designs for three different space frames taken from the literature are carried out first without considering concrete slab effects in finite element analyses for the constraints above and the results are compared with the ones available in literature. The same optimization procedures are then repeated for the case of space frames with composite (steel and concrete) beams. A program is coded in MATLAB for the optimization processes. Results obtained in the study showed that consideration of the contribution of the concrete on the behavior of the floor beams results with less steel weight and ends up with more economical designs.

• Journal of Korea Multimedia Society
• /
• v.10 no.12
• /
• pp.1741-1751
• /
• 2007

The imprecise computation technique ensures that all time-critical tasks produce their results before their deadlines by trading off the quality of the results for the computation time requirements of the tasks. In the imprecise computation, most scheduling problems of satisfying both 0/1 constraints and timing constraints, while the total error is minimized, are NP-complete when the optional tasks have arbitrary processing times. In the previous studies, the reasonable strategies of scheduling tasks with the 0/1 constraints on uniprocessors and multiprocessors for minimizing the total error are proposed. But, these algorithms are all off-line algorithms. Then, in the on-line scheduling, NORA(No Off-line tasks and on-line tasks Ready upon Arrival) algorithm can find a schedule with the minimum total error. In NORA algorithm, EDF(Earliest Deadline First) strategy is adopted in the scheduling of optional tasks. On the other hand, for the task system with 0/1 constraints, NORA algorithm may not suitable any more for minimizing total error of the imprecise tasks. Therefore, in this paper, an on-line algorithm is proposed to minimize total error for the imprecise real-time task system with 0/1 constraints. This algorithm is suitable for the imprecise on-line system with 0/1 constraints. Next, to evaluate performance of this algorithm, a series of experiments are done. As a consequence of the performance comparison, it has been concluded that IOSMTE(Imprecise On-line Scheduling to Minimize Total Error) algorithm proposed in this paper outperforms LOF(Longest Optional First) strategy and SOF(Shortest Optional First) strategy for the most cases.

• International Journal of Aeronautical and Space Sciences
• /
• v.16 no.2
• /
• pp.264-277
• /
• 2015

This article investigates various transcription techniques for the Legendre pseudospectral (PS) method to compare the pros and cons of each approach. Eight combinations from four different types of collocation points and two discretization methods for dynamic constraints, which differentiate Legendre PS transcription techniques, are implemented to solve a carefully selected test set of nonlinear optimal control problems (NOCPs). The convergence property and prediction accuracy are compared to provide a useful guideline for selecting the best combination. The tested NOCPs consist of the minimum time, minimum energy, and problems with state and control constraints. Therefore, the results drawn from this comparative study apply to the solution of similar types of NOCPs and can mitigate much debate about the best combinations. Additionally, important findings from this study can be used to improve the numerical efficiency of the Legendre PS methods. Three PS applications to the aerospace engineering problems are demonstrated to prove this point.

• Proceedings of the KIEE Conference
• /
• 2005.11b
• /
• pp.356-358
• /
• 2005

This paper evaluates minimum and maximum power exchange considering economic and technical characteristics between Russia and ROK. First, we evaluate minimum power exchange to assure the economic feasibility by comparison with the total cost and benefit of the interconnected line. For evaluating maximum exchange power, system constraints are considered, which are examined through load flow and dynamic analysis by using the PSS/E program. As a result of these evaluations, we suggest the reasonable range of power exchange between ROK and Russia considering economic and technical constraints with the interconnection scenario that power system interconnection between ROK and Russia will be realized in the year 2010.