tizzy k nearest neighbor rule (k-NNR) has been applied in a variety of substantive areas. Yang and Chen [l] described a fuzzy generalized k-NN algorithm which is a unified approach to a variety of fuzzy k-NNR’s. They created the strong consistency of posterior risk of the fuzzy generalized NNR. In this paper, we give their convergence rate. That is, the convergence rate of posterior risk of the...

An implicit numerical integration algorithm based on generalized coordinate partitioning is presented for the numerical solution of differential–algebraic equations of motion arising in multibody dynamics. The algorithm employs implicit numerical integration formulas to express independent generalized coordinates and their first time derivative as functions of independent accelerations at discr...

We introduce the automatic recording constraint (ARC) that can be used to model and solve scheduling problems where tasks may not overlap in time and the tasks linearly exhaust some resource. Since achieving generalized arc-consistency for the ARC is NP-hard, we develop a filtering algorithm that achieves approximated consistency only. Numerical results show the benefits of the new constraint o...

Some vector and operator generalized trapezoidal inequalities for continuous functions of selfadjoint operators in Hilbert spaces are given. Applications for power and logarithmic functions of operators are provided as well.

in this paper, we interpret a fuzzy differential equation by using the strongly generalized differentiability concept. utilizing the generalized characterization theorem. then a novel hybrid method based on learning algorithm of fuzzy neural network for the solution of differential equation with fuzzy initial value is presented. here neural network is considered as a part of large eld called n...

We present an approach to learn fuzzy binary decision rules from ordinal temporal data where the task is to classify every instance at each point in time. We assume that one class is preferred to the other, e.g. the undesirable class must not be misclassified. Hence it is appealing to use the Variable Consistency Dominance-based Rough Set Approach (VC-DRSA) to exploit preference information abo...

in this paper, we study the generalized bin covering problem. for this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. to nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. by computational experiments, the eciency of the heuristic algorithm is assessed.

An iterative regularization path with structural sparsity is proposed in this paper based on variable splitting and the Linearized Bregman Iteration, hence called Split LBI. Despite its simplicity, Split LBI outperforms the popular generalized Lasso in both theory and experiments. A theory of path consistency is presented that equipped with a proper early stopping, Split LBI may achieve model s...