Passive detection of moving aerial target based on multiple collaborative GPS satellites

Passive localization is an important part of intelligent surveillance in security and emergency applications. Nowadays, Global Navigation Satellite Systems (GNSSs) have been widely deployed. As a result, the satellite signal receiver may receive multiple GPS signals simultaneously, incurring echo signal detection failure. Therefore, in this paper, a passive method leveraging signals from multiple GPS satellites is proposed for moving aerial target detection. In passive detection, the first challenge is the interference caused by multiple GPS signals transmitted upon the same spectrum resources. To address this issue, successive interference cancellation (SIC) is utilized to separate and reconstruct multiple GPS signals on the reference channel. Moreover, on the monitoring channel, direct wave and multi-path interference are eliminated by extensive cancellation algorithm (ECA). After interference from multiple GPS signals is suppressed, the cycle cross ambiguity function (CCAF) of the signal on the monitoring channel is calculated and coordinate transformation method is adopted to map multiple groups of different time delay-Doppler spectrum into the distance−velocity spectrum. The detection statistics are calculated by the superposition of multiple groups of distance-velocity spectrum. Finally, the echo signal is detected based on a properly defined adaptive detection threshold. Simulation results demonstrate the effectiveness of our proposed method. They show that the detection probability of our proposed method can reach 99%, when the echo signal signal-to-noise ratio (SNR) is only −64 dB. Moreover, our proposed method can achieve 5 dB improvement over the detection method using a single GPS satellite

Beyond clustering: mean-field dynamics on networks with arbitrary subgraph composition

Clustering is the propensity of nodes that share a common neighbour to be connected. It is ubiquitous in many networks but poses many modelling challenges. Clustering typically manifests itself by a higher than expected frequency of triangles, and this has led to the principle of constructing networks from such building blocks. This approach has been generalised to networks being constructed from a set of more exotic subgraphs. As long as these are fully connected, it is then possible to derive mean-field models that approximate epidemic dynamics well. However, there are virtually no results for non-fully connected subgraphs. In this paper, we provide a general and automated approach to deriving a set of ordinary differential equations, or mean-field model, that describes, to a high degree of accuracy, the expected values of system-level quantities, such as the prevalence of infection. Our approach offers a previously unattainable degree of control over the arrangement of subgraphs and network characteristics such as classical node degree, variance and clustering. The combination of these features makes it possible to generate families of networks with different subgraph compositions while keeping classical network metrics constant. Using our approach, we show that higher-order structure realised either through the introduction of loops of different sizes or by generating networks based on different subgraphs but with identical degree distribution and clustering, leads to non-negligible differences in epidemic dynamics

Controversy-seeking fuels rumor-telling activity in polarized opinion networks

Rumors have ignited revolutions, undermined the trust in political parties, or threatened the stability of human societies. Such destructive potential has been significantly enhanced by the development of on-line social networks. Several theoretical and computational studies have been devoted to understanding the dynamics and to control rumor spreading. In the present work, a model of rumor-telling in opinion polarized networks was investigated through extensive computer simulations. The key mechanism is the coupling between ones' opinions and their leaning to spread a given information, either by supporting or opposing its content. We report that a highly modular topology of polarized networks strongly impairs rumor spreading, but the couplings between agent's opinions and their spreading/stifling rates can either further inhibit or, conversely, foster information propagation, depending on the nature of those couplings. In particular, a controversy-seeking mechanism, in which agents are stimulated to postpone their transitions to the stiffer state upon interactions with other agents of confronting opinions, enhances the rumor spreading. Therefore such a mechanism is capable of overcoming the propagation bottlenecks imposed by loosely connected modular structures.Comment: 11 pages, 7 figure

Statistics of Epidemics in Networks by Passing Messages

