回转头技术在表面贴装设备中的应用

当今的回转头式贴装设备能够以相对低廉的价格 ,提供高速度和准确的贴装 ,以及先进的识别操作。     

柘林电站第二溢洪道砼鼻坎截水墙施工

柘林水电站第二溢洪道,在鼻坎先于下部截墙施工中,为了满足当年泄洪,施工先沿截墙自上而下挖掘交通竖井,支撑牢固,安设好提升设备并打通墙底导洞后,再自下而上分层扩挖及浇筑砼.开挖采用登渣作业,出渣用可伸缩手柄架子车经吊篮提升.墙顶砼浇筑,通过预留在鼻坎内的下料小井进料.     

高精度视觉贴片机拾放程序设计编程

探讨了SMT高精度视觉贴片机难点之一拾放程序设计编程 ,重点介绍示教编程和CAD输入编程设计方法。     

Deadline-aware multi-objective IoT services placement optimization in fog environment using parallel FFD-genetic algorithm

Nowadays, Internet of things has become as an inevitable aspect of humans’ IT-based life. A huge number of geo-distributed IoT enabled devices such as smart phones, smart cameras, health care systems, vehicles, etc. are connected to the Internet and manage users’ applications. The IoT applications are generally time sensitive, so that giving them up to Cloud and receiving the response may violate their required deadline, due to distance between user device and centralized Cloud data center and consequently increasing network latency. Fog environment, as an intermediate layer between Cloud and IoT devices, brings a smaller scales of Cloud capabilities closer to user location. Processing real time applications in Fog layer helps more deadlines to be met. Although Fog computing enhances quality of service parameters, limited resources and power of Fog nodes is a challenge in processing applications. Furthermore, the network latency is still an issue for communications between applications’ services and between user device and Fog node, which seriously threatens deadline condition. Regarding to mentioned points, this paper proposes a 3-partite deadline-aware applications’ services placement optimization model in Fog environment which optimizes total power consumption, total resources wastage, and total network latency, simultaneously. The proposed model prioritizes applications in 3 levels based on their associated deadline, and then the model is solved using a parallel model of first fit decreasing and genetic algorithm combination. Simulations results indicates the superiority of proposed approach against counterpart algorithms in terms of reducing power consumption, resource wastage, network latency, and service rejection rate.     

应用于大规模ASIC的线长驱动的合法化算法

总体布局完成之后的核心任务就是单元位置的合法化,即在将所有的单元安放到布局区并且与合理位置(site)对齐的同时,消除单元间的重叠.为了高效地实现大规模ASIC(Application Specific Integrated Circuit,专用集成电路)的布局过程,提出一种基于线长驱动的合法化算法.它以电路总线长为优化目标,同时考虑单元布局合理位置的约束和预布障碍.在ISPD' 11和DAC' 12竞赛例子上进行的测试结果表明了算法在线长保护及优化方面的效果.这些测试用例都是来源于现代工业ASIC设计的实例,由此说明了算法可以稳定有效地解决工业器中大规模ASIC多种特征电路的布局合法化问题.     

Tool path smoothing of a redundant machine: Application to Automated Fiber Placement

Automated Tape Laying and Fiber Placement of composite materials are the two principal automated processes used for fabrication of large composite structures in aeronautical industry. The aluminum parts produced by High Speed Machining tend to be replaced by carbon fiber composite parts realized with these processes. However, structural parts present reinforcement zones which disturb the tool path follow-up and generate an increase of the manufacturing time. Thus, this paper deals with the optimization of tool paths of a 7-axis machine tool of Fiber Placement with the objective of reducing the manufacturing time while ensuring the requested quality of the final part. In this paper, two complementary methods are detailed. The first method takes advantage of the degree of redundancy of the machine tool to decrease the kinematic loads of the control joints. The second method aims to smooth the orientation of the machine head along the tool path while ensuring quality constraints. These two methods are then applied on a test tool path and bring to a significant decrease of the manufacturing time (32.9%).     

一种FPGA抗辐射布线算法设计

随着集成密度的增大以及工作电压的降低,基于SRAM的FPGA芯片更加容易受到单粒子翻转的影响。提出了一种基于通用布局布线工具VPR的抗辐射布线算法,通过改变相关布线资源节点的成本函数,来减少因单粒子翻转引起的桥接错误,并与VPR比较下板测试结果。实验结果表明,该布线算法可以使芯片的容错性能提升20%左右,并且不需要增加额外的硬件资源或引入电路冗余。     

基于关系的并行数据仓库的数据划分和操作

目前并行数据库的研究已经进入了实际应用阶段,而数据仓库的大数据量处理更需要并行处理能力的支持。针对数据仓库的特点,提出了一种可操作的并行化数据划分方法和物理存储方案,同时对基于该种数据存储的数据操作做了详细的讨论,并对各种Join操作的具体处理方法进行了归类论述。     

一种超节点P2P网络中基于语义的协同缓存管理机制

超节点P2P（Super-peerP2P）结合了P2P结构和C／S结构的优点,是当前应用最广的一类P2P系统。在超节点P2P网络中,文件访问是最基本的操作,往往使用缓存技术来提高其操作效率。目前大多数超节点P2P网络使用传统的“尽力而为”的缓存机制,该机制没有区分超节点网络中不同节点对资源的需求及关注程度不同,导致偶尔访问的对象替换经常访问的对象。针对“尽力而为”缓存机制的不足,本文提出一种基于语义信息的协同缓存管理机制SCOCM（Semantic-based Cooperative Cache Management mechanism for super-peer net works）,应用已经请求对象的语义信息主动地选择对象放置缓存,以兴趣度的远近驱逐缓存内的对象,减少缓存对象的替换,使得每个缓存中缓存的对象之间尽可能地保持语义联系。实验结果表明,基于语义信息的协同缓存管理机制与LRU相比可大大降低缓存的替换率,提高缓存的存取效率,命中率也较高。     

二维优化排样方法及实现技术

在工业应用领域中存在大量的二维下料问题,其中应用最多的是矩形件下料问题.矩形件下料问题的关键是寻找二维平面的优化布局.针对工业生产中实际存在的问题与约束条件,给出了新的规则设计理论和数据模型,利用覆盖率和有效覆盖率的概念来控制余料合并操作的执行,运用布局规则、组合规则和切割规则给出了一种新的启发式算法.实验分析和工业应用证明,该启发式算法可以有效地提高板材的整体利用率,极大地减少了板材损耗.