Searcharxiv⌕ Search

arXiv subjects

Ke Feng

Publications and source records attributed to Ke Feng.

29 records · Page 2Linked to original sources

A Survey on Verification and Validation, Testing and Evaluations of Neurosymbolic Artificial Intelligence

Neurosymbolic artificial intelligence (AI) is an emerging branch of AI that combines the strengths of symbolic AI and sub-symbolic AI. A major drawback of sub-symbolic AI is that it acts as a "black box", meaning that predictions are difficult to explain, making the testing & evaluation (T&E) and validation & verification (V&V) processes of a system that uses sub-symbolic AI a challenge. Since neurosymbolic AI combines the advantages of both symbolic and sub-symbolic AI, this survey explores how neurosymbolic applications can ease the V&V process. This survey considers two taxonomies of neurosymbolic AI, evaluates them, and analyzes which algorithms are commonly used as the symbolic and sub-symbolic components in current applications. Additionally, an overview of current techniques for the T&E and V&V processes of these components is provided. Furthermore, it is investigated how the symbolic part is used for T&E and V&V purposes in current neurosymbolic applications. Our research shows that neurosymbolic AI as great potential to ease the T&E and V&V processes of sub-symbolic AI by leveraging the possibilities of symbolic AI. Additionally, the applicability of current T&E and V&V methods to neurosymbolic AI is assessed, and how different neurosymbolic architectures can impact these methods is explored. It is found that current T&E and V&V techniques are partly sufficient to test, evaluate, verify, or validate the symbolic and sub-symbolic part of neurosymbolic applications independently, while some of them use approaches where current T&E and V&V methods are not applicable by default, and adjustments or even new approaches are needed. Our research shows that there is great potential in using symbolic AI to test, evaluate, verify, or validate the predictions of a sub-symbolic model, making neurosymbolic AI an interesting research direction for safe, secure, and trustworthy AI.

cs.AI↗

Spatial Network Calculus and Performance Guarantees in Wireless Networks

This work develops a novel approach toward performance guarantees for all links in arbitrarily large wireless networks. It introduces a spatial network calculus, consisting of spatial regulation properties for stationary point processes and the first steps of a calculus for this regulation, which can be seen as an extension to space of the classical network calculus. Specifically, two classes of regulations are defined: one includes ball regulation and shot-noise regulation, which are shown to be equivalent and upper constraint interference; the other one includes void regulation, which lower constraints the signal power. These regulations are defined both in the strong and weak sense: the former requires the regulations to hold everywhere in space, whereas the latter only requires the regulations to hold as observed by a jointly stationary point process. Using this approach, we derive performance guarantees in device-to-device, ad hoc, and cellular networks under proper regulations. We give universal bounds on the SINR for all links, which gives link service guarantees based on information-theoretic achievability. They are combined with classical network calculus to provide end-to-end latency guarantees for all packets in wireless queuing networks. Such guarantees do not exist in networks that are not spatially regulated, e.g., Poisson networks.

cs.IT↗

GraphDAC: A Graph-Analytic Approach to Dynamic Airspace Configuration

The current National Airspace System (NAS) is reaching capacity due to increased air traffic, and is based on outdated pre-tactical planning. This study proposes a more dynamic airspace configuration (DAC) approach that could increase throughput and accommodate fluctuating traffic, ideal for emergencies. The proposed approach constructs the airspace as a constraints-embedded graph, compresses its dimensions, and applies a spectral clustering-enabled adaptive algorithm to generate collaborative airport groups and evenly distribute workloads among them. Under various traffic conditions, our experiments demonstrate a 50\% reduction in workload imbalances. This research could ultimately form the basis for a recommendation system for optimized airspace configuration. Code available at https://github.com/KeFenge2022/GraphDAC.git

math.OC↗

Joint Spatial-Propagation Modeling of Cellular Networks Based on the Directional Radii of Poisson Voronoi Cells

In coverage-oriented networks, base stations (BSs) are deployed in a way such that users at the cell boundaries achieve sufficient signal strength. The shape and size of cells vary from BS to BS, since the large-scale signal propagation conditions differ in different geographical regions. This work proposes and studies a joint spatial-propagation (JSP) model, which considers the correlation between cell radii and the large-scale signal propagation (captured by shadowing). We first introduce the notion of the directional radius of Voronoi cells, which has applications in cellular networks and beyond. The directional radius of a cell is defined as the distance from the nucleus to the cell boundary at an angle relative to the direction of a uniformly random location in the cell. We study the distribution of the radii in two types of cells in the Poisson Voronoi tessellations: the zero-cell, which contains the origin, and the typical cell. The results are applied to analyze the JSP model. We show that, even though the Poisson point process (PPP) is often considered as a pessimistic spatial model for BS locations, the JSP model with the PPP achieves coverage performance close to the most optimistic one -- the standard triangular lattice model. Further, we show that the network performance depends critically on the variance of the large-scale path loss along the cell boundary.

cs.IT↗

Combinatorial Ricci flows and the hyperbolization of a class of compact 3-manifolds

