The Immense Impact of Reverse Edges on Large Hierarchical Networks

Hierarchical networks are frequently encountered in animal groups,gene networks,and artificial engineering systems such as multiple robots,unmanned vehicle systems,smart grids,wind farm networks,and so forth.The structure of a large directed hierarchical network is often strongly influenced by reverse edges from lower-to higher-level nodes,such as lagging birds’howl in a flock or the opinions of lowerlevel individuals feeding back to higher-level ones in a social group.This study reveals that,for most large-scale real hierarchical networks,the majority of the reverse edges do not affect the synchronization process of the entire network;the synchronization process is influenced only by a small part of these reverse edges along specific paths.More surprisingly,a single effective reverse edge can slow down the synchronization of a huge hierarchical network by over 60%.The effect of such edges depends not on the network size but only on the average in-degree of the involved subnetwork.The overwhelming majority of active reverse edges turn out to have some kind of“bunching”effect on the information flows of hierarchical networks,which slows down synchronization processes.This finding refines the current understanding of the role of reverse edges in many natural,social,and engineering hierarchical networks,which might be beneficial for precisely tuning the synchronization rhythms of these networks.Our study also proposes an effective way to attack a hierarchical network by adding a malicious reverse edge to it and provides some guidance for protecting a network by screening out the specific small proportion of vulnerable nodes.

Gated Neural Network-Based Unsteady Aerodynamic Modeling for Large Angles of Attack

Modeling of unsteady aerodynamic loads at high angles of attack using a small amount of experimental or simulation data to construct predictive models for unknown states can greatly improve the efficiency of aircraft unsteady aerodynamic design and flight dynamics analysis.In this paper,aiming at the problems of poor generalization of traditional aerodynamic models and intelligent models,an intelligent aerodynamic modeling method based on gated neural units is proposed.The time memory characteristics of the gated neural unit is fully utilized,thus the nonlinear flow field characterization ability of the learning and training process is enhanced,and the generalization ability of the whole prediction model is improved.The prediction and verification of the model are carried out under the maneuvering flight condition of NACA0015 airfoil.The results show that the model has good adaptability.In the interpolation prediction,the maximum prediction error of the lift and drag coefficients and the moment coefficient does not exceed 10%,which can basically represent the variation characteristics of the entire flow field.In the construction of extrapolation models,the training model based on the strong nonlinear data has good accuracy for weak nonlinear prediction.Furthermore,the error is larger,even exceeding 20%,which indicates that the extrapolation and generalization capabilities need to be further optimized by integrating physical models.Compared with the conventional state space equation model,the proposed method can improve the extrapolation accuracy and efficiency by 78%and 60%,respectively,which demonstrates the applied potential of this method in aerodynamic modeling.

Calculating real-time surface deformation for large active surface radio antennas using a graph neural network

This paper presents an innovative surrogate modeling method using a graph neural network to compensate for gravitational and thermal deformation in large radio telescopes.Traditionally,rapid compensation is feasible for gravitational deformation but not for temperature-induced deformation.The introduction of this method facilitates real-time calculation of deformation caused both by gravity and temperature.Constructing the surrogate model involves two key steps.First,the gravitational and thermal loads are encoded,which facilitates more efficient learning for the neural network.This is followed by employing a graph neural network as an end-to-end model.This model effectively maps external loads to deformation while preserving the spatial correlations between nodes.Simulation results affirm that the proposed method can successfully estimate the surface deformation of the main reflector in real-time and can deliver results that are practically indistinguishable from those obtained using finite element analysis.We also compare the proposed surrogate model method with the out-of-focus holography method and yield similar results.

Fully invertible hyperbolic neural networks for segmenting large-scale surface and sub-surface data

