location, 39accessible, 78annotation statement, 86assert, 89assignable, 78assume, 88augmented postcondition, 83augmented precondition, 83axiom, 42 Behavioral Interface Speci cation Lan-guage, 1behavioral subtype, 25\bigint, 12, 48 call stack, 17, 18class, 12Class (type), 12code fragment, 12annotated, 12constraint, see history const...

The author has found many applications in machine vision of Constraint Networks based upon an Augmented Lagrangian formulation. This paper discusses two of the more fundamental applications: to provide a generalization of the Harris Coupled Depth-Slope analog network, and as a method of implementing data fusion (such as between two visual modules). Index Tenns-Computer vision, data fusion, neur...

In this paper, the problem of finding the set of all real solutions to a system of n nonlinear general form algebraic equations contained in a given n-dimensional box (the global analysis problem) is considered. A new iterative interval method for solving the global analysis problem is suggested. It is based on the following techniques: (i) transformation of the original system into an augmente...

In this paper, we consider the problem of maximizing a monotone submodular function subject to a knapsack constraint in the streaming setting. In particular, the elements arrive sequentially and at any point of time, the algorithm has access only to a small fraction of the data stored in primary memory. For this problem, we propose a (0.363− ε)-approximation algorithm, requiring only a single p...

For the spherical model with nearest-neighbour interactions, the microcanonical entropy s(ε,m) is computed analytically in the thermodynamic limit for all accessible values of the energy ε and the magnetization m per spin. The entropy is found to be a concave function, implying that the microcanonical and the canonical ensemble are equivalent, despite the long-range nature of the spherical cons...

The redundancy allocation problem (RAP) has been studied for many different system structures, objective functions, and distribution assumptions. In this paper, we present a problem formulation and a solution methodology to maximize the system steady-state availability and minimize the system cost for the repairable series-parallel system designs. In the proposed approach, the components’ time-...

Chang H-W, Wu V-C, Huang C-Y, Huang H-Y, Chen Y-M, Chu T-S, Wu K-D, Hsieh B-S. D4 dopamine receptor enhances angiotensin II-stimulated aldosterone secretion through PKC-ε and calcium signaling. Am J Physiol Endocrinol Metab 294: E622–E629, 2008. First published January 2, 2008; doi:10.1152/ajpendo.00657.2007.—Aldosterone secretion is subjected to dopaminergic regulation. Our previous study show...

This paper presents a filter-based artificial fish swarm algorithm for solving nonconvex constrained global optimization problems. Convergence to an ε-global minimizer is guaranteed. At each iteration k, the algorithm requires a (ρ(k),ε(k))-global minimizer of a bound constrained bi-objective subproblem, where as k→ ∞, ρ(k)→ 0 gives the constraint violation tolerance and ε(k)→ ε is the error bo...

This paper aims to solve the problem of robust model predictive control, contradiction system robustness, and conservative terminal constraint set range. A control (RMPC) method based on an ε-approximation single-tube is proposed. We construct a RMPC structure for linear discrete time invariant systems with additive disturbances. To this structure, we add state estimation feedback improve conve...

We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r ∈ P , and a length constraint B, one needs to find a path starting from r that visits as many points of P as possible and of length not exceeding B. We present a (1 − ε)-approximation algorithm for this problem that runs in nO(1/ε) time; the computed path visits at least (1 − ε)kopt points of...