激光切割血管支架筋宽变化模型构建

在血管支架激光切割加工中存在着筋宽变化,影响支架撑开性能.基于激光切割血管支架的筋宽形成机理,构建出表述切割过程中支架筋宽变化的数学模型.理论计算及支架加工试验表明:管材激光切割点回转偏心量的大小是造成支架筋宽变化的主要因素;用数学模型指导调整机床,可将激光切割支架的筋宽变化控制在0.01 mm以下.     

激光切割狭缝技术的研究

介绍了加工狭缝的主要工艺方法和YAG激光器特性,从理论和实验两个方面研究了激光切割工艺参数、辅助工艺参数等对切割缝宽和缝面质量的影响。优化加工参数,可在金属零件上加工出缝宽0.05mm的狭缝。     

工艺参数对激光切割工艺质量的影Ⅱ晦

随着科技的发展,国内汽车制造业在材料加工方面逐步引进激光切割技术,激光切割加工是一项极为繁杂的过程。通过汽车冷轧钢板激光切割实验,分析激光切割工艺参数对粗糙度、挂渣以及切缝宽度等切割质量的影响。     

碳钢激光脉冲宽度打微孔的研究

激光打孔是激光加工的主要应用领域之一,取五种不同厚度的碳钢材料进行了激光打微孔实验,利用双因素无重复试验方法分析了激光脉冲宽度和碳钢含碳量对激光打微孔的质量影响,为激光打微孔的激光参数合理选择提供了可行的方法。     

冠状动脉支架的设计与加工工艺

提出了面向激光雕刻管状冠状动脉支架的通用化制作工艺流程,包括支架的结构设计、材料选择、切割、真空退火和电化学抛光等关键工序.研究了金属覆盖率、网孔、轴向短缩率和支撑效率等的相互影响,以选择合理的支撑环和连杆形式;确定了激光切割加工中最优化切割路径和机器参数;阐述了抛光前处理时酸洗液的选择、酸洗温度和时间的控制,以及真空退火时升温速度、冷却速度和保温时间的控制;分析了抛光液的选择和电极设计,以及抛光温度、电压和时间对电化学抛光效果的影响;并设计制作出了符合体外测试要求的支架样件.     

加工工艺对医用心血管支架生物相容性的影响

设计了一种新结构的316L不锈钢心血管支架，采用激光切割和电化学抛光去除尖角的加工方法，通过3D细胞和小鼠骨髓基质细胞培养以及人体外周血的溶血实验，研究了加工工艺对该心血管支架生物相容性的影响．采用激光切割和电化学抛光工艺，获得了设计的支架形状并消除了支架边缘的尖角；实验组和对照组对比表明，细胞的形状、数量相同，其活性和生长未受支架影响，支架没有引起溶血反应，加工工艺是合理的，没有产生细胞毒性。     

基于望小特性不锈钢304板材激光切割工艺优化

为提高304不锈钢切缝表面的光洁度、减少毛刺量,进行了3 mm厚304不锈钢的光纤激光切割工艺试验。以激光功率、切割速度、保护气压和离焦量为影响因素,以切缝刮渣高度和倾斜区占比作为评价指标,构建正交试验方案L_9(3~4),研究工艺参数对切割质量的影响规律并优选最佳工艺参数。根据正交试验极差与方差分析得到工艺参数对刮渣高度的影响为激光功率>保护气压>离焦量>切割速度,工艺参数对倾斜区占比的影响为激光功率>离焦量>切割速度>保护气压,并分别得到了最小刮渣高度及最低倾斜区占比的工艺参数组;利用望小信噪比法对评价指标进行多目标综合优化,得到综合最优工艺参数组。试验验证表明望小信噪比法适用于激光切割工艺参数的优化。     

基于ANSYS的激光切割温度场仿真

激光切割过程复杂，影响因素较多，本文根据激光切割加工的特点，建立了激光切割的热力学模型，并基于ANSYS有限元软件进行了切割过程的温度场仿真分析，给出了激光切割参数对温度分布的影响规律，为实际切割之前选择最优切割参数提供了理论参考。     

激光切割工艺参数对切割樟子松切缝效率的影响

激光加工在木材加工中的应用越来越广泛,具有传统机械加工不可比拟的优势。影响激光切割木材效率的因素主要有切割机参数和工件的性质,由于木材的性质很复杂,并且激光切割时的镜头高、功率、切割速度等参数具有交互作用,造成三因素同时作用的显著性不明显,使激光切割木材的效率不易控制。为获得更理想的切割效率,对激光切割木材的工艺参数进行了试验研究。为了减少各种因素交互作用的影响,细化加工参数,分析镜头高和功率二因素对切割缝深的影响程度,以樟子松为例,采用二因素完全随机重复试验方法,在切割速度一定的条件下(v=100 mm/s),确定镜头高和功率对缝深的影响。通过方差分析以及多重比较分析,确定合理的参数为功率41.6 W、镜头高6 mm,或者功率65 W、镜头高6.5 mm。在此条件下可得最大切割缝深为4.5～6 mm。     

2A12铝合金切割工艺参数分析与预测

为了获得激光切割2A12硬铝合金的合理工艺参数,首先通过正交试验进行极差和方差分析,探究激光功率、切割速度和气体压力对切割质量的影响程度;其次运用Matlab神经网络工具箱建立BP神经网络进行训练;最后将训练好的神经网络与遗传算法相结合进行最佳工艺参数的预测。遗传算法最终得到了最优工艺参数,激光功率为2563 W,切割速度为2022 mm/min,氮气气压为0.62 MPa。     

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.