Pluggable multitask diffractive neural networks based on cascaded metasurfaces

Optical neural networks have significant advantages in terms of power consumption,parallelism,and high computing speed,which has intrigued extensive attention in both academic and engineering communities.It has been considered as one of the powerful tools in promoting the fields of imaging processing and object recognition.However,the existing optical system architecture cannot be reconstructed to the realization of multi-functional artificial intelligence systems simultaneously.To push the development of this issue,we propose the pluggable diffractive neural networks(P-DNN),a general paradigm resorting to the cascaded metasurfaces,which can be applied to recognize various tasks by switching internal plug-ins.As the proof-of-principle,the recognition functions of six types of handwritten digits and six types of fashions are numerical simulated and experimental demonstrated at near-infrared regimes.Encouragingly,the proposed paradigm not only improves the flexibility of the optical neural networks but paves the new route for achieving high-speed,low-power and versatile artificial intelligence systems.

Activation Redistribution Based Hybrid Asymmetric Quantization Method of Neural Networks

The demand for adopting neural networks in resource-constrained embedded devices is continuously increasing.Quantization is one of the most promising solutions to reduce computational cost and memory storage on embedded devices.In order to reduce the complexity and overhead of deploying neural networks on Integeronly hardware,most current quantization methods use a symmetric quantization mapping strategy to quantize a floating-point neural network into an integer network.However,although symmetric quantization has the advantage of easier implementation,it is sub-optimal for cases where the range could be skewed and not symmetric.This often comes at the cost of lower accuracy.This paper proposed an activation redistribution-based hybrid asymmetric quantizationmethod for neural networks.The proposedmethod takes data distribution into consideration and can resolve the contradiction between the quantization accuracy and the ease of implementation,balance the trade-off between clipping range and quantization resolution,and thus improve the accuracy of the quantized neural network.The experimental results indicate that the accuracy of the proposed method is 2.02%and 5.52%higher than the traditional symmetric quantization method for classification and detection tasks,respectively.The proposed method paves the way for computationally intensive neural network models to be deployed on devices with limited computing resources.Codes will be available on https://github.com/ycjcy/Hybrid-Asymmetric-Quantization.

Rao Algorithms-Based Structure Optimization for Heterogeneous Wireless Sensor Networks

The structural optimization of wireless sensor networks is a critical issue because it impacts energy consumption and hence the network’s lifetime.Many studies have been conducted for homogeneous networks,but few have been performed for heterogeneouswireless sensor networks.This paper utilizes Rao algorithms to optimize the structure of heterogeneous wireless sensor networks according to node locations and their initial energies.The proposed algorithms lack algorithm-specific parameters and metaphorical connotations.The proposed algorithms examine the search space based on the relations of the population with the best,worst,and randomly assigned solutions.The proposed algorithms can be evaluated using any routing protocol,however,we have chosen the well-known routing protocols in the literature:Low Energy Adaptive Clustering Hierarchy(LEACH),Power-Efficient Gathering in Sensor Information Systems(PEAGSIS),Partitioned-based Energy-efficient LEACH(PE-LEACH),and the Power-Efficient Gathering in Sensor Information Systems Neural Network(PEAGSIS-NN)recent routing protocol.We compare our optimized method with the Jaya,the Particle Swarm Optimization-based Energy Efficient Clustering(PSO-EEC)protocol,and the hybrid Harmony Search Algorithm and PSO(HSA-PSO)algorithms.The efficiencies of our proposed algorithms are evaluated by conducting experiments in terms of the network lifetime(first dead node,half dead nodes,and last dead node),energy consumption,packets to cluster head,and packets to the base station.The experimental results were compared with those obtained using the Jaya optimization algorithm.The proposed algorithms exhibited the best performance.The proposed approach successfully prolongs the network lifetime by 71% for the PEAGSIS protocol,51% for the LEACH protocol,10% for the PE-LEACH protocol,and 73% for the PEGSIS-NN protocol;Moreover,it enhances other criteria such as energy conservation,fitness convergence,packets to cluster head,and packets to the base station.

Biodiversity metrics on ecological networks: Demonstrated with animal gastrointestinal microbiomes

