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

32nd ACM International Conference on Multimedia, MM 2024

作者： Jia, Chengyou Luo, Minnan Chang, Xiaojun Dang, Zhuohang Han, Mingfei Wang, Mengmeng Dai, Guang Dang, Sizhe Wang, Jingdong School of Computer Science and Technology MOEKLINNS Lab Xi'an Jiaotong University Shaanxi Xi'an China University of Science and Technology of China Anhui Hefei China School of Computer Science and Technology Xi'an Jiaotong University Shaanxi Xi'an China ReLER Lab AAII University of Technology Sydney SydneyNSW Australia Zhejiang University of Technology College of Computer Science and Technology China SGIT AI Lab State Grid Corporation of China Beijing China Baidu Inc Beijing China United Arab Emirates Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Xi'an710049 China SGIT AI Lab State Grid Corporation of China China School of Computer Science and Technology Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi'an Jiaotong University Xi'an710049 China

ISBN: (纸本)9798400706868

Exploring open-vocabulary video action recognition is a promising venture, which aims to recognize previously unseen actions within any arbitrary set of categories. Existing methods typically adapt pretrained image-text models to the video domain, capitalizing on their inherent strengths in generalization. A common thread among such methods is the augmentation of visual embeddings with temporal information to improve the recognition of seen actions. Yet, they compromise with standard less-informative action descriptions, thus faltering when confronted with novel actions. Drawing inspiration from human cognitive processes, we argue that augmenting text embeddings with human prior knowledge is pivotal for open-vocabulary video action recognition. To realize this, we innovatively blend video models with Large Language Models (LLMs) to devise Action-conditioned Prompts. Specifically, we harness the knowledge in LLMs to produce a set of descriptive sentences that contain distinctive features for identifying given actions. Building upon this foundation, we further introduce a multi-modal action knowledge alignment mechanism to align concepts in video and textual knowledge encapsulated within the prompts. Extensive experiments on various video benchmarks, including zero-shot, few-shot, and base-to-novel generalization settings, demonstrate that our method not only sets new SOTA performance but also possesses excellent interpretability. © 2024 ACM.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Automatic Diagnosis of Glaucoma on Color Fundus Images Using Adaptive Mask Deep Network 1

引用

27th International Conference on MultiMedia Modeling, MMM 2021

作者： Yang, Gang Li, Fan Ding, Dayong Wu, Jun Xu, Jie Key Lab of Data Engineering and Knowledge Engineering Beijing China School of Information Renmin University of China Beijing China Vistel Inc. Beijing China School of Electronics and Information Northwestern Polytechnical University Xi’an China Beijing Tongren Hospital Beijing China

ISBN: (数字)9783030678357

ISBN: (纸本)9783030678340

Glaucoma, a disease characterized by the progressive and irreversible defect of the visual field, requires a lifelong course of treatment once it is confirmed, which highlights the importance of glaucoma early detection. Due to the diversity of glaucoma diagnostic indicators and the diagnostic uncertainty of ophthalmologists, deep learning has been applied to glaucoma diagnosis by automatically extracting characteristics from color fundus images, and that has achieved great performance recently. In this paper, we propose a novel adaptive mask deep network to obtain effective glaucoma diagnosis on retinal fundus images, which fully utilizes the prior knowledge of ophthalmologists on glaucoma diagnosis to synthesize attention masks of color fundus images to locate a reasonable region of interest. Based on the synthesized masks, our method could pay careful attention to the effective visual representation of glaucoma. Experiments on several public and private fundus datasets illustrate that our method could focus on the significant area of glaucoma diagnosis and simultaneously achieve great performance in both academic environments and practical medical applications, which provides a useful contribution to improve the automatic diagnosis of glaucoma. © 2021, Springer Nature Switzerland AG.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

SP3: Enhancing Structured Pruning via PCA Projection

arXiv

引用

arXiv 2023年

作者： Hu, Yuxuan Zhang, Jing Zhao, Zhe Zhao, Chen Chen, Xiaodong Li, Cuiping Chen, Hong School of Information Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering MOE China Engineering Research Center of Database and Business Intelligence MOE China Tencent AI Lab Tencent Beijing China School of Computer Science and Technology Xi'an Jiaotong University Xi'An China

