检索结果-内蒙古大学图书馆

51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019

作者： He, Kun Li, Qian Sun, Xiaoming Zhang, Jiapeng CAS Key Lab of Network Data Science and Technology Institute of Computing Technology CAS Beijing China University of Chinese Academy of Sciences Beijing China Shenzhen Institute of Computing Sciences Shenzhen University China University of California San DiegoCA United States

ISBN: (纸本)9781450367059

Lovász Local Lemma (LLL) is a very powerful tool in combinatorics and probability theory to show the possibility of avoiding all "bad" events under some "weakly dependent" condition. Over the last decades, the algorithmic aspect of LLL has also attracted lots of attention in theoretical computer science. A tight criterion under which the abstract version LLL (ALLL) holds was given by Shearer. It turns out that Shearer’s bound is generally not tight for variable version LLL (VLLL). Recently, Ambainis et al. introduced a quantum version LLL (QLLL), which was then shown to be powerful for the quantum satisfiability problem. In this paper, we prove that Shearer’s bound is tight for QLLL, i.e., the relative dimension of the smallest satisfying subspace is completely characterized by the independent set polynomial, affirming a conjecture proposed by Sattath et al. Our result also shows the tightness of Gilyén and Sattath’s algorithm, and implies that the lattice gas partition function fully characterizes quantum satisfiability for almost all Hamiltonians with large enough qudits. Commuting LLL (CLLL), LLL for commuting local Hamiltonians which are widely studied in the literature, is also investigated here. We prove that the tight regions of CLLL and QLLL are different in general. This result might imply that it is possible to design an algorithm for CLLL which is still efficient beyond Shearer’s bound. In applications of LLLs, the symmetric cases are most common, i.e., the events are with the same probability and the Hamiltonians are with the same relative dimension. We give the first lower bound on the gap between the symmetric VLLL and Shearer’s bound. Our result can be viewed as a quantitative study on the separation between quantum and classical constraint satisfaction problems. Additionally, we obtain similar results for the symmetric CLLL. As an application, we give lower bounds on the critical thresholds of VLLL and CLLL for several of the most common lattices. ©

关键词： Hamiltonians

来源：评论

学校读者我要写书评

暂无评论

Fsh-Pc-Sce complex mediates active transcription of Cubitus interruptus （Ci）

引用

Journal of Molecular Cell Biology 2018年第5期10卷 437-447页

作者： Xiangdong Lv Hao Chen Shuo Zhang Zhao Zhang Chenyu Pan Yuanxin Xia Jialin Fan Wenqing Wu Yi Lu Lei Zhang Hailong Wu Yun Zhao State Key Laboratory of Cell Biology CAS Center for Excellence in Molecular Cell Science Innovation Center for Cell Signaling Network Shanghai Institute of Biochemistry and Cell Biology Chinese Academy of Sciences University of Chinese Academy of Sciences Shanghai 200031 China School of Life Science and Technology ShanghaiTech University Shanghai 201210 China

The Hedgehog （Hh） signaling pathway plays important roles in both embryonic development and adult tissue homeostasis. Such biological functions are mediated by the transcription factor Cubitus interruptus （Ci）. Yet the transcriptional regulation of the effector Ci itself is poorly investigated. Through an RNAi-based genetic screen, we identified that female sterile （1） homeotic （Fsh）, a transcription co-activator, directly activates Ci transcription. Biochemistry assays demonstrated physical interactions among Fsh, Sex combs extra （Sce）, and Polycomb （Pc）. Functional assays further showed that both Pc and Sce are required for Ci expression, which is not likely mediated by the derepression of Engraited （En）, a repressor of Ci, in Pc or Sce mutant cells. Finally, we provide evidence showing that Pc/Sce facilitates the binding of Fsh at Ci locus and that the physical interaction between Fsh and Pc is essential for Fsh-mediated Ci transcription. Taken together, we not only uncover that Ci is transcriptionally regulated by Fsh-Pc-Sce complex but also provide evidence for the coordination between Fsh and PcG proteins in transcriptional regulation.

关键词： Ci Fsh Hedgehog polycomb complex Sce transcriptional activation

来源：评论

学校读者我要写书评

暂无评论

ICTNET at Federated Web Search Track 2014 23

ICTNET at Federated Web Search Track 2014

引用

23rd Text REtrieval Conference, TREC 2014

作者： Guan, Feng Zhang, Shuiyuan Liu, Chunmei Yu, Xiaoming Liu, Yue Cheng, Xueqi Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Key Laboratory of Web Data Science and Technology CAS China University of Chinese Academy of Sciences Beijing100190 China

来源：评论

学校读者我要写书评

