• 산업경영시스템학회지
• /
• 제35권2호
• /
• pp.57-63
• /
• 2012

소프트웨어 개발에 있어서 소프트웨어를 시장에 출시하는 계획을 수립하는 것은 소프트웨어를 이루고 있는 기능들을 구현하는 데 제약이 되는 조건들(기술, 자원, 위험, 예산 등)을 만족하면서 계획된 출시기간에 이들 기능들을 할당하는 일이다. 이와 같이 소프트웨어 출시를 계획하는 것은 소프트웨어 제품라인에 대해서 고려할 때 더욱 복잡해진다. 본 연구에서는 소프트웨어 제품라인에 있어서 소프트웨어 출시 계획을 수립하기 위한 문제를 우선순위 제약하의 다수 0-1 배낭문제로 수리 모형화하고, 이를 풀기 위한 최적해법이 개발된다. 최적해법은 동적 계획법이 주가 되고, 문제의 크기를 줄이기 위하여 휴리스틱과 축소방법이 이용된다.

• International Journal of Computer Science & Network Security
• /
• 제24권2호
• /
• pp.15-24
• /
• 2024

One of the most significant issues in combinatorial optimization is the classical NP-complete conundrum known as the 0/1 Knapsack Problem. This study delves deeply into the investigation of practical solutions, emphasizing two classic algorithmic paradigms, brute force, and dynamic programming, along with the metaheuristic and nature-inspired family algorithm known as the Genetic Algorithm (GA). The research begins with a thorough analysis of the dynamic programming technique, utilizing its ability to handle overlapping subproblems and an ideal substructure. We evaluate the benefits of dynamic programming in the context of the 0/1 Knapsack Problem by carefully dissecting its nuances in contrast to GA. Simultaneously, the study examines the brute force algorithm, a simple yet comprehensive method compared to Branch & Bound. This strategy entails investigating every potential combination, offering a starting point for comparison with more advanced techniques. The paper explores the computational complexity of the brute force approach, highlighting its limitations and usefulness in resolving the 0/1 Knapsack Problem in contrast to the set above of algorithms.

• 한국경영과학회지
• /
• 제22권3호
• /
• pp.81-98
• /
• 1997

Given a rooted tree T with profits and node demands, the capacitated subtree of a tree problem (GSTP) consists of finding a rooted subtree of maximum profit, subject to having total demand no larger than the given capacity H. We first define the so-called critical item for CSTP and find an upper bound on the optimal value of CSTP in O(n$^{2}$) time, where n is the number of nodes in T. We then present our branch and bound algorithm for solving CSTP and illustrate the algiruthm by using an example. Finally, we implement our branch-and-bound algorithm and compare the computational results with those for both CPLEX and a dynamic programming algorithm. The comparison shows that our branch-and-bound algorithm performs much better than both CPLEX and the dynamic programming algorithm, where n and H are the range of [50, 500] and [5000, 10000], respectively.

• 전자공학회논문지B
• /
• 제28B권9호
• /
• pp.703-711
• /
• 1991

In this paper, an efficient storage reclamation algorithm for RISC parallel processing in the object orented programming environments is presented. The memory management for the dynamic memory allocation and the frequent memory access in object oriented programming is the main factor that decreases RISC parallel processing performance. The proposed algorithm can be efficiently allocated the memory space of RISCy computer which is required the frequent memory access, so it can be increased RISC parallel processing performance. The proposed algorithm is verified the efficiency by implementing C language on SUN SPARC(4.3 BSD UNIX).

• Journal of Electrical Engineering and Technology
• /
• 제11권2호
• /
• pp.329-337
• /
• 2016

With the increasing deployment of distributed generators in the distribution system, a very large search space is required when dynamic programming (DP) is applied for the optimized dispatch schedules of voltage and reactive power controllers such as on-load tap changers, distributed generators, and shunt capacitors. This study proposes a new optimal voltage and reactive power scheduling method based on dynamic programming with a heuristic searching space reduction approach to reduce the computational burden. This algorithm is designed to determine optimum dispatch schedules based on power system day-ahead scheduling, with new control objectives that consider the reduction of active power losses and maintain the receiving power factor. In this work, to reduce the computational burden, an advanced voltage sensitivity index (AVSI) is adopted to reduce the number of load-flow calculations by estimating bus voltages. Moreover, the accumulated switching operation number up to the current stage is applied prior to the load-flow calculation module. The computational burden can be greatly reduced by using dynamic programming. Case studies were conducted using the IEEE 30-bus test systems and the simulation results indicate that the proposed method is more effective in terms of saving electric charges and improving the voltage profile than loss minimization.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.503-506
• /
• 1996