The large spatial/temporal/frequency scale of geoscience and remote-sensing datasets causes memory issues when using convolutional neural networks for(sub-)surface data segmentation.Recently developed fully reversible or fully invertible networks can mostly avoid memory limitations by recomputing the states during the backward pass through the network.This results in a low and fixed memory requirement for storing network states,as opposed to the typical linear memory growth with network depth.This work focuses on a fully invertible network based on the telegraph equation.While reversibility saves the major amount of memory used in deep networks by the data,the convolutional kernels can take up most memory if fully invertible networks contain multiple invertible pooling/coarsening layers.We address the explosion of the number of convolutional kernels by combining fully invertible networks with layers that contain the convolutional kernels in a compressed form directly.A second challenge is that invertible networks output a tensor the same size as its input.This property prevents the straightforward application of invertible networks to applications that map between different input-output dimensions,need to map to outputs with more channels than present in the input data,or desire outputs that decrease/increase the resolution compared to the input data.However,we show that by employing invertible networks in a non-standard fashion,we can still use them for these tasks.Examples in hyperspectral land-use classification,airborne geophysical surveying,and seismic imaging illustrate that we can input large data volumes in one chunk and do not need to work on small patches,use dimensionality reduction,or employ methods that classify a patch to a single central pixel.

Load Reduction Test Method of Similarity Theory and BP Neural Networks of Large Cranes

Static load tests are an important means of supervising and detecting a crane＇s lift capacity. Due to space restrictions, however, there are difficulties and potential danger when testing large bridge cranes. To solve the loading problems of large-tonnage cranes during testing, an equivalency test is proposed based on the similarity theory and BP neural networks. The maximum stress and displacement of a large bridge crane is tested in small loads, combined with the training neural network of a similar structure crane through stress and displacement data which is collected by a physics simulation progressively loaded to a static load test load within the material scope of work. The maximum stress and displacement of a crane under a static load test load can be predicted through the relationship of stress, displacement, and load. By measuring the stress and displacement of small tonnage weights, the stress and displacement of large loads can be predicted, such as the maximum load capacity, which is 1.25 times the rated capacity. Experimental study shows that the load reduction test method can reflect the lift capacity of large bridge cranes. The load shedding predictive analysis for Sanxia 1200 t bridge crane test data indicates that when the load is 1.25 times the rated lifting capacity, the predicted displacement and actual displacement error is zero. The method solves the problem that lifting capacities are difficult to obtain and testing accidents are easily possible when 1.25 times related weight loads are tested for large tonnage cranes.

Regularity analysis of resilient modulus for hot-mix asphalt with large temperature fluctuations

To evaluate the regularity of resilient modulus for hot-mix asphalt(HMA) under large temperature fluctuations,back propagation(BP) neural network technology was used to analyze the continuous change of HMA resilient modulus.Firstly,based on the abundant data,the training model of HMA resilient modulus was established by using BP neural network technology.Subsequently,BP neural network prediction and regression analysis were performed,and the prediction model of HMA resilient modulus at different temperatures(-50℃ to 60℃) was obtained,which fully considered multi-factor and nonlinearity.Finally,the fitted theoretical model can be used to evaluate the HMA performance under the condition of large temperature fluctuations,and the rationality of theoretical model was verified by taking Harbin region as an example.It was found that the relationship between HMA resilient modulus and temperatures can be described by inverse tangent function.And the key parameters of theoretical model can be used to evaluate the continuous change characteristics of HMA resilient modulus with large temperature fluctuations.The results can further improve the HMA performance evaluation system and have certain theoretical value.

Performance Analysis for Large Intelligent Surface Assisted Vehicular Networks

Large intelligent surface(LIS)is considered as a new solution to enhance the performance of wireless networks[1].LIS comprises low-cost passive elements which can be well controlled.In this paper,a LIS is invoked in the vehicular networks.We analyze the system performance under Weibull fading.We derive a novel exact analytical expression for outage probability in closed form.Based on the analytical result,we discuss three special scenarios including high SNR case,low SNR case,as well as weak interference case.The corresponding approximations for three cases are provided,respectively.In order to gain more insights,we obtain the diversity order of outage probability and it is proved that the outage probability at high SNR depends on the interference,threshold and fading parameters which leads to 0 diversity order.Furthermore,we investigate the ergodic achievable rate of LIS-assisted vehicular networks and present the closed-form tight bounds.Similar to the outage performance,three special cases are studied and the asymptotic expressions are provided in simple forms.A rate ceiling is shown for high SNRs due to the existence of interference which results 0 high SNR slope.Finally,we give the energy efficiency of LIS-assisted vehicular network.Numerical results are presented to verify the accuracy of our analysis.It is evident that the performance of LIS-assisted vehicular networks with optimal phase shift scheme exceeds that of traditional vehicular networks and random phase Received:Aug.6,2020 Revised:Nov.17,2020 Editor:Caijun Zhong shift scheme significantly.

