Over the last ten years, research in the field of dynamic programming has assumed many different forms. Sometimes, the emphasis has been upon questions of formulation in analytic terms and concepts, sometimes upon the problems of existence and uniqueness of solutions of the functional equations derived from the underlying processes, occasionally upon the actual analytic structure of the solutions of these equations, sometimes upon the computational aspects; and sometimes upon the...

Topics: DTIC Archive, RAND CORP SANTA MONICA CA, *DYNAMIC PROGRAMMING, THEORY

Journal of Research of the National Bureau of Standards

Topics: Combinatorics, dynamic programming, optimization, systems of distinct representatives, theory of...

In an era of modernization, new weapons systems generate new manpower requirements for the airborne community within the United States Army. The problem of forecasting yearly requirements and inventories has become increasingly complex. This thesis formulates a methodology which applies the Markov Theory to manpower planning in order to forecast yearly inventories. It also discusses zhe strategy of dynamic programming in determining the optimal numbers of soldiers with certain skill levels and...

Topics: Management, manpower, forecasting, optimization, Markov, Dynamic Programming, airborne, SOI, CMF/MOS

The fault location model under investigation consists of an n-component series system known to have exactly one failed component. Component positions in the system are taken as fixed. A component is either working or failed. Components work or fail independently of each other, with their a prior reliabilities taken as given but not necessarily equal. Group testing to locate the failed component is sequential, binary and dichotomous in nature with certain results. The only costs are the number...

Topics: Fault location model, Series system, Group testing, Information theory, Dynamic programming

This paper studies an approximate dynamic programming (ADP) strategy of a group of nonlinear switched systems, where the external disturbances are considered. The neural network (NN) technique is regarded to estimate the unknown part of actor as well as critic to deal with the corresponding nominal system. The training technique is simultaneously carried out based on the solution of minimizing the square error Hamilton function. The closed system’s tracking error is analyzed to converge to an...

Topics: Adaptive dynamic programming, HJB equation, Lyapunov, Neural networksstability, Nonlinear switched...

An analysis is made of the allocation problem associated with the conduct of ambush operations to interdict infiltration routes in a guerrilla-counterguerrilla environment. A multi-stage two-person non-zero sum game is used to model that allocation problem. It is shown that Lanchester's equations can be used to develop a criterion function, related to the casualty ratio, which demonstrates the minimax property. The game is then solved to determine the optimal allocations for both the guerrilla...

Topics: Counter-infiltration operations, Games of strategy, Allocation models, Lanchester equations,...

744
744

Jun 13, 2011
06/11

by
NON

texts

#
eye 744

#
favorite 0

#
comment 0

In preparation for missions to Mars that will involve the return of samples to Earth, it will be necessary to prepare for the receiving, handling, testing, distributing, and archiving of martian materials here on Earth. Previous groups and committees have studied selected aspects of sample return activities, but specific detailed protocols for the handling and testing of returned samples must still be developed. To further refine the requirements for sample hazard testing and to develop the...

Topics: ROUTES, FLIGHT PLANS, FEASIBILITY ANALYSIS, DYNAMIC PROGRAMMING, WORKLOADS (PSYCHOPHYSIOLOGY),...

1,720
1.7K

Jul 26, 2010
07/10

by
NON

texts

#
eye 1,720

#
favorite 0

#
comment 0

Topics addressed include: high-temperature composite materials; structural mechanics; fatigue life prediction for composite materials; internal computational fluid mechanics; instrumentation and controls; electronics; stirling engines; aeropropulsion and space propulsion programs, including a study of slush hydrogen; space power for use in the space station, in the Mars rover, and other applications; thermal management; plasma and radiation; cryogenic fluid management in space; microgravity...

Topics: AIRCRAFT PERFORMANCE, DECOMPOSITION, DYNAMIC PROGRAMMING, OPTIMIZATION, SENSITIVITY, ALGORITHMS,...

Documents created and distributed on the Internet are ever changing in various forms. Most of existing works are devoted to topic modeling and the evolution of individual topics, while sequential relations of topics in successive documents published by a specific user are ignored. In order to characterize and detect personalized and abnormal behaviors of Internet users, we propose Sequential Topic Patterns (STPs) and formulate the problem of mining Useraware Rare Sequential Topic Patterns...

Topics: Web mining, sequential patterns, document streams, rare events, pattern-growth, dynamic programming

We study decision making in dynamic environments in general, and human motor learning in particular. Our approach focuses on the acquisition and use of libraries of representational primitives. This approach is motivated by computational considerations -- learning new motor plans by linearly combining primitives from a library ameliorates the curse of dimensionality. It is also motivated by evidence from the field of cognitive neuroscience indicating that biological organisms (including humans)...

