Catalog footprint

What is connected

34works
24topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

34 published item(s)

preprint2026arXiv

Multi-domain Multi-modal Document Classification Benchmark with a Multi-level Taxonomy

Document classification forms the backbone of modern enterprise content management, yet existing benchmarks remain trapped in oversimplified paradigms -- single domain settings with flat label structures -- that bear little resemblance to the hierarchical, multi-modal, and cross-domain nature of real-world business documents. This gap not only misrepresents practical complexity but also stifles progress toward industrially viable document intelligence. To bridge this gap, we construct the first Multi-level, Multi-domain, Multi-modal document classification Benchmark (MMM-Bench). MMM-Bench includes (1) a deeply hierarchical taxonomy spanning five levels that capture the authentic organizational logic of business documentation; and (2) 5,990 real-world multi-modal documents meticulously curated from 12 commercial domains in Alibaba. Each document is manually annotated with a complete hierarchical path by domain experts. We establish comprehensive baselines on MMM-Bench, which consists of open-weight models and API-based models. Through systematic experiments, we identify four fundamental challenges within MMM-Bench and propose corresponding insights. To provide a solid foundation for advancing research in multi-level, multi-domain document classification, we release all of the data and the evaluation toolkit of MMM-Bench at https://github.com/MMMDC-Bench/MMMDC-Bench.

preprint2026arXiv

The Agent's First Day: Benchmarking Learning, Exploration, and Scheduling in the Workplace Scenarios

The rapid evolution of Multi-modal Large Language Models (MLLMs) has advanced workflow automation; however, existing research mainly targets performance upper bounds in static environments, overlooking robustness for stochastic real-world deployment. We identify three key challenges: dynamic task scheduling, active exploration under uncertainty, and continuous learning from experience. To bridge this gap, we introduce \method{}, a dynamic evaluation environment that simulates a "trainee" agent continuously exploring a novel setting. Unlike traditional benchmarks, \method{} evaluates agents along three dimensions: (1) context-aware scheduling for streaming tasks with varying priorities; (2) prudent information acquisition to reduce hallucination via active exploration; and (3) continuous evolution by distilling generalized strategies from rule-based, dynamically generated tasks. Experiments show that cutting-edge agents have significant deficiencies in dynamic environments, especially in active exploration and continual learning. Our work establishes a framework for assessing agent reliability, shifting evaluation from static tests to realistic, production-oriented scenarios. Our codes are available at https://github.com/KnowledgeXLab/EvoEnv

preprint2022arXiv

Analyzing Encoded Concepts in Transformer Language Models

We propose a novel framework ConceptX, to analyze how latent concepts are encoded in representations learned within pre-trained language models. It uses clustering to discover the encoded concepts and explains them by aligning with a large set of human-defined concepts. Our analysis on seven transformer language models reveal interesting insights: i) the latent space within the learned representations overlap with different linguistic concepts to a varying degree, ii) the lower layers in the model are dominated by lexical concepts (e.g., affixation), whereas the core-linguistic concepts (e.g., morphological or syntactic relations) are better represented in the middle and higher layers, iii) some encoded concepts are multi-faceted and cannot be adequately explained using the existing human-defined concepts.

preprint2022arXiv

Decoupled measurement and modeling of interface reaction kinetics of ion-intercalation battery electrodes

Ultrahigh rate performance of active particles used in lithium-ion battery electrodes has been revealed by single-particle measurements, which indicates a huge potential for developing high-power batteries. However, the charging/discharging behaviors of single particles at ultrahigh C-rates can no longer be described by the traditional electrochemical kinetics in such ion-intercalation active materials. In the meantime, regular kinetic measuring methods meet a challenge due to the coupling of interface reaction and solid-state diffusion processes of active particles. Here, we decouple the reaction and diffusion kinetics via time-resolved potential measurements with an interval of 1 ms, revealing that the classical Butler-Volmer equation deviates from the actual relation between current density, overpotential, and Li+ concentration. An interface ion-intercalation model is developed which considers the excess driving force of Li+ (de)intercalation in the charge transfer reaction for ion-intercalation materials. Simulations demonstrate that the proposed model enables accurate prediction of charging/discharging at both single-particle and electrode scales for various active materials. The kinetic limitation processes from single particles to composite electrodes are systematically revealed, promoting rational designs of high-power batteries.

