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

arXiv 2025年

作者： Shuai, Yinghao Yu, Ran Chen, Yuantao Jiang, Zijian Song, Xiaowei Wang, Nan Zheng, Jv Ma, Jianzhu Yang, Meng Wang, Zhicheng Ding, Wenbo Zhao, Hao School of Computer Science and Technology Tongji University China Shenzhen Ubiquitous Data Enabling Key Lab Shenzhen International Graduate School Tsinghua University Shenzhen518055 China The Chinese University of Hong Kong Shenzhen China MGI Tech Shenzhen518083 China Chulalongkorn University Bangkok10330 Thailand Tsinghua University China China Lightwheel AI

Current robotic systems can understand the categories and poses of objects well. But understanding physical properties like mass, friction, and hardness, in the wild, remains challenging. We propose a new method that reconstructs 3D objects using the Gaussian splatting representation and predicts various physical properties in a zero-shot manner. We propose two techniques during the reconstruction phase: a geometry-aware regularization loss function to improve the shape quality and a region-aware feature contrastive loss function to promote region affinity. Two other new techniques are designed during inference: a feature-based property propagation module and a volume integration module tailored for the Gaussian representation. Our framework is named as zero-shot physical understanding with Gaussian splatting, or PUGS. PUGS achieves new state-of-the-art results on the standard benchmark of ABO-500 mass prediction. We provide extensive quantitative ablations and qualitative visualization to demonstrate the mechanism of our designs. We show the proposed methodology can help address challenging real-world grasping tasks. Our codes, data, and models are available at https://***/EverNorif/PUGS © 2025, CC BY.

关键词： Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

A survey on multimodal large language models

引用

National science Review 2024年第12期11卷 277-296页

作者： Shukang Yin Chaoyou Fu Sirui Zhao Ke Li Xing Sun Tong Xu Enhong Chen School of Artificial Intelligence and Data Science University of Science and Technology of China State Key Laboratory for Novel Software Technology Nanjing University School of Intelligence Science and Technology Nanjing University Tencent YouTu Lab

Recently, the multimodal large language model(MLLM) represented by GPT-4V has been a new rising research hotspot, which uses powerful large language models(LLMs) as a brain to perform multimodal tasks. The surprising emergent capabilities of the MLLM, such as writing stories based on images and optical character recognition–free math reasoning, are rare in traditional multimodal methods, suggesting a potential path to artificial general intelligence. To this end, both academia and industry have endeavored to develop MLLMs that can compete with or even outperform GPT-4V, pushing the limit of research at a surprising speed. In this paper, we aim to trace and summarize the recent progress of MLLMs. First, we present the basic formulation of the MLLM and delineate its related concepts, including architecture,training strategy and data, as well as evaluation. Then, we introduce research topics about how MLLMs can be extended to support more granularity, modalities, languages and scenarios. We continue with multimodal hallucination and extended techniques, including multimodal in-context learning, multimodal chain of thought and LLM-aided visual reasoning. To conclude the paper, we discuss existing challenges and point out promising research directions.

关键词： multimodal large language model vision language model large language model

来源：评论

学校读者我要写书评

暂无评论

Sparse word embeddings using l1 regularized online learning 25

Sparse word embeddings using l1 regularized online learning

引用

25th International Joint Conference on Artificial Intelligence, IJCAI 2016

作者： Sun, Fei Guo, Jiafeng Lan, Yanyan Xu, Jun Xueqi, Cheng CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

Recently, Word2Vec tool has attracted a lot of interest for its promising performances in a variety of natural language processing (NLP) tasks. However, a critical issue is that the dense word representations learned in Word2Vec are lacking of interpretability. It is natural to ask if one could improve their interpretability while keeping their performances. Inspired by the success of sparse models in enhancing interpretability, we propose to introduce sparse constraint into Word2Vec. Specifically, we take the Continuous Bag of Words (CBOW) model as an example in our study and add the l regularizer into its learning objective. One challenge of optimization lies in that stochastic gradient descent (SGD) cannot directly produce sparse solutions with l regularizer in online training. To solve this problem, we employ the Regularized Dual Averaging (RDA) method, an online optimization algorithm for regularized stochastic learning. In this way, the learning process is very efficient and our model can scale up to very large corpus to derive sparse word representations. The proposed model is evaluated on both expressive power and interpretability. The results show that, compared with the original CBOW model, the proposed model can obtain state-of-the-art results with better interpretability using less than 10% non-zero elements.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Analysis and improvement of a provable secure fuzzy identity-based signature scheme

引用

science China(Information sciences) 2014年第9期57卷 156-160页

