搜索结果：Configuration

In preparation for constructing or modifying information networks, network engineers develop configuration procedures for network devices according to network configuration specifications. However, as engineers typically create these procedures manually, the generated configuration procedures frequently diverge from the specified requirements. To improve this situation, this paper proposes a method for automatically generating configuration procedures consisting of network device configuration commands based on network configurations and their modification specifications. In this study, we employed the UML (Unified Modeling Language) object-oriented modeling language to develop a notation for network configuration modeling that ensures both strict specification adherence and ease of extension. Additionally, we implemented a method for automatically generating configuration procedures that match the specifications by utilizing network configuration models. As an evaluation experiment, we applied the proposed method to a configuration change scenario in a wide-area campus network at Shinshu University, where the network was migrated from static routing to dynamic routing using the OS

Quantum-selected configuration interaction (QSCI) is a promising hybrid quantum-classical approach in which a quantum device generates configurations for subsequent classical diagonalization. Here, we analyze the performance of QSCI combined with the local unitary cluster Jastrow (LUCJ) ansatz, focusing on the interplay between ansatz expressivity, sampling, noise, and configuration recovery. Using the dissociation of N2 in a large active space as a benchmark, we show that noiseless LUCJ sampling produces compact and biased configurational spaces, limiting the accuracy of the resulting CI energies, particularly in strongly correlated regimes. By introducing a simple noise model, we demonstrate that sampling noise can enhance Hilbert-space exploration by generating additional configurations beyond those supported by the ideal ansatz. When combined with configuration recovery, this leads to systematically improved energies. Moreover, recovery alone (starting from randomly generated configurations) can efficiently construct accurate CI spaces, highlighting its central role in QSCI.

This paper proposes configuration testing--evaluating configuration values (to be deployed) by exercising the code that uses the values and assessing the corresponding program behavior. We advocate that configuration values should be systematically tested like software code and that configuration testing should be a key reliability engineering practice for preventing misconfigurations from production deployment. The essential advantage of configuration testing is to put the configuration values (to be deployed) in the context of the target software program under test. In this way, the dynamic effects of configuration values and the impact of configuration changes can be observed during testing. Configuration testing overcomes the fundamental limitations of de facto approaches to combatting misconfigurations, namely configuration validation and software testing--the former is disconnected from code logic and semantics, while the latter can hardly cover all possible configuration values and their combinations. Our preliminary results show the effectiveness of configuration testing in capturing real-world misconfigurations. We present the principles of writing new configuration tests

This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further extension to the notion of points and $k$-planes ($k$-dimensional hyperplanes) which we refer to as configurations of order $k$. We present a number of general examples such as stacked configurations of order $k$ - intuitively layering lower order configurations - and product configurations of order $k$. We discuss many analogues of standard configurations such as dual configurations, isomorphisms, graphical representations, and when a configuration is geometric. We focus mostly on configurations of order $2$ and specifically compute the number of possible symmetric configurations of order $2$ when each plane contains $3$ points for small values on $n$ - the total number of points in the configuration.

In 1990, Branko Grünbaum and John Rigby presented a 4-configuration, known today as the \emph{Grünbaum--Rigby configuration}; it is denoted by $\mathrm{GR}(21_4)$. Independently and earlier, in 1986, Ferenc Kárteszi published a paper in which he proved a theorem in real geometry that gives rise to a series of 4-configurations $\mathrm{K}(n;\ell,m)$. In an even earlier paper from 1964, he presented a figure which is essentially the same as that given by Grünbaum and Rigby. In this paper, we explore some properties of the \emph{Kárteszi configurations} and in particular show that $\mathrm{GR}(21_4)$ is isomorphic to $\mathrm{K}(7;2,3)$. We present a theorem that gives necessary and sufficient conditions on parameters $n,\ell,m$ such that the corresponding configuration $\mathrm{K}(n;\ell,m)$ is realisable as a geometric polycyclic configuration with $n$-fold rotational symmetry and no extra incidences.

This article gives a new upper bound for the resurgence number of symbolic powers of matroidal configuration in the following situations: the height of the matroidal configuration is big, or the height is small, and the corresponding simplicial complex of the matroidal configuration is peaked. The Peaked simplicial complex is a generalization of bipartite graph. Furthermore, the article also gives a clean formula to compute the resurgence number and the strict containment of generalized uniform matroidal configuration which includes case of star configuration of hypersurfaces.

