Adaptive relay co-ordination using a busbar splitting approach for a system integrity protection scheme

Power system faults can often result in excessively high currents. If sustained for a long time, such high currents can damage system equipment. Thus, it is desirable to operate the relays in the minimum possible time. In this paper, a busbar splitting approach is used for adaptive relay setting and co-ordination purposes for a system integrity protection scheme (SIPS). Whenever a fault occurs, the busbar splitting scheme splits a bus to convert a loop into a radial structure. The splitting schemes are chosen such that the net fault current is also reduced. Busbar splitting eliminates the dependency upon minimum breakpoints set (MBPS) and reduces the relay operating time, thus making it adaptive. The proposed methodology is incorporated into the IEEE 14-bus and IEEE 30-bus systems with single and multiple fault conditions. The modeling and simulation carried out in ETAP, and the results of the proposed busbar splitting-based relay co-ordination are compared with the MBPS splitting-based relay co-ordination.     

Influence of cryogenic coolant on turning performance characteristics: A comparison with wet machining

Machining of 17-4 Precipitation Hardenable Stainless Steel (PH SS) is one of the difficult tasks because of its high cutting temperatures. Conventional cutting fluids are used to overcome the high cutting temperatures, but these are not acceptable from the health and environmental sustainable points of view. Cryogenic cooling is one of the potential techniques to overcome such problems. In the current work, comparison is made of cryogenic turning results, such as tool flank wear, cutting forces (feed force, main cutting force), cutting temperature, chip morphology and surface integrity characteristics with wet machining during machining of heat-treated 17-4 PH SS. The result showed that in cryogenic machining, a maximum of 53%, 78%, 35% and 16% reductions was observed in tool flank wear, cutting temperature, surface roughness and cutting force, respectively, when compared with wet machining. It was also evident from the experimental results that cryogenic machining significantly improved the machining performance and product quality even at high feed rates.     

科研信用标准化建设与体系框架研究

通过分析科研诚信与科研信用的基本属性和概念,提出科研信用体系建设的标准化需求,在此基础上,分析梳理了科研信用标准化的基本维度和分类,提出科研信用标准体系总体框架,并对科研信用标准化工作中的要点进行了分析和阐述,为推进我国科研信用标准体系建设提供参考.     

Surface integrity of Inconel 718 by hybrid selective laser melting and milling

ABSTRACT

While selective laser melting (SLM) offers design freedom of metal parts with much less material consumption, there exist several limitations, including high surface roughness, low-dimensional accuracy, and high tensile residual stresses. To make functional parts with high form accuracy and superior surface integrity, an as-SLM part needs finishing to remove the deposited surface material. The integration of machining and SLM creates a hybrid manufacturing route to overcome the inherited limitations of SLM. However, little study has been done to characterise surface integrity of an as-SLM part followed by machining (e.g. hybrid SLM-milling). In this paper, surface, integrity including surface roughness, microstructure, and microhardness, have been characterised for IN718 samples processed by the hybrid process. It has been found that microhardness varies with the scan direction and the use of coolant in the subsequent milling, and surface integrity can be significantly improved by the hybrid SLM-milling route.     

荧光剂–示踪液体法检查滴眼剂包装密封完整性

目的 建立一种荧光剂–示踪液体法检查利巴韦林滴眼液包装系统的密封完整性,为滴眼剂产品包装密封完整性验证提供通用廉价的方案。方法 以罗丹明B为示踪剂,采用高效液相色谱–荧光检测器法进行检测,评价利巴韦林滴眼液货架期的密封性,以及模拟临床开启后的密封性。结果 此方法可准确检测包装材料中发生的5 μm孔径泄漏,检测限级别达到《化学药品注射剂包装系统密封性研究技术指南》(试行)中的3级,能有效评价利巴韦林滴眼液包装系统的密封完整性。结论 该方法的通用性强、灵敏度高,可为滴眼剂产品包装系统密封完整性检查提供技术支持。     

An Influence Maximization Algorithm Based on Improved K-Shell in Temporal Social Networks