Topics: DTIC Archive, ROCHESTER UNIV NY, *MOTOR REACTIONS, DECISION MAKING, DYNAMIC PROGRAMMING, LEARNING

7
7.0

Oct 5, 2020
10/20

by
Boudarel, R. (René)

texts

#
eye 7

#
favorite 2

#
comment 0

xiv, 252 pages ; 24 cm

Topics: Control theory, Dynamic programming, Dynamische Optimierung, Kontrolltheorie, Optimale Kontrolle,...

The U.S. Navy’s supply chain stretches globally, supporting the fleet in multiple theaters to enable sustained forward presence, security, and deterrence. However, supply chains are subject to disruptions that slow materiel movements throughout the network, and these disruptions may severely hinder the readiness of ships operating in distant theaters. A common culprit for peacetime supply chain disruptions is adverse weather, which is especially true in waters that are prone to major tropical...

Topics: optimization, supply chain disruption, stochastic optimization, linear programming, chance...

An application of control theory to an administrative problem is given for the case of a system of stored items which are periodically reworked to improve their reliability. Expressions are developed for the final value of the reliability when the system is stable and the limits of stability are found. A Kalman filter is used in the control model to obtain an estimation of the item reliability when there are random errors in the measurement and in the rework process. An extension is done for...

Topics: reliability control model, inventory management, control theory, Kalman filter, optimal control,...

This bibliography is divided into three parts: first, there is a chronological ordering of publications, with authors listed alphabetically under each year; second, an alphabetical index of authors; third, a subject index, with authors listed alphabetically under each subject category. The subject index includes; allocation processes, calculus of variations, communications and information theory, control processes, equipment replacement and inventory theory, game theory, maximization and...

Topics: DTIC Archive, RAND CORP SANTA MONICA CA, *BIBLIOGRAPHIES, *DYNAMIC PROGRAMMING, MATHEMATICAL...

Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program representation called the system dependence graph. This paper defines a new algorithm for slicing with system dependence graphs that is asymptotically faster than the previous one. A preliminary experimental study indicates that the new algorithm is also significantly faster in practice, providing roughly a 6-fold speedup...

Topics: DTIC Archive, Reps, Thomas, WISCONSIN UNIV-MADISON, *DYNAMIC PROGRAMMING, ALGORITHMS, SOFTWARE...

Counterdrug operations are of national interest to the U.S. and our allies because the illegal production and trafficking of drugs threatens U.S. national security and undermines security and stability in Latin America. Since law enforcement tasked with counterdrug operations is not given enough platforms to search every location at all times, they must decide how to employ their scarce platforms. To assist law enforcement, we develop a defender-attacker optimization model that utilizes...

Topics: Stochastic Optimization, Dynamic Programming, Defender-Attacker Optimization, Global Bender’s...

THE PROBLEM OF DETERMINING AN OPTIMAL TESTING POLICY WHERE ONE SIMULTANEOUSLY GAINS AND LEARNS FOR THE CASE WHERE THE OUTCOME OF ONE CHOICE IS KNOWN AND THE OTHER IS SUBJECT TO A KNOWN A PRIORI DISTRIBUTION IS CONSIDERED. Results of Johnson and Karlin, P-328, are obtained in a different way and extended. The methods used are applicable to more general processes.

Topics: DTIC Archive, RAND CORP SANTA MONICA CA, *DYNAMIC PROGRAMMING, FUNCTIONS(MATHEMATICS),...

Documents created and distributed on the Internet are ever changing in various forms. Most of existing works are devoted to topic modeling and the evolution of individual topics, while sequential relations of topics in successive documents published by a specific user are ignored. In order to characterize and detect personalized and abnormal behaviors of Internet users, we propose Sequential Topic Patterns (STPs) and formulate the problem of mining Useraware Rare Sequential Topic Patterns...

Topics: Web mining, sequential patterns, document streams, rare events, pattern-growth, dynamic...

126
126

Dec 30, 2013
12/13

by
Girish Kumar Patra ,N Venkateswarlu , B Malleshwari , B Murali Krishna

texts

#
eye 126

#
favorite 0

#
comment 0

Compound images are a combination of text, graphics and natural image. They present strong anisotropic features, especially on the text and graphics parts. These anisotropic features often render conventional compression inefficient. Thus, this paper proposes a novel coding scheme from the H.264 intraframe coding. In the scheme, two new intramodes are developed to better exploit spatial correlation in compound images. The first is the residual scalar quantization (RSQ) mode, where...

