变电站五防系统配置分析

五防系统是变电站保障设备安全运行的重要一环,如果五防系统不符合投运条件而投入运行,运行人员在倒闸操作和停送电操作中,就很容易发生误操作事故。为了杜绝误操作事故的发生,必须从误操作发生的各种可能原因进行分析,并采取相应的对策,确保五防系统正确、可靠地投入运行。文中介绍了变电站五防系统在实际工作中容易出现的弊端,并对变电站五防系统在新站投运和技改工作中的一些做法进行了分析。     

防止调度自动化系统遥控防误操作的安全策略探究

电网遥控操作中的调度自动化系统能够极大的解放工作人员的劳动力,被广泛的使用到电力系统的操作运行中。但是调度自动化系统的防误操作性能与监控中心的监控系统相比弱了一些,不利于电网的正常运行。基于此,本文将通过分析遥控失误操作中的具体问题,提出几点防止调度自动化系统遥控防误操作的安全策略。     

水泥回转窑多因素智能控制系统

针对复杂的水泥回转窑热工过程．提出了一种基于系统运行模式的智能控制算法。依据专家操作模式下。对影响系统各因素的在线测量数据．运用改进聚类分析算法．建立系统的运行模式．并针对每个运行模式在线学习生成一条控制规则。进而自动生成控制规则库．实现复杂的水泥回转窑热工制度的最优控制。     

配网智能防误系统的研究与应用

嘉善县配网运行管理的环网柜共计100座,覆盖范围广,环网柜相对比较分散,无法防止各环网柜进出线之间的误操作,极易发生误合接地刀闸等操作事故,造成设备损坏及人身伤害。通过配网智能防误系统的研究与应用,不仅可以有效防止误操作,也使操作流程规范化、制度化,提高了配电网的运行管理水平。配网智能防误系统已广泛应用于嘉善县配电网,实际运行表明,该系统具有良好的兼容性、易用性和可靠性。     

基于Java的通用批处理作业系统的设计与实现

为了解决当前业务数据处理中客户群庞大、业务数据大、人工操作繁杂、重复性高等问题,针对现有核心系统构架并非针对完全连线化的设计,提出了同一Job内批次作业平行处理的通用批处理作业系统框架模型,采用断点续接、参数化和模块化设计等实现了该系统。研究结果表明:通过调节参数,Batch循环流程控制,以满足气象、电信等不同业务的需要,系统能为其提供业务数据的快捷处理手段,提高了操作效率,减少了人工误操作率,达到了通用批处理作业的效果。     

电网调度智能防误系统

电网调度智能系统将调度监控系统(SCADA)、高级应用系统(PAS)、检修计划和五防规则有机地结合起来,形成具有调度指令和遥控操作安全约束的电网监控系统,可以有效地防止调度人员的误调度和集控人员的遥控误操作.     

用于Hadoop平台的混沌加密研究与实现

为解决传统单机模式串行加密方法存在的不足,设计了一种基于Hadoop平台的混沌加密算法的运行方案。该方案运用MapReduce并行框架和混沌加密伪随机数以及初值敏感的原理,提出一种针对MapReduce框架和混沌加密优化的并行混沌加密方案,即用明文长度作为初值,分别对Chen、Lorenz、Rossler三种超混沌系统进行初始迭代,同时提出对明文数据按1 MB进行分块的设计理念,通过根据偏移量,判断每个分块生成长度为1 MB的Chen、Lorenz、Rossler三个密钥序列的方法,达到提升数据密度安全性、减少运行内存占有量等目的。该设计框架中,Chen序列用于明文置乱操作,Lorenz序列用于异或的扩散操作,Rossler序列用于取模的辅助扩散操作。实验证明,针对MapReduce并行框架特性和混沌系统特性的优化算法,在有效减小内存占用量、提高加密速度的同时,明文关联的加密操作达到了有效防御选择明文攻击的目的。     

一种可扩展的协议分析系统的设计与实现

本文针对现有协议分析系统价格昂贵,操作复杂,不易扩展等缺点,提出使用独立于计算机架构和编程语言的方法来描述结构化数据,设计并实现了具有良好体系结构的可扩展协议分析系统(以下简称EPAS),介绍了加速系统运行速度的技术要点,最后通过具体例子论述了EPAS的应用前景.     

基于调度网络指挥的智能防误系统设计与实现