Epidemic processes are common out-of-equilibrium phenomena of broad interdisciplinary interest. In this thesis, we show how message-passing approach can be a helpful tool for simulating epidemic models in disordered medium like networks, and in particular for estimating the probability that a given node will become infectious at a particular time. The sort of dynamics we consider are stochastic, where randomness can arise from the stochastic events or from the randomness of network structures. As in belief propagation, variables or messages in message-passing approach are defined on the directed edges of a network. However, unlike belief propagation, where the posterior distributions are updated according to Bayes\u27 rule, in message-passing approach we write differential equations for the messages over time. It takes correlations between neighboring nodes into account while preventing causal signals from backtracking to their immediate source, and thus avoids echo chamber effects where a pair of adjacent nodes each amplify the probability that the other is infectious. In our first results, we develop a message-passing approach to threshold models of behavior popular in sociology. These are models, first proposed by Granovetter, where individuals have to hear about a trend or behavior from some number of neighbors before adopting it themselves. In thermodynamic limit of large random networks, we provide an exact analytic scheme while calculating the time dependence of the probabilities and thus learning about the whole dynamics of bootstrap percolation, which is a simple model known in statistical physics for exhibiting discontinuous phase transition. As an application, we apply a similar model to financial networks, studying when bankruptcies spread due to the sudden devaluation of shared assets in overlapping portfolios. We predict that although diversification may be good for individual institutions, it can create dangerous systemic effects, and as a result financial contagion gets worse with too much diversification. We also predict that financial system exhibits robust yet fragile behavior, with regions of the parameter space where contagion is rare but catastrophic whenever it occurs. In further results, we develop a message-passing approach to recurrent state epidemics like susceptible-infectious-susceptible and susceptible-infectious-recovered-susceptible where nodes can return to previously inhabited states and multiple waves of infection can pass through the population. Given that message-passing has been applied exclusively to models with one-way state changes like susceptible-infectious and susceptible-infectious-recovered, we develop message-passing for recurrent epidemics based on a new class of differential equations and demonstrate that our approach is simple and efficiently approximates results obtained from Monte Carlo simulation, and that the accuracy of message-passing is often superior to the pair approximation (which also takes second-order correlations into account)

Decoding social intentions in human prehensile actions: Insights from a combined kinematics-fMRI study

