Source author record

Xiaofan Wang

Xiaofan Wang appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

20works
17topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

20 published item(s)

preprint2026arXiv

BrainSegNet: A Novel Framework for Whole-Brain MRI Parcellation Enhanced by Large Models

Whole-brain parcellation from MRI is a critical yet challenging task due to the complexity of subdividing the brain into numerous small, irregular shaped regions. Traditionally, template-registration methods were used, but recent advances have shifted to deep learning for faster workflows. While large models like the Segment Anything Model (SAM) offer transferable feature representations, they are not tailored for the high precision required in brain parcellation. To address this, we propose BrainSegNet, a novel framework that adapts SAM for accurate whole-brain parcellation into 95 regions. We enhance SAM by integrating U-Net skip connections and specialized modules into its encoder and decoder, enabling fine-grained anatomical precision. Key components include a hybrid encoder combining U-Net skip connections with SAM's transformer blocks, a multi-scale attention decoder with pyramid pooling for varying-sized structures, and a boundary refinement module to sharpen edges. Experimental results on the Human Connectome Project (HCP) dataset demonstrate that BrainSegNet outperforms several state-of-the-art methods, achieving higher accuracy and robustness in complex, multi-label parcellation.

preprint2026arXiv

Efficient Verification of Neural Control Barrier Functions with Smooth Nonlinear Activations

Formal verification of neural control barrier functions (NCBFs) remains challenging, especially for neural networks with nonlinear activations like \(\tanh\). Existing CROWN-based methods rely on conservative linear relaxations for Jacobian bounds, limiting scalability. We propose LightCROWN, which computes tighter Jacobian bounds by exploiting the analytical properties of activation functions. Experiments on nonlinear control systems including the inverted pendulum, Dubins car, and planar quadrotor demonstrate that LightCROWN improves verification success rates up to 100\%, while enhancing speed and scalability. Our approach provides a generalizable improvement for CROWN-based frameworks, enabling more efficient verification of complex NCBFs. The code can be found at github.com/Autonomous-Systems-and-Control-Lab/verify-neural-CBF.

preprint2022arXiv

Autonomous Highway Merging in Mixed Traffic Using Reinforcement Learning and Motion Predictive Safety Controller

Deep reinforcement learning (DRL) has a great potential for solving complex decision-making problems in autonomous driving, especially in mixed-traffic scenarios where autonomous vehicles and human-driven vehicles (HDVs) drive together. Safety is a key during both the learning and deploying reinforcement learning (RL) algorithms process. In this paper, we formulate the on-ramp merging as a Markov Decision Process (MDP) problem and solve it with an off-policy RL algorithm, i.e., Soft Actor-Critic for Discrete Action Settings (SAC-Discrete). In addition, a motion predictive safety controller including a motion predictor and an action substitution module, is proposed to ensure driving safety during both training and testing. The motion predictor estimates the trajectories of the ego vehicle and surrounding vehicles from kinematic models, and predicts potential collisions. The action substitution module updates the actions based on safety distance and replaces risky actions, before sending them to the low-level controller. We train, evaluate and test our approach on a gym-like highway simulation with three different levels of traffic modes. The simulation results show that even in harder traffic densities, our proposed method still significantly reduces collision rate while maintaining high efficiency, outperforming several state-of-the-art baselines in the considered on-ramp merging scenarios. The video demo of the evaluation process can be found at: https://www.youtube.com/watch?v=7FvjbAM4oFw

preprint2022arXiv

Controllability of Multilayer Networked Sampled-data Systems

This paper explores the state controllability of multilayer networked sampled-data systems with inter-layer couplings, where zero-order holders (ZOHs) are on the control and transmission channels. The effects of both single- and multi-rate sampling on controllability of multilayer networked linear time-invariant (LTI) systems are analyzed, with some sufficient and/or necessary controllability conditions derived. Under specific conditions, the pathological sampling of single node systems could be eliminated by the network structure and inner couplings among different nodes and different layers. The representative drive-response inter-layer coupling mode is studied, and it reveals that the whole system could be controllable due to the inter-layer couplings even if the response layer is uncontrollable itself. Moreover, simulated examples show that the modification of sampling rate on local channels could lay a positive or negative effect on the controllability of the whole system. All the results indicate that the controllability of the multilayer networked sampled-data system is collectively affected by mutually coupled factors.