暂无评论

AUCSeg: AUC-oriented Pixel-level Long-tail Semantic Segmentation 38

AUCSeg: AUC-oriented Pixel-level Long-tail Semantic Segmenta...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Han, Boyu Xu, Qianqian Yang, Zhiyong Bao, Shilong Wen, Peisong Jiang, Yangbangyan Huang, Qingming Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China School of Computer Science and Tech. University of Chinese Academy of Sciences China Peng Cheng Laboratory China Key Laboratory of Big Data Mining and Knowledge Management CAS China

The Area Under the ROC Curve (AUC) is a well-known metric for evaluating instance-level long-tail learning problems. In the past two decades, many AUC optimization methods have been proposed to improve model performance under long-tail distributions. In this paper, we explore AUC optimization methods in the context of pixel-level long-tail semantic segmentation, a much more complicated scenario. This task introduces two major challenges for AUC optimization techniques. On one hand, AUC optimization in a pixel-level task involves complex coupling across loss terms, with structured inner-image and pairwise inter-image dependencies, complicating theoretical analysis. On the other hand, we find that mini-batch estimation of AUC loss in this case requires a larger batch size, resulting in an unaffordable space complexity. To address these issues, we develop a pixel-level AUC loss function and conduct a dependency-graph-based theoretical analysis of the algorithm's generalization ability. Additionally, we design a Tail-Classes Memory Bank (T-Memory Bank) to manage the significant memory demand. Finally, comprehensive experiments across various benchmarks confirm the effectiveness of our proposed AUCSeg method. The code is available at https://***/boyuh/AUCSeg. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Correction: A scale-adaptive estimation for mixed geographically and temporally weighted regression models

引用

Journal of Geographical Systems 2025年第2期27卷 337-337页

作者： Hong, Zhimin Wang, Zhiwen Wang, Huhu Wang, Ruoxuan Department of Mathematics School of Science Inner Mongolia University of Technology Hohhot China Statistics Inner Mongolia Key Laboratory of Statistical Analysis Theory for Life Data and Neural Network Modeling Hohhot China Institute for Infectious Disease and Endemic Disease Control Inner Mongolia Autonomous Region Center for Disease Control and Prevention Hohhot China

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Reliability via Subsystem Structures of Arrangement Graph networks

引用

IEEE Transactions on Reliability 2024年第1期73卷 279-289页

作者： Huang, Yanze Lin, Limei Xu, Li Hsieh, Sun-Yuan Fujian University of Technology Fujian Provincial Key Laboratory of Big Data Mining and Applications School of Computer Science and Mathematics Fuzhou350118 China Fujian Normal University College of Computer and Cyber Security Key Laboratory of Network Security and Cryptology Fuzhou350117 China National Cheng Kung University Department of Computer Science and Information Engineering Tainan701 Taiwan

With the rapid growth of the number of processors in a multiprocessor system, faulty processors occur in it with a probability that rises quickly. The probability of a subsystem with an appropriate size being fault-free in a definite time interval is a significant and practical measure of the reliability for a multiprocessor system, which characterizes the functionality of a multiprocessor system well. Motivated by the study of subgraph reliability, as well as the attractive structure and fault tolerance properties of (n, k)-arrangement graph A n, k, we focus on the subgraph reliability for A n, k under the probabilistic fault model in this article. First, we investigate intersections of no more than four subgraphs in A n, k, and classify all the intersecting modes. Second, we focus on the probability P(q, A n, k n-1, k-1) with which at least one (n-1, k-1)-subarrangement graph is fault-free in A n, k, when given a uniform probability q with which a single vertex is fault-free, and we establish the P(q, A n, kn-1, k-1) by adopting the principle of inclusion-exclusion under the probabilistic fault model. Finally, we study the probabilistic fault model involving a nonuniform probability with which a single vertex is fault-free, and we prove that the P(q, A n, kn-1, k-1) under both models is very close to the asymptotic value by both theoretical arguments and experimental results. © 1963-2012 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Exploration of Teaching Method of Students’ Independent Proposition

Exploration of Teaching Method of Students’ Independent Pro...

引用

International Conference on Guidance, Navigation and Control, ICGNC 2020

作者： Zhang, Jin Wang, Lizhi Quan, Weihong Li, Haoran Gong, Xiaoli College of Computer Science Nankai University Tianjin China College of Cyber Science Nankai University Tianjin China Tianjin Key Laboratory of Network and Data Security Technology Tianjin China

ISBN: (纸本)9789811581540

