相关论文: On the Scalability of Quasi-Complementary Sequence…
Given an undirected graph $G$, a quasi-clique is a subgraph of $G$ whose density is at least $\gamma$ $(0 < \gamma \leq 1)$. Two optimization problems can be defined for quasi-cliques: the Maximum Quasi-Clique (MQC) Problem, which finds a…
We discuss parameter dependent polynomial ordinary differential equations that model chemical reaction networks. By classical quasi-steady state (QSS) reduction we understand the following familiar heuristic: Set the rate of change for…
This work extends the universal finite-size scaling framework for continuum percolation from two-dimensional (2D) to quasi-three-dimensional (Q3D) stick systems, in which sequentially deposited wires of finite diameter stack vertically on a…
I summarise what lattice methods can contribute to our understanding of the phenomenology of QCD at large Nc and describe some recent work on the physics of SU(Nc) gauge theories. These non-perturbative calculations show that there is…
We summarize our findings on the quantum moduli constraints and superpotentials of an infinite family of moose extensions of $n_f = n_c$ SUSY QCD. For $n_c=2$, we perform concrete calculations using traditional integrating out techniques as…
How many measurements are fundamentally required to capture a signal. Shannon's information theory established the bedrock of this question in 1948, the Nyquist Shannon theorem set the first answer, and compressed sensing (CS) rewrote it in…
Recently observed empirical scaling laws describe the performance of foundation-type models as three independent key quantities -- dataset size, compute, and model parameters -- are modified. Extracting these scaling laws informs the…
Quantum error correction (QEC) is essential for scalable quantum computing. However, it requires classical decoders that are fast and accurate enough to keep pace with quantum hardware. While quantum low-density parity-check codes have…
The rate regions of multilevel diversity coding systems (MDCS), a sub-class of the broader family of multi-source multi-sink networks with special structure, are investigated. After showing how to enumerate all non-isomorphic MDCS instances…
Quantile-based randomized Kaczmarz (QRK) was recently introduced to efficiently solve sparsely corrupted linear systems $\mathbf{A} \mathbf{x}^*+\mathbf{\epsilon} = \mathbf{b}$ [SIAM J. Matrix Anal. Appl., 43(2), 605-637], where…
Bounded by crossover lines exhibiting universal scaling, the supercritical regime above the critical endpoint is characterized by strong fluctuations and intriguing phenomena. In this study, we extend this notable concept of supercritical…
The construction of complementary sets (CSs) of sequences with different set size and sequence length become important due to its practical application for OFDM systems. Most of the constructions of CSs, based on generalized Boolean…
A major obstacle towards realizing a practical quantum computer is the noise that arises due to system-environment interactions. While it is very well known that quantum error correction (QEC) provides a way to protect against errors that…
Quantized compressive sensing (QCS) deals with the problem of coding compressive measurements of low-complexity signals with quantized, finite precision representations, i.e., a mandatory process involved in any practical sensing model.…
In the framework of QCD sum rules one uses a scheme, allowing one to apply the conditions of both nonrelativistic heavy quark motion inside mesons and independence of nonsplitting nS-state density on the heavy quark flavours. In the leading…
Unveiling universal non-equilibrium scaling laws has been a central theme in modern statistical physics, with recent attention increasingly directed toward non-equilibrium phases that exhibit rich dynamical phenomena. A striking example…
Classical theory for quasi-Newton schemes has focused on smooth deterministic unconstrained optimization while recent forays into stochastic convex optimization have largely resided in smooth, unconstrained, and strongly convex regimes.…
The Minimum Consistent Subset (MCS) problem arises naturally in the context of supervised clustering and instance selection. In supervised clustering, one aims to infer a meaningful partitioning of data using a small labeled subset.…
The quasicontinuum (QC) method, originally proposed by Tadmor, Ortiz and Phillips in 1996, is a computational technique that can efficiently handle regular atomistic lattices by combining continuum and atomistic approaches. In the present…
In this paper we present $LCSk$++: a new metric for measuring the similarity of long strings, and provide an algorithm for its efficient computation. With ever increasing size of strings occuring in practice, e.g. large genomes of plants…