Structured pruning is a widely used technique for reducing the size of pre-trained language models (PLMs), but current methods often overlook the potential of compressing the hidden dimension (d) in PLMs, a dimension critical to model size and efficiency. This paper introduces a novel structured pruning approach, Structured Pruning with PCA Projection (SP3), targeting the effective reduction of d by projecting features into a space defined by principal components before masking. Extensive experiments on benchmarks (GLUE and SQuAD) show that SP3 can reduce d by 70%, compress 94% of the BERTbase model, and maintain over 96% accuracy and outperform other methods that compress d by 6% in accuracy at the same compression ratio. SP3 has also proven effective with other models, including OPT and Llama. Our data and code are available at ours repo. © 2023, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

QGEval: Benchmarking Multi-dimensional Evaluation for Question Generation

arXiv

引用

arXiv 2024年

作者： Fu, Weiping Wei, Bifan Hu, Jianxiang Cai, Zhongmin Liu, Jun School of Computer Science and Technology Xi’an Jiaotong University Xi’an China School of Continuing Education Xi’an Jiaotong University Xi’an China MOE KLINNS Lab School of Automation Science and Engineering Xi’an Jiaotong University Xi’an China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Xi’an China

Automatically generated questions often suffer from problems such as unclear expression or factual inaccuracies, requiring a reliable and comprehensive evaluation of their quality. Human evaluation is widely used in the field of question generation (QG) and serves as the gold standard for automatic metrics. However, there is a lack of unified human evaluation criteria, which hampers consistent and reliable evaluations of both QG models and automatic metrics. To address this, we propose QGEval, a multi-dimensional Evaluation benchmark for Question Generation, which evaluates both generated questions and existing automatic metrics across 7 dimensions: fluency, clarity, conciseness, relevance, consistency, answerability, and answer consistency. We demonstrate the appropriateness of these dimensions by examining their correlations and distinctions. Through consistent evaluations of QG models and automatic metrics with QGEval, we find that 1) most QG models perform unsatisfactorily in terms of answerability and answer consistency, and 2) existing metrics fail to align well with human judgments when evaluating generated questions across the 7 dimensions. We expect this work to foster the development of both QG technologies and their evaluation. Copyright © 2024, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

What matters for ad-hoc video search? A large-scale evaluation on TRECVID

arXiv

引用

arXiv 2021年

作者： Chen, Aozhu Hu, Fan Wang, Zihan Zhou, Fangming Li, Xirong AIMC Lab. School of Information Renmin University of China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China

For quantifying progress in Ad-hoc Video Search (AVS), the annual TRECVID AVS task is an important international evaluation. Solutions submitted by the task participants vary in terms of their choices of cross-modal matching models, visual features and training data. As such, what one may conclude from the evaluation is at a high level that is insufficient to reveal the influence of the individual components. In order to bridge the gap between the current solution-level comparison and the desired component-wise comparison, we propose in this paper a large-scale and systematic evaluation on TRECVID. By selected combinations of state-of-the-art matching models, visual features and (pre-)training data, we construct a set of 25 different solutions and evaluate them on the TRECVID AVS tasks 2016–2020. The presented evaluation helps answer the key question of what matters for AVS. The resultant observations and learned lessons are also instructive for developing novel AVS solutions. Copyright © 2021, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improved Bounds for Sampling Solutions of Random CNF Formulas

arXiv

引用

arXiv 2022年

作者： He, Kun Wu, Kewen Yang, Kuan The Key Lab of Data Engineering and Knowledge Engineering MOE Renmin University of China China University of California at Berkeley United States John Hopcroft Center for Computer Science Shanghai Jiao Tong University China

