Yunyi Xu · 2020
Maritime surveillance radar can actualize the early warning, monitoring and detection of large-scale sea surface, and is widely used in military and civil fields. Because of the space-time nonstationary characteristics of sea clutter, the traditional target detection method is faced with the problems of low detection probability and high false alarm rate. In order to address these problems, a sea-surface small target detection based on multi-features and support vector classifier dynamic programming track-before-detect algorithm (SVCDP-TBD) is proposed. On the basis of analyzing data set, three separable features-relative average amplitude (RAA), relative Doppler peak height (RPH) and relative Doppler vector entropy (RVE) can be effectively extracted from radar echoes. Then a SVC detection is constructed in the preprocessing stage of DP-TBD algorithm. Experiments expose that the proposed method can effectively detect small floating targets and have a higher correct track rate under low SNR.
Cited by 4
Yunfei Guo, Zebing Zeng, Shangyu Zhao · 2016
In order to detect and track low signal-to-noise-ratio (SNR) targets with multistatic radar, an amplitude association dynamic programming (AADP) based track-before-detect (TBD) fusion algorithm is proposed. First, a new cost function for is constructed. This function uses the relativity of signal amplitude in adjacent frames to detect the low SNR target. Second, considering the spatial diversity, a multistatic tracks fusion technique is used to improve the detection and tracking performance. Simulation results verifies the effectiveness of the proposed method.
Cited by 8
Miller, B., Teichroew, Daniel · 1966
This paper describes an algorithm for finding the optimum value of a decision variable in the standard dynamic programming recurrence equation, when the state is described by one variable and the return function and state transition function are both linear one-to-one functions of the decision variable. The approach has been successfully programmed for a class of dynamic programming problems and has been found to be computationally much faster than searching over a set of possible decision values, even when the Fibonacci search method (the fastest search method available) is used. [Likely published circa 1966.]
Cited by 0Open access
Yazhu Liu, Shanshui Yang, Li Wang et al. · 2018
This paper proposes a dynamic programming algorithm for management of aircraft power supply system, which takes reliability as the optimization goal, and the power supply priority, the basic structure of system and the minimizing of power failure area etc. as constraint conditions. Combining basic concepts of dynamic programming algorithm such as stage, state and performance index etc. with the management of aircraft power supply system and giving them concrete meaning to establish dynamic programming algorithm model for the management. On this basis, a universal and efficient algorithm is constructed to achieve reliable management of aircraft power supply system. Finally, taking the 270V HVDC (High Voltage Direct Current) power system as an example, building the simulation verification platform to verify the correctness and practicability of the algorithm.
Cited by 1
佐賀美 直人, 石川 健太, 宮崎 敏明 · 2014
Cited by 0
Ping‐Hung Chen, Jian–Jiun Ding · 2022 IEEE International Conference on Consumer Electronics (ICCE) · 2022
Dynamic programming (DP) is an effective algorithm to determine the similarity between two sequences. It plays an important role in text comparison, nucleotide sequence alignment, and melody matching. Conventional DP method performs element-to-element or element-to-space comparison and considers only the cases of replacement, deletion, and insertion. In this work, we improve the DP method by performing multiple element comparison. That is, in addition to perform element-wise comparison, we also compare the similarities of element-space to element and space-element to element. Moreover, the global similarity is also adopted to improve the accuracy of DP. Experiments show that, with the proposed algorithm, the accuracy of melody matching can be much improved. It is helpful for improving the performance of the query-by-humming system and applicable to other sequence comparison problems.
Cited by 1
Ziping Zhou, Ge Li, Chang Le Li et al. · Key engineering materials · 2012
Compared with the local algorithm in stereo matching, the high quality disparity space image is calculated by the global algorithm, which is difficult to use in practical application for its long computation time. The dynamic programming is one of the global algorithms with a fast matching speed, but it has strip blemish in matching result. In this paper, a new dynamic programming based method is proposed to accelerate the matching speed and improve the matching quality. Firstly, the color feature of two images are calculated using the Laplacians of Gaussian pyramid algorithm, and the color feature of the image pair obtained are matched. Secondly, the matching points are taken as the ground control points of the scan line, which is cut into several short line segments. Finally, all line segments are matched to obtain the disparity of the scan line. The experimental results show that the matching speed is accelerated greatly with improved disparity image quality
Cited by 0
Omar A. Alzubi, Jafar A. Alzubi, Mohammed Alweshah et al. · Neural Computing and Applications · 2020
Cited by 162
Robert G. Melton · Astrodynamics Conference · 1986
Cited by 0
J. E. Beasley, Buyang Cao · Computers & Operations Research · 1998
Cited by 39
Liu He · 2010
A region based stereo matching algorithm is presented. The presented algorithm uses regions in images as elements for disparity computation,which is different from conventional stereo matching algorithms based on dynamic programming along scan lines. Once the initial disparities are obtained,a multiple seeds based dynamic programming process along the region boundaries of the image improves and refines the imperfect disparities. The experimental results show that the proposed algorithm is fast and effective.
Cited by 0
Shuangquan Liu, Pengcheng Wang, Zifan Xu et al. · Energies · 2023
This study presents a genetic algorithm integrated with dynamic programming to address the challenges of the hydropower unit commitment problem, which is a nonlinear, nonconvex, and discrete optimization, involving the hourly scheduling of generators in a hydropower system to maximize benefits and meet various constraints. The introduction of a progressive generating discharge allocation enhances the performance of dynamic programming in fitness evaluations, allowing for the fulfillment of various constraints, such as unit start-up times, shutdown/operating durations, and output ranges, thereby reducing complexity and improving the efficiency of the genetic algorithm. The application of the genetic algorithm with dynamic programming and progressive generating discharge allocation at the Manwan Hydropower Plant in Yunnan Province, China, showcases increased flexibility in outflow allocation, reducing spillages by 79%, and expanding high-efficiency zones by 43%.
Cited by 3Open access
Tao Feng, Huaguang Zhang, Yanhong Luo et al. · Neurocomputing · 2014
Cited by 11
Wagenknecht, Gudrun, Kaiser, Hans-Jürgen, Sabri, Osama et al. · RWTH Publications (RWTH Aachen) · 2000
Cited by 1
Reza Ahmadian, Man Yue Lam, Yuxuan Liu (15110048) · Cardiff University · 2026
Optimising the operation and design of tidal range schemes is a long standing and critical problem in their design which also affects their financial feasibility. The optimisation process is very time consuming considering its complexity and the number of variables which leads to significant simplifications in the process. Enhancing the efficiency and accuracy of optimisation methods is essential for maximising their energy output. This dataset includes underpinning data which support the approach we propose an efficient tabular dynamic programming for tidal range scheme optimisation by refining the algorithm. Dynamic programming is capable of finding the global optimal solution given that the assumptions used to formulate the optimisation problem are valid. The algorithm refined in this study was tested with two different schemes, namely the West Somerset Lagoon and the North Wales Lagoon in the UK, and demonstrated accurate and efficient prediction of the scheme’s operation. The computational time required by the dynamic programming algorithm was significantly lower than the most promising optimisation approaches used for tidal range schemes, namely Genetic Algorithm, showing potential for real time application. The refined algorithm includes provisions to simulate tidal range schemes with block formulation to account for the fact that turbines and sluice gates are usually installed in different blocks and are subjected to tidal phase differences. Results demonstrate that optimisation including the multi block formulation lead to electricity generation up to 6% more annually. NWL in the file names refer to North Wales Lagoon and WSL refers to West Somerset Lagoon.
Cited by 0Open access
Kamil Khadiev, Liliya Safina · Lobachevskii Journal of Mathematics · 2023
In this paper, we present a quantum algorithm for the dynamic programming approach for problems on directed acyclic graphs (DAGs). The running time of the algorithm is $$O(\sqrt{\hat{n}m}\log\hat{n})$$ , and the running time of the best known deterministic algorithm is $$O(n+m)$$ , where $$n$$ is the number of vertices, $$\hat{n}$$ is the number of vertices with at least one outgoing edge; $$m$$ is the number of edges. We show that we can solve problems that use OR, AND, NAND, MAX, and MIN functions as the main transition steps. The approach is useful for a couple of problems. One of them is computing a Boolean formula that is represented by Zhegalkin polynomial, a Boolean circuit with shared input and non-constant depth evaluation. Another two are the single source longest paths search for weighted DAGs and the diameter search problem for unweighted DAGs.
Cited by 2
Thomas D. Wu · Journal of Computational Biology · 1996
An algorithm called segment-based dynamic programming is described for predicting gene structure from a sequence of genomic DNA. The algorithm explores the space of gene structures that satisfy junctional and frame constraints and finds the gene structure that optimizes the sum of junctional and segmental scoring functions. Junctional constraints specify acceptable sites of initiation, termination, and splicing, whereas frame constraints ensure that the total exon length is a multiple of three and that no in-frame stop codons occur within exons or at exon-exon junctions. By computing over segments, segment-based dynamic programming maintains reading frame and phase information for each segment, it can assemble exons in-frame as well as score them in-frame. The algorithm is used to quantify the computational power of constraints. Experimental results show that frame constraints reduce the size of the search space by several orders of magnitude and that cardinality constraints place an asymptotic limit on the size of the search space. The algorithm is also used to compare the accuracy of different methods for assembly and scoring. A scoring scheme based on fifth-order Markov hexamer frequencies is presented and used in three objective functions, corresponding to in-frame, frame-independent, and frame-maximal scoring strategies. Experimental results show that in-frame assembly improves specificity only slightly over frame-independent assembly, whereas in-frame scoring improves specificity substantially over frame-independent and frame-maximal scoring.
Cited by 11
Quansong Ruan A, Joshua A. Steele B, Michael S. Schwalbach B et al. · 2016
Motivation: A number of community profiling approaches have been widely used to study the microbial community composition and its variations in environmental ecology. Automated Ribosomal Interge-nic Spacer Analysis (ARISA) is one such technique. ARISA has been used to study microbial communities using 16S-23S rRNA interge-nic spacer length heterogeneity at different times and places. Due to errors in sampling, random mutations in PCR amplification, and probably mostly variations in readings from the equipment used to ana-lyze fragment sizes, the data read directly from the fragment analyzer should not be used for down stream statistical analysis. No opti-mal data pre-processing methods are available. A commonly used approach is to bin the reading lengths of the 16S-23S intergenic spacer. We develop a dynamic programming algorithm based bin-ning method for ARISA data analysis which minimizes the overall differences between replicates from the same sampling location and time. Results: In a test example from an ocean time series sampling program, data preprocessing identified several outliers which upon re-examination were found to be due to systematic errors. Clustering analysis of the ARISA from different times based on the dynamic pro-gramming algorithm binned data revealed important features of the biodiversity of the microbial communities. Availability: The algorithm is implemented in a software package and it is available upon request from the corresponding author. Contact:
Cited by 0
Mietha Anditta, Natashya Amartya, Laurens Spits Warnars et al. · 2023
Dynamic programming is a fundamental algorithm that can be found in our daily lives easily. One of the dynamic programming algorithm implementations consists of solving the 0/1 knapsack problem. A 0/1 knapsack problem can be seen from industrial production cost. It is prevalent that a production cost has to be as efficient as possible, but the expectation is to get the proceeds of the products higher. Thus, the dynamic programming algorithm can be implemented to solve the diverse knapsack problem, one of which is the 0/1 knapsack problem, which would be the main focus of this paper. The implementation was implemented using C language. This paper was created as an early implementation algorithm using a Dynamic program algorithm applied to an Automatic Identification System (AIS) dataset.
Cited by 2
Francisco P. M. Oliveira, João Manuel R. S. Tavares, Todd C. Pataky · 2009
Cited by 0