Skip to main content

previous disabled Page of 2
and
  1. No Access

    Chapter and Conference Paper

    On Digital Signatures Based on Group Actions: QROM Security and Ring Signatures

    Group action based cryptography was formally proposed in the seminal paper of Brassard and Yung (Crypto 1990). Based on one-way group action, there is a well-known digital signature design based on the Goldrei...

    Markus Bläser, Zhili Chen, Dung Hoang Duong, Antoine Joux in Post-Quantum Cryptography (2024)

  2. No Access

    Chapter and Conference Paper

    Algorithms for Matrix Code and Alternating Trilinear Form Equivalences via New Isomorphism Invariants

    We devise algorithms for finding equivalences of trilinear forms over finite fields modulo linear group actions. Our focus is on two problems under this umbrella, Matrix Code Equivalence (MCE) and Alternating Tri...

    Anand Kumar Narayanan, Youming Qiao, Gang Tang in Advances in Cryptology – EUROCRYPT 2024 (2024)

  3. No Access

    Chapter and Conference Paper

    Construction of an Urban Road Collapse Risk Assessment Model and Its Case Study in Guangzhou

    Road collapse has become one of the frequent geological disasters in large cities, and effective road collapse risk assessment is of great significance for the arrangement of urban road collapse prevention and...

    Yizhao Wang, Yuming Qiao, Weijie Deng in Computational and Experimental Simulations… (2024)

  4. No Access

    Article

    The relationship between root endophytic microbial of plant species and soil properties in different patches of alpine meadow

    Plants do not live alone as single entities but are closely associated with an incredible diversity of bacteria, fungi and other organisms. To explore the advantages of endophytes in controlling ecosystem resp...

    Zhanqing Wang, Siliang Chen, Hongxia Ben, Kexin Chen in Brazilian Journal of Botany (2023)

  5. No Access

    Article

    Connections between graphs and matrix spaces

    Given a bipartite graph G, the graphical matrix space \(\cal{S}_{G}\) ...

    Yinan Li, Youming Qiao, Avi Wigderson, Yuval Wigderson in Israel Journal of Mathematics (2023)

  6. Article

    Open Access

    An Urban Road Risk Assessment Framework Based on Convolutional Neural Networks

    In contemporary cities, road collapse is one of the most common disasters. This study proposed a framework for assessing the risk of urban road collapse. The framework first established a risk indicator system...

    Juncai Jiang, Fei Wang, Yizhao Wang in International Journal of Disaster Risk Sci… (2023)

  7. No Access

    Chapter and Conference Paper

    Heterogeneous Multi-commodity Network Flows over Time

    In the 1950’s, Ford and Fulkerson introduced dynamic flows by incorporating the notion of time into the network flow model (Oper. Res., 1958). In this paper, motivated by real-world applications including route p...

    Yifen Li, **aohui Bei, Youming Qiao in Computer Science – Theory and Applications (2022)

  8. No Access

    Chapter and Conference Paper

    Practical Post-Quantum Signature Schemes from Isomorphism Problems of Trilinear Forms

    In this paper, we propose a practical signature scheme based on the alternating trilinear form equivalence problem. Our scheme is inspired by the Goldreich-Micali-Wigderson’s zero-knowledge protocol for graph ...

    Gang Tang, Dung Hoang Duong, Antoine Joux in Advances in Cryptology – EUROCRYPT 2022 (2022)

  9. No Access

    Chapter and Conference Paper

    Learning Domain Invariant Word Representations for Parsing Domain Adaptation

    We show that strong domain adaptation results for dependency parsing can be achieved using a conceptually simple method that learns domain-invariant word representations. Lacking labeled resources, dependency ...

    **uming Qiao, Yue Zhang, Tiejun Zhao in Natural Language Processing and Chinese Computing (2019)

  10. Chapter and Conference Paper

    General Linear Group Action on Tensors: A Candidate for Post-quantum Cryptography

    Starting from the one-way group action framework of Brassard and Yung (Crypto’90), we revisit building cryptography based on group actions. Several previous candidates for one-way group actions no longer stand...

    Zhengfeng Ji, Youming Qiao, Fang Song, Aaram Yun in Theory of Cryptography (2019)

  11. No Access

    Article

    Constructive non-commutative rank computation is in deterministic polynomial time

    We extend the techniques developed in Ivanyos et al. (Comput Complex 26(3):717–763, 2017) to obtain a deterministic polynomial-time algorithm for computing the non-commutative rank of linear spaces of matrices ov...

    Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam in computational complexity (2018)

  12. No Access

    Article

    Characterization and phenanthrene sorption of organic matter fractions isolated from organic and mineral soils

    Sorption of phenanthrene (PHE) to humic acid (HA) and humin (HM) fractions isolated from organic and mineral soils was investigated to better understand sorption processes in varying soil types. Samples were c...

    Huilan Shi, Shihai Zhu, Youming Qiao in Environmental Science and Pollution Resear… (2018)

  13. No Access

    Article

    Tripartite-to-Bipartite Entanglement Transformation by Stochastic Local Operations and Classical Communication and the Structure of Matrix Spaces

    We study the problem of transforming a tripartite pure state to a bipartite one using stochastic local operations and classical communication (SLOCC). It is known that the tripartite-to-bipartite SLOCC convert...

    Yinan Li, Youming Qiao, **n Wang, Runyao Duan in Communications in Mathematical Physics (2018)

  14. No Access

    Article

    Sparse multivariate polynomial interpolation on the basis of Schubert polynomials

    Schubert polynomials were discovered by A. Lascoux and M. Schützenberger in the study of cohomology rings of flag manifolds in 1980s. These polynomials generalize Schur polynomials and form a linear basis of m...

    Priyanka Mukhopadhyay, Youming Qiao in computational complexity (2017)

  15. No Access

    Article

    Non-commutative Edmonds’ problem and matrix semi-invariants

    In 1967, J. Edmonds introduced the problem of computing the rank over the rational function field of an \({n \times n}\) ...

    Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam in computational complexity (2017)

  16. No Access

    Chapter and Conference Paper

    Improving Dependency Parsing on Clinical Text with Syntactic Clusters from Web Text

    Treebanks for clinical text are not enough for supervised dependency parsing no matter in their scale or diversity, leading to still unsatisfactory performance. Many unlabeled text from web can make up for the...

    **uming Qiao, Hailong Cao, Tiejun Zhao, Kehai Chen in Neural Information Processing (2016)

  17. No Access

    Chapter

    Understanding Alpine Meadow Ecosystems

    This chapter introduces the alpine meadow and its distribution in the headwater region of the Yellow River, including subtypes of alpine meadow, species composition and productivity, soil types and their prope...

    Youming Qiao, Zhonghua Duan in Landscape and Ecosystem Diversity, Dynamic… (2016)

  18. No Access

    Chapter and Conference Paper

    Polynomial-Time Isomorphism Test of Groups that are Tame Extensions

    We give new polynomial-time algorithms for testing isomorphism of a class of groups given by multiplication tables (GpI). Two results (Cannon & Holt, J. Symb. Comput. 2003; Babai, Codenotti & Qiao, ICALP 2012) im...

    Joshua A. Grochow, Youming Qiao in Algorithms and Computation (2015)

  19. No Access

    Chapter and Conference Paper

    On the Power of Parity Queries in Boolean Decision Trees

    In an influential paper, Kushilevitz and Mansour (1993) introduced a natural extension of Boolean decision trees called parity decision tree (PDT) where one may query the sum modulo

    Raghav Kulkarni, Youming Qiao, **aoming Sun in Theory and Applications of Models of Compu… (2015)

  20. No Access

    Article

    Random arithmetic formulas can be reconstructed efficiently

    Informally stated, we present here a randomized algorithm that given black-box access to the polynomial f computed by an unknown/hidden arithmetic formula ϕ reconstructs, on the average, an equivalent or smaller ...

    Ankit Gupta, Neeraj Kayal, Youming Qiao in computational complexity (2014)

previous disabled Page of 2