基于边缘AI的配网非定点作业现场实时智能安全监护成套装置研制

为满足带电作业、高处作业等配电网复杂作业场景的安全监护要求,解决配网非定点作业人工监护效率低、现场终端能力单一协同不足、通信安全较难保障等实际问题,文章提出了一种具有强边缘智能、主动监护、精准定位与辨识、多层通讯安全防护等特点的智能安全监护成套装置设计方案。该装置实现了视频监控设备的主动控制、作业人员活动的跟踪监测、监控视频的实时就地智能分析与违规行为预警;装置通过配套定位设备,实现了作业地点和作业范围的动态划定以及作业人员的精准定位;实现了可信通讯设备的自组网络和通讯内容的多层加密。实验结果表明,该装置在典型场景下的平均检测精度可以达到90%以上,可以极大提高配网户外非定点作业场景下的安全监护效率,提升作业现场安全的实时监管能力。

Positioning of grid points in wave front construction

In view of the relative positioning problem between non-regular quadrilateral grids and regular rectangle grid nodes in the wave front construction method, concrete realization problems with four grid positioning methods （vector cross product judgment, angle sum, intersection-point, and signs comparison algorithms） in wave front construction which are commonly used in computer graphics are compared and analyzed in this paper. Based on the stability analysis of the location method, the calculation examples show that the vector cross product judgment method is faster and more accurate than other methods in the realization of the relative positioning between non-regular quadrilateral grids and regular rectangle grid nodes in wave front construction. It provides precise grid point attribute values for the next steps of migration and demigration.

An Iterative Clustering-Based Localization Algorithm for Wireless Sensor Networks

In wireless sensor networks,node localization is a fundamental middleware service.In this paper,a robust and accurate localization algorithm is proposed,which uses a novel iterative clustering model to obtain the most representative intersection points between every two circles and use them to estimate the position of unknown nodes.Simulation results demonstrate that the proposed algorithm outperforms other localization schemes (such as Min-Max,etc.) in accuracy,scalability and gross error tolerance.

Node cooperation based location secure verification algorithm in wireless sensor networks localization

For the application of wireless sensor networks in the military field, one of the main challenges is security. To solve the problem of verifying the location claim for a node, a new location verifica- tion algorithm called node cooperation based location secure verification （NCBLSV） algorithm is proposed. NCBLSV could verify malicious nodes by contrasting neighbor nodes and nodes under beam width angle using an adaptive array antenna at a base point. Simulation experiments are con- ducted to evaluate the performance of this algorithm by varying the communication range and the an- tenna beam width angle. Results show that NCBLSV algorithm has high probability of successful ma- licious nodes detection and low probability of false nodes detection. Thus, it is proved that the NCBLSV algorithm is useful and necessary in the wireless sensor networks security.

AUTO-IDENTIFICATION OF FOREST FIRE-POINTS IN NOAA IMAGES BASED ON NEURAL NETWORK

Identification of forest fire-points in NOAA images in the basis of monitoring forest fire using NOAA satellite data. Traditional visual interpretation is difficult to settle for auto identification with computer. The artificial neural network technique provides a new means for solving this problem. In this paper, the principles and method of using neural network technique to automatically identify fire-points in NOAA images are discussed and the test in the range of Hubei province is presented. The result of the test shows that the disciplined neural network has collected the character of fire-points and has ability to identify fire-points in NOAA images. Comparing neural network with visual interpretation, the conclusion is drawn that by using neural network the purpose of auto-identification of forest fire-points in NOAA images can be realized with the almost same precision.

Design and performance analysis of wireless sensor network location node system for underground mine

Aiming at the application of a wireless sensor network to locating miners in underground mine,we design a wireless sensor network location node system,considering the communication performance and the intrinsic safety. The location node system consists of a mobile node,several fixed nodes,and a sink node,all of whose circuits were designed based on CC2430. A varistor and a RC circuit were used in the reset circuit of a sensor node to guarantee the intrinsic safety by reducing discharge energy,the theoretical analysis of the discharge energy shows that the reset circuit is an intrinsic safety one. The analysis and simulation about the performance of the location node system are discussed,such as network communication delay and packet loss rate,the results show that the highest network communication delay of the system is about 0.11 seconds,and the highest packet loss rate is about 0.13,which assures the location node system has a high reliability,and can locate miners in the underground mine.

Kaixin001 Network with Random Hierarchical Model

A new random hierarchical model to describe the neighborhood properties of Kaixin001 network is developed in this paper. The degree distribution of this network model follows P（k） k-γ with y = 1. It means the network model has a power-law distribution. Through calculating the clustering coefficients and average path length （APL）, the result reflects that the model has the properties of high clustering coefficients and low APL.

Stability Analysis of Nonsymmetric Cellular Neural Networks

This paper describes the problem of stability for one-dimensional Cellular Neural Networks（CNNs）. A sufficient condition is presented to ensure complete stability for a class of special CNN＇s with nonsymmetric templates, where the parameter in the output function is greater than or equal to zero. The main method is analysising the property of the equilibrium point of the CNNs system.

Three vertex degree correlations of fixed act-size collaboration networks

A rate equation approach was presented for the exact computation of the three vertex degree correlations of the fixed act-size collaboration networks.Measurements of the three vertex degree correlations were based on a rate equation in the continuous degree and time approximation for the average degree of the nearest neighbors of vertices of degree k,with an appropriate boundary condition.The rate equation proposed can be generalized in more sophisticated growing network models,and also extended to deal with related correlation measurements.Finally,in order to check the theoretical prediction,a numerical example was solved to demonstrate the performance of the degree correlation function.

MPLPK:A mobile path localization protocol based on key nodes

