A5101668134- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
- Complex Network Analysis Techniques
- Machine Learning and Algorithms
- Optimization and Search Problems
- Graph theory and applications
- Privacy-Preserving Technologies in Data
- Advanced Graph Neural Networks
- HIV, Drug Use, Sexual Risk
- Syphilis Diagnosis and Treatment
- Markov Chains and Monte Carlo Methods
- HIV/AIDS Research and Interventions
- Scheduling and Timetabling Solutions
- Metaheuristic Optimization Algorithms Research
- HIV, TB, and STIs Epidemiology
- Vehicle Routing Optimization Methods
- Advanced Clustering Algorithms Research
- Data Management and Algorithms
- Stochastic Gradient Optimization Techniques
- Topological and Geometric Data Analysis
- Limits and Structures in Graph Theory
- Cryptography and Data Security
- semigroups and automata theory
- Caching and Content Delivery
- Adolescent Sexual and Reproductive Health
South China Agricultural University
2025
Wuhan University of Science and Technology
2025
Lanzhou University
2025
Guangxi University
2021-2024
Nanjing University
2024
University of Science and Technology of China
2021-2024
Ezhou Central Hospital
2024
Xiangya Hospital Central South University
2023
Central South University
2023
Shanghai University of Traditional Chinese Medicine
2023
Despite decades of research on effective methods to resist Salmonella enterica serovar Typhimurium (S. Typhimurium) pathogenicity, the mechanisms S. Typhimurium-host interactions have not been fully determined. is characterized as an important zoonosis in public health worldwide because its endemicity, high morbidity, and difficulty applying control prevention measures. Herein, we introduce a novel bacterial factor, secretion system effector J (SseJ), interactive host protein, PHB2...
For a connected graph G=(V,E), the dominating set in G is subset of vertices F⊂V such that every vertex V−F adjacent to at least one F. The minimum cardinality G, denoted by γ(G), domination number G. edge edges S⊂E E−S S. an γ′(G), In this paper, we characterize all trees and claw-free cubic graphs with equal numbers, respectively.
Background and objectives Family caregiver self-efficacy plays an important role in improving the health quality of life patients early post-coronary artery bypass grafting (CABG). However, there is a lack targeted assessment tool for caregivers patients. Thus, purpose this study was to develop Caregiver Self-Efficacy Scale post-CABG (FCSES-EPCABG) test its reliability validity. Methods Based on theory, initial scale formed by literature review, semi-structured interviews, Delphi expert...
<b>Objectives:</b> To understand the disease epidemiology of syphilis in pregnant women, and to evaluate effectiveness screening intervention programme, for purpose controlling mother-to-child transmission Shenzhen, People's Republic China (PRC). <b>Methods:</b> At Shenzhen Center Disease Control Prevention (SZCDC), we used toluidine red unheated serum test (TRUST) primary confirmed positive results with <i>Treponema pallidum</i> particle agglutination (TPPA) test. We informed treated those...
Early screening for syphilis among pregnant women and the effective treatment of maternal is fundamental to prevent congenital (CS).We obtained data from Shenzhen Program Prevention CS (SPPCS) estimated incidence rates infants born syphilis-seropositive treated with different regimens or untreated syphilis.A total 4746 matched cases mothers their were included analyses, 162 diagnosed CS, providing an overall 3.41% (95% confidence interval [CI], 2.91%-3.98%). Among who had adequately before...
HIV/STD surveillance system data are important for developing prevention and control programmes men who have sex with (MSM), now a core group in Chinese activities. MSM were recruited from different settings Shenzhen tested HIV syphilis. A substantial prevalence of syphilis infections was found this population. However, risk behaviours sociodemographic characteristics varied greatly among the (gay sauna, gay bar clinic), suggesting that carefully considering selecting appropriate to...
Heat stress (HS) results in health problems animals. This study was conducted to investigate the effect and underlying mechanism of HS on proliferation differentiation process 3T3-L1 preadipocytes. preadipocytes were treated at 37 °C or 41.5 °C. up-regulated mRNA protein expression level heat shock 70 (HSP70). Furthermore, significantly inhibited after treatment for 2 days. A large number accumulated lipid droplets observed under microscope 8 Notably, result oil red O staining showed that...
Potato common scab, caused by Streptomyces spp., is one of the leading causes heavy commercial losses in potato industry and thus most serious plant diseases worldwide. This study identified assessed potential biocontrol agents against scab. In total, 110 isolates were obtained through antagonistic tests; among which, Bacillus sp. strain AMCC 101304 was found to be effective at inhibiting scab pathogen, scabies. finally as altitudinis morphological observation, physiological biochemical...
We study the problem of recognizing cluster structure a graph in framework property testing bounded degree model. Given parameter ε, d-bounded is defined to be (k, φ)-clusterable, if it can partitioned into no more than k parts, such that (inner) conductance induced subgraph on each part at least φ and (outer) most cd,kε4φ2, where cd,k depends only d,k. Our main result sublinear algorithm with running time ~O(√n ⋅ poly(φ,k,1/ε)) takes as input maximum by d, parameters k, φ, probability 2/3,...
Until now there has been no data to show the effectiveness or benefits of screening for syphilis in gravidas China. This study was assess a program preventing mother-to-child-transmission and reveal factors impacting benefit.A cohort 159,017 were screened by serologic methods infected individuals treated with 3 injections 2.4 million units benzathine penicillin Shenzhen 2005. The pregnancy outcomes compared this cost-effectiveness analysis 2 scenarios, intervention treatment versus...
We contribute to the theoretical understanding of randomized search heuristics for dynamic problems. consider classical graph coloring problem and investigate setting where edges are added current graph. then analyze expected time recompute high quality solutions. This includes (1+1) EA RLS in a number colors is bounded we minimizing conflicts as well iterated local algorithms that use an unbounded color palette aim smallest - consequence colors.
IN CHINA, THERE HAS BEEN an emerging epidemic of HIV and syphilis infections among men who have sex with (MSM). Multiple surveys conducted in recent years shown a high prevalence MSM China.1,2 A rapid increase has been demonstrated some areas, including China. For example, the had increased from 0.4% 2004 to 5.8% 2006 Beijing, China.3 also found other Asian countries Phnom Penn, Cambodia (8.9%), Chiang Mai, Thailand (15.3%), Andhra Pradesh, India (18.2%).4 In 2007, homosexual transmission...
We study property testing algorithms in directed graphs (digraphs) with maximum indegree and outdegree upper bounded by d. For degree, there are two different models introduced Bender Ron (2002). In the bidirectional model, one can access both incoming outgoing edges while unidirectional model only edges. our paper we provide a new relation between models: prove that if be tested constant query complexity then it sublinear model. A corollary of this result is (the allowing queries to...
Effective resistance is an important metric that measures the similarity of two vertices in a graph. It has found applications graph clustering, recommendation systems and network reliability, among others. In spite importance effective resistances, we still lack efficient algorithms to exactly compute or approximate them on massive graphs.
We consider the problem of dynamically maintaining (approximate) all-pairs effective resistances in separable graphs, which are those that admit an n^{c}-separator theorem for some c<1. give a fully dynamic algorithm maintains (1+epsilon)-approximations n-vertex graph G undergoing edge insertions and deletions with O~(sqrt{n}/epsilon^2) worst-case update time query time, if is guaranteed to be sqrt{n}-separable (i.e., it taken from class satisfying sqrt{n}-separator theorem) its separator...
We introduce a new algorithmic framework for designing dynamic graph algorithms in minor-free graphs, by exploiting the structure of such graphs and tool called vertex sparsification, which is way to compress large into small ones that well preserve relevant properties among subset vertices has previously mainly been used design approximation algorithms. Using this framework, we obtain Monte Carlo randomized fully algorithm (1 + epsilon)-approximating energy electrical flows n-vertex...
Graph sparsification aims at compressing large graphs into smaller ones while preserving important characteristics of the input graph. In this work we study vertex sparsifiers, i.e., sparsifiers whose goal is to reduce number vertices. We focus on following notions: (1) Given a digraph $G=(V,E)$ and terminal vertices $K \subset V$ with $|K| = k$, (vertex) reachability sparsifier $G$ $H=(V_H,E_H)$, V_H$ that preserves all information among pairs. Let $|V_H|$ denote size $H$. introduce notion...
Spectral clustering is one of the most popular methods for finding clusters in a graph, which has found many applications data mining. However, input graph those may have missing edges due to error measurement, withholding privacy reason, or arbitrariness conversion. To make reliable and efficient decisions based on spectral clustering, we assess stability against edge perturbations using notion average sensitivity, expected size symmetric difference output before after randomly remove...
We study which property testing and sublinear time algorithms can be transformed into graph streaming for random order streams. Our main result is that bounded degree graphs, any constant-query testable in the adjacency list model tested with constant space a single-pass obtained by estimating distribution of local neighborhoods vertices on stream using space. then show our approach also applied to approximation graphs model: As an example, we obtain constant-space approximating size maximum...
We consider the problem of dynamically maintaining (approximate) all-pairs effective resistances in separable graphs, which are those that admit an $n^{c}$-separator theorem for some $c<1$. give a fully dynamic algorithm maintains $(1+\varepsilon)$-approximations $n$-vertex graph $G$ undergoing edge insertions and deletions with $\tilde{O}(\sqrt{n}/\varepsilon^2)$ worst-case update time query time, if is guaranteed to be $\sqrt{n}$-separable (i.e., it taken from class satisfying...