刀尖圆弧半径补偿对球面零件车削加工影响的分析

采用刀尖圆弧半径为0.4 mm的刀片,以0、0.4 mm、0.8 mm、1.2 mm为刀尖圆弧半径补偿值,得到球面曲率半径不同的四个试件,基于三丰C-3200测量仪对球面轮廓度进行测量,分析刀尖圆弧半径补偿对球面零件车削加工的影响。分析结果表明,在进行凸球面零件加工时,HNC-818A数控系统中的刀尖圆弧半径补偿功能有效,球面的曲率半径与刀尖圆弧半径补偿值的单调性一致。当刀尖圆弧半径补偿值线性变化时,球面的曲率半径呈非线性变化。当设定刀尖圆弧半径为真实值时,球面轮廓最为理想。在球面零件加工实践中,使用刀尖圆弧半径补偿功能,精加工采用可转位机夹车刀,通过试切法合理修改刀尖圆弧半径补偿值,可以提高球面零件的车削加工质量。     

不同级配对微表处混和料性能的影响

微表处技术是一种性能优良的路面养护技术。首先检验了微表处用原材料的技术指标,在满足规范的要求下选择了三种不同级配,并对三种不同级配的微表处混和料的使用性能进行了比较。     

车载电子设备机柜布线工艺设计

对电子机柜传统的走线方式进行了分析、解剖，提出了新的走线方案模式，从工艺角度对机柜走线结构进行了改进设计，使之更适合于车载机柜的布线要求。     

Augmenting Trees to Meet Biconnectivity and Diameter Constraints

Given a graph G=(V,E) and a positive integer D , we consider the problem of finding a minimum number of new edges E' such that the augmented graph G'=(V,E\cup E') is biconnected and has diameter no greater than D. In this note we show that this problem is NP-hard for all fixed D , by employing a reduction from the DOMINATING SET problem. We prove that the problem remains NP-hard even for forests and trees, but in this case we present approximation algorithms with worst-case bounds 3 (for even D ) and 6 (for odd D ). A closely related problem of finding a minimum number of edges such that the augmented graph has diameter no greater than D has been shown to be NP-hard by Schoone et al. [21] when D=3 , and by Li et al. [17] when D=2. Received April 19, 1999; revised June 5, 2001.     

Pheromone Disruption of Argentine Ant Trail Integrity

Disruption of Argentine ant trail following and reduced ability to forage (measured by bait location success) was achieved after presentation of an oversupply of trail pheromone, (Z)-9-hexadecenal. Experiments tested single pheromone point sources and dispersion of a formulation in small field plots. Ant walking behavior was recorded and digitized by using video tracking, before and after presentation of trail pheromone. Ants showed changes in three parameters within seconds of treatment: (1) Ants on trails normally showed a unimodal frequency distribution of walking track angles, but this pattern disappeared after presentation of the trail pheromone; (2) ants showed initial high trail integrity on a range of untreated substrates from painted walls to wooden or concrete floors, but this was significantly reduced following presentation of a point source of pheromone; (3) the number of ants in the pheromone-treated area increased over time, as recruitment apparently exceeded departures. To test trail disruption in small outdoor plots, the trail pheromone was formulated with carnuba wax-coated quartz laboratory sand (1 g quartz sand/0.2 g wax/1 mg pheromone). The pheromone formulation, with a half-life of 30 h, was applied by rotary spreader at four rates (0, 2.5, 7.5, and 25 mg pheromone/m²) to 1- and 4-m² plots in Volcanoes National Park, Hawaii. Ant counts at bait cards in treated plots were significantly reduced compared to controls on the day of treatment, and there was a significant reduction in ant foraging for 2 days. These results show that trail pheromone disruption of Argentine ants is possible, but a much more durable formulation is needed before nest-level impacts can be expected. Electronic supplementary material  The online version of this article (doi:) contains supplementary material, which is available to authorized users.     

Sub-optimal solutions to track detection problem using graph theoretic concepts

This paper demonstrates how the problem of tracking targets, which appear as either straight or curved lines in two-dimensional display images (or data images) can be formulated in terms of a directed weighted graph model and how dynamic programming techniques can be efficiently applied to reach an optimal or sub-optimal solution. In general, track detection algorithms providing optimal solutions have good detective ability, but most of them suffer from the inability to detect discontinuous lines or to resolve efficiently pairs of crossing lines. A sub-optimal solution is provided that efficiently overcomes these weaknesses. We focus on modeling the track detection problem in terms of a graph, formulating fast sequential/parallel sub-optimal track detection algorithms and testing them on simulated data in order to show their detective ability. Moreover, we specify the conditions under which sub-optimal algorithms can perform at least as well as their corresponding optimal algorithms. This is significant for the track detection problem where fast, accurate and real-time detection is considered a necessity.     

数字加速度传感器ADXL210在轨检仪中的应用

介绍了一种轨道检测仪及其重要传感器数字加速度传感器ADXL210的工作原理、功能、应用，并给出了ADXL210与MCS－51单片机的接口硬件电路和软件程序。     

凸轮机构推程、回程运动角的最佳匹配及其求解方法

在推程、回程运动角之和 Φ0 +Φ′0 =C(定值 )的情况下 ,必存在某一对推程、回程运动角的最佳匹配 Opti-m um{ Φ0 ,Φ′0 } ;当选用该最佳匹配时 ,对心式直动从动杆盘形凸轮基圆半径 r0 取得最小值 r0 min。本文在揭示出上述事实的基础上 ,研究解决了当选取最佳匹配 Optim um{ Φ0 ,Φ′0 }时 ,按许用压力角 [α]条件求解对心式直动从动杆盘形凸轮基圆半径最小值 r0 min的解析法。     

计算机硬盘坏磁道修复的思路与技巧

本文通过隐藏坏磁道分区的方法,着重介绍了硬盘坏磁道的修复技术及注意事项,同时还介绍了逻辑坏磁道、0磁道损坏的修复方法。     

Prediction of mean square radius of gyration of tree-like polymers by a general kinetic approach

This paper describes a kinetic method to predict the z-average molecular mean square radius of gyration of tree-like polymers formed by irreversible reactions, assuming Gaussian chains. It is based on the population balance equations for the two-sided molecular distributions of pendant chains associated with every chemically distinguishable kind of bonds. An automated method for the solution of those equations is valid both before as well as after gelation for complex kinetic schemes. Examples of its use are presented with polycondensation systems leading to hyperbranched polymers, the anionic polymerization of mono- and divinyl monomers and a radical polymerization with terminal branching and transfer to polymer.