Rough communication of crisp concept in fuzzy approximation spaces

To study the problem of knowledge translation in fuzzy approximation spaces, the concept of rough communication of crisp set in fuzzy approximation spaces is proposed. In a rough communication of crisp set in fuzzy approximation spaces, the problem of uncertainty exists, for each agent has a different language and cannot provide precise communication to each other. By means of some concepts, such as CF rough communication cut, which is a bridge between fuzzy concept and crisp concept, cut analysis of CF rough communication is made, and the relation theorem between CF rough communication and rough communication of crisp concept is obtained. Finally, in order to give an intuitive analysis of the relation between CF rough communication and rough communication of crisp concept, an example is given.

Approximations by Ideal Minimal Structure with Chemical Application

The theory of rough set represents a non-statistical methodology for analyzing ambiguity and imprecise information.It can be characterized by two crisp sets,named the upper and lower approximations that are used to determine the boundary region and accurate measure of any subset.This article endeavors to achieve the best approximation and the highest accuracy degree by using the minimal structure approximation space MSAS via ideal J.The novel approach(indicated by JMSAS)modifies the approximation space to diminish the bound-ary region and enhance the measure of accuracy.The suggested method is more accurate than Pawlak’s and EL-Sharkasy techniques.Via illustrated examples,several remarkable results using these notions are obtained and some of their properties are established.Several sorts of near open(resp.closed)sets based on JMSAS are studied.Furthermore,the connections between these assorted kinds of near-open sets in JMSAS are deduced.The advantages and disadvan-tages of the proposed approach compared to previous ones are examined.An algorithm using MATLAB and a framework for decision-making problems are verified.Finally,the chemical application for the classification of amino acids(AAs)is treated to highlight the significance of applying the suggested approximation.

Operators of Approximations and Approximate Power Set Spaces

Boundary inner and outer operators are introduced, and union, intersection, complement operators of approximations are redefined. The approximation operators have a good property of maintaining union, intersection, complement operators, so the rough set theory has been enriched from the operator-oriented and set-oriented views. Approximate power set spaces are defined, and it is proved that the approximation operators are epimorphisms from power set space to approximate power set spaces. Some basic properties of approximate power set space are got by epimorphisms in contrast to power set space.

FIXED POINT THEOREMS AND BEST APPROXIMATION IN CONVEX METRIC SPACES

Results regarding best approximation and best Simultaneous approximation on convex metric spaces are Obtained.Existence of fixed points for an ultimately nonexpansive semigroup of mappings is also shown.

SOME BEST APPROXIMATION RESULTS IN LOCALLY CONVEX SPACES

In this note we obtain generalization of well known results of carbone and Conti,Sehgal and Singh and Tanimoto concerning the existence of best approximation and simultaneous best approximation of continuous Junctions from the set up of a normed space to the case of a Hausdorff locally convex space.

A SUPER-HALLEY TYPE APPROXIMATION IN BANACH SPACES

The Super-Halley method is one of the best known third-order iteration for solving nonlnear equations. A Newton-like method which is an approximation of this method is studied. Our approach yields a fourth R-order iterative process which is more efficient than its classical predecessor. We establish a Newton-Kantorovich-type convergence theorem using a new system of recurrence relations, and give an explicit expression for the a priori error bound of the iteration.

THE SIMULTANEOUS APPROXIMATION IN THE LOCALLY CONVEX SPACES

In this paper, we study the characterization of f-Chebyshev radius and f-Chebyshev centers and the existence of f-Chebyshev centers in locally convex spaces.

APPROXIMATION ORDER AND INTERPOLATION SPACES

In this paper we introduce the two-parameter operators on Abelian group and establish their interpolation theorems of approximation, which are extensions of the interpolation theorems for nonlinear best approximation by R. Devore and are suitable for the approximation of oprators.

ON THE APPROXIMATION OF TCHEBYCHEFF-FOURIER SERIES IN THE C SPACE AND L_p~ω SPACE

