梯形网络等效电阻的网络分析

基于A参数，利用网络分析法，得到了梯形网络等效电阻的一般表达式，并将结果与相关讨论进行了比较。     

Photonic network laser

We demonstrated lasing in two-dimensional trivalent network structures with short-range order. Despite the lack of translational and rotational symmetries, such structures possess a large isotropic photonic bandgap. Different from those of a photonic crystal, the band-edge modes are spatially localized and have high quality factor.     

Quantum neural network

In the neural network theory content-addressable memories are defined by patterns that are attractors of the dynamical rule of the system. This paper develops a quantum neural network starting from a classical neural network Hamiltonian and using a Schrödinger-like equation. It then shows that such a system exhibits probabilistic memory storage characteristics analogous to those of the dynamical attractors of classical systems.     

Sputter-deposited network glasses

Thin films of lithium borate, sodium borate, rubidium borate, and lithium silicate glasses are prepared by ion beam sputter deposition in a thickness range between 70 and 1,400 nm. The chemical, structural, and electrical properties of the films are determined by transmission electron microscopy and impedance spectroscopy. A comparison between the thin glass layers and the corresponding bulk glasses, prepared from the melt, shows that both have similar chemical compositions and atomic short range orders. In contrast, the ionic conductivities of the borate glass films are found to be significantly increased compared to the corresponding bulk materials, while the increase depends on the chemical composition of the glasses and is not observed in the case of the silicate system. We propose a modified network structure of the sputter-deposited glass layers, namely, an increased nonbridging oxygen concentration, to be responsible for the elevated ionic conductivity.     

Analysis of telephone network traffic based on a complex user network

The traffic in telephone networks is analyzed in this paper. Unlike the classical traffic analysis where call blockings are due to the limited channel capacity, we consider here a more realistic cause for call blockings which is due to the way in which users are networked in a real-life human society. Furthermore, two kinds of user network, namely, the fully connected user network and the scale-free network, are employed to model the way in which telephone users are connected. We show that the blocking probability is generally higher in the case of the scale-free user network, and that the carried traffic intensity is practically limited not only by the network capacity but also by the property of the user network.     

Maximum covering planning of survivable Fiber-Wireless access network considering network connectivity

Fiber-Wireless (FiWi) access network is now becoming a promising architecture for access networks. Survivability is one of the key issues in the planning of FiWi access network because many high-rate traffic flows may be interrupted in case of a single fiber failure, which can cause a huge traffic loss. In addition, the users need ubiquitous broadband access that can be provided by FiWi access network. In this paper, we propose the protection approach called Maximum Covering Planning with Survivability (MCPS), including Integer Linear Programming (ILP) solution and heuristic solution, for the planning of survivable FiWi access network against single distribution fiber failure. The proposed approach aims at maximum coverage under the constraints of network connectivity. When a distribution fiber is broken, the interrupted Optical Network Unit (ONU) can transmit traffic to its backup ONU through the wireless paths between them. Simulation results show the network coverage of clients for different number of ONUs in different urban areas, and demonstrate the relationship between network coverage and the cost represented by the number of WiFi routers.     

Feedback between node and network dynamics can produce real-world network properties

Real-world networks are characterized by common features, including among others a scale-free degree distribution, a high clustering coefficient and a short typical distance between nodes. These properties are usually explained by the dynamics of edge and node addition and deletion.     

Analysis of the Chinese air route network as a complex network

The air route network, which supports all the flight activities of the civil aviation, is the most fundamental infrastructure of air traffic management system. In this paper, we study the Chinese air route network (CARN) within the framework of complex networks. We find that CARN is a geographical network possessing exponential degree distribution, low clustering coefficient, large shortest path length and exponential spatial distance distribution that is obviously different from that of the Chinese airport network (CAN). Besides, via investigating the flight data from 2002 to 2010, we demonstrate that the topology structure of CARN is homogeneous, howbeit the distribution of flight flow on CARN is rather heterogeneous. In addition, the traffic on CARN keeps growing in an exponential form and the increasing speed of west China is remarkably larger than that of east China. Our work will be helpful to better understand Chinese air traffic systems.     

Analysis and performance of network decoding strategies for cooperative network coding

In this work, we present two new low-complexity network decoding strategies for cooperative network coding in a multiple-access relay channel scenario. For these two strategies, Selection and Soft Combining and Majority Vote Network Decoding, along with the optimal joint network decoding, we derive expressions for bit error probability performance as a function of the signal-to-noise ratio (SNR) of the different Rayleigh fading links, and show the tightness of the derived bounds through simulation results. The two proposed schemes provide a similar bit error probability (BEP) performance compared to the optimal scheme, while having significantly lower complexity. Further, we study the effect of user pairing on the error performance by considering different SNRs on the user and relay links towards the destination. It is also shown that the error performance of the different schemes follows the same trend for a given user pairing strategy.     

基于Sierpinski分形垫的确定性复杂网络演化模型研究

近年来,人们发现大量真实网络都表现出小世界和无尺度的特性,由此复杂网络演化模型成为学术界研究的热点问题.本文基于Sierpinski分形垫,通过迭代的方式构造了两个确定性增长的复杂网络模型,即小世界网络模型(S-DSWN)和无尺度网络模型(S-DSFN);其次,给出了确定性网络模型的迭代生成算法,解析计算了其主要拓扑特性,结果表明两个网络模型在度分布、集聚系数和网络直径等结构特性方面与许多现实网络相符合;最后,提出了一个确定性的统一模型(S-DUM),将S-DSWN与S-DSFN纳入到一个框架之下,为复杂网络的相关研究提供理论基础.特别地,发现这些网络模型都是极大平面图.     

