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.

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.

Approximate Controllability of Second-Order Neutral Stochastic Differential Equations with Infinite Delay and Poisson Jumps

The modelling of risky asset by stochastic processes with continuous paths, based on Brow- nian motions, suffers from several defects. First, the path continuity assumption does not seem reason- able in view of the possibility of sudden price variations （jumps） resulting of market crashes. A solution is to use stochastic processes with jumps, that will account for sudden variations of the asset prices. On the other hand, such jump models are generally based on the Poisson random measure. Many popular economic and financial models described by stochastic differential equations with Poisson jumps. This paper deals with the approximate controllability of a class of second-order neutral stochastic differential equations with infinite delay and Poisson jumps. By using the cosine family of operators, stochastic analysis techniques, a new set of sufficient conditions are derived for the approximate controllability of the above control system. An example is provided to illustrate the obtained theory.

On Multi-Granulation Rough Sets with Its Applications

Recently,much interest has been given tomulti-granulation rough sets (MGRS), and various types ofMGRSmodelshave been developed from different viewpoints. In this paper, we introduce two techniques for the classificationof MGRS. Firstly, we generate multi-topologies from multi-relations defined in the universe. Hence, a novelapproximation space is established by leveraging the underlying topological structure. The characteristics of thenewly proposed approximation space are discussed.We introduce an algorithmfor the reduction ofmulti-relations.Secondly, a new approach for the classification ofMGRS based on neighborhood concepts is introduced. Finally, areal-life application from medical records is introduced via our approach to the classification of MGRS.

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

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.

Study of scattering from time-varying Gerstners sea surface using second-order small slope approximation

Backscattered fields from one-dimensional time-varying Gerstners sea surface are calculated utilising the secondorder small slope approximation. It is well known that spectral properties of the backscattered echoes relate to the velocity of the small elementary scatterers on sea surface profiles. Therefore, modeling Doppler spectra from the ocean requires an accurate description of the sea surface motion. The profile of nonlinear Gerstners sea surface shows verticalskewness of sea waves, it is sharper at the crest and flatter at the trough than linear waves, and its maximum slope position is closer to the crest than to the trough. Furthermore, the horizontal component of the small elementary scatterers orbit velocity on the sea surface, which yields noticeable influence on Doppler spectra, can be obtained conveniently by Gerstners sea surface model. In this study the characteristics of Doppler spectra of backscattered fields from time-varying Gerstners sea surface are investigated and the dependences of the Doppler frequency and the Doppler bandwidth on the parameters, such as the wind speed, the radar frequency, the incident angle, etc. are discussed. It is shown that the Doppler bandwidth of microwave scattered fields from Gerstners sea surface is considerably broadened. For the case of high frequency backscattered fields, the values of the higher-order spectrum peaks are larger than those obtained by linear sea surface.

Dynamics of Rabi model under second-order Born Oppenheimer approximation

We apply the second-order Born-Oppenheimer （BO） approximation to investigate the dynamics of the Rabi model, which describes the interaction between a two-level system and a single bosonic mode beyond the rotating wave approxi- mation. By comparing with the numerical results, we find that our approach works well when the frequency of the two-level system is much smaller than that of the bosonic mode.

Study of(e,2e) process on potassium at 6 e V-60 eV above threshold in a second-order Born approximation

The standard distorted wave Born approximation （DWBA） method has been extended to second-order Born amplitude in order to describe the multiple interactions between the projectile and the atomic target. Second-order DWBA calculations have been preformed to investigate the triple differential cross sections （TDCS） of coplanar doubly symmetric （e, 2e） collisions for the alkali target potassium at excess energies of 6 eV-60 eV. Compared with the previous first-order DWBA calculations, the present theoretical model improves the degree of agreement with experiments, especially for the backward scattering angle region of TDCS. This indicates that the present second-order Born term is capable of giving a reasonable correction to the DWBA model in studying coplanar symmetric （e, 2e） problems in low and intermediate energy ranges.

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.

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.

