arXiv subjects

Chenchen Wu

Publications and source records attributed to Chenchen Wu.

14 recordsLinked to original sources

arXiv2026

Full characterization of core for nonlinear optimization games

We fully characterize the core of a broad class of nonlinear games by identifying a suitable relaxation for inherent nonlinearity, directly generalizing the linear frameworks in the literature. This characterization significantly expands the scope of cooperative games that can be analyzed and contributes to the literature on games induced from optimization models. We apply these insights to not only establish connections with and provide new insights on classical models but also solve new games untamed in the existing literature, including combinatorial quadratic and ratio games such as portfolio, maximum cut, matching, and assortment games. These results are further extended to more general models and also the approximate core.

math.OC↗

arXiv2024

PACKMOL- GUI: An All-in-One VMD Interface for Efficient Molecular Packing

PACKMOL is a widely utilized molecular modeling tool within the computational chemistry community. However, its perceivable advantages have been impeded by the long-standing lack of a robust open-source graphical user interface (GUI) that integrates parameter settings with the visualization of molecular and geometric constraints. To address this limitation, we have developed PACKMOL-GUI, a VMD plugin that leverages the dynamic extensibility of Tcl/Tk toolkit. This GUI enables the configuration of all PACKMOL parameters through an intuitive user panel, while also facilitating the visualization of molecular structures and geometric constraints, including cubes, boxes and spheres, among others via the VMD software. The seamless interaction between VMD and PACKMOL provides an intuitive and efficient all-in-one platform for the packing of complex molecular systems.

physics.chem-ph↗

arXiv2023

Recovering lossless propagation of polaritons with synthesized complex frequency excitation

Surface plasmon polaritons and phonon polaritons offer a means of surpassing the diffraction limit of conventional optics and facilitate efficient energy storage, local field enhancement, high sensitivities, benefitting from their subwavelength confinement of light. Unfortunately, losses severely limit the propagation decay length, thus restricting the practical use of polaritons. While optimizing the fabrication technique can help circumvent the scattering loss of imperfect structures, the intrinsic absorption channel leading to heat production cannot be eliminated. Here, we utilize synthetic optical excitation of complex frequency with virtual gain, synthesized by combining the measurements taken at multiple real frequencies, to restore the lossless propagations of phonon polaritons with significantly reduced intrinsic losses. The concept of synthetic complex frequency excitation represents a viable solution to compensate for loss and would benefit applications including photonic circuits, waveguiding and plasmonic/phononic structured illumination microscopy.

physics.optics↗

arXiv2023

Synthesized complex-frequency excitation for ultrasensitive molecular sensing

Detecting trace molecules remains a significant challenge. Surface-enhanced infrared absorption (SEIRA) based on plasmonic nanostructures, particularly graphene, has emerged as a promising approach to enhance sensing sensitivity. While graphene-based SEIRA offers advantages such as ultrahigh sensitivity and active tunability, intrinsic molecular damping weakens the interaction between vibrational modes and plasmons. Here, we demonstrate ultrahigh-sensitive molecular sensing based on synthesized complex-frequency waves (CFW). Our experiment shows that CFW can amplify the molecular signals (~1.2-nm-thick silk protein layer) detected by graphene-based sensor by at least an order of magnitude and can be universally applied to molecular sensing in different phases. Our approach is highly scalable and can facilitate the investigation of light-matter interactions, enabling diverse potential applications in fields such as optical spectroscopy, metasurfaces, optoelectronics, biomedicine and pharmaceutics.

physics.optics↗

arXiv2022

Parallel algorithms for maximizing one-sided $σ$-smooth function

In this paper, we study the problem of maximizing a monotone normalized one-sided $σ$-smooth ($OSS$ for short) function $F(x)$, subject to a convex polytope. This problem was first introduced by Mehrdad et al. \cite{GSS2021} to characterize the multilinear extension of some set functions. Different with the serial algorithm with name Jump-Start Continuous Greedy Algorithm by Mehrdad et al. \cite{GSS2021}, we propose Jump-Start Parallel Greedy (JSPG for short) algorithm, the first parallel algorithm, for this problem. The approximation ratio of JSPG algorithm is proved to be $((1-e^{-\left(\fracα{α+1}\right)^{2σ}}) ε)$ for any any number $α\in(0,1]$ and $ε>0$. We also prove that our JSPG algorithm runs in $(O(\log n/ε^{2}))$ adaptive rounds and consumes $O(n \log n/ε^{2})$ queries. In addition, we study the stochastic version of maximizing monotone normalized $OSS$ function, in which the objective function $F(x)$ is defined as $F(x)=\mathbb{E}_{y\sim T}f(x,y)$. Here $f$ is a stochastic function with respect to the random variable $Y$, and $y$ is the realization of $Y$ drawn from a probability distribution $T$. For this stochastic version, we design Stochastic Parallel-Greedy (SPG) algorithm, which achieves a result of $F(x)\geq(1 -e^{-\left(\fracα{α+1}\right)^{2σ}}-ε)OPT-O(κ^{1/2})$, with the same time complexity of JSPG algorithm. Here $κ=\frac{\max \{5\|\nabla F(x_{0})-d_{o}\|^{2}, 16σ^{2}+2L^{2}D^{2}\}}{(t+9)^{2/3}}$ is related to the preset parameters $σ, L, D$ and time $t$.

