19,031 Hits in 2.6 sec

The epidemiological characteristics of measles and difficulties of measles elimination in Hang Zhou, China

Shijun Liu, Erping Xu, Xioaping Zhang, Yan Liu, Jian Du, Jun Wang, Xinren Che, Wenwen Gu
2013 Human Vaccines & Immunotherapeutics  
Figure 1 . 1 The incidence rate of measles in Hang Zhou from 1955 to 2011. Figure 2 . 2 The geographical distribution of measles from 2004 to 2011.  ... 
doi:10.4161/hv.24032 pmid:23732896 pmcid:PMC3901820 fatcat:kw5qmlnmcbee7gkzr2fzx6mxe4

Effect of Tree Roots on Soil Erosion Control at Seadikes in the Northern Part of the Hang Zhou Bay, China

Jinchi ZHANG, Hiroyuki NAKAMURA
1998 Journal of the Japan Society of Erosion Control Engineering  
Introduction Most of the northern part of the Hang-zhou Bay in China is underlain by silty coastal sediments.  ...  Table 3 3 Relation of soil anti-eroding index, dry rootlet weight Effect of Tree Roots on Soil Erosion Control at Seadikes in the Northern Part of the Hang Zhou Bay, China and soil organic content Note  ... 
doi:10.11475/sabo1973.51.2_5 fatcat:pza657udunbsvh3u2tpgsj4dzu

SeCo: Separating Unknown Musical Visual Sounds with Consistency Guidance [article]

Xinchi Zhou, Dongzhan Zhou, Wanli Ouyang, Hang Zhou, Ziwei Liu, Di Hu
2022 arXiv   pre-print
Recent years have witnessed the success of deep learning on the visual sound separation task. However, existing works follow similar settings where the training and testing datasets share the same musical instrument categories, which to some extent limits the versatility of this task. In this work, we focus on a more general and challenging scenario, namely the separation of unknown musical instruments, where the categories in training and testing phases have no overlap with each other. To
more » ... e this new setting, we propose the Separation-with-Consistency (SeCo) framework, which can accomplish the separation on unknown categories by exploiting the consistency constraints. Furthermore, to capture richer characteristics of the novel melodies, we devise an online matching strategy, which can bring stable enhancements with no cost of extra parameters. Experiments demonstrate that our SeCo framework exhibits strong adaptation ability on the novel musical categories and outperforms the baseline methods by a significant margin.
arXiv:2203.13535v1 fatcat:fyh3bzqguzdszfhfn7cejeyhmu

Boundary Distribution Estimation to Precise Object Detection [article]

Haoran Zhou, Hang Huang, Rui Zhao, Wei Wang, Qingguo Zhou
2021 arXiv   pre-print
In principal modern detectors, the task of object localization is implemented by the box subnet which concentrates on bounding box regression. The box subnet customarily predicts the position of the object by regressing box center position and scaling factors. Although this approach is frequently adopted, we observe that the result of localization remains defective, which makes the performance of the detector unsatisfactory. In this paper, we prove the flaws in the previous method through
more » ... tical analysis and experimental verification and propose a novel solution to detect objects precisely. Rather than plainly focusing on center and size, our approach refines the edges of the bounding box on previous localization results by estimating the distribution at the boundary of the object. Experimental results have shown the potentiality and generalization of our proposed method.
arXiv:2111.01396v1 fatcat:tf45sgemdjf2vij57bmsxmxc2y

Graph Reconstruction via Distance Oracles [article]

Claire Mathieu, Hang Zhou
2013 arXiv   pre-print
We study the problem of reconstructing a hidden graph given access to a distance oracle. We design randomized algorithms for the following problems: reconstruction of a degree bounded graph with query complexity Õ(n^3/2); reconstruction of a degree bounded outerplanar graph with query complexity Õ(n); and near-optimal approximate reconstruction of a general graph.
arXiv:1304.6588v1 fatcat:pwf4ajdyf5el5l374hoddyrv5m

Normal complex symmetric weighted composition operators on the Hardy space [article]

Hang Zhou, Ze-Hua Zhou
2019 arXiv   pre-print
In this paper, we investigate the normal weighed composition operators W_ψ,φ which is J-symmetric, C_1-symmetric and C_2-symmetric on the Hardy space H^2(D) respectively. Firstly, equivalent conditions of the normality of C_1-symmetric and C_2-symmetric weighted composition operators on H^2(D) is given. Furthermore, the normal J-symmetric, C_1-symmetric and C_2-symmetric weighted composition operators on H^2(D) when φ has an interior fixed point, φ is of hyperbolic type or parabolic type are respectively investigated.
arXiv:1901.00601v1 fatcat:xs53syvq25fezdnuqc3afrrsxm

Quasi-degenerate dark photon and dark matter [article]