Intuitionistic Fuzzy Rough Sets Based on Two Intuitionistic Fuzzy Implicators

This paper presents a general framework for the study of relation-based intuitionistic fuzzy rough sets determined by two intuitionistic fuzzy implicators.By employing two intuitionistic fuzzy implicators I and J,I -lower and J-upper approximations of intuitionistic fuzzy sets with respect to an intuitionistic fuzzy approximation space are first defined.Properties of(I,J) -intuitionistic fuzzy rough approximation operators are then examined.The connections between special types of intuitionistic fuzzy relations and properties of (I,J)-intuitionistic fuzzy approximation operators are also established.

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.

Transformation and entropy for fuzzy rough sets

A new method for translating a fuzzy rough set to a fuzzy set is introduced and the fuzzy approximation of a fuzzy rough set is given. The properties of the fuzzy approximation of a fuzzy rough set are studied and a fuzzy entropy measure for fuzzy rough sets is proposed. This measure is consistent with similar considerations for ordinary fuzzy sets and is the result of the fuzzy approximation of fuzzy rough sets.

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.

Rough Integrals Generated by Function Rough Sets

The concepts of the lower approximation integral,the upper approximation integral and rough integrals are given on the basis of function rough sets.Based on these concepts,the relation of the lower approximation integrals,the relation of the upper approximation integrals,the relation of rough integrals,and the double median theorem of rough integrals are discussed.Rough integrals have finite contraction characteristic and finite extension characteristic.

基于Rough sets和Fuzzy sets理论的约简算法

对决策表约简的一些roughsets和fuzzysets相关概念进行了阐述。在应用Rough集对决策系统进行约简的基础上,结合模糊聚类分析方法,论述了这一可行的决策表约简算法。该算法以属性核与属性重要性的代数定义形式为基础,利用聚类分析的模糊处理方法,解决了约简过程。并给出了对一电器公司全国连锁销售数据约简处理结果,得出了能帮助不同级别决策者进行决策的辅助性的规则知识。

On Quasi-Chebyshevity Subsets of Unital Banach Algebras

In this paper, first, we consider closed convex and bounded subsets of infinite-dimensional unital Banach algebras and show with regard to the general conditions that these sets are not quasi-Chebyshev and pseudo-Chebyshev. Examples of those algebras are given including the algebras of continuous functions on compact sets. We also see some results in C＊-algebras and Hilbert C＊-modules. Next, by considering some conditions, we study Chebyshev of subalgebras in C＊-algebras.

New judging model of fuzzy cluster optimal dividing based on rough sets theory

To investigate the judging problem of optimal dividing matrix among several fuzzy dividing matrices in fuzzy dividing space, correspondingly, which is determined by the various choices of cluster samples in the totality sample space, two algorithms are proposed on the basis of the data analysis method in rough sets theory： information system discrete algorithm （algorithm 1） and samples representatives judging algorithm （algorithm 2）. On the principle of the farthest distance, algorithm 1 transforms continuous data into discrete form which could be transacted by rough sets theory. Taking the approximate precision as a criterion, algorithm 2 chooses the sample space with a good representative. Hence, the clustering sample set in inducing and computing optimal dividing matrix can be achieved. Several theorems are proposed to provide strict theoretic foundations for the execution of the algorithm model. An applied example based on the new algorithm model is given, whose result verifies the feasibility of this new algorithm model.

On Links between Rough Sets and Digital Topology

Rough set theory is a powerful tool for dealing with uncertainty, granularity, and incompleteness of knowledge in information systems. In addition, digital topology deals with properties and features of two-dimensional or three-dimensional digital images that correspond to topological properties of objects. So, we try to describe the relationship between rough sets and digital topology. Firstly, we will study the classifications of topologies in rough sets. Secondly, we will use the upper approximation operator to span the digital line, which is the basic building block of the digital spaces.