转子临界转速无极调节支承的设计与分析

转子系统支承刚度对转子系统的临界转速有很大影响,由此推出一种转子整体刚度可调节的新型转子支承系统.本系统设计了四轴联动机构、对称式弹性机构以及变刚度机构,可以对转子系统进行精确定位,增加转子系统的稳定性,延长转子系统的寿命,并且该支承可对转子支承的整体刚度进行调节,从而对转子系统的临界转速进行控制.在这种新型的支承方式下,运用传递矩阵法对支承机构转子系统的临界转速可调节性作了理论分析,并运用有限元法以及试验方法对其分析结果作了相应验证.结果证明该新型转子支承系统可有效地调节转子系统的临界转速.     

电机—弹性连杆机构系统的动力学分析

为了提高机械的设计精度,优化机构的动力学响应,研究了电机－弹性连杆机构系统,对系统进行动力学建模,将整个系统分成电机和弹性连杆机构两个子系统,对各个子系统分别建模,再综合得到系统的动力学微分方程,对该方法求解,推导了一种适合于求解用精确分析方法得到的弹性连杆机构动力学方程的迭代振型叠加法,通过实例计算,研究了系统中弹性宫杆 动力学特性,得出一些有益的结论。     

推力轴承对单质量转子弯曲振动状态的影响

转子系统发生横向振动时,系统中的推力轴承将因转子振动而产生一组振动及反力及反力矩,与转子横向振动耦合,从而影响转子系统的振动状态,文中将推力轴承的动特性代入转子系统振动方程,研究了推力轴承关于转子横向振动的强耦合效应;又分别研究了推力轴承对不同转子形式的转子系统的系统阻尼的影响;推力轴承轴向总间隙的影响及当系统取不同的径向滑动轴在支承时,推力轴承对系统振动状态的作用,结果表明：推力轴承对转子横向振     

转子-支承系统振动不平衡响应的MATLAB实现

转子-支承系统振动不平衡响应的计算在转子动力学计算中处于重要地位，有限元法是其计算的方法之一，针对工程上的大型软件和软件包不适应小型转子系统和学校开发教学课的特点，文章尝试开发采用MATLAB计算转子一支承系统振动不平衡响应的教学课件。     

一类直接耦合系统的混沌同步

将一个完整系统通过分解得到的多个子系统中,有的子系统是稳定的,有的子系统是不稳定的。稳定的子系统和不稳定的子系统之间通过某种耦合后能组成一个复合系统。作者在本文中研究了这个耦合的复合系统中稳定的子系统和不稳定的子系统之间的同步问题,结论是在这个耦合的复合系统中稳定的子系统和不稳定的子系统之间也可能达到混沌或非混沌同步。     

滚动轴承非线性因素对转子系统振动特性的影响

针对滚动轴承支承下的转子系统在运行过程中存在的滞后突跳问题,利用嵌入同伦弧长延拓的HB-AFT方法,可以快速计算在滚动轴承支承下转子系统的滞后突跳区间;利用Floquent理论进行稳定性判定,分析轴承等效刚度、轴承游隙与线性阻尼系数对转子系统滞后突跳的影响.结果表明:轴承游隙与轴承等效刚度在一定范围内变化会影响转子系统的滞后突跳区间,而阻尼系数只在转子系统临界转速附近影响系统振动的幅值.研究结果可为轴承-转子系统参数的选取提供理论参考.     

转子弹性阻尼支承最佳参数选择的理论及程序计算分析

提出了考虑轴承刚度、阻尼的振型叠代求解方法 ,以及根据振型规格化加载求多支承转子系统的各阶共振放大因子或模态阻尼 ,并提出了按转子———支承系统的各阶共振放大因子最大值最小或各阶模态阻尼最小值最大的判别准则来确定弹性阻尼支承的参数 ,可适用于多质量多支承变截面的大挠性转子系统。     

减振阻尼支承理论及程序计算

本提出了考虑轴承刚度、阻尼振型的叠代求解方法，以及根据振型规格化加载求多支承转子系统的各阶共振放大因子或模态阻尼，并提出了按转子——支承系统的各阶共振放大因子最大值最小或各阶模态阻尼最小值最大的判别准则来确定弹性阻尼支承的参数，可适用于多质量多支承变截面的大挠性转子系统。     

转子—支承系统振动不平衡响应的MATLAB实现

转子—支承系统振动不平衡响应的计算在转子动力学计算中处于重要地位,有限元法是其计算的方法之一,针对工程上的大型软件和软件包不适应小型转子系统和学校开发教学课的特点,文章尝试开发采用MATLAB计算转子-支承系统振动不平衡响应的教学课件。     

磁悬浮支承转子系统动力学特性的实验研究

电磁轴承作为一种新颖的高性能支承部件，具有传统轴承无可以拟的许多优点，电磁轴承进入应用基础研究阶段后，还有许多实际问题需要解决，其中之一就是在高速旋转机器中应用的转子动力学及其稳定性问题。此文以电磁轴承支承下的高速转子系统为分析对象，研究其动力学特性，研究的对象是一台150m^3制氧透平膨胀机样机中的电磁轴承转子系统，以其三组不同的参数作了临界转速和稳定性计算，最后，分析了观察到的实验现象，并与计算结果比较。     

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.