Strong Uniqueness of Best Approximations from RS-sets in Banach Spaces

The problem of strong uniqueness of best approximation from an RS set in a Banach space is considered. For a fixed RS set G and an element x∈X , we proved that the best approximation g * to x from G is strongly unique.

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.

Lower Approximation Reduction in Ordered Information System with Fuzzy Decision

Attribute reduction is one of the most important problems in rough set theory. This paper introduces the concept of lower approximation reduction in ordered information systems with fuzzy decision. Moreover, the judgment theorem and discernable matrix are obtained, in which case an approach to attribute reduction in ordered information system with fuzzy decision is constructed. As an application of lower approximation reduction, some examples are applied to examine the validity of works obtained in our works..

THE STRUCTURE AND APPROXIMATION OF A.S. SELF-SIMILAR SET

The structure of any a.s. self-similar set K(w) generated by a class of random elements {gn,wσ} taking values in the space of contractive operators is given and the approximation of K(w) by the fixed points {Pn,wσ} of {gn,ow} is obtained. It is useful to generate the fractal in computer.

Notes on Rough Set Approximations and Associated Measures

We review and compare two definitions of rough set approximations.One is defined by a pair of sets in the universe and the other by a pair of sets in the quotient universe.The latter definition,although less studied,is semantically superior for interpreting rule induction and is closely related to granularity switching in granular computing.Numerical measures about the accuracy and quality of approximations are examined.Several semantics difficulties are commented.

Degree of Approximation of Conjugate of Signals (Functions) by Lower Triangular Matrix Operator

In the present paper, an attempt is made to obtain the degree of approximation of conjugate of functions (signals) belonging to the generalized weighted W(LP, ξ(t)), (p ≥ 1)-class, by using lower triangular matrix operator of conjugate series of its Fourier series.

BEST APPROXIMATION BY DOWNWARD SETS WITH APPLICATIONS

We develop a theory of downward sets for a class of normed ordered spaces. We study best approximation in a normed ordered space X by elements of downward sets, and give necessary and sufficient conditions for any element of best approximation by a closed downward subset of X. We also characterize strictly downward subsets of X, and prove that a downward subset of X is strictly downward if and only if each its boundary point is Chebyshev. The results obtained are used for examination of some Chebyshev pairs （W,x）, where ∈ X and W is a closed downward subset of X

Methods for Lower Approximation Reduction in Inconsistent Decision Table Based on Tolerance Relation

It is well known that most of information systems are based on tolerance relation instead of the classical equivalence relation because of various factors in real-world. To acquire brief decision rules from the information systems, lower approximation reduction is needed. In this paper, the lower approximation reduction is proposed in inconsistent information systems based on tolerance relation. Moreover, the properties are discussed. Furthermore, judgment theorem and discernibility matrix are obtained, from which an approach to lower reductions can be provided in the complicated information systems.

A REMARK ON LIMINF SETS IN DIOPHANTINE APPROXIMATION

Let Q be an infinite set of positive integers, τ 〉 1 be a real number and let Wτ（Q）={x∈R：｜x-p/q｜〈^-τ for infinitely many （p,q）∈ Z×Q}.For any given positive integer m, set Q（m）={n∈N：（n,m）=1}. If m is divisible by at least two prime factors, Adiceam [1] showed that Wτ（N） ／ Wτ（Q（m）） contains uncountably many Liouville numbers, and asked if it contains any non-Liouville numbers？ In this note, we give an affirmative answer to Adiceam＇s question.

Realization of Rough Set Approximation Toplogical Operations Based on Formal Concept Analysis

There is an intimate correlation between rough set theory and formal concept analysis theory, so rough set approximations can be realized by means of formal concept analysis. For any given multiple valued information system, the realization of rough set approximation operation has two major steps, firstly convert the information system from multiple valued one to single valued formal context, secondly realize rough set approximation operations aided by concept lattice, which is equivalent to a query operation under some necessary conditions.

APPROXIMATION OF SPHERICAL MEANS OF MULTIPLE FOURIER INTEGRALS AND FOURIER SERIES ON SET OF FULL MEASURE

In this paper we consider the approximation for functions in some subspaces of L^2 by spherical means of their Fourier integrals and Fourier series on set of full measure. Two main theorems are obtained.