Consistent evidence suggests that the way we reach and grasp an object is modulated not only by object properties (e.g., size, shape, texture, fragility and weight), but also by the types of intention driving the action, among which the intention to interact with another agent (i.e., social intention). Action observation studies ascribe the neural substrate of this `intentional' component to the putative mirror neuron (pMNS) and the mentalizing (MS) systems. How social intentions are translated into executed actions, however, has yet to be addressed. We conducted a kinematic and a functional Magnetic Resonance Imaging (fMRI) study considering a reach-to-grasp movement performed towards the same object positioned at the same location but with different intentions: passing it to another person (social condition) or putting it on a concave base (individual condition). Kinematics showed that individual and social intentions are characterized by different profiles, with a slower movement at the level of both the reaching (i.e., arm movement) and the grasping (i.e., hand aperture) components. fMRI results showed that: (i) distinct voxel pattern activity for the social and the individual condition are present within the pMNS and the MS during action execution; (ii) decoding accuracies of regions belonging to the pMNS and the MS are correlated, suggesting that these two systems could interact for the generation of appropriate motor commands. Results are discussed in terms of motor simulation and inferential processes as part of a hierarchical generative model for action intention understanding and generation of appropriate motor commands

Complex network analysis and nonlinear dynamics

This chapter aims at reviewing complex network and nonlinear dynamical models and methods that were either developed for or applied to socioeconomic issues, and pertinent to the theme of New Economic Geography. After an introduction to the foundations of the field of complex networks, the present summary introduces some applications of complex networks to economics, finance, epidemic spreading of innovations, and regional trade and developments. The chapter also reviews results involving applications of complex networks to other relevant socioeconomic issue

Network structure and transcriptomic vulnerability shape atrophy in frontotemporal dementia

Connections among brain regions allow pathological perturbations to spread from a single source region to multiple regions. Patterns of neurodegeneration in multiple diseases, including behavioural variant of frontotemporal dementia (bvFTD), resemble the large-scale functional systems, but how bvFTD-related atrophy patterns relate to structural network organization remains unknown. Here we investigate whether neurodegeneration patterns in sporadic and genetic bvFTD are conditioned by connectome architecture. Regional atrophy patterns were estimated in both genetic bvFTD (75 patients, 247 controls) and sporadic bvFTD (70 patients, 123 controls). First, we identified distributed atrophy patterns in bvFTD, mainly targeting areas associated with the limbic intrinsic network and insular cytoarchitectonic class. Regional atrophy was significantly correlated with atrophy of structurally- and functionally-connected neighbours, demonstrating that network structure shapes atrophy patterns. The anterior insula was identified as the predominant group epicentre of brain atrophy using data-driven and simulation-based methods, with some secondary regions in frontal ventromedial and antero-medial temporal areas. We found that FTD-related genes, namely C9orf72 and TARDBP, confer local transcriptomic vulnerability to the disease, modulating the propagation of pathology through the connectome. Collectively, our results demonstrate that atrophy patterns in sporadic and genetic bvFTD are jointly shaped by global connectome architecture and local transcriptomic vulnerability, providing an explanation as to how heterogenous pathological entities can lead to the same clinical syndrome.</p

Techniques to Improve the Efficiency of Data Transmission in Cable Networks

The cable television (CATV) networks, since their introduction in the late 1940s, have now become a crucial part of the broadcasting industry. To keep up with growing demands from the subscribers, cable networks nowadays not only provide television programs but also deliver two-way interactive services such as telephone, high-speed Internet and social TV features. A new standard for CATV networks is released every five to six years to satisfy the growing demands from the mass market. From this perspective, this thesis is concerned with three main aspects for the continuing development of cable networks: (i) efficient implementations of backward-compatibility functions from the old standard, (ii) addressing and providing solutions for technically-challenging issues in the current standard and, (iii) looking for prospective features that can be implemented in the future standard. Since 1997, five different versions of the digital CATV standard had been released in North America. A new standard often contains major improvements over the previous one. The latest version of the standard, namely DOCSIS 3.1 (released in late 2013), is packed with state-of-the-art technologies and allows approximately ten times the amount of traffic as compared to the previous standard, DOCSIS 3.0 (released in 2008). Backward-compatibility is a must-have function for cable networks. In particular, to facilitate the system migration from older standards to a newer one, the backward compatible functions in the old standards must remain in the newer-standard products. More importantly, to keep the implementation cost low, the inherited backward compatible functions must be redesigned by taking advantage of the latest technology and algorithms. To improve the backward-compatibility functions, the first contribution of the thesis focuses on redesigning the pulse shaping filter by exploiting infinite impulse response (IIR) filter structures as an alternative to the conventional finite impulse response (FIR) structures. Comprehensive comparisons show that more economical filters with better performance can be obtained by the proposed design algorithm, which considers a hybrid parameterization of the filter's transfer function in combination with a constraint on the pole radius to be less than 1. The second contribution of the thesis is a new fractional timing estimation algorithm based on peak detection by log-domain interpolation. When compared with the commonly-used timing detection method, which is based on parabolic interpolation, the proposed algorithm yields more accurate estimation with a comparable implementation cost. The third contribution of the thesis is a technique to estimate the multipath channel for DOCSIS 3.1 cable networks. DOCSIS 3.1 is markedly different from prior generations of CATV networks in that OFDM/OFDMA is employed to create a spectrally-efficient signal. In order to effectively demodulate such a signal, it is necessary to employ a demodulation circuit which involves estimation and tracking of the multipath channel. The estimation and tracking must be highly accurate because extremely dense constellations such as 4096-QAM and possibly 16384-QAM can be used in DOCSIS 3.1. The conventional OFDM channel estimators available in the literature either do not perform satisfactorily or are not suitable for the DOCSIS 3.1 channel. The novel channel estimation technique proposed in this thesis iteratively searches for parameters of the channel paths. The proposed technique not only substantially enhances the channel estimation accuracy, but also can, at no cost, accurately identify the delay of each echo in the system. The echo delay information is valuable for proactive maintenance of the network. The fourth contribution of this thesis is a novel scheme that allows OFDM transmission without the use of a cyclic prefix (CP). The structure of OFDM in the current DOCSIS 3.1 does not achieve the maximum throughput if the channel has multipath components. The multipath channel causes inter-symbol-interference (ISI), which is commonly mitigated by employing CP. The CP acts as a guard interval that, while successfully protecting the signal from ISI, reduces the transmission throughput. The problem becomes more severe for downstream direction, where the throughput of the entire system is determined by the user with the worst channel. To solve the problem, this thesis proposes major alterations to the current DOCSIS 3.1 OFDM/OFDMA structure. The alterations involve using a pair of Nyquist filters at the transceivers and an efficient time-domain equalizer (TEQ) at the receiver to reduce ISI down to a negligible level without the need of CP. Simulation results demonstrate that, by incorporating the proposed alterations to the DOCSIS 3.1 down-link channel, the system can achieve the maximum throughput over a wide range of multipath channel conditions