math.OC↗

arXiv2022

Maximizing Modular plus Non-monotone Submodular Functions

The research problem in this work is the relaxation of maximizing non-negative submodular plus modular with the entire real number domain as its value range over a family of down-closed sets. We seek a feasible point $\mathbf{x}^*$ in the polytope of the given constraint such that $\mathbf{x}^*\in\arg\max_{\mathbf{x}\in\mathcal{P}\subseteq[0,1]^n}F(\mathbf{x})+L(\mathbf{x})$, where $F$, $L$ denote the extensions of the underlying submodular function $f$ and modular function $\ell$. We provide an approximation algorithm named \textsc{Measured Continuous Greedy with Adaptive Weights}, which yields a guarantee $F(\mathbf{x})+L(\mathbf{x})\geq \left(1/e-\mathcal{O}(ε)\right)\cdot f(OPT)+\left(\frac{β-e}{e(β-1)}-\mathcal{O}(ε)\right)\cdot\ell(OPT)$ under the assumption that the ratio of non-negative part within $\ell(OPT)$ to the absolute value of its negative part is demonstrated by a parameter $β\in[0, \infty]$, where $OPT$ is the optimal integral solution for the discrete problem. It is obvious that the factor of $\ell(OPT)$ is $1$ when $β=0$, which means the negative part is completely dominant at this time; otherwise the factor is closed to $1/e$ whe $β\rightarrow\infty$. Our work first breaks the restriction on the specific value range of the modular function without assuming non-positivity or non-negativity as previous results and quantifies the relative variation of the approximation guarantee for optimal solutions with arbitrary structure. Moreover, we also give an analysis for the inapproximability of the problem we consider. We show a hardness result that there exists no polynomial algorithm whose output $S$ satisfies $f(S)+\ell(S)\geq0.478\cdot f(OPT)+\ell(OPT)$.

cs.DS↗

arXiv2022

An improved approximation algorithm for maximizing a DR-submodular function over a convex set

Maximizing a DR-submodular function subject to a general convex set is an NP-hard problem arising from many applications in combinatorial optimization and machine learning. While it is highly desirable to design efficient approximation algorithms under this general setting where neither the objective function is monotonic nor the feasible set is down-closed, our main contribution is to present a 0.25-approximation Frank-Wolfe type of algorithm with a sub-exponential time-complexity under the value oracle model.

cs.DS↗

arXiv2021

Approaching the Purcell factor limit with whispering-gallery hyperbolic phonon polaritons in hBN nanotubes

Enhanced light-matter interaction at the nanoscale is pivotal in the foundation of nonlinear optics, quantum optics, and nanophotonics, which are essential for a vast range of applications including single-photon sources, nanolasers, and nanosensors. In this context, the combination of strongly confined polaritons and low-loss nanocavities provides a promising way to enhance light-matter interaction, thus giving rise to a high density of optical states, as quantified by the so-called Purcell factor - the ratio of the decay rate of an optical quantum emitter to its value in free space. Here, we exploit whispering-gallery hyperbolic-phonon-polariton (WG-HPhP) modes in hBN nanotubes (BNNTs) to demonstrate record-high Purcell factors (~10^12) driven by the deep-subwavelength confinement of phonon polaritons and the low intrinsic losses in these atomically smooth nanocavities. Furthermore, the measured Purcell factor increases with decreasing BNNT radius down to 5 nm, a result that extrapolates to ~10^14 in a single-walled BNNT. Our study supports WG-HPhP modes in one-dimensional nanotubes as a powerful platform for investigating ultrastrong light-matter interactions, which open exciting perspectives for applications in single-molecular sensors and nanolasers.

physics.optics↗

arXiv2020

Outliers Detection Is Not So Hard: Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques

In this paper, we consider two types of robust models of the $k$-median/$k$-means problems: the outlier-version ($k$-MedO/$k$-MeaO) and the penalty-version ($k$-MedP/$k$-MeaP), in which we can mark some points as outliers and discard them. In $k$-MedO/$k$-MeaO, the number of outliers is bounded by a given integer. In $k$-MedP/$k$-MeaP, we do not bound the number of outliers, but each outlier will incur a penalty cost. We develop a new technique to analyze the approximation ratio of local search algorithms for these two problems by introducing an adapted cluster that can capture useful information about outliers in the local and the global optimal solution. For $k$-MeaP, we improve the best known approximation ratio based on local search from $25+\varepsilon$ to $9+\varepsilon$. For $k$-MedP, we obtain the best known approximation ratio. For $k$-MedO/$k$-MeaO, there exists only two bi-criteria approximation algorithms based on local search. One violates the outlier constraint (the constraint on the number of outliers), while the other violates the cardinality constraint (the constraint on the number of clusters). We consider the former algorithm and improve its approximation ratios from $17+\varepsilon$ to $3+\varepsilon$ for $k$-MedO, and from $274+\varepsilon$ to $9+\varepsilon$ for $k$-MeaO.

