基于拓扑优化的人工晶状体襻柔性机构设计

为了解决目前人工晶状体不能实现大跨度调节问题,根据人体生物眼测量基础数据及调节机制,建立了人工晶状体襻结构生物力学模型.基于结构拓扑优化方法,对人工晶状体襻结构进行了拓扑优化分析,得到布局合理的基本骨架结构.经机构运动学分析,给出了机构目标点位移值的变化规律.采用柔性建模理论方法,考虑材料特性及关节柔性,深入研究了该放大机构的实际运动规律,给出了该柔性机构位移放大的一般规律.经本模型优化后得到柔性机构位移输出值可达输入值的3.34倍,光学部前置位移随之增加,理论上可实现视觉质量的提高.     

煤粉源集合体对水力压裂效果的影响

煤粉颗粒在压裂液中发生"造浆"及"聚集"作用是影响煤层气藏水力压裂效果的关键.构造煤粉源集合体对压裂效果影响显著,研究结果表明:原位状态下,煤粉以构造煤粉源和原生裂缝煤粉源集合体两种形式赋存.前者体积在20~30m3之间,呈顺层和断层两种产状,其明显受煤储层小微构造的控制;后者规模很小,主要分布在内生裂隙缝间,其受煤变质程度和煤岩类型影响.煤层气完井期间,井筒附近构造煤坍塌扩径,构造煤粉源卸压膨胀,煤粉颗粒启动难度降低;压裂期间,在压裂液动压、紊流搅动作用下,煤粉颗粒均匀混合在流体中形成浆体;排采期间,回排的压裂液中煤粉含量较高,导致气井近井部位压裂裂缝及炮眼较早地堵塞,气井减产.而原生裂缝内煤粉在压裂液中通过颗粒疏水相互作用发生聚集,在压裂裂缝内形成堵塞,但堵塞程度较轻.稳定压裂液注入排量、减小流速,利用煤储层小微构造解剖技术预测构造煤粉源集合体发育部位能够降低近井部位堵塞的风险,改善水力压裂效果.     

一种改进的无线传感器网络优化定位算法

节点定位是无线传感器网络实际应用需要解决的关键问题。为了在提高定位精度的同时降低成本,提出了一种改进的粒子群优化定位算法。该算法首先提出前摄估计思想,完成未知节点的区域估计,缩小并限制可行解空间,以此加快粒子群的搜索速度;然后给出了竞争进化思想的数学模型,使用该模型和自适应权重在进一步加快收敛速度的同时增强了算法的全局和局部搜索能力。仿真结果表明,对比同类算法,该算法能更有效地利用锚节点信息,降低网络成本,在计算量显著减少的同时明显提高了定位精度,并且具有对测距误差鲁棒性强的优点。     

宽带信号匹配滤波的GPU实现及性能优化

从宽带相关的角度推导了基于小波变换的匹配滤波算法及基于快速傅里叶变换(FFT)算法,并分析了算法复杂度,提出了基于图形处理器(GPU)的可配置宽带匹配滤波的软件实现和理论预测与函数实测结合的优化方法.通过优化线程块的维度、绑定纹理寄存器来改进内核函数性能,再使用计算统一设备架构(CUDA)库来降低FFT与极值搜索的时延,并进行了性能优化设计.在性能测试中,文中方法在GPU平台的实现相比8核CPU平台的实现具有3.3倍加速比,其处理时延能够满足宽带匹配滤波的实时性需求.     

一种低副瓣锐截止波束赋形阵列天线设计

采用联合DFP和BFGS变尺度,结合全局寻优算法,通过优化阵列各单元馈电幅度和相位分布,设计了一种满足低副瓣锐截止波束赋形要求的阵列天线.该阵列由26个印刷振子单元天线组成,各单元馈电电路采用带状线环形桥.馈电电路网络采用带状线结构,整个馈电网络和印刷天线采用一体化设计,具有插入损耗小,结构紧凑的特点.实测表明,3dB波束宽度为11°,水平面锐截止为5.83dB/(°),副瓣低于-20dB.天线设计满足指标要求,并已获得应用.     

Numerical simulation and optimization of the cylinder head water jacket based on the two-phase flow boiling heat transfer

Boiling heat transfer and the controllability of the thermal load of the cylinder head were studied. The thermodynamic phase change characteristics of the cylinder head coolant were considered and the mass, momentum and energy transfers between two phases were calculated with the interface transfer sub-models by using the computational fluid dynamics software CFX. Results showed that compared with the single-phase flow without considering the boiling heat transfer, the sub-cooled boiling heat transfer of the cylinder head was greatly increased. According to the results of the numerical simulation, an optimized structure of the water jacket was proposed. Finally, temperature and velocity of coolant, diameter of flow passage and mean bubble diameter that influences sub-cooled boiling were studied using the orthogonal experiment method.     

Scheme optimization of AT shifting element based on genetic algorithm

In order to realize the computer aided design of AT shifting element schemes, a mathematical model of shifting element schemes which can be easily identified by computers was built. Taking the transmission ratio sequence as an optimization objective and simple shifting logic between adjacent gears through operating only one shifting element as a constraint condition, a fitness function of shifting element schemes was proposed. ZF-8AT shifting element schemes were optimized based on GA work-box of MATLAB, and the feasibility of the optimization algorithm was verified.     

Trajectory Optimization Design for Morphing Wing Missile

This paper presents a new particle swarm optimization (PSO) algorithm to optimize the trajectory of morphing-wing missile so as to achieve the enlargement of the maximum range. Equations of motion for the two-dimensional dynamics are derived by treating the missile as an ideal controllable mass point. An investigation of aerodynamic characteristics of morphing-wing missile with varying geometries is performed. After deducing the optimizing trajectory model for maximizing range, a type of discrete method is put forward for taking optimization control problem into nonlinear dynamic programming problem. The optimal trajectory is solved by using PSO algorithm and penalty function method. The simulation results suggest that morphing-wing missile has the larger range than the fixed-shape missile when launched at supersonic speed, while morphing-wing missile has no obvious range increment than the fixed-shape missile at subsonic speed.     

On the Range of the Common Cycle Time in a Road Network

In a coordinated road network, the optimal common cycle time is determined by evaluating the performance of the network in the given range of cycles. Normally, this range is determined by users’ experience. And a large range of common cycle time, e.g. \[0,0\] is chosen, which requires long computation time. This study considers that the optimal common cycle time ranges between the minimal and maximal value of intersections’ individual optimal cycle time. It is proved mathematically from the convexity condition, that the delay of the network and each individual intersection are convex functions of the cycle time according to Webster delay model. Finally, 2 000 random cases for the network composed of two intersections and of eight intersections are created to underline the proposed conclusions. The results of all cases confirm the validity, and show up to 90% improvement in computation time to compare with experience range. The signal optimization tool, Synchro, is also used to validate the conclusion by 50 random cases. The results confirm reliability further.