preprint2022arXiv

Discovering Latent Concepts Learned in BERT

A large number of studies that analyze deep neural network models and their ability to encode various linguistic and non-linguistic concepts provide an interpretation of the inner mechanics of these models. The scope of the analyses is limited to pre-defined concepts that reinforce the traditional linguistic knowledge and do not reflect on how novel concepts are learned by the model. We address this limitation by discovering and analyzing latent concepts learned in neural network models in an unsupervised fashion and provide interpretations from the model's perspective. In this work, we study: i) what latent concepts exist in the pre-trained BERT model, ii) how the discovered latent concepts align or diverge from classical linguistic hierarchy and iii) how the latent concepts evolve across layers. Our findings show: i) a model learns novel concepts (e.g. animal categories and demographic groups), which do not strictly adhere to any pre-defined categorization (e.g. POS, semantic tags), ii) several latent concepts are based on multiple properties which may include semantics, syntax, and morphology, iii) the lower layers in the model dominate in learning shallow lexical concepts while the higher layers learn semantic relations and iv) the discovered latent concepts highlight potential biases learned in the model. We also release a novel BERT ConceptNet dataset (BCN) consisting of 174 concept labels and 1M annotated instances.

preprint2022arXiv

Leveraging Data and Analytics for Digital Business Transformation through DataOps: An Information Processing Perspective

Digital business transformation has become increasingly important for organizations. Since transforming business digitally is an ongoing process, it requires an integrated and disciplined approach. Data Operations (DataOps), emerging in practice, can provide organizations with such an approach to leverage data and analytics for digital business transformation. This paper proposes a framework that integrates digital business transformation, data analytics, and DataOps through the lens of information processing theory (IPT). The details of this framework explain how organizations can employ DataOps as an integrated and disciplined approach to understand their analytical information needs and develop the analytical information processing capability required for digital business transformation. DataOps-enabled digital business transformation, in turn, improves organizational performance by improving operational efficiency and creating new business models. This research extends current knowledge on digital transformation by bringing in DataOps and analytics through IPT and thereby provide organizations with a novel approach for their digital business transformations.

preprint2022arXiv

Reinforcement Learning in the Wild: Scalable RL Dispatching Algorithm Deployed in Ridehailing Marketplace

In this study, a real-time dispatching algorithm based on reinforcement learning is proposed and for the first time, is deployed in large scale. Current dispatching methods in ridehailing platforms are dominantly based on myopic or rule-based non-myopic approaches. Reinforcement learning enables dispatching policies that are informed of historical data and able to employ the learned information to optimize returns of expected future trajectories. Previous studies in this field yielded promising results, yet have left room for further improvements in terms of performance gain, self-dependency, transferability, and scalable deployment mechanisms. The present study proposes a standalone RL-based dispatching solution that is equipped with multiple mechanisms to ensure robust and efficient on-policy learning and inference while being adaptable for full-scale deployment. A new form of value updating based on temporal difference is proposed that is more adapted to the inherent uncertainty of the problem. For the driver-order assignment, a customized utility function is proposed that when tuned based on the statistics of the market, results in remarkable performance improvement and interpretability. In addition, for reducing the risk of cancellation after drivers' assignment, an adaptive graph pruning strategy based on the multi-arm bandit problem is introduced. The method is evaluated using offline simulation with real data and yields notable performance improvement. In addition, the algorithm is deployed online in multiple cities under DiDi's operation for A/B testing and is launched in one of the major international markets as the primary mode of dispatch. The deployed algorithm shows over 1.3% improvement in total driver income from A/B testing. In addition, by causal inference analysis, as much as 5.3% improvement in major performance metrics is detected after full-scale deployment.

preprint2022arXiv

Transferable Multi-Agent Reinforcement Learning with Dynamic Participating Agents