The degree of approximation to a function f(x)∈C[-1,1] by (U, λ) means and f(x) ∈ Lpw by (Jr) means are discussed, some results in the literatures [1],[2],[3] have been improved.

PADE APPROXIMANTS AS LIMITS OF RATIONAL FUNCTIONS OF BEST APPROXIMATION IN ORLICZ SPACE

In this paper, we prove that the best rational approximation of a given analytic function in Orlicz space L~*(G), where G = {|z|≤∈}, converges to the Pade approximants of the function as the measure of G approaches zero.

A structural topological optimization method for multi-displacement constraints and any initial topology configuration

In density-based topological design, one expects that the final result consists of elements either black （solid material） or white （void）, without any grey areas. Moreover, one also expects that the optimal topology can be obtained by starting from any initial topology configuration. An improved structural topological optimization method for multidisplacement constraints is proposed in this paper. In the proposed method, the whole optimization process is divided into two optimization adjustment phases and a phase transferring step. Firstly, an optimization model is built to deal with the varied displacement limits, design space adjustments, and reasonable relations between the element stiffness matrix and mass and its element topology variable. Secondly, a procedure is proposed to solve the optimization problem formulated in the first optimization adjustment phase, by starting with a small design space and advancing to a larger deign space. The design space adjustments are automatic when the design domain needs expansions, in which the convergence of the proposed method will not be affected. The final topology obtained by the proposed procedure in the first optimization phase, can approach to the vicinity of the optimum topology. Then, a heuristic algorithm is given to improve the efficiency and make the designed structural topology black/white in both the phase transferring step and the second optimization adjustment phase. And the optimum topology can finally be obtained by the second phase optimization adjustments. Two examples are presented to show that the topologies obtained by the proposed method are of very good 0/1 design distribution property, and the computational efficiency is enhanced by reducing the element number of the design structural finite model during two optimization adjustment phases. And the examples also show that this method is robust and practicable.

A survey on rough set theory and its applications

After probability theory, fuzzy set theory and evidence theory, rough set theory is a new mathematical tool for dealing with vague, imprecise, inconsistent and uncertain knowledge. In recent years, the research and applications on rough set theory have attracted more and more researchers＇ attention. And it is one of the hot issues in the artificial intelligence field. In this paper, the basic concepts, operations and characteristics on the rough set theory are introduced firstly, and then the extensions of rough set model, the situation of their applications, some application software and the key problems in applied research for the rough set theory are presented.

Construction Theory of Function on Local Fields

We establish the construction theory of function based upon a local field Kp as underlying space. By virture of the concept of pseudo-differential operator, we introduce ＂fractal calculus＂ （or, p-type calculus, or, Gibbs-Butzer calculus）. Then, show the Jackson direct approximation theorems, Bermstein inverse approximation theorems and the equivalent approximation theorems for compact group D（C Kp） and locally compact group Kp^＋-（= Kp）, so that the foundation of construction theory of function on local fields is established. Moreover, the Jackson type, Bernstein type, and equivalent approximation theorems on the HOlder-type space C^σ（Kp）, σ 〉0, are proved; then the equivalent approximation theorem on Sobolev-type space Wr（Kp）, σ≥0, 1≤r 〈∞, is shown.

Fuzzy rough sets in Sostak sense

In this paper,we defined the fuzzy operator Φ_(λ) in a fuzzy ideal approximation space(X,R,I)associated with a fuzzy rough set λ in Sostak sense.Associated with Φ_(λ),there are fuzzy ideal interior and closure operators int_(Φ)^(λ) and cl_(Φ)^(λ),respectively.r-fuzzy separation axioms,r-fuzzy connectedness and r-fuzzy compactness in fuzzy ideal approximation spaces are defined and compared with the relative notions in r-fuzzy approximation spaces.There are many differences when studying these notions related with a fuzzy ideal different from studying these notions in usual fuzzy approximation spaces.Lastly,using a fuzzy grill,we will get the same results given during the context.

Axis Problem of Rough 3-Valued Algebras

