Filters








863 Hits in 1.7 sec

Differentially Private Condorcet Voting [article]

Zhechen Li, Ao Liu, Lirong Xia, Yongzhi Cao, Hanpin Wang
2022 arXiv   pre-print
Designing private voting rules is an important and pressing problem for trustworthy democracy. In this paper, under the framework of differential privacy, we propose three classes of randomized voting rules based on the well-known Condorcet method: Laplacian Condorcet method (CM^LAP_λ), exponential Condorcet method (CM^EXP_λ), and randomized response Condorcet method (CM^RR_λ), where λ represents the level of noise. By accurately estimating the errors introduced by the randomness, we show that
more » ... M^EXP_λ is the most accurate mechanism in most cases. We prove that all of our rules satisfy absolute monotonicity, lexi-participation, probabilistic Pareto efficiency, approximate probabilistic Condorcet criterion, and approximate SD-strategyproofness. In addition, CM^RR_λ satisfies (non-approximate) probabilistic Condorcet criterion, while CM^LAP_λ and CM^EXP_λ satisfy strong lexi-participation. Finally, we regard differential privacy as a voting axiom, and discuss its relations to other axioms.
arXiv:2206.13081v1 fatcat:3xyx35ydjnhgrbollztwxddyhy

Minimum guesswork discrimination between quantum states [article]

Weien Chen, Yongzhi Cao, Hanpin Wang, Yuan Feng
2014 arXiv   pre-print
Error probability is a popular and well-studied optimization criterion in discriminating non-orthogonal quantum states. It captures the threat from an adversary who can only query the actual state once. However, when the adversary is able to use a brute-force strategy to query the state, discrimination measurement with minimum error probability does not necessarily minimize the number of queries to get the actual state. In light of this, we take Massey's guesswork as the underlying optimization
more » ... criterion and study the problem of minimum guesswork discrimination. We show that this problem can be reduced to a semidefinite programming problem. Necessary and sufficient conditions when a measurement achieves minimum guesswork are presented. We also reveal the relation between minimum guesswork and minimum error probability. We show that the two criteria generally disagree with each other, except for the special case with two states. Both upper and lower information-theoretic bounds on minimum guesswork are given. For geometrically uniform quantum states, we provide sufficient conditions when a measurement achieves minimum guesswork. Moreover, we give the necessary and sufficient condition under which making no measurement at all would be the optimal strategy.
arXiv:1410.5180v1 fatcat:jzw5iphh4fgmvdw6nzf5slphhm

Probabilistic Serial Mechanism for Multi-Type Resource Allocation [article]

Xiaoxi Guo, Sujoy Sikdar, Haibin Wang, Lirong Xia, Yongzhi Cao, Hanpin Wang
2020 arXiv   pre-print
Recently, Wang et al.  ...  In contrast, Wang et al.  ... 
arXiv:2004.12062v1 fatcat:arrjhjjsn5ecfooma2ezl3gqo4

A Behavioral Distance for Fuzzy-Transition Systems [article]

Yongzhi Cao, Huaiqing Wang, Sherry X. Sun, Guoqing Chen
2011 arXiv   pre-print
Wang and S. X. Sun are with the Department of Information Systems, City University of Hong Kong, Kowloon, Hong Kong (e-mails: iswang@cityu.edu.hk; sherry.sun@cityu.edu.hk). G.  ... 
arXiv:1110.0248v1 fatcat:hpgn3ensazazjdq6fg4pgedmym

Draft genome of the Reindeer (Rangifer tarandus) [article]

Zhipeng Li, Zeshan Lin, Lei Chen, Hengxing Ba, Yongzhi Yang, Kun Wang, Wen Wang, Qiang Qiu, Guangyu Li
2017 bioRxiv   pre-print
Reindeer (Rangifer tarandus) is the only fully domesticated species in the Cervidae family, and is the only cervid with a circumpolar distribution. Unlike all other cervids, female reindeer regularly grow cranial appendages (antlers, the defining characteristics of cervids), as well as males. Moreover, reindeer milk contains more protein and less lactose than bovids milk. A high quality reference genome of this specie will assist efforts to elucidate these and other important features in the
more » ... ndeer. Findings: We obtained 723.2 Gb (Gigabase) of raw reads by an Illumina Hiseq 4000 platform, and a 2.64 Gb final assembly, representing 95.7% of the estimated genome (2.76 Gb according to k-mer analysis), including 92.6% of expected genes according to BUSCO analysis. The contig N50 and scaffold N50 sizes were 89.7 kilo base (kb) and 0.94 mega base (Mb), respectively. We annotated 21,555 protein-coding genes and 1.07 Gb of repetitive sequences by de novo and homology-based prediction. Homology-based searches detected 159 rRNA, 547 miRNA, 1,339 snRNA and 863 tRNA sequences in the genome of R. tarandus. The divergence time between R. tarandus, and ancestors of Bos taurus and Capra hircus, is estimated to be 29.55 million years ago (Mya). Conclusions: Our results provide the first high-quality reference genome for the reindeer, and a valuable resource for studying evolution, domestication and other unusual characteristics of the reindeer.
doi:10.1101/154724 fatcat:jepumxbjtfdqphfgdnx3brq47a