Let Φ be a random k-CNF formula on n variables and m clauses, where each clause is a disjunction of k literals chosen independently and uniformly. Our goal is to sample an approximately uniform solution of Φ (or equivalently, approximate the partition function of Φ). Let α = m/n be the density. The previous best algorithm runs in time npoly(k,α) for any α 2k/300 [Galanis, Goldberg, Guo, and Yang, SIAM J. Comput.'21]. Our result significantly improves both bounds by providing an almost-linear time sampler for any α 2k/3. The density α captures the average degree in the random formula. In the worst-case model with bounded maximum degree, current best efficient sampler works up to degree bound 2k/5 [He, Wang, and Yin, FOCS'22 and SODA'23], which is, for the first time, superseded by its average-case counterpart due to our 2k/3 bound. Our result is the first progress towards establishing the intuition that the solvability of the average-case model (random k-CNF formula with bounded average degree) is better than the worst-case model (standard k-CNF formula with bounded maximal degree) in terms of sampling solutions. Copyright © 2022, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Scientific Value Weights more than Being Open or Toll Access:An analysis of the OA advantage in Nature and Science

引用

Journal of data and Information Science 2021年第4期6卷 62-75页

作者： Howell Y.Wang Shelia X.Wei Cong Cao Xianwen Wang Fred Y.Ye International Joint Informatics Laboratory&Jiangsu Key Laboratory of Data Engineering and Knowledge Service School of Information ManagementNanjing UniversityNanjing 210023China Nottingham University Business School China University of Nottingham Ningbo ChinaNingbo315100China WISE Lab. Dalian University of TechnologyDalian 116024China

Purpose:We attempt to find out whether OA or TA really affects the dissemination of scientific ***/methodology/approach:We design the indicators,hot-degree,and R-index to indicate a topic OA or TA ***,according to the OA classification of the Web of Science(WoS),we collect data from the WoS by downloading OA and TA articles,letters,and reviews published in Nature and Science during 2010–*** papers are divided into three broad disciplines,namely biomedicine,physics,and ***,taking a discipline in a journal and using the classical Latent Dirichlet Allocation(LDA)to cluster 100 topics of OA and TA papers respectively,we apply the Pearson correlation coefficient to match the topics of OA and TA,and calculate the hot-degree and R-index of every OA-TA topic ***,characteristics of the discipline can be *** qualitative comparison,we choose some high-quality papers which belong to Nature remarkable papers or Science breakthroughs,and analyze the relations between OA/TA and citation ***:The result shows that OA hot-degree in biomedicine is significantly greater than that of TA,but significantly less than that of TA in *** on the R-index,it is found that OA advantages exist in biomedicine and TA advantages do in ***,the dissemination of average scientific discoveries in all fields is not necessarily affected by OA or ***,OA promotes the spread of important scientific discoveries in high-quality *** limitations:We lost some citations by ignoring other open sources such as arXiv and *** limitation came from that Nature employs some strong measures for access-promoting subscription-based articles,on which the boundary between OA and TA became *** implications:It is useful to select hot topics in a set of publications by the hotdegree *** finding comprehensively reflects the differences of OA and TA in different disciplines,which is a u

关键词： Open access Toll access Scientific discovery Academic dissemination data analysis

来源：评论

学校读者我要写书评

暂无评论

A Lightening Fine-grained Access Control Scheme Supporting Full Policy Hiding in Cloud Storage

A Lightening Fine-grained Access Control Scheme Supporting F...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Jiaoli Shi Chao Hu Shimao Yao Zhuolin Mei Bin Wu Hui Li School of Computer and Big Data Jiujiang Univ. Jiujiang China School of Software IoT Engineering Jiangxi Univ. of Finance and Economics Nanchang China Jiujiang Key Lab. of Network and Information Security Jiujiang China School of Computer and Big Data Jiujiang University Jiujiang China School of Elec. and Comp. Engineering Peking University Shenzhen China

Efficiency, security, and flexibility are difficult to balance in a full policy hiding CP-ABE scheme. This paper creatively converts the privacy matching problem of access policy and a user’s private key to the privacy three-party set computation problem. Then the new privacy set computation problem is resolved by a message driven key generation method. Additionally, the ROBDD (Reduced Ordered Binary Decision Diagrams) is utilized to rich access structure expression and convert access policies into feasible path sets. Each feasible path is composed of attributes and these attributes are bound to the ciphertext using CP-ABE. Based on the innovative ideas mentioned above, we present a Lighten Fine-grained Access Control scheme supporting Full Policy Hidden (LFAC-FPH) that integrates data confidentiality protection, access policy rich expression but complete hiding, fine-grained access control, and lightweight terminal computing. Our scheme has three advantages: 1) High Efficiency. The proposed scheme can achieve fast privacy matching of access policies during user decryption. 2) Full Policy Hiding. The access policy bound by an owner on the ciphertext does not leak any information. Moreover, a user cannot know attributes they do not own. 3) High Flexibility. The decryption process does not require online from owners or KGC, and system attributes can be added at any time.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Contrastive Coding for Active Learning under Class Distribution Mismatch

