| Optimization Techniques for Clustering,Connectivity, and Flow Problems in Complex Networks |
01 Oct 2012 |
7 pages |
| Authors:
Sergiy Butenko; Vladimir Boginski; Oleg Prokopyev; TEXAS A AND M UNIV COLLEGE STATION DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
 | This project develops network-based optimization methods for solving problems arising in complex system analysis and wireless networking applications. The study of complex systems is of utmost importance for a number of diverse areas of science, engineering and society, including biochemistry, social sciences, epidemiology, transportation, and telecommunications. The project makes contributions to the state of the art of network-based techniques for data mining of complex systems and virtual backbone-based routing in ... |
|
| Semi-Definite Programming Relaxation for Non-Line-of-Sight Localization |
18 Aug 2012 |
9 pages |
| Authors:
Venakatesan Ekambaram; Giulia Fanti; Kannan Ramchandran; CALIFORNIA UNIV BERKELEY DEPT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE
|
| We consider the problem of estimating the locations of a set of points in a k-dimensional euclidean space given a subset of the pairwise distance measurements between the points. We focus on the case when some fraction of these measurements can be arbitrarily corrupted by large additive noise. Given that the problem is highly non-convex, we propose a simple semidefinite programming relaxation that can be efficiently solved using standard algorithms. ... |
|
| Optimization Techniques for Analysis of Biological and Social Networks |
28 Mar 2012 |
5 pages |
| Authors:
Sergiy Butenko; TEXAS A AND M UNIV COLLEGE STATION DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| This project focused on a multifaceted study of a class of cluster-detection problems arising in biological and social networks. This includes defining new cluster models and their alternative mathematical programming formulations, their theoretical analysis, the development of exact algorithms, and heuristics. Originally, clusters (complexes, modules, cohesive subgroups) in biological and social networks were described by cliques (complete subgraphs) or connected components. However, in many practical situations cliques appear to be ... |
|
| Bridging the Gap Between Theory and Practice: Structure and Randomization in Large Scale Combinatorial Search |
17 Jan 2012 |
25 pages |
| Authors:
Carla P Gomes; CORNELL UNIV ITHACA NY DEPT OF COMPUTER SCIENCE
|
| This research effort focused on three core research challenges: (1) How to explain the gap between formal analysis and practical performance for combinatorial search; (2) How to characterize and capture hidden tractable structure in real-world problems; and, (3) How to further boost combinatorial search methods for real-world problems. A series of advanced formal models for predicting the runtime of combinatorial search methods were developed. Models of runtime distributions of search ... |
|
| Stochastic Pseudo-Boolean Optimization |
31 Jul 2011 |
123 pages |
| Authors:
Oleg Prokopyev; PITTSBURGH UNIV PA
|
| Pseudo-boolean (and general nonlinear integer) functions provide an extremely powerful modeling and solution tool in operations research and related areas. A large number of practical as well as purely theoretical decision problems can be easily represented and solved as optimization of a pseudo-boolean or general nonlinear integer function. In the framework of this project we have considered several stochastic extensions of classical combinatorial optimization problems that involve some type of ... |
|
| Detecting and Jamming Dynamic Communication Networks in Anti-Access Environments |
Mar 2011 |
44 pages |
| Authors:
Stanislav Uryasev; Panos Pardalos; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| Three chapters present methods for handling various optimization problems related to sensors networks. The first chapter investigates mathematical programming techniques for solving a class of multi-sensor scheduling problems. We conducted several case studies and investigated the performance of robust optimization solvers for considered 0-1 linear programming problems. The second chapter presents a survey describing recent developments in the area of mathematical programming techniques for various types of sensor network applications. ... |
|
| Models and Algorithms Involving Very Large Scale Stochastic Mixed-Integer Programs |
28 FEB 2011 |
19 pages |
| Authors:
Suvrajeet Sen; OHIO STATE UNIV COLUMBUS INDUSTRIAL AND SYSTEMS ENGINEERING
|
| Stochastic Mixed Integer Programs (SMIP) are recognized as one of the most formidable classes of mathematical programming problems. Not only are there significant challenges due to potentially large number of scenarios, but, SMIP with integers in the second stage give rise to a non-convex and discontinuous recourse function that may be difficult to optimize. As a result of this project, there have been significant advances in the design of algorithms ... |
|
| Solving Two-Level Optimization Problems with Applications to Robust Design and Energy Markets |
Jan 2011 |
223 pages |
| Authors:
Sauleh A Siddiqui; MARYLAND UNIV COLLEGE PARK
|
| This dissertation provides efficient techniques to solve two-level optimization problems. Three specific types of problems are considered. The first problem is robust optimization, which has direct applications to engineering design. Traditionally robust optimization problems have been solved using an inner-outer structure, which can be computationally expensive. This dissertation provides a method to decompose and solve this two-level structure using a modified Benders decomposition. This gradient-based technique is applicable to robust ... |
|
| Hybrid Nested Partitions and Math Programming Framework for Large-scale Combinatorial Optimization |
31 Mar 2010 |
5 pages |
| Authors:
Leyuan Shi; WISCONSIN UNIV-MADISON DEPT OF INDUSTRIAL ENGINEERING
|
| There are two principal technologies for these large-scale combinatorial optimization problems: 1) exact algorithms and 2) metaheuristic algorithms. This project will integrate concepts from these two technologies to develop generic optimization frameworks to find provably good solutions to large-scale discrete optimization problems often encountered in many real applications. The way that these two sets of methods will be used, and in particular the way in which they will be used ... |
|
| Game-Theoretic Anti-Submarine Warfare Mission Planner (Heuristic-Based, Fully Excel Capable) |
Sep-2009 |
76 pages |
| Authors:
Scott D Scherer; NAVAL POSTGRADUATE SCHOOL MONTEREY CA
|
| This thesis introduces a Game-Theoretic Anti-Submarine Warfare Mission Planner (G-TAMP) that can quickly operate on a Navy Marine Corps Intranet (NMCI) computer without any software other than NMCI-standard Microsoft Office, Visual Basic for Applications (VBA), and a freely-available optimization package called LP SOLVE employed as a dynamically linked library. We replace the expensive and non-NMCI approved mathematical modeling software used by Adam Thomas in his 2008 thesis with a purpose-built, ... |
|
| Optimizing Employment of Search Platforms to Counter Self-Propelled Semi-Submersibles |
01-Jun-2009 |
93 pages |
| Authors:
Daniel M Pfeiff; NAVAL POSTGRADUATE SCHOOL MONTEREY CA
|
| Self-Propelled Semi-Submersibles now transport an estimated 75% of cocaine originating from Colombia and headed for the United States. There are several types of search platforms (i.e., units to detect, classify, and interdict) being employed by the Joint Interagency Task Force South to combat the semi-submersibles. We use a defender-attacker optimization model to maximize the defender?s probability of successful detection and classification of the semisubmersible through the advantageous disposition of these ... |
|
| Optimizing Multi-Ship, Multi-Mission Operational Planning for the Joint Force Maritime Component Commander |
Mar-2009 |
84 pages |
| Authors:
Robert A Silva; NAVAL POSTGRADUATE SCHOOL MONTEREY CA
|
| Operational-level planners in Maritime Operations Centers aim to assign naval forces in support of combatant commanders efficiently and effectively, but they lack a software-based planning tool to develop optimal ship employment schedules. They must assign ships to particular missions spread throughout numerous regions over a particular time horizon to meet the combatant commander's force requirements. Currently, this is a manual process. We present Navy Mission Planner (NMP), a decision aid ... |
|
| Tri-Level Optimization for Anti-Submarine Warfare Mission Planning |
01-Sep-2008 |
107 pages |
| Authors:
Adam J Thomas; NAVAL POSTGRADUATE SCHOOL MONTEREY CA
|
| We develop the Game-Theoretic ASW Mission Planner (G-TAMP), an operational-level planning aid for the tasking of anti-submarine warfare (ASW) platforms to protect a high-value unit (HVU) from attack by hostile submarines (SSKs). We first present a defender-attacker optimization model in which the defender tasks platforms to minimize the probability that the enemy can reach the HVU, while the enemy observes and reacts to these visible defenses by routing SSKs to ... |
|
| Optimal Jammer Placement to Interdict Wireless Network Services |
01-Jun-2008 |
59 pages |
| Authors:
Arun Shankar; NAVAL POSTGRADUATE SCHOOL MONTEREY CA
|
| The demand for wireless networks continues to grow as the need for portable, low-cost telecommunications systems increases around the world. Wireless networks are particularly complex because their topologies can change in response to operational requirements or environmental conditions and also because wireless networks are susceptible to electromagnetic interference. In this thesis, we consider the challenges associated with the operation and jamming of so-called wireless mesh networks. In a wireless mesh ... |
|
| Robust Sensitivity Analysis of Courses of Action Using an Additive Value Model |
MAR 2008 |
108 pages |
| Authors:
Hunter A. Marks; AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH GRADUATE SCHOOL OF ENGINEERING AND MANAGEMENT
|
| The Department of Defense (DoD) requires the ability to quantifiably measure progress in arenas that are complex and difficult to measure, such as the stability of a region. Therefore, the DoD works diligently to predict the effect of operations and sponsors research to improve prediction and analysis. They desire a repeatable, systematic methodology to aid in the selection of courses of action (COA) that efficiently meet stated objectives and quantitatively ... |
|
| Initial Results from a Cartesian Three-Dimensional Parabolic Equation Acoustical Propagation Code |
DEC 2006 |
|
| Authors:
Timothy F. Duda; WOODS HOLE OCEANOGRAPHIC INSTITUTION MA
|
 | A three-dimensional (3D) parabolic equation acoustical propagation code has been developed and run successfully. The code is written in the MATLAB language and runs in the MATLAB environment. The code has been implemented in two versions, applied to: (1) Horizontal low-frequency (100 to 500 Hz) propagation through the shallow water waveguide environment; (2) Vertical high-frequency propagation (6 to 15 kHz) to study normal-incidence reflection from the lower side of the ... |