We study multi-agent reinforcement learning (MARL) with centralized training and decentralized execution. During the training, new agents may join, and existing agents may unexpectedly leave the training. In such situations, a standard deep MARL model must be trained again from scratch, which is very time-consuming. To tackle this problem, we propose a special network architecture with a few-shot learning algorithm that allows the number of agents to vary during centralized training. In particular, when a new agent joins the centralized training, our few-shot learning algorithm trains its policy network and value network using a small number of samples; when an agent leaves the training, the training process of the remaining agents is not affected. Our experiments show that using the proposed network architecture and algorithm, model adaptation when new agents join can be 100+ times faster than the baseline. Our work is applicable to any setting, including cooperative, competitive, and mixed.

preprint2021arXiv

A Novel Graph-based Computation Offloading Strategy for Workflow Applications in Mobile Edge Computing

With the fast development of mobile edge computing (MEC), there is an increasing demand for running complex applications on the edge. These complex applications can be represented as workflows where task dependencies are explicitly specified. To achieve better Quality of Service (QoS), for instance, faster response time and lower energy consumption, computation offloading is widely used in the MEC environment. However, many existing computation offloading strategies only focus on independent computation tasks but overlook the task dependencies. Meanwhile, most of these strategies are based on search algorithms such as particle swarm optimization (PSO), genetic algorithm (GA) which are often time-consuming and hence not suitable for many delay-sensitive complex applications in MEC. Therefore, a highly efficient graph-based strategy was proposed in our recent work but it can only deal with simple workflow applications with linear (namely sequential) structure. For solving these problems, a novel graph-based strategy is proposed for workflow applications in MEC. Specifically, this strategy can deal with complex workflow applications with nonlinear (viz. parallel, selective and iterative) structures. Meanwhile, the offloading decision plan with the lowest energy consumption of the end-device under the deadline constraint can be found by using the graph-based partition technique. We have comprehensively evaluated our strategy using both a real-world case study on a MEC based UAV (Unmanned Aerial Vehicle) delivery system and extensive simulation experiments on the FogWorkflowSim platform for MEC based workflow applications. The evaluation results successfully demonstrate the effectiveness of our proposed strategy and its overall better performance than other representative strategies.

preprint2021arXiv

EdgeWorkflowReal: An Edge Computing based Workflow Execution Engine for Smart Systems

Current cloud-based smart systems suffer from weaknesses such as high response latency, limited network bandwidth and the restricted computing power of smart end devices which seriously affect the system's QoS (Quality of Service). Recently, given its advantages of low latency, high bandwidth and location awareness, edge computing has become a promising solution for smart systems. However, the development of edge computing based smart systems is a very challenging job for software developers who do not have the skills for the creation of edge computing environments. The management of edge computing resources and computing tasks is also very challenging. Workflow technology has been widely used in smart systems to automate task and resource management, but there does not yet exist a real-world deployable edge computing based workflow execution engine. To fill this gap, we present EdgeWorkflowReal, an edge computing based workflow execution engine for smart systems. EdgeWorkflowReal supports: 1) automatic creation of a real edge computing environment according to user settings; 2) visualized modelling of edge workflow applications; and 3) automatic deployment, monitoring and performance evaluation of edge workflow applications in a smart system.

preprint2020arXiv

Flow2Stereo: Effective Self-Supervised Learning of Optical Flow and Stereo Matching

In this paper, we propose a unified method to jointly learn optical flow and stereo matching. Our first intuition is stereo matching can be modeled as a special case of optical flow, and we can leverage 3D geometry behind stereoscopic videos to guide the learning of these two forms of correspondences. We then enroll this knowledge into the state-of-the-art self-supervised learning framework, and train one single network to estimate both flow and stereo. Second, we unveil the bottlenecks in prior self-supervised learning approaches, and propose to create a new set of challenging proxy tasks to boost performance. These two insights yield a single model that achieves the highest accuracy among all existing unsupervised flow and stereo methods on KITTI 2012 and 2015 benchmarks. More remarkably, our self-supervised method even outperforms several state-of-the-art fully supervised methods, including PWC-Net and FlowNet2 on KITTI 2012.