We prove that for a compact 3-manifold M with boundary admitting an ideal triangulation T with valence at least 10 at all edges, there exists a unique complete hyperbolic metric with totally geodesic boundary, so that T is isotopic to a geometric decomposition of M. Our approach is to use a variant of the combinatorial Ricci flow introduced by Luo [Luo05] for pseudo 3-manifolds. In this case, we prove that the extended Ricci flow converges to the hyperbolic metric exponentially fast.

math.DG↗

Combinatorial Ricci flows with applications to the hyperbolization of cusped 3-manifolds

In this paper, we adopt combinatorial Ricci curvature flow methods to study the existence of cusped hyperbolic structure on 3-manifolds with torus boundary. For general pseudo 3-manifolds, we prove the long-time existence and the uniqueness for the extended Ricci flow for decorated hyperbolic polyhedral metrics. We prove that the extended Ricci flow converges to a decorated hyperbolic polyhedral metric if and only if there exists a decorated hyperbolic polyhedral metric of zero Ricci curvature. If it is the case, the flow converges exponentially fast. These results apply for cusped hyperbolic structure on 3-manifolds via ideal triangulation.

math.DG↗

The Dirichlet Problem of Fully Nonlinear Equations on Hermitian Manifolds

We study the Dirichlet problem of a class of fully nonlinear elliptic equations on Hermitian manifolds and derive a priori $C^2$ estimates which depend on the initial data on manifolds, the admissible subsolutions and the upper bound of the gradients of the solutions. In some special cases, we obtain the gradient estimates, and hence we can solve the corresponding Dirichlet problem with admissible subsolutions. We also study the Hessian quotient equations and $(m-1,m-1)$-Hessian quotient equations on compact Hermitian manifolds without boundary.

math.DG↗

Transverse Fully Nonlinear Equations on Sasakian Manifolds and Applications

We prove a priori estimates for a class of transverse fully nonlinear equations on Sasakian manifolds and give some geometric applications such as the transversion Calabi-Yau theorem for transverse balanced and (strongly) Gauduchon metrics. We also explain that similar results hold on compact oriented, taut, transverse Hermitian foliated manifold of complex co-dimension $n$, and give some geometric applications such as the transverse Calabi-Yau theorems for transverse Hermitian and (strongly) Gauduchon metrics.

math.DG↗

The Partial $C^{0}$-estimate along a general continuity path and applications

We establish a new partial $C^{0}$-estimate along a continuity path mixed with conic singularities along a simple normal crossing divisor and a positive twisted $(1,1)$-form on Fano manifolds. As an application, this estimate enables us to show the reductivity of the automorphism group of the limit space, which leads to a proof of Yau-Tian-Donaldson Conjecture admitting some types of holomorphic vector fields.

math.DG↗

A Tunable Base Station Cooperation Scheme for Poisson Cellular Networks

We propose a tunable location-dependent base station (BS) cooperation scheme by partitioning the plane into three regions: the cell centers, cell edges and cell corners. The area fraction of each region is tuned by the cooperation level $γ$ ranging from 0 to 1. Depending on the region a user resides in, he/she receives no cooperation, two-BS cooperation or three-BS cooperation. Here, we use a Poisson point process (PPP) to model BS locations and study a non-coherent joint transmission scheme, $\textit{i.e.}$, selected BSs jointly serve one user in the absence of channel state information (CSI). For the proposed scheme, we examine its performance as a function of the cooperation level using tools from stochastic geometry. We derive an analytical expression for the signal-to-interference ratio (SIR) distribution and its approximation based on the asymptotic SIR gain, along with the characterization of the normalized spectral efficiency per BS. Our result suggests that the proposed scheme with a moderate cooperation level can improve the SIR performance while maintaining the normalized spectral efficiency.

cs.IT↗

Enhanced betatron radiation by steering a low-energy-spread electron beam in a deflected laser-driven plasma wiggler

Laser wakefield accelerators (LWFA) hold great potential to produce high-quality high-energy electron beams (e beams) and simultaneously bright x-ray sources via betatron radiation, which are very promising for pump-probe study in ultrafast science. However, in order to obtain a high-quality e beam, electron injection and acceleration should be carefully manipulated, where a large oscillation amplitude has to be avoided and thus the emitted x-ray yield is limited. Here, we report a new scheme to experimentally enhance betatron radiation significantly both in photon yield and photon energy by separating electron injection and acceleration from manipulation of the e-beam transverse oscillation in the wake via introducing a slanted thin plasma refraction slab. Particle-in-cell simulations indicate that the e-beam transverse oscillation amplitude can be increased by more than 10 folds, after being steered into the deflected laser-driven wakefield due to refraction at the slab's boundaries. Spectral broadening of the x-rays can be suppressed owing to the small variation in the peak energy of the low-energy-spread e beam in a plasma wiggler regime. We demonstrate that the high-quality e-beam generation, refracting and wiggling can act as a whole to realize the concurrence of monoenergetic e beam and bright x-rays in a compact LWFA.

physics.plasm-ph↗