Showing papers on "Bounding overwatch published in 1989"

An interval method for bounding level sets of parameter estimation problems

Abstract: A new method is presented using inclusive functions and interval arithmetic for bounding the level sets of nonlinear parameter estimation problems with objective function of sum-of-squares type The result box bounding a level set conveys more information for the user than the usual local minimum points do The rate of convergence is in general linear, in special cases it can be superlinear or higher The condition of convergence is studied, and examples are shown

Technical Note-A Generalized Bounding Method for Multifacility Location Models

Abstract: This paper develops a new lower bound for multifacility location problems with lp distances. We prove that the method produces superior results to other known procedures. The new bound is also computationally efficient.

On consistency of bounding operations in deterministic global optimization

Abstract: This technical comment refers to the discussion of strong consistency of several bounding procedures in Lemma 2.1 and Proposition 2.1 of Ref. 1. A necessary clarification is given of the notion of convergence φq → φ in Lemma 2.1, and a derivation of Proposition 2.1 is presented that includes a new and simple consistency proof of the classical bounding by convex envelopes used in many branch-and-bound procedures.

Bounding Techniques for Model-Structure Selection

Abstract: Structure-selection methods for regression-type models are discussed. Selection is based on parameter bounds, obtained by plotting in parameter space known deterministic bounds on the error between model output and observed output. One method examines the effect of imposing bounds on the sample autocorrelation of the errors, another detects near-degeneracy of the parameter bounds, and two methods aim to delete whichever parameter or combination of parameters is least well defined by the observations. The last two methods have close parallels with principal-component analysis and singular-value decomposition.

The bounding effect of is design tools: a critical examination of case technology

Abstract: Methodologies for information systems development bound the vocabulary of design (what arethe "things that matter?), as well as control the design discourse (how should we go aboutdiscussing them?) Computer Aided System Engineering tools - collectively referred to as "CASEtechnology" --further bound the analysis and design process both semantically (eg, the range ofavailable methodologies) and syntactically (eg, implementation details) In this paper we explorethe effects of bounding in CASE technology We first delineate the concept of bounding in generalterms, and then develop a more operational notion of it through the qualitative examination of anactual use of a CASE tool This examination results in a preliminary list of concrete dimensions ofthe bounding phenomenon, which is in turn used to guide a critical survey of related features incurrent CASE technology, Implications for practice, education and research are discussed

Tracking of two crossing targets using bounding methods

Abstract: One of the basic ambiguous situations in multitarget tracking is the scenario of two crossing targets. When two tracks are crossing each other, it may be very difficult to determine which measurement belongs to which target. In this situation, miscorrelation could occur. One of the factors causing miscorrelation is the noise additive to the observations. Given the noise bounds and a state-variable model for the target dynamics and observation process, each observation yields bounds on the state of the target. As more observations are made, the new state bounds cause the uncertainty in target state to contract. Alternatively, the track parameters such as initial position, velocity and acceleration may be bounded and bounds on the target's state at any instant inferred from them. A particular type of bounding method is the ellipsoidal bounding method introduced by Schweppe (1968) and further developed by Fogel and Huang (1982). Ellipsoidal bounding is in fact a sequential process. In the present investigation, ellipsoidal bounding is applied for target motion in one dimension.

New methods for bounding adaptive filter poles

Abstract: A method of bounding the coefficients of autoregressive moving average (ARMA) filters which guarantees strict sense stability (poles remain inside the unit circle) is presented. The method is general, and can be used to stabilize any filter which has a proper rational transfer function. Applications of Kharitonov's theorem or the more general D-stability theory, with additional constraints, yield optimal coefficient bounds which can be computed offline. In contrast to previous bounding approaches, these methods apply to filters of arbitrary order. Poles can also be restricted to lie within any specified simply-connected regions of the z-plane. Significant improvements in convergence behavior and stability are noted. >

A post sgriptum to bounding the internal rates of return of a project

Abstract: In the author's recent paper, “On Bounding the Internal Rates of Return of a Project” (The Engineering Economist, Vol. 33, No. 3, Spring 1988, pp. 235-271) four new bounds to the Internal Rates of Return of a project, along with two old ones, have been introduced and illustrated with numerical examples. In the current contribution, an interesting and, indeed, initially a rather confusing feature of two of the six bounding approaches the capability of yielding a lower bound greater than the upper one is presented and explained. It is also proven that the four remaining approaches do not possess this feature.