作者： XIONG Hu CHEN YaNan ZHU GuoBin QIN ZhiGuang School of Computer Science and Engineering University of Electronic Science and Technology of China Chongqing Key Lab of Computer Network and Communication Technology Key Lab of Network Security and Cryptology Fujian Normal University School of Traffic and Transportation Beijing Jiaotong University

To enjoy the property of error tolerance in the biometric identities extraction,the fuzzy identitybased signature has been initialized to issue a signature on behalf of a descriptive attributes setωinstead of a single *** attributes setω′can be used to verify the validity of the signature in case the distance betweenωandω′is less than a pre-defined ***,Wang re-formalized the notion of fuzzy identitybased signature and proposed a concrete pairing-based construction along with the efficiency analysis and formal security ***,by giving concrete attack,we indicate that Wang’s scheme is not secure against forgery *** also present an improved scheme to prevent this attack.

关键词： identity-based cryptosystem fuzzy identity-based signature forgery attack cryptanalysis bilinear pairings

来源：评论

学校读者我要写书评

暂无评论

Virtual node based adaptive routing in wireless ad hoc networks

引用

中国高等学校学术文摘·计算机科学 2009年第4期3卷 535-542页

作者： Gang LI Hongmei SUN Key Lab of Network Science and Technology Institute of Computing TechnologyChinese Academy of SciencesBeijing 100080China Communications Technology Lab Intel China Research CenterBeijing 100080China

It is a challenge to make the routes quickly adapt to the changed network topology when nodes fail in a wireless ad hoc *** this paper,we propose an adaptive routing protocol,which groups the network nodes into virtual nodes according to their data transfer capabilities and creates virtual-node-based *** protocol can accommodate the routes to node failures by adaptively updating the virtual nodes and just-in-time using available nodes during data *** simulations indicate that the proposed protocol can keep the routes failed-node-free when the available virtual node members cover the failed nodes scattering area.

关键词： wireless ad hoc networks mobile ad hoc networks route protocols adaptability route repair

来源：评论

学校读者我要写书评

暂无评论

PRAD: Periapical Radiograph Analysis dataset and Benchmark Model Development

arXiv

引用

arXiv 2025年

作者： Zhou, Zhenhuan Zhang, Yuchen Xu, Ruihong Zhao, Xuansen Li, Tao College of Computer Science Nankai University Tianjin300350 China Key Laboratory of Data and Intelligent System Security Ministry of Education China Department of stomatology Tianjin Union Medical Center The First Affiliated Hospital of Nankai University Tianjin300121 China College of Mechanical Engineering Taiyuan University of Technology Shanxi 030000 China Haihe Lab of ITAI Tianjin300459 China

Deep learning (DL), a pivotal technology in artificial intelligence, has recently gained substantial traction in the domain of dental auxiliary diagnosis. However, its application has predominantly been confined to imaging modalities such as panoramic radiographs and Cone Beam Computed Tomography, with limited focus on auxiliary analysis specifically targeting Periapical Radiographs (PR). PR are the most extensively utilized imaging modality in endodontics and periodontics due to their capability to capture detailed local lesions at a low cost. Nevertheless, challenges such as resolution limitations and artifacts complicate the annotation and recognition of PR, leading to a scarcity of publicly available, large-scale, high-quality PR analysis datasets. This scarcity has somewhat impeded the advancement of DL applications in PR analysis. In this paper, we present PRAD-10K, a dataset for PR analysis. PRAD-10K comprises 10,000 clinical periapical radiograph images, with pixel-level annotations provided by professional dentists for nine distinct anatomical structures, lesions, and artificial restorations or medical devices, We also include classification labels for images with typical conditions or lesions. Furthermore, we introduce a DL network named PRNet to establish benchmarks for PR segmentation tasks. Experimental results demonstrate that PRNet surpasses previous state-of-the-art medical image segmentation models on the PRAD-10K dataset. The codes and dataset will be made publicly available. © 2025, CC BY-NC-ND.

关键词： Dental orthoses

来源：评论

学校读者我要写书评

暂无评论

Density PSO-based software module clustering algorithm

引用

The Journal of China Universities of Posts and Telecommunications 2018年第4期25卷 38-47页

作者： Sun Jiaze Ling Beilei School of Computer Science and Technology Xi'an University of Posts and Telecommunications Shaanxi Key Laboratory of Network Data Intelligent Processing Xi'an University of Posts and Telecommunications

Software module clustering is to divide the complex software system into many subsystems to enhance the intelligibility and maintainability of software systems. To increase convergence speed and optimize clustering solution,density PSO-based( DPSO) software module clustering algorithm is proposed. Firstly,the software system is converted into complex network diagram,and then the particle swarm optimization( PSO) algorithm is *** shortest path method is used to initialize the swarm,and the probability selection approach is used to update the particle positions. Furthermore,density-based modularization quality( DMQ) function is designed to evaluate the clustering quality. Five typical open source projects are selected as benchmark programs to verify the efficiency of the DPSO algorithm. Hill climbing( HC) algorithm,genetic algorithm( GA),PSO and DPSO algorithm are compared in the modularization quality( MQ) and DMQ. The experimental results show that the DPSO is more stable and more convergent than the other three traditional algorithms. The DMQ standard is more reasonable than MQ standard in guiding software module clustering.

