arXiv subjects

Tao Jia

Publications and source records attributed to Tao Jia.

At least 55 records · Page 3Linked to original sources

arXiv2022

High sensitivity magnetic field sensor via sandwich type PDMS resonator

The sandwich structure as the core layer of PDMS resonator is proposed for single-axis magnetic sensor with high sensitivity. The small Young's modulus of flexible material corresponds to larger variation, resulting in a highly sensitive magnetic response. The sandwich structure pre-set magnetic field provides directional sensing feature. The experimental results show that the redshift sensitivity of 1.08 nm/mT and the blueshift sensitivity of 1.12 nm/mT in the unshielded environment, which is attributed to slight variation in PDMS Young's modulus. At 1.4 kHz, a minimum detectable magnetic field of 0.96 nT Hz-1/2 is realized.

physics.optics↗

arXiv2022

Significant Ties Graph Neural Networks for Continuous-Time Temporal Networks Modeling

Temporal networks are suitable for modeling complex evolving systems. It has a wide range of applications, such as social network analysis, recommender systems, and epidemiology. Recently, modeling such dynamic systems has drawn great attention in many domains. However, most existing approaches resort to taking discrete snapshots of the temporal networks and modeling all events with equal importance. This paper proposes Significant Ties Graph Neural Networks (STGNN), a novel framework that captures and describes significant ties. To better model the diversity of interactions, STGNN introduces a novel aggregation mechanism to organize the most significant historical neighbors' information and adaptively obtain the significance of node pairs. Experimental results on four real networks demonstrate the effectiveness of the proposed framework.

cs.SI↗

arXiv2022

Multi-channel Nuclear Norm Minus Frobenius Norm Minimization for Color Image Denoising

Color image denoising is frequently encountered in various image processing and computer vision tasks. One traditional strategy is to convert the RGB image to a less correlated color space and denoise each channel of the new space separately. However, such a strategy can not fully exploit the correlated information between channels and is inadequate to obtain satisfactory results. To address this issue, this paper proposes a new multi-channel optimization model for color image denoising under the nuclear norm minus Frobenius norm minimization framework. Specifically, based on the block-matching, the color image is decomposed into overlapping RGB patches. For each patch, we stack its similar neighbors to form the corresponding patch matrix. The proposed model is performed on the patch matrix to recover its noise-free version. During the recovery process, a) a weight matrix is introduced to fully utilize the noise difference between channels; b) the singular values are shrunk adaptively without additionally assigning weights. With them, the proposed model can achieve promising results while keeping simplicity. To solve the proposed model, an accurate and effective algorithm is built based on the alternating direction method of multipliers framework. The solution of each updating step can be analytically expressed in closed-from. Rigorous theoretical analysis proves the solution sequences generated by the proposed algorithm converge to their respective stationary points. Experimental results on both synthetic and real noise datasets demonstrate the proposed model outperforms state-of-the-art models.

cs.CV↗

arXiv2022

Independent Asymmetric Embedding for Information Diffusion Prediction on Social Networks

The prediction for information diffusion on social networks has great practical significance in marketing and public opinion control. It aims to predict the individuals who will potentially repost the message on the social network. One type of method is based on demographics, complex networks and other prior knowledge to establish an interpretable model to simulate and predict the propagation process, while the other type of method is completely data-driven and maps the nodes to a latent space for propagation prediction. Existing latent space design and embedding methods lack consideration for the intervene among users. In this paper, we propose an independent asymmetric embedding method to embed each individual into one latent influence space and multiple latent susceptibility spaces. Based on the similarity between information diffusion and heat diffusion phenomenon, the heat diffusion kernel is exploited in our model and establishes the embedding rules. Furthermore, our method captures the co-occurrence regulation of user combinations in cascades to improve the calculating effectiveness. The results of extensive experiments conducted on real-world datasets verify both the predictive accuracy and cost-effectiveness of our approach.

cs.LG↗

arXiv2022

Accelerated functional brain aging in major depressive disorder: evidence from a large scale fMRI analysis of Chinese participants