一种信息传播促进网络增长的网络演化模型

为了研究信息传播过程对复杂网络结构演化的影响,提出了一种信息传播促进网络增长的网络演化模型,模型包括信息传播促进网内增边、新节点通过局域世界建立第一条边和信息传播促进新节点连边三个阶段,通过多次自回避随机游走模拟信息传播过程,节点根据路径节点的节点度和距离与其选择性建立连接。理论分析和仿真实验表明,模型不仅具有小世界和无标度特性,而且不同参数下具有漂移幂律分布、广延指数分布等分布特性,呈现小变量饱和、指数截断等非幂律现象,同时,模型可在不改变度分布的情况下调节集聚系数,并能够产生从同配到异配具有不同匹配模式的网络.     

Chimeras in a network of three oscillator populations with varying network topology

We study a network of three populations of coupled phase oscillators with identical frequencies. The populations interact nonlocally, in the sense that all oscillators are coupled to one another, but more weakly to those in neighboring populations than to those in their own population. Using this system as a model system, we discuss for the first time the influence of network topology on the existence of so-called chimera states. In this context, the network with three populations represents an interesting case because the populations may either be connected as a triangle, or as a chain, thereby representing the simplest discrete network of either a ring or a line segment of oscillator populations. We introduce a special parameter that allows us to study the effect of breaking the triangular network structure, and to vary the network symmetry continuously such that it becomes more and more chain-like. By showing that chimera states only exist for a bounded set of parameter values, we demonstrate that their existence depends strongly on the underlying network structures, and conclude that chimeras exist on networks with a chain-like character.     

Analysis of the airport network of India as a complex weighted network

Transportation infrastructure of a country is one of the most important indicators of its economic growth. Here we study the Airport Network of India (ANI) which represents India’s domestic civil aviation infrastructure as a complex network. We find that ANI, a network of domestic airports connected by air links, is a small-world network characterized by a truncated power-law degree distribution and has a signature of hierarchy. We investigate ANI as a weighted network to explore its various properties and compare them with their topological counterparts. The traffic in ANI, as in the World-wide Airport Network (WAN), is found to be accumulated on interconnected groups of airports and is concentrated between large airports. In contrast to WAN, ANI is found to be having disassortative mixing which is offset by the traffic dynamics. The analysis indicates possible mechanism of formation of a national transportation network, which is different from that on a global scale.     

卷积神经网络在气体泄漏超声识别中的应用

为了克服现有气体泄漏检测方法的不足,提出一种基于卷积神经网络的气体泄漏超声信号识别方法。在设计卷积神经网络网络结构时,通过多次预训练确定网络层数、卷积核数目和尺寸、全连接层神经元数目。同时,选择Inception模块平衡网络宽度和深度,防止过拟合的同时提高网络对尺度的适应性。通过输气管道泄漏实验平台模拟工况中常见的阀门泄漏和垫片泄漏,利用短时傅里叶变换进行时频图表征,在此基础上,建立二分类模型和不同泄漏类型的三分类模型。结果表明,相比二分类模型,不同泄漏类型的三分类模型识别准确率有所降低,添加Inception模块可以有效提高三分类模型的性能。     

Routing strategies in traffic network and phase transition in network traffic flow

The dynamics of information traffic over scale-free networks has been investigated systematically. A series of routing strategies of data packets have been proposed, including the local routing strategy, the next-nearest-neighbour routing strategy, and the mixed routing strategy based on local static and dynamic information. The capacity of the network can be quantified by the phase transition from free flow state to congestion state. The optimal parameter values of each model leading to the highest efficiency of scale-free networked traffic systems have been found. Moreover, we have found hysteretic loop in networked traffic systems with finite packets delivering ability. Such hysteretic loop indicates the existence of the bi-stable state in the traffic dynamics over scale-free networks.      

Enhancing the network synchronizability

The structural and dynamical properties, particularly the small-world effect and scale-free feature, of complex networks have attracted tremendous interest and attention in recent years. This article offers a brief review of one focal issue concerning the structural and dynamical behaviors of complex network synchronization. In the presentation, the notions of synchronization of dynamical systems on networks, stability of dynamical networks, and relationships between network structure and synchronizability, will be first introduced. Then, various technical methods for enhancing the network synchronizability will be discussed, which are roughly divided into two classes: Structural Modification and Coupling-Pattern Regulation, where the former includes three typical methods—dividing hub nodes, shortening average distances, and deleting overload edges, while the latter mainly is a method of strengthening the hub-nodes’ influence on the network.      

An exponential distribution network

A complex network with an exponential distribution p(k)\propto\e^{{-\frac{k}{k_{c}}}}with k _c =3.50±0.02 is introduced and found to have assortative correlation k _i ⁿⁿ =B+qk _i (q>0) from numerical simulation.     

Complex network perspective on structure and function of Staphylococcus aureus metabolic network

With remarkable advances in reconstruction of genome-scale metabolic networks, uncovering complex network structure and function from these networks is becoming one of the most important topics in system biology. This work aims at studying the structure and function of Staphylococcus aureus (S. aureus) metabolic network by complex network methods. We first generated a metabolite graph from the recently reconstructed high-quality S. aureus metabolic network model. Then, based on ‘bow tie’ structure character, we explain and discuss the global structure of S. aureus metabolic network. The functional significance, global structural properties, modularity and centrality analysis of giant strong component in S. aureus metabolic networks are studied.