preprint2016arXiv

Massively parallel dual-comb molecular detection with subharmonic optical parametric oscillators

Mid-infrared (mid-IR) spectroscopy offers unparalleled sensitivity for the detection of trace gases, solids and liquids, which is based on the existence of strong telltale vibrational bands in this part of the spectrum. It was shown more than a decade ago that a dual-comb Fourier spectroscopy could provide superior spectral coverage combined with high resolution and extremely fast data acquisition. Capabilities of this method were limited because of difficulty of producing twins of mutually coherent frequency combs in the mid- IR. Here we report a phase-coherent and broadband dual-comb system that is based on a pair of subharmonic (frequency-divide-by-two) optical parametric oscillators, pumped in turn by two phase-locked thulium fiber lasers at 2-micron wavelength. We demonstrate simultaneous detection of multiple molecular species in the whole band of 3.2-5.3 microns (frequency span 1200 cm^{-1}) augmented by the pump laser band of 1.85-2 microns (span 400 cm^{-1}), with spectral resolution 0.01-0.07 cm^{-1} and acquisition speed of up to 160,000 resolution elements in few seconds.

preprint2015arXiv

Converting Instance Checking to Subsumption: A Rethink for Object Queries over Practical Ontologies

Efficiently querying Description Logic (DL) ontologies is becoming a vital task in various data-intensive DL applications. Considered as a basic service for answering object queries over DL ontologies, instance checking can be realized by using the most specific concept (MSC) method, which converts instance checking into subsumption problems. This method, however, loses its simplicity and efficiency when applied to large and complex ontologies, as it tends to generate very large MSC's that could lead to intractable reasoning. In this paper, we propose a revision to this MSC method for DL SHI, allowing it to generate much simpler and smaller concepts that are specific-enough to answer a given query. With independence between computed MSC's, scalability for query answering can also be achieved by distributing and parallelizing the computations. An empirical evaluation shows the efficacy of our revised MSC method and the significant efficiency achieved when using it for answering object queries.

preprint2015arXiv

Phrase Based Language Model For Statistical Machine Translation

We consider phrase based Language Models (LM), which generalize the commonly used word level models. Similar concept on phrase based LMs appears in speech recognition, which is rather specialized and thus less suitable for machine translation (MT). In contrast to the dependency LM, we first introduce the exhaustive phrase-based LMs tailored for MT use. Preliminary experimental results show that our approach outperform word based LMs with the respect to perplexity and translation quality.

preprint2014arXiv

A Successive Resultant Projection for Cylindrical Algebraic Decomposition

This note shows the equivalence of two projection operators which both can be used in cylindrical algebraic decomposition (CAD) . One is known as Brown's Projection (C. W. Brown (2001)); the other was proposed by Lu Yang in his earlier work (L.Yang and S.~H. Xia (2000)) that is sketched as follows: given a polynomial $f$ in $x_1,\,x_2,\,\cdots$, by $f_1$ denote the resultant of $f$ and its partial derivative with respect to $x_1$ (removing the multiple factors), by $f_2$ denote the resultant of $f_1$ and its partial derivative with respect to $x_2$, (removing the multiple factors), $\cdots$, repeat this procedure successively until the last resultant becomes a univariate polynomial. Making use of an identity, the equivalence of these two projection operators is evident.

preprint2014arXiv

Extract ABox Modules for Efficient Ontology Querying

The extraction of logically-independent fragments out of an ontology ABox can be useful for solving the tractability problem of querying ontologies with large ABoxes. In this paper, we propose a formal definition of an ABox module, such that it guarantees complete preservation of facts about a given set of individuals, and thus can be reasoned independently w.r.t. the ontology TBox. With ABox modules of this type, isolated or distributed (parallel) ABox reasoning becomes feasible, and more efficient data retrieval from ontology ABoxes can be attained. To compute such an ABox module, we present a theoretical approach and also an approximation for $\mathcal{SHIQ}$ ontologies. Evaluation of the module approximation on different types of ontologies shows that, on average, extracted ABox modules are significantly smaller than the entire ABox, and the time for ontology reasoning based on ABox modules can be improved significantly.