preprint2022arXiv

Go viral or go broadcast? Characterizing the virality and growth of cascades

Quantifying the virality of cascades is an important question across disciplines such as the transmission of disease, the spread of information and the diffusion of innovations. An appropriate virality metric should be able to disambiguate between a shallow, broadcast-like diffusion process and a deep, multi-generational branching process. Although several valuable works have been dedicated to this field, most of them fail to take the position of the diffusion source into consideration, which makes them fall into the trap of graph isomorphism and would result in imprecise estimation of cascade virality inevitably under certain circumstances. In this paper, we propose a root-aware approach to quantifying the virality of cascades with proper consideration of the root node in a diffusion tree. With applications on synthetic and empirical cascades, we show the properties and potential utility of the proposed virality measure. Based on preferential attachment mechanisms, we further introduce a model to mimic the growth of cascades. The proposed model enables the interpolation between broadcast and viral spreading during the growth of cascades. Through numerical simulations, we demonstrate the effectiveness of the proposed model in characterizing the virality of growing cascades. Our work contributes to the understanding of cascade virality and growth, and could offer practical implications in a range of policy domains including viral marketing, infectious disease and information diffusion.

preprint2022arXiv

Investigating and Modeling the Dynamics of Long Ties

Long ties, the social ties that bridge different communities, are widely believed to play crucial roles in spreading novel information in social networks. However, some existing network theories and prediction models indicate that long ties might dissolve quickly or eventually become redundant, thus putting into question the long-term value of long ties. Our empirical analysis of real-world dynamic networks shows that contrary to such reasoning, long ties are more likely to persist than other social ties, and that many of them constantly function as social bridges without being embedded in local networks. Using a novel cost-benefit analysis model combined with machine learning, we show that long ties are highly beneficial, which instinctively motivates people to expend extra effort to maintain them. This partly explains why long ties are more persistent than what has been suggested by many existing theories and models. Overall, our study suggests the need for social interventions that can promote the formation of long ties, such as mixing people with diverse backgrounds.

preprint2022arXiv

The spatial dissemination of COVID-19 and associated socio-economic consequences

The ongoing coronavirus disease 2019 (COVID-19) pandemic has wreaked havoc worldwide with millions of lives claimed, human travel restricted and economic development halted. Leveraging city-level mobility and case data, our analysis shows that the spatial dissemination of COVID-19 can be well explained by a local diffusion process in the mobility network rather than a global diffusion process, indicating the effectiveness of the implemented disease prevention and control measures. Based on the constructed case prediction model, it is estimated that there could be distinct social consequences if the COVID-19 outbreak happened in different areas. During the epidemic control period, human mobility experienced substantial reductions and the mobility network underwent remarkable local and global structural changes toward containing the spread of COVID-19. Our work has important implications for the mitigation of disease and the evaluation of the socio-economic consequences of COVID-19 on society.

preprint2022arXiv

The Strength of Structural Diversity in Online Social Networks

Understanding the way individuals are interconnected in social networks is of prime significance to predict their collective outcomes. Leveraging a large-scale dataset from a knowledge-sharing website, this paper presents an exploratory investigation of the way to depict structural diversity in directed networks and how it can be utilized to predict one's online social reputation. To capture the structural diversity of an individual, we first consider the number of weakly and strongly connected components in one's contact neighborhood and further take the coexposure network of social neighbors into consideration. We show empirical evidence that the structural diversity of an individual is able to provide valuable insights to predict personal online social reputation, and the inclusion of a coexposure network provides an additional ingredient to achieve that goal. After synthetically controlling several possible confounding factors through matching experiments, structural diversity still plays a nonnegligible role in the prediction of personal online social reputation. Our work constitutes one of the first attempts to empirically study structural diversity in directed networks and has practical implications for a range of domains, such as social influence and collective intelligence studies.

preprint2020arXiv

A New Comprehensive Data Set of Solar Filaments of 100 yr Interval. I

