Showing papers on "Bounding overwatch published in 1993"
02 Jun 1993
TL;DR: In this article, an adaptive control design procedure for a class of nonlinear systems with both parametric uncertainty and unknown nonlinearities is presented, and the overall adaptive scheme is shown to guarantee global uniform ultimate boundedness.
Abstract: An adaptive control design procedure for a class of nonlinear systems with both parametric uncertainty and unknown nonlinearities is presented. The unknown nonlinearities lie within some "bounding functions" which are assumed to be partially known. The key assumption is that the uncertain terms satisfy a "triangularity condition." As illustrated by examples, the proposed design procedure expands the class of nonlinear systems for which global adaptive stabilization methods can be applied. The overall adaptive scheme is shown to guarantee global uniform ultimate boundedness.
170 citations
TL;DR: Predictive bounding control is introduced, which contrasts with existing self-tuning control methods which base control synthesis on a nominal plant model and permits detection of abrupt plant changes and adaptive tracking of time-varying plant characteristics.
61 citations
01 Jan 1993
TL;DR: Better techniques to lower bound the size of the minimum subgraphs are provided, which allows us to achieve approximation factors of a and $ respectively, thereby improving on existing algorithms that achieve NP-hard results.
Abstract: We consider the problems of finding minimum P-edge connected and P-vertex connected subgraphs in a given graph. These problems are NP-hard. We provide better techniques to lower bound the size of the minimum subgraphs. This allows us to achieve approximation factors of a and $ respectively, thereby improving on existing algorithms that achieve
55 citations
34 citations
01 Jul 1993
27 citations
TL;DR: Unified branch-and-bound and cutting plane algorithms for global minimization of a functionf(x, y) over a certain closed set are proposed and can be applied implementably for a certain class of nonconvex programming problems.
Abstract: We propose unified branch-and-bound and cutting plane algorithms for global minimization of a functionf(x, y) over a certain closed set By formulating the problem in terms of two groups of variables and two groups of constraints we obtain new relaxation bounding and adaptive branching operations The branching operation takes place in y-space only and uses the iteration points obtained through the bounding operation The cutting is performed in parallel with the branch-and-bound procedure The method can be applied implementably for a certain class of nonconvex programming problems
11 citations
TL;DR: The purpose of this paper is to present general approaches for bounding some multi-stage stochastic programs from above, based on restricting the solution set, such that the remaining multi- stages of the program is easy to solve.
Abstract: The purpose of this paper is to present general approaches for bounding some multi-stage stochastic programs from above. The results are based on restricting the solution set, such that the remaining multi-stage stochastic program is easy to solve. An example where the methods can be applied is presented.
8 citations
15 Dec 1993
TL;DR: Cross-covariance constraints on the noise are introduced into bounded error identification as an alternative to the standard time-domain noise constraints, represented by a small number of linear inequalities, which can be used in parameter bounding by linear programming.
Abstract: Cross-covariance constraints on the noise are introduced into bounded error identification as an alternative to the standard time-domain noise constraints. The constraints are represented by a small number of linear inequalities, which can be used in parameter bounding by linear programming. An important feature of this new type of noise bound is that under fairly general conditions the feasible parameter set converges to the true parameter vector, the noise bounds need not be tight. A procedure is presented to estimate the cross-covariance bounds on the noise from data, such that asymptotically they will be correct with any prespecified probability desired. Also another noise constraint, a bound on the amplitude of the discrete Fourier transform of the noise, is introduced into time-domain parameter bounding identification. This frequency domain constraint on the noise is analysed as well. >
4 citations
01 Jun 1993
TL;DR: In this paper, the canonical-form method is proposed to find the smallest bounding box of the root of a CSG object, which is shown to be a lattice.
Abstract: Constructive solid geometry (CSG) defines objects as Boolean combinations of primitive solids, and usually stores them in binary trees. A bounding entity is an upper estimate of the extent of a CSG object. One of the problems in CSG is the search for the smallest bounding box of an object with the bounding boxes of the leaves as input. A method is presented that finds the smallest bounding box of the root; only prismatic boxes are considered. The method, called the canonical-form method, introduces an algebra of boxes which is shown to be a lattice. The lattice properties are then used to prove that the algorithm that computes the bounding boxes achieves a better approximation than the others. Some hints on implementation are then presented, and the efficiency of the method is compared with the S-bound method.
4 citations
TL;DR: This paper presents new procedures for obtaining upper and lower bounds in the cost minimization of multistage dynamic networks with random link capacities and contrasts them to existing methods.
Abstract: This paper presents new procedures for obtaining upper and lower bounds in the cost minimization of multistage dynamic networks with random link capacities and contrasts them to existing methods. These methods include adaptation of Jensen's inequality to the problem, Monte-Carlo simulations and an analytical approximation procedure. The new bounding procedures involve a backward pass in the network coupled with a linear approximation at each stage. Some numerical results are presented for networks of substantial size. © 1993 by John Wiley & Sons, Inc.
TL;DR: The numerical treatment of the dynamic response of an underwater cable, constrained by a frictionless rigid sea profile, by the use of an upper bounding algorithm is considered in this article.
Posted Content•
TL;DR: The study of families of functions on the natural numbers was studied in this article, with emphasis on the bounded families, and the problem of classifying the families according to their bounding and dominating numbers, the traditional scheme for gaps, was considered.
Abstract: We pursue the study of families of functions on the natural numbers, with emphasis here on the bounded families. The situation being more complicated than the unbounded case, we attack the problem by classifying the families according to their bounding and dominating numbers, the traditional scheme for gaps. Many open questions remain.
06 Sep 1993
TL;DR: New, efficient methods for determining the lower and upper bounds on the probabilities of input-output communication in a multistage interconnection network are introduced and a novel lower bounding and upper bounding strategy are presented.
Abstract: Multistage interconnection networks are widely used in multiprocessing environment. The authors introduce new, efficient methods for determining the lower and upper bounds on the probabilities of input-output communication in a multistage interconnection network. A novel lower bounding strategy (shifting) and a novel upper bounding strategy (averaging) are presented. They can be combined with existing methods based on coherence and on consecutive cuts, to obtain an improvement on previously known efficiently computable bounds. The applications in broadcasting and permutation capabilities of interconnection networks, are discussed.
TL;DR: In this article, the authors show that concurrent systems satisfy timing constraints on their behavior, which may be essential for critical applications, but may be difficult to demonstrate for many real-world applications.
Abstract: Showing that concurrent systems satisfy timing constraints on their behavior is difficult, but may be essential for critical applications Most methods are based on some form of reachability analys
TL;DR: This work presents an elaborate computation of realistic probabilities, and its application to a design space bounding strategy, and results show that computed probabilities and bounding Strategy are good.