Deployment of a cloud pipeline for real-time visual inspection using fast streaming high-definition images

We investigate the challenges of building an end-to-end cloud pipeline for real-time intelligent visual inspection system for use in automotive manufacturing. Current methods of visual detection in automotive assembly are highly labor intensive, and thus prone to errors. An automated process is sought that can operate within the real-time constraints of the assembly line and can reduce errors. Components of the cloud pipeline include capture of a large set of high-definition images from a camera setup at the assembly location, transfer and storage of the images as needed, execution of object detection, and notification to a human operator when a fault is detected. The end-to-end execution must complete within a fixed time frame before the next car arrives in the assembly line. In this article, we report the design, development, and experimental evaluation of the tradeoffs of performance, accuracy, and scalability for a cloud system.     

特低渗透油藏驱替及开采特征的影响因素

应用非达西渗流理论和非线性弹性渗流理论，分析了影响特低渗透油藏驱替及开采特征的主要因素。研究结果表明，启动压力梯度和毛细管压力是影响特低渗透油藏驱替特征的主要因素；而影响特低渗透油藏开采特征的主要因素是储层的弹塑性，即储层的压力敏感性。在特低渗透油藏的开发中应适当缩小注采井距提高驱替压力梯度，采取整体压裂措施减小启动压力梯度，通过气驱或活性水驱油减小毛细管压力，及时补充地层能量以减少压力敏感性对储层的伤害。     

The Content Driven Mobile Internet

The development of future mobile networks will be driven, in large part, by content and web based services. In this paper, we examine several performance, scalability and architectural challenges faced by future mobile web applications and how advanced mobile content delivery techniques can address these challenges. We review existing content delivery using a taxonomy that consists of three categories: network scaling, end system acceleration, and content and protocol optimization. While wireline content delivery focuses on network and server scalability, mobile content delivery will likely benefit most from optimizing radio link usage. We also present our ongoing work in this area, which extends the functionality of edge caching to the terminal, uses user interest correlation information to maintain low terminal power consumption and adds a new dimension to radio resource management. This revised version was published online in August 2006 with corrections to the Cover Date.     

130t RH脱碳模型建立及超低碳钢处理工艺优化

建立了RH真空处理脱碳数学模型，并通过130t RH工业试验结果对此数学模型加以验证。根据模型分析了[C]0、[O]0、真空度、提升气体流量等对脱碳效果的影响，据此优化了处理工艺，取得较好的效果。     

塔河渣油高温催化临氢热转化技术研究

以塔河减压渣油（简称塔河减渣）为原料，在实验室小型试验装置和中型连续试验装置上，对在较高温度条件下催化临氢热转化加工塔河减渣的工艺操作条件及改质效果进行了系统研究。采用高分散的油溶性催化剂，在高压釜反应器中考察了反应温度、反应压力、催化剂添加量、溶剂油添加量、反应时间以及助剂添加量对塔河减渣催化临氢热转化反应的转化率和缩合率的影响，优化了操作参数。在优化的操作条件下，进行了塔河减渣催化临氢热转化中型试验，得到初馏点大于524 ℃组分的裂化率为85.2%，馏分油收率为80%，金属（Ni+V）和沥青质脱除率均大于90%。     

Locality-preserving hash functions for general purpose parallel computation

Consider the problem of efficiently simulating the shared-memory parallel random access machine (PRAM) model on massively parallel architectures with physically distributed memory. To prevent network congestion and memory bank contention, it may be advantageous to hash the shared memory address space. The decision on whether or not to use hashing depends on (1) the communication latency in the network and (2) the locality of memory accesses in the algorithm.We relate this decision directly to algorithmic issues by studying the complexity of hashing in the Block PRAM model of Aggarwal, Chandra, and Snir, a shared-memory model of parallel computation which accounts for communication locality. For this model, we exhibit a universal family of hash functions having optimal locality. The complexity of applying these hash functions to the shared address space of the Block PRAM (i.e., by permuting data elements) is asymptotically equivalent to the complexity of performing a square matrix transpose, and this result is best possible for all pairwise independent universal hash families. These complexity bounds provide theoretical evidence that hashing and randomized routing need not destroy communication locality, addressing an open question of Valiant.This work was started when the author was a student at Oxford University, supported by a National Science Foundation Graduate Fellowship and a Rhodes Scholarship. Any opinions, findings, conclusions, or recommendations expressed in this publication are those of the author and do not necessarily reflect the views of the National Science Foundation or the Rhodes Trust.     

DKNNS:面向延迟敏感型应用的可扩展精确分布式K近邻搜索算法研究

为了降低用户访问延迟,延迟敏感型网络应用需要选择合适的邻近服务节点响应用户访问请求.分布式K近邻搜索通过可扩展的选择距任意用户节点邻近的K个服务节点,可以有效满足网络应用延迟优化的目的.已有工作在精确度以及可扩展性等方面存在不足.针对可扩展精确的K近邻搜索问题,文中提出了分布式K近邻搜索方法DKNNS(distributed K nearest neighbor search).DKNNS将大量的服务节点组织为邻近性感知的多级环,通过最远节点搜索机制选择优化的K近邻搜索初始化节点,然后基于回退方式快速的在目标节点邻近区域发现K个近邻.基于理论分析,模拟测试以及真实环境下的部署实验发现,在不同规模的节点集合下,DKNNS算法能够确定近似最优的K个服务节点.且DKNNS的查询延迟,查询开销均显著低于Meridian算法.最后,DKNNS的返回结果相对于Meridian具有较高的稳定性.     

多用户动态节能资源竞争计算卸载策略

针对移动边缘计算环境下,移动设备的计算、续航、存储能力的不足,导致其响应延迟、电池寿命降低等问题,设计了一种动态节能资源竞争计算卸载（DERCO）策略。该策略综合考虑了信道容量以及设备间的相互干扰等情况,以一种贪婪算法的思想,让所有边缘设备通过迭代竞争信道资源,节能效果最好的设备将获得卸载机会,再利用一次性卸载方法,根据实时的信道状况和卸载速率进行动态的细粒度子任务卸载决策。实验结果表明,该策略优于一种近似协同计算卸载方案,有效降低了设备的能耗与时延。     

焊接构造对T型接头超低周疲劳性能的影响

为了研究焊接细节对钢结构超低周疲劳性能的影响,以T型接头为对象,在通用有限元程序Abaqus平台上,开发基于Arlequin算法的结构多尺度计算程序. 利用多尺度算法,开展焊接接头的局部弹塑性有限元分析. 比较焊趾半径、厚钢板未熔透长度及焊趾表面凹凸对局部塑性应变履历的影响,利用Coffin-Manson模型对T型接头的超低周疲劳特性进行定性讨论. 数值计算结果表明,焊趾位置是焊接接头的超低周疲劳易损位置,厚钢板的未熔透长度对焊接部位局部塑性应变的影响不大;焊趾半径对焊趾局部塑性应变有较大的影响,增大焊趾半径可以有效提升钢结构在循环荷载下的超低周疲劳性能;焊趾表面的平整性是影响焊趾局部塑性应变履历的重要因素,尖锐的凹坑会明显降低焊接接头的超低周疲劳性能,磨平的焊趾表面可以减少局部塑性应变,提高接头的超低周疲劳强度.