挖掘机工作装置实验样本长度确定方法及程序系统

本文通过对某液压挖掘机工作装置实验样本长度的研究,详细讨论了样本长度的确定方法,重点分析了趋势曲线拟合法,提出了样本长度精度区间分析的方法,并在处理大量实验数据的基础上,从载荷分布及寿命估算的角度做了实际的验证.编制了应用程序,使样本长度确定至寿命估算整个过程程序化.     

Multi-grid domain decomposition approach for solution of Navier–Stokes equations in primitive variable form

A new multi-grid (two-grid) pseudospectral element method has been carried out for solution of incompressible flow in terms of primitive variable formulation. The main objective of the proposed method is to apply the multi-grid technique solving the incompressible flow problems associated with three commonly encountered multi-grid environments. In domain decomposition terminology, it includes (I) partially overlapped subdomains, each of which has same types of grids; (II) partially overlapped subdomains, each of which has different types of grids; (III) local adaptive subdomains fully overlapped with the original computational domain (composite grids). The approach for flow problems, complex geometry or not, is to first divide the computational domain into a number of subdomains with the inter-overlapping area (partially or fully overlapped). In categories I and II, the fine-grid or coarse-grid subdomains can be defined by their representation, while in category III the fine-grid or coarse-grid subdomains are defined as usual. Next, implement the Schwarz Alternating Procedure (SAP) to exchange the data among subdomains, where the coarse-grid correction is used to remove the high frequency error that occurs when the data interpolation from the fine-grid subdomain to the coarse-grid subdomain is conducted. The strategy behind the coarse-grid correction is to adopt the operator of the divergence of velocity field, which intrinsically links the pressure equation, into this process. The solution of each subdomain can be efficiently solved by the direct (or iterative) eigenfunction expansion technique or preconditioned method with the least storage requirement, i.e. O(N²) in 2-D. Numerical results of (i) driven cavity flow (Re = 100,400) with Cartesian grids (category I) in each subdomain, (ii) driven cavity flow (Re = 3200) with local adaptive grids (category III) in each subdomain, and (iii) flow over a cylinder (Re = 250) with ‘O’ grids in one subdomain and Cartesian grids in another (category II) will be presented in the paper to account for the versatility of the proposed multi-grid method.     

Construction of transmission lines above valuable standing timber

Problems with the construction of transmission lines above a forest are examined. Construction of lines above standing timber makes it possible to shorten the length of the route, eliminate the clearing of a continuous swath along the line, and reduce the volume of in-service work. To implement this solution, it is necessary to introduce changes and supplements to existing regulatory technical documents. __________ Translated from élektricheskie Stantsii, No. 10, October 2007, pp. 48–51.     

光纤光栅的长度对其峰值反射率的影响

利用耦合模理论,数值分析了当光纤光栅(FBG)折射率变化为均匀分布、直流切趾高斯分布时,光纤光栅长度对其峰值反射率的影响。研究结果对光纤光栅外腔半导体激光器的设计和性能优化具有重要的意义。     

拉盖尔-高斯光束通过有硬边光阑光学系统的传输

采用将硬边光阑展为有限个复高斯函数之和的方法,得到了拉盖尔-高斯光束通过有硬边光阑近轴ABCD光学系统中传输的近似解析公式,作了数值计算以说明传输公式的应用,并对使用该式的误差作了讨论。     

合成孔径雷达图像的恒虚警率目标检测

目的　对合成孔径雷达 (SAR)图像实施恒虚警率 (CFAR)目标检测 .方法　利用 K-Gamma和Weibull分布的杂波模型分别对海面和陆地的人造目标实施检测 ;同时 ,对不同杂波背景下 CFAR检测方法进行比较 .结果与结论　通过检测结果的比较 ,证实了 K-Gamma分布和 Weibull分布分别适合于海面和陆地杂波背景下的目标检测 ;在非均匀杂波背景中 ,有序统计量 (OS)较单元平均 (CA)方法具有优越性     

Development of a Sensor Fusion Strategy for Robotic Application Based on Geometric Optimization

Fusion of multi-sensor information is an important technology, which is growing exponentially due to its tremendous application potential in many areas. Effective fusion of data from sensors is very critical in increasing an intelligent system's capability to accomplish complex tasks. Appropriate fusion technologies are needed to be developed specially when a system requires redundant sensors to be used. More the redundancy in sensors, more is the computational complexity for controlling the system and more is its intelligence level. This research presents a strategy developed for multiple sensor fusion, based on geometric optimization. Each sensor's uncertainty has been modeled using classical Lagrangian optimization techniques. However, the uniqueness and effectiveness of the present technique lies on the fact that starting from the optimized value as initial estimate the accuracy of the sensory information has further been improved up to any pre defined bounded range, by developing two architectures – FFA (fission–fusion architecture) and FDD (fusion in differential domain). Sufficient evidences and analyses have been provided in the paper to show its effectiveness in various applications.     

Alternating,all-trans polyenynes: Model compounds for poly(diacetylene)s with defined conjugation length

The syntheses of polyenynes as model compounds for poly(diacetylene)s (PDAs) are described. Variation of properties (UV–VIS, Raman, NMR and bond geometries) as a function of the chain length was investigated. After extrapolation to infinite chain length these data were compared to those for PDAs. From UV–VIS spectra a value of λ = 551 nm (2.25 eV) was calculated corresponding to the electronic transition of a single polyenyne chain. This energy is located at the low energy end of a yellow PDA solution spectrum. From Raman scattering v_(C?C) = 2108–2128 cm^?1 and v_(C?C) = 1505–1532 cm^?1 were calculated after extrapolation. Similarly sp-C¹³C NMR data yielded a shift of δ = 100 ppm. These data are almost identical to data known for yellow PDA solutions. Bond geometries are almost identical to those of poly(diacetylene)s and theoretical data.     

The optimisation of higher order resampling methods in a multiprocessor environment

The processing of images obtained from satellites often involves highly repetitive calculations on very large amounts of data. This processing is extremely time consuming when these calculations are performed on sequential machines. Parallel computers are well suited to handling computationally expensive operations such as higher order interpolations on large data sets. This paper decribes work undertaken to develop parallel implementations of a set of resampling procedures on an Alliant VFX/4. Each resampling procedure implemented has been optimised in three stages. First, the algorithm has been restructured, where two-dimensional resampling is performed by two one-dimensional resampling operations. Second, each procedure has been reprogrammed in such a way that the autoparallelisation provided by the FX/Fortran compiler has been exploited. Thirdly, data dependent analysis of each procedure has been performed in order to achieve full optimization of each procedure; each procedure has been restructured where appropriate to circumvent vectorisation and concurrency inhibiting data dependencies. The nature and extent of the code optimization achieved for each procedure is presented in this paper. The original code for the most computationally expensive procedure, as targeted at a sequential machine, was found to have an execution time of 4900 seconds on the Alliant VFX/4 when compiled with regular compiler optimization options. Following algorithmic redesigning and reprogramming of the code, as indicated in stage 1 and stage 2, the execution time was reduced to 248 seconds. Restructuring of the code following data dependency analysis indicated in stage 3 in order to avoid data dependencies and allow concurrency and vectorisation, further reduced execution time to 162 seconds. The consequence of this work is that higher-order resampling methods which had not previous been practical are now routinely performed on the Alliant VFX/4 at the University of Dundee.