Risk Management of Clinical Reference Dosimetry of a Large Hospital Network Using Statistical Process Control

Managing TG-51 reference dosimetry in a large hospital network can be a challenging task. The objectives of this study are to investigate the effectiveness of using Statistical Process Control (SPC) to manage TG-51 workflow in such a network. All the sites in the network performed the annual reference dosimetry in water according to TG-51. These data were used to cross-calibrate the same ion chambers in plastic phantoms for monthly QA output measurements. An energy-specific dimensionless beam quality cross-calibration factor, , was derived to monitor the process across multiple sites. The SPC analysis was then performed to obtain the mean, , standard deviation, σk, the Upper Control Limit (UCL) and Lower Control Limit (LCL) in each beam. This process was first applied to 15 years of historical data at the main campus to assess the effectiveness of the process. A two-year prospective study including all 30 linear accelerators spread over the main campus and seven satellites in the network followed. The ranges of the control limits (±3σ) were found to be in the range of 1.7% - 2.6% and 3.3% - 4.2% for the main campus and the satellite sites respectively. The wider range in the satellite sites was attributed to variations in the workflow. Standardization of workflow was also found to be effective in narrowing the control limits. The SPC is effective in identifying variations in the workflow and was shown to be an effective tool in managing large network reference dosimetry.

Quantitative algorithm for airborne gamma spectrum of large sample based on improved shuffled frog leaping-particle swarm optimization convolutional neural network

In airborne gamma ray spectrum processing,different analysis methods,technical requirements,analysis models,and calculation methods need to be established.To meet the engineering practice requirements of airborne gamma-ray measurements and improve computational efficiency,an improved shuffled frog leaping algorithm-particle swarm optimization convolutional neural network(SFLA-PSO CNN)for large-sample quantitative analysis of airborne gamma-ray spectra is proposed herein.This method was used to train the weight of the neural network,optimize the structure of the network,delete redundant connections,and enable the neural network to acquire the capability of quantitative spectrum processing.In full-spectrum data processing,this method can perform the functions of energy spectrum peak searching and peak area calculations.After network training,the mean SNR and RMSE of the spectral lines were 31.27 and 2.75,respectively,satisfying the demand for noise reduction.To test the processing ability of the algorithm in large samples of airborne gamma spectra,this study considered the measured data from the Saihangaobi survey area as an example to conduct data spectral analysis.The results show that calculation of the single-peak area takes only 0.13~0.15 ms,and the average relative errors of the peak area in the U,Th,and K spectra are 3.11,9.50,and 6.18%,indicating the high processing efficiency and accuracy of this algorithm.The performance of the model can be further improved by optimizing related parameters,but it can already meet the requirements of practical engineering measurement.This study provides a new idea for the full-spectrum processing of airborne gamma rays.

Network Biological Modeling:A Novel Approach to Interpret the Traditional Chinese Medicine Theory of Exterior-Interior Correlation Between the Lung and Large Intestine

Objective To study the common pathogenesis of pneumonia and colitis using modern biological network analysis tools,and to explore the theory that the lung and large intestine are exteriorly and interiorly related.Methods The relevant target genes(hereinafter,“targets”)of pneumonia and colitis were separately queried on the GeneCards database.The main targets of the two diseases were then screened out according to their correlation scores and intersected to obtain those common to the two diseases.Metascape was used to analyze the main and common targets identified,and the Database for Annotation,Visualization and Integrated Discovery(DAVID)was used to enrich and analyze the common targets.Cytoscape 3.7.2 software was used to build the network diagram.Results In total,54 targets,such as TNF,IL-10,IL-6,IL-2,IL-4,TLR4,TLR2,CXCL8,IL-17A and IFNG,etc.,are common to pneumonia and colitis,which are mainly enriched in these processes such as cytokine–cytokine receptor interaction,the Tcell receptor signaling pathway,the Toll-like receptor signaling pathway and the Jak-STAT signaling pathway.The Metascape modular analysis identified 11 modules for pneumonia,six modules for colitis,and two modules for the common targets.Conclusions Pneumonia and colitis have the same pathogenic targets and mechanisms of action and finally interact with each other through inflammatory reactions and immune responses.This provides a probable molecular mechanism that explains the theory that the lung and large intestine are exteriorly and interiorly related.

