塑料制品生产过程中的质量检验

塑料制品生产过程中的质量检验西北工业大学邱明恒（７１００７２）塑料制品的生产工序较多，有的制品成型加工的工艺流程也比较长，生产过程中所采用的成型用原材料品种、设备和模具均多种多样，而制品的外观和性能受成型温度、压力和时间及加工操作条件等多种因素的影响...     

配页机中书帖检测系统的研究

印刷品生产工序之一是将经过印刷机印刷出来的单页印张进行装订、成型,而其成败关键就是配页工序。     

AXCELIS：获中国领先代工厂青睐

Axcelis（亚舍立）最近对该公司生产的FusionGemini ES和FusionGeminiPlasma Asher两种等离子体灰化机台进行了重大技术革新，为芯片生产厂家提供了一项高度灵活的干法去胶工艺，并使批量制造的生产率提高了40%。Axcelis的FusionGemini微波顺束流等离子体灰化机台系统在世界各地已装机600多台。该机台系统以其工艺窗口宽，干法清除光刻胶和聚合物的应用范围广而著名。改进后的机台可提供更好的工艺效能并使生产线前段和后段中清洗工序的生产率提高到180片每时。对于原有的机台，他们也可以提供这些新功能的升级改造。微波顺束流等离子…     

汽车针刺地毯制造过程断裂伸长率控制分析

汽车针刺地毯生产率高,制造成本低,通过乳胶涂层、淋膜涂覆等加工工艺制成复合材料,但制造生产过程中,面料的断裂伸长率是一个重要指标。本文从针刺汽车地毯生产工艺流程实验研究入手,通过分析纤维原料对断裂伸长率的影响、开松混合工序对断裂伸长率的影响、梳理铺网工序对断裂伸长率的影响、针刺工序对断裂伸长率的影响、涂胶烘干工序对断裂伸长率的影响、淋膜复合工序对断裂伸长率的影响,提出了面料生产过程应对各工序控制地毯断裂伸长率加以控制,方可达到汽车内饰件复杂表面形状的设计要求。     

变频技术在塑料挤出机控制系统中的应用研究

挤出成型是塑料成型加工的重要方法之一,在塑料挤出机控制系统中采用变频调速技术具有降低生产能耗、提高生产率和产品质量、减少启动时对电网的冲击等优点。本文分析了塑料挤出机的工艺流程,介绍了挤出机变频控制原理,阐述了变频技术矢量控制的方法,针对MD380系列变频器进行了参数设置。实际应用表明,该系列变频器具调速精度高、调速范围宽、运行稳定等特点,满足挤出机生产的各项工艺要求。     

提高集成电路后工序成品率的方法

本文从生产实际出发，剖析了影响集成电路后工序成品率的原因，并针对生产线工序指数能力着手，找到了解决问题的方法，使成品率有了很大的提高。     

从光缆拉伸-应变曲线谈光缆生产的工序控制

本文通过分析光缆拉伸．应变曲线与生产各工序的关系，探讨如何利用拉伸-应变曲线来发现光缆生产工序中存在的问题并加以解决，从而提高光缆的产品质量。     

覆铜板连续制造方法

以往,覆铜板的制造包括:配制树脂、基材浸胶、配料加钢箔和热压成型等工序。这种传统的制造方法,存在以下缺点。 ●间断式,生产效率较低。 ●成型压力高,产品内应力大,易翘曲变形,尺寸稳定性差。 ●高压成型,易造成流胶过多,板边厚     

基于C++的STL编程思想

目前在程序设计领域中面向对象方法占据着主导地位，但其自身也固有一些不足和缺陷。为了能更好地重用软件，有效提高软件的生产率，仅有面向对象的程序设计思想是不够的，还需要泛型程序设计思想。泛型机制是编程语言和编程思想的一次革命。C＋＋语言提供的STL便是面向对象和泛型程序设计思想相结合的一个良好典范。     

手动曝光机自动化改造及光成像生产自动化

