A Distributed Newton Method for Processing Signals Defined on the Large-Scale Networks

In the graph signal processing(GSP)framework,distributed algorithms are highly desirable in processing signals defined on large-scale networks.However,in most existing distributed algorithms,all nodes homogeneously perform the local computation,which calls for heavy computational and communication costs.Moreover,in many real-world networks,such as those with straggling nodes,the homogeneous manner may result in serious delay or even failure.To this end,we propose active network decomposition algorithms to select non-straggling nodes(normal nodes)that perform the main computation and communication across the network.To accommodate the decomposition in different kinds of networks,two different approaches are developed,one is centralized decomposition that leverages the adjacency of the network and the other is distributed decomposition that employs the indicator message transmission between neighboring nodes,which constitutes the main contribution of this paper.By incorporating the active decomposition scheme,a distributed Newton method is employed to solve the least squares problem in GSP,where the Hessian inverse is approximately evaluated by patching a series of inverses of local Hessian matrices each of which is governed by one normal node.The proposed algorithm inherits the fast convergence of the second-order algorithms while maintains low computational and communication cost.Numerical examples demonstrate the effectiveness of the proposed algorithm.

Energy-Efficient Routing Algorithm Based on Multipath Routing in Large-Scale Networks

A reduction in network energy consumption and the establishment of green networks have become key scientific problems in academic and industrial research.Existing energy efficiency schemes are based on a known traffic matrix,and acquiring a real-time traffic matrix in current complex networks is difficult.Therefore,this research investigates how to reduce network energy consumption without a real-time traffic matrix.In particular,this paper proposes an intra-domain energy-efficient routing scheme based on multipath routing.It analyzes the relationship between routing availability and energy-efficient routing and integrates the two mechanisms to satisfy the requirements of availability and energy efficiency.The main research focus is as follows:(1)A link criticality model is evaluated to quantitatively measure the importance of links in a network.(2)On the basis of the link criticality model,this paper analyzes an energy-efficient routing technology based on multipath routing to achieve the goals of availability and energy efficiency simultaneously.(3)An energy-efficient routing algorithm based on multipath routing in large-scale networks is proposed.(4)The proposed method does not require a real-time traffic matrix in the network and is thus easy to apply in practice.(5)The proposed algorithm is verified in several network topologies.Experimental results show that the algorithm can not only reduce network energy consumption but can also ensure routing availability.

Efficient Routing Protection Algorithm in Large-Scale Networks

With an increasing urgent demand for fast recovery routing mechanisms in large-scale networks,minimizing network disruption caused by network failure has become critical.However,a large number of relevant studies have shown that network failures occur on the Internet inevitably and frequently.The current routing protocols deployed on the Internet adopt the reconvergence mechanism to cope with network failures.During the reconvergence process,the packets may be lost because of inconsistent routing information,which reduces the network’s availability greatly and affects the Internet service provider’s(ISP’s)service quality and reputation seriously.Therefore,improving network availability has become an urgent problem.As such,the Internet Engineering Task Force suggests the use of downstream path criterion(DC)to address all single-link failure scenarios.However,existing methods for implementing DC schemes are time consuming,require a large amount of router CPU resources,and may deteriorate router capability.Thus,the computation overhead introduced by existing DC schemes is significant,especially in large-scale networks.Therefore,this study proposes an efficient intra-domain routing protection algorithm(ERPA)in large-scale networks.Theoretical analysis indicates that the time complexity of ERPA is less than that of constructing a shortest path tree.Experimental results show that ERPA can reduce the computation overhead significantly compared with the existing algorithms while offering the same network availability as DC.

Resilient Control in Large-Scale Networked Cyber-Physical Systems: Guest Editorial

RECENT advances in sensing,communication and computing have open the door to the deployment of largescale networks of sensors and actuators that allow fine-grain monitoring and control of a multitude of physical processes and infrastructures.The appellation used by field experts for these paradigms is Cyber-Physical Systems(CPS)because the dynamics among computers,networking media/resources and physical systems interact in a way that multi-disciplinary technologies(embedded systems,computers,communications and controls)are required to accomplish prescribed missions.Moreover,they are expected to play a significant role in the design and development of future engineering applications such as smart grids,transportation systems,nuclear plants and smart factories.

Virtual network mapping algorithm for large-scale network environment

A major challenge of network virtualization is the virtual network resource allocation problem that deals with efficient mapping of virtual nodes and virtual links onto the substrate network resources. However, the existing algorithms are almost concentrated on the randomly small-scale network topology, which is not suitable for practical large-scale network environments, because more time is spent on traversing SN and VN, resulting in VN requests congestion. To address this problem, virtual network mapping algorithm is proposed for large-scale network based on small-world characteristic of complex network and network coordinate system. Compared our algorithm with algorithm D-ViNE, experimental results show that our algorithm improves the overall performance.

