An improved stability analysis method is presented for fuzzy logic control systems which is not restricted to plants requiring a linear control system. An illustrative example in which the plant has a control-dependen...
详细信息
An improved stability analysis method is presented for fuzzy logic control systems which is not restricted to plants requiring a linear control system. An illustrative example in which the plant has a control-dependent function composed of piecewise linear functions, saturation functions and a deadband is given.
The inference network model of information retrieval allows for a probabilistic interpretation of query operators. In particular, Boolean query operators are conveniently modeled as link matrices of the Bayesian Netwo...
详细信息
The inference network model of information retrieval allows for a probabilistic interpretation of query operators. In particular, Boolean query operators are conveniently modeled as link matrices of the Bayesian Network. Prior work has shown, however, that these operators do not perform as well as the the pnorm operators used for modeling query operators in the context of the vector space model. This motivates the search for alternative probabilistic formulations for these operators. The design of such alternatives must contend with the issue of computational tractability, since the evaluation of an arbitrary operator requires exponential time. We define a flexible class of link matrices that are natural candidates for the implementation of query operators and an O(n(2)) algorithm (n = the number of parent nodes) for the computation of probabilities involving link matrices of this class;We present experimental results indicating that Boolean operators implemented in terms of link matrices from this class perform as well as pnorm operators in the context of the INQUERY inference network.
Let SG denote the Sierpinski gasket with Hausdorff measure mu of dimension log 3/log 2, let PLk denote the continuous piecewise linear functions with respect to the usual triangulation of SG into gk triangles and let ...
详细信息
Let SG denote the Sierpinski gasket with Hausdorff measure mu of dimension log 3/log 2, let PLk denote the continuous piecewise linear functions with respect to the usual triangulation of SG into gk triangles and let W-k denote the orthogonal complement of PLk-1 in PLk. We construct a basis for each W-k, so that the entire collection is a frame for L-2(d mu). This wavelet basis is obtained from three wavelet generators by scaling, translation and rotation, and the wavelets are supported either by one corner triangle or a pair of adjacent triangles in the triangulation of level k-1. Analogous bases are constructed in the von Koch curve, the hexagasket, and the n-dimensional analog of SG.
This paper is concerned with the development of an improvement algorithm for the linear Complementarity Problem (LCP). Our approach to find a solution to LCP is to solve the equivalent Constrained Optimization Problem...
详细信息
This paper is concerned with the development of an improvement algorithm for the linear Complementarity Problem (LCP). Our approach to find a solution to LCP is to solve the equivalent Constrained Optimization Problem (COP) of maximizing the sum of the minimum of each complementary pair of variables, subject to the constraints that each such minimum is nonpositive. The algorithm, ascent in nature, is similar to the simplex method in the sense that it moves between basic points of an associated system of linear equations. These basic points are feasible to our COP whose objective function is piecewiselinear and concave. Classes of matrices are characterized for which our algorithm processes LCP for every right hand side vector and every matrix in the class. A computational study shows that our algorithm is clearly superior to a previos improvement algorithm. Computational comparisons with Lemke's well known algorithm are also presented.
Consider a system which evolves in n-space from x to f(x)f(x)f(x) as time moves from t to <span class="MathJax" id="MathJax-Element-2-Frame" tabindex="0" style="position: relative...
详细信息
In the formulation of fuzzy linear programming proposed by Zimmermann, it is assumed that fuzzy goals and fuzzy constraints are explicitly given as fuzzy sets on appropriate real lines respectively and are actually ch...
详细信息
In the formulation of fuzzy linear programming proposed by Zimmermann, it is assumed that fuzzy goals and fuzzy constraints are explicitly given as fuzzy sets on appropriate real lines respectively and are actually characterized by membership functions in linear form. For relaxing those assumptions, two kinds of extensions are derived in this paper. In the first extension, it is shown that fuzzy goals and fuzzy constraints expressed as fuzzy relations with fuzzy parameters can be treated as fuzzy sets on different real lines under some assumptions. In the second extension, it is shown that optimization in the case where the membership functions of the fuzzy goals and the fuzzy constraints are given in piecewiselinear form can be achieved by using a standard linear programming technique repetitionally.
The idea of continuation applied to the proximal transform of a polyhedral convex function is used to develop a general procedure for the construction of descent algorithms which has the property that it specializes t...
详细信息
The idea of continuation applied to the proximal transform of a polyhedral convex function is used to develop a general procedure for the construction of descent algorithms which has the property that it specializes to variants of the projected gradient method when applied to such problems as l1
暂无评论