Aiming at obsolescence and deficiencies of the question bank in the current teaching of computer major courses, we propose a teaching method of student independent proposition, which can not only enrich the question bank as well as ensure the novelty of the exercises, but also effectively obtain feedback data of teaching quality based on the answers to exercises. In this paper, we first discuss the teaching significance of independent proposition and some key issues such as quality management encountered in practice. Then, we propose solutions to the problems of correctness checking and difficulty grading based on some natural language processing and deep learning technologies. Finally, to prove the effectiveness of our approach, we introduce the specific application in teaching practice, including the construction and use of the online education system based on the artificially constructed question bank. © 2022, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Rumor Governance System Based on Blockchain 2

Design and Implementation of Rumor Governance System Based o...

引用

2nd International Conference on Computer science and Blockchain, CCSB 2022

作者： Li, Yutong Song, Jiazhen Wang, Jingrong Lu, Haori Nie, Peng College of Cyber Science Nankai University Tianjin300350 China Nankai University College of Cyber Science Tianjin Key Laboratory of Network and Data Security Technology Tianjin300350 China

ISBN: (纸本)9798350331882

Nowadays, the network rumor is constantly breeding and spreading. It becomes a big difficulty to trace the source and refute the rumors with high efficiency. For this, we designed and implemented an intelligent rumor detection, source tracing and accurate rumor refuting system. This system has three main functions. First, the system provides credible evidence for the tracing and accountability of rumors with the immutable nature of blockchain. Second, we propose a new intelligent rumor detection model that does not involve manual work, that is, by looking for opposite semantic pairs. Third, a new accurate rumor refuting scheme is proposed, which can help break through the information cocoons. The system provides a standardized and effective management platform for the collaborative governance of online rumors in the new era and the improvement of the environment for online public opinion. It also facilitates the development of the Clear Action and the crackdown on online rumors. © 2022 IEEE.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

Frequency-hiding order-preserving encryption with small client storage 47th

Frequency-hiding order-preserving encryption with small clie...

引用

47th International Conference on Very Large data Bases, VLDB 2021

作者： Li, Dongjie Lv, Siyi Huang, Yanyu Liu, Yijing Li, Tong Liu, Zheli Guo, Liang College of Cyber Science Nankai University China Tianjin Key Laboratory of Network and Data Security Technology Nankai University China Huawei Technology Co. Ltd Shenzhen China

The range query on encrypted databases is usually implemented using the order-preserving encryption (OPE) technique which preserves the order of plaintexts. Since the frequency leakage of plaintexts makes OPE vulnerable to frequency-analyzing attacks, some frequency-hiding order-preserving encryption (FH-OPE) schemes are proposed. However, existing FH-OPE schemes require either the large client storage of size O(n) or O(log n) rounds of interactions for each query, where n is the total number of plaintexts. To this end, we propose a FH-OPE scheme that achieves the small client storage without additional client-server interactions. In detail, our scheme achieves O(N) client storage and 1 interaction per query, where N is the number of distinct plaintexts and N ≤ n. Especially, our scheme has a remarkable performance when N © 2021, VLDB Endowment. All rights reserved.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Aggregation-based dual heterogeneous task allocation in spatial crowdsourcing

引用

Frontiers of Computer science 2024年第6期18卷 215-227页

作者： Xiaochuan LIN Kaimin WEI Zhetao LI Jinpeng CHEN Tingrui PEI College of Information Science and Technology&Cyberspace Security Jinan UniversityGuangzhou 510632China National&Local Joint Engineering Research Center of Network Security Detection and Protection Technology Guangzhou 510632China Guangdong Provincial Key Laboratory of Data Security and Privacy Protection Guangzhou 510632China School of Computer Science Beijing University of Posts and TelecommunicationsBeijing 100876China

Spatial crowdsourcing(SC)is a popular data collection paradigm for numerous *** the increment of tasks and workers in SC,heterogeneity becomes an unavoidable difficulty in task *** researches only focus on the single-heterogeneous task ***,a variety of heterogeneous objects coexist in real-world SC *** dramatically expands the space for searching the optimal task allocation solution,affecting the quality and efficiency of data *** this paper,an aggregation-based dual heterogeneous task allocation algorithm is put *** investigates the impact of dual heterogeneous on the task allocation problem and seeks to maximize the quality of task completion and minimize the average travel *** problem is first proved to be ***,a task aggregation method based on locations and requirements is built to reduce task ***,a time-constrained shortest path planning is also developed to shorten the travel distance in a *** that,two evolutionary task allocation schemes are ***,extensive experiments are conducted based on real-world datasets in various *** with baseline algorithms,our proposed schemes enhance the quality of task completion by up to 25% and utilize 34% less average travel distance.

关键词： task allocation aggregation shortest path dual heterogeneous spatial crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：