Robust Virtual Network Embedding Based on Component Connectivity in Large-Scale Network

Virtual network embedding problem which is NP-hard is a key issue for implementing software-defined network which is brought about by network virtualization. Compared with other studies which focus on designing heuristic algorithms to reduce the hardness of the NP-hard problem we propose a robust VNE algorithm based on component connectivity in large-scale network. We distinguish the different components and embed VN requests onto them respectively. And k-core is applied to identify different VN topologies so that the VN request can be embedded onto its corresponding component. On the other hand, load balancing is also considered in this paper. It could avoid blocked or bottlenecked area of substrate network. Simulation experiments show that compared with other algorithms in large-scale network, acceptance ratio, average revenue and robustness can be obviously improved by our algorithm and average cost can be reduced. It also shows the relationship between the component connectivity including giant component and small components and the performance metrics.

Distributed Least-Squares Iterative Methods in Large-Scale Networks:A Survey

Many science and engineering applications involve solvinga linear least-squares system formed from some field measurements. In the distributed cyber-physical systems(CPS),each sensor node used for measurement often only knowspartial independent rows of the least-squares system. To solve the least-squares all the measurements must be gathered at a centralized location and then perform the computa-tion. Such data collection and computation are inefficient because of bandwidth and time constraints and sometimes areinfeasible because of data privacy concerns. Iterative methods are natural candidates for solving the aforementionedproblem and there are many studies regarding this. However,most of the proposed solutions are related to centralized/parallel computations while only a few have the potential to beapplied in distributed networks. Thus distributed computations are strongly preferred or demanded in many of the realworld applications, e.g. smart-grid, target tracking, etc. Thispaper surveys the representative iterative methods for distributed least-squares in networks.

A Large-Scale Group Decision Making Model Based on Trust Relationship and Social Network Updating

With the development of big data and social computing,large-scale group decisionmaking(LGDM)is nowmerging with social networks.Using social network analysis(SNA),this study proposes an LGDM consensus model that considers the trust relationship among decisionmakers(DMs).In the process of consensusmeasurement:the social network is constructed according to the social relationship among DMs,and the Louvain method is introduced to classify social networks to form subgroups.In this study,the weights of each decision maker and each subgroup are computed by comprehensive network weights and trust weights.In the process of consensus improvement:A feedback mechanism with four identification and two direction rules is designed to guide the consensus of the improvement process.Based on the trust relationship among DMs,the preferences are modified,and the corresponding social network is updated to accelerate the consensus.Compared with the previous research,the proposedmodel not only allows the subgroups to be reconstructed and updated during the adjustment process,but also improves the accuracy of the adjustment by the feedbackmechanism.Finally,an example analysis is conducted to verify the effectiveness and flexibility of the proposed method.Moreover,compared with previous studies,the superiority of the proposed method in solving the LGDM problem is highlighted.

Large-scale loss-of-function perturbations reveal a comprehensive epigenetic regulatory network in breast cancer

Objective:Epigenetic abnormalities have a critical role in breast cancer by regulating gene expression;however,the intricate interrelationships and key roles of approximately 400 epigenetic regulators in breast cancer remain elusive.It is important to decipher the comprehensive epigenetic regulatory network in breast cancer cells to identify master epigenetic regulators and potential therapeutic targets.Methods:We employed high-throughput sequencing-based high-throughput screening(HTS^(2))to effectively detect changes in the expression of 2,986 genes following the knockdown of 400 epigenetic regulators.Then,bioinformatics analysis tools were used for the resulting gene expression signatures to investigate the epigenetic regulations in breast cancer.Results:Utilizing these gene expression signatures,we classified the epigenetic regulators into five distinct clusters,each characterized by specific functions.We discovered functional similarities between BAZ2B and SETMAR,as well as CLOCK and CBX3.Moreover,we observed that CLOCK functions in a manner opposite to that of HDAC8 in downstream gene regulation.Notably,we constructed an epigenetic regulatory network based on the gene expression signatures,which revealed 8 distinct modules and identified 10 master epigenetic regulators in breast cancer.Conclusions:Our work deciphered the extensive regulation among hundreds of epigenetic regulators.The identification of 10 master epigenetic regulators offers promising therapeutic targets for breast cancer treatment.

Assessment of Wet Season Precipitation in the Central United States by the Regional Climate Simulation of the WRFG Member in NARCCAP and Its Relationship with Large-Scale Circulation Biases

