磨料有序排布电镀砂轮的制备及其把持力研究

为解决电镀砂轮磨削加工中容屑空间不足的问题，采用点胶微粘接的方法制备了磨料有序排布的电镀砂轮，分析了磨料粘接效果和镀层力学性能。通过SEM分析了磨料/镀层/导电胶的结合界面，并进行了干磨削试验。研究结果表明，直径约为磨料粒径40%的胶点可粘接住磨料，单个胶点上粘接多颗磨料的占比小于6%；双脉冲电镀工艺制备的镀层显微硬度大于500HV，表层残余应力小于100MPa，磨料/镀层/导电胶之间的界面贴合紧密，无明显缺陷；砂轮在磨削时没有出现磨料脱落现象。     

负径向电场对带电粒子俘获率影响的数值模拟

本文采用数值方法求解Grad-Shafranov方程反演EAST典型长脉冲放电实验(炮号33068)的平衡位形和磁场分布，进而结合粒子在托卡马克电磁场中的运动方程，模拟氘离子在负径向电场存在时的运动轨迹，并统计不同负径向电场下的氘离子俘获率。结果表明：随负径向电场的增大，氘离子轨迹由扩张通行轨迹向外翻香蕉轨迹再向内翻香蕉轨迹，最后向压缩通行轨迹演变；氘离子俘获率随负径向电场的增大而减小，氘离子初始速度越小，其变化越大。     

单自由度八杆仿生机构构型与尺度同步设计方法

单自由度八杆仿生机构杆长参数较多，是仿生机器人领域研究的难点之一。为提高设计效率，提出一种构型与尺度同步设计方法。在选定的运动链和机架的基础上，以不等式形式分步给出运动可行性及外形约束条件，使得上一步的杆长可作为下一步求解的已知值。通过该过程，在得到八杆仿生机构构型的同时，快速得到所有杆长的初步可行域。循环上述过程，逐步缩小约束条件的范围，可使得八杆机构的杆长快速接近目标值。在此基础上，分类讨论了连杆搭接顺序、约束条件及基本运动链的差异对求解难度及构型结果的影响。利用所提出的单自由度八杆仿生机构的设计方法，在对初始条件进行合理选取的前提下，可在初步得到构型的同时将杆长限定在较小范围内，实现了构型与尺度的同步设计。该方法还可应用于其他单自由度机构的设计当中，具有较好的借鉴意义。     

Reducing idle time in event-triggered software execution via runnable migration and DPM-Aware scheduling

Being the main driver of innovation in the automotive industry, vehicle software calls for more efficient tools for its development. Safety-critical applications are predominantly written respecting the AUTOSAR standard, where tasks comprise code-fragments called runnables, and deployed on multi-core architectures. However, task parallelization introduces a substantial number of idle intervals, as runnables have to be mapped and scheduled at design-time without violating data dependencies. In parallelized event-triggered tasks, these intervals are utilized by migrating runnables from the interrupted time-triggered tasks. We propose to also migrate runnables from consecutively scheduled tasks and additionally, to maximize their number using DPM-aware application scheduling.     

机床结构轻量化设计研究进展

对机床进行优化的结构构型设计,使得材料在机床结构空间内更加合理地分布和有效地利用,一直都是机床设计工作者追求探索的目标。论述机床构型和结构件轻量化设计的研究历程和技术发展,对机床结构轻量化设计中常用的现代设计方法:参数优化、结构拓扑优化、多方法综合结构设计、仿生优化设计方法进行具体技术介绍和综合评述,并对近年兴起的仿生优化设计方法进行从方法、实现手段和轻量化效果等方面重点分析和评述,对机床构型和结构件轻量化设计研究的未来发展提出展望。     

Dynamic Performance of a Complex Distillation System to Separate a Five‐Component Hydrocarbon Mixture

Distillation is one of the most used separation processes in chemical industry, although it is a highly energy‐intensive operation. For multicomponent distillation, complex structures have been proposed in previous works, which may allow energy savings. Nevertheless, it is mandatory to understand the dynamic characteristics of such complex structures. In this work, the dynamic performance of a dividing‐wall‐based structure for the separation of a five‐component mixture is studied. A sensitivity analysis is performed on the structure in terms of the interlinking streams, performing a singular value decomposition analysis to selected cases with different operational conditions. The designs with the lowest energy duties also showed the best open‐loop properties.     

基于MCGS的洗油空穴反应实验装置计算机控制系统设计

介绍了基于MCGS的洗油空穴反应实验装置远程计算机自动控制系统的硬件、软件设计及其实现过程,为后续进一步的研究工作提供理论和实践基础。     

工业园区混合能源优化配置方法应用与实践

为了充分挖掘多能源之间的互补潜力,使工业园区混合能源系统的配置方式由传统粗放式转变为精确优化配置并降低系统配置方案的保守性,基于粒子群联合CPLEX求解算法对工业园区的系统配置和运行调度方案进行分析优化,并以某生物园区为例进行了实例分析,得到了目标函数下的最优设计方案和运行策略。仿真分析结果表明,优化配置方法的应用能够协调冷热电多种能源的混合利用,提升系统的综合经济性。同时,为工业园区能源供应项目的规划、设计提供参考性支撑,丰富设计手段。     

Multi-resource scheduling for FPGA systems

In modern cloud data centers, reconfigurable devices (FPGAs) are used as an alternative to Graphics Processing Units to accelerate data-intensive computations (e.g., machine learning, image and signal processing). Currently, FPGAs are configured to execute fixed workloads, repeatedly over long periods of time. This conflicts with the needs, proper to cloud computing, to flexibly allocate different workloads and to offer the use of physical devices to multiple users. This raises the need for novel, efficient FPGA scheduling algorithms that can decide execution orders close to the optimum in a short time. In this context, we propose a novel scheduling heuristic where groups of tasks that execute together are interposed by hardware reconfigurations. Our contribution is based on gathering tasks around a high-latency task that hides the latency of tasks, within the same group, that run in parallel and have shorter latencies. We evaluated our solution on a benchmark of 37500 random workloads, synthesized from realistic designs (i.e., topology, resource occupancy). For this testbench, on average, our heuristic produces optimum makespan solutions in 47.4% of the cases. It produces acceptable solutions for moderately constrained systems (i.e., the deadline falls within 10% of the optimum makespan) in 90.1% of the cases.