Topics: Base colors and the index map, compound image compression, dynamic programming, residual scalar...

The structure of the solution of f(x) = Max (0yx) (g(y)+h(x-y) +f(ay+b(x-y))), in the case where g and h are concave is derived.

Topics: DTIC Archive, RAND CORP SANTA MONICA CA, *DYNAMIC PROGRAMMING, EQUATIONS, FUNCTIONS(MATHEMATICS),...

A simple cutting procedure is described which can be combined with any algorithm for undirected networks (symmetric distance matrix) so as to form a shortest-path algorithm for directed networks (asymmetric distance matrix). In particular, the cutting and stretching can be alternated to form a ''string algorithm'' for directed networks.

Topics: DTIC Archive, Klee, Victor, BOEING SCIENTIFIC RESEARCH LABS SEATTLE WA, *NETWORKS, DYNAMIC...

We consider the problem of collaborative target localization by several observers, called players, where the reliability of each player is unknown. As in our previous work [1] we formulate this problem as a 20 questions game with noise for collaborative players under a minimum entropy criterion. We extend the setting of [1] to the case where the players' error channels have unknown crossover probabilities. First, we use dynamic programming to characterize the structure of the optimal policy for...

Topics: DTIC Archive, MICHIGAN UNIV ANN ARBOR, *TARGETS, DYNAMIC PROGRAMMING, GAME THEORY, OPTIMIZATION,...

The decomposition principle of Dantzig and Wolfe (Operations Research, 8:101-111 (1960)) is a method for breaking large linear programs with a block diagonal structure into a set of smaller subprograms. As alternative decomposition scheme derived from a dynamic programming approach is proposed here. This results in a series of parametric linear subprograms whose recursive solution yields the solution to the original linear program.

Topics: DTIC Archive, JOHNS HOPKINS UNIV BALTIMORE MD, *DYNAMIC PROGRAMMING, *LINEAR PROGRAMMING,...

Documents created and distributed on the Internet are ever changing in various forms. Most of existing works are devoted to topic modeling and the evolution of individual topics, while sequential relations of topics in successive documents published by a specific user are ignored. In order to characterize and detect personalized and abnormal behaviors of Internet users, we propose Sequential Topic Patterns (STPs) and formulate the problem of mining Useraware Rare Sequential Topic Patterns...

Topics: Web mining, sequential patterns, document streams, rare events, pattern-growth, dynamic...

34
34

Jan 13, 2020
01/20

by
Boudarel, R. (Rene)

texts

#
eye 34

#
favorite 3

#
comment 0

xiv, 252 pages ; 24 cm

Topics: Programmation dynamique, Commande, Théorie de la, Control systems Design Optimisation methods...

A discussion is given of a representation of the distribution function of the solution of the stochastic differential equation u' = g(u) + r(t), where r(t) is a given stochastic function, and g(u) is assumed to be either strictly convex or strictly concave for all u. Extensions of this result to more general types of nonlinear functional equations may be readily obtained.

Topics: DTIC Archive, RAND CORP SANTA MONICA CA, *DIFFERENTIAL EQUATIONS, *DYNAMIC PROGRAMMING, STATISTICAL...

This Grant addressed four focus areas toward advancing the state-of-the-art in learning control theory of robust and adaptive non-equilibrium control of highly nonlinear, higher-order, reconfigurable systems: 1. Extend Approximate Dynamic Programming (ADP) techniques to control of nonlinear, multiple time scale, non-affine systems in an Adaptive Control framework.; 2. Develop solution techniques for Markov Decision Problems (MDP) that scale to continuous state and control spaces with...

Topics: DTIC Archive, TEXAS ENGINEERING EXPERIMENT STATION COLLEGE STATION, *CONTROL, DYNAMIC PROGRAMMING,...

Aerial refueling is an integral part of the United States military's ability to strike targets around the world with an overwhelming and continuous projection of force. However, with an aging fleet of refueling tankers and an indefinite replacement schedule the optimization of tanker usage is vital to national security. Optimizing tanker and receiver refueling operations is a complicated endeavor as it can involve over a thousand of missions during a 24 hour period, as in Operation Iraqi...

Topics: Computer programs, Dynamic programming, Linear programming, Scheduling, Planning, Receivers,...

This is a brief description of decision processes in dynamic programming.

Topics: DTIC Archive, RAND CORP SANTA MONICA CA, *DECISION THEORY, *DYNAMIC PROGRAMMING, CALCULUS OF...

454
454

texts

#
eye 454

#
favorite 0

#
comment 0