Major depressive disorder (MDD) is one of the most common mental health conditions that has been intensively investigated for its association with brain atrophy and mortality. Recent studies reveal that the deviation between the predicted and the chronological age can be a marker of accelerated brain aging to characterize MDD. However, current conclusions are usually drawn based on structural MRI information collected from Caucasian participants. The universality of this biomarker needs to be further validated by subjects with different ethnic/racial backgrounds and by different types of data. Here we make use of the REST-meta-MDD, a large scale resting-state fMRI dataset collected from multiple cohort participants in China. We develop a stacking machine learning model based on 1101 healthy controls, which estimates a subject's chronological age from fMRI with promising accuracy. The trained model is then applied to 1276 MDD patients from 24 sites. We observe that MDD patients exhibit a $+4.43$ years ($\text{$p$} < 0.0001$, $\text{Cohen's $d$} = 0.35$, $\text{95\% CI}:1.86 - 3.91$) higher brain-predicted age difference (brain-PAD) compared to controls. In the MDD subgroup, we observe a statistically significant $+2.09$ years ($\text{$p$} < 0.05$, $\text{Cohen's $d$} = 0.134483$) brain-PAD in antidepressant users compared to medication-free patients. The statistical relationship observed is further checked by three different machine learning algorithms. The positive brain-PAD observed in participants in China confirms the presence of accelerated brain aging in MDD patients. The utilization of functional brain connectivity for age estimation verifies existing findings from a new dimension.

q-bio.NC↗

arXiv2022

CasSeqGCN: Combining Network Structure and Temporal Sequence to Predict Information Cascades

One important task in the study of information cascade is to predict the future recipients of a message given its past spreading trajectory. While the network structure serves as the backbone of the spreading, an accurate prediction can hardly be made without the knowledge of the dynamics on the network. The temporal information in the spreading sequence captures many hidden features, but predictions based on sequence alone have their limitations. Recent efforts start to explore the possibility of combining both the network structure and the temporal feature. Here, we propose a new end-to-end prediction method CasSeqGCN in which the structure and temporal feature are simultaneously taken into account. A cascade is divided into multiple snapshots which record the network topology and the state of nodes. The graph convolutional network (GCN) is used to learn the representation of a snapshot. A novel aggregation method based on dynamic routing is proposed to aggregate node representation and the long short-term memory (LSTM) model is used to extract temporal information. CasSeqGCN predicts the future cascade size more accurately compared with other state-of-art baseline methods. The ablation study demonstrates that the improvement mainly comes from the design of the input and the GCN layer. We explicitly design an experiment to show the quality of the cascade representation learned by our approach is better than other methods. Our work proposes a new approach to combine the structural and temporal features, which not only gives a useful baseline model for future studies of cascade prediction, but also brings new insights on a wide collection of problems related with dynamics on and of the network.

cs.SI↗

arXiv2022

Temporal Network Epistemology: on Reaching Consensus in Real World Setting

This work develops the concept of temporal network epistemology model enabling the simulation of the learning process in dynamic networks. The results of the research, conducted on the temporal social network generated using the CogSNet model and on the static topologies as a reference, indicate a significant influence of the network temporal dynamics on the outcome and flow of the learning process. It has been shown that not only the dynamics of reaching consensus is different compared to baseline models but also that previously unobserved phenomena appear, such as uninformed agents or different consensus states for disconnected components. It has been also observed that sometimes only the change of the network structure can contribute to reaching consensus. The introduced approach and the experimental results can be used to better understand the way how human communities collectively solve both complex problems at the scientific level and to inquire into the correctness of less complex but common and equally important beliefs' spreading across entire societies.

cs.SI↗

arXiv2022

CoarSAS2hvec: Heterogeneous Information Network Embedding with Balanced Network Sampling

Heterogeneous information network (HIN) embedding aims to find the representations of nodes that preserve the proximity between entities of different nature. A family of approaches that are wildly adopted applies random walk to generate a sequence of heterogeneous context, from which the embedding is learned. However, due to the multipartite graph structure of HIN, hub nodes tend to be over-represented in the sampled sequence, giving rise to imbalanced samples of the network. Here we propose a new embedding method CoarSAS2hvec. The self-avoid short sequence sampling with the HIN coarsening procedure (CoarSAS) is utilized to better collect the rich information in HIN. An optimized loss function is used to improve the performance of the HIN structure embedding. CoarSAS2hvec outperforms nine other methods in two different tasks on four real-world data sets. The ablation study confirms that the samples collected by CoarSAS contain richer information of the network compared with those by other methods, which is characterized by a higher information entropy. Hence, the traditional loss function applied to samples by CoarSAS can also yield improved results. Our work addresses a limitation of the random-walk-based HIN embedding that has not been emphasized before, which can shed light on a range of problems in HIN analyses.

cs.LG↗

arXiv2021

CCasGNN: Collaborative Cascade Prediction Based on Graph Neural Networks

Cascade prediction aims at modeling information diffusion in the network. Most previous methods concentrate on mining either structural or sequential features from the network and the propagation path. Recent efforts devoted to combining network structure and sequence features by graph neural networks and recurrent neural networks. Nevertheless, the limitation of spectral or spatial methods restricts the improvement of prediction performance. Moreover, recurrent neural networks are time-consuming and computation-expensive, which causes the inefficiency of prediction. Here, we propose a novel method CCasGNN considering the individual profile, structural features, and sequence information. The method benefits from using a collaborative framework of GAT and GCN and stacking positional encoding into the layers of graph neural networks, which is different from all existing ones and demonstrates good performance. The experiments conducted on two real-world datasets confirm that our method significantly improves the prediction accuracy compared to state-of-the-art approaches. What's more, the ablation study investigates the contribution of each component in our method.

cs.LG↗

arXiv2021

A novel similarity measure for mining missing links in long-path networks

Network information mining is the study of the network topology, which answers a large number of application-based questions towards the structural evolution and the function of a real system. For example, the questions can be related to how the real system evolves or how individuals interact with each other in social networks. Although the evolution of the real system may seem to be found regularly, capturing patterns on the whole process of the evolution is not trivial. Link prediction is one of the most important technologies in network information mining, which can help us understand the real system's evolution law. Link prediction aims to uncover missing links or quantify the likelihood of the emergence of nonexistent links from known network structures. Currently, widely existing methods of link prediction almost focus on short-path networks that usually have a myriad of close triangular structures. However, these algorithms on highly sparse or long-path networks have poor performance. Here, we propose a new index that is associated with the principles of Structural Equivalence and Shortest Path Length ($SESPL$) to estimate the likelihood of link existence in long-path networks. Through 548 real networks test, we find that $SESPL$ is more effective and efficient than other similarity-based predictors in long-path networks. We also exploit the performance of $SESPL$ predictor and embedding-based approaches via machine learning techniques, and the performance of $SESPL$ can achieve a gain of 44.09\% over $GraphWave$ and 7.93\% over $Node2vec$. Finally, according to the matrix of Maximal Information Coefficient ($MIC$) between all the similarity-based predictors, $SESPL$ is a new independent feature to the space of traditional similarity features.

physics.soc-ph↗

arXiv2021

Quantifying the noise in bursty gene expression under regulation by small RNAs

Gene expression is a fundamental process in a living system. The small RNAs (sRNAs) is widely observed as a global regulator in gene expression. The inherent nonlinearity in this regulatory process together with the bursty production of messenger RNA (mRNA), sRNA and protein make the exact solution for this stochastic process intractable. This is particularly the case when quantifying the protein noise level, which has great impact on multiple cellular processes. Here we propose an approximate yet reasonably accurate solution for the gene expression noise with infrequent burst and strong regulation by sRNAs. This analytical solution allows us to better analyze the noise and stochastic deviation of protein level. We find that the regulation amplifies the noise, reduces the protein level. The stochasticity in the regulation generates more proteins than what if the stochasticity is removed from the system. The sRNA level is most important to the relationship between the noise and stochastic deviation. The results provide analytical tools for more general studies of gene expression and strengthen our quantitative understandings of post-transcriptional regulation in controlling gene expression processes.

q-bio.MN↗

arXiv2021

Become a better you: correlation between the change of research direction and the change of scientific performance

It is important to explore how scientists decide their research agenda and the corresponding consequences, as their decisions collectively shape contemporary science. There are studies focusing on the overall performance of individuals with different problem choosing strategies. Here we ask a slightly different but relatively unexplored question: how is a scientist's change of research agenda associated with her change of scientific performance. Using publication records of over 14,000 authors in physics, we quantitatively measure the extent of research direction change and the performance change of individuals. We identify a strong positive correlation between the direction change and impact change. Scientists with a larger direction change not only are more likely to produce works with increased scientific impact compared to their past ones, but also have a higher growth rate of scientific impact. On the other hand, the direction change is not associated with productivity change. Those who stay in familiar topics do not publish faster than those who venture out and establish themselves in a new field. The gauge of research direction in this work is uncorrelated with the diversity of research agenda and the switching probability among topics, capturing the evolution of individual careers from a new point of view. Though the finding is inevitably affected by the survival bias, it sheds light on a range of problems in the career development of individual scientists.

physics.soc-ph↗

arXiv2021

Anomalously Strong Near-Neighbor Attraction in Doped 1D Cuprate Chains

In the cuprates, one-dimensional chain compounds provide a unique opportunity to understand the microscopic physics due to the availability of reliable theories. However, progress has been limited by the inability to controllably dope these materials. Here, we report the synthesis and spectroscopic analysis of the one-dimensional cuprate Ba$_{2-x}$Sr$_x$CuO$_{3+δ}$ over a wide range of hole doping. Our angle-resolved photoemission experiments reveal the doping evolution of the holon and spinon branches. We identify a prominent folding branch whose intensity fails to match predictions of the simple Hubbard model. An additional strong near-neighbor attraction, which may arise from coupling to phonons, quantitatively explains experiments for all accessible doping levels. Considering structural and quantum chemistry similarities among cuprates, this attraction will play a similarly crucial role in the high-$T_C$ superconducting counterparts

cond-mat.str-el↗

arXiv2021

The network asymmetry caused by the degree correlation and its effect on the bimodality in control

Our ability to control a whole network can be achieved via a small set of driver nodes. While the minimum number of driver nodes needed for control is fixed in a given network, there are multiple choices for the driver node set. A quantity used to investigate this multiplicity is the fraction of redundant nodes in the network, referring to nodes that do not need any external control. Previous work has discovered a bimodality feature characterized by a bifurcation diagram: networks with the same statistical property would stay with equal probability to have a large or small fraction of redundant nodes. Here we find that this feature is rooted in the symmetry of the directed network, where both the degree distribution and the degree correlation can play a role. The in-in and out-out degree correlation will suppress the bifurcation, as networks with such degree correlations are asymmetric under network transpose. The out-in and in-out degree correlation do not change the network symmetry, hence the bimodality feature is preserved. However, the out-in degree correlation will change the critical average degree needed for the bifurcation. Hence by fixing the average degree of networks and tuning out-in degree correlation alone, we can observe a similar bifurcation diagram. We conduct analytical analyses that adequately explain the emergence of bimodality caused by out-in degree correlation. We also propose a quantity, taking both degree distribution and degree correlation into consideration, to predict if a network would be at the upper or lower branch of the bifurcation. As is well known that most real networks are not neutral, our results extend our understandings of the controllability of complex networks.

physics.soc-ph↗

arXiv2021

The evolution of network controllability in growing networks

The study of network structural controllability focuses on the minimum number of driver nodes needed to control a whole network. Despite intensive studies on this topic, most of them consider static networks only. It is well-known, however, that real networks are growing, with new nodes and links added to the system. Here, we analyze controllability of evolving networks and propose a general rule for the change of driver nodes. We further apply the rule to solve the problem of network augmentation subject to the controllability constraint. The findings fill a gap in our understanding of network controllability and shed light on controllability of real systems.

physics.soc-ph↗

arXiv2021

A paper's corresponding affiliation and first affiliation are consistent at the country level in Web of Science

The purpose of this study is to explore the relationship between the first affiliation and the corresponding affiliation at the different levels via the scientometric analysis We select over 18 million papers in the core collection database of Web of Science (WoS) published from 2000 to 2015, and measure the percentage of match between the first and the corresponding affiliation at the country and institution level. We find that a paper's the first affiliation and the corresponding affiliation are highly consistent at the country level, with over 98% of the match on average. However, the match at the institution level is much lower, which varies significantly with time and country. Hence, for studies at the country level, using the first and corresponding affiliations are almost the same. But we may need to take more cautions to select affiliation when the institution is the focus of the investigation. In the meanwhile, we find some evidence that the recorded corresponding information in the WoS database has undergone some changes since 2013, which sheds light on future studies on the comparison of different databases or the affiliation accuracy of WoS. Our finding relies on the records of WoS, which may not be entirely accurate. Given the scale of the analysis, our findings can serve as a useful reference for further studies when country allocation or institute allocation is needed. Existing studies on comparisons of straight counting methods usually cover a limited number of papers, a particular research field or a limited range of time. More importantly, using the number counted can not sufficiently tell if the corresponding and first affiliation are similar. This paper uses a metric similar to Jaccard similarity to measure the percentage of the match and performs a comprehensive analysis based on a large-scale bibliometric database.

cs.DL↗

arXiv2021

Magic Doping and Robust Superconductivity in Monolayer FeSe on Titanates

The enhanced superconductivity in monolayer FeSe on titanates opens a fascinating pathway towards the rational design of high-temperature superconductors. Utilizing the state-of-the-art oxide plus chalcogenide molecular beam epitaxy systems in situ connected to a synchrotron angle-resolved photoemission spectroscope, epitaxial LaTiO3 layers with varied atomic thicknesses are inserted between monolayer FeSe and SrTiO3, for systematic modulation of interfacial chemical potential.With the dramatic increase of electron accumulation at the LaTiO3-SrTiO3 surface, providing a substantial surge of work function mismatch across the FeSe-oxide interface, the charge transfer and the superconducting gap in the monolayer FeSe are found to remain markedly robust. This unexpected finding indicates the existence of an intrinsically anchored magic doping within the monolayer FeSe systems.

cond-mat.supr-con↗

arXiv2020

From syntactic structure to semantic relationship: hypernym extraction from definitions by recurrent neural networks using the part of speech information

The hyponym-hypernym relation is an essential element in the semantic network. Identifying the hypernym from a definition is an important task in natural language processing and semantic analysis. While a public dictionary such as WordNet works for common words, its application in domain-specific scenarios is limited. Existing tools for hypernym extraction either rely on specific semantic patterns or focus on the word representation, which all demonstrate certain limitations.

cs.CL↗