Hang Zhou
2022 arXiv   pre-print
We introduce an SU(2)_X^ dark sector without any fermions and then realize a non-abelian kinetic mixing between the dark SU(2)_X^ gauge fields and the standard model SU(2)_L^× U(1)_Y^ gauge fields. While one of the dark gauge bosons becomes a dark photon, the others can keep stable to form a dark matter particle. The nearly degenerate masses of dark photon and dark matter could be tested if the dark photon and the dark matter are both observed in the future.
arXiv:2209.08843v1 fatcat:b3nrjkvfurg5lawtwwcaxg5pjy

Approximation for Maximum Surjective Constraint Satisfaction Problems [article]

Walter Bach, Hang Zhou
2011 arXiv   pre-print
Maximum surjective constraint satisfaction problems (Max-Sur-CSPs) are computational problems where we are given a set of variables denoting values from a finite domain B and a set of constraints on the variables. A solution to such a problem is a surjective mapping from the set of variables to B such that the number of satisfied constraints is maximized. We study the approximation performance that can be acccchieved by algorithms for these problems, mainly by investigating their relation with
more » ... ax-CSPs (which are the corresponding problems without the surjectivity requirement). Our work gives a complexity dichotomy for Max-Sur-CSP(B) between PTAS and APX-complete, under the assumption that there is a complexity dichotomy for Max-CSP(B) between PO and APX-complete, which has already been proved on the Boolean domain and 3-element domains.
arXiv:1110.2953v1 fatcat:gdfk7mfaengyjnscr4ljrau5b4

Optimization of Bootstrapping in Circuits [article]

Fabrice Benhamouda, Tancrède Lepoint, Claire Mathieu, Hang Zhou
2016 arXiv   pre-print
In 2009, Gentry proposed the first Fully Homomorphic Encryption (FHE) scheme, an extremely powerful cryptographic primitive that enables to perform computations, i.e., to evaluate circuits, on encrypted data without decrypting them first. This has many applications, in particular in cloud computing. In all currently known FHE schemes, encryptions are associated to some (non-negative integer) noise level, and at each evaluation of an AND gate, the noise level increases. This is problematic
more » ... e decryption can only work if the noise level stays below some maximum level L at every gate of the circuit. To ensure that property, it is possible to perform an operation called bootstrapping to reduce the noise level. However, bootstrapping is time-consuming and has been identified as a critical operation. This motivates a new problem in discrete optimization, that of choosing where in the circuit to perform bootstrapping operations so as to control the noise level; the goal is to minimize the number of bootstrappings in circuits. In this paper, we formally define the bootstrap problem, we design a polynomial-time L-approximation algorithm using a novel method of rounding of a linear program, and we show a matching hardness result: (L-ϵ)-inapproximability for any ϵ>0.
arXiv:1608.04535v1 fatcat:6l5mvfub6bcufi4viyxydg32ce

Probabilistic Analysis of Euclidean Capacitated Vehicle Routing [article]

Claire Mathieu, Hang Zhou
2021 arXiv   pre-print
We give a probabilistic analysis of the unit-demand Euclidean capacitated vehicle routing problem in the random setting, where the input distribution consists of n unit-demand customers modeled as independent, identically distributed uniform random points in the two-dimensional plane. The objective is to visit every customer using a set of routes of minimum total length, such that each route visits at most k customers, where k is the capacity of a vehicle. All of the following results are in
more » ... random setting and hold asymptotically almost surely. The best known polynomial-time approximation for this problem is the iterated tour partitioning (ITP) algorithm, introduced in 1985 by Haimovich and Rinnooy Kan. They showed that the ITP algorithm is near-optimal when k is either o(√(n)) or ω(√(n)), and they asked whether the ITP algorithm was also effective in the intermediate range. In this work, we show that when k=√(n), the ITP algorithm is at best a (1+c_0)-approximation for some positive constant c_0. On the other hand, the approximation ratio of the ITP algorithm was known to be at most 0.995+α due to Bompadre, Dror, and Orlin, where α is the approximation ratio of an algorithm for the traveling salesman problem. In this work, we improve the upper bound on the approximation ratio of the ITP algorithm to 0.915+α. Our analysis is based on a new lower bound on the optimal cost for the metric capacitated vehicle routing problem, which may be of independent interest.
arXiv:2109.06958v1 fatcat:7fyisawo2vcyxi73jof4h6urq4

Semantic-Aware Implicit Neural Audio-Driven Video Portrait Generation [article]

Xian Liu, Yinghao Xu, Qianyi Wu, Hang Zhou, Wayne Wu, Bolei Zhou
2022 arXiv   pre-print
Zhou et al. [82] explicitly disentangle identity and word information for better feature extraction. Prajwal et al. [47] achieve synchronous lip movements with a pretrained lip-sync expert.  ... 
arXiv:2201.07786v1 fatcat:77kaocrzqrbjjcy4sqqq3osruy

