陶瓷镶块与铝合金全包容压铸连接的应力分析及结构优化

对陶瓷摇臂中陶瓷镶块与铝合金基体的连接方法进行了探讨，设计了倒楔角式的陶瓷镶块，采用铝合金压铸的方法将陶瓷镶块与铝合金基体连接起来，形成全包容的连接结构，对压铸过程中陶瓷镶块所受热应力进行了分析，并与把柄式结构在压铸过程中陶瓷镶块的受力情况进行了比较，证明全包容倒楔角式陶瓷镶块在压铸后受压应力作用，从而极大提高了陶瓷镶块工作的可靠性。     

一种快速创建粉末冶金模具标准件库的方法

针对在UG平台下如何快速创建粉末冶金模具标准件库的问题,提出了一种以VC 6.0和SQLserver2000 为开发工具,采用参数化建模技术、UG/OPEN API技术以及ADO数据库连接技术,程序代码可重用性较高的建库方法.并结合实例详细说明建库步骤,给出了部分关键程序代码.     

电网跨区实时告警功能的设计与实现

电网跨区实时告警功能实现了调控系统告警服务在Ⅲ区应用的拓展。通过对电网跨区实时告警均衡、同步、客户端安装功能的研究,将变电所实时告警数据通过Web网页方式发布到Internet上,供合法局域网用户浏览和查询。这不仅使变电所的投运调试工作变得更为便捷,而且保障了Ⅰ区的网络安全。     

基于UG OPEN/API的鱼雷对转螺旋桨参数化建模

对转螺旋桨的优化设计是鱼雷外形优化设计中很重要的部分。该文在现有UG二次开发语言UG OPEN/API的基础上,提出了一种对转螺旋桨参数化3D建模方法,建立了鱼雷对转螺旋桨的参数化模型,利用该方法能够简化对转螺旋桨优化设计的分析流程,具有较高的实用价值。     

欧盟AMI经验对下一代IR46智能电表规划的启示

欧盟第三能源法案为推广智能计量系统造福用户铺平了道路,欧盟组成专业执行机构落实智能电网及计量相关标准制订,积极推动成员国开展CBA分析,要求CBA结论为正面的成员国制订为期十年的长期行动计划,在2020年前将智能电表覆盖率达到80%以上,并在智能计量架构和功能、数据安全等方面给予指导。据此,法国电力提出了2015-2021年基于OPEN meter架构建设3500万只智能电表的Linky计划。文章介绍了Linky智能电表基本功能、通讯方式、数据安全、质量认证、通过G3-PLC在MV/LV侧分别载波实现“营配贯通”、遇到的问题以及民意抵制等方面的情况。并结合南方电网自2011年以来建设智能电表和低压集抄系统的经验,面向下一个轮换周期的新一代智能电表或智能能源网关部署,提出了十个方面的基本构想。     

基于OPEN3000系统的低周减载实时控制方法

由于传统的低周减载装置无法进行实时调整,为确保电网安全运行的第三道防线得到100%落实,减轻人工操作量,降低误操作的可能性,提出了基于OPEN3000系统的低周减载实时控制方法。该方法具有动态优化和实时控制两大功能,能根据OPEN3000中相关线路的潮流数据进行优化配置,并利用遥控功能实现对相关低周减载功能的实时投退,在确保第三道防线安全可靠的同时,减轻相关人员的工作量,提高电网的安全运行水平。     

新一代能量管理系统在地区电网调度中的应用与分析

为配合国家电网公司智能电网的建设实施,新一代的能量管理系统（EMS）,即CPEN 3000系统在青岛地区电网调度中正式投运。介绍了OPEN 3000系统的体系结构、逻辑结构,重点分析了OPEN 3000系统在青岛电网的应用及改进情况,为智能电网的建设打下了基础。     

UG工程图标注符号自动归位的实现方法

介绍了工程图标注符号自动归位的基本原理,并结合UG平台给出了实现方法。     

PC-based off-line programming in the shipbuilding industry: open architecture

In this paper, a PC-based off-line programming (OLP) method using the virtual reality modeling language is proposed. The developed OLP system consists of simulation programs, a block-arrangement algorithm, an optimal traveling-path generation algorithm, an automatic robot program generator and the TRIBON CAD interface. The strength of the developed PC-based OLP system lies in its flexibility in handling the changes in the robot's target objects. The operator can generate robot programs very easily and quickly. Possible applications of the developed OLP can be extended to port automation, container loading/unloading processes as well as painting and grinding processes in the shipbuilding industry.     

Near-Optimum Folding for a Reconfigurable Snake-Like Robot

To improve reachability of a snake-like robot depending on the problem, the links of the robot need to be resizable. In such a case folding links of the robot help to better plan obstacle avoidance. Optimum folding of the robot is the aim of our paper. We introduce a practical idea to construct reconfigurable and resizable snake robots which can be folded and an approximation algorithm to find near-optimum folding for the robot. Since an open chain is an abstract model of a snake-like robot, folding algorithms for the proposed robot are given in terms of an open chain. Ruler folding is a well-known NP-Complete problem. It considers folding of an n-link open chain linkage to the minimum length. The best previously known approximation algorithm for this problem has been developed by Hopcroft et al. They achieved the upper bound of 2m ₁ for the length of the folded chain in all cases, where m ₁ is the length of the longest link of the given chain. Already there are no any algorithms for open chain folding which guarante that the folded length of the open chain is less than 2m ₁. In this paper, we introduce an approximation algorithm which runs in O (n log n) using O (n) space. We introduce a function for the upper bound of the folded chain which depends to the lengths of all links in the given chain. Our experimental results show that for more than 95% of the problem instances we can achieve the same results in O (n) time. Using our folding algorithm, we can design the length of each link in an open chain to get x · m ₁ folded length where 1 < x < 2 is given and m ₁ is the length of the longest link of the chain. We introduce how to design a snake-like robot for which it can be folded in the given interval.