arXiv subjects

Xing Feng

Publications and source records attributed to Xing Feng.

16 recordsLinked to original sources

arXiv2026

Astragalus: Automatic Configuration Repair for Production Networks

Network configurations are prone to errors, which can lead to catastrophic service outages. A tool that can achieve automatic configuration repair (ACR) is highly desired by operators. Existing tools for ACR follow a \textit{semantics-driven approach}: they model network semantics as a set of SMT constraints, and solve them for a location or fix of the error. Due to the complex semantics of networks, constructing and solving these constraints can be prohibitively expensive, making these tools neither general nor scalable. Inspired by automatic program repair (APR), we explore another direction, i.e., a \textit{syntax-driven approach}, which generates and validates syntactically-valid candidate updates without modeling program semantics, often drawing on existing code in the same repository. Following this direction, we propose Astragalus, a syntax-driven method for ACR. It uses multiple iterations of a "localize-fix-validate" pipeline to search for repairs, and proves quite effective on configurations of our production network. Specifically, we show that Astragalus can repair every incident in multiple sizes of a synthesized network, and 97.5% of the incidents on a real network, both with 15 types of errors injected, within an average time of 6.93 seconds. It has also provided valid repairs in under 6 minutes for 7 recent network incidents or undesired changes, in a real production network with O(1,000)~O(10,000) devices.

cs.NI↗

arXiv2024

A concentration phenomenon for $h$-extra edge-connectivity reliability analysis of enhanced hypercubes $Q_{n,2}$ with exponentially many faulty links

Reliability assessment of interconnection networks is critical to the design and maintenance of multiprocessor systems. The $(n, k)$-enhanced hypercube $Q_{n,k}$, as a variation of the hypercube $Q_{n}$, was proposed by Tzeng and Wei in 1991. As an extension of traditional edge-connectivity, $h$-extra edge-connectivity of a connected graph $G,$ $\lambda_h(G),$ is an essential parameter for evaluating the reliability of interconnection networks. This article intends to study the $h$-extra edge-connectivity of the $(n,2)$-enhanced hypercube $Q_{n,2}$. Suppose that the link malfunction of an interconnection network $Q_{n,2}$ does not isolate any subnetwork with no more than $h-1$ processors, the minimum number of these possible faulty links concentrates on a constant $2^{n-1}$ for each integer $\lceil\frac{11\times2^{n-1}}{48}\rceil \leq h \leq 2^{n-1}$ and $n\geq 9$. That is, for about $77.083\%$ of values where $h\leq2^{n-1},$ the corresponding $h$-extra edge-connectivity of $Q_{n,2}$, $\lambda_h(Q_{n,2})$, presents a concentration phenomenon. Moreover, the lower and upper bounds of $h$ mentioned above are both tight.

math.CO↗

arXiv2024

A real-time rendering method for high albedo anisotropic materials with multiple scattering

We propose a neural network-based real-time volume rendering method for realistic and efficient rendering of volumetric media. The traditional volume rendering method uses path tracing to solve the radiation transfer equation, which requires a huge amount of calculation and cannot achieve real-time rendering. Therefore, this paper uses neural networks to simulate the iterative integration process of solving the radiative transfer equation to speed up the volume rendering of volume media. Specifically, the paper first performs data processing on the volume medium to generate a variety of sampling features, including density features, transmittance features and phase features. The hierarchical transmittance fields are fed into a 3D-CNN network to compute more important transmittance features. Secondly, the diffuse reflection sampling template and the highlight sampling template are used to layer the three types of sampling features into the network. This method can pay more attention to light scattering, highlights and shadows, and then select important channel features through the attention module. Finally, the scattering distribution of the center points of all sampling templates is predicted through the backbone neural network. This method can achieve realistic volumetric media rendering effects and greatly increase the rendering speed while maintaining rendering quality, which is of great significance for real-time rendering applications. Experimental results indicate that our method outperforms previous methods.

cs.GR↗

arXiv2024

Exploration and Improvement of Nerf-based 3D Scene Editing Techniques