A Graph-Based Framework to Bridge Movies and Synopses [article]

Yu Xiong, Qingqiu Huang, Lingfeng Guo, Hang Zhou, Bolei Zhou, Dahua Lin
2019 arXiv   pre-print
Inspired by the remarkable advances in video analytics, research teams are stepping towards a greater ambition -- movie understanding. However, compared to those activity videos in conventional datasets, movies are significantly different. Generally, movies are much longer and consist of much richer temporal structures. More importantly, the interactions among characters play a central role in expressing the underlying story. To facilitate the efforts along this direction, we construct a
more » ... called Movie Synopses Associations (MSA) over 327 movies, which provides a synopsis for each movie, together with annotated associations between synopsis paragraphs and movie segments. On top of this dataset, we develop a framework to perform matching between movie segments and synopsis paragraphs. This framework integrates different aspects of a movie, including event dynamics and character interactions, and allows them to be matched with parsed paragraphs, based on a graph-based formulation. Our study shows that the proposed framework remarkably improves the matching accuracy over conventional feature-based methods. It also reveals the importance of narrative structures and character interactions in movie understanding.
arXiv:1910.11009v1 fatcat:x6wcmjcskbfdtn7w5yqezkegni

Antioxidant Effect of Lactobacillus fermentum CQPC04-Fermented Soy Milk on D-Galactose-Induced Oxidative Aging Mice

Xianrong Zhou, Hang-hang Du, Meiqing Jiang, Chaolekang Zhou, Yuhan Deng, Xingyao Long, Xin Zhao
2021 Frontiers in Nutrition  
Copyright © 2021 Zhou, Du, Jiang, Zhou, Deng, Long and Zhao. This is an openaccess article distributed under the terms of the Creative Commons Attribution License (CC BY).  ... 
doi:10.3389/fnut.2021.727467 pmid:34513906 pmcid:PMC8429822 fatcat:t5gv4vseancxvg4ibu42pcs3j4

Viscoelastoplastic Displacement Solution for Deep Buried Circular Tunnel Based on a Fractional Derivative Creep Model

Yi-Hang Gao, Zhou Zhou, Hang Zhang, Shuang Jin, Wen Yang, Qing-Hua Meng, Guowen Xu
2021 Advances in Civil Engineering  
Time-dependent deformation of surrounding rock is a common phenomenon for tunnels situated in soft rock stratum or hard rock stratum with high geo-stress. To describe this phenomenon, a creep model combining the Abel dashpot and a non-Newton viscous element was adopted, and the analytical solution about the viscoelastoplastic deformation for circular tunnel was obtained based on this creep model. Then, the auxiliary tunnel of Jinping II hydropower station was taken as an example to reveal the
more » ... fluence of creep parameters on the creep deformation. The research shows that (1) the creep model can well describe the whole creep stage of rocks, that is, the decay, constant, and accelerated creep stages, (2) the creep deformation has a positive relation with the value of fractional order of Abel dashpot and the order of the non-Newton viscous element, and (3) the creep curves between test results and analytical solutions are well consistent with each other, which demonstrate the validity of the analytical solution.
doi:10.1155/2021/3664578 fatcat:sacdwgdyiraopheq6wpryspiyu

Learning Hierarchical Cross-Modal Association for Co-Speech Gesture Generation [article]

Xian Liu, Qianyi Wu, Hang Zhou, Yinghao Xu, Rui Qian, Xinyi Lin, Xiaowei Zhou, Wayne Wu, Bo Dai, Bolei Zhou
2022 arXiv   pre-print
Generating speech-consistent body and gesture movements is a long-standing problem in virtual avatar creation. Previous studies often synthesize pose movement in a holistic manner, where poses of all joints are generated simultaneously. Such a straightforward pipeline fails to generate fine-grained co-speech gestures. One observation is that the hierarchical semantics in speech and the hierarchical structures of human gestures can be naturally described into multiple granularities and
more » ... together. To fully utilize the rich connections between speech audio and human gestures, we propose a novel framework named Hierarchical Audio-to-Gesture (HA2G) for co-speech gesture generation. In HA2G, a Hierarchical Audio Learner extracts audio representations across semantic granularities. A Hierarchical Pose Inferer subsequently renders the entire human pose gradually in a hierarchical manner. To enhance the quality of synthesized gestures, we develop a contrastive learning strategy based on audio-text alignment for better audio representations. Extensive experiments and human evaluation demonstrate that the proposed method renders realistic co-speech gestures and outperforms previous methods in a clear margin. Project page:
arXiv:2203.13161v1 fatcat:6rnee7ftjjefdpdfpltt34hody
« Previous Showing results 1 — 15 out of 19,031 results