基于驱动电路3955的步进电机细分驱动器设计

为减小步距角,提高电机步进分辨率,在分析步进电机细分原理的基础上,提出一种基于全桥PWM驱动电路3955的两相步进电机细分驱动器设计方案,给出了系统的硬件结构和软件设计。该方案采用正弦/余弦细分方法,控制步进电机两相绕组的电流,实现了斩波恒流均匀细分驱动,最高细分达到128。所设计的驱动器已应用于数控车床改造中,采用导程为1 mm的精密滚珠丝杆,可实现每步位移0.4μm。实验结果表明该步进电机细分驱动器运行平稳、可靠性高,具有良好的运行矩频特性。     

电子送经织轴驱动系统的设计

介绍了采用步进电机为送经电机的织轴驱动系统的设计方法，包括送经电机的选取、步进电机驱动器的设计和织轴驱动系统机械传动的参数计算。这里得出步进电机是织机送经机构理想的驱动元件，如果采用高电压斩波限流驱动电路，步进电机具有输出力矩大、高频特性好、功率消耗低的特点，足以满足织轴驱动的工艺要求。     

一种无纺布袋提手自动送进机构

为提高针刺无纺布袋加工过程自动化程度,设计了一种新型的无纺布袋提手自动送进机构.该机构采用步进电机驱动摩擦辊来实现软基布带的可靠送料,提手送进长度和旋转角位移通过步进电机脉冲数目来控制,无纺布袋身与提手间采用超声波焊接预紧固后,能可靠送入缝纫机进行缝制.并给出了基于PLC的控制流程     

微进给机构的柔性铰链设计与有限元分析

设计一套以音圈电机为驱动电机,柔性铰链为支承元件,碟形弹簧为减震机构的微进给机构.柔性铰链采用双平行四杆机构的结构形式,计算了柔性铰链在音圈电机峰值推力作用下的最大输出位移和最大应力值.通过有限元分析柔性铰链在不同推力作用下的应力、应变图,发现在音圈电机最大推力800 N作用下,柔性铰链的最大应变为224.67μm.分析结果证明,所设计的直圆形双平行四连杆柔性铰链能够满足微进给机构的往复进给行程要求.     

步进电机细分驱动控制系统设计与实现

针对步进电机容易失步,导致定位不准的问题,提出采用细分驱动控制的方法控制步进电机.首先对两相混合式步进电机进行了数学建模,并在Matlab/Simulink环境下对步进电机在不同细分数下进行了仿真研究,仿真结果表明细分驱动控制能显著提高步进电机运行性能.然后基于STM32F103处理器设计了细分驱动控制硬件系统并进行了测试,通过步进电机带动丝杆在700 mm范围内运动,在2细分、4细分、8细分、16细分状态下的误差分别为1.7、1.1、0.5、0.2 mm.测试结果表明,提高细分数能提高步进电机精度、降低噪声,本系统具有较强的实用价值.     

FPGA在步进电机细分驱动控制系统中的应用

以单片机SST89E554RC和FPGA为步进电机细分驱动系统的硬件核心,实现了两台步进电机的64细分控制。系统采用FPGA控制的PWM细分驱动技术,由FPGA产生阶梯脉冲形成阶梯形电压信号以控制步进电机每相绕组在各时刻的电压,从而实现步进电机转角的任意细分控制。     

一种基于TMS320F2812的五相步进电机细分驱动方案

针对五相步进电机不易控制的问题,阐述了步进电机细分驱动原理,建立了细分驱动数学模型并在Matlab/Simlink环境下进行了仿真,在硬件系统设计方面采用TI公司专门用于电机控制的DSP处理器TMS320F2812来实现五相步进电机的细分驱动控制,给出了整个系统的软件设计.实验结果表明:采用DSP实现了五相步进电机的细分控制,提高了步进电机的分辨率、提升了系统的控制精度和性能.     

基于DSP的二相混合式步进电机多细分驱动器的研究

本文介绍了一种基于TMS320LF2407ADSP芯片的步进电机多细分驱动控制器的设计方案,给出了系统的硬件构成和软件设计方法。实验证明：该方案能最大限度地利用步进电机驱动芯片的开关频率,自动计算出步进电机在不同转速下的细分微步数,通过步进电机细分控制,改善电机系统的运行特性和定位精度。     

基于单片机的通用型五相混合式步进电机驱动器设计

分析了电脑绣花机系统中，现有的五相混合式步进电机驱动器存在低频转矩振荡、高频输出转矩不足和多电源供电及不通用等诸多不足之处的基础上，设计出一种基于单片机的通用型五相混合式步进电机驱动器。该驱动器使用单一电源供电，驱动五相电机时采用三相励磁PWM输出方式，改善了驱动的矩频特性；同时，此驱动器在不脉冲细分的情形下，可以驱动二、三、四相步进电机。此设计在电脑绣花机系统中投入应用，并取得良好的效果。     

步进电机控制系统的设计与实现

步进电机是将电脉冲信号转变为角位移或线位移的开环控制元件.本文基于FPGA和单片机设计出实用的四相步进电机控制与驱动系统,进行了硬件和软件设计.利用FPGA产生的PWM细分驱动信号,结合STC89C52,系统实现了步进电机的正反转控制及速度控制.进行了PWM驱动信号仿真,并完成了样机系统测试,仿真及测试效果好,系统具有功能完善、运行稳定等特点,具有推广价值.     

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.