preprint2014arXiv

On subgradient projectors

The subgradient projector is of considerable importance in convex optimization because it plays the key role in Polyak's seminal work - and the many papers it spawned - on subgradient projection algorithms for solving convex feasibility problems. In this paper, we offer a systematic study of the subgradient projector. Fundamental properties such as continuity, nonexpansiveness, and monotonicity are investigated. We also discuss the Yamagishi-Yamada operator. Numerous examples illustrate our results.

preprint2014arXiv

On the finite convergence of a projected cutter method

The subgradient projection iteration is a classical method for solving a convex inequality. Motivated by works of Polyak and of Crombez, we present and analyze a more general method for finding a fixed point of a cutter, provided that the fixed point set has nonempty interior. Our assumptions on the parameters are more general than existing ones. Various limiting examples and comparisons are provided.

preprint2013arXiv

Simulation studies of the behavior of positrons in a microtrap with long aspect ratio

The charged particles storage capacity of microtraps (micro-Penning-Malmberg traps) with large length to radius aspect ratios and radii of the order of tens of microns was explored. Simulation studies of the motions of charged particles were conducted with particle-in-cell WARP code and the Charged Particle Optics (CPO) program. The new design of the trap consisted of an array of microtraps with substantially lower end electrodes potential than conventional Penning-Malmberg traps, which makes this trap quite portable. It was computationally shown that each microtrap with 50 micron radius stored positrons with a density (1.6x10^11 cm^-3) even higher than that in conventional Penning-Malmberg traps (about 10^11 cm^-3) while the confinement voltage was only 10 V. It was presented in this work how to evaluate and lower the numerical noise by controlling the modeling parameters so the simulated plasma can evolve toward computational equilibrium. The local equilibrium distribution, where longitudinal force balance is satisfied along each magnetic field line, was attained in time scales of the simulation for plasmas initialized with a uniform density and Boltzmann energy distribution. The charge clouds developed the expected radial soft edge density distribution and rigid rotation evolved to some extent. To reach global equilibrium (i.e. rigid rotation) longer runs are required. The plasma confinement time and its thermalization were independent of the length. The length-dependency, reported in experiments, is due to fabrication and field errors. Computationally, more than one hundred million positrons were trapped in one microtrap with 50 micron radius and 10 cm length immersed in a 7 T uniform, axial magnetic field, and the density scaled as r^-2 down to 3 micron. Larger densities were trapped with higher barrier potentials.

preprint2012arXiv

Exclusive decay of $Υ$ into $J/ψ+χ_{c0,1,2}$

We study the $Υ$ exclusive decay into double charmonium, specifically, the $S$-wave charmonium $ J/ψ$ plus the $P$-wave charmonium $χ_{c0,1,2}$ in the NRQCD factorization framework. Three distinct decay mechanisms, i.e., the strong, electromagnetic and radiative decay channels are included and their interference effects are investigated. The decay processes $Υ(1S,2S,3S)\to J/ψ+χ_{c1,0}$ are predicted to have the branching fractions of order $10^{-6}$, which should be observed in the prospective Super $B$ factory.

preprint2012arXiv

Four Jets as a Probe of O(100 GeV) Physics beyond Standard Model at Hadron Colliders

O(100 GeV) physics beyond the standard model (BSM) could be overlooked provided that it is hidden in the untouched Higgs sector or jets. The top quark forward-backward asymmetry measurements and di-jet bump, which is observed in the associated production with charged lepton plus missing energy (supposed arising from W decay), may indicate the existence of a new color-octet axial-vector Z_C with a mass about 145 GeV. Here Z_C only decays into two jets. In this paper we investigated the possibility to discover Z_C pair via analyzing the four jets as the final states, which are heavily polluted by huge QCD background. Our simulation showed that, however, both Tevatron and LHC have the excellent chance to discover Z_C through analyzing the four jets events in the current accumulated data.

preprint2012arXiv

