AI千集
首页热点资讯知识笔记阅读频道关于我们知识库客户端下载
登录
  • 最新
  • 推荐
  • AI医疗
  • AI写作
  • AI应用
  • AI基础
  • AI量化
  • AI数据
  • AI画图
  • AIGC
  • 编程基础
  • 课程演讲
  • 资料仓库
  • 机器人操作系统ROS—使用Cartographer进行激光雷达SLAM建图

    openoker 2022-08-06 16:49:30 机器人 SLAMROS
    0 / 1841
  • Linux病毒扫描工具ClamAV在Ubuntu20.04的安装使用

    openoker 2022-07-30 14:10:52 编程基础 ClamAV杀毒软件
    0 / 2388
  • YLearn:因果学习算法工具

    openoker 2022-07-16 15:39:24 资料仓库 因果学习
    0 / 2418
  • Opensea 展示一个NFT时,需要解析的元数据是怎样的呢

    gingo 2022-06-10 14:08:00 AI数据
    0 / 1845
  • Seaport V2.0文档翻译

    gingo 2022-06-09 17:32:21 AI数据
    0 / 2501
  • VNC Viewer请求超时解决方案 、灰屏xfce4解决方案

    openoker 2022-06-05 14:17:22 资料仓库 VNC远程桌面
    0 / 2290
  • 在Ubuntu22.04安装cuda、cudnn及pytorch

    openoker 2022-06-03 22:35:23 资料仓库 cudaubuntugpu
    0 / 3046
  • Golang常用包

    openoker 2022-05-30 10:17:09 编程基础 Golang编程语言
    0 / 2408
  • 手把手指南:如何通过 OpenSea 零 GAS 创建 NFT?

    gingo 2022-05-20 14:52:09 AI数据
    0 / 1931
  • k8s之上部署fabric

    openoker 2022-05-12 16:15:23 AI数据 区块链
    0 / 1925
  • Ubuntu20.04搭建Hyperledger Fabric 2.2.2

    openoker 2022-05-11 16:50:16 AI数据 区块链
    0 / 1936
  • 解决ubuntu的Depends: libevent-2.1-6 (>= 2.1.8-stable) but it is not installable问题

    openoker 2022-05-06 11:04:09 编程基础 ubuntu
    0 / 3135
  • 解决Ubuntu的dpkg: error processing install-info问题

    openoker 2022-05-06 10:56:06 编程基础 ubuntu
    0 / 1891
  • 外卖套餐搭配的探索和应用

    openoker 2022-05-04 23:00:32 资料仓库 推荐系统
    0 / 1939
  • 数字孪生Python实战

    openoker 2022-05-02 11:52:02 AI数据 数字孪生
    1
    0 / 1905
  • grpc 使用(python,golang)

    openoker 2022-05-01 17:12:58 编程基础 grpc
    0 / 1978
  • Spark之MLlib

    openoker 2022-04-22 11:37:53 资料仓库 spark
    0 / 1601
  • 推荐系统概览

    openoker 2022-04-22 11:18:49 资料仓库 推荐系统
    0 / 1496
  • 机器学习平台架构实践--面向对象设计

    openoker 2022-04-22 10:29:47 资料仓库 机器学习平台
    0 / 1836
  • 机器学习平台架构实践--配置管理

    openoker 2022-04-22 10:25:45 资料仓库 机器学习平台
    0 / 1461
  • 机器学习平台架构实践--微服务

    openoker 2022-04-21 22:08:21 编程基础 机器学习平台
    0 / 1960
  • TensorFlow在美团外卖推荐场景的GPU训练优化实践

    openoker 2022-04-21 19:56:03 资料仓库 Tensorflow
    0 / 1892
  • Spark性能优化指南——高级篇

    openoker 2022-04-21 19:36:35 资料仓库 spark
    0 / 1875
  • Spark性能优化指南——基础篇

    openoker 2022-04-21 19:28:46 资料仓库 spark
    0 / 1825
  • 亿级数据Spark应用调优之旅

    openoker 2022-04-21 17:32:46 资料仓库 spark
    0 / 1934
  • FP-Growth原理

    openoker 2022-04-15 15:02:41 资料仓库 算法原理
    0 / 1966
  • 机器人时代的工业软件自主化,中国不能再错过!

    openoker 2022-04-14 15:21:47 机器人 仿真引擎
    0 / 1459
  • git push提示remote: fatal: Out of memory, malloc failed解决方法

    openoker 2022-04-12 10:44:15 编程基础 git
    0 / 1224
  • Python协程与异步编程

    openoker 2022-04-10 21:05:31 编程基础 python
    0 / 1244
  • zkRollup

    weilaiweiding 2022-04-08 16:55:49 AI数据
    0 / 1206
  • HDWallet 原理分析(zz)

    weilaiweiding 2022-04-06 15:45:22 AI数据
    0 / 1266
  • 商品数据化运营概述

    openoker 2022-04-06 13:49:39 AI应用 用户增长AI运营
    0 / 1540
  • 会员数据化运营概述

    openoker 2022-04-06 13:45:04 AI应用 用户增长用户画像运营
    0 / 1387
  • 从0到1搭建内容运营体系

    openoker 2022-04-06 10:41:22 AI应用 运营用户增长内容运营
    0 / 1433
  • MetaMask 常用网络列表添加,及Link添加

    gingo 2022-03-30 11:37:56 资料仓库
    0 / 2247
  • [Chainlink] 如何在Polygon上获取随机数

    gingo 2022-03-30 11:02:55 AI数据
    0 / 1381
  • 儿童版:人工智能学科

    gingo 2022-03-27 08:34:52 AI基础
    0 / 1272
  • 儿童版:怎样开展AI的学习?

    gingo 2022-03-27 08:11:13 AI基础
    0 / 1274
  • FFmpeg 官方文档

    openoker 2022-03-26 13:02:25 AI应用 视频工具
    1
    0 / 1722
  • MSys2安装QT5

    openoker 2022-03-22 23:14:54 编程基础 工具
    0 / 1590
  • 区块链数字钱包(zz)

    gingo 2022-03-22 18:16:49 AI数据
    0 / 1214
  • 动手搭建自定义AI图像生成器

    gingo 2022-03-01 17:43:00 AI基础 图像生成
    2
    0 / 1995
  • 构建自己的CodeBase

    openoker 2022-02-23 23:24:30 资料仓库 自动编程
    0 / 1545
  • 用 Python 模拟城市中的冠状病毒流行

    weilaiweiding 2022-02-14 10:55:59 资料仓库
    0 / 2176
  • Tensorflow2.0 大纲

    openoker 2022-01-24 13:58:03 资料仓库 Tensorflow
    1
    0 / 1504
  • Tensorflow2.0 数据处理

    openoker 2022-01-24 11:01:22 资料仓库 Tensorflow
    0 / 1765
  • Tensorflow2.0 语法

    openoker 2022-01-21 19:20:04 资料仓库 Tensorflow
    0 / 1853
  • Tensorflow2.0 特征处理

    openoker 2022-01-21 17:28:26 资料仓库 Tensorflow
    0 / 1984
  • Tensorflow2.0 GPU管理与分布式

    openoker 2022-01-21 17:19:09 资料仓库 Tensorflow
    0 / 1989
  • 什么是NFT?怎么找到稀有的nft?

    gingo 2022-01-11 15:31:11 AI数据
    1
    0 / 1421