Biodiversity has become a terminology familiar to virtually every citizen in modern societies.It is said that ecology studies the economy of nature,and economy studies the ecology of humans;then measuring biodiversity should be similar with measuring national wealth.Indeed,there have been many parallels between ecology and economics,actually beyond analogies.For example,arguably the second most widely used biodiversity metric,Simpson(1949)’s diversity index,is a function of familiar Gini-index in economics.One of the biggest challenges has been the high“diversity”of diversity indexes due to their excessive“speciation”-there are so many indexes,similar to each country’s sovereign currency-leaving confused diversity practitioners in dilemma.In 1973,Hill introduced the concept of“numbers equivalent”,which is based on Renyi entropy and originated in economics,but possibly due to his abstruse interpretation of the concept,his message was not widely received by ecologists until nearly four decades later.What Hill suggested was similar to link the US dollar to gold at the rate of$35 per ounce under the Bretton Woods system.The Hill numbers now are considered most appropriate biodiversity metrics system,unifying Shannon,Simpson and other diversity indexes.Here,we approach to another paradigmatic shift-measuring biodiversity on ecological networks-demonstrated with animal gastrointestinal microbiomes representing four major invertebrate classes and all six vertebrate classes.The network diversity can reveal the diversity of species interactions,which is a necessary step for understanding the spatial and temporal structures and dynamics of biodiversity across environmental gradients.

Falcon Optimization Algorithm-Based Energy Efficient Communication Protocol for Cluster-Based Vehicular Networks

Rapid development in Information Technology(IT)has allowed several novel application regions like large outdoor vehicular networks for Vehicle-to-Vehicle(V2V)transmission.Vehicular networks give a safe and more effective driving experience by presenting time-sensitive and location-aware data.The communication occurs directly between V2V and Base Station(BS)units such as the Road Side Unit(RSU),named as a Vehicle to Infrastructure(V2I).However,the frequent topology alterations in VANETs generate several problems with data transmission as the vehicle velocity differs with time.Therefore,the scheme of an effectual routing protocol for reliable and stable communications is significant.Current research demonstrates that clustering is an intelligent method for effectual routing in a mobile environment.Therefore,this article presents a Falcon Optimization Algorithm-based Energy Efficient Communication Protocol for Cluster-based Routing(FOA-EECPCR)technique in VANETS.The FOA-EECPCR technique intends to group the vehicles and determine the shortest route in the VANET.To accomplish this,the FOA-EECPCR technique initially clusters the vehicles using FOA with fitness functions comprising energy,distance,and trust level.For the routing process,the Sparrow Search Algorithm(SSA)is derived with a fitness function that encompasses two variables,namely,energy and distance.A series of experiments have been conducted to exhibit the enhanced performance of the FOA-EECPCR method.The experimental outcomes demonstrate the enhanced performance of the FOA-EECPCR approach over other current methods.

Multi-Scale-Matching neural networks for thin plate bending problem

Physics-informed neural networks are a useful machine learning method for solving differential equations,but encounter challenges in effectively learning thin boundary layers within singular perturbation problems.To resolve this issue,multi-scale-matching neural networks are proposed to solve the singular perturbation problems.Inspired by matched asymptotic expansions,the solution is decomposed into inner solutions for small scales and outer solutions for large scales,corresponding to boundary layers and outer regions,respectively.Moreover,to conform neural networks,we introduce exponential stretched variables in the boundary layers to avoid semiinfinite region problems.Numerical results for the thin plate problem validate the proposed method.

Correcting Climate Model Sea Surface Temperature Simulations with Generative Adversarial Networks:Climatology,Interannual Variability,and Extremes

Climate models are vital for understanding and projecting global climate change and its associated impacts.However,these models suffer from biases that limit their accuracy in historical simulations and the trustworthiness of future projections.Addressing these challenges requires addressing internal variability,hindering the direct alignment between model simulations and observations,and thwarting conventional supervised learning methods.Here,we employ an unsupervised Cycle-consistent Generative Adversarial Network(CycleGAN),to correct daily Sea Surface Temperature(SST)simulations from the Community Earth System Model 2(CESM2).Our results reveal that the CycleGAN not only corrects climatological biases but also improves the simulation of major dynamic modes including the El Niño-Southern Oscillation(ENSO)and the Indian Ocean Dipole mode,as well as SST extremes.Notably,it substantially corrects climatological SST biases,decreasing the globally averaged Root-Mean-Square Error(RMSE)by 58%.Intriguingly,the CycleGAN effectively addresses the well-known excessive westward bias in ENSO SST anomalies,a common issue in climate models that traditional methods,like quantile mapping,struggle to rectify.Additionally,it substantially improves the simulation of SST extremes,raising the pattern correlation coefficient(PCC)from 0.56 to 0.88 and lowering the RMSE from 0.5 to 0.32.This enhancement is attributed to better representations of interannual,intraseasonal,and synoptic scales variabilities.Our study offers a novel approach to correct global SST simulations and underscores its effectiveness across different time scales and primary dynamical modes.

