ε-approximate spatial-window aggregation algorithm in wireless sensor networks by Jing GAO, Jian-zhong LI, Yu LIU

“…An efficient ε-approximate spatial-window aggregate query processing technique was proposed to approximate aggregate values over arbitrary regions with arbitrary accuracy.A dynamic programming algorithm was devised to compute minimum number of data to refine approximate summation to reach arbitrary accuracy.The proposed algorithm was efficient to compute minimum/maximum values by only transmitting values promising to be in the exact results in order to reduce energy consumption.The experiment using real-world data demonstrates that the algorithms provide high quality results in arbitrary region and reach arbitrary accuracy with low energy cost.…”
Get full text

Uplink scheduling scheme for cloud service based on software-defined wireless network by Su PAN, Bang XIAO, Yu-qing CHEN, Sheng-mei LIU

“…The scheme first solved the resource allocation problem by using the binary integer programming method, and then calculated the optimal transmission rate of cloud services in each time slot using the method of dynamic programming, finally adjusted the transmission rate of cloud services proportional to the current channel status using QoS control method in the framework of SDWN. …”
Get full text

Fixed Point Results on Closed Ball in Convex Rectangular b−Metric Spaces and Applications by Chaobo Li, Yunan Cui, Lili Chen

“…We also study well posedness of fixed point problems of some mappings in convex rectangular b−metric spaces, and an application to the dynamic programming is entrusted to manifest the viability of the obtained results. …”
Get full text

Research on discovering multi-step attack patterns based on clustering IDS alert sequences by MEI Hai-bin1, GONG Jian1, ZHANG Ming-hua2

“…A method of discovering multi-step attack patterns from alert data was studied.Alert similarity function was defined to construct the set of attack activity sequences.Sequence alignment technology was used to cluster the similar attack activity sequences.Multi-step attack patterns in a cluster were automatically discovered by the longest common subsequence extraction algorithm based on the idea of dynamic programming.The proposed method didn’t depend on large amounts of prior knowledge.Few configuration parameters were needed and it was easy to implement.Experimental results demonstrate the effectiveness of proposed method.…”
Get full text

The Capacity Expansion Path Problem in Networks by Jianping Li, Juanping Zhu

“…For the minimum number arc capacity expansion path problem (MN-CEP), we give a strongly polynomial algorithm based on the dynamic programming. For the minimum-cost capacity expansion shortest path problem (MCESP), we give a strongly polynomial algorithm by constructing a shortest paths network.…”
Get full text

Asymptotic Optimality and Rates of Convergence of Quantized Stationary Policies in Continuous-Time Markov Decision Processes by Xiao Wu, Yanqiu Tang

“…This paper is concerned with the asymptotic optimality of quantized stationary policies for continuous-time Markov decision processes (CTMDPs) in Polish spaces with state-dependent discount factors, where the transition rates and reward rates are allowed to be unbounded. Using the dynamic programming approach, we first establish the discounted optimal equation and the existence of its solutions. …”
Get full text

Dynamic Modeling and Analysis of Micro-Video Teaching System Based on Cloud Computing in College English Teaching by Ying Chen

“…How to cultivate talented person who meets the needs of society lied in the comprehensive ability of teaching in colleges and universities, so the college English education professional grammar teaching model is studied based on dynamic programming algorithm. After a brief overview of the dynamic rule algorithm, an algorithm for evaluating English grammar learning in colleges and universities is designed by using dynamic algorithm. …”
Get full text

Joint energy efficiency and spectral efficiency optimization algorithm for UDN under the restriction of interference threshold and backhaul capacity by Xuanli WU, Xu CHEN

“…Aiming at the scenarios which consider the constraint of backhaul capacity restriction and interference threshold in ultra-dense networks (UDN),an integer linear programming (ILP) and Lagrangian dual decomposition (LDD) based joint optimization algorithm of energy efficiency and spectrum efficiency was proposed.In the proposed algorithms,the user association problem with the constraint of limited backhaul capacity was modelled as an ILP problem and then finished the connection between the user and the base station of microcell by solving this problem with dynamic programming method.Therefor,Lagrangian dual decomposition (LDD) was applied in an iteration algorithm for spectrum resource allocation and power allocation.The simulation results show that compared with traditional schemes,the proposed algorithm can significantly improve the energy efficiency and spectrum efficiency of system and use the microcell’s load capacity more efficiently.…”
Get full text

Robust Trajectory Tracking of Uncertain Systems via Adaptive Critic Learning by Ziliang Zhao, Qinglin Zhu, Bin Guo

“…This study develops an adaptive dynamic programming (ADP) scheme for uncertain systems to achieve the robust trajectory tracking. …”
Get full text

Backward Stochastic Differential Equations Coupled with Value Function and Related Optimal Control Problems by Tao Hao, Juan Li