NeRF's high-quality scene synthesis capability was quickly accepted by scholars in the years after it was proposed, and significant progress has been made in 3D scene representation and synthesis. However, the high computational cost limits intuitive and efficient editing of scenes, making NeRF's development in the scene editing field facing many challenges. This paper reviews the preliminary explorations of scholars on NeRF in the scene or object editing field in recent years, mainly changing the shape and texture of scenes or objects in new synthesized scenes; through the combination of residual models such as GaN and Transformer with NeRF, the generalization ability of NeRF scene editing has been further expanded, including realizing real-time new perspective editing feedback, multimodal editing of text synthesized 3D scenes, 4D synthesis performance, and in-depth exploration in light and shadow editing, initially achieving optimization of indirect touch editing and detail representation in complex scenes. Currently, most NeRF editing methods focus on the touch points and materials of indirect points, but when dealing with more complex or larger 3D scenes, it is difficult to balance accuracy, breadth, efficiency, and quality. Overcoming these challenges may become the direction of future NeRF 3D scene editing technology.

cs.CV↗

arXiv2024

Methods and strategies for improving the novel view synthesis quality of neural radiation field

Neural Radiation Field (NeRF) technology can learn a 3D implicit model of a scene from 2D images and synthesize realistic novel view images. This technology has received widespread attention from the industry and has good application prospects. In response to the problem that the rendering quality of NeRF images needs to be improved, many researchers have proposed various methods to improve the rendering quality in the past three years. The latest relevant papers are classified and reviewed, the technical principles behind quality improvement are analyzed, and the future evolution direction of quality improvement methods is discussed. This study can help researchers quickly understand the current state and evolutionary context of technology in this field, which is helpful in inspiring the development of more efficient algorithms and promoting the application of NeRF technology in related fields.

cs.CV↗

arXiv2022

A centimeter-scale achromatic hybrid metalens with polarization-insensitivity in the visible

Metalenses, featuring ultra-compactness and CMOS compatibility, are limited by the compromise between the diameter, numerical aperture, and working waveband. To address this problem, we propose and numerically demonstrate a centimeter-scale metasurface-refractive hybrid metalens working in the band of 440 - 700 nm. Revisiting the general Snell law, we present the phase profile of a chromatic aberration correction metasurface that can apply to a plano-convex refractive lens of an arbitrary surface type. Simulated by our semi-vector method, the designed achromatic hybrid metalens achieves 81% chromatic aberration suppression and polarization insensitivity. Broadband imaging results of the hybrid metalens are further provided, verifying the achromatism of the designed hybrid metalens. It can find applications in camera lenses and other optical systems that need compact, high-performance lenses.

physics.optics↗

arXiv2022

Design of an achromatic zoom metalens doublet in the visible

Zoom metalens doublet exhibits unprecedented advantages over the traditional zoom lens in many aspects, like ultra-compactness, CMOS compatibility, and miniaturization. However, most of them can only work in a narrow band due to chromatic aberration. Here, we numerically demonstrate a broadband achromatic zoom metalens doublet inspired by the Moir\'e lens principle. This design is achieved by globally optimizing the multi-wavelength phase profiles of the metalens doublet in the visible. The doublet can achieve achromatic continuous 1-10 zoom range at wavelengths of 440 nm, 540 nm, and 640 nm, featuring high focusing efficiency up to 86.5% and polarization insensitivity.

physics.optics↗

arXiv2022

Phase-Only Holographic Assisted Planar Printing for Massively Multiplexed Optical Display and Encryption

Multiplexed planar printings, made of single or few layer micro and nano optical platforms, are essential for high capacity display, information storage and encryption. Although having been developed rapidly, the demonstrated channels are still limited and also lack instantaneity. Here, holograms and printings, always regarded as two independent information coding domains with totally different principles, are combined together through our proposed angle multiplexing framework, leading to multiplexed printings with hundreds of channels. Based on such approach, we experimentally encode respectively 25 gray scale printings into 25 angles and even 8 gray scale videos into 8 angles with a phase-only spatial light modulator. As a bridge between printings and holograms, our method allows to generate printings combining various holographic methods. Beneficial from this, we demonstrate a gradient metasurface based 324 channel printing which multiplexes angles, polarizations and wavelengths simultaneously. Our work paves the way to flexibly angle-dependent printing display and massively multiplexed encryption systems.

physics.optics↗

arXiv2020

Laminar Tight Cuts in Matching Covered Graphs

