双圆弧齿轮传动的啮合分析 Ⅰ.齿面方程及端面齿廓

作为啮合分析的基础,本文从双圆弧齿轮基准齿形的定义出发,导出了适用于各类双圆弧齿轮各个部分齿面的通用齿面方程式,给出了确定原始参数的计算公式。并且证明,法面双圆弧齿轮的每一段端面齿廓都是对应椭圆曲线段在相对运动中的包络曲线。     

双圆弧齿轮传动的啮合分析 Ⅲ.齿数及螺旋角的影响

本文分析了双圆弧齿轮传动中齿数及螺旋角对端面齿廓、齿顶压力角、齿顶弦齿厚、凸凹齿廓理论啮合点弦齿厚等的影响,指出过渡部份与凹齿工作齿廓交点处存在“过切现象”,并计算了双圆弧齿轮的最小齿数。     

双圆弧齿轮瞬时接触区的简化计算

利用弹性力学原理,计算了GB12759－91型双圆弧齿轮在齿面任一点受集中力时齿面各处的下陷量,再由一对轮啮合时的空间几何关系计算出变形前齿面各点沿法向的间隙量,然后按变形直辖市关系算得当一对轮齿法向靠拢时的接触边界形状和接触区的内载荷分布。     

变双曲圆弧齿线圆柱齿轮温度预测模型构建

基于摩擦学原理,给出了变双曲圆弧齿线圆柱(VH-CATT)齿轮在混合弹流润滑下齿面摩擦因数沿啮合线的变化规律;首先,通过建立VH-CATT齿轮的热网络模型,得到了齿轮副在啮合过程中齿轮本体的热对流矩阵和热阻矩阵;然后,基于Blok闪温理论和赫兹接触理论,建立了混合润滑状态下VH-CATT齿轮齿面闪温计算模型,得到了齿面...     

圆弧齿轮弦齿厚测量尺寸的计算

为方便圆弧齿轮的测量和提高计算效率,从圆弧齿轮的齿面方程入手,推导出圆弧齿轮弦齿厚测量尺寸的计算公式.根据圆弧齿轮的成形特点,进一步导出圆弧齿轮弦齿厚的近似计算公式,并举例计算圆柱双圆弧齿轮弦齿厚测量尺寸.两种计算结果比较表明,近似公式的误差仅为0.001mm,完全满足工程要求的精度.近似公式计算简单方便,大大提高了计算效率.     

太原工业大学学报1985年总目录

序号作采用带刃倾角刀片时可转位车刀的设计计算摇摆锥齿轮箱加载蜗轮试验台的研讨双圆弧弧齿锥齿轮制造工艺和试验研究双圆弧弧齿锥齿轮啮合分析压力机机架的刚度计算及断面形状的优化设计棍合稀土金属对工业ZL102合金的变质作用双圆弧齿轮传动的啮合分析1.齿面方程与端面齿廓双圆弧齿轮传动的啮合分析1.正确啮合条件及齿形干涉浅析双圆弧齿轮传动的啮合分析1.齿数及螺旋角的影响蔺启恒范文推李进宝李进宝侯手羊知赵沛康段德荣者冯肇锡蒯越群等期页1 51 19 27 39 53831 2 3 3 3 34刘仙芝1 2 3 4 5 67段德荣4 91段德荣4 10110.有常见阳离子…     

圆弧齿轮的齿向修形

从分析圆弧齿轮轮体和齿面变形出发,考虑齿向误差,导出了圆弧齿轮齿面载荷所应满足的非齐次线性方程组,并根据均载条件提出修形最的计算方法。     

圆弧齿线圆柱齿轮接触疲劳强度的试验研究

本文通过八对圆弧齿线圆柱齿轮的运转接触疲劳试验,得到了45钢正火齿轮的接触疲劳极限应力框图,可供圆弧齿线圆柱齿轮传动的接触强度计算参考使用。试验结果表明,该齿轮的齿面承载能力要比斜齿轮高26％左右,其抗点蚀能力也较之为高,且点蚀形貌具有特殊的形状。     

诱导法曲率对圆弧齿线双圆弧齿轮接触强度的影响

根据齿轮啮合原理,分析并比较了圆弧齿轮双圆弧齿轮与普通双圆弧齿轮啮合特性,通过推导这种新型齿轮齿面诱导法曲率,分析了接触强度得以提高的原因。同时用切齿法进行研究后得出,该齿轮还具有较高弯曲强度。     

面齿轮轮齿刚度的计算方法及其影响因素分析

面齿轮轮齿刚度是面齿轮传动啮合刚度的基本组成,其计算方法的解决可为面齿轮啮合刚度以及后续动力学分析奠定必要的理论基础。基于Buckingham的观点,将面齿轮齿形看作是由沿齿长方向一系列变压力角的齿条组成,得到沿轴向和径向都为变截面的面齿轮简化齿形,获得了面齿轮轮齿啮合变形的计算公式,求解出了面齿轮轮齿刚度;并通过与有限元法进行对比分析,验证了面齿轮轮齿刚度计算方法的可行性;分析了面齿轮模数、压力角以及齿宽对其轮齿刚度的影响。结果表明：面齿轮模数越大,其轮齿刚度沿齿根到齿顶的变化率越小;面齿轮压力角越大,其轮齿刚度越大,但沿齿根到齿顶的变化率基本不变;面齿轮齿宽越大,其轮齿刚度越大,且沿齿根到齿顶的变化率较之压力角的影响大。     

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.