The vortex electromagnetic (EM) wave, which carries orbital angular momentum (OAM), is exploited to multitarget detection applications. The detection model in the squint mode is derived first. The elevation and azimuth angles of the targets are estimated by the fast Fourier transform method and validated by the simulation. Subsequently, proof-of-concept experiments are performed to validate the principle of the proposed OAM-based target detection technique. The signal processing method for the real-world data obtained from the experiments is proposed to identify the positions of the targets. Experimental results demonstrate the effectiveness of the proposed detection method and indicate that the vortex EM wave can readily be applied to detect multiple targets simultaneously. The work and results show the new applications of the vortex EM wave as well as the development of the novel radar detection technology.

Epidemics pose a significant threat to societal development. Accurately and swiftly identifying the source of an outbreak is crucial for controlling the spread of an epidemic and minimizing its impact. However, existing research on locating epidemic sources often overlooks the fact that epidemics have an incubation period and fails to consider social behaviors like self-isolation during the spread of the epidemic. In this study, we first take into account isolation behavior and introduce the Susceptible-Exposed-Infected-Recovered (SEIR) propagation model to simulate the spread of epidemics. As the epidemic reaches a certain threshold, government agencies or hospitals will report the IDs of some infected individuals and the time when symptoms first appear. The reported individuals, along with their first and second-order neighbors, are then isolated. Using the moment of symptom onset reported by the isolated individuals, we propose a node-level classification method and subsequently develop the node-level-based source identification (NLSI) algorithm. Extensive experiments demonstrate that the NLSI algorithm is capable of solving the source identification problem for single and multiple sources under the SEIR propagation model. We find that the source identification accuracy is higher when the infection rate is lower, and a sparse network structure is beneficial to source localization. Furthermore, we discover that the length of the isolation period has little impact on source localization, while the length of the incubation period significantly affects the accuracy of source localization. This research offers a novel approach for identifying the origin of the epidemic associated with our defined SEIR model.

Locating the source that undergoes a diffusion-like process is a fundamental and challenging problem in complex network, which can help inhibit the outbreak of epidemics among humans, suppress the spread of rumors on the Internet, prevent cascading failures of power grids, etc. However, our ability to accurately locate the diffusion source is strictly limited by incomplete information of nodes and inevitable randomness of diffusion process. In this paper, we propose an efficient optimization approach via maximum likelihood estimation to locate the diffusion source in complex networks with limited observations. By modeling the informed times of the observers, we derive an optimal source localization solution for arbitrary trees and then extend it to general graphs via proper approximations. The numerical analyses on synthetic networks and real networks all indicate that our method is superior to several benchmark methods in terms of the average localization accuracy, high-precision localization and approximate area localization. In addition, low computational cost enables our method to be widely applied for the source localization problem in large-scale networks. We believe that our work can provide valuable insights on the interplay between information diffusion and source localization in complex networks.

Simultaneous outbreaks of contagion are a great threat against human life, resulting in great panic in society. It is urgent for us to find an efficient multiple sources localization method with the aim of studying its pathogenic mechanism and minimizing its harm. However, our ability to locate multiple sources is strictly limited by incomplete information about nodes and the inescapable randomness of the propagation process. In this paper, we present a valid approach, namely the Potential Concentration Label method, which helps locate multiple sources of contagion faster and more accurately in complex networks under the SIR(Susceptible-Infected-Recovered) model. Through label assignment in each node, our aim is to find the nodes with maximal value after several iterations. The experiments demonstrate that the accuracy of our multiple sources localization method is high enough. With the number of sources increasing, the accuracy of our method declines gradually. However, the accuracy remains at a slight fluctuation when average degree and network scale make a change. Moreover, our method still keeps a high multiple sources localization accuracy with noise of various intensities, which shows its strong anti-noise ability. I believe that our method provides a new perspective for accurate and fast multi-sources localization in complex networks.

Epidemic source localization is one of the most meaningful areas of research in complex networks, which helps solve the problem of infectious disease spread. Limited by incomplete information of nodes and inevitable randomness of the spread process, locating the epidemic source becomes a little difficult. In this paper, we propose an efficient algorithm via Bayesian Estimation to locate the epidemic source and find the initial time in complex networks with sparse observers. By modeling the infected time of observers, we put forward a valid epidemic source localization method for tree network and further extend it to the general network via maximum spanning tree. The numerical analyses in synthetic networks and empirical networks show that our algorithm has a higher source localization accuracy than other comparison algorithms. In particular, when the randomness of the spread path enhances, our algorithm has a better performance. We believe that our method can provide an effective reference for epidemic spread and source localization in complex networks.

Event detection is one of the most important areas of complex network research. It aims to identify abnormal points in time corresponding to social events. Traditional methods of event detection, based on first-order network models, are poor at describing the multivariate sequential interactions of components in complex systems and at accurately identifying anomalies in temporal social networks. In this article, we propose two valid approaches, based on a higher-order network model, namely, the recovery higher-order network algorithm and the innovation higher-order network algorithm, to help with event detection in temporal social networks. Given binary sequential data, we take advantage of chronological order to recover the multivariate sequential data first. Meanwhile, we develop new multivariate sequential data using logical sequence. Through the efficient modeling of multivariate sequential data using a higher-order network model, some common multivariate interaction patterns are obtained, which are used to determine the anomaly degree of a social event. Experiments in temporal social networks demonstrate the significant performance of our methods finally. We believe that our methods could provide a new perspective on the interplay between event detection and the application of higher-order network models to temporal networks.