Long Short-Term Memory Recurrent Neural Network-Based Acoustic Model Using Connectionist Temporal Classification on a Large-Scale Training Corpus

A Long Short-Term Memory(LSTM) Recurrent Neural Network(RNN) has driven tremendous improvements on an acoustic model based on Gaussian Mixture Model(GMM). However, these models based on a hybrid method require a forced aligned Hidden Markov Model(HMM) state sequence obtained from the GMM-based acoustic model. Therefore, it requires a long computation time for training both the GMM-based acoustic model and a deep learning-based acoustic model. In order to solve this problem, an acoustic model using CTC algorithm is proposed. CTC algorithm does not require the GMM-based acoustic model because it does not use the forced aligned HMM state sequence. However, previous works on a LSTM RNN-based acoustic model using CTC used a small-scale training corpus. In this paper, the LSTM RNN-based acoustic model using CTC is trained on a large-scale training corpus and its performance is evaluated. The implemented acoustic model has a performance of 6.18% and 15.01% in terms of Word Error Rate(WER) for clean speech and noisy speech, respectively. This is similar to a performance of the acoustic model based on the hybrid method.

Sewage flow optimization algorithm for large-scale urban sewer networks based on network community division

By considering the flow control of urban sewer networks to minimize the electricity consumption of pumping stations, a decomposition-coordination strategy for energy savings based on network community division is developed in this paper. A mathematical model characterizing the steady-state flow of urban sewer networks is first constructed, consisting of a set of algebraic equations with the structure transportation capacities captured as constraints. Since the sewer networks have no apparent natural hierarchical structure in general, it is very difficult to identify the clustered groups. A fast network division approach through calculating the betweenness of each edge is successfully applied to identify the groups and a sewer network with arbitrary configuration could be then decomposed into subnetworks. By integrating the coupling constraints of the subnetworks, the original problem is separated into N optimization subproblems in accordance with the network decomposition. Each subproblem is solved locally and the solutions to the subproblems are coordinated to form an appropriate global solution. Finally, an application to a specified large-scale sewer network is also investigated to demonstrate the validity of the proposed algorithm.

A Fast Method for Shortest-Path Cover Identification in Large Complex Networks

Fast identifying the amount of information that can be gained by measuring a network via shortest-paths is one of the fundamental problem for networks exploration and monitoring.However,the existing methods are time-consuming for even moderate-scale networks.In this paper,we present a method for fast shortest-path cover identification in both exact and approximate scenarios based on the relationship between the identification and the shortest distance queries.The effectiveness of the proposed method is validated through synthetic and real-world networks.The experimental results show that our method is 105 times faster than the existing methods and can solve the shortest-path cover identification in a few seconds for large-scale networks with millions of nodes and edges.

AN IDENTITY-BASED KEY AGREEMENT SCHEME FOR LARGE SCALE SENSOR NETWORKS

To solve the problems of high memory occupation, low connectivity and poor resiliency against node capture, which existing in the random key pre-distribution techniques while applying to the large scale Wireless Sensor Networks （WSNs）, an Identity-Based Key Agreement Scheme （IBKAS） is proposed based on identity-based encryption and Elliptic Curve Diffie-Hellman （ECDH）. IBKAS can resist man-in-the-middle attacks and node-capture attacks through encrypting the key agreement parameters using identity-based encryption. Theoretical analysis indicates that comparing to the random key pre-distribution techniques, IBKAS achieves significant improvement in key connectivity, communication overhead, memory occupation, and security strength, and also enables efficient secure rekcying and network expansion. Furthermore, we implement IBKAS for TinyOS-2.1.2 based on the MICA2 motes, and the experiment results demonstrate that IBKAS is feasible for infrequent key distribution and rekeying for large scale sensor networks.

Spanning tree-based algorithm for hydraulic simulation of large-scale water supply networks

With the purpose of making calculation more efficient in practical hydraulic simulations, an improved algorithm was proposed and was applied in the practical water distribution field. This methodology was developed by expanding the traditional loop-equation theory through utilization of the advantages of the graph theory in efficiency. The utilization of the spanning tree technique from graph theory makes the proposed algorithm efficient in calculation and simple to use for computer coding. The algorithms for topological generation and practical implementations are presented in detail in this paper. Through the application to a practical urban system, the consumption of the CPU time and computation memory were decreased while the accuracy was greatly enhanced compared with the present existing methods.