An integrated Robot control system for SCARA robot is developed. The system consists of an off-line programming(OLP), software and a robot controller using four digital signal processor(TMS32OC50). The OLP has functions of teaching task, dynamic simulator, three dimensional animation, and trajectory planning. To develop robust dynamic control algorithm, a new sliding mode control algorithm for the robot is proposed. The trajectory tracking performance of these algorithm is evaluated by implementing to SCARA robot(SM5 type) using DSP controller which has conventional PI-FF control algorithm. To make SCARA robot operate according to off-line teaching, an interface between OLP and robot controller in the integrated system is designed. To demonstrate performance of the integrated system, the proposed control algorithm is applied to the system.

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 2001년도 기술교육위원회 창립총회 및 학술대회 의료기기전시회
• /
• pp.23-27
• /
• 2001

Making the safety situation from the various work system is very important in the industrial fields. The proposed neural network technique is the real titre computation method based theory of inter-node diffusion for searching the safety distances from the sudden appearance-objests during the work driving. The main steps of the distance computation using the theory of stereo vision like the eyes of man is following steps. One is the processing for finding the corresponding points of stereo images and the other is the interpolation processing of full image data from nonlinear image data of obejects. All of them request much memory space and titre. Therefore the most reliable neural-network algorithm is drived for real time recognition of obejects, which is composed of a dynamic programming algorithm based on sequence matching techniques. And the real time reconstruction of nonlinear image information is processed through several simulations. I-D LIPN hardware has been composed, and the real time reconstruction is verified through the various experiments.

• Journal of Forest and Environmental Science
• /
• 제24권3호
• /
• pp.143-149
• /
• 2008

We conduct economic analysis of the snow damage on sugi (Cryptomeria japonica) forest stands in Toyama Prefecture, Japan. We utilize a single tree and distant independent growth simulator called "Silv-Forest." With this growth simulator, we developed an optimization model by dynamic programming, called DP-Silv (Dynamic Programming Silv-Forest). The MS-PATH (multiple stage projection alternative technique) algorithm was embedded as a searching algorithm of dynamic programming. The height / DBH ratio was used to constrain the thinning regime for snow damage protection. The optimal rotation age turned out to be 65 years for the non-restricted case, while it was 50 years for the restricted case. The difference in NPV of these two cases as the induced costs ranged from 179,867 to 1,910,713yen/ha over the rotation age of 20 to 75 years. Under the optimal rotation of 65 years, the cost became 914,226 yen/ha. The estimated annual payment based on the difference in NPV, was from 9,869 yen/ha/yr to 85,900 yen/ha/yr. All in all, 10,000 yen/ha/yr to 20,000 yen/ha/yr seems to cover the payment from the rotation age of 35 to 75 years.

• Journal of Information Processing Systems
• /
• 제18권1호
• /
• pp.97-114
• /
• 2022

Interest is increasing in electrocardiogram (ECG) signal analysis for embedded devices, creating the need to develop an algorithm suitable for a low-power, low-memory embedded device. Linear approximation of the ECG signal facilitates the detection of fiducial points by expressing the signal as a small number of vertices. However, dynamic programming, a global optimization method used for linear approximation, has the disadvantage of high complexity using memoization. In this paper, the calculation area and memory usage are improved using a linear approximated template. The proposed algorithm reduces the calculation area required for dynamic programming through local optimization around the vertices of the template. In addition, it minimizes the storage space required by expressing the time information using the error from the vertices of the template, which is more compact than the time difference between vertices. When the length of the signal is L, the number of vertices is N, and the margin tolerance is M, the spatial complexity improves from O(NL) to O(NM). In our experiment, the linear approximation processing time was 12.45 times faster, from 18.18 ms to 1.46 ms on average, for each beat. The quality distribution of the percentage root mean square difference confirms that the proposed algorithm is a stable approximation.

• 전자공학회논문지S
• /
• 제34S권6호
• /
• pp.11-20
• /
• 1997

This paper proposes a modified dynamic programming for finding the correspondence between right and left images. A dynamic programming is based on the intensity of images for stereo matching. But htis method is intended to mismatch at uniformed intensity region. To reduce thd mismatching, the stereo images are segmented to various regions with respective uniform intensity, and the different cost function has applied to the segmented region during the dynamci programming. Cost function costains jump cost. And jump cost included two parameter .alpha. and .beta. which have influence on minimum cost path. Experimental results show that the 3D shape of some stereo pairs cna be finely obtained by this proposed algorithm.