上一页 下一页
  • 2
  • 3
  • 4
  • 5
  • 6
签到
立即签到
签到可以获得积分哦!
公告

AI千集是一个专注于科研服务的智能平台
在这里您可以获得本平台自训练的
科研智能体
和小伙伴一起玩转AI,做自己的AI机器人
来AI千集,赋能智慧快人一步
扫一扫,快速获取解决方案与报价
立即咨询

最新资讯更多
  • Deep Reinforcement learning (DRL) has achieved remarkable success in domains with well-defined reward structures, such as Atari games and locomotion. In contrast, dexterous manipulation lacks general-purpose reward formulations and typically depends on task-specific, handcrafted priors to guide hand-object interactions. We propose Contact Coverage-Guided Exploration (CCGE), a general exploration method designed for general-purpose dexterous manipulation tasks. CCGE represents contact state as the intersection between object surface points and predefined hand keypoints, encouraging dexterous hands to discover diverse and novel contact patterns, namely which fingers contact which object regions. It maintains a contact counter conditioned on discretized object states obtained via learned hash codes, capturing how frequently each finger interacts with different object regions. This counter is leveraged in two complementary ways:(1) to assign a count-based contact coverage reward that promotes exploration of novel contact patterns, and (2) an energy-based reaching reward that guides the agent toward under-explored contact regions. We evaluate CCGE on a diverse set of dexterous manipulation tasks, including cluttered object singulation, constrained object retrieval, in-hand reorientation, and bimanual manipulation. Experimental results show that CCGE substantially improves training efficiency and success rates over existing exploration methods, and that the contact patterns learned with CCGE transfer robustly to real-world robotic systems. Project page is
    喜欢 0    评论 0
  • Vision Language Models (VLMs) exhibit persistent hallucinations in counting tasks, with accuracy substantially lower than other visual reasoning tasks (excluding sentiment). This phenomenon persists even in state-of-the-art reasoning-capable VLMs. Conversely, CNN-based object detection models (ODMs) such as YOLO excel at spatial localization and instance counting with minimal computational overhead. We propose GroundCount, a framework that augments VLMs with explicit spatial grounding from ODMs to mitigate counting hallucinations. In the best case, our prompt-based augmentation strategy achieves 81.3% counting accuracy on the best-performing model (Ovis2.5-2B) - a 6.6pp improvement - while reducing inference time by 22% through elimination of hallucination-driven reasoning loops for stronger models. We conduct comprehensive ablation studies demonstrating that positional encoding is a critical component, being beneficial for stronger models but detrimental for weaker ones. Confidence scores, by contrast, introduce noise for most architectures and their removal improves performance in four of five evaluated models. We further evaluate feature-level fusion architectures, finding that explicit symbolic grounding via structured prompts outperforms implicit feature fusion despite sophisticated cross-attention mechanisms. Our approach yields consistent improvements across four of five evaluated VLM architectures (6.2--7.5pp), with one architecture exhibiting degraded performance due to incompatibility between its iterative reflection mechanisms and structured prompts. These results suggest that counting failures stem from fundamental spatial-semantic integration limitations rather than architecture-specific deficiencies, while highlighting the importance of architectural compatibility in augmentation strategies.
    喜欢 0    评论 0
  • The rapid evolution and inherent complexity of modern software requirements demand highly flexible and responsive development methodologies. While Agile frameworks have become the industry standard for prioritizing iteration, collaboration, and adaptability, software development teams continue to face persistent challenges in managing constantly evolving requirements and maintaining product quality under tight deadlines. This article explores the intersection of Artificial Intelligence (AI) and Software Engineering (SE), to analyze how AI serves as a powerful catalyst for enhancing agility and fostering innovation. The research combines a comprehensive review of existing literature with an empirical study, utilizing a survey directed at Software Engineering professionals to assess the perception, adoption, and impact of AI-driven tools. Key findings reveal that the integration of AI (specifically through Machine Learning (ML) and Natural Language Processing (NLP) )facilitates the automation of tedious tasks, from requirement management to code generation and testing . This paper demonstrates that AI not only optimizes current Agile practices but also introduces new capabilities essential for sustaining quality, speed, and innovation in the future landscape of software development.
    喜欢 0    评论 0
  • Human uplift studies - or studies that measure AI effects on human performance relative to a status quo, typically using randomized controlled trial (RCT) methodology - are increasingly used to inform deployment, governance, and safety decisions for frontier AI systems. While the methods underlying these studies are well-established, their interaction with the distinctive properties of frontier AI systems remains underexamined, particularly when results are used to inform high-stakes decisions. We present findings from interviews with 16 expert practitioners with experience conducting human uplift studies in domains including biosecurity, cybersecurity, education, and labor. Across interviews, experts described a recurring tension between standard causal inference assumptions and the object of study itself. Rapidly evolving AI systems, shifting baselines, heterogeneous and changing user proficiency, and porous real-world settings strain assumptions underlying internal, external, and construct validity, complicating the interpretation and appropriate use of uplift evidence. We synthesize these challenges across key stages of the human uplift research lifecycle and map them to practitioner-reported solutions, clarifying both the limits and the appropriate uses of evidence from human uplift studies in high-stakes decision-making.
    喜欢 0    评论 0
  • VLMs have become increasingly proficient at a range of computer vision tasks, such as visual question answering and object detection. This includes increasingly strong capabilities in the domain of art, from analyzing artwork to generation of art. In an interdisciplinary collaboration between computer scientists and art historians, we characterize the mechanisms underlying VLMs' ability to predict artistic style and assess the extent to which they align with the criteria art historians use to reason about artistic style. We employ a latent-space decomposition approach to identify concepts that drive art style prediction and conduct quantitative evaluations, causal analysis and assessment by art historians. Our findings indicate that 73% of the extracted concepts are judged by art historians to exhibit a coherent and semantically meaningful visual feature and 90% of concepts used to predict style of a given artwork were judged relevant. In cases where an irrelevant concept was used to successfully predict style, art historians identified possible reasons for its success; for example, the model might "understand" a concept in more formal terms, such as dark/light contrasts.
    喜欢 0    评论 0
  • We present IsalGraph, a method for representing the structure of any finite, simple graph as a compact string over a nine-character instruction alphabet. The encoding is executed by a small virtual machine comprising a sparse graph, a circular doubly-linked list (CDLL) of graph-node references, and two traversal pointers. Instructions either move a pointer through the CDLL or insert a node or edge into the graph. A key design property is that every string over the alphabet decodes to a valid graph, with no invalid states reachable. A greedy \emph{GraphToString} algorithm encodes any connected graph into a string in time polynomial in the number of nodes; an exhaustive-backtracking variant produces a canonical string by selecting the lexicographically smallest shortest string across all starting nodes and all valid traversal orders. We evaluate the representation on five real-world graph benchmark datasets (IAM Letter LOW/MED/HIGH, LINUX, and AIDS) and show that the Levenshtein distance between IsalGraph strings correlates strongly with graph edit distance (GED). Together, these properties make IsalGraph strings a compact, isomorphism-invariant, and language-model-compatible sequential encoding of graph structure, with direct applications in graph similarity search, graph generation, and graph-conditioned language modelling
    喜欢 0    评论 0
积分排行
  • gingo

    104 帖子 • 8 评论

    1431
  • 137****0631

    0 帖子 • 0 评论

    997
  • weilaiweiding

    52 帖子 • 1 评论

    821
  • icodebase

    59 帖子 • 1 评论

    537
  • openoker

    171 帖子 • 23 评论

    298
  • 188****2791

    0 帖子 • 0 评论

    180
  • boatingman

    0 帖子 • 1 评论

    90
  • toc

    0 帖子 • 0 评论

    60
  • Van

    3 帖子 • 0 评论

    42
  • shadow

    5 帖子 • 0 评论

    28
友情链接 查看更多>>
  • 导航

    打造最强静态导航网站

  • 135AI排版

    公众号智能文案生成与自动排版工具

  • 二次元数字人视频生成平台

    二次元数字人视频生成平台

关于 标签 友链
粤ICP备18152112号 网信算备330110507206401230035号 粤公网安备44030302001590号 © 2018-2025 AI千集 All Rights Reserved