In this paper, we propose a simple and efficient method to construct an accurate fuzzy classification system. In order to optimize the generalization accuracy, we use ruleweight as a simple mechanism to tune the classifier and propose a new learning method to iteratively adjust the weight of fuzzy rules. The rule-weights in the proposed method are derived by solving the minimization problem thr...

This paper presents a rapid initial weight computation method for adaptive array antennas. The proposed method estimates a correlation matrix using not only samples received with the desired signal but also those received from other sources. The proposed method reduces the number of known symbols required for weight convergence. Furthermore, the combined use of the proposed method and the decis...

Weight constraints represent an extension of logic programs under the answer set semantics that is essential for many applications to knowledge representation. The relation of this extension to the original semantics is an important topic. It has been proved that there exists a modular algorithm for eliminating weight constraints that is guaranteed to terminate in polynomial time under the assu...

A form of Gauss-Quadrature rule over [0,1] has been investigated that involves the derivative of the integrand at the pre-assigned left or right end node. This situation arises when the underlying polynomials are orthogonal with respect to the weight function (): 1 x x ω = − over [0,1]. Along the lines of Golub's work, the nodes and weights of the quadrature rule are computed from a Jacobi-type...

Cesàro (C, δ) means are studied for orthogonal expansions with respect to the weight function ∏d i=1 |xi |2κi on the unit sphere, and for the corresponding weight functions on the unit ball and the Jacobi weight on the simplex. A sharp pointwise estimate is established for the (C, δ) kernel with δ >−1 and for the kernel of the projection operator, which allows us to derive the exact order for t...