We introduce a coshuffle comultiplication on the singular chain complex of configuration spaces, and we show that this structure endows the configuration space with the structure of a differential graded coalgebra (DGCoAlg). We then prove that the coshuffle comultiplication is compatible with the external product through a natural commutation relation. As an application, we investigate configuration spaces of graphs and the associated graph braid groups. In particular, for graphs of topological circumference at most 1, we prove that the singular chain complex of the configuration space is formal as a DGCoAlg. Moreover, we obtain a complete classification of the primitivity in the homology of configuration spaces of such graphs.

This paper addresses the problem of adaptive reconfigurable intelligent surfaces (RIS) configuration design for user localization in rich-scattering environment (RSE), where electromagnetic waves undergo multiple interactions with dynamic scatterers and RIS elements. We propose an adaptive learning-based localization approach for a distributed RIS-assisted network in a RSE using a bidirectional long-short term memory (biLSTM) model that captures temporal correlations between observations. The proposed approach actively senses the environment using sequential pilot transmissions from the base station (BS), accounting for scattering effects, and adaptively updates the RIS configuration based on prior measurements to eventually accurately estimate and minimize the user localization error. The proposed model comprises two neural sub-networks: Scattering Estimation Network (Bi-SEN), for estimation of scattering in the environment, and Adaptive RIS-Assisted User Localization Network (Bi-ARULN), for RIS configuration and localization. Bayesian optimization is used for hyperparameter tuning of the model. The simulation results demonstrate the effectiveness of the proposed approach, achievi

In a paper from 1886, Martinetti enumerated small $v_3$-configurations. One of his tools was a construction that permits to produce a $(v+1)_3$-configuration from a $v_3$-configuration. He called configurations that were not constructible in this way irreducible configurations. According to his definition, the irreducible configurations are Pappus' configuration and four infinite families of configurations. In 2005, Boben defined a simpler and more general definition of irreducibility, for which only two $v_3$-configurations, the Fano plane and Pappus' configuration, remained irreducible. The present article gives a generalization of Boben's reduction for both balanced and unbalanced $(v_r,b_k)$-configurations, and proves several general results on augmentability and reducibility. Motivation for this work is found, for example, in the counting and enumeration of configurations.

Contemporary compute platforms increasingly offload compute kernels from CPU to integrated hardware accelerators to reach maximum performance per Watt. Unfortunately, the time the CPU spends on setup control and synchronization has increased with growing accelerator complexity. For systems with complex accelerators, this means that performance can be configuration-bound. Faster accelerators are more severely impacted by this overlooked performance drop, which we call the configuration wall. Prior work evidences this wall and proposes ad-hoc solutions to reduce configuration overhead. However, these solutions are not universally applicable, nor do they offer comprehensive insights into the underlying causes of performance degradation. In this work, we first introduce a widely-applicable variant of the well-known roofline model to quantify when system performance is configuration-bound. To move systems out of the performance-bound region, we subsequently propose a domain-specific compiler abstraction and associated optimization passes. We implement the abstraction and passes in the MLIR compiler framework to run optimized binaries on open-source architectures to prove its effectivene

In many scenarios, configurators support the configuration of a solution that satisfies the preferences of a single user. The concept of \emph{multi-configuration} is based on the idea of configuring a set of configurations. Such a functionality is relevant in scenarios such as the configuration of personalized exams, the configuration of project teams, and the configuration of different trips for individual members of a tourist group (e.g., when visiting a specific city). In this paper, we exemplify the application of multi-configuration for generating individualized exams. We also provide a constraint solver performance analysis which helps to gain some insights into corresponding performance issues.

This paper presents the design and prototype implementation of a natural language interface for configuring enterprise firewalls. The framework allows administrators to express access control policies in plain language, which are then translated into vendor specific configurations. A compact schema bound intermediate representation separates human intent from device syntax and in the current prototype compiles to Palo Alto PAN OS command line configuration while remaining extensible to other platforms. Large language models are used only as assistive parsers that generate typed intermediate representation objects, while compilation and enforcement remain deterministic. The prototype integrates three validation layers, namely a static linter that checks structural and vendor specific constraints, a safety gate that blocks overly permissive rules such as any to any allows, and a Batfish based simulator that validates configuration syntax and referential integrity against a synthetic device model. The paper describes the architecture, implementation, and test methodology on synthetic network context datasets and discusses how this approach can evolve into a scalable auditable and huma