Multi-scale physics-informed neural networks for solving high Reynolds number boundary layer flows based on matched asymptotic expansions

Multi-scale system remains a classical scientific problem in fluid dynamics,biology,etc.In the present study,a scheme of multi-scale Physics-informed neural networks is proposed to solve the boundary layer flow at high Reynolds numbers without any data.The flow is divided into several regions with different scales based on Prandtl's boundary theory.Different regions are solved with governing equations in different scales.The method of matched asymptotic expansions is used to make the flow field continuously.A flow on a semi infinite flat plate at a high Reynolds number is considered a multi-scale problem because the boundary layer scale is much smaller than the outer flow scale.The results are compared with the reference numerical solutions,which show that the msPINNs can solve the multi-scale problem of the boundary layer in high Reynolds number flows.This scheme can be developed for more multi-scale problems in the future.

A data-driven model of drop size prediction based on artificial neural networks using small-scale data sets

An artificial neural network(ANN)method is introduced to predict drop size in two kinds of pulsed columns with small-scale data sets.After training,the deviation between calculate and experimental results are 3.8%and 9.3%,respectively.Through ANN model,the influence of interfacial tension and pulsation intensity on the droplet diameter has been developed.Droplet size gradually increases with the increase of interfacial tension,and decreases with the increase of pulse intensity.It can be seen that the accuracy of ANN model in predicting droplet size outside the training set range is reach the same level as the accuracy of correlation obtained based on experiments within this range.For two kinds of columns,the drop size prediction deviations of ANN model are 9.6%and 18.5%and the deviations in correlations are 11%and 15%.

UAV-assisted data collection for wireless sensor networks with dynamic working modes

Wireless Sensor Network(WSN)is a cornerstone of Internet of Things(IoT)and has rich application scenarios.In this work,we consider a heterogeneous WSN whose sensor nodes have a diversity in their Residual Energy(RE).In this work,to protect the sensor nodes with low RE,we investigate dynamic working modes for sensor nodes which are determined by their RE and an introduced energy threshold.Besides,we employ an Unmanned Aerial Vehicle(UAV)to collect the stored data from the heterogeneous WSN.We aim to jointly optimize the cluster head selection,energy threshold and sensor nodes’working mode to minimize the weighted sum of energy con-sumption from the WSN and UAV,subject to the data collection rate constraint.To this end,we propose an efficient search method to search for an optimal energy threshold,and develop a penalty-based successive convex approximation algorithm to select the cluster heads.Then we present a low-complexity iterative approach to solve the joint optimization problem and discuss the implementation procedure.Numerical results justify that our proposed approach is able to reduce the energy consumption of the sensor nodes with low RE significantly and also saves energy for the whole WSN.

‘Partly'globalized networks and driving mechanism in resource-based state-owned enterprises:A case study of J Group

In the context of economic globalization,while multinational enterprises from developed countries occupy a high-end position in the global value chain,enterprises from developing countries are often marginalized in the world market.In China,resource-based state-owned enterprises(SOEs)are tasked with the mission of safeguarding resource security,and their internationalization development ideas and strategic deployment are significantly and fundamentally different from those of other non-state-owned enterprises and large multinational corporations.This study provides ideas for the globalization policies of enterprises in developing countries.We consider J Group in western China as a case and discuss its productive investment and global production network development from 2010 to 2019.We found that J Group was‘Partly'globalized,and there are multiple core nodes with the characteristics of centralized and decentralized coexistence in the production network;in addition,the overall layout centre shifted to Southeast Asia and China;however,its global production was restricted by the enterprise's investment security considerations,support and restrictions of the home country,political security risk of the host country,and sanctions from the West.These findings provide insights for future research:under the wave of anti-globalization and'internal circulation as the main body',resource SOEs should consider the potential risk of investment,especially keeping the middle and downstream industrial chain in China as much as possible.

Influencer identification of dynamical networks based on an information entropy dimension reduction method