Filaments are very common physical phenomena on the Sun and are often taken as important proxies of solar magnetic activities. The study of filaments has become a hot topic in the space weather research. For a more comprehensive understanding of filaments, especially for an understanding of solar activities of multiple solar cycles, it is necessary to perform a combined multifeature analysis by constructing a data set of multiple solar cycle data. To achieve this goal, we constructed a centennial data set that covers the H$α$ data from five observatories around the world. During the data set construction, we encountered varieties of problems, such as data fusion, accurate determination of the solar edge, classifying data by quality, dynamic threshold, and so on, which arose mainly due to multiple sources and a large time span of data. But fortunately, these problems were well solved. The data set includes seven types of data products and eight types of feature parameters with which we can implement the functions of data searching and statistical analyses. It has the characteristics of better continuity and highly complementary to space observation data, especially in the wavelengths not covered by space observations, and covers many solar cycles (including more than 60 yr of high-cadence data). We expect that this new comprehensive data set as well as the tools will help researchers to significantly speed up their search for features or events of interest, for either statistical or case study purposes, and possibly help them get a better and more comprehensive understanding of solar filament mechanisms.

preprint2016arXiv

Feedback Control of Real-Time Display Advertising

Real-Time Bidding (RTB) is revolutionising display advertising by facilitating per-impression auctions to buy ad impressions as they are being generated. Being able to use impression-level data, such as user cookies, encourages user behaviour targeting, and hence has significantly improved the effectiveness of ad campaigns. However, a fundamental drawback of RTB is its instability because the bid decision is made per impression and there are enormous fluctuations in campaigns' key performance indicators (KPIs). As such, advertisers face great difficulty in controlling their campaign performance against the associated costs. In this paper, we propose a feedback control mechanism for RTB which helps advertisers dynamically adjust the bids to effectively control the KPIs, e.g., the auction winning ratio and the effective cost per click. We further formulate an optimisation framework to show that the proposed feedback control mechanism also has the ability of optimising campaign performance. By settling the effective cost per click at an optimal reference value, the number of campaign's ad clicks can be maximised with the budget constraint. Our empirical study based on real-world data verifies the effectiveness and robustness of our RTB control system in various situations. The proposed feedback control mechanism has also been deployed on a commercial RTB platform and the online test has shown its success in generating controllable advertising performance.

preprint2015arXiv

Controllability of networked MIMO systems

In this paper, we consider the state controllability of networked systems, where the network topology is directed and weighted and the nodes are higher-dimensional linear time-invariant (LTI) dynamical systems. We investigate how the network topology, the node-system dynamics, the external control inputs, and the inner interactions affect the controllability of a networked system, and show that for a general networked multi-input/multi-output (MIMO) system: 1) the controllability of the overall network is an integrated result of the aforementioned relevant factors, which cannot be decoupled into the controllability of individual node-systems and the properties solely determined by the network topology, quite different from the familiar notion of consensus or formation controllability; 2) if the network topology is uncontrollable by external inputs, then the networked system with identical nodes will be uncontrollable, even if it is structurally controllable; 3) with a controllable network topology, controllability and observability of the nodes together are necessary for the controllability of the networked systems under some mild conditions, but nevertheless they are not sufficient. For a networked system with single-input/single-output (SISO) LTI nodes, we present precise necessary and sufficient conditions for the controllability of a general network topology.

preprint2015arXiv

Distributed Detection via Bayesian Updates and Consensus

In this paper, we discuss a class of distributed detection algorithms which can be viewed as implementations of Bayes' law in distributed settings. Some of the algorithms are proposed in the literature most recently, and others are first developed in this paper. The common feature of these algorithms is that they all combine (i) certain kinds of consensus protocols with (ii) Bayesian updates. They are different mainly in the aspect of the type of consensus protocol and the order of the two operations. After discussing their similarities and differences, we compare these distributed algorithms by numerical examples. We focus on the rate at which these algorithms detect the underlying true state of an object. We find that (a) The algorithms with consensus via geometric average is more efficient than that via arithmetic average; (b) The order of consensus aggregation and Bayesian update does not apparently influence the performance of the algorithms; (c) The existence of communication delay dramatically slows down the rate of convergence; (d) More communication between agents with different signal structures improves the rate of convergence.

preprint2015arXiv

Transits of Venus and Solar diameter measures from ground: method and results from Athens (2004) and Huairou (2012)