Contrastive Coding for Active Learning under Class Distribut...

引用

International Conference on Computer Vision (ICCV)

作者： Pan Du Suyun Zhao Hui Chen Shuwen Chai Hong Chen Cuiping Li Key Lab of Data Engineering and Knowledge Engineering of MOE Renmin University of China Beijing China Renmin University of China Beijing China

ISBN: (纸本)9781665428132

Active learning (AL) is successful based on the assumption that labeled and unlabeled data are obtained from the same class distribution. However, its performance deteriorates under class distribution mismatch, wherein the un-labeled data contain many samples out of the class distribution of labeled data. To effectively handle the problems under class distribution mismatch, we propose a contrastive coding based AL framework named CCAL. Unlike the existing AL methods that focus on selecting the most informative samples for annotating, CCAL extracts both semantic and distinctive features by contrastive learning and combines them in a query strategy to choose the most informative un-labeled samples with matched categories. Theoretically, we prove that the AL error of CCAL has a tight upper bound. Experimentally, we evaluate its performance on CIFAR10, CIFAR100, and an artificial cross-dataset that consists of five datasets; consequently, CCAL achieves state-of-the-art performance by a large margin with remarkably lower annotation cost. To the best of our knowledge, CCAL is the first work related to AL for class distribution mismatch.

关键词： Computer vision Costs Upper bound Annotations Semantics Text categorization Computer architecture

来源：评论

学校读者我要写书评

暂无评论

SAMPLING LOVÁSZ LOCAL LEMMA FOR GENERAL CONSTRAINT SATISFACTION SOLUTIONS IN NEAR-LINEAR TIME

arXiv

引用

arXiv 2022年

作者： He, Kun Wang, Chunyang Yin, Yitong The Key Lab of Data Engineering and Knowledge Engineering MOE Renmin University of China No. 59 Zhongguancun Street Haidian District Beijing China State Key Laboratory for Novel Software Technology Nanjing University 163 Xianlin Avenue Jiangsu Province Nanjing China

We give a fast algorithm for sampling uniform solutions of general constraint satisfaction problems (CSPs) in a local lemma regime. Suppose that the CSP has n variables with domain size at most q, each constraint contains at most k variables, shares variables with at most Δ constraints, and is violated with probability at most p by a uniform random assignment. The algorithm returns an almost uniform satisfying assignment in expected poly(q,k, Δ) ·(n) time, as long as a local lemma condition is satisfied: k · p · q2 · Δ5 ≤ C0 for a suitably small absolute constant C0. Previously, under similar local lemma conditions, sampling algorithms with running time polynomial in both nand Δ were only known for the almost atomic case, where each constraint is violated by a small number of forbidden local configurations. The key term Δ5 in our local lemma condition also improves the previously best known Δ7 for general CSPs [JPV21b] and Δ5.714 for atomic CSPs, including the special case of k-CNF [JPV21a, HSW21]. Our sampling approach departs from previous fast algorithms for sampling LLL, which were based on Markov chains. A crucial step of our algorithm is a recursive marginal sampler that is of independent interests. Within a local lemma regime, this marginal sampler can draw a random value for a variable according to its marginal distribution, at a cost independent of the size of the CSP. Copyright © 2022, The Authors. All rights reserved.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：