To alleviate the localization error introduced by irregular sensor network deployment, a new mo bile path localization based on key nodes （MPLPK） protocol is proposed. It can recognize all con cave/convex nodes in the network as fixed anchor nodes, and simplify the following localization process based on these key nodes. The MPLPK protocol is composed of three steps. After all key nodes are found in the network, a mobile node applying improved minimum spanning tree （MST） algorithm is introduced to traverse and locate them. By taking the concave/convex nodes as anchors, the complexity of the irregular network can be degraded. And the simulation results demonstrate that MPEPK has 20% to 40% accuracy improvements than connectivity-based and anchor-free three-di- mensional localization （CATL） and approximate convex decomposition based localization （ACDL）.

An efficient range-free localization algorithm for wireless sensor networks

Node positioning is a fundamental problem in applications of wireless sensor networks (WSNs). In this paper, a new range-free algorithm, called spring swarm localization algorithm (SSLA), is proposed for positioning WSNs. To determine the locations of sensor nodes, the proposed algorithm uses network topology information and a small fraction of sensor nodes which know their locations. Numerical simulations show that high positioning accuracy can be obtained by using the algorithm. Some examples are given to illustrate the effectiveness of the algorithm.

CLUSTER SYNCHRONIZATION IN A COMPLEX DYNAMICAL NETWORK WITH TWO NONIDENTICAL CLUSTERS

This paper further investigates cluster synchronization in a complex dynamical network with two-cluster.Each cluster contains a number of identical dynamical systems,however,the sub- systems composing the two clusters can be different,i.e.,the individual dynamical system in one cluster can differ from that in the other cluster.Complete synchronization within each cluster is possible only if each node from one cluster receives the same input from nodes in other cluster.In this case,the stability condition of one-cluster synchronization is known to contain two terms:the first accounts for the contribution of the inner-cluster coupling structure while the second is simply an extra linear term,which can be deduced by the'same-input'condition.Applying the connection graph stability method,the authors obtain an upper bound of input strength for one cluster if the first account is known,by which the synchronizability of cluster can be scaled.For different clusters,there are different upper bound of input strength by virtue of different dynamics and the corresponding cluster structure.Moreover,two illustrative examples are presented and the numerical simulations coincide with the theoretical analysis.

An easy-to-use site-directed mutagenesis method with a designed restriction site for convenient and reliable mutant screening

Site-directed mutagenesis (SDM) has been a very important method to probe the function-structure relationship of proteins. In this study, we introduced an easy-to-use, polymerase chain reaction (PCR)-based SDM method for double-stranded plasmid DNA, with a designed restriction site to ensure simple and efficient mutant screening. The DNA sequence to be mutated was first translated into amino acid sequence and then the amino acid sequence was reversely translated into DNA sequence with degenerate codons, resulting in a large number of sequences with silent mutations, which contained various restriction endonu-clease (RE) sites. Certain mutated sequence with an appropriate RE site was selected as the target DNA sequence for designing a pair of mutation primers to amplify the full-length plasmid via inverse PCR. The amplified product was 5′-phosphorylated, cir-cularized, and transformed into an Escherichia coli host. The transformants were screened by digesting with the designed RE. This protocol uses only one pair of primers and only one PCR is conducted, without the need for hybridization with hazardous isotope for mutant screening or subcloning step.

Photonic quantum network transmission assisted by the weak cross-Kerr nonlinearity

Classical network coding permits all internal nodes to encode or decode the incoming messages over proper fields in order to complete a network multicast. Similar quantum encoding scheme cannot be easily followed because of various quantum no-go theorems. In this paper, to avoid these theorems in quantum multiple-source networks, we present a photonic strategy by exploring quantum transferring approaches assisted by the weak cross-Kerr nonlinearity. The internal node may nearly deterministically fuse all incoming photons into a single photon with multiple modes. The fused single photon may be transmitted using twophotonic hyperentanglement as a quantum resource. The quantum splitting as the inverse operation of the quantum fusion allows forwarding quantum states under the quantum no-cloning theorem. Furthermore, quantum addressing schemes are presented to complete the quantum transmissions on multiple-source networks going beyond the classical network broadcasts or quantum n-pair transmissions in terms of their reduced forms.

Improved Algorithm for Distributed Localization in Wireless Sensor Networks

Many sensor network applications require location awareness,but it is often too expensive to equip a global positioning system(GPS) receiver for each network node.Hence,localization schemes for sensor networks typically use a small number of seed nodes that know their locations and protocols whereby other nodes estimate their locations from the messages they receive.For the inherent shortcomings of general particle filter(the sequential Monte Carlo method) this paper introduces particle swarm optimization and weighted centroid algorithm to optimize it.Based on improvement a distributed localization algorithm named WC-IPF(weighted centroid algorithm improved particle filter) has been proposed for localization.In this localization scheme the initial estimate position can be acquired by weighted centroid algorithm.Then the accurate position can be gotten via improved particle filter recursively.The extend simulation results show that the proposed algorithm is efficient for most condition.

EXPONENTIALLY ADAPTIVE SYNCHRONIZATION OF AN UNCERTAIN DELAYED DYNAMICAL NETWORK

Over the past decades, complex networks have been prosperous greatly in various fields of sciences and engineering. Much attention has been given to investigate the synchronization of complex networks in recent years. However, few work has done for the networks with uncertain parameters and unknown topology. In this paper, to further reveal the dynamical mechanism in complex networks with time delays, an uncertain general complex dynamical network with delayed nodes is studied. By constructing a drive network and a suitable slave network, several novel criteria for the networks consisting of the identical nodes and different nodes have been obtained based on the adaptive feedback method. Particularly, the hypotheses and the proposed adaptive laws for network synchronization are simple and can be readily applied in practical applications. Finally, numerical simulations are provided to illustrate the effectiveness of the proposed synchronization criteria.