二元三次函数方程的解及在模糊 Banach空间上的稳定性

设 X和 Y是实向量空间,映射 f：X2→Y称为二元三次函数,x1,x2,y1,y2∈X,都满足下面的二元三次函数方程：f（2x1＋x2,2y1＋y2）＋f（2x1＋x2,2y1－y2）＋f（2x1－x2,2y1＋y2）＋f（2x1－x2,2y1－y2）＝4f（x1＋x2,y1＋y2）＋4f（x1－x2,y1＋y2）＋24f（x1,y1＋y2）＋4f（x1＋x2,y1－y2）＋4f（x1－x2,y1－y2）＋24f（x1,y1－y2）＋24f（x1＋x2,y1）＋24f（x1－x2,y1）＋144f（x1,y1）。研究二元三次函数方程解的一般形式,证明了在模糊 Banach 空间上该方程的 Hyers-Ulam 稳定性。     

一类高阶非线性微分方程解的稳定性

本文对高阶非线性微分方程组x=f_1(x,y,x,y,x,y)…y=f_2(x,y,x,y,x,y)的某些特殊类型,研究了平凡解的全局渐近稳定性[1],用类比法[2]构造李雅普诺夫函数,得到了全局渐近稳定性的一些充分条件。主要结果为定理2、定理3和定理4。文中具体研究了如下三种类型的方程:和x a_1x a_2y a_3x a_4y f(x)=0…y b_1x b_2y b_3x b_4y g(y)=0x a_1x a_2y f(x) a_4y a_3x=0…y b_1x b_2y b_3x g(y) b_6y=0x f(x) a_2y a_3x a_4y a_5x=0…y b_1x g(y) b_3x b_4y b_6y=0其中ai,bi(i=1.2.…,6)均为常数,f和g具有保证解对初值唯一性的条件。     

关于[x]的几个不等式

在本文内,我们得到了关于[x]的几个不等式(1)[x]+[y]+2[x+y]≤[3x]+[3y](2)[x]+[y]+[2x+y]+[x+2y]≤[4x]+[4y](3)[x]+[y]+[3x+y]+[x+3y]≤[5x]+[5y]这里[x]代表不超过x的最大整数.     

混合Cauchy-四次函数方程的Ulam稳定性

给出混合Cauchy-四次函数方程f(x1+x2,2y1+y2)+f(x1+x2,2y1-y2)=4f(x1,y1+y2)+4f(x1,y1-y2)+24f(x1,y1)-6f(x1,y2)+4f(x2,y1+y2)+4f(x2,y1-y2)+24f(x2,y1)-6f(x2,y2)的定义,并得到其一般解,同时,在Banach空间及Non-Archimedean赋范空间上讨论了它的Ulam稳定性。
     

二元混合五次函数方程的稳定性

设X和Y分别是实向量空间和实Banach空间,映射f：X2→Y称为二元混合五次函数是指任给x1, x2, y1, y2∈X都满足方程f（x1＋x2,2y1＋y2）＋f（x1＋x2,2y1-y2）＋f（x1-x2,2y1＋y2）＋f（x1-x2,2y1-y2）＝4f（x1, y1＋y2）＋4f（x2,y1＋y2）＋4f（x1,y1-y2）＋4f（x2,y1-y2）＋24f（x1,y1）＋24f（x2,y1）。给出了二元混合五次方程的一般解,并证明了它的Hyers-Ulam-Rassias稳定性。     

关于对偶对的Gorenstein平坦模及其维数

基于Wang等人引入的Gorenstein (x,y)-平坦模的概念,利用环模理论和同调代数的方法,研究了Gorenstein (x,y)-平坦模类GF(x,y)的稳定性,讨论了任意左R-模M的GF(x,y)-投射维数GF(x,y)-pd(M)的若干性质,其中(x,y)是R-模范畴的一个完备对偶对。证明了x是模类GF(x,y)的生成子和余生成子,且在左R-模短正合列(ε):0→U→V→W→0中各项的GF(x,y)-投射维数之间存在着密切的联系。结果表明:当(x,y)是一个完备对偶对,GF(x,y)是投射可解的,且ToriR≥1(y,x)=0时,如果V是Gorenstein (x,y)-平坦模,那么GF(x,y)-pd(W)≤GF(x,y)-pd(U)+1;如果U是Gorenstein (x,y)-平坦模,那么GF(x,y)-pd(V)≤GF(x,y)-pd(W);如果W是Gorenstein (x,y)-平坦模且(ε)在函子HomR(x,-)下正合,那么等式GF(x,y)-pd(U)=GF(x,y)-pd(V)成立。     

一类Poincaré系统的中心条件及极限环个数

考虑了形如x=-y x(a f1(x,y) fn(x,y)),y=x y(a f1(x,y) fn(x,y))的Poincaré系统,这里fn(x,y)是n次齐次多项式,得到了当n=4,5,…,8时系统的中心条件及细焦点的阶数和极限环个数。     

环面自映射ω-极限集轨道的渐近性

给出了环面上连续自映射f的ω-极限集的如下结果：若 （x,y）∈X,则（1）ωf（x,y）=ωfn（x,y）;（2）（x,y）AP（f）蕴涵ωf（x,y）不可数;（3）ωf（x,y）或是由厂的一条周期轨道组成,或不可数;（4）ωf（x,y）=n-1∪i=0ωfn（f（x,y））f（ωfnf（x,y）））=ωfn（fi＋1（x,y））,f（ωfn（fn-1（x,y）））=ωfn（x,y）。     

一类n次系统全局结构分析(Ⅰ)

本文研究了动力系统x=x+P_n(x,y),y=y+Q_n(x,y),这里P_n(x,y),Q_n(x,y)为n次二元多项式齐式,证明了这个系统为可积系统,并且研究了这个奇点的性质。     

具有连续变量的脉冲偏差分方程解的振动性

考虑一类具有连续变量的脉冲偏差分方程A(x+τ,y)+A(x,y+τ)-A(x,y)+p(x,y)A(x-rτ,y-lτ)=0,x≥x0;y≥y0-τ,x≠xk,A(xk+τ,y)+A(xk,y+τ)-A(xk,y)=bkA(xk,y),y∈[y0-τ,∞),k∈N(1).其中p(x,y)≥0是[x0,∞)×[y0-τ,∞)上的非负连续函数,τ>0,bk是常数,r和l是正整数,0≤x0相似文献   

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.