North Electronic Systems Engineering Corporation

Beijing, China

North Electronic Systems Engineering Corporation

Beijing, China

Time filter

Source Type

Li C.-H.,China Earthquake Administration | Guo S.-Z.,North Electronic Systems Engineering Corporation | Lu Z.-M.,Zhejiang University | Kang G.-Y.,North Electronic Systems Engineering Corporation
ICIC Express Letters | Year: 2011

Eigenvector centrality is one of commonly-used measures to characterize the importance of a node in a complex network. It assigns relative scores to all nodes in the network based on the criterion that links to high score nodes contribute more to the score of the node under discussion than equal links to low score nodes. One of the drawbacks of the eigenvector centrality is that its time complexity is somewhat high. This paper proposes an approximate method to calculate the eigenvector centrality with low complexity and provides experimental results as evidence. © 2011 ICIC International.


Guo S.-Z.,North Electronic Systems Engineering Corporation | Lu Z.-M.,Zhejiang University | Chen Z.,North Electronic Systems Engineering Corporation | Luo H.,Zhejiang University
IEICE Transactions on Information and Systems | Year: 2011

This Letter defines thirteen useful correlation measures for directed weighted complex network analysis. First, in-strength and out-strength are defined for each node in the directed weighted network. Then, one node-based strength-strength correlation measure and four arcbased strength-strength correlation measures are defined. In addition, considering that each node is associated with in-degree, out-degree, in-strength and out-strength, four node-based strength-degree correlation measures and four arc-based strength-degree correlation measures are defined. Finally, we use these measures to analyze the world trade network and the food web. The results demonstrate the effectiveness of the proposed measures for directed weighted networks. Copyright © 2011 The Institute of Electronics, Information and Communication Engineers.


Kang G.-Y.,North Electronic Systems Engineering Corporation | Li X.-F.,Zhejiang University | Lu Z.-M.,Zhejiang University | Su Y.-X.,Zhejiang University
Proceedings of the 2012 2nd International Conference on Instrumentation and Measurement, Computer, Communication and Control, IMCCC 2012 | Year: 2012

This paper first examines the synchronizability of the tree-structured deterministic small-world network(TSDSWN), the testing results show that it has a poor synchronizability. To improve the synchronizability, we consider using the modified simulated annealing(MSA) algorithm to optimize TSDSWN. At last, to check if the network after MSA optimization is still a kind of small-world network. We calculate its three main features that are necessary for small-world networks. © 2012 IEEE.


Guo S.-Z.,North Electronic Systems Engineering Corporation | Lu Z.-M.,Zhejiang University | Kang G.-Y.,North Electronic Systems Engineering Corporation
ICIC Express Letters, Part B: Applications | Year: 2011

This letter defines seven useful measures for directed complex network analysis. Since each node in the directed network is with an in-degree and an out-degree, and each arc is directed, one node-based in-out degree correlation measure and four arcbased degree-degree correlation measures (i.e., in-in, in-out, out-in, out-out) are defined. Similarly, two clustering coefficient measures are defined for the directed network, i.e., in-clustering coefficient and out-clustering coefficient. Finally, we use these measures to analysis the world trade network. © 2011 ISSN 2185-2766.


Huang Z.-L.,Zhejiang University | Guo S.-Z.,North Electronic Systems Engineering Corporation | Lu Z.-M.,Zhejiang University
Information Technology Journal | Year: 2012

This study presents to construct special networks from images and then apply their topological properties to image retrieval. Each input color image is divided into three separate gray-level images in the RGB space. For each gray-level image, we view the 256 gray-levels as nodes and construct the Horizontal Gray-level Co-occurrence Network (HGCN) and Vertical Gray-level Co-occurrence Network (VGCN) by counting the number of horizontal and vertical occurrences for each possible gray-level pair. Based on the obtained six directed weighted networks HGCN-R/G/B and VGCN-R/G/B, we extract their topological features including in-degrees, out-degrees, in-strengths and out-strengths for image retrieval. Simulation results demonstrate the superiority of our features to some existing features in terms of P-R curve. © 2012 Asian Network for Scientific Information.


Lu Z.-M.,Zhejiang University | Su Y.-X.,Zhejiang University | Guo S.-Z.,North Electronic Systems Engineering Corporation
Physica A: Statistical Mechanics and its Applications | Year: 2013