手动曝光机自动化改造可满足多层高层和低距线路板曝光对位的精度要求,提高了光成像工序的效率降低了该工序生产的人工成本,方便了光成像工序的自动化改造,且节约了该工序自动化的成本,提高了该工序自动化的机动性。     

On‐demand flow regulated routing for ad hoc wireless networks

In this paper, we present an on‐demand flow regulated routing algorithm (OFRA) for ad hoc wireless networks. The OFRA consists of two parts: an intermediate node load evaluation process and a routing path selection process. The intermediate node load evaluation process evaluates the load efficiency of the intermediate nodes according to bandwidth, data packets and computing capability. The routing path selection process selects the routing path with lower flow and fewer intermediate nodes. The OFRA can prevent intermediate nodes to be overcrowded and distribute traffic load over routing paths more evenly. The simulation result shows that the percentage of blocked routing paths is reduced and the total flow is more balanced and distributed. Copyright © 2006 John Wiley & Sons, Ltd.     

基于三氯氧磷液态源扩散技术的太阳能电池转换效率研究

通过对太阳能电池片扩散工艺中扩散端POCl3流量的控制实验,研究了POCl3流量对所制太阳能电池的等效串联电阻RS、漏电阻RSH以及转换效率的影响。结果表明:RS和RSH都随POCl3流量减小而增大。当POCl3流量为950 mL/min时,所制太阳能电池转换效率达到最大值16.69%,比常规生产(POCl3流量为1 000 mL/min)的转换效率提高了0.35%。     

埋嵌子板的HDI板制作工艺研究

通过对埋嵌子板高密度互连结构PCB中局部混压工艺难点进行分析,对铣槽精度控制、子母板偏移、板面流胶及阻胶方法控制等进行研究,通过试验评估了不同定位方式、不同开槽补偿方式、不同阻胶排板方式及边缘刮铜等设计,找出了工艺难点的有效解决方法,完善了埋嵌子板高密度互连结构PCB制作工艺,经批量生产应用,验证了该工艺可行性。     

Directional routing and scheduling for green vehicular delay tolerant networks

The vehicle delay tolerant networks (DTNs) make opportunistic communications by utilizing the mobility of vehicles, where the node makes delay-tolerant based “carry and forward” mechanism to deliver the packets. The routing schemes for vehicle networks are challenging for varied network environment. Most of the existing DTN routing including routing for vehicular DTNs mainly focus on metrics such as delay, hop count and bandwidth, etc. A new focus in green communications is with the goal of saving energy by optimizing network performance and ultimately protecting the natural climate. The energy–efficient communication schemes designed for vehicular networks are imminent because of the pollution, energy consumption and heat dissipation. In this paper, we present a directional routing and scheduling scheme (DRSS) for green vehicle DTNs by using Nash Q-learning approach that can optimize the energy efficiency with the considerations of congestion, buffer and delay. Our scheme solves the routing and scheduling problem as a learning process by geographic routing and flow control toward the optimal direction. To speed up the learning process, our scheme uses a hybrid method with forwarding and replication according to traffic pattern. The DRSS algorithm explores the possible strategies, and then exploits the knowledge obtained to adapt its strategy and achieve the desired overall objective when considering the stochastic non-cooperative game in on-line multi-commodity routing situations. The simulation results of a vehicular DTN with predetermined mobility model show DRSS achieves good energy efficiency with learning ability, which can guarantee the delivery ratio within the delay bound.     

一种不可信环境下的匿名位置辅助路由激励机制

不可信环境下的路由性能问题,是移动自组织网(mobile ad-hoc networks,MANET)匿名路由协议面临的主要问题之一.本文为在不可信环境下通过对自私节点进行高效的协作激励,提高匿名路由协议的性能,提出了一种基于哈希链的匿名位置辅助路由激励机制.该机制利用哈希链在计算上的高效性和安全上的不可逆性,达成了对匿名数据转发节点的即时激励;通过基于支付代价的路由选择机制,优化了现有位置辅助路由机制的路由发现过程.匿名性分析证明,该机制能保证参与路由节点的匿名性.效率评价表明,在数据传输总量较大时,该机制对路由性能的影响很小,且该机制在较小规模的网络中有更好的性能.     