Overlapping community detection for count-value networks

QianCheng Yu, ZhiWen Yu, Zhu Wang, XiaoFeng Wang, YongZhi Wang
2019 Human-Centric Computing and Information Sciences  
contributions QY and ZWY are responsible for model design; QCY and ZW are responsible for model inference; QCY and XFW are responsible for experiment design and experiment implementation; QCY and YZ Wang  ... 
doi:10.1186/s13673-019-0202-9 fatcat:4yjzz5tpz5ckvjrrpfwiwub6fe

Detecting the Thermal Properties of Bone Cement by Temperature Sensor

Youzhi Wang, Yongzhi Xu, Fuxia Wang
2013 Sensors & Transducers  
Polymethylmethacrylate-based (PMMA) bone cements containing functionalized carbon nanotubes (CNTs) were prepared, and the thermal properties of the resultant nanocomposite cements were characterized in accordance with the international standard for acrylic resin cements. The aim of this study was to determine the peak temperatures during the polymerization reaction in PMMA bone cement by thermocouple (temperature sensor). The CNTs were uniformly dispersed in the cement matrix. The setting time
more » ... f the cement increased and the maximum temperature during exothermic polymerization reaction was effectively reduced by the incorporation of functionalized CNTs. This reduction decreased thermal necrosis of the respective nanocomposite cements, which probably could reduce the hyperthermia experienced in vivo.
doaj:a4a418239ba240abb8bdea9cd41a636a fatcat:3wu72qw2rrb2tnu2rtqw55kkma

Learning First-Order Rules with Differentiable Logic Program Semantics [article]

Kun Gao, Katsumi Inoue, Yongzhi Cao, Hanpin Wang
2022 arXiv   pre-print
Learning first-order logic programs (LPs) from relational facts which yields intuitive insights into the data is a challenging topic in neuro-symbolic research. We introduce a novel differentiable inductive logic programming (ILP) model, called differentiable first-order rule learner (DFOL), which finds the correct LPs from relational facts by searching for the interpretable matrix representations of LPs. These interpretable matrices are deemed as trainable tensors in neural networks (NNs). The
more » ... NNs are devised according to the differentiable semantics of LPs. Specifically, we first adopt a novel propositionalization method that transfers facts to NN-readable vector pairs representing interpretation pairs. We replace the immediate consequence operator with NN constraint functions consisting of algebraic operations and a sigmoid-like activation function. We map the symbolic forward-chained format of LPs into NN constraint functions consisting of operations between subsymbolic vector representations of atoms. By applying gradient descent, the trained well parameters of NNs can be decoded into precise symbolic LPs in forward-chained logic format. We demonstrate that DFOL can perform on several standard ILP datasets, knowledge bases, and probabilistic relation facts and outperform several well-known differentiable ILP models. Experimental results indicate that DFOL is a precise, robust, scalable, and computationally cheap differentiable ILP model.
arXiv:2204.13570v1 fatcat:brqp4yva75apnf55corzqj2kt4

Discovery and Characterization of a Novel Ampelovirus on Firespike

Yaqin Wang, Yu Song, Yongzhi Wang, Mengji Cao, Tao Hu, Xueping Zhou
2020 Viruses  
(Yaqin Wang) and Y.S. performed the experiments and analyzed data. Y.W. (Yongzhi Wang)-Investigation. M.C.-Data curation and formal analysis. T.H. wrote the manuscript.  ... 
doi:10.3390/v12121452 pmid:33339381 fatcat:mnm2u5rrbjesdbqlo7taqovfnq

Spatiotemporal noise characterization for chirped-pulse amplification systems

Jingui Ma, Peng Yuan, Jing Wang, Yongzhi Wang, Guoqiang Xie, Heyuan Zhu, Liejia Qian
2015 Nature Communications  
Optical noise, the core of the pulse-contrast challenge for ultra-high peak power femtosecond lasers, exhibits spatiotemporal (ST) coupling induced by angular dispersion. Full characterization of such ST noise requires two-dimensional measurements in the ST domain. Thus far, all noise measurements have been made only in the temporal domain. Here we report the experimental characterization of the ST noise, which is made feasible by extending crosscorrelation from the temporal domain to the ST
more » ... ain. We experimentally demonstrate that the ST noise originates from the optical surface imperfections in the pulse stretcher/ compressor and exhibits a linear ST coupling in the far-field plane. The contrast on the far-field axis, underestimated in the conventional measurements, is further improved by avoiding the far-field optics in the stretcher. These results enhance our understanding of the pulse contrast with respect to its ST-coupling nature and pave the way toward the design of high-contrast ultra-high peak power lasers.
doi:10.1038/ncomms7192 pmid:25648187 pmcid:PMC4327312 fatcat:oio5nzbkubakndb75ubsroefzi

