Mcp Servers

Mcp Servers에 대해 3개 실제 데이터 소스에서 20개 공개 신호를 찾았습니다. GitHub 10건, Hacker News 0건, arXiv 10건을 원문 링크와 함께 보여줍니다.

검색 결과 보기

토픽 정보

이름
Mcp Servers
Slug
mcp-servers
관련 키워드
and, the, mcp, for, servers, server, vla, agents
최근 7일 변화
MVP에서는 실시간 검색 결과 기반 점수만 계산합니다. DB snapshot 저장 후 추세가 표시됩니다.
마지막 업데이트
2026-11-21T07:24:17.015Z

출처별 최신 반응

Empirical Assessment of Post-Quantum Cryptography Adoption Status in TLS

Anticipating Q-day security concerns, major CDNs and cloud providers are migrating to post-quantum cryptography (PQC). While existing literature benchmarks PQC performance, empirical research evaluating real-world adoption data remains scarce. We present an empirical assessment of PQC deployment across seven critical protocols (HTTPS, LDAPS, SMTPS, IMAP-SSL, POP3-SSL, TELNETS, and RDP) using 10,000 target IP addresses per protocol. At the origin-server level, PQC algorithm support reaches 9.1% for HTTPS and 7.39%...

arxiv · 원본 ID http://arxiv.org/abs/2611.09707v1

Breaking the Privacy Promise: Gradient Inversion Attacks on Federated Low-Rank Adapted Vision Transformers

Parameter-efficient fine-tuning (PEFT) has been increasingly adopted to fine-tune pretrained models with low computational cost and is therefore also preferred in the federated learning paradigm to reduce computational and communication overhead. In this work, we investigate the sparsely explored problem of the risk of private data leakage in LoRA-adapted Vision Transformers (ViTs), where low-rank updates weaken the gradient signal available to a server with access to individual client updates. We show that qualit...

arxiv · 원본 ID http://arxiv.org/abs/2611.09652v1

Capacity of Generic Symmetric Distributed Linear Computation: The Geometry of Relations

In distributed linear computation, $K$ users observe linear functions of common finite-field data and send separate messages to a server that wants another linear function. We characterize the generic capacity $C$, the minimum total number of field symbols sent per computed instance, when all observations and the demand have dimension $ν$, the data have dimension $μ$, and the coefficients of these linear functions are drawn independently and uniformly from the field and stay fixed during coding, with the field siz...

arxiv · 원본 ID http://arxiv.org/abs/2611.09636v1

SafeOrchestrate: Runtime Checked Intent-Driven Orchestration for Cyber-Physical Systems

Modern cyber physical systems (CPS) integrate heterogeneous sensors, actuators, controllers, and services, composed at runtime rather than at design time. Orchestrating such systems through natural language (NL) is attractive, but unconstrained large language model (LLM) tool use is risky because actions must respect device capabilities, runtime state, and safety constraints. We present Safe Orchestrate, a reference architecture for runtime checked, intent driven CPS orchestration. Given an NL intent, it derives a...

arxiv · 원본 ID http://arxiv.org/abs/2611.09364v1

Wake 5: A Python Framework for Solidity Testing, Fuzzing, and Static Analysis

Smart-contract fuzzers differ by an order of magnitude in throughput and by design in how they construct inputs, yet published comparisons rarely separate the two. We present Wake 5, an open-source Python framework for Solidity testing, fuzzing and static analysis, and use it to locate the binding constraint of stateful smart-contract fuzzing. Wake 5 replaces the JSON-RPC connection to an external node with an in-process EVM (revm) and exposes its static analysis to language-model agents through a Model Context Pr...

arxiv · 원본 ID http://arxiv.org/abs/2611.09307v1

Computation-Efficient Aerial-Marine Integrated Networks for Search and Rescue via Cooperative HAPS, UAVs, and MASSs

In this paper, we propose an aerial-marine integrated network architecture tailored for maritime search and rescue (MSAR) operations, where a high altitude platform station (HAPS) and maritime autonomous surface ships (MASSs) are equipped with edge servers, providing computing services for surveillance uncrewed aerial vehicles (UAVs). These UAVs generate substantial volumes of computation-intensive and delay sensitive tasks, some of which can be strategically offloaded to both MASSs and HAPSs for distributed proce...

arxiv · 원본 ID http://arxiv.org/abs/2611.09205v1

A Tutorial on Practical QKD Post-Processing Algorithms Using a GUI-Based Simulation Framework

Recent experimental demonstrations of Quantum Key Distribution (QKD) have attracted significant attention for their ability to establish information-theoretically secure encryption keys for next-generation communication systems. As practical deployment accelerates, the realization of compact, scalable, and high-throughput discrete-variable (DV) QKD systems has become increasingly important. While advances in photonic integration are enabling low-size, low-weight, and low-power QKD hardware, the security and perfor...

arxiv · 원본 ID http://arxiv.org/abs/2611.09182v1

MongoBench: Do LLMs Know What a MongoDB Query Will Do?

LLM agents increasingly operate databases on their own: they generate queries and run them against live data. Two checks are commonly used to judge such an agent - whether it produces a valid query, and whether it reaches the right final answer - but neither tells us whether the agent knows what its query will actually do before it runs. We argue that this consequence prediction ability must be evaluated in its own right, and we build MongoBench to measure it: given a collection of documents and a MongoDB find() f...

arxiv · 원본 ID http://arxiv.org/abs/2611.09065v1

VLA Handover: Failure-Prediction-Based Switching from On-Robot to Server VLA Models

Large vision-language-action (VLA) models generalize well but are difficult to run in real time on a robot, and small VLAs that run there fail more often. Remote inference over beyond-5G and 6G networks lets a robot use a large VLA on a server, but querying the server for every action chunk limits the number of robots per server. We propose VLA handover: the robot runs a small VLA (S-VLA) and switches to a large VLA (L-VLA) on a server only when the S-VLA is likely to fail. We formulate the switching as minimizing...

arxiv · 원본 ID http://arxiv.org/abs/2611.08987v1

Inside the Trap: A Renewal Law for Prefix-Cache Collapse in LLM Agent Serving

Prefix caching lets an LLM agent's follow-up turns reuse cached KV, but a burst can tip an engine into a trap in which every turn misses and the backlog does not drain, at a load it served before. In registered paired tests on two engines, two GPUs and two models (passed at 9 of 10 rates), a 200-session burst left the engine at zero hits to the end in all 30 runs, while every matched no-burst run stayed good and a session cap prevented the trap in all 30 capped runs. We analyse an idealization of the trapped state...

arxiv · 원본 ID http://arxiv.org/abs/2611.08902v1

t8y2/dbx

25 MB lightweight cross-platform database client for 100+ databases, including MySQL, PostgreSQL, SQLite, Redis, MongoDB, DuckDB, SQL Server, and Dameng. Built-in AI, MCP Server, CLI, desktop and Docker. | 轻量级跨平台数据库管理工具,支持 MySQL、PostgreSQL、SQLite、Redis、MongoDB、达梦等 100+ 数据库,提供桌面端、Docker、CLI、内置 AI 助手和 MCP。

github · 원본 ID 1224172037

headroomlabs-ai/headroom

Compress tool outputs, logs, files, and RAG chunks before they reach the LLM. 20% fewer tokens for coding agents, 60-95% fewer tokens for JSON, same answers. Library, proxy, MCP server.

github · 원본 ID 1129940957