토픽 정보
- 이름
- Database Branching
- Slug
- database-branching
- 관련 키워드
- the, and, database, branching, with, for, that, branch
- 최근 7일 변화
- MVP에서는 실시간 검색 결과 기반 점수만 계산합니다. DB snapshot 저장 후 추세가 표시됩니다.
- 마지막 업데이트
- 2026-11-21T07:24:15.804Z
출처별 최신 반응
Sublinear multi-type preferential attachment
We consider a random growing graph model with two \emph{types}, or \emph{communities}, that belongs to the class of preferential attachment models. Starting from an initial graph $G_0$ in which each node has a type, the graph $G_{n+1}$ is generated by addition of a new node, which attaches through an edge to a node $v$ of $G_n$. The probability of attaching to $v$ depends on the communities of both the new node and $v$, and is proportional to $\operatorname{deg}_n(v)^γ$, where $γ\in[0, 1]$. We establish a converge...
Axial black hole perturbations in purely-metric Horndeski theories
We study axial (odd-parity) perturbations about static and spherically-symmetric curvaturised black hole solutions of purely-metric Horndeski theories. We first review the construction of purely-metric theories of gravity with second-order equations of motion and an additional propagating scalar degree of freedom which is purely gravitational. We then revisit the formation, in a subclass of these theories, of a new branch of hairy black hole solutions under tachyonic instabilities of the scalar field near the Schw...
ConDR: Conservative Reachability through Neural Hamilton-Jacobi Subsolutions
Hamilton-Jacobi (HJ) Reachability identifies the unsafe states of a dynamical system from which it can be forced into failure under worst-case disturbance. However, classical grid-based solvers scale exponentially with state dimension. DeepReach improves scalability by replacing the grid with a neural value function trained on the HJ-Isaacs (HJI) variational inequality (VI), but penalizes both sides of the residual equally. This allows the learned value to lie above the true one and unsafe states to be misclassifi...
Integrated Identity Protection for Semantic Communications in Embodied IoT Systems
Embodied Internet of Things (IoT) systems are promoting the adoption of task-oriented semantic communication (SemCom), in which the trustworthy task decisions require both semantic information reliability and source legitimacy. However, existing trustworthy designs in SemCom mainly focus on semantic content recovery and protection, with limited attention to source legitimacy. Motivated by this limitation, this paper establishes a new information exploitation paradigm for integrated SemCom-identity protection to ad...
Airlock: Bounding the Multi-Agent Blast Radius via Selective Online Containment
When multi-agent systems act on the external world, a single agent's faulty output can spread across tasks before detection, creating a system-wide blast radius. Single-agent guardrails are confined to individual harnesses, while existing multi-agent controls either cancel only the faulty source and miss downstream consumers or halt and roll back the entire workflow at the cost of healthy work. We present Airlock, a multi-agent runtime and guardrail for selective post-alert fault containment. Its tree-structured r...
Intra-Cell Spatial Reuse in LEO Downlinks: Beam-Leakage-Aware Satellite Scheduling
Dense low-earth-orbit (LEO) constellations offer an opportunity to increase local broadband capacity by serving multiple terminals in the same cell through concurrent satellite beams. However, interference between overlapping beams limits spatial reuse, and satellite selection based solely on link strength or angular separation may result in suboptimal performance. This paper proposes beam-leakage-aware satellite scheduling for Ku-band LEO downlink transmissions. With matched transmit and receive beamforming, we f...
Delay-Doppler Synchronization for Distributed Uplink Interference Nulling in LEO Networks
Cooperation among low-Earth-orbit (LEO) satellites provides spatial diversity for mitigating uplink interference that is difficult to suppress with a single onboard array. Coherent interference cancellation across satellites, however, requires compensation of the relative delay and Doppler of a common interferer. We analyze two-branch interference nulling with finite training and derive a closed-form approximation to the mean residual interference-to-noise ratio (INR). The approximation separates wrong acquisition...
Majorana-like Josephson branch structure in one-dimensional transport of cold atoms
We study phase-controlled transport through a one-dimensional channel of attractively interacting fermions connecting two three-dimensional BCS reservoirs. The competition between channel phase stiffness and pair tunnelling at the two contacts results in the emergence of two $4π$-periodic families of stationary states, characterised by symmetric or asymmetric phase drops at the boundaries. Advancing the reservoir phase difference by $2π$ exchanges these families so that the equilibrium energy remains $2π$ periodic...
Flux Crosstalk Calibration from Zero Knowledge to High Precision in Fully Tunable Superconducting Circuits
Precise and independent flux control is essential for scalable superconducting processors built from frequency-tunable qubits and couplers, but flux crosstalk undermines it. Conventional calibration methods rely either on dedicated readout channels, which tunable couplers typically lack, or on readout schemes requiring extensive prior spectroscopy of the qubit and coupler. We demonstrate two independent methods that characterize coupler flux crosstalk without directly driving or measuring the couplers. The first m...
A Width Hierarchy of Monotone Algebraic Branching Programs
It is well known that $\mathsf{VF} = \mathsf{VBP}_{3}$ (Ben-Or-Cleve'92), i.e. the width of any constant-width algebraic branching program can be reduced to width $3$ with only a polynomial overhead to size. We prove that this is not the case for the monotone equivalents. In particular, we prove that there is an infinite hierarchy $\mathsf{mVBP}_{2} \subsetneq \mathsf{mVBP}_{3} \subsetneq \ldots$ by showing that $\mathrm{imm}_{k,n}$ requires width $w$ mABPs to have depth at least $\left(\frac{k}{w-1}\right)^{\frac...
ModernRelay/omnigraph
Object-storage native graph database with branching and typed ontology
neondatabase/neon
Neon: Serverless Postgres. We separated storage and compute to offer autoscaling, code-like database branching, and scale to zero.