An algorithm to solve security constrained unit commitment problem (UCP) with both operational and power flow constraints (PFC) have been proposed to plan a secure and economical hourly generation schedule. This proposed algorithm introduces an efficient unit commitment (UC) approach with PFC that obtains the minimum system operating cost satisfying both unit and network constraints when contingencies are included. In the proposed model repeated optimal power flow for the satisfactory unit...

Topics: Unit commitment, Dynamic Programming, Newton Raphson, Lagrangian multiplier, Economic dispatch,...

It is shown that the functional equation technique of the theory of dynamic programming may be used to derive functional differential equations for the characteristic values of a certain integral equation similar to those obtained for the eigenvalues of differential equations.

Topics: DTIC Archive, RAND CORP SANTA MONICA CA, *DYNAMIC PROGRAMMING, *INTEGRAL EQUATIONS, DIFFERENTIAL...

Theoretical discussion proposing that the minimum expected cost of developing a large scale military system under conditions of uncertainty is achieved by over-shooting effectiveness goals. Implications of the theory in regard to the timing of planning and acquisition are explored and the relationship between the theory and policy is discussed. (Author)

Topics: DTIC Archive, Fox, P, MITRE CORP BEDFORD MA, *DECISION MAKING, *DYNAMIC PROGRAMMING, PROBABILITY,...

The functional equation technique of the theory of dynamic programming is applied to the theory of equipment replacement.

Topics: DTIC Archive, RAND CORP SANTA MONICA CA, *DYNAMIC PROGRAMMING, ECONOMICS, EQUATIONS,...

The study of dynamic programming processes of continuous type gives rise to functional equations of the form dx/dt = Max/q f (x,t;q). In this paper we present a summary of some basic results concerning the existence and uniqueness of solutions of this equation. Detailed results will appear subsequently.

Topics: DTIC Archive, RAND CORP SANTA MONICA CA, *DYNAMIC PROGRAMMING, *FUNCTIONS(MATHEMATICS), *NONLINEAR...

A complete theory of necessary and sufficient conditions is discussed for a control to be superior with respect to a nonscalar-valued performance criterion. The latter maps into a finite dimensional, integrally closed directed, partially ordered linear space. The applicability of the theory to the analysis of dynamic vector estimation problems and to a class of uncertain optimal control problems is demonstrated.

Topics: NASA Technical Reports Server (NTRS), INFINITY, LINEARITY, DYNAMIC PROGRAMMING, VECTORS...

A study is made of a class of mathematical problems connected with physical situations which require that a finite or unbounded sequence of operations be performed for the purpose of achieving a desired result. The only case considered here is that in which each operation performs a mapping of the parametric space onto itself.

Topics: DTIC Archive, RAND CORP SANTA MONICA CA, *DYNAMIC PROGRAMMING, *LINEAR PROGRAMMING, PROBABILITY,...

Computer programs, routines, and subroutines for aiding engineers, scientists, and mathematicians in direct problem solving are presented. Also included is a group of items that affords the same users greater flexibility in the use of software.

Topics: NASA Technical Reports Server (NTRS), COMPUTER PROGRAMS, DYNAMIC PROGRAMMING, PROBLEM SOLVING,...

It was seen that the numerical solution of a problem involving N state variables depended upon the computation of sequences of functions of N variables. This fact made the method routine only for the case where N = 1 or 2, with grave difficulties arising in the general case. In the paper, it is indicated how to overcome this difficulty for a large class of problems in which the underlying equations and the criterion function are linear, although the restraints on the forcing functions may be...

Topics: DTIC Archive, RAND CORP SANTA MONICA CA, *DYNAMIC PROGRAMMING, EQUATIONS, FUNCTIONS(MATHEMATICS),...

Topics: DTIC Archive, RAND CORP SANTA MONICA CA, *DYNAMIC PROGRAMMING, BOUNDARY VALUE PROBLEMS, EQUATIONS,...

This paper studies several stochastic programming formulations of dynamic oligopolistic games under uncertainty. We argue that one of the models, namely Games with Probabilistic Scenarios (GPS), provides an appropriate formulation. For such games, we show that symmetric players earn greater expected profits as demand volatility increases. This result suggests that even in an increasingly volatile market players may have an incentive to participate in the market. The key to our approach is the...

Topics: DTIC Archive, ARIZONA UNIV TUCSON, *DYNAMIC PROGRAMMING, *STOCHASTIC PROCESSES, ADDITION, COMPUTER...

In the present paper we show that the method of 'approximation in policy space,' developed in the theory of dynamic programming, yields monotone convergence in the calculus of variations.