Identifying critical nodes or sets in large-scale networks is a fundamental scientific problem and one of the key research directions in the fields of data mining and network science when implementing network attacks, defense, repair and control.Traditional methods usually begin from the centrality, node location or the impact on the largest connected component after node destruction, mainly based on the network structure.However, these algorithms do not consider network state changes.We applied a model that combines a random connectivity matrix and minimal low-dimensional structures to represent network connectivity.By using mean field theory and information entropy to calculate node activity,we calculated the overlap between the random parts and fixed low-dimensional parts to quantify the influence of node impact on network state changes and ranked them by importance.We applied this algorithm and the proposed importance algorithm to the overall analysis and stratified analysis of the C.elegans neural network.We observed a change in the critical entropy of the network state and by utilizing the proposed method we can calculate the nodes that indirectly affect muscle cells through neural layers.

Verifying hierarchical network nonlocality in general quantum networks

Recently, a class of innovative notions on quantum network nonlocality(QNN), called full quantum network nonlocality(FQNN), have been proposed in Phys. Rev. Lett. 128 010403(2022). As the generalization of full network nonlocality(FNN), l-level quantum network nonlocality(l-QNN) was defined in arxiv. 2306.15717 quant-ph(2024). FQNN is a NN that can be generated only from a network with all sources being non-classical. This is beyond the existing standard network nonlocality, which may be generated from a network with only a non-classical source. One of the challenging tasks is to establish corresponding Bell-like inequalities to demonstrate the FQNN or l-QNN. Up to now, the inequality criteria for FQNN and l-QNN have only been established for star and chain networks. In this paper, we devote ourselves to establishing Bell-like inequalities for networks with more complex structures. Note that star and chain networks are special kinds of tree-shaped networks. We first establish the Bell-like inequalities for verifying l-QNN in k-forked tree-shaped networks. Such results generalize the existing inequalities for star and chain networks. Furthermore, we find the Bell-like inequality criteria for l-QNN for general acyclic and cyclic networks. Finally, we discuss the demonstration of l-QNN in the well-known butterfly networks.

Source localization in signed networks with effective distance

While progress has been made in information source localization,it has overlooked the prevalent friend and adversarial relationships in social networks.This paper addresses this gap by focusing on source localization in signed network models.Leveraging the topological characteristics of signed networks and transforming the propagation probability into effective distance,we propose an optimization method for observer selection.Additionally,by using the reverse propagation algorithm we present a method for information source localization in signed networks.Extensive experimental results demonstrate that a higher proportion of positive edges within signed networks contributes to more favorable source localization,and the higher the ratio of propagation rates between positive and negative edges,the more accurate the source localization becomes.Interestingly,this aligns with our observation that,in reality,the number of friends tends to be greater than the number of adversaries,and the likelihood of information propagation among friends is often higher than among adversaries.In addition,the source located at the periphery of the network is not easy to identify.Furthermore,our proposed observer selection method based on effective distance achieves higher operational efficiency and exhibits higher accuracy in information source localization,compared with three strategies for observer selection based on the classical full-order neighbor coverage.

Impact of different interaction behavior on epidemic spreading in time-dependent social networks

We investigate the impact of pairwise and group interactions on the spread of epidemics through an activity-driven model based on time-dependent networks.The effects of pairwise/group interaction proportion and pairwise/group interaction intensity are explored by extensive simulation and theoretical analysis.It is demonstrated that altering the group interaction proportion can either hinder or enhance the spread of epidemics,depending on the relative social intensity of group and pairwise interactions.As the group interaction proportion decreases,the impact of reducing group social intensity diminishes.The ratio of group and pairwise social intensity can affect the effect of group interaction proportion on the scale of infection.A weak heterogeneous activity distribution can raise the epidemic threshold,and reduce the scale of infection.These results benefit the design of epidemic control strategy.

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.

Migration Networks Pattern of China’s Floating Population from the Perspective of Complex Network

