井下供电监控及防越级跳闸系统运用分析

以井下供电监控及防越级跳闸运用为对象开展探究。在分析矿井供电系统运行中现存主要问题的基础上,对供电监控与防越级跳闸系统整体应用的积极意义进行了分析和总结,希望能够让更多矿井技术人员了解供电监控及防越级跳闸系统的优越性,为其在矿井中的广泛推广普及提供便利,为煤矿行业更加高效地发展提供帮助。     

铁道客车DC600V电源装置门板密封条失效问题分析及改进建议

分析了铁道客车DC600V电源装置门板密封条失效的原因,提出了解决方案,并通过试验验证了其有效性。     

壳牌气化炉捞渣机技术改造小结

气化装置捞渣机设备在运行过程中经常出现堵渣、漂链、回程段积渣严重、机头回程链卡涩频繁等现象,造成捞渣机多次故障跳车.对捞渣机进行技术改造,避免捞渣机故障跳车,延长捞渣机主要部件刮板、导轮的使用寿命.     

基于出行链理论的电动汽车充电需求分析方法

基于出行链理论提出一种电动汽车充电需求分析方法,探讨了电动汽车一天出行过程中在不同区域内停驻时长的概率分布特点,对电动汽车空间转移概率进行3次B样条最小二乘曲线拟合,通过蒙特卡洛法并结合NHTS2009数据构建了电动汽车一天出行链,实现对用户行为规律的精细化模拟,并在设计2种充电行为的基础上对不同停驻区域的电动汽车充电需求进行了分析。该方法有效弥补了传统方法对电动汽车日间充电需求分析的不足,具有较高的精确性和原理清晰、易于操作等特点。     

智能变电站继电保护GOOSE网络跳闸探讨

现有智能变电站继电保护大多数采用"直采直跳"的模式,但存在装置光口和光缆敷设过多、配置复杂、维护困难等不足。分析了通用面向对象变电站事件(GOOSE)报文传输延时,结果表明网络传输延时占比较小,与网跳相比,直跳并没有优势。分析了GOOSE网跳安全性,提出间隔交换机或检修虚拟局域网(VLAN)可以提高检修扩建情况下的安全性。针对二次设备提出了网跳关键技术及验证测试方案,提出了继电保护应用网络跳闸的网络方案和约束条件。     

智能变电站二次设备状态监测技术研究

设备状态监测及评估是状态检修的基础,针对智能变电站技术特点,对二次设备状态监测及评估技术进行了研究。用IEC 61850采集交换机的状态信息,选取交换机端口流量、端口接收光强、发送光强、工作温度及端口误码率作为交换机的评价指标,用模糊综合评价方法,对交换机的状态进行综合评价。为防止保护出口跳闸回路触点粘连、失效、忘投压板等问题,设计后台监控系统与智能组件配合,实现了跳闸触点的定检。对间隔层、过程层之间的SV、GOOSE收发异常,提出了一种不依赖网络报文分析仪的诊断方法,诊断出是间隔层装置、还是智能组件故障。     

不同地形条件下架空配电线路防雷方案研究

作为供电系统当中的电能分配的关键设备,架空配电线路的安全与稳定直接影响着整个供电系统的正常运行。雷电灾害是架空配电线路当中频繁遇到的一种自然灾害,因此线路的防雷工作十分重要。本文在对架空配电线路的引雷范围、雷击跳闸率计算的分析基础上,探讨其在不同地形条件下的防雷方案。     

浅析220 kV线路跳闸故障及应对措施

随着经济的发展,城市配电网络以及山区高压电缆架设工程进展迅速。但是由于部分地区的自然灾害、人为事故频繁等原因,电力线路经常出现故障。比如雷电活动导致的跳闸现象。对此,本文作者通过对220kV某线雷击跳闸故障进行实例分析,寻找跳闸事故的原因。并结合多年工作经验对事故之后的改进措施提出了自己的看法。     

一起断路器跳闸回路典型缺陷分析及处理措施

本文介绍了某220kV变电站内#2主变压器变高开关在定期检验过程中,由于压力降低禁止跳闸接点的设计错误导致开关跳闸回路存在缺陷,分析了缺陷原因并对同类型回路的设计缺陷进行了彻底处理。经过现场分析和模拟试验,验证了判断、分析和问题处理的正确性,并对二次回路提出来实用的改造方案,对其他有类似问题的变电站有一定的借鉴作用。     

Efficient trip scheduling algorithms for groups

Given the source and destination locations of $n$ group members and a set of required point of interest (POI) types such as restaurants and shopping centers, a Group Trip Scheduling (GTS) query schedules $n$ individual trips such that each POI type is included in exactly one trip and an aggregate trip overhead distance for visiting the required POI types is minimized. Each trip starts at a member’s source location, goes through some POIs, and ends at the member’s destination location. The trip distance of a group member is the distance from her source to destination via the POIs that the group member visits, and the trip overhead distance of the group member is measured by subtracting the distance between her source and destination locations (without visiting any POI type) from her trip distance. The aggregate trip overhead distance is either the summation or the maximum of the trip overhead distances of the group members for visiting the POIs. A GTS query enables a group to schedule independent trips for its members in order to perform a set of tasks with the minimum travel cost. For example, family members normally have many outdoor tasks to perform within a short time for the proper management of home. The members may need to go to a bank to withdraw or deposit money, a pharmacy to buy medicine, or a supermarket to buy groceries. Similarly, organizers of an event may need to visit different POI types to perform many tasks. These scenarios motivate us to introduce a GTS query, a novel query type in spatial databases. We develop an efficient approach to process GTS queries and variants for the Euclidean space and road networks. By exploiting geometric properties, we refine the POI search space and prune POIs, which in turn reduce the query processing overhead significantly. In addition, we propose a dynamic programming technique to eliminate the trip combinations that cannot be part of the optimal query answer. We show that processing a GTS query is NP-hard and propose an approximation algorithm to further reduce the query processing overhead. We perform extensive experiments using real and synthetic datasets and show that our approach outperforms a straightforward approach with a large margin.