Assessment of past-climate simulations of regional climate models(RCMs)is important for understanding the reliability of RCMs when used to project future regional climate.Here,we assess the performance and discuss possible causes of biases in a WRF-based RCM with a grid spacing of 50 km,named WRFG,from the North American Regional Climate Change Assessment Program(NARCCAP)in simulating wet season precipitation over the Central United States for a period when observational data are available.The RCM reproduces key features of the precipitation distribution characteristics during late spring to early summer,although it tends to underestimate the magnitude of precipitation.This dry bias is partially due to the model’s lack of skill in simulating nocturnal precipitation related to the lack of eastward propagating convective systems in the simulation.Inaccuracy in reproducing large-scale circulation and environmental conditions is another contributing factor.The too weak simulated pressure gradient between the Rocky Mountains and the Gulf of Mexico results in weaker southerly winds in between,leading to a reduction of warm moist air transport from the Gulf to the Central Great Plains.The simulated low-level horizontal convergence fields are less favorable for upward motion than in the NARR and hence,for the development of moist convection as well.Therefore,a careful examination of an RCM’s deficiencies and the identification of the source of errors are important when using the RCM to project precipitation changes in future climate scenarios.

A semantic vector map-based approach for aircraft positioning in GNSS/GPS denied large-scale environment

Accurate positioning is one of the essential requirements for numerous applications of remote sensing data,especially in the event of a noisy or unreliable satellite signal.Toward this end,we present a novel framework for aircraft geo-localization in a large range that only requires a downward-facing monocular camera,an altimeter,a compass,and an open-source Vector Map(VMAP).The algorithm combines the matching and particle filter methods.Shape vector and correlation between two building contour vectors are defined,and a coarse-to-fine building vector matching(CFBVM)method is proposed in the matching stage,for which the original matching results are described by the Gaussian mixture model(GMM).Subsequently,an improved resampling strategy is designed to reduce computing expenses with a huge number of initial particles,and a credibility indicator is designed to avoid location mistakes in the particle filter stage.An experimental evaluation of the approach based on flight data is provided.On a flight at a height of 0.2 km over a flight distance of 2 km,the aircraft is geo-localized in a reference map of 11,025 km~2using 0.09 km~2aerial images without any prior information.The absolute localization error is less than 10 m.

Large-scale spatial data visualization method based on augmented reality

Background A task assigned to space exploration satellites involves detecting the physical environment within a certain space.However,space detection data are complex and abstract.These data are not conducive for researchers'visual perceptions of the evolution and interaction of events in the space environment.Methods A time-series dynamic data sampling method for large-scale space was proposed for sample detection data in space and time,and the corresponding relationships between data location features and other attribute features were established.A tone-mapping method based on statistical histogram equalization was proposed and applied to the final attribute feature data.The visualization process is optimized for rendering by merging materials,reducing the number of patches,and performing other operations.Results The results of sampling,feature extraction,and uniform visualization of the detection data of complex types,long duration spans,and uneven spatial distributions were obtained.The real-time visualization of large-scale spatial structures using augmented reality devices,particularly low-performance devices,was also investigated.Conclusions The proposed visualization system can reconstruct the three-dimensional structure of a large-scale space,express the structure and changes in the spatial environment using augmented reality,and assist in intuitively discovering spatial environmental events and evolutionary rules.

PerfMon: Measuring Application-Level Performance in a Large-Scale Campus Wireless Network

WiFi has become one of the most popular ways to access the Internet.However,in large-scale campus wireless networks,it is challenging for network administrators to provide optimized access quality without knowledge on fine-grained traffic characteristics and real network performance.In this paper,we implement PerfMon,a network performance measurement and diagnosis system,which integrates collected multi-source datasets and analysis methods.Based on PerfMon,we first conduct a comprehensive measurement on application-level traffic patterns and behaviors from multiple dimensions in the wireless network of T university(TWLAN),which is one of the largest campus wireless networks.Then we systematically study the application-level network performance.We observe that the application-level traffic behaviors and performance vary greatly across different locations and device types.The performance is far from satisfactory in some cases.To diagnose these problems,we distinguish locations and device types,and further locate the most crucial factors that affect the performance.The results of case studies show that the influential factors can effectively characterize performance changes and explain for performance degradation.

Financial Calculation Problems and Countermeasure Analysis of Large-Scale Engineering Construction Projects

The financial aspects of large-scale engineering construction projects profoundly influence their success.Strengthening cost control and establishing a scientific financial evaluation system can enhance the project’s economic benefits,minimize unnecessary costs,and provide decision-makers with a robust financial foundation.Additionally,implementing an effective cash flow control mechanism and conducting a comprehensive assessment of potential project risks can ensure financial stability and mitigate the risk of fund shortages.Developing a practical and feasible fundraising plan,along with stringent fund management practices,can prevent fund wastage and optimize fund utilization efficiency.These measures not only facilitate smooth project progression and improve project management efficiency but also enhance the project’s economic and social outcomes.