Since China’s reform and opening-up,the growing disparity between urban and rural areas and regions has led to massive migration.With China’s Rural Revitalization Strategy and the industrial transfer from the eastern coastal areas to the inland,the migration direction and pattern of the floating population have undergone certain changes.Using the 2017 China Migrants Dynamic Survey(CMDS),excluding Hong Kong,Macao,and Taiwan regions of China,organized by China’s National Health Commission,the relationship matrix of the floating population is constructed according to the inflow place of the interviewees and their outflow place(the location of the registered residence)in the questionnaire survey.We then apply the complex network model to analyze the migration direction and network pattern of China’s floating population from the city scale.The migration network shows an obvious hierarchical agglomeration.The first-,second-,third-and fourth-tier distribution cities are municipalities directly under the central government,provincial capital cities,major cities in the central and western regions and ordinary cities in all provinces,respectively.The migration trend is from the central and western regions to the eastern coastal areas.The migration network has‘small world’characteristics,forming nine communities.It shows that most node cities in the same community are closely linked and geographically close,indicating that the migration network of floating population is still affected by geographical proximity.Narrowing the urban-rural and regional differences will promote the rational distribution this population.It is necessary to strengthen the reform of the registered residence system,so that the floating population can enjoy urban public services comparable to other populations,and allow migrants to live and work in peace.

Spontaneous Recovery in Directed Dynamical Networks

Complex networked systems,which range from biological systems in the natural world to infrastructure systems in the human-made world,can exhibit spontaneous recovery after a failure;for example,a brain may spontaneously return to normal after a seizure,and traffic flow can become smooth again after a jam.Previous studies on the spontaneous recovery of dynamical networks have been limited to undirected networks.However,most real-world networks are directed.To fill this gap,we build a model in which nodes may alternately fail and recover,and we develop a theoretical tool to analyze the recovery properties of directed dynamical networks.We find that the tool can accurately predict the final fraction of active nodes,and the prediction accuracy decreases as the fraction of bidirectional links in the network increases,which emphasizes the importance of directionality in network dynamics.Due to different initial states,directed dynamical networks may show alternative stable states under the same control parameter,exhibiting hysteresis behavior.In addition,for networks with finite sizes,the fraction of active nodes may jump back and forth between high and low states,mimicking repetitive failure-recovery processes.These findings could help clarify the system recovery mechanism and enable better design of networked systems with high resilience.

Evolution and Governance of the Structure of Marine Economic Networks in China’s Coastal Areas: Based on Sea-related A-share Listed Companies

Data on discrete,isolated attributes of the marine economy are often used in traditional marine economic research.However,as the focus of urban research shifts from internal static attributes to external dynamic linkages,the importance of marine economic net-work research is beginning to emerge.The construction of the marine economic network in China’s coastal areas is necessary to change the flow of land and sea resources and optimize regional marine economic development.Employing data from headquarters and branches of sea-related A-share listed enterprises to construct the marine economic network in China,we use social network analysis(SNA)to discuss the characteristics of its evolution as of 2010,2015,and 2020 and its governance.The following results were obtained.1)In terms of topological characteristics,the scale of the marine economic network in China’s coastal areas has accelerated and expan-ded,and the connections have become increasingly close;thus,this development has complex network characteristics.2)In terms of spatial structure,the intensity of the connection fluctuates and does not form stable development support;the group structure gradually becomes clear,but the overall pattern is fragmented;there are spatial differences in marine economic agglomeration radiation;the radi-ation effect of the eastern marine economic circle is obvious;and the polarization effect of northern and southern marine economic circles is significant.On this basis,we construct a framework for the governance of a marine economic network with the market,the government,and industry as the three governing bodies.By clarifying the driving factors and building objectives of marine economic network construction,this study aims to foster the high-quality development of China’s marine economy.

Resilience Augmentation in Unmanned Weapon Systems via Multi-Layer Attention Graph Convolutional Neural Networks

The collective Unmanned Weapon System-of-Systems(UWSOS)network represents a fundamental element in modern warfare,characterized by a diverse array of unmanned combat platforms interconnected through hetero-geneous network architectures.Despite its strategic importance,the UWSOS network is highly susceptible to hostile infiltrations,which significantly impede its battlefield recovery capabilities.Existing methods to enhance network resilience predominantly focus on basic graph relationships,neglecting the crucial higher-order dependencies among nodes necessary for capturing multi-hop meta-paths within the UWSOS.To address these limitations,we propose the Enhanced-Resilience Multi-Layer Attention Graph Convolutional Network(E-MAGCN),designed to augment the adaptability of UWSOS.Our approach employs BERT for extracting semantic insights from nodes and edges,thereby refining feature representations by leveraging various node and edge categories.Additionally,E-MAGCN integrates a regularization-based multi-layer attention mechanism and a semantic node fusion algo-rithm within the Graph Convolutional Network(GCN)framework.Through extensive simulation experiments,our model demonstrates an enhancement in resilience performance ranging from 1.2% to 7% over existing algorithms.