Some robust objectives of FCM for data analyzing

There are many data clustering techniques available to extract meaningful information from real world data, but the obtained clustering results of the available techniques, running time for the performance of clustering techniques in clustering real world data are highly important. This work is strongly felt that fuzzy clustering technique is suitable one to find meaningful information and appropriate groups into real world datasets. In fuzzy clustering the objective function controls the groups or clusters and computation parts of clustering. Hence researchers in fuzzy clustering algorithm aim is to minimize the objective function that usually has number of computation parts, like calculation of cluster prototypes, degree of membership for objects, computation part for updating and stopping algorithms. This paper introduces some new effective fuzzy objective functions with effective fuzzy parameters that can help to minimize the running time and to obtain strong meaningful information or clusters into the real world datasets. Further this paper tries to introduce new way for predicting membership, centres by minimizing the proposed new fuzzy objective functions. And experimental results of proposed algorithms are given to illustrate the effectiveness of proposed methods.     

模糊推理三I算法的逻辑基础

在模糊推理理论中，近期问世的三I推理方法以逻辑蕴涵运算取代传统的合成运算，从根本上改进了传统的合成推理规则(即CRI方法)。本文基于模糊命题逻辑的形式演绎系统L^*和模糊谓词逻辑的一阶系统K^*，构建了一个完备的多型变元一阶系统Kms^*，并且将三I算法完全纳入了模糊逻辑的框架之中，从而为模糊推理奠定了严格的逻辑基础。     

Numerical simulation based on fuzzy stochastic analysis

In this paper mathematical methods for fuzzy stochastic analysis in engineering applications are presented. Fuzzy stochastic analysis maps uncertain input data in the form of fuzzy random variables onto fuzzy random result variables. The operator of the mapping can be any desired deterministic algorithm, e.g. the dynamic analysis of structures. Two different approaches for processing the fuzzy random input data are discussed. For these purposes two types of fuzzy probability distribution functions for describing fuzzy random variables are introduced. On the basis of these two types of fuzzy probability distribution functions two appropriate algorithms for fuzzy stochastic analysis are developed. Both algorithms are demonstrated and compared by way of an example.     

A comparison of heuristic best-first algorithms for bicriterion shortest path problems

A variety of algorithms have been proposed to solve the bicriterion shortest path problem. This article analyzes and compares the performance of three best-first (label-setting) algorithms that accept heuristic information to improve efficiency. These are NAMOA^∗, MOA^∗, and Tung & Chew’s algorithm (TC). A set of experiments explores the impact of heuristic information in search efficiency, and the relative performance of the algorithms. The analysis reveals that NAMOA^∗ is the best option for difficult problems. Its time performance can benefit considerably from heuristic information, though not in all cases. The performance of TC is similar but somewhat worse. However, the time performance of MOA^∗ is found to degrade considerably with the use of heuristic information in most cases. Explanations are provided for these phenomena.     

A numerical method for mass spectral data analysis

The new generation of mass spectrometers produces an astonishing amount of high-quality data in a brief period of time, leading to inevitable data analysis bottlenecks. Automated data analysis algorithms are required for rapid and repeatable processing of mass spectra containing hundreds of peaks, the part of the spectra containing information. New data processing algorithms must work with minimal user input, both to save operator time and to eliminate inevitable operator bias. Toward this end an accurate mathematical algorithm is presented that automatically locates and calculates the area beneath peaks. The promising numerical performance of this algorithm applied to raw data is presented.     

Mining information from time series in the form of sentences of natural language

The goal of this paper is to provide a more detailed explanation of the principles how special formulas that characterize properties of trend of time series can be formed and how they are interpreted. Then we show how these formulas can be used in a tectogrammatical tree that construes special sentences of natural language, using which information on behavior of time series is provided. We also outline the principles of mining this information. The last part is devoted to application of the theory of intermediate quantifiers to mining summarized information on time series also in sentences of natural language.     

第二炮兵遭袭样式Fuzzy预测模型

运用模糊数学模式识别的方法，对反映第二炮兵遭袭可能样式的各种情报进行综合分析，其结果可作为预测战争发展的依据。     

Research on two different mathematical theories on control

