凸度量空间中的不动点和最佳逼近

讨论了凸度量空间上不动点的存在和最佳逼近问题.主要得到以下结论:设(X,d)是一个凸度量空间,F是X的非空闭子集,T:F→X是一个连续映射且T(F)包含于X的一个紧子集D中,则T有不动点当且仅当对每一个ε>0,T具有ε-不动点;设(X,d)是一个完备的一致凸度量空间,M是X的一个闭凸集,如果对每一个x∈X,PM(x)是单点集,那么最近点投影P:X→M是连续的;设(X,d)是严格凸度量空间,MX是非空闭集,且是T-正则的,如果T是紧自映射且u∈X使d(T(x),u)≤d(x,u),x∈M,那么M中每一个u的最佳逼近点都是T的不动点.     

锥上的逼近定理和不动点定理

X是Banach空间,KX是一个锥,intK≠φ;K_R={x∈K:0≤ⅡxⅡ相似文献   

无K_(1,t)图的L(d,1)-T标号

给定一个连通图G=(V,E)及其一棵支撑树T,图G的一个L(d,1)-T标号即函数g:V(G)→{0,1,2,…},满足:(1)如果xy∈E(G),则|g(x)-g(y)|≥1;(2)如果dG(x,y)=2,则|g(x)-g(y)|≥1;(3)如果xy∈E(T),则|g(x)-g(y)|≥d.假设图G有一个L(d,1)-T标号函数g:g(V){0,1,2,…,k},则图G的所有L(d,1)-T标号函数中最小的整数k记为L(d,1)-T标号数λdT(G,T).本文证明了若G是无K1,t(3≤t≤n)的连通图,其最大度为Δ,|G|=n,T为G的任意支撑树,则λdT(G,T)≤tt--12Δ2+Δ+2d-2.     

复合泛函方程的稳定性

研究了复合泛函方程T(T(x)-T(y))=T(x+y)+T(x-y)-T(x)-T(y)在泛函Φ(x,y)限制下的稳定性问题.证明了:若E为Banach空间,泛函Φ:E×E→[0,∞)连续使得级数Φ(x)d=sum (2-j-1Φ(2jx,2jx)) from j=1 to ∞在E的任一有界子集上一致收敛,F:E→E是连续映射且满足‖F(F(x)-F(y))-F(x+y)-F(x-y)+F(x)+F(y)‖≤Φ(x,y)(■x、y∈E),则存在唯一的连续2-齐次映射T:E→E满足以上复合泛函方程且‖T(x)-F(x)‖≤Φ(x),■x∈E.     

缺项算子矩阵的左谱

设A∈B(ye),B∈B(k),C∈(B)((k),(ye))给定,对X∈B((ye),(k))定义Mx=(AXCB)ye( )k→ye( )(k).在一定条件下刻画集合∩X∈B((k),(ye))σl(Mx)和∩X∈B((k),(ye))σl(Mx),其中σl(T)和σr(T)分别表示算子T的左谱和右谱.利用了算子矩阵的分块技巧和算子分块的几何结构.在C是闭值域的条件下,完全刻画了∩X∈B((k),(ye))σl(Mx)和∩X∈B((k),(ye))σl(Mx).此刻画在缺项算子矩阵的谱的研究中是新的结果,应用该刻画可以得到若干已知结论.     

集值映象对的公共不动点定理

本文证明了完备度量空间中集值映象对的公共不动点定理,从而改进并推广了中的诸结果.以下始终假定(X,d)是非空完备度量空间,并简记为 X.B(X)是由 X 的所有空有界子集组成的集合族.对于任意 A,B∈B(X),定义δ(A,B)=sup {d(a,b);a∈A,b∈B}.定义1.设映象 F:B(X)→B(X),对任意 A∈B(X),记 F A)=F(x),如果总有 F(A)∈B(X),则称 F 为 B(X)上的集(合)值映象.     

S-弱θ-加细空间

作为对S-仿紧的更进一步的推广,介绍S-弱θ-加细空间及研究有关的基本性质.空间(X,T)称为S-弱θ-加细空间,如果X的每一开覆盖U具有半开加细覆盖V=∪n∈NVn,对每一x∈X存在n∈N使1≤ord(x,Vn)<ω.文中还探讨了S-弱θ-加细空间与一些已知空间之间的关系,获得了如下主要结果:(1)任意极不连通(e.d.)的S-弱θ-加细的T2空间是弱θ-加细空间;(2)若空间(X,T)是T2空间,空间(X,T)是S-弱θ-加细的当且仅当X的每一开覆盖U有半闭加细V=∪n∈NVn,对每一x∈X,存在n∈N,使得1≤ord(x,Vn)<ω,其中Vn={Vnα:α∈I,n∈N}.     

集值离散动力系统的极限行为

设(X,d)为紧致度量空间,f:X→X连续,K(X)是由X的所有非空紧致子集构成的集族,H是由d所诱导的Hausdorff度量,则(K(X),H)是由X的所有非空紧致子集构成的紧致度量空间,-f:K(X)→K(X)连续,-f(A)={f(x):x∈A}研究了-f的扩张性、点态稳定性、性质p、链可迁(混合)、伪轨跟踪性质,以及这些极限行为在(X,f)与(K(X),-f)之间的内在联系。     

度量空间上两个自映射公共不动点定理

首先引入一类新的A(ρ) 实函数类的概念,并给出一些例子,然后利用A(ρ) 实函数类,在完备度量空间上建立了一些自映射对的公共不动点定理,如f,g为完备度量空间(X,d)上的两个自映射对,当f,g有一个连续并且存在F∈A(ρ) 使得d(f(x),g(y)≤F(d(x,y),d(x,f(x)),d(y,g(y)))对任意x,y∈X成立,则f,g存在唯一的公共不动点.同时举例说明了本文的结论,统一并推广了文献[5-9]的Reich型压缩映射的不动点定理.     

交换映射的不动点定理

文献〔1〕和〔2〕分别证明了如下: 定理:令S和T是完备度量空间(X,d)到自身的交换映射,对所有x,y∈X,满足不等式 d(Sx,Ty)《k·max{d(x,y),d(x,Ty),d(y,Sx),d(x,Sx)d(y,Ty)}其中0《k<1,且不等式 Sup{d(S~(r 1)T~nx,S~rT~nx),d(S~rT~(n 1)x,S~rT~nx):r,n=0,1,2…}<∞对某些特殊的x∈X成立,则S和T有唯一的公共不动点z,而且,z是S和T的唯一不动点。定理2 令S和T是完备度量空间(X,d)到自身的映射,对所有的x,y∈X满足不等式     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.