“…We get the related dynamic programming principle (DPP) with the help of the stochastic backward semigroup which was introduced by Peng in 1997. …”
Get full text

Formulation and Analysis of Patterns in a Score Matrix for Global Sequence Alignment by James Owusu Asare, Justice Kwame Appati, Kwaku Darkwah

“…The general algorithm associated with global sequence alignment is the dynamic programming algorithm of Needleman and Wunsch. In this paper, patterns are exploited in the score matrix of the Needleman–Wunsch algorithm. …”
Get full text

Optimal Reinsurance-Investment Problem for an Insurer and a Reinsurer with Jump-Diffusion Process by Hanlei Hu, Zheng Yin, Xiujuan Gao

“…The surplus process is assumed to follow a jump-diffusion process and the insurer is permitted to purchase proportional reinsurance from the reinsurer. Applying dynamic programming approach and dual theory, the corresponding Hamilton-Jacobi-Bellman equations are derived and the optimal strategies for exponential utility function are obtained. …”
Get full text

Optimization of the Aedes aegypti Control Strategies for Integrated Vector Management by Marat Rafikov, Elvira Rafikova, Hyun Mo Yang

“…The solution of the optimization control problem is based on the ideas of the Dynamic Programming and Lyapunov Stability using State-Dependent Riccati Equation (SDRE) control method. …”
Get full text

Nonzero-Sum Stochastic Differential Game between Controller and Stopper for Jump Diffusions by Yan Wang, Aimin Song, Cheng-De Zheng, Enmin Feng

“…This game is studied in a jump diffusions setting within Markov control limit. By a dynamic programming approach, we give a verification theorem in terms of variational inequality-Hamilton-Jacobi-Bellman (VIHJB) equations for the solutions of the game. …”
Get full text

Dynamic Mean-Variance Model with Borrowing Constraint under the Constant Elasticity of Variance Process by Hao Chang, Xi-min Rong

“…Secondly, we use dynamic programming principle to get the Hamilton-Jacobi-Bellman (HJB) equation for the value function, which is a more sophisticated nonlinear second-order partial differential equation. …”
Get full text

Node heterogeneous degree-based consistency maintenance method for unstructured overlay networks by YANG Lei, LI Ren-fa, HU Yi-ming, LI Ken-li

“…Replica strong consistency maintenance for unstructured overlay networks was studied.Current replica consistency maintenance algorithms was summarized,and a novel replica consistency maintenance algorithm:node heterogeneous degree-based of consistency maintenance algorithm（NHDCOM） was proposed.NHDCOM denoted the replica node capability by node heterogeneous degree（NHD）.It managed replica nodes using Chord protocol and collected those nodes NHD along with a replica heterogeneous degree collection tree（HDCT） built through the finger table-based ring partition method.Moreover,a replica update problem model was abstracted in NHDCOM,and then a minimum delay update-content tree algorithm based on dynamic programming method was proposed to improve the update speed.Theoretical analysis and simulation results demonstrate that this method is more efficient in maintaining strong replica consistency and updating replica nodes for unstructured overlay network systems.…”
Get full text

Active Mode Switching Control Strategy of Hybrid Electric Vehicle based on Identification of Road Gradient by Ming Ye, Xiangyu Gongye, Zhihong Zhu, Wenlei Wei

“…On the basis of determining the working mode first，taking the minimum fuel consumption as the objective function，the optimal torque allocation is carried out in real time with dynamic programming algorithm. On the premise of economy，the hybrid power system can achieve the shift gear at the uphill moment to meet the needs of driver's power performance and drivability.…”
Get full text

Viscosity Solution of Mean-Variance Portfolio Selection of a Jump Markov Process with No-Shorting Constraints by Moussa Kounta

“…In fact, the value function V often does not have the smoothness properties needed to interpret it as a solution to the dynamic programming partial differential equation in the usual (classical) sense; however, in such cases V can be interpreted as a viscosity solution. …”
Get full text

Optimal Asset Allocation for CRRA and CARA Insurers under the Vasicek Interest Rate Model by Hanlei Hu, Shaoyong Lai, Hongjing Chen

“…Stochastic control theory and dynamic programming principle are applied to investigate the optimal proportional reinsurance-investment strategy for an insurer under the Vasicek stochastic interest rate model. …”
Get full text

Numerical Solutions to Optimal Portfolio Selection and Consumption Strategies under Stochastic Volatility by Lei Ge, Qiang Zhang

“…Based on the method of dynamic programming, this paper uses analysis methods governed by the nonlinear and inhomogeneous partial differential equation to study modern portfolio management problems with stochastic volatility, incomplete markets, limited investment scope, and constant relative risk aversion (CRRA). …”
Get full text