With a brand-new theory, this paper not only provides the differences of attributes in concept, formula expression and function type between fuzzy rough sets and probability statistics, but also introduces their differences in algorithms on target control for better solving the control problem. Some new definitions and theorems concerning fuzzy rough sets and probability statistics are given, but this paper mainly makes a comparison of two control algorithms for the target tracking. The simulation results show that the comprehensive performance of the fuzzy rough sets algorithm is better than that of the probability statistics algorithm, but its control effect is not as good as that of the latter on multisensor target control. Finally, some problems concerning the combination of fuzzy rough sets and the probability statistics phenomenon to be solved and development trends are discussed. By these investigations, we can choose the optimal control algorithms for accomplishing better target control.     

Numerical analysis for factorial data analysis. Part II: Special purpose hardware—the programmable systolic array SARDA

The second part of this paper deals with the systolic implementation of the computational kernel for factorial data analysis, defined in Part I, on special-purpose hardware. The framework of the study is that a sequence of different algorithms has to be performed on a unique hardware array. This fact has led us to the design of the programmable systolic array SARDA: this is a triangular array which consists of programmable nodes with local memory and programmable orthogonal connections.     

The reduction method,II

In part I of this paper focusing on a further development of the well-known algorithms for deriving theorems of the method of Lyapunov vector functions, we suggested the reduction method as a logical technique for formulating hypotheses. This part illustrates its implementation in qualitative analysis of the various properties of dynamical systems represented as systems of motions, differential equations, and automata models with different depths of delays.     

Schwarz alternating and iterative refinement methods for mixed formulations of elliptic problems,part II: Convergence theory

Summary In this paper we discuss bounds for the convergence rates of several domain decomposition algorithms to solve symmetric, indefinite linear systems arising from mixed finite element discretizations of elliptic problems. The algorithms include Schwarz methods and iterative refinement methods on locally refined grids. The implementation of Schwarz and iterative refinement algorithms have been discussed in part I. A discussion on the stability of mixed discretizations on locally refined grids is included and quantiative estimates for the convergence rates of some iterative refinement algorithms are also derived.Department of Mathematics, University of Wyoming, Laramie, WY 82071-3036. This work was supported in part by the National Science Foundation under Grant NSF-CCR-8903003, while the author was a graduate student at New York University, and in part by NSF Grant ASC 9003002, while the author was a Visiting, Assistant Researcher at UCLA.     

扰动值模糊推理的三I算法

以D2上的三角模及其伴随为基础,给出了扰动值模糊推理的三I算法,为模糊信息处理的方法和应用提供了新的理论基础。     

A numerical evaluation of some collinear scaling algorithms for unconstrained

Collinear scaling algorithms for unconstrained minimization were first proposed by Davidon (1977,80) so that they may incorporate more information about the problem than is possible with quasi–Newton algorithms. Sorensen (1980,82), and Ariyawansa (1983,90) have derived collinear scaling algorithms as natural extensions of quasi–Newton algorithms. In this paper we describe the results of a comprehensive numerical evaluation of four members in the classes of collinear scaling algorithms derived by Sorensen (1980,82) and Ariyawansa (1983,90), relative to the quasi–Newton algorithms they extend.     

An interdependency index for the outputs of uncertain systems

The study of mechanical systems with uncertain parameters is gaining increasing interest in the field of system analysis to provide an expedient model for the prediction of the system behavior. Making use of the Transformation Method, the uncertain parameters of the system are modeled by fuzzy numbers in contrast to random numbers used in stochastic approaches. As a result of this analysis, a quantification of the overall uncertainty of the system outputs, including a worst-case scenario, is obtained. The inputs of the resulting fuzzy-valued model are a priori uncorrelated but after the uncertainties are propagated through the model, interdependency (or interaction) between the outputs may arise. If such interdependency is neglected, a misinterpretation of the results may occur. For example, in the case of applying uncertainty analysis in the early design phase of a product to determine the relevant design-parameter space, the interdependency between the design variables may reduce significantly the available part of the design space. This paper proposes a measure of interdependency between the uncertain system outputs. The interdependency index can be derived by a postprocessing of the data gained by the analysis with the Transformation Method. Such information can be obtained by a negligible amount of extra computation time.     

Selective Gram–Schmidt orthonormalization for conic cutting surface algorithms