Inclusive $h_c$ production at $B$ factories

Within the nonrelativistic QCD (NRQCD) factorization framework, we investigate the inclusive production of the $h_c$ meson associated with either light hadrons or charmed hadrons at $B$ factory energy $\sqrt{s}=10.58$ GeV. Both the leading color-singlet and color-octet channels are included. For the $h_c$ production associated with light hadrons, the total production rate is dominated by the color-octet channel, thus the future measurement of this process may impose useful constraint on the value of the color-octet matrix element $<{\cal O}^{h_c}_8({}^1S_0)>$; for the $h_c$ production associated with charmed hadrons, the total production rate is about one order of magnitude smaller, and dominated by the color-singlet channel.

preprint2012arXiv

Low-voltage Driving Phototransistor Based on Dye-sensitized Nanocrystalline Titanium Dioxide Thin Films

Photo-gated transistors based on dye-sensitized nanocrystalline titanium dioxide thin film are established. A transistor-like transport behavior characterized by the linear increase, saturated plateau, and breakdown-like increase in the voltage-current curve is achievable with a low driven bias for the present device. The response current exhibits a linear dependence on the intensity of gated light, and the measured maximum photosensitivity is approximately 0.1 A/W. The dynamic responses for various light frequencies and their dependences on the load resistances are investigated as well. The cut-off frequency of ~50 Hz is abstracted, indicating the potential application for economical and efficient light switch or optical communication unit. The dc photo-gated response is explained by the energy level diagram, and is numerically simulated by an equivalent circuit model, suggesting a clear correlation between photovoltaic and photoconductive behaviors as well as their optical responses.

preprint2012arXiv

The expansion of real forms on the simplex and applications

If n points B_1,---,B_n$ in the standard simplex Δ_n are affinely independent, then they can span an (n-1)-simplex denoted by Λ=Con(B_1,---,B_n). Here Λcorresponds to an n*n matrix [Λ] whose columns are B_1,---,B_n. In this paper, we firstly proved that if Λof diameter sufficiently small contains a point $P$, and f(P)>0 (<0) for a form f in R[X], then the coefficients of f([Λ] X) are all positive (negative). Next, as an application of this result, a necessary and sufficient condition for determining the real zeros on Δ_n of a system of homogeneous algebraic equations with integral coefficients is established.

preprint2011arXiv

$\mathscr{O}(100 GeV)$ Deci-weak $W^\prime/Z^\prime$ at Tevatron and LHC

Recently Tevatron released their measurements on invariant mass spectrum of electron/positron, as well as the di-jet arising from WW+WZ production with one W leptonically decay. Though the statistics is not significant, there are two bumps around 240 GeV and 120-160 GeV respectively. We proposed that the two bumps correspond to the extra light gauge bosons $Z^\prime$ and $W^\prime$, which couple with quarks with the deci-weak strength. In this brief report, we also simulated di-jet invariant mass distribution at the current running LHC.

preprint2011arXiv

$O(α_s v^2)$ correction to pseudoscalar quarkonium decay to two photons