Influence maximization of temporal social networks (IMT) is a problem that aims to find the most influential set of nodes in the temporal network so that their information can be the most widely spread. To solve the IMT problem, we propose an influence maximization algorithm based on an improved K-shell method, namely improved K-shell in temporal social networks (KT). The algorithm takes into account the global and local structures of temporal social networks. First, to obtain the kernel value Ks of each node, in the global scope, it layers the network according to the temporal characteristic of nodes by improving the K-shell method. Then, in the local scope, the calculation method of comprehensive degree is proposed to weigh the influence of nodes. Finally, the node with the highest comprehensive degree in each core layer is selected as the seed. However, the seed selection strategy of KT can easily lose some influential nodes. Thus, by optimizing the seed selection strategy, this paper proposes an efficient heuristic algorithm called improved K-shell in temporal social networks for influence maximization (KTIM). According to the hierarchical distribution of cores, the algorithm adds nodes near the central core to the candidate seed set. It then searches for seeds in the candidate seed set according to the comprehensive degree. Experiments show that KTIM is close to the best performing improved method for influence maximization of temporal graph (IMIT) algorithm in terms of effectiveness, but runs at least an order of magnitude faster than it. Therefore, considering the effectiveness and efficiency simultaneously in temporal social networks, the KTIM algorithm works better than other baseline algorithms.     

Undivided and Indistinguishable Histories in Branching-Time Logics

In the tree-like representation of Time, two histories are undivided at a moment t whenever they share a common moment in the future of t. In the present paper, it will first be proved that Ockhamist and Peircean branching-time logics are unable to express some important sentences in which the notion of undividedness is involved. Then, a new semantics for branching-time logic will be presented. The new semantics is based on trees endowed with an indistinguishability function, a generalization of the notion of undividedness. It will be shown that Ockhamist and Peircean semantics can be viewed as limit cases of the semantics developed in this paper.     

Linear Least-Squares Algorithms for Temporal Difference Learning

We introduce two new temporal difference (TD) algorithms based on the theory of linear least-squares function approximation. We define an algorithm we call Least-Squares TD (LS TD) for which we prove probability-one convergence when it is used with a function approximator linear in the adjustable parameters. We then define a recursive version of this algorithm, Recursive Least-Square TD (RLS TD). Although these new TD algorithms require more computation per time-step than do Suttons TD() algorithms, they are more efficient in a statistical sense because they extract more information from training experiences. We describe a simulation experiment showing the substantial improvement in learning rate achieved by RLS TD in an example Markov prediction problem. To quantify this improvement, we introduce the TD error variance of a Markov chain, TD, and experimentally conclude that the convergence rate of a TD algorithm depends linearly on TD. In addition to converging more rapidly, LS TD and RLS TD do not have control parameters, such as a learning rate parameter, thus eliminating the possibility of achieving poor performance by an unlucky choice of parameters.     

Recognizing interleaved and concurrent activities using qualitative and quantitative temporal relationships

The majority of approaches to activity recognition in sensor environments are either based on manually constructed rules for recognizing activities or lack the ability to incorporate complex temporal dependencies. Furthermore, in many cases, the rather unrealistic assumption is made that the subject carries out only one activity at a time. In this paper, we describe the use of Markov logic as a declarative framework for recognizing interleaved and concurrent activities incorporating both input from pervasive lightweight sensor technology and common-sense background knowledge. In particular, we assess its ability to learn statistical-temporal models from training data and to combine these models with background knowledge to improve the overall recognition accuracy. We also show the viability and the benefit of exploiting both qualitative and quantitative temporal relationships like the duration of the activities and their temporal order. To this end, we propose two Markov logic formulations for inferring the foreground activity as well as each activities’ start and end times. We evaluate the approach on an established dataset where it outperforms state-of-the-art algorithms for activity recognition.     

Zero-knowledge proofs of retrievability

Proof of retrievability (POR) is a technique for ensuring the integrity of data in outsourced storage services.In this paper,we address the construction of POR protocol on the standard model of interactive proof systems.We propose the first interactive POR scheme to prevent the fraudulence of prover and the leakage of verified data.We also give full proofs of soundness and zero-knowledge properties by constructing a polynomial-time rewindable knowledge extractor under the computational Diffie-Hellman assump...