cs.DS↗

arXiv2020

Too Much Information Kills Information: A Clustering Perspective

Clustering is one of the most fundamental tools in the artificial intelligence area, particularly in the pattern recognition and learning theory. In this paper, we propose a simple, but novel approach for variance-based k-clustering tasks, included in which is the widely known k-means clustering. The proposed approach picks a sampling subset from the given dataset and makes decisions based on the data information in the subset only. With certain assumptions, the resulting clustering is provably good to estimate the optimum of the variance-based objective with high probability. Extensive experiments on synthetic datasets and real-world datasets show that to obtain competitive results compared with k-means method (Llyod 1982) and k-means++ method (Arthur and Vassilvitskii 2007), we only need 7% information of the dataset. If we have up to 15% information of the dataset, then our algorithm outperforms both the k-means method and k-means++ method in at least 80% of the clustering tasks, in terms of the quality of clustering. Also, an extended algorithm based on the same idea guarantees a balanced k-clustering result.

cs.LG↗

arXiv2020

Online Joint Placement and Allocation of Virtual Network Functions with Heterogeneous Servers

Network Function Virtualization (NFV) is a promising virtualization technology that has the potential to significantly reduce the expenses and improve the service agility. NFV makes it possible for Internet Service Providers (ISPs) to employ various Virtual Network Functions (VNFs) without installing new equipments. One of the most attractive approaches in NFV technology is a so-called Joint Placement and Allocation of Virtual Network Functions (JPA-VNF) which considers the balance between VNF investment with Quality of Services (QoS). We introduce a novel capability function to measure the potential of locating VNF instances for each server in the proposed OJPA-HS model. This model allows the servers in the network to be heterogeneous, at the same time combines and generalizes many classical JPA-VNF models. Despite its NP-hardness, we present a provable best-possible deterministic online algorithm based on dynamic programming (DP). To conquer the high complexity of DP, we propose two additional randomized heuristics, the Las Vegas (LV) and Monte Carlo (MC) randomized algorithms, which performs even as good as DP with much smaller complexity. Besides, MC is a promising heuristic in practice as it has the advantage to deal with big data environment. Extensive numerical experiments are constructed for the proposed algorithms in the paper.

cs.NI↗

arXiv2019

S-type Negative Differential Resistance in Semiconducting Transition-Metal Dichalcogenides

Current-controlled (also known as "S-type") negative differential resistance (NDR) is of crucial importance to many emerging applications including neuromorphic computing and high-density memristors integration. However, the experimental realization of S-type NDR based on conventional mechanisms poses demanding requirements on materials, which greatly limits their potential applications. Here, we experimentally identify that semiconducting transition metal dichalcogenides (TMDs) can host a bipolar S-type NDR devices. Theoretical simulations indicate that the origin of the NDR in these devices arises from a thermal feedback mechanism. Furthermore, we demonstrate the potential applications of TMDs based S-type NDR device in signal processing and neuromorphic electronics.

cond-mat.mes-hall↗

arXiv2018

Low-Temperature Eutectic Synthesis of PtTe2 with Weak Antilocalization and Controlled Layer Thinning

Metallic transition metal dichalcogenides (TMDs) have exhibited various exotic physical properties and hold the promise of novel optoelectronic and topological devices applications. However, the synthesis of metallic TMDs is based on gas-phase methods and requires high temperature condition. As an alternative to the gas-phase synthetic approach, lower temperature eutectic liquid-phase synthesis presents a very promising approach with the potential for larger-scale and controllable growth of high-quality thin metallic TMDs single crystals. Herein, we report the first realization of low-temperature eutectic liquid-phase synthesis of type-II Dirac semimetal PtTe2 single crystals with thickness ranging from 2 to 200 nm. The electrical measurement of synthesized PtTe2 reveals a record-high conductivity of as high as 3.3*106 S/m at room temperature. Besides, we experimentally identify the weak antilocalization behavior in the type-II Dirac semimetal PtTe2 for the first time. Furthermore, we develop a simple and general strategy to obtain atomically-thin PtTe2 crystal by thinning as-synthesized bulk samples, which can still retain highly crystalline and exhibits excellent electric conductivity. Our results of controllable and scalable low-temperature eutectic liquid-phase synthesis and layer-by-layer thinning of high-quality thin PtTe2 single crystals offer a simple and general approach for obtaining different thickness metallic TMDs with high-melting point transition metal.

cond-mat.mtrl-sci↗

arXiv2015

An improved approximation algorithm for k-median problem using a new factor-revealing LP

The k-median problem is a well-known strongly NP-hard combinatorial optimization problem of both theoretical and practical significance. The previous best approximation ratio for this problem is 2.611+ε(Bryka et al. 2014) based on an (1, 1.95238219) bi-factor approximation algorithm for the classical facility location problem (FLP). This work offers an improved algorithm with an approximation ratio 2.592 +εbased on a new (1, 1.93910094) bi-factor approximation algorithm for the FLP.

cs.DS↗