The observable behavior of a system usually carries useful information about its internal state, properties, and potential future behaviors. In this paper, we introduce configuration monitoring to determine an unknown configuration of a running system based on observations of its behavior. We develop a modular and generic pipeline to synthesize automata-theoretic configuration monitors from a featured transition system model of the configurable system to be monitored. The pipeline further allows synthesis under partial observability and network-induced losses as well as predictive configuration monitors taking the potential future behavior of a system into account. Beyond the novel application of configuration monitoring, we show that our approach also generalizes and unifies existing work on runtime monitoring and fault diagnosis, which aim at detecting the satisfaction or violation of properties and the occurrence of faults, respectively. We empirically demonstrate the efficacy of our approach with a case study on configuration monitors synthesized from configurable systems community benchmarks.

Configuration is a successful application area of Artificial Intelligence. In the majority of the cases, configuration systems focus on configuring one solution (configuration) that satisfies the preferences of a single user or a group of users. In this paper, we introduce a new configuration approach - multi-configuration - that focuses on scenarios where the outcome of a configuration process is a set of configurations. Example applications thereof are the configuration of personalized exams for individual students, the configuration of project teams, reviewer-to-paper assignment, and hotel room assignments including individualized city trips for tourist groups. For multi-configuration scenarios, we exemplify a constraint satisfaction problem representation in the context of configuring exams. The paper is concluded with a discussion of open issues for future work.

Finitely many hypersurfaces are removed from unordered configuration spaces of $n$ points in $\mathbb{C}$ to obtain a fibration over unordered configuration spaces of $n-1$ complex points. Fundamental groups of these restricted configuration spaces are computed in small dimensions.

This user's guide (updated version) consists of two parts. The first part is an extensive survey contributed to the Encyclopedia of Mathematical Physics, 2nd edition. It covers many of the main constructions, definitions, and applications of the classical configuration spaces of points. The second part delves into the geometry of chromatic configuration spaces, giving a detailed proof of the remarkable result that the Poincaré polynomial of the chromatic configuration spaces of $\mathbb R^N$, associated to a finite simple graph $Γ$, corresponds to the reciprocal of the chromatic polynomial of the graph (with signs). Further applications and a stable splitting are given.

Reconfigurable intelligent surfaces (RISs) can potentially combat jamming attacks by diffusing jamming signals. This paper jointly optimizes user selection, channel allocation, modulation-coding, and RIS configuration in a multiuser OFDMA system under a jamming attack. This problem is non-trivial and has never been addressed, because of its mixed-integer programming nature and difficulties in acquiring channel state information (CSI) involving the RIS and jammer. We propose a new deep reinforcement learning (DRL)-based approach, which learns only through changes in the received data rates of the users to reject the jamming signals and maximize the sum rate of the system. The key idea is that we decouple the discrete selection of users, channels, and modulation-coding from the continuous RIS configuration, hence facilitating the RIS configuration with the latest twin delayed deep deterministic policy gradient (TD3) model. Another important aspect is that we show a winner-takes-all strategy is almost surely optimal for selecting the users, channels, and modulation-coding, given a learned RIS configuration. Simulations show that the new approach converges fast to fulfill the benefit o

Systems can become misconfigured for a variety of reasons such as operator errors or buggy patches. When a misconfiguration is discovered, usually the first order of business is to restore availability, often by undoing the misconfiguration. To simplify this task, we propose the Statistical Analysis for Identifying Configuration Files (SAIC), which analyzes how the contents of a file changes over time to automatically determine which files contain configuration state. In this way, SAIC reduces the number of files a user must manually examine during recovery and allows versioning file systems to make more efficient use of their versioning storage. The two key insights that enable SAIC to identify configuration files are that configuration state must persist across executions of an application and that configuration state changes at a slower rate than other types of application state. SAIC applies these insights through a set of filters, which eliminate non-persistent files from consideration, and a novel similarity metric, which measures how similar a file's versions are to each other. Together, these two mechanisms enable SAIC to identify all 72 configuration files out of 2363 vers

A $configuration$ of a linkage $Γ$ is a possible positioning of $Γ$ in $\mathbb{R}^d$ and the collection of all such forms the configuration space $\mathcal{C}(Γ)$ of $Γ$. We here introduce the notion of the $symmetric configuration space$ of a linkage, in which we identify configurations which are geometrically indistinguishable. We show that the symmetric configuration space of a planar polygon has a regular cell structure, provide some principles for calculating this structure, and give a complete description of the symmetric configuration space of all quadrilaterals and of the equilateral pentagon.