• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.93-96
• /
• 2022

DTW can eliminate gaps between sequences of different lengths and find out the similarity of patterns, but due to the time and space complexity, it requires a high computational cost on large datasets. In this paper, we propose a DDTW algorithm that not only reduces computational costs but also has no error in the results. In addition, the algorithm complexity of DTW and DDTW is compared by measuring the computational time according to the length of the sequence. Simulation results show a noticeable reduction in computational time in DDTW compared to DTW.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.4
• /
• pp.15-25
• /
• 2000

In this paper, we introduce a point-to-multipoint minimum cost flow problem with convex and demand splitting. A source node transmits the traffic along the tree that includes members of the point-to-multipoint connection. The traffic is replicated by the nodes only at branch points of the tree. In order to minimize the sum of arc costs, we assume that the traffic demand can be splitted and transmitted to destination nodes along different trees. If arc cost is linear, the problem would be a Steiner tree problem in networks eve though demand splitting is permitted. The problem would be applied in transmitting large volume of traffic from a serve to clients in Internet environments. Optimality conditions of the problem are presented in terms of fair tree routing. The proposed algorithm is a finite terminating algorithm for $\varepsilon$-optimal solution. convergence of the algorithm is obtained under monotonic condition and strict convexity of the cost function. Computational experiences are included.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.14 no.2
• /
• pp.53-66
• /
• 1989

The Public Vehicle Routing Problem (PVRP) is to find the minimum total cost routes of M or less Public-Vehicles to traverse the required arcs(streets) at least once, and return to their starting depot on a directed network. In this paper, first, a mathematical model is formulated as minimal cost flow model with illegal subtour elimination constraints, and with the fixed cost and routing cost as an objective function. Second, an efficient branch and bound algorithm is developed to obtain an exact solution. A subproblem in this method is a minimal cost flow problem relaxing illegal subtour elimination constraints. The branching strategy is a variable dichotomy method according to the entering nonrequired arcs which are candidates to eneter into an illegal subtour. To accelerate the fathoming process, a tighter lower bound of a candidate subproblem is calculated by using a minimum reduced coast of the entering nonrequired arcs. Computational results based on randomly generated networks report that the developed algorithm is efficient.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.13 no.4
• /
• pp.324-335
• /
• 2013

This article presents the design, control, and implementation of a small quad-rotor system under the practical limitation of being cost effective for private use, such as in the cases of control education or hobbies involving radio-controlled systems. Several practical problems associated with implementing a small quad-rotor system had to be taken into account to satisfy this cost constraint. First, the size was reduced to attain better maneuverability. Second, the main control hardware was limited to an 8-bit processor such as an AVR to reduce cost. Third, the algorithms related to the control and sensing tasks were optimized to be within the computational capabilities of the available processor within one sampling time. A small quad-rotor system was ultimately implemented after satisfying all of the above practical limitations. Experimental studies were conducted to confirm the control performance and the operational abilities of the system.

• Journal of the Chungcheong Mathematical Society
• /
• v.28 no.1
• /
• pp.1-12
• /
• 2015

We present a local convergence analysis for inexact Newton-like method in a Banach space under weaker Lipschitz condition. The convergence ball is enlarged and the estimates on the error distances are more precise under the same computational cost as in earlier studies such as [6, 7, 11, 18]. Some special cases are considered and applications for solving nonlinear systems using the Newton-arithmetic mean method are improved with the new convergence technique.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1994.04a
• /
• pp.38-45
• /
• 1994

The general conceptual constitution of structural optimization is formulated. The algorithm using the gradient projection method and design sensitivity analysis is discussed. Examples of minimum-weight design for six-story steel plane frame are taken to illustrate the application of this algorithm. The advantages of this algorithm such as marginal cost and design sensitivity analysis as well as system analysis are explained.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1996.10a
• /
• pp.304-312
• /
• 1996

Concepts, methods and tools for interactive CAD-based concurrent engineering design optimization of mechanical/structural systems and components which are critical in terms of cost development time, functionality and quality, are presented. The emphasis is on implementation of methods and capabilities for the optimization of composite structural system, and the integration of design process and manufacturing process of composite structures into standard CAD-based concurrent engineering environment The optimization of composite fuselage structures are performed under concurrent engineering environment for the example.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1993.10a
• /
• pp.106-112
• /
• 1993

This paper presents the optimum design of reinforced concrete conical shell which is fixed at the base and free at the top. The calculation of stresses is done using the SMAP(Segmented Matrix Analysis Package)program which uses the simple finite element method of analysis. The objective function contains the ratios of the unit cost of reinforcements and formwork to that of concrete. To Simplify the optimization procedure, the final optimum design of conical shell is obtained by combining the result of each element. The results are presented and discussed.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1988.10a
• /
• pp.43-48
• /
• 1988

This paper provides readers with an attempt In applying expert systems to structural engineering. As a demonstrative domain to provide the pontentiality of expert system foundation design is presented. Foundation design can have less formalized phage in the overall design process, particularly during preliminary design. It depends on several factors: the function of the structure and the loads it must carry the subsurface conditions, and the cost of foundation, The expert system in the paper is to be used for determining the type of foundation.

• Nuclear Engineering and Technology
• /
• v.44 no.2
• /
• pp.151-160
• /
• 2012

The advantages for using Monte Carlo methods to analyze full-core reactor configurations include essentially exact representation of geometry and physical phenomena that are important for reactor analysis. But this substantial advantage comes at a substantial cost because of the computational burden, both in terms of memory demand and computational time. This paper focuses on the challenges facing full-core Monte Carlo for keff calculations and the prospects for Monte Carlo becoming a routine tool for reactor analysis.