Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · cs/0204055

Intelligent Search of Correlated Alarms for GSM Networks with Model-based Constraints

Qingguo Zheng·Ke Xu·Weifeng Lv·Shilong Ma
View original source ↗Read source document ↗Export metadata ↓

Abstract

In order to control the process of data mining and focus on the things of interest to us, many kinds of constraints have been added into the algorithms of data mining. However, discovering the correlated alarms in the alarm database needs deep domain constraints. Because the correlated alarms greatly depend on the logical and physical architecture of networks. Thus we use the network model as the constraints of algorithms, including Scope constraint, Inter-correlated constraint and Intra-correlated constraint, in our proposed algorithm called SMC (Search with Model-based Constraints). The experiments show that the SMC algorithm with Inter-correlated or Intra-correlated constraint is about two times faster than the algorithm with no constraints.

Explore related subjects

cs.NIcs.AI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Qingguo Zheng, Ke Xu, Weifeng Lv, Shilong Ma. 2002-04-29. Intelligent Search of Correlated Alarms for GSM Networks with Model-based Constraints. https://arxiv.org/abs/cs/0204055

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Chimera: Neuro-Symbolic Attention Primitives for Trustworthy Dataplane Intelligence

Deploying expressive learning models directly on programmable dataplanes promises line-rate, low-latency traffic analysis but remains hindered by strict hardware constraints and the need for predictable, auditable behavior. Chimera introduces a principled framework that maps attention-oriented neural computations and symbolic constraints onto dataplane primitives, enabling trustworthy inference within the match-action pipeline. Chimera combines a kernelized, linearized attention approximation with a two-layer key-selection hierarchy and a cascade fusion mechanism that enforces hard symbolic guarantees while preserving neural expressivity. The design includes a hardware-aware mapping protocol and a two-timescale update scheme that together permit stable, line-rate operation under realistic dataplane budgets. The paper presents the Chimera architecture, a hardware mapping strategy, and empirical evidence showing that neuro-symbolic attention primitives can achieve high-fidelity inference within the resource envelope of commodity programmable switches.

cs.NI↗
arXiv2026

STEPS: Semantic Contract-Guided Scheduling for LLM-Assisted Natural Language-Driven Edge AI Services

Edge user/service scheduling governs where and how AI services are executed under limited communication and computing resources. Existing edge scheduling frameworks typically assume numerically specified service requirements, such as latency bounds and energy budgets. However, users often express ambiguous and context-dependent expectations in natural language, creating a gap between user intent and scheduling decisions. We propose semantic contract-guided edge potential scheduling (STEPS), a natural language-driven framework that introduces semantic contracts as executable interfaces between user-side semantics and edge-side decisions. A large language model (LLM)-assisted semantic parser extracts service requirements and raw confidence scores from natural language requests. Confidence calibration and interpretable mapping rules convert these outputs into preference weights, fulfillment bounds, and semantic uncertainty. STEPS formulates intended per-slot edge scheduling as an exact potential game for execution-node selection, computing-resource provisioning, and bandwidth allocation, followed by capacity-feasible resource realization. Fulfillment-driven feedback signals enable adaptive scheduling under evolving service and network conditions. We establish the existence of pure-strategy Nash equilibrium, prove finite-step convergence of uncapped strict best-response dynamics, and characterize the boundedness of projected adaptive-control parameters. Experiments under synthetic and Melbourne-based hybrid settings demonstrate improved contract fulfillment and reduced service loss relative to several adapted benchmarks. Post-drift evaluations further show that feedback adaptation improves fulfillment and admission coverage under the tested conditions.

cs.NI↗
arXiv2026

Agentic LinkDreamer: Adaptive Neuro-Fuzzy World-Model Decision Making for Intermittent V2X Cooperative Perception

Intermittent vehicle-to-everything (V2X) communication can remove collaborator information needed for cooperative perception, degrading object detection during link outages. Existing recovery methods reconstruct missing features but rarely determine when to trust predictions, reuse historical observations, or request fresh information. This paper proposes Agentic LinkDreamer, a soft-computing framework integrating a latent world model with an interpretable neuro-fuzzy decision agent. It maintains causal collaborator memory and uses a relative-motion-conditioned recurrent world model to predict unavailable bird's-eye-view (BEV) features. Prediction uncertainty, perceptual complementarity, memory freshness, communication quality, and residual communication budget form a compact decision state. A differentiable Takagi-Sugeno controller selects among five modes: ego-only perception, motion-compensated historical feature reuse, latent imagination, low-rate temporal-summary refresh, and high-rate collaborator-feature refresh. The policy balances detection risk, communication overhead, latency, predictive uncertainty, and action switching. After link recovery, reflection compares predicted and received features to update uncertainty calibration and causal memory. For reproducible evaluation without assuming unavailable physical-layer traces, we construct a geometry-derived V2X degradation protocol using recorded trajectories and LiDAR-derived scene geometry from V2X-Real. On the real-world V2X-Real V2V split, Agentic LinkDreamer achieves 90.95 AP@0.5 on outage frames and recovers 92.9% of the cooperative-perception performance gap. At a high-performance operating point, it remains only 0.65 AP below the cooperative upper reference while reducing communication volume by approximately 31% relative to continuous high-rate cooperation. This improves resilience under V2X outages.

cs.NI↗