Topics: DTIC Archive, RAND CORP SANTA MONICA CA, *CALCULUS OF VARIATIONS, *DYNAMIC PROGRAMMING, EQUATIONS,...

We present a generalization of a class of sequential search problems with ordinal ranks (secretary problems) in which applicants are characterized by multiple attributes that are evaluated independently. We then present a procedure for numerically computing the optimal search policy and test it in two experiments with incentive-compatible payoffs. With payoffs dependent on the absolute ranks of the attributes, we test the optimal search model with both symmetric (Experiment 1) and asymmetric...

Topics: DTIC Archive, ARIZONA UNIV TUCSON DEPT OF MANAGEMENT AND POLICY, *DYNAMIC PROGRAMMING, *SEQUENTIAL...

17
17

Apr 12, 2021
04/21

by
Bellman, Richard, 1920-1984

texts

#
eye 17

#
favorite 1

#
comment 0

1 online resource (xv, 246 pages)

Topics: Dynamic programming, Algorithms, Graph theory, MATHEMATICS -- Linear & Nonlinear Programming,...

399
399

Jun 1, 2011
06/11

by
Stassinopoulos, E. G.; Stauffer, C. A.; Brucker, G. J

texts

#
eye 399

#
favorite 0

#
comment 0

This paper presents early results from aircraft measurements made by a Low-LET Radiation Spectrometer (LoLRS), as part of a long-range effort to study the complex dynamics of the atmospheric radiation field. For this purpose, a comprehensive data base is being generated to enable a multivariable global mapping (and eventually modeling) of doses and Linear-Energy-Transfer (LET) spectra at aviation altitudes. To accomplish this, a methodical collection of data from the LoLRS (and other...

Topics: ALGORITHMS, DECISION THEORY, HEURISTIC METHODS, MARKOV PROCESSES, SYMBOLS, DYNAMIC PROGRAMMING,...

190,740
191K

movies

#
eye 190,740

#
favorite 7

#
comment 0

Lecture videos from 6.006 Introduction to Algorithms, taught by Erik Demaine and Srini Devadas. The course is divided into eight units: introduction, sorting and trees, hashing, numerics, graphs, shortest paths, dynamic programming, and advanced topics.

Topics: algorithms, data structures, algorithm performance, algorithm analysis, sorting, trees, hashing,...

The four-color problem is extended and inverted. The method is a combination of exact and heuristic techniques. Conceivably, it may offer an approach to some general theoretical results. At the moment, it is designed to resolve the problem of how a particular map is to be colored with three or four colors. In general, the computational procedure given requires a digital computer.

Topics: DTIC Archive, RAND CORP SANTA MONICA CA, *DYNAMIC PROGRAMMING, COLORING, COLORS, DIGITAL COMPUTERS,...

A limit theorem is presented which is valid for a general class of Markovian decision processes. The result is of interest because of the simple conditions which are imposed and the argument used.

Topics: DTIC Archive, RAND CORP SANTA MONICA CA, *DYNAMIC PROGRAMMING, *STATISTICAL PROCESSES, DECISION...

The problem of testing a linear temporal logic (LTL) formula on a finite execution trace of events, generated by an executing program, occurs naturally in runtime analysis of software. We present an algorithm which takes an LTL formula and generates an efficient dynamic programming algorithm. The generated algorithm tests whether the LTL formula is satisfied by a finite trace of events given as input. The generated algorithm runs in linear time, its constant depending on the size of the LTL...

Topics: NASA Technical Reports Server (NTRS), DYNAMIC PROGRAMMING, ALGORITHMS, TEMPORAL LOGIC, RUN TIME...

The purpose of this research was to examine a number of existing mathematical models of repairable inventory systems in order to discover possible improvements and/or generalization of existing work in this area of research. The research resulted in two research reports. One deals with a deterministic model for a repairable item inventory system with a finite repair rate. The second report deals with managing repairable item inventory systems. The second paper presents a relatively...

Topics: DTIC Archive, Nahmias,Steven, PITTSBURGH UNIV PA DEPT OF INDUSTRIAL ENGINEERING, *MATHEMATICAL...

This paper describe different techniques we can use for multiple sequence alignment. we have analyze different techniques we can use and find which one is better .We have taken several example as parameter. There is different approachthat we can apply in various conditions. This paper is concerned with the efficient execution Multiple sequence alignment methods in multiple client environments Multiple order alignment (MSA) is in a computational form Expensive method, which is commonly used in...

Topics: multiple sequence alignment, optimization, protein and DNA, Dynamic programming, Progressive...