In many real-life networks, both the scale-free distribution of degree and small-world behavior are important features. There are many random or deterministic models of networks to simulate these features separately. However, there are few models that combine the scale-free effect and small-world behavior, especially in terms of deterministic versions. What is more, all the existing deterministic algorithms running in the iterative mode generate networks with only several discrete numbers of nodes. This contradicts the purpose of creating a deterministic network model on which we can simulate some dynamical processes as widely as possible. According to these facts, this paper proposes a deterministic network generation algorithm, which can not only generate deterministic networks following a scale-free distribution of degree and small-world behavior, but also produce networks with arbitrary number of nodes. Our scheme is based on a complete binary tree, and each newly generated leaf node is further linked to its full brother and one of its direct ancestors. Analytical computation and simulation results show that the average degree of such a proposed network is less than 5, the average clustering coefficient is high (larger than 0.5, even for a network of size 2 million) and the average shortest path length increases much more slowly than logarithmic growth for the majority of small-world network models. © 2013 Elsevier B.V. All rights reserved.


Guo S.-Z.,North Electronic Systems Engineering Corporation | Lu Z.-M.,Zhejiang University | Kang G.-Y.,North Electronic Systems Engineering Corporation | Chen Z.,North Electronic Systems Engineering Corporation | Luo H.,Zhejiang University
IEICE Transactions on Information and Systems | Year: 2012

Small-world is a common property existing in many reallife social, technological and biological networks. Small-world networks distinguish themselves from others by their high clustering coefficient and short average path length. In the past dozen years, many probabilistic small-world networks and some deterministic small-world networks have been proposed utilizing various mechanisms. In this Letter, we propose a new deterministic small-world network model by first constructing a binary-tree structure and then adding links between each pair of brother nodes and links between each grandfather node and its four grandson nodes. Furthermore, we give the analytic solutions to several topological characteristics, which shows that the proposed model is a small-world network. Copyright © 2012 The Institute of Electronics, Information and Communication Engineers.


Liu J.-R.,Zhejiang University | Guo S.-Z.,North Electronic Systems Engineering Corporation | Lu Z.-M.,Zhejiang University | Yu F.-X.,Zhejiang University | Li H.,Zhejiang University
IEICE Transactions on Information and Systems | Year: 2013

In complex network analysis, there are various measures to characterize the centrality of each node within a graph, which determines the relative importance of each node. The more centrality a node has in a network, the more significance it has in the spread of infection. As one of the important extensions to shortest-path based betweenness centrality, the flow betweenness centrality is defined as the degree to which each node contributes to the sum of maximum flows between all pairs of nodes. One of the drawbacks of the flow betweenness centrality is that its time complexity is somewhat high. This Letter proposes an approximate method to calculate the flow betweenness centrality and provides experimental results as evidence. Copyright © 2013 The Institute of Electronics, Information and Communication Engineers.


Zhang Y.,National University of Defense Technology | Guo S.-Z.,North Electronic Systems Engineering Corporation | Lu Z.-M.,Zhejiang University | Luo H.,North Electronic Systems Engineering Corporation
IEICE Transactions on Communications | Year: 2013

Reversible data hiding has been a hot research topic since both the host media and hidden data can be recovered without distortion. In the past several years, more and more attention has been paid to reversible data hiding schemes for images in compressed formats such as JPEG, JPEG2000, Vector Quantization (VQ) and Block Truncation Coding (BTC). Traditional data hiding schemes in the BTC domain modify the BTC encoding stage or BTC-compressed data according to the secret bits, and they have no ability to reduce the bit rate but may reduce the image quality. This paper presents a novel reversible data hiding scheme for BTCcompressed images by further losslessly encoding the BTC-compressed data according to the secret bits. First, the original BTC technique is performed on the original image to obtain the BTC-compressed data which can be represented by a high mean table, a low mean table and a bitplane sequence. Then, the proposed reversible data hiding scheme is performed on both the high mean table and low mean table. Our hiding scheme is a lossless joint hiding and compression method based on 2 × 2 blocks in mean tables, thus it can not only hide data in mean tables but also reduce the bit rate. Experiments show that our scheme outperforms three existing BTC-based data hiding works, in terms of the bit rate, capacity and efficiency. Copyright © 2013 The Institute of Electronics, Information and Communication Engineers.


Lu Z.-M.,Zhejiang University | Guo S.-Z.,North Electronic Systems Engineering Corporation
Physica A: Statistical Mechanics and its Applications | Year: 2012

As the deterministic version of the uniform recursive tree (URT), the deterministic uniform recursive tree (DURT) has been intensively studied by Zhang et al. (2008) [21]. They gave several important properties of DURT, including its topological characteristics and spectral properties. Although DURT shows a logarithmic scaling with the size of the network, DURT is not a small-world network since its clustering coefficient is zero. In this paper, we propose a new deterministic small-world network by adding some edges with a simple rule in each DURT iteration, and then give the analytic solutions to several topological characteristics of the model proposed. © 2011 Elsevier B.V. All rights reserved.

Loading North Electronic Systems Engineering Corporation collaborators
Loading North Electronic Systems Engineering Corporation collaborators