The variation of the solar diameter in time and in position angle has implications in astrophysics and in general relativity, as the long series of studies attest. The Transits of Venus in 2004 and 2012 have been carefully studied because of the rarity of the phenomenon and its historical importance due the AU measure and to the discovery of Venus atmosphere. The characterization of Venus atmosphere and the measure of the solar diameter to the milliarcsecond level of precision have been studied also from satellite images. The results of the solar diameter measurements made with the observations in Athens (2004) and at the Huairou Solar Observing Station in China (2012) are presented. The topic of the oblateness of the Sun at sunset and its intrinsic value is drafted to introduce the general public to the relativistic relevance of measuring the solar figure, in the occasion of the International Year of Light 2015.

preprint2014arXiv

Competitive Dynamics on Complex Networks

We consider a dynamical network model in which two competitors have fixed and different states, and each normal agent adjusts its state according to a distributed consensus protocol. The state of each normal agent converges to a steady value which is a convex combination of the competitors' states, and is independent of the initial states of agents. This implies that the competition result is fully determined by the network structure and positions of competitors in the network. We compute an Influence Matrix (IM) in which each element characterizing the influence of an agent on another agent in the network. We use the IM to predict the bias of each normal agent and thus predict which competitor will win. Furthermore, we compare the IM criterion with seven node centrality measures to predict the winner. We find that the competitor with higher Katz Centrality in an undirected network or higher PageRank in a directed network is much more likely to be the winner. These findings may shed new light on the role of network structure in competition and to what extent could competitors adjust network structure so as to win the competition.

preprint2013arXiv

Venus transits: history and opportunities for planetary, solar and gravitational physics

The data of 2012 transit of Venus are compared with the ones of 2004. The thickness of the atmosphere of Venus, its aureole and the effect of oblateness and other asphericities in the figure of the Sun are taken into consideration, as well as the black drop effect. A new extrapolation method for the contact times is presented. The next Mercury transit in 2016 will be fully visible from Europe, and the data will be gathered in view of this new method of analysis, to obtain the solar diameter.

preprint2012arXiv

Geometrical information on the solar shape: high precision results with SDO/HMI

The uncertainty of measurement of solar diameter is depending on the observational time scale. Full-disc images of SDO/HMI and the images from ground observations in Huairou Solar Observing Station have been analyzed to get the values of solar diameter. The satellite observations reach a very high precision, but the absolute image scale still need to be calibrated. The solar oblateness is a more challenging measurement than the diameter, since the signal amplitude is a few milli-arcseconds. It is a relative measurement, then not affected by the pixel scale calibration required by the diameter measurement. But the results are strongly dependent on the state of instrument such as focus plane deformation and on the calculation process.

preprint2012arXiv

Venus transit, aureole and solar diameter

The possibility to measure the solar diameter using the transits of Mercury has been exploited to investigate the past three centuries of its evolution and to calibrate these measurements made with satellites. This measurement basically consists to compare the ephemerides of the internal contact timings with the observed timings. The transits of Venus of 2004 and 2012 gave the possibility to apply this method, involving a planet with atmosphere, with the refraction of solar light through it creating a luminous arc all around the disk of the planet. The observations of the 2012 transit made to measure the solar diameter participate to the project Venus Twilight Experiment to study the aureole appearing around it near the ingress/egress phases.

preprint2011arXiv

How people make friends in social networking sites - A microscopic perspective

We study the detailed growth of a social networking site with full temporal information by examining the creation process of each friendship relation that can collectively lead to the macroscopic properties of the network. We first study the reciprocal behavior of users, and find that link requests are quickly responded to and that the distribution of reciprocation intervals decays in an exponential form. The degrees of inviters/accepters are slightly negatively correlative with reciprocation time. In addition, the temporal feature of the online community shows that the distributions of intervals of user behaviors, such as sending or accepting link requests, follow a power law with a universal exponent, and peaks emerge for intervals of an integral day. We finally study the preferential selection and linking phenomena of the social networking site and find that, for the former, a linear preference holds for preferential sending and reception, and for the latter, a linear preference also holds for preferential acceptance, creation, and attachment. Based on the linearly preferential linking, we put forward an analyzable network model which can reproduce the degree distribution of the network. The research framework presented in the paper could provide a potential insight into how the micro-motives of users lead to the global structure of online social networks.