|
| Using Advanced Tabu Search Approaches to Perform Enhanced Air Mobility Command Operational Airlift Analyses - Phases II and III |
31 OCT 2006 |
16 pages |
| Authors:
J. W. Barnes; TEXAS UNIV AT AUSTIN DEPT OF MECHANICAL ENGINEERING
|
| First, we focus on "transitions" (cases where our work is slated for use in either an AMC technology application or in important application arenas essential to the economic and environmental well being of the nation). Second, we address the theoretical contributions associated with neighborhood and landscape theory. The last 12 months have been intriguing, challenging, and productive. Much has been accomplished and we eagerly look forward to the future challenges ... |
|
| Weapon-Target Pairing; Revising an Air Tasking Order in Real-Time |
SEP 2006 |
58 pages |
| Authors:
Brian Zacherl; NAVAL POSTGRADUATE SCHOOL MONTEREY CA
|
| Well-publicized lost opportunities for U.S. and coalition air forces to strike enemy leadership targets in Afghanistan and Iraq demonstrate the importance of Time Sensitive Targeting. How do we pair the weapon and weapons delivery platform with their target? The available platforms (aircraft, manned or unmanned) may be on the ground in an alert status, loitering airborne, or on their way to attack other targets. The problem is compounded by the ... |
|
| Optimization of Automatic Target Recognition with a Reject Option Using Fusion and Correlated Sensor Data |
28 SEP 2005 |
330 pages |
| Authors:
Trevor I. Laine; AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH SCHOOL OF ENGINEERING AND MANAGEMENT
|
| This dissertation examines the optimization of automatic target recognition (ATR) systems when a rejection option is included. First, a comprehensive review of the literature inclusive of ATR assessment, fusion, correlated sensor data, and classifier rejection is presented. An optimization framework for the fusion of multiple sensors is then developed. This framework identifies preferred fusion rules and sensors along with rejection and receiver operating characteristic (ROC) curve thresholds without the use ... |
|
| Evaluation of Logistics Operation Command and Control Capability: Optimization Revisited |
JUN 2005 |
97 pages |
| Authors:
Recep Ozkan; NAVAL POSTGRADUATE SCHOOL MONTEREY CA
|
| Logistics Operations Command and Control Capability Concept (LOCCC), developed by Jeff Grelson in 2000, introduces a new distribution principle to combat elements. This concept employs a supporting logistics unit in a general support role and controls it by a unique command center in order to minimize the footprint left by logistics, improve logistic and tactical responsiveness, and reduce the iron mountain on the battlefield. This thesis revisits the mathematical models ... |
|
| Fundamentals of Combinatorial Optimization and Algorithm Design |
24 MAY 2005 |
8 pages |
| Authors:
Bruce Shepherd; Peter Winkler; Chandra Chekuri; LUCENT TECHNOLOGIES INC MURRAY HILL NJ
|
| The main activities supported under this grant are research and support for C. Chekuri, B. Shepherd and P. Winkler. Funds also supported one summer intern, Andrew McGregory from U-Penn, who worked with Shepherd on recognizing Hilbert Bases and other theoretical topics in Math Programming. Visits from scientists include a 2-week visit from Gianpaolo Oriolo (Rome), which resulted in new joint work on robust network design, a week visit from Seffi ... |
|
| Multi-State Selective Maintenance Decisions |
JAN 2005 |
46 pages |
| Authors:
C. R. Cassady; Edward A. Pohl; Scott J. Mason; Thomas G. Yeung; ARKANSAS UNIV FAYETTEVILLE DEPT OF INDUSTRIAL ENGINEERING
|
| All military organizations depend on the reliable performance of repairable systems for the successful completion of missions. Due to limitations in maintenance resources, a maintenance manager must decide how to allocate available resources. This allocation falls within the domain of selective maintenance. Selective maintenance is defined as the process of identifying the subset of maintenance activities to perform from a set of desired maintenance actions. Previously, researchers developed a class ... |
|
| Total Variation Based Image Cartoon-Texture Decomposition |
2005 |
26 pages |
| Authors:
Wotao Yin; Donald Goldfarb; Stanley Osher; COLUMBIA UNIV NEW YORK DEPT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH
|
| This paper studies algorithms for decomposing a real image into the sum of cartoon and texture based on total variation minimization and second-order cone programming (SOCP). The cartoon is represented as a function of bounded variation while texture (and noise) is represented by elements in the space of oscillating functions, as proposed by Yves Meyer. Our approach gives more accurate results than those obtained previously by Vese-Osher's approximation to Meyer's ... |
|
| SPX: The Tenth International Conference on Stochastic Programming |
OCT 2004 |
91 pages |
| Authors:
Julie Higle; ARIZONA UNIV TUCSON
|
| SPX was the tenth in the series of international conferences on Stochastic Programming (SP) The first was held on the campus of Oxford University 30 years ago. Since then, the series of conferences has crossed the Atlantic Ocean several times (the last two meetings in North America were held in Ann Arbor MT (1989) and Vancouver BC (1995). Stochastic programming has emerged as one of the leading modeling paradigms for ... |
|
| Deployment of SAR and GMTI Signal Processing on a Boeing 707 Aircraft Using pMatlab and a Bladed Linux Cluster |
28 SEP 2004 |
|
| Authors:
Jeremy Kepner; Tim Currie; Hahn Kim; Andrew McCabe; Bipin Mathew; Michael Moore; Dan Rabinkin; Albert Reuther; Andrew Rhoades; Nadya Travinin; Lou Tella; MASSACHUSETTS INST OF TECH LEXINGTON LINCOLN LAB
|
| The Lincoln Multifunction Intelligence, Surveillance and Reconnaissance Testbed (LiMIT) is an airborne research laboratory for development, testing, and evaluation of sensors and processing algorithms. During flight tests it is desirable to process the sensor data to validate the sensors and to provide targets and images for use in other on-board applications. Matlab is used for this processing because of the rapidly changing nature of the algorithms, but requires hours to ... |
|
| Interior-Point Algorithms, Penalty Methods and Equilibrium Problems |
20 AUG 2004 |
39 pages |
| Authors:
Hande Y. Benson; Arun Sen; David F. Shanno; Robert J. Vanderbei; DREXEL UNIV PHILADELPHIA PA
|
| In this paper we consider the question of solving equilibrium problems formulated as complementarity problems and more generally, mathematical programs with equilibrium constraints (MPECs) as nonlinear programs, using an interior-point approach. These problems pose theoretical difficulties for nonlinear solvers, including interior-point methods. We examine the use of penalty methods to get around these difficulties, present an example from game theory where this makes a difference in practice, and provide substantial ... |
|
| Numerical Optimization of Multifunctional Components |
17 AUG 2004 |
9 pages |
| Authors:
Anthony T. Patera; MASSACHUSETTS INST OF TECH CAMBRIDGE DEPT OF MECHANICAL ENGINEERING
|
| Engineering components are increasingly complex in composition and structure and increasingly multifunctional. Indeed, it is only through complexity and multifunctionality that the defense industry can satisfy the stringent performance requirements associated with critical defense applications. However, these complex, multifunctional systems no longer admit intuitive analysis of trade-off considerations. Industries must pursue optimization, including optimal choice of material, configuration, and deployment to realize the potential of these new approaches. The essential ... |
|
| Filter Pattern Search Algorithms for Mixed Variable Constrained Optimization Problems |
21 JUN 2004 |
32 pages |
| Authors:
Mark A. Abramson; Charles Audet; Jr Dennis J. E.; AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH
|
| A new class of algorithms for solving nonlinearly constrained mixed variable optimization problems is presented. This class combines and extends the Audet-Dennis Generalized Pattern Search (GPS) algorithms for bound constrained mixed variable optimization, and their GPS-filter algorithms for general nonlinear constraints. In generalizing existing algorithms, new theoretical convergence results are presented that reduce seamlessly to existing results for more specific classes of problems. While no local continuity or smoothness assumptions ... |
|
| Optimization Tools for Engineering Design Using Surrogate Functions |
FEB 2004 |
19 pages |
| Authors:
John E. Dennis Jr; Charles Audet; RICE UNIV HOUSTON TX DEPT OF COMPUTATIONAL AND APPLIED MATHEMATICS
|
| This has been an exceptionally productive 3 years. We have several papers published in the best journals in the area, several are in review, and a new and promising avenue of research has been opened by our first paper of our renewal project. This new research began under the current project. Indeed, there have been two international workshops, one in Denmark and one in Portugal, inspired by our work, and ... |
|
| Proceedings STRATA 2003. First International Workshop on Design and Application of Strategies/Tactics in Higher Order Logics; Focus on PVS experiences |
28 NOV 2003 |
116 pages |
| Authors:
Myla M. Archer; Ben L. DiVito; Cesar Munoz; NAVAL RESEARCH LAB WASHINGTON DC
|
| This report contains the Proceedings of STRATA 2003, the First International Workshop on the Design and Application of Strategies/Tactics in Higher Order Logics. In contrast to the Strategies in Automated Deduction workshop series that is associated with CADE (the International Conference on Automated Deduction), STRATA focuses on theorem proving strategies for higher order logic theorem provers rather than on theorem proving strategies for (primarily) first order logic theorem proving. This ... |
|
| Polish Federation of Land Battle in a Distributed Interactive Environment |
NOV 2003 |
53 pages |
| Authors:
Andrzej Najgebauer; Dariusz Pierzchala; Jaroslaw Rulka; MILITARY UNIV OF TECHNOLOGY WARSAW (POLAND)
|
| Polish distributed and interactive environment for training of combat or peace support operations is presented. As a starting point in modelling process a specific theoretical game is considered. Game theory offers good "language of conflict". So we define military conflict game in general sense and transit it to the next phases of modelling combat process model, decision model, and simulation model. The distribution of conflict model components is natural and ... |
|
| MBR-A Computer Program for Performing Nonparametric Bayesian Analyses of Ordered Binomial Data |
02 MAY 2003 |
35 pages |
| Authors:
William W. McDonald; NAVAL SURFACE WARFARE CENTER INDIAN HEAD DIV MD
|
| The MBR computer program computes posterior marginal distributions for binomial response probabilities associated with a set of M-ordered stresses or stimuli. Exact solutions are achieved of the posterior marginal distribution functions, first published by Disch, which was based on Ramsey s M-variate ordered Dirichlet joint prior. MBR assumes a related joint prior that is a mixture of Dirichlet distributions to obtain a class capable of representing arbitrary and quite general ... |
|
| Integrating Cost as an Independent Variable Analysis with Evolutionary Acquisition - A Multiattribute Design Evaluation Approach |
MAR 2003 |
123 pages |
| Authors:
Marc T. Lewis; AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH SCHOOL OF ENGINEERING AND MANAGEMENT
|
| Guidance from the Under Secretary of Defense for Acquisition, Technology, and Logistics (USD(AT&L)) requires 100 percent of defense programs to incorporate cost as an independent variable (CAIV) and evolutionary acquisition (EA) plans within their management baselines. Historically, these two concepts have been implemented independent of one another. In reality, CAIV and EA are tightly coupled, Integration of these two initiatives enables warfighters and developers to better allocate constrained resources, respond ... |
|
| Perception-based Co-evolutionary Reinforcement Learning for UAV Sensor Allocation |
FEB 2003 |
15 pages |
| Authors:
Hamid R. Berenji; INTELLIGENT INFERENCE SYSTEMS CORP SUNNYVALE CA
|
| In this project, we have formulated the problem of sensor allocation in a team of UAVs within a mathematical programming framework. A Perception- based reasoning approach based on co-evolutionary reinforcement learning was developed for jointly addressing sensor allocation on each individual UAV and allocation of a team of UAVs in the geographical search space. An elaborate problem setup was simulated and experimented with, for testing and analysis of this framework ... |
|
| A Unified Approach to Statistical Quality Assessment in Heuristic Combinatorial Optimization |
14 JAN 2003 |
143 pages |
| Authors:
Angela P. Giddings; AIR FORCE INST OF TECH WRIGHT-PATTERSONAFB OH
|
| Since the introduction of mathematical programming it has been all too easy to identify real-world problems that could be formulated as math programs but could not be solved to a provable optimum within a reasonable amount of time. As computing power continues to increase, so too does the size of the mathematical programs to be solved. This situation has given rise to a multitude of heuristic solution techniques that seek ... |
|
| Compute-Intensive Methods and Hybrid Approaches for Combinatorial Problems |
NOV 2002 |
56 pages |
| Authors:
Carla Gomes; CORNELL UNIV ITHACA NY
|
| Our research program focuses on techniques that lie at the intersection of Artificial Intelligence and Operations Research. In particular, we study computational methods for large-scale combinatorial optimization. Our research combines formal analysis and design of optimization techniques with the study of applications such as planning and scheduling, autonomous distributed agents and combinatorial auctions. Central themes of our work are (1) the integration of concepts from mathematical programming with constraint programming, ... |
|
| Large Scale Optimization Methods with a Focus on Chemistry Problems |
NOV 2002 |
10 pages |
| Authors:
Robert B. Schnabel; Richard H. Byrd; COLORADO UNIV AT BOULDER OFFICE OF CONTRACTS AND GRANTS
|
| Our research under this grant has developed general large-scale global optimization techniques in the context of solving protein structure prediction problems. Over the course of the research period the thrust of the research was primarily in two areas. The first area provided advances in our techniques for handling very large, complex proteins of arbitrary secondary and tertiary structure. The second area focused on advances in the efficiency of the algorithm ... |
|
| Object-Oriented Dynamic Bayesian Network-Templates for Modelling Mechatronic Systems |
19 SEP 2002 |
7 pages |
| Authors:
Harald Renninger; Hermann von Hasseln; DAIMLER CHRYSLER AG STUTTGART (GERMANY)
|
| The object-oriented paradigm is a new but proven technology for modelling mechatronics, i.e., multidisciplinary modelling. For many reasons the object-oriented approach is very much desirable also for qualitative models in system design, diagnosis or verification. Bayesian networks are a very robust technology for qualitative probabilistic modelling. In this paper we present a first approach in using the Bayesian networks modelling technique with the quantitative object-oriented method. Analogous to Modelica, an ... |
|
| Computing Minimal Conflicts for Rich Constraint Languages |
19 SEP 2002 |
5 pages |
| Authors:
Jakob Mauss; Mugur Tatar; DAIMLER CHRYSLER AG BERLIN (GERMANY) RESEARCH AND TECHNOLOGY
|
| We address here the following question: Given an inconsistent theory, find a minimal subset of it responsible for the inconsistency. Such conflicts are essential for problem solvers that make use of conflict-driven search, for interactive applications where explanations are required, or as supporting tools for consistency maintenance in knowledge-bases. Conflict computation in AI applications was usually associated with dependency recording as performed by TMSs. This techniques, however, have a rather ... |
|
| Design of Pipeline Analog-To-Digital Converters Via Geometric Programming |
SEP 2002 |
|
| Authors:
Maria del Mar Hershenson; BARCELONA DESIGN INC SUNNYVALE CA
|
| In this paper, a method for the design of analog-to-digital converters is presented. This method computes the sizes of the different components (transistors, capacitors, etc.) in a predefined ADC topology so that the design specifications are met in the desired process technology. The method is based on formulating the ADC design constraints such as specifications on power, signal-to-noise ratio (SNR), area, and sampling frequency in special convex form in terms ... |
|
| Algorithms For Approximation IV. Proceedings of the 2001 International Symposium |
2002 |
|
| Authors:
Jeremy Levesley; Iain Anderson; John C. Mason; HUDDERSFIELD UNIV (UNITED KINGDOM) SCHOOL OF COMPUTING AND MATHEMATICS
|
| The Final Proceedings for Algorithms for Approximation IV (A4A4), 16 July 2001-20 July 2001, a multidisciplinary conference addressing many areas of interest to the Air Force. Of primary interest are the potential applications to Modeling and Simulation. Specifically, the topics to be covered include in the following four major areas: Algorithms, Efficiency, Software, and Applications. Each major topic is divided into subtopics as follows: Algorithms- Approximation of Functions, Data Fitting, ... |
|
| Fifth SIAM Conference on Control and Its Applications. July 11 - 14, 2001, Town & Country Hotel, San Diego, CA |
30 NOV 2001 |
5 pages |
| Authors:
Anthony Bloch; William Hager; SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS PHILADELPHIA PA
|
| The SIAM Activity Group on Control and Systems Theory joined forces with the SIAM Annual Meeting in hosting the Fifth SIAM Conference on Control and Its Applications in San Diego. Short courses on Flow Control by Max Grunzburger and on Shape Optimization by Michel Delfour preceded the conference, setting the stage for a program that included 84 minisymposia and 13 invited presentations. 86% of the attendees were from academia, 9% ... |
|
| Model Fitting Using the Least Volume Criterion |
JUL 2001 |
8 pages |
| Authors:
Chris Tofallis; HERTFORDSHIRE UNIV SCHOOL OF BUSINESS (UNITED KINGDOM) DEPT OF STATISTICS ACCOUNTING AND MANAGEMENT SYSTEMS
|
| Given data on multiple variables we present a method for fitting a function to the data which, unlike conventional regression, treats all the variables on the same basis i.e. there is no distinction between dependent and independent variables. Moreover, all variables are permitted to have error and we do not assume any information is available regarding the errors. The aim is to generate law-like relationships between variables where the data ... |
|
| Accurate Approximation of Functions with Discontinuities, Using Low Order Fourier Coefficients |
JUL 2001 |
8 pages |
| Authors:
R. K. Wright; VERMONT UNIV BURLINGTON DEPT OF MATHEMATICS AND STATISTICS
|
| In previous work we introduced a method of using polynomial splines with appropriate discontinuities to approximate a piecewise smooth function f with jump discontinuities of f and f'. The information used is location of discontinuities, and low order, possibly noisy Fourier coefficients. The number of discontinuities was limited to two at most, and the discontinuities needed to lie at meshpoints in a uniform mesh. We showed that the linear operator ... |
|
| Large Algorithmic Methods for Dynamic System Management |
30 MAY 2001 |
5 pages |
| Authors:
Baruch Awerbuch; F. T. Leighton; JOHNS HOPKINS UNIV BALTIMORE MD DEPT OF COMPUTER SCIENCE
|
| The issue of uncertainty-tolerant computing has been largely ignored by algorithm designers, who focused on developing elegant mathematical structures for solving traditional combinatorial problems. Our goal is to build new algorithmic primitives for handling issues of uncertainty. The comprehensive algorithmic theory of decision-making in the presence of uncertainty may be applicable in domains outside of computer science, including control systems, economics, manufacturing, etc. |
|
| Issues in the Design and Optimization of Health Management Systems |
05 APR 2001 |
9 pages |
| Authors:
Michael Yukish; Carl Byington; Robert Campbell; PENNSYLVANIA STATE UNIV UNIVERSITY PARK APPLIED RESEARCH LAB
|
| The design of a health management system is presented as a decision problem. The decision space is affected by the choice of a particular health management system design and an employed maintenance policy. To the lst order, the evaluation objectives consist of the conflicting goals of minimizing purchase costs, minimizing operating costs, and maximizing availability. In order to assist and even automate the decision process, data and computational tools for ... |
|
| HOL2GDT a Formal Verification-Based Design Methodology |
APR 2001 |
122 pages |
| Authors:
Anand Chavan; Byoung Woo Min; Shiu-Kai Chin; SYRACUSE UNIV NY
|
| HOL2GDT is a VLSI design methodology. It starts with a design implementation description that is formally verified using the Higher Order Logic (HOL) theorem prover. This implementation description is translated into a hardware description language model by using a HOL2GDT compiler, and with this model a physical design layout is generated by using IC design placement and routing tools in Mentor Graphic's Generator Design Technology (GDT) package. Thus, the final ... |
|
| Covalidation of Dissimilarly Structured Models |
MAR 2001 |
155 pages |
| Authors:
Samuel A. Wright; AIR FORCE INST OF TECH WRIGHT-PATTERSONAFB OH
|
| A methodology is presented which allows comparison between models constructed under different modeling paradigms. Consider the following situation: Two models are constructed to study different aspects of the same system. One model simulates a fleet of aircraft moving a given combination of cargo and passengers from an onload point to an offload point. A second model is a linear programming model that optimizes the aircraft and route selection required for ... |
|
| Large-Scale Optimization Methods With a Focus on Chemistry Problems |
19 JAN 2001 |
10 pages |
| Authors:
Robert B. Schnabel; Richard H. Byrd; COLORADO UNIV AT BOULDER DEPT OF COMPUTER SCIENCE
|
| The objective of this research is to develop large scale optimization methods for optimization problems that arise in molecular chemistry. The main applications that are being targeted are problems whose solution is of direct and immediate interest to the Air Force, such as finding the structure of proteins and polymers. The primary optimization problem being considered is the large scale global optimization problem, via which protein structure can be determined. ... |
|
| From Materials to Missions Assess-Predict-Optimize: A Computational Approach to Adaptive Design |
2001 |
11 pages |
| Authors:
Anthony T. Patera; MASSACHUSETTS INST OF TECH CAMBRIDGE DEPT OF MECHANICAL ENGINEERING
|
| We develop an Assess-Predict-Optimize (APO) strategy for the adaptive design of optimal missions for critical components and systems. We first Assess the system - through non-destructive inverse procedures for evaluating the system characteristics of interest: this yields the many possible realizations of the system. We then Predict future behavior of the system - through various modeling and computational procedures: this translates the uncertainties in system characterization into ranges of performance. ... |
|
Reports by Keyword(s)
MATHEMATICAL PROGRAMMING