The collection of all the rough sets of an approximation space has been given several algebraic interpretations, including Stone algebras, regular double Stone algebras, semi-simple Nelson algebras, pre-rough algebras and 3-valued Lukasiewicz algebras. A 3-valued Lukasiewicz algebra is a Stone algebra, a regular double Stone algebra, a semi-simple Nelson algebra, a pre-rough algebra. Thus, we call the algebra constructed by the collection of rough sets of an approximation space a rough 3-valued Lukasiewicz algebra.In this paper,the rough 3-valued Lukasiewicz algebras, which are a special kind of 3-valued Lukasiewicz algebras, are studied. Whether the rough 3-valued Lukasiewicz algebra is a axled 3-valued Lukasiewicz algebra is examined.

Rough Sets in Approximate Solution Space

As a new mathematical theory, Rough sets have been applied to processing imprecise, uncertain and incomplete data. It has been fruitful in finite and non-empty set. Rough sets, however, are only served as the theoretic tool to discretize the real function. As far as the real function research is concerned, the research to define rough sets in the real function is infrequent. In this paper, we exploit a new method to extend the rough set in normed linear space, in which we establish a rough set,put forward an upper and lower approximation definition, and make a preliminary research on the property of the rough set.A new tool is provided to study the approximation solutions of differential equation and functional variation in normed linear space. This research is significant in that it extends the application of rough sets to a new field.

Approximation operators based on vague relations and roughness measures of vague sets

Rough set theory and vague set theory are powerful tools for managing uncertain, incomplete and imprecise information. This paper extends the rough vague set model based on equivalence relations and the rough fuzzy set model based on fuzzy relations to vague sets. We mainly focus on the lower and upper approxima- tion operators of vague sets based on vague relations, and investigate the basic properties of approximation opera- tors on vague sets. Specially, we give some essential characterizations of the lower and upper approximation operators generated by reflexive, symmetric, and transi- tive vague relations. Finally, we structure a parameterized roughness measure of vague sets and similarity measure methods between two rough vague sets, and obtain some properties of the roughness measure and similarity measures. We also give some valuable counterexamples and point out some false properties of the roughness measure in the paper of Wang et al.

Theory of (n) truth degrees of formulas in modal logic and a consistency theorem

The theory of （n） truth degrees of formulas is proposed in modal logic for the first time. A consistency theorem is obtained which says that the （n） truth degree of a modality-free formula equals the truth degree of the formula in two-valued propositional logic. Variations of （n） truth degrees of formulas w.r.t. n in temporal logic is investigated. Moreover, the theory of （n） similarity degrees among modal formulas is proposed and the （n） modal logic metric space is derived therefrom which contains the classical logic metric space as a subspace. Finally, a kind of approximate reasoning theory is proposed in modal logic.

A general approach to attribute reduction in rough set theory

The concept of a consistent approximation representation space is introduced. Many types of information systems can be treated and unified as consistent approximation representation spaces. At the same time, under the framework of this space, the judgment theorem for determining consistent attribute set is established, from which we can obtain the approach to attribute reductions in information systems. Also, the characterizations of three important types of attribute sets （the core attribute set, the relative necessary attribute set and the unnecessary attribute set） are examined.

SPECTRAL METHOD FOR MIXED INHOMOGENEOUS BOUNDARY VALUE PROBLEMS IN THREE DIMENSIONS

In this paper, we investigate spectral method for mixed inhomogeneous boundary value problems in three dimensions. Some results on the three-dimensional Legendre approxima- tion in Jacobi weighted Sobolev space are established, which improve and generalize the existing results, and play an important role in numerical solutions of partial differential equations. We also develop a lifting technique, with which we could handle mixed inho- mogeneous boundary conditions easily. As examples of applications, spectral schemes are provided for three model problems with mixed inhomogeneous boundary conditions. The spectral accuracy in space of proposed algorithms is proved. Efficient implementations are presented. Numerical results demonstrate their high accuracy, and confirm the theoretical analysis well.