An edge cut $C$ of a graph $G$ is {\it tight} if $|C \cap M|=1$ for every perfect matching $M$ of $G$.~Barrier cuts and 2-separation cuts are called {\it ELP-cuts}, which are two important types of tight cuts in matching covered graphs.~Edmonds, Lov\'asz and Pulleyblank proved that if a matching covered graph has a nontrivial tight cut, then it also has a nontrivial ELP-cut.~Carvalho, Lucchesi, and Murty made a stronger conjecture: given any nontrivial tight cut $C$ in a matching covered graph $G$, there exists a nontrivial ELP-cut $D$ in $G$ which does not cross $C$.~We confirm the conjecture in this paper.

math.CO↗

arXiv2020

Compact optical polarization-insensitive zoom metalens-doublet

Metasurface-based lenses (metalenses) offer specific conceptual advantages compared to ordinary refractive lenses. For example, it is possible to tune the focal length of a metalens doublet by varying the relative angle between the two metalenses while fixing their distance, leading to an extremely compact zoom lens. An improved polarization-insensitive design based on silicon-nanocylinders on silica substrates is presented. This design is realized and characterized experimentally at 1550 nm wavelength. By varying the relative angle between the metalenses in steps of 10 degrees, tuning of the doublet focal length is demonstrated from -54 mm to -+3 mm to +54 mm. This results in a zoom factor of an imaging system varying between 1 and 18. For positive focal lengths, the doublet focusing efficiency has a minimum of 34% and a maximum of 83%. Experiment and theory are in very good agreement.

physics.optics↗

arXiv2019

Temperature-dependent hardness of diamond-structured covalent materials

Understanding temperature-dependent hardness of covalent materials is not only of fundamental scientific interest, but also of crucial importance for technical applications. In this work, a temperature-dependent hardness formula for diamond-structured covalent materials is constructed on the basis of the dislocation theory. Our results show that, at low temperature, the Vickers hardness is mainly controlled by Poisson's ratio and shear modulus with the latter playing a dominant role. With increasing temperature, the plastic deformation mechanism undergoes a transition from shuffle-set dislocation control to glide-set dislocation control, leading to a steeper drop of hardness at high temperature. In addition, an intrinsic parameter, a3G, is revealed for diamond-structured covalent materials, which measures the resistance to soften at high temperature. Our hardness model shows remarkable agreement with experimental data. Current work not only sheds lights on the physical origin of hardness, but also provides a direct principle for superhard materials design.

cond-mat.mtrl-sci↗

arXiv2019

$b$-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks

A {\em brick} is a non-bipartite matching covered graph without non-trivial tight cuts. Bricks are building blocks of matching covered graphs. We say that an edge $e$ in a brick $G$ is {\em $b$-invariant} if $G-e$ is matching covered and a tight cut decomposition of $G-e$ contains exactly one brick. A 2-edge-connected cubic graph is {\em essentially 4-edge-connected} if it does not contain nontrivial 3-cuts. A brick $G$ is {\em near-bipartite} if it has a pair of edges $\{e_1, e_2\}$ such that $G-\{e_1,e_2\}$ is bipartite and matching covered. Kothari, de Carvalho, Lucchesi and Little proved that each essentially 4-edge-connected cubic non-near-bipartite brick $G$, distinct from the Petersen graph, has at least $|V(G)|$ $b$-invariant edges. Moreover, they made a conjecture: every essentially 4-edge-connected cubic near-bipartite brick $G$, distinct from $K_4$, has at least $|V(G)|/2$ $b$-invariant edges. We confirm the conjecture in this paper. Furthermore, all the essentially 4-edge-connected cubic near-bipartite bricks, the numbers of $b$-invariant edges of which attain the lower bound, are presented.

math.CO↗

arXiv2019

Equivalence classes in matching covered graphs