Gleaning insights from German energy transition and large-scale underground energy storage for China’s carbon neutrality

The global energy transition is a widespread phenomenon that requires international exchange of experiences and mutual learning.Germany’s success in its first phase of energy transition can be attributed to its adoption of smart energy technology and implementation of electricity futures and spot marketization,which enabled the achievement of multiple energy spatial–temporal complementarities and overall grid balance through energy conversion and reconversion technologies.While China can draw from Germany’s experience to inform its own energy transition efforts,its 11-fold higher annual electricity consumption requires a distinct approach.We recommend a clean energy system based on smart sector coupling(ENSYSCO)as a suitable pathway for achieving sustainable energy in China,given that renewable energy is expected to guarantee 85%of China’s energy production by 2060,requiring significant future electricity storage capacity.Nonetheless,renewable energy storage remains a significant challenge.We propose four large-scale underground energy storage methods based on ENSYSCO to address this challenge,while considering China’s national conditions.These proposals have culminated in pilot projects for large-scale underground energy storage in China,which we believe is a necessary choice for achieving carbon neutrality in China and enabling efficient and safe grid integration of renewable energy within the framework of ENSYSCO.

A Game-Theoretic Perspective on Resource Management for Large-Scale UAV Communication Networks

As a result of rapid development in electronics and communication technology,large-scale unmanned aerial vehicles(UAVs)are harnessed for various promising applications in a coordinated manner.Although it poses numerous advantages,resource management among various domains in large-scale UAV communication networks is the key challenge to be solved urgently.Specifically,due to the inherent requirements and future development trend,distributed resource management is suitable.In this article,we investigate the resource management problem for large-scale UAV communication networks from game-theoretic perspective which are exactly coincident with the distributed and autonomous manner.By exploring the inherent features,the distinctive challenges are discussed.Then,we explore several gametheoretic models that not only combat the challenges but also have broad application prospects.We provide the basics of each game-theoretic model and discuss the potential applications for resource management in large-scale UAV communication networks.Specifically,mean-field game,graphical game,Stackelberg game,coalition game and potential game are included.After that,we propose two innovative case studies to highlight the feasibility of such novel game-theoretic models.Finally,we give some future research directions to shed light on future opportunities and applications.

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.

Application of convolutional neural networks to large-scale naphtha pyrolysis kinetic modeling

System design and optimization problems require large-scale chemical kinetic models. Pure kinetic models of naphtha pyrolysis need to solve a complete set of stiff ODEs and is therefore too computational expensive. On the other hand, artificial neural networks that completely neglect the topology of the reaction networks often have poor generalization. In this paper, a framework is proposed for learning local representations from largescale chemical reaction networks. At first, the features of naphtha pyrolysis reactions are extracted by applying complex network characterization methods. The selected features are then used as inputs in convolutional architectures. Different CNN models are established and compared to optimize the neural network structure.After the pre-training and fine-tuning step, the ultimate CNN model reduces the computational cost of the previous kinetic model by over 300 times and predicts the yields of main products with the average error of less than 3%. The obtained results demonstrate the high efficiency of the proposed framework.

Microstructure,mechanical properties and fracture behaviors of large-scale sand-cast Mg-3Y-2Gd-1Nd-0.4Zr alloy

In order to improve the ductility of commercial WE43 alloy and reduce its cost,a Mg-3Y-2Gd-1Nd-0.4Zr alloy with a low amount of rare earths was developed and prepared by sand casting with a differential pressure casting system.Its microstructure,mechanical properties and fracture behaviors in the as-cast,solution-treated and as-aged states were evaluated.It is found that the aged alloy exhibited excellent comprehensive mechanical properties owing to the fine dense plate-shapedβ'precipitates formed on prismatic habits during aging at 200℃for 192 hrs after solution-treated at 500℃for 24 hrs.Its ultimate tensile strength,yield strength,and elongation at ambient temperature reach to 319±10 MPa,202±2 MPa and 8.7±0.3%as well as 230±4 MPa,155±1 MPa and 16.0±0.5%at 250℃.The fracture mode of as-aged alloy was transferred from cleavage at room temperature to quasi-cleavage and ductile fracture at the test temperature 300℃.The properties of large-scale components fabricated using the developed Mg-3Y-2Gd-1Nd-0.4Zr alloy are better than those of commercial WE43 alloy,suggesting that the new developed alloy is a good candidate to fabricate the large complex thin-walled components.