POSTER

Yongzhi Wang, Yulong Shen
2016 Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security - CCS'16  
Public cloud vendors have been offering varies big data computing services. However, runtime integrity is one of the major concerns that hinders the adoption of those services. In this paper, we focus on MapReduce, a popular big data computing framework, propose the runtime integrity audition (RIA), a solution to verify the runtime integrity of MapReduce applications. Based on the idea of RIA, we developed a prototype system, called MR Auditor, and tested its applicability and the performance
more » ... th multiple Hadoop applications. Our experimental results showed that MR Auditor is an efficient tool to detect runtime integrity violation and incurs a moderate performance overhead.
doi:10.1145/2976749.2989042 dblp:conf/ccs/WangS16 fatcat:tn76idxqxvaqxfbb7l7dsjgm5i

On Model Checking Boolean BI [chapter]

Heng Guo, Hanpin Wang, Zhongyuan Xu, Yongzhi Cao
2009 Lecture Notes in Computer Science  
The logic of bunched implications (BI), introduced by O'Hearn and Pym, is a substructural logic which freely combines additive and multiplicative implications. Boolean BI (BBI) denotes BI with classical interpretation of additives and its model is the commutative monoid. We show that when the monoid is finitely generated and propositions are recursively defined, or the monoid is infinitely generated and propositions are restricted to generator propositions, the model checking problem is
more » ... ble. In the case of finitely related monoid and generator propositions, the model checking problem is EXPSPACE-complete.
doi:10.1007/978-3-642-04027-6_23 fatcat:xectrvfdgvazblmgpisofed4ba

Editorial: Special issue on security and privacy in network computing

Hua Wang, Yongzhi Wang, Tarek Taleb, Xiaohong Jiang
2019 World wide web (Bussum)  
Paper "A PUF-based Unified Identity Verification Framework for Secure IoT Hardware via Device Authentication" authored by Zhao Huang and Quan Wang, presents a novel system-level device identity verification  ... 
doi:10.1007/s11280-019-00704-x fatcat:vj64c2lpgzherhpsiqgjzjtzla

Fast Mesh Simplification Method for Three-Dimensional Geometric Models with Feature-Preserving Efficiency

Yongzhi Wang, Jianwen Zheng, Hui Wang
2019 Scientific Programming  
To avoid excessive details, thus omitting less important content, of three-dimensional (3D) geometric models, this study proposes a fast mesh simplification method based on an energy-operator for 3D geometric models with salient feature-preserving efficiency. The energy-operator can evaluate the smoothness and complexity of the regional mesh in 3D models. Accordingly, it can be directly used to simultaneously reduce the candidate triangle and its three neighboring triangles. The proposed method
more » ... can dramatically collapse the excessive details in relatively smooth areas and preserve more important salient features during the simplification process. It can also maintain a trade-off between time efficiency and salient feature-preserving accuracy. The effectiveness and efficiency of the new method are demonstrated by comparing it with OpenMesh, which is considered the most popular mesh operation software and is capable of achieving accurate mesh simplification models. The new mesh simplification method based on the energy-operator can provide accurate and concise models for interactive 3D rendering, calculating, simulating, and analyzing.
doi:10.1155/2019/4926190 fatcat:txgb46otnnbihfduwapozkgxgm

Making problems tractable on big data via preprocessing with polylog-size output [article]

Jiannan Yang, Hanpin Wang, Yongzhi Cao
2015 arXiv   pre-print
To provide a dichotomy between those queries that can be made feasible on big data after appropriate preprocessing and those for which preprocessing does not help, Fan et al. developed the -tractability theory. This theory provides a formal foundation for understanding the tractability of query classes in the context of big data. Along this line, we introduce a novel notion of '-tractability in this paper. Inspired by some technologies used to deal big data, we place a restriction on
more » ... ng function, which limits the function to produce a relatively small database as output, at most polylog-size of the input database. At the same time, we bound the redundancy information when re-factorizing data and queries for preprocessing. These changes aim to make our theory more closely linked to practice. We set two complexity classes to denote the classes of Boolean queries that are '-tractable themselves and that can be made '-tractable, respectively. Based on a new factorization in our complexity classes, we investigate two reductions, which differ from whether allowing re-factorizing data and query parts. We verify the transitive and compatible properties of the reductions and analysis the complete problems and sizes of the complexity classes. We conclude that all PTIME classes of Boolean queries can be made '-tractable, similar to that of the -tractability theory. With a little surprise, we prove that the set of all '-tractable queries is strictly smaller than that of all -tractable queries, and thus the set of '-tractable queries is properly contained in that of PTIME queries. In this way, we attain a new complexity class inside the complexity class of PTIME queries.
arXiv:1510.00229v1 fatcat:6iivrmoperd7bcgk2yteyrc74q
« Previous Showing results 1 — 15 out of 863 results