In this paper, we give a construction of RDS in Galois ring by using some bent function, and obtain the equivalent relationship between RDS and a kind of bent function. At the same time, its existence is demonstrated.
We study the topological complexities of relative entropy zero extensions acted upon by countable-infinite amenable groups.First,for a given Følner sequence,we define the relative entropy dimensions and the dimen...We study the topological complexities of relative entropy zero extensions acted upon by countable-infinite amenable groups.First,for a given Følner sequence,we define the relative entropy dimensions and the dimensions of the relative entropy generating sets to characterize the sub-exponential growth of the relative topological complexity.we also investigate the relations among these.Second,we introduce the notion of a relative dimension set.Moreover,using the method,we discuss the disjointness between the relative entropy zero extensions via the relative dimension sets of two extensions,which says that if the relative dimension sets of two extensions are different,then the extensions are disjoint.展开更多
An ontology mapping approach based on set & relation theory and OCL is introduced,then an ontology mapping meta-model is established which is composed of ontology related elements,mapping related elements and defi...An ontology mapping approach based on set & relation theory and OCL is introduced,then an ontology mapping meta-model is established which is composed of ontology related elements,mapping related elements and definition rule related elements.This ontology mapping meta-model can be regarded as a unified mechanism to realize different kinds of ontology mappings.The powerful computation capability of set and relation theory and the flexible expressive capability of OCL can be used in the computation of ontology mapping meta-model to realize the unified mapping among different ontology models.Based on the mapping meta-model,a general mapping management framework is developed to provide a common mapping storage mechanism,some mapping APIs and mapping rule APIs.展开更多
The preference analysis is a class of important issues in multi-criteria ordinal decision making.The rough set is an effective approach to handle preference analysis.In order to solve the multi-criteria preference ana...The preference analysis is a class of important issues in multi-criteria ordinal decision making.The rough set is an effective approach to handle preference analysis.In order to solve the multi-criteria preference analysis problems,this paper improves the preference relation rough set model and expands it to multi-granulation cases.Cost is also an important issue in the field of decision analysis.Taking the cost into consideration,we also expand the model to the cost sensitive multi-granulation preference relation rough set.Some theorems are represented,and the granule structure selection based on approximation quality is investigated.The experimental results show that the multi-granulation preference rough set approach with the consideration of cost has a better performance in granule structure selection than that without cost consideration.展开更多
In this note, we obtain a sufficient and necessary condition for a set in an abstract Winner space （X, H, μ） to be relatively compact in L^2（X, μ）. Meanwhile, we give a sufficient condition for relative compactn...In this note, we obtain a sufficient and necessary condition for a set in an abstract Winner space （X, H, μ） to be relatively compact in L^2（X, μ）. Meanwhile, we give a sufficient condition for relative compactness in L^P（X, μ） for p〉1. We also provide an example of Da Prato-Malliavin Nualart to show the result.展开更多
In this paper, the fixed point theorems of composite set-valued increasing operators are given. As a corollary, the fixed point theorem for increasing operator of none-continuity and nonecompactness conditions is also...In this paper, the fixed point theorems of composite set-valued increasing operators are given. As a corollary, the fixed point theorem for increasing operator of none-continuity and nonecompactness conditions is also given. Some relevant results are improved and generalized.展开更多
In an anonymous secret sharing scheme the secret can be reconstructed without knowledge of which participants hold which shares. In this paper some constructions of anonymous secret sharing schemes with 2 thresholds b...In an anonymous secret sharing scheme the secret can be reconstructed without knowledge of which participants hold which shares. In this paper some constructions of anonymous secret sharing schemes with 2 thresholds by using combinatorial designs are given. Let v（t, w, q） denote the minimum size of the set of shares of a perfect anonymous （t, w） threshold secret sharing scheme with q secrets. In this paper we prove that v（t, w, q） - Θ（q） if t and w are fixed and that the lower bound of the size of the set of shares in [4] is not optimal under certain condition.展开更多
Let G be a nonempty closed subset of a Banach space X.Let B(X)be the family of nonempty bounded closed subsets of X endowed with the Hausdorff distance and B_(G)(X)={A∈B(X):A∩G=φ},where the closure is taken in the ...Let G be a nonempty closed subset of a Banach space X.Let B(X)be the family of nonempty bounded closed subsets of X endowed with the Hausdorff distance and B_(G)(X)={A∈B(X):A∩G=φ},where the closure is taken in the metric space(B(X),H).For x∈X and F∈B_(G)(X),we denote the nearest point problem inf{||x-g||:g∈G}by min(x,G)and the mutually nearest point problem inf{||f-g||:f∈ F,g∈G}by min(F,G).In this paper,parallel to well-posedness of the problems min(a:,G)and mm(F,G)which are defined by De Blasi et al.,we further introduce the weak well-posedness of the problems min(x,G)and min(F,G).Under the assumption that the Banach space X has some geometric properties,we prove a series of results on weak well-posedness of min(x,G)and min(F,G).We also give two sufficient conditions such that two classes of subsets of X are almost Chebyshev sets.展开更多
基金Supported by the National Natural Science Foundations of China(19971096)
文摘In this paper, we give a construction of RDS in Galois ring by using some bent function, and obtain the equivalent relationship between RDS and a kind of bent function. At the same time, its existence is demonstrated.
基金supported by the NNSF of China (12201120,12171233)the Educational Research Project for Young and Middle-aged Teachers of Fujian Province (JAT200045).
文摘We study the topological complexities of relative entropy zero extensions acted upon by countable-infinite amenable groups.First,for a given Følner sequence,we define the relative entropy dimensions and the dimensions of the relative entropy generating sets to characterize the sub-exponential growth of the relative topological complexity.we also investigate the relations among these.Second,we introduce the notion of a relative dimension set.Moreover,using the method,we discuss the disjointness between the relative entropy zero extensions via the relative dimension sets of two extensions,which says that if the relative dimension sets of two extensions are different,then the extensions are disjoint.
基金Sponsored by the National High Technology Research and Development Program of China(863)(Grant No.2002AA411420)National Natural Science Foundation(Grant No.60374071)
文摘An ontology mapping approach based on set & relation theory and OCL is introduced,then an ontology mapping meta-model is established which is composed of ontology related elements,mapping related elements and definition rule related elements.This ontology mapping meta-model can be regarded as a unified mechanism to realize different kinds of ontology mappings.The powerful computation capability of set and relation theory and the flexible expressive capability of OCL can be used in the computation of ontology mapping meta-model to realize the unified mapping among different ontology models.Based on the mapping meta-model,a general mapping management framework is developed to provide a common mapping storage mechanism,some mapping APIs and mapping rule APIs.
基金supported in part by Natural Science Foundation of Education Department of Sichuan Province under Grant No.12ZA178Key Technology Support Program of Sichuan Province under Grant No.2015GZ0102+1 种基金Science and Technology Project of Chongqing Municipal Education Commission under Grant No.KJ1400407Chongqing Science and Technology Commission Project under Grant No.cstc2014jcyj A10051
文摘The preference analysis is a class of important issues in multi-criteria ordinal decision making.The rough set is an effective approach to handle preference analysis.In order to solve the multi-criteria preference analysis problems,this paper improves the preference relation rough set model and expands it to multi-granulation cases.Cost is also an important issue in the field of decision analysis.Taking the cost into consideration,we also expand the model to the cost sensitive multi-granulation preference relation rough set.Some theorems are represented,and the granule structure selection based on approximation quality is investigated.The experimental results show that the multi-granulation preference rough set approach with the consideration of cost has a better performance in granule structure selection than that without cost consideration.
基金supported by NSF(No.10301011)of China Project 973
文摘In this note, we obtain a sufficient and necessary condition for a set in an abstract Winner space （X, H, μ） to be relatively compact in L^2（X, μ）. Meanwhile, we give a sufficient condition for relative compactness in L^P（X, μ） for p〉1. We also provide an example of Da Prato-Malliavin Nualart to show the result.
文摘In this paper, the fixed point theorems of composite set-valued increasing operators are given. As a corollary, the fixed point theorem for increasing operator of none-continuity and nonecompactness conditions is also given. Some relevant results are improved and generalized.
基金Supported by the National Natural Science Foundation of China(No.10501049,90304012) 973 Project(No.2004CB318000)
文摘In an anonymous secret sharing scheme the secret can be reconstructed without knowledge of which participants hold which shares. In this paper some constructions of anonymous secret sharing schemes with 2 thresholds by using combinatorial designs are given. Let v（t, w, q） denote the minimum size of the set of shares of a perfect anonymous （t, w） threshold secret sharing scheme with q secrets. In this paper we prove that v（t, w, q） - Θ（q） if t and w are fixed and that the lower bound of the size of the set of shares in [4] is not optimal under certain condition.
基金Supported by the NSFC(Grant No.11671252)the NSFC(Grant No.11771278)。
文摘Let G be a nonempty closed subset of a Banach space X.Let B(X)be the family of nonempty bounded closed subsets of X endowed with the Hausdorff distance and B_(G)(X)={A∈B(X):A∩G=φ},where the closure is taken in the metric space(B(X),H).For x∈X and F∈B_(G)(X),we denote the nearest point problem inf{||x-g||:g∈G}by min(x,G)and the mutually nearest point problem inf{||f-g||:f∈ F,g∈G}by min(F,G).In this paper,parallel to well-posedness of the problems min(a:,G)and mm(F,G)which are defined by De Blasi et al.,we further introduce the weak well-posedness of the problems min(x,G)and min(F,G).Under the assumption that the Banach space X has some geometric properties,we prove a series of results on weak well-posedness of min(x,G)and min(F,G).We also give two sufficient conditions such that two classes of subsets of X are almost Chebyshev sets.