It is not straightforward to find a new feasible solution when several conic constraints are added to a conic optimization problem. Examples of conic constraints include semidefinite constraints and second order cone constraints. In this paper, a method to slightly modify the constraints is proposed. Because of this modification, a simple procedure to generate strictly feasible points in both the primal and dual spaces can be defined. A second benefit of the modification is an improvement in the complexity analysis of conic cutting surface algorithms. Complexity results for conic cutting surface algorithms proved to date have depended on a condition number of the added constraints. The proposed modification of the constraints leads to a stronger result, with the convergence of the resulting algorithm not dependent on the condition number. Research supported in part by NSF grant number DMS-0317323. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation.     

Solving the knapsack problem with imprecise weight coefficients using genetic algorithms

This paper investigates solving the knapsack problem with imprecise weight coefficients using genetic algorithms. This work is based on the assumption that each weight coefficient is imprecise due to decimal truncation or coefficient rough estimation by the decision-maker. To deal with this kind of imprecise data, fuzzy sets provide a powerful tool to model and solve this problem. We investigate the possibility of using genetic algorithms in solving the fuzzy knapsack problem without defining membership functions for each imprecise weight coefficient. The proposed approach simulates a fuzzy number by distributing it into some partition points. We use genetic algorithms to evolve the values in each partition point so that the final values represent the membership grade of a fuzzy number. The empirical results show that the proposed approach can obtain very good solutions within the given bound of each imprecise weight coefficient than the fuzzy knapsack approach. The fuzzy genetic algorithm concept approach is different, but gives better results than the traditional fuzzy approach.     

Incorporating one-way substitution policy into the newsboy problem with imprecise customer demand

This paper presents an approach for solving an inventory model for single-period products with maximizing its expected profit in a fuzzy environment, in which the retailer has the opportunity for substitution. Though various structures of substitution arise in real life, in this study we consider the fuzzy model for two-item with one-way substitution policy. This one-way substitutability is reasonable when the products can be stored according to certain attribute levels such as quality, brand or package size. Again, to describe uncertainty usually probability density functions are being used. However, there are many situations in real world that utilize knowledge-based information to describe the uncertainty. The objective of this study is to provide an analysis of single-period inventory model in a fuzzy environment that enables us to compute the expected resultant profit under substitution. An efficient numerical search procedure is provided to identify the optimal order quantities, in which the utilization of imprecise demand and the use of one-way substitution policy increase the average expected profit. The benefit of product substitution is illustrated through numerical example.     

A fully distributed ADMM-based dispatch approach for virtual power plant problems

In this paper, a fully distributed approach is proposed for a class of virtual power plant (VPP) problems. By characterizing two specific VPP problems, we first give a comprehensive VPP formulation that maximizes the economic benefit subjected to the power balance constraint, line transmission limits and local constraints of all distributed energy resources (DERs). Then, utilizing the alternating direction method of multipliers and consensus optimization, a distributed VPP dispatch algorithm is developed for the general VPP problem. In particular, Theorem 1 is derived to show the convergence of the algorithm. The proposed algorithm is completely distributed without requiring a centralized controller, and each DER is regarded as an agent by implementing local computation and only communicates information with its neighbors to cooperatively find the globally optimal solution. The algorithm brings some advantages, such as the privacy protection and more scalability than centralized control methods. Furthermore, a new variant of the algorithm is presented for improving the convergence rate. Finally, several case studies are used to illustrate the efficiency and effectiveness of the proposed algorithms.     

Supervised fuzzy pattern recognition

This paper is devoted to the problem of supervised fuzzy pattern recognition. The cases with non-fuzzy and fuzzy labels are considered. Based on the properties of linearly separable fuzzy classes, some algorithms are proposed for building matching functions of these classes. All algorithms are computer oriented and can be implemented for the automatic recognition of fuzzy patterns.     

An advanced quality function deployment model using fuzzy analytic network process

Quality function deployment (QFD) is a customer-oriented design tool used to ensure that the voice of customers is employed throughout the product planning and design stages. QFD uses the house of quality (HOQ), which is a matrix that provides a conceptual map for inter-functional planning and communication. In this paper, an advanced QFD model, based on fuzzy analytic network process (ANP) approach, is proposed to systematically take into account the interrelationship between and within the QFD components. The proposed method is aimed at expanding the current research scope from the product planning phase to the part deployment phase to provide product developers with more valuable information (ex. the importance and bottleneck level of part characteristics). Both customer requirements and the company’s production demands will be used as the inputs for the QFD process to enhance the completeness and accuracy of the QFD analysis results. A case study is presented to illustrate the application of the proposed method.