随着智能信息技术的不断发展，持续完善调控中心遥控操作防误功能的建设对提升调度运行的安全性和高效性具有重要作用。为此，建立一种基于调度网络指挥体系的电网操作全程防误智能跟踪系统，并对系统的硬件架构方案进行设计，详细分析了系统防误操作的实现流程和主要功能。最后，通过调度操作智能防误系统的应用效果充分证实了该系统在保障电网安全可靠运行，提升电网调度、监控以及现场操作工作的高效性和安全性。     

探析变电运行电气误操作事故原因及防范措施

现代社会经济发展形势下,科学技术不断发展进步,电力新技术逐渐被应用于实际工作中,此种情况下,电力系统运行的安全性和可靠性直接影响着变电运行质量。一旦变电运行过程中出现电气误操作事故,会给电力系统造成严重的安全威胁,甚至危机操作人员的生命安全。本文就变电运行中电气误操作事故的原因进行简要分析,并提出科学化的防范策略,为变电运行相关操作人员提供借鉴。     

Problems in the information dissemination of the Internet routing

Internet routing is achieved by a set of nodes running distibuted algorithms--routing protocols,However,many nodes are resistless to wrong messages or improper operations,unable to detect or correct them.Thus a wrong message or an improper operation can easily sweep almost the whole Internet .Such a fragile Internet routing comes from the features of these algorithms and protocols.Besdes,the strategies taken by the network equipment manufacturers and administrators also are of important influence.When determining the options or selections in the implementation/operation,they always pay more attention to the expense of a single node or a single area and make some simplifications in implementations and configurations while caring less about the influence on the whole network,This paper tries to illustrate such a scheme is not reasonable at all and suggests the consideration from the view of the overall optimization .From three typical cases involved in the Internet routing ,a general model is abstracted,which makes the results significative for more Internet related aspects ,This paper evaluates the complexity of the theoretical analysis ,then acquires the effect of error information on the whole network through the simulation on the Internet topology,It is shown that even very little error information can incur severe impact on the Internet.And it will take much more efforts of downstream nodes to make remedies,This result is intuitively revealed through the comparisons in the charts and the visual presentations ,Then a hierarchcal solution to establish the upgrade plan is given,which helps to upgrade the nodes of the network in a most efficient and economical way.     

Zone pricing for time-definite LTL freight transportation with elastic demand

Because shipments to a pair of administrative divisions are typically delivered with the same time-in-transit service level, shippers expect that they should be charged the same price. Thus, the carrier clusters operation centers located in the same administrative division into a tier-1 zone. These zones are subsequently aggregated into a set of hierarchical zones for which the carrier defines and publishes a zone tariff chart. Zone pricing is a tactical decision that simultaneously determines the zone prices and an operational plan to use its operating capacity to maximize carrier’s profit while meeting the expected service level and operational requirements. We modeled this integral-constrained concave program using link formulation and proposed an implicit enumeration embedded with Lagrangian relaxation upper bounds to determine the optimal prices and operations plan. To meet the shippers’ expectation, we proved our model mathematically and demonstrated computationally, using Taiwan’s largest time-definite LTL freight carrier, that zone pricing has a negative impact on carrier profit in the process of aggregation.     

基于敏感度分析的车站应急预案生成算法研究

为提高铁路车站的应急预案管理水平和应急处理能力,提出一种基于敏感度分析的案例推理方法的应急预案管理模型。运用面向对象的框架表示方法来进行案例表示和建立案例库,构建案例特征属性的层次结构。采用层次分析法确定车站紧急事件预案特征属性的权重,运用全局相似度算法对已有应急案例进行检索与匹配。实例证明该方法能有效提高车站应急决策效率,实现预案决策的信息化和智能化。     

基于模糊集的主题提取和层次发现算法

从语义相关性角度分析超链归纳主题搜索(HITS)算法，发现其产生主题漂移的原因在于页面被投影到错误的语义基上，提出了一种基于模糊集的主题提取和层次发现算法(FSTH)，通过用户日志扩展查询词，构造符合用户需要的个性化根集和基础集合，达到防止主题漂移的目的。FSTH采用模糊集划分方法，层次地发现与用户查询相关的主题页面集合，利用HITS算法分别计算每个主题页面集合中页面的权威值，返回与查询相关的其他主题权威页面。在14个查询上的实验结果表明，与HITS算法相比，FSTH算法不仅可以减少7%~53%的主题漂移率，而且可以发现与查询相关的多个主题.     

基于分级模糊优选的大型项目网络计划调整模型