We investigate the $O(α_s v^2)$ correction to the process of pseudoscalar quarkonium decay to two photons in nonrelativistic QCD (NRQCD) factorization framework. The short-distance coefficient associated with the relative-order $v^2$ NRQCD matrix element is determined to next-to-leading order in $α_s$ through the perturbative matching procedure. Some technical subtleties encountered in calculating the ${O(α_s)$ QCD amplitude are thoroughly addressed.

preprint2011arXiv

Anti-measurement Matrix Uncertainty Sparse Signal Recovery for Compressive Sensing

Compressive sensing (CS) is a technique for estimating a sparse signal from the random measurements and the measurement matrix. Traditional sparse signal recovery methods have seriously degeneration with the measurement matrix uncertainty (MMU). Here the MMU is modeled as a bounded additive error. An anti-uncertainty constraint in the form of a mixed L2 and L1 norm is deduced from the sparse signal model with MMU. Then we combine the sparse constraint with the anti-uncertainty constraint to get an anti-uncertainty sparse signal recovery operator. Numerical simulations demonstrate that the proposed operator has a better reconstructing performance with the MMU than traditional methods.

preprint2011arXiv

New Color-Octet Vector Boson Revisit

Motivated by CDF recent measurements on di-jet invariant mass spectrum where di-jet is associated production with charged leptons ($e/μ$) and missing energy, we re-examine the previous proposed massive color-octet axial-vector-like boson $Z_c$. Our simulation showed that the di-jet bump around 120-160 GeV can be induced by $Z_c$ with effective coupling $g_{Z_c q \bar q} =0.2 g_s$ (q represents the quark other than top and $g_s$ is the strong coupling constant). Moreover our numerical investigation indicated that the top quark forward-backward asymmetry $A_{FB}^t$ can be reproduced without distorting shape of differential cross section $dσ/d M_{t\bar t}$, provided that the $Z_c$ and top quark coupling is appropriately chosen ($g_{Z_c t \bar t} \simeq 4.5 g_{Z_c q \bar q}$). Our results also showed that the theoretical $A_{FB}^t$ as functions of $Δy$ and $M_{t\bar t}$ can be consistent with data within $1σ$ and $1.8σ$ respectively.

preprint2011arXiv

Sparse Support Recovery with Phase-Only Measurements

Sparse support recovery (SSR) is an important part of the compressive sensing (CS). Most of the current SSR methods are with the full information measurements. But in practice the amplitude part of the measurements may be seriously destroyed. The corrupted measurements mismatch the current SSR algorithms, which leads to serious performance degeneration. This paper considers the problem of SSR with only phase information. In the proposed method, the minimization of the l1 norm of the estimated sparse signal enforces sparse distribution, while a nonzero constraint of the uncorrupted random measurements' amplitudes with respect to the reconstructed sparse signal is introduced. Because it only requires the phase components of the measurements in the constraint, it can avoid the performance deterioration by corrupted amplitude components. Simulations demonstrate that the proposed phase-only SSR is superior in the support reconstruction accuracy when the amplitude components of the measurements are contaminated.

preprint2010arXiv

"Hard-scattering" approach to very hindered magnetic-dipole transitions in quarkonium

For a class of hindered magnetic dipole ($M1$) transition processes, such as $Υ(3S)\to η_b+γ$ (the discovery channel of the $η_b$ meson), the emitted photon is rather energetic so that the traditional approaches based on multipole expansion may be invalidated. We propose that a "hard-scattering" picture, somewhat analogous to the pion electromagnetic form factor at large momentum transfer, may be more plausible to describe such types of transition processes. We work out a simple factorization formula at lowest order in the strong coupling constant, which involves convolution of the Schrödinger wave functions of quarkonia with a perturbatively calculable part induced by exchange of one semihard gluon between quark and antiquark. This formula, without any freely adjustable parameters, is found to agree with the measured rate of $Υ(3S)\to η_b+γ$ rather well, and can also reasonably account for other recently measured hindered $M1$ transition rates. The branching fractions of $Υ(4S)\to η_b^{(\prime)}+γ$ are also predicted.

preprint2010arXiv

Is the $J^P=2^-$ assignment for the $X(3872)$ compatible with the radiative transition data?

The very recent analysis by BaBar Collaboration indicates that the $X(3872)$ may favor the quantum number $J^{PC}=2^{-+}$ rather than the previously assumed $1^{++}$. By pretending the $η_{c2}(1D)$ charmonium to be the $X(3872)$, we study the parity-even radiative transition processes $η_{c2}(1D)\to J/ψ(ψ')+γ$ within several phenomenological potential models. We take the ${}^3D_1$ admixture in $ψ'$ into account, and consider the contributions from the magnetic dipole ($M1$), electric quadrupole ($E2$), and magnetic octupole ($M3$) amplitudes. It is found that the ratio of the branching fractions of these two channels, as well as the absolute branching fraction of $η_{c2}\to ψ'γ$, are in stark contradiction with the existing \textsc{BaBar} measurements. This may indicate that the $2^{-+}$ assignment for the $X(3872)$ is highly problematic.