A connected graph $G$, of order two or more, is matching covered if each edge lies in some \pema. The tight cut decomposition of a matching covered graph $G$ yields a list of bricks and braces; as per a theorem of Lov{\'a}sz~\cite{lova87}, this list is unique (up to multiple edges); $b(G)$ denotes the number of bricks, and $c_4(G)$ denotes the number of braces that are isomorphic to the cycle $C_4$ (up to multiple edges). Two edges $e$ and $f$ are mutually dependent if, for each perfect matching $M$, $e \in M$ if and only if $f \in M$; Carvalho, Lucchesi and Murty investigated this notion in their landmark paper~\cite{clm99}. For any matching covered graph $G$, mutual dependence is an equivalence relation, and it partitions $E(G)$ into equivalence classes; this equivalence class partition is denoted by $\mathcal{E}_G$ and we refer to its parts as equivalence classes of $G$; we use $\varepsilon(G)$ to denote the cardinality of the largest equivalence class. The operation of `splicing' may be used to construct bigger matching covered graphs from smaller ones; see~\cite{lckm18}; `tight splicing' is a stronger version of `splicing'. (These are converses of the notions of `separating cut' and `tight cut'.) In this article, we answer the following basic question: if a matching covered graph $G$ is obtained by `splicing' (or by `tight splicing') two smaller matching covered graphs, say~$G_1$~and~$G_2$, then how is $\mathcal{E}_G$ related to $\mathcal{E}_{G_1}$ and to $\mathcal{E}_{G_2}$ (and vice versa)? As applications of our findings: firstly, we establish tight upper bounds on $\varepsilon(G)$ in terms of $b(G)$ and $c_4(G)$; secondly, we answer a recent question of He, Wei, Ye and Zhai~\cite{hwyz19}, in the affirmative, by constructing graphs that have arbitrarily high $\kappa(G)$~and~$\varepsilon(G)$ simultaneously, where $\kappa(G)$ denotes the vertex-connectivity.

math.CO↗

arXiv2018

Generalized Hartmann-Shack array of dielectric metalens sub-arrays for polarimetric beam profiling

To define and characterize optical systems, obtaining information on the amplitude, phase, and polarization profile of optical beams is of utmost importance. Polarimetry using bulk optics is well established to characterize the polarization state. Recently, metasurfaces and metalenses have successfully been introduced as compact optical components. Here, we take the metasurface concept to the system level by realizing arrays of metalens 2*3 sub-arrays, allowing to determine the polarization profile of an optical beam. We use silicon-based metalenses with a numerical aperture of 0.32 and a mean measured diffraction efficiency in transmission mode of 28% at 1550 nm wavelength. Together with a standard camera recording the array foci, our system is extremely compact and allows for real-time beam diagnostics by inspecting the foci amplitudes. By further analyzing the foci displacements in the spirit of a Hartmann-Shack wavefront sensor, we can simultaneously detect phase-gradient profiles. As application examples, we diagnose the polarization profiles of a radially polarized beam, an azimuthally polarized beam, and of a vortex beam.

physics.optics↗

arXiv2017

Efficient Graph Edit Distance Computation and Verification via Anchor-aware Lower Bound Estimation

Graph edit distance (GED) is an important similarity measure adopted in a similarity-based analysis between two graphs, and computing GED is a primitive operator in graph database analysis. Partially due to the NP-hardness, the existing techniques for computing GED are only able to process very small graphs with less than 30 vertices. Motivated by this, in this paper we systematically study the problems of both GED computation, and GED verification (i.e., verify whether the GED between two graphs is no larger than a user-given threshold). Firstly, we develop a unified framework that can be instantiated into either a best-first search approach AStar+ or a depth-first search approach DFS+. Secondly, we design anchor-aware lower bound estimation techniques to compute tighter lower bounds for intermediate search states, which significantly reduce the search spaces of both AStar+ and DFS+. We also propose efficient techniques to compute the lower bounds. Thirdly, based on our unified framework, we contrast AStar+ with DFS+ regarding their time and space complexities, and recommend that AStar+ is better than DFS+ by having a much smaller search space. Extensive empirical studies validate that AStar+ performs better than DFS+, and show that our AStar+-BMa approach outperforms the state-of-the-art technique by more than four orders of magnitude.

cs.DB↗

arXiv2017

Topological Dirac Nodal-net Fermions in AlB$_2$-type TiB$_2$ and ZrB$_2$

Based on first-principles calculations and effective model analysis, a Dirac nodal-net semimetal state is recognized in AlB$_2$-type TiB$_2$ and ZrB$_2$ when spin-orbit coupling (SOC) is ignored. Taking TiB$_2$ as an example, there are several topological excitations in this nodal-net structure including triple point, nexus, and nodal link, which are protected by coexistence of spatial-inversion symmetry and time reversal symmetry. This nodal-net state is remarkably different from that of IrF$_4$, which requires sublattice chiral symmetry. In addition, linearly and quadratically dispersed two-dimensional surface Dirac points are identified as having emerged on the B-terminated and Ti-terminated (001) surfaces of TiB$_2$ respectively, which are analogous to those of monolayer and bilayer graphene.

cond-mat.mtrl-sci↗