L_p(1≤p≤∞) APPROXIMATION BY AN n-DIMENSIONAL SUBSPACE ON A SET OF n+1 POINTS

Some new characterizations and immediate explicit expressions of best L(1≤p≤∞) approximation and their deviations by an n-dimensional subspace on a set of n+1 points are given.

Fuzzy Set Approximations in Fuzzy Formal Contexts

In this paper, a kind of multi-level formal concept is introduced. Based on the proposed multi-level formal concept,we present a pair of rough fuzzy set approximations within fuzzy formal contexts.By the proposed rough fuzzy set approximations,we can approximate a fuzzy set according to different precision level.We discuss the properties of the proposed approximation operators in detail.

Approximation Algorithms for the Connected Dominating Set Problem in Unit Disk Graphs

The connected dominating set （CDS） problem, which consists of finding a smallest connected dominating set for graphs is an NP-hard problem in the unit disk graphs （UDGs）. This paper focuses on the CDS problem in wireless networks. Investigation of some properties of independent set （IS） in UDGs shows that geometric features of nodes distribution like angle and area can be used to design efficient heuristics for the approximation algorithms. Several constant factor approximation algorithms are presented for the CDS problem in UDGs. Simulation results show that the proposed algorithms perform better than some known ones.

Product Approximation of Grade and Precision

The normal graded approximation and variable precision approximation are defined in approximate space. The relationship between graded approximation and variable precision approximation is studied, and an important formula of conversion between them is achieved The product approximation of grade and precision is defined and its basic properties are studied.

Fully implicational methods for approximate reasoning based on interval-valued fuzzy sets

The aim of this paper is to discuss the approximate rea- soning problems with interval-valued fuzzy environments based on the fully implicational idea. First, this paper constructs a class of interval-valued fuzzy implications by means of a type of impli- cations and a parameter on the unit interval, then uses them to establish fully implicational reasoning methods for interval-valued fuzzy modus ponens （IFMP） and interval-valued fuzzy modus tel- lens （IFMT） problems. At the same time the reversibility properties of these methods are analyzed and the reversible conditions are given. It is shown that the existing unified forms of α-triple I （the abbreviation of triple implications） methods for FMP and FMT can be seen as the particular cases of our methods for IFMP and IFMT.

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.

Geochemistry and Depositional Setting of Fort Munro Formation,Middle and Lower Indus Basins,Pakistan

Fort Munro Formation represents the products of the Upper Cretaceous (Maastrichtian) in the middle and lower Indus basins. The formation is exposed in the Rakhi Nala (Sulaiman Range), Bara Nala (Lakhi Range) and Naka Pabni (Southern Pab Range) areas. Major and trace elemental geochemistry and petrographic studies of the formation have been carried out to understand the facies trends in the middle and lower Indus basins. A high amount of acid-insoluble fraction, Ca/Mg and Mg vs. Ca/Sr ratio reveal that the formation was deposited in a shallow marine regressive environment. High amounts of clastic reflect abundant influx of terrigenous materials from the east (Indian craton) and west (Bibai volcanic). High Sr content indicates that aragonite was the precursor mineral, which was transformed into stable low-Mg calcite during diagenesis. Enrichment of Cu and Zn contents in the samples of the formation implies the influence of volcanic activity and that they were incorporated into the calcite lattice in the late phase.

CHARACTERIZATION OF BEST APPROXIMATIONS IN METRIC LINEAR SPACES

Let (X,d) be a real metric linear space, with translation-invariant metric d and C a linear subspace of X. In this paper we use functionals in the Lipschitz dual of X to characterize those elements of G which are best approximations to elements of X.We also give simultaneous characterization of elements of best approximation and also consider elements of ε-approximation.

A Class of Iteration Method for the Best Approximation Problems

We propose a class of iteration methods searching the best approximately generalized polynomial, which has parallel computational function and converges to the exact solution quadratically. We first transform it into a special system of nonlinear equations with constraint, then by using to certain iteration method, we combine the two basic processes of the Remes method into a whole such that the iterative process of the system of nonlinear equations and the computation of the solution to the system of linear equations proceed alternately. A lot of numerical examples show that this method not only has good convergence property but also always converges to the exact solution of the problem accurately and rapidly for almost all initial approximations .