关键词： software module clustering complex network PSO MQ modularity density

来源：评论

学校读者我要写书评

暂无评论

An ensemble method for job recommender systems 10

An ensemble method for job recommender systems

引用

10th ACM Conference on Recommender Systems Challenge, RecSys Challenge 2016

作者： Zhang, Chenrui Cheng, Xueqi CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781450348010

In this paper, we present an ensemble method for job recommendation to ACM RecSys Challenge 2016. Given a user, the goal of a job recommendation system is to predict those job postings that are likely to be relevant to the user1. Firstly, we analyze the train dataset and find several interesting patterns. Secondly, we describe our solution, which is an ensemble of two filters, combining the merits of traditional collaborative filtering and content-based filtering. Our approach finally achieved a score of 1632828.82, ranked at the 10th place on the public leaderboard. © 2016 ACM.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Dynamic-K recommendation with personalized decision boundary 23rd

Dynamic-K recommendation with personalized decision boundary

引用

23rd China conference on Information Retrieval, CCIR 2017

作者： Gao, Yan Guo, Jiafeng Lan, Yanyan Liao, Huaming CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783319686981

In this paper, we investigate the recommendation task in the most common scenario with implicit feedback (e.g., clicks, purchases). State-of-the-art methods in this direction usually cast the problem as to learn a personalized ranking on a set of items (e.g., webpages, products). The top-N results are then provided to users as recommendations, where the N is usually a fixed number pre-defined by the system according to some heuristic criteria (e.g., page size, screen size). There is one major assumption underlying this fixed-number recommendation scheme, i.e., there are always sufficient relevant items to users’ preferences. Unfortunately, this assumption may not always hold in real-world scenarios. In some applications, there might be very limited candidate items to recommend, and some users may have very high relevance requirement in recommendation. In this way, even the top-1 ranked item may not be relevant to a user’s preference. Therefore, we argue that it is critical to provide a dynamic-K recommendation, where the K should be different with respect to the candidate item set and the target user. We formulate this dynamic-K recommendation task as a joint learning problem with both ranking and classification objectives. The ranking objective is the same as existing methods, i.e., to create a ranking list of items according to users’ interests. The classification objective is unique in this work, which aims to learn a personalized decision boundary to differentiate the relevant items from irrelevant items. Based on these ideas, we extend two state-of-the-art ranking-based recommendation methods, i.e., BPRMF and HRM, to the corresponding dynamic-K versions, namely DK-BPRMF and DK-HRM. Our experimental results on two datasets show that the dynamic-K models are more effective than the original fixed-N recommendation methods. © Springer International Publishing AG 2017.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Efficient Adaptive label Refinement for label Noise Learning

arXiv

引用

arXiv 2025年

作者： Zhang, Wenzhen Cheng, Debo Lu, Guangquan Zhou, Bo Li, Jiaye Zhang, Shichao School of Computer Science and Engineering Guangxi Normal University Guangxi Guilin541004 China Guangxi Key Lab of Multi-Source Information Mining & Security Guangxi Normal University Guangxi Guilin541004 China Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guangxi Guilin541004 China UniSA STEM University of South Australia AdelaideSA5095 Australia Guangxi Collaborative Innovation Center of Modern Sericulture and Silk Hechi University Guangxi Hechi546300 China The State Key Laboratory of Blockchain and Data Security Zhejiang University Zhejiang Hangzhou310027 China

Deep neural networks are highly susceptible to overfitting noisy labels, which leads to degraded performance. Existing methods address this issue by employing manually defined criteria, aiming to achieve optimal partitioning in each iteration to avoid fitting noisy labels while thoroughly learning clean samples. However, this often results in overly complex and difficult-to-train models. To address this issue, we decouple the tasks of avoiding fitting incorrect labels and thoroughly learning clean samples and propose a simple yet highly applicable method called Adaptive label Refinement (ALR). First, inspired by label refurbishment techniques, we update the original hard labels to soft labels using the model’s predictions to reduce the risk of fitting incorrect labels. Then, by introducing the entropy loss, we gradually ‘harden’ the high-confidence soft labels, guiding the model to better learn from clean samples. This approach is simple and efficient, requiring no prior knowledge of noise or auxiliary datasets, making it more accessible compared to Copyright © 2025, The Authors. All rights reserved.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：