针对大型复杂项目的运行监控过程,提出一种基于分级模糊优选的进度计划调整模型。以两级模糊单元系统优选理论为基础描述计划调整的分级层次结构,通过指标特征值与混合相对优属度的计算,确定底层网络输入因素的相对优属度。运用语气算子结合决策序列排序,计算各单元输入系统的权重,获得计划调整的最优化方案。对某型汽车装配项目的网络计划进行仿真分析,验证了方法的有效性。     

Bilevel model for production–distribution planning solved by using ant colony optimization

This paper addresses a hierarchical production–distribution planning problem. There are two different decision makers controlling the production and the distribution processes, respectively, that do not cooperate because of different optimization strategies. The distribution company, which is the leader of the hierarchical process, controls the allocation of retailers to each depot and the routes which serve them. In order to supply items to retailers, the distribution company orders from the manufacturing company the items which have to be available at the depots. The manufacturing company, which is the follower of the hierarchical process, reacts to these orders deciding which manufacturing plants will produce them. A bilevel program is proposed to model the problem and an ant colony optimization based approach is developed to solve the bilevel model. In order to construct a feasible solution, the procedure uses ants to compute the routes of a feasible solution of the associated multi-depot vehicle route problem. Then, under the given data on depot needs, the corresponding production problem of the manufacturing company is solved. Global pheromone trail updating is based on the leader objective function, which involves costs of sending items from depots to retailers and costs of acquiring items from manufacturing plants and unloading them into depots. A computational experiment is carried out to analyze the performance of the algorithm.     

Shortest-linkage-based parallel hierarchical clustering on main-belt moving objects of the solar system

Data clustering is an important data preparation process in many scientific analysis researches. In astronomy, although the distributed environments and modern observation techniques enable users to collect and access huge amounts of data, the corresponding clustering process may become very costly. One of the challenges is that the sequential clustering algorithms, that can be applied to cluster hundreds of thousand main-belt asteroids to reason about the origins of the main-belt asteroids, may not be used in the distributed environment directly. Therefore, this study focuses on the problem of parallelizing the traditional hierarchical agglomerative clustering algorithm using shortest-linkage. We propose a new parallel hierarchical agglomerative clustering algorithm based on the master–worker model. The master process divides the whole computation into several small tasks, and distributes the tasks to the worker processes for parallel processing. Then, the master process merges the results from the worker processes to form a hierarchical data structure. The proposed algorithm uses a pruning threshold to reduce the execution time and the storage requirement during the computation. It also supports fast incremental update that merges new data items into a constructed hierarchical tree in seconds, given a tree of about 550,000 data items. To evaluate the performance of our algorithm, this study has conducted several experiments using the MPCORB dataset and a dataset from the DVO database. The results confirm the efficiency of our proposed methodology. Compared with prior similar studies, the proposed algorithm is more flexible and practical in the problem of distributed hierarchical agglomerative clustering.     

面向网络协同防御的动态风险评估模型

为了给协同防御场景下方案的自动生成提供决策依据,文章设计了一个分层风险评估模型。通过属性攻击图表示网络中的脆弱性,搜索攻击图中所有潜在攻击路径,计算每条路径被攻击者利用的概率和目标节点的全局概率。使用AHP层次分析法计算整个网络的层次风险。为解决协同防御中方案生成的两个重要问题--“什么时候响应”和“采取什么措施响应”--提供可靠的决策依据。     

An Accurate and Scalable Collaborative Recommender

We present a collaborative recommender that uses a user-based model to predict user ratings for specified items. The model comprises summary rating information derived from a hierarchical clustering of the users. We compare our algorithm with several others. We show that its accuracy is good and its coverage is maximal. We also show that the algorithm is very efficient: predictions can be made in time that grows independently of the number of ratings and items and only logarithmically in the number of users.     

How to make the replenishment and payment strategy under flexible two-part trade credit

In the existing inventory models concerning the two-part trade credit, a common assumption is that the retailer either pays for all the ordered items within a short permissible delay period and receives a cash discount or pays for all the ordered items within a long permissible delay period at the regular price. In this paper, this unrealistic assumption is relaxed. We assume that the retailer may pay any fraction of the purchase cost within the short permissible delay period and receives a cash discount and then the rest is paid within the long permissible delay period. A decision model is proposed for a retailer to determine the optimal ordering policy and payment plan. The closed-form optimal solution to the model is developed and analyzed. Numerical studies show that a retailer can obtain more benefits from the proposed payment plan than from the extreme payment plan in the existing literature.