成型加工良率与效率提升

结合多年理论与实践的成型加工技术经验,分析影响成型加工一次性良率和生产效率的种种因素。通过优化铣板程式设计,达到成型加工一次性良率和生产效率提升的目的。     

Routing algorithm design of satellite network architecture based on SDN and ICN

In view of the problems of low routing efficiency, complex control process, and difficult network management in big data environment in the traditional integrated space‐terrestrial network, in the paper, we propose a satellite network architecture called software‐defined information centric satellite networking (SDICSN) based on software‐defined networking (SDN) and information‐centric networking (ICN), and we design a virtual node matrix routing algorithm (VNMR) under the SDICSN architecture. The SDICSN architecture realizes the flexibility of network management and business deployment through the features of the separation of forwarding and controlling by the SDN architecture and improves the response speed of requests in the network by the centric of “content” as the ICN idea. According to the periodicity and predictability of the satellite network, the VNMR algorithm obtains the routing matrix through the relative orientation of the source and destination nodes, thus reducing the spatial complexity of the input matrix of the Dijkstra algorithm and then reducing the time complexity of the routing algorithm. For forwarding information base (FIB), the mechanism of combination of event driven and polling can be quickly updated in real time. Finally, the advantages of the SDICSN architecture in routing efficiency, request delay, and request aggregation are verified by simulation.     

一种智慧协同网络多参数的多路径路由算法

多路径路由技术采用多条路径同时传输,作为优化资源配置和负载均衡的重要技术,在路由可靠性、QoS路由、传输效率等多方面比单路径传输具有优势.现有互联网网络资源配置和路由机制相对静态和僵化,导致多路径技术的发展存在发展的局限性.现有多路径技术考虑在路由层面不利于多路径路由选择和计算,难以保证传输性能,降低网络传输效率.智慧协同网络能够动态感知网络需求,灵活适配网络资源,更好的支持路由可扩展性.本文在智慧协同网络架构下提出了一种智慧协同网络多参数的多路径路由算法.该算法制定了智慧协同网络多参数的多路径路由协议,对网络性能参数CPU占用率、往返时延(RTT)、带宽进行加权计算得到路径权重值,根据权重值进行流量分配.采用图论理论对网络流量分配及模型进行了分析.并在Mini-Net平台上进行了开发和实验,结果表明,该算法能够优化网络配置,减小往返时延,提高网络吞吐量,从而提高网络性能,实现负载均衡.     

基于人工智能技术的氮肥生产故障预警装置设计研究

本文针对氮肥生产的特殊复杂性、设备故障影响因素的繁杂性等,提出基于人工智能技术的氮肥生产故障预警装置,该设计方案中主要流程为:原始生产数据输入、卷积神经网络(CNN)计算模型预训练、实时生产数据输入、模型计算、故障类型的预测及报警,并进行了装置的结构设计。最终,通过人工智能技术,实现化工生产过程的优化,更高效地保障了生产过程的安全,提高生产效率,也为其他领域的智能化优化提供思路。     

Enhanced Optimal and Heuristic Solutions of the Routing Problem in Light-Trail Networks

Light-trail is an efficient and feasible technology for IP transport over all-optical networks. The proposition of light-trails for all-optical networks has demonstrated a number of advantages over other paradigms such as Wavelength Routing (WR), Optical Burst Switching (OBS) and Optical Packet Switching (OPS). This article tackles the routing problem of light-trails with the solution objective of minimizing the number of needed light-trails to accommodate an offered traffic matrix. We present two enhancements to the Integer Linear Programming (ILP) formulation of the routing problem. We also propose a computationally efficient routing heuristic for use with static and incremental traffic models. The heuristic is based on routing flows one-by-one. This is done by assigning a set of attributes to each flow and to each network path. The flow attributes are used to determine the order in which flows are presented to the routing algorithm. The path attributes are used to determine which path is selected to route the flow at hand. The efficiency of the proposed heuristic is confirmed using example problems of different network topologies.