MULTITASK SCHEDULING IN NETWORKED CONTROL SYSTEMS WITH APPLICATION TO LARGE SCALE VEHICLE CONTROL

Aiming at scheduling problems of networked control system （NCS） used to fulfill motion synthesis and cooperation control of the distributed multi-mechatronic systems, the differences of network scheduling and task scheduling are compared, and the mathematic description of task scheduling is presented. A performance index function of task scheduling of NCS according to task balance and traffic load matching principles is defined. According to this index, a static scheduling method is designed and implemented to controlling task set simulation of the DCY100 transportation vehicle. The simulation results are applied successfully to practical engineering in this case so as to validate the effectiveness of the proposed performance index and scheduling algorithm.

Adaptive Learning with Large Variability of Teaching Signals for Neural Networks and Its Application to Motion Control of an Industrial Robot

Recently, various control methods represented by proportional-integral-derivative （PID） control are used for robotic control. To cope with the requirements for high response and precision, advanced feedforward controllers such as gravity compensator, Coriolis/centrifugal force compensator and friction compensators have been built in the controller. Generally, it causes heavy computational load when calculating the compensating value within a short sampling period. In this paper, integrated recurrent neural networks are applied as a feedforward controller for PUMA560 manipulator. The feedforward controller works instead of gravity and Coriolis/centrifugal force compensators. In the learning process of the neural network by using back propagation algorithm, the learning coefficient and gain of sigmoid function are tuned intuitively and empirically according to teaching signals. The tuning is complicated because it is being conducted by trial and error. Especially, when the scale of teaching signal is large, the problem becomes crucial. To cope with the problem which concerns the learning performance, a simple and adaptive learning technique for large scale teaching signals is proposed. The learning techniques and control effectiveness are evaluated through simulations using the dynamic model of PUMA560 manipulator.

Estimation of Data Transfer Routes Fractal Dimension in Large Scale Networks

The article is devoted to the evaluation of fractal properties of routing data in computer large scale networks. Implemented the study of percolation network topological structures of large dimension and made their transformation into fractal macrostructure. An example of calculating the fractal dimension of the data path for the boundary of the phase transition between the states of network connectivity. The dependence of the fractal dimension of the percolation cluster on the size of the square δ-cover and conductivity value network of large dimension. It is shown that for the value of the fractal dimension of the route dc ≈ 1.5, network has a stable dynamics of development and size of clusters are optimized with respect to the current load on the network.

Intelligent Networking Technology and Experimental Demonstration of Large-Scale Heterogeneous Optical Networks

A novel routing architecture named DREAMSCAPE is presented to solve the problem of path computation in multi-layer, multi-domain and multi-constraints scenarios, which includes Group Engine (GE) and Unit Engine (UE). GE, UE and their cooperation relationship form the main feature of DREAMSCAPE, i.e. Dual Routing Engine (DRE). Based on DRE, two routing schemes are proposed, which are DRE Forward Path Computation (DRE-FPC) and Hierarchical DRE Backward Recursive PCE-based Computation (HDRE-BRPC). In order to validate various intelligent networking technologies of large-scale heterogeneous optical networks, a DRE-based transport optical networks testbed is built with 1000 GMPLS-based control nodes and 5 optical transport nodes. The two proposed routing schemes, i.e. DRE-FPC and HDRE-BRPC, are validated on the testbed, compared with traditional Hierarchical Routing (HR) scheme. Experimental results show a good performance of DREAMSCAPE.

A Summary of the Large-Scale Access Convergence Network Structure

Under the requirement of everything over IP, network service shows the following characteristics:(1) network service increases its richness;(2) broadband streaming media becomes the mainstream. To achieve unified multi-service bearing in the IP network, the largescale access convergence network architecture is proposed. This flat access convergence structure with ultra-small hops, which shortens the service transmission path, reduces the complexity of the edge of the network, and achieves IP strong waist model with the integration of computation, storage and transmission. The key technologies are also introduced in this paper, including endto-end performance guarantee for real time interactive services, fog storing mechanism, and built-in safety transmission with integration of aggregation and control.