BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Han Wu

Han Wu contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
math.NTMachine LearningArtificial Intelligencemath.AGComputation and LanguageComputer VisionMethodologyDatabasesphysics.opticsApplicationscond-mat.mtrl-scicond-mat.str-elcond-mat.supr-conCryptography and SecurityDistributed, Parallel, and Cluster ComputingInformation Theorymath.ITmath.STMultiagent SystemsPerformancephysics.app-phRoboticsStatistics Theory

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
36works
0followers
23topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

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

Published work

36 published item(s)

preprint2026arXiv

Bridging Photon Statistics and Phase Transitions in Random Fiber Lasers

Complex systems exhibit rich equilibrium states, yet the universal principles governing these systems remain unrevealed, motivating the search for novel experimental platforms. Random fiber lasers (RFLs), which generate partially-coherent light-wave through feedback from Rayleigh scattering, provide a photonic realization of such systems. Here we report a comprehensive theoretical and experimental investigation of photon statistics for RFLs based on classical second-order temporal correlation function \( g^{(2)}(τ) \), revealing unique statistical properties and introduce a two-dimensional framework for controlling photon statistics. Remarkably, we establish a unified landscape between photon correlation, intensity statistics governed by Levy statistics, and phase transitions with replica symmetry breaking. This multifaceted relationship, observed for the first time, bridges disordered photonics with statistical physics of complex system. Our results offer new pathways for engineering laser emission with controllable photon statistics, and more broadly, this work positions RFLs as a fertile land for exploring emergent behaviors in disordered systems.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

IFPV: An Integrated Multi-Agent Framework for Generative Operational Planning and High-Fidelity Plan Verification

Operational plan generation and verification are critical for modern complex and rapidly changing battlefield environments, yet traditional generation and verification methods still respectively face the challenges of generation infeasibility and verification insufficiency. To alleviate these limitations, we propose an Integrated Multi-Agent Framework for Generative Operational Planning and High-Fidelity Plan Verification (IFPV). IFPV consists of two tightly coupled modules: Multi-Perspective Hierarchical Agents (MPHA) for generative operational planning and an Adversarial Cognitive Simulation Engine (ACSE) for high-fidelity adversarial plan verification. MPHA decomposes commander intent into executable multi-platform tactical action sequences through the collaboration of Pathfinder, Analyst, and Planner agents. ACSE introduces an opponent equipped with a customized world model, which predicts the future evolution of mission-critical platforms and conducts dynamic counteractions against candidate plans. Simulation experiments in the Asymmetric Combat Tactic Simulator (ACTS) show that IFPV improves mission success by 19.4% and reduces operational cost by 41.7% compared with a single-step large language model (LLM) planning baseline. Compared with a traditional rule-based validator, ACSE increases the average suppression rate by 31.8%, indicating that the proposed verification environment is stricter and more discriminative in revealing the latent vulnerabilities of candidate plans. The code for IFPV can be found at https://github.com/zhigao3ks/IFPV.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

MoEMeta: Mixture-of-Experts Meta Learning for Few-Shot Relational Learning

Few-shot knowledge graph relational learning seeks to perform reasoning over relations given only a limited number of training examples. While existing approaches largely adopt a meta-learning framework for enabling fast adaptation to new relations, they suffer from two key pitfalls. First, they learn relation meta-knowledge in isolation, failing to capture common relational patterns shared across tasks. Second, they struggle to effectively incorporate local, task-specific contexts crucial for rapid adaptation. To address these limitations, we propose MoEMeta, a novel meta-learning framework that disentangles globally shared knowledge from task-specific contexts to enable both effective model generalization and rapid adaptation. MoEMeta introduces two key innovations: (i) a mixture-of-experts (MoE) model that learns globally shared relational prototypes to enhance generalization, and (ii) a task-tailored adaptation mechanism that captures local contexts for fast task-specific adaptation. By balancing global generalization with local adaptability, MoEMeta significantly advances few-shot relational learning. Extensive experiments and analyses on three KG benchmarks show that MoEMeta consistently outperforms existing baselines, achieving state-of-the-art performance.

0 citations0 reviewsNo code linkedOpen access
preprint2025arXiv

Towards Improving Interpretability of Language Model Generation through a Structured Knowledge Discovery Approach

Knowledge-enhanced text generation aims to enhance the quality of generated text by utilizing internal or external knowledge sources. While language models have demonstrated impressive capabilities in generating coherent and fluent text, the lack of interpretability presents a substantial obstacle. The limited interpretability of generated text significantly impacts its practical usability, particularly in knowledge-enhanced text generation tasks that necessitate reliability and explainability. Existing methods often employ domain-specific knowledge retrievers that are tailored to specific data characteristics, limiting their generalizability to diverse data types and tasks. To overcome this limitation, we directly leverage the two-tier architecture of structured knowledge, consisting of high-level entities and low-level knowledge triples, to design our task-agnostic structured knowledge hunter. Specifically, we employ a local-global interaction scheme for structured knowledge representation learning and a hierarchical transformer-based pointer network as the backbone for selecting relevant knowledge triples and entities. By combining the strong generative ability of language models with the high faithfulness of the knowledge hunter, our model achieves high interpretability, enabling users to comprehend the model output generation process. Furthermore, we empirically demonstrate the effectiveness of our model in both internal knowledge-enhanced table-to-text generation on the RotoWireFG dataset and external knowledge-enhanced dialogue response generation on the KdConv dataset. Our task-agnostic model outperforms state-of-the-art methods and corresponding language models, setting new standards on the benchmark.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

A Sentence is Worth 128 Pseudo Tokens: A Semantic-Aware Contrastive Learning Framework for Sentence Embeddings

Contrastive learning has shown great potential in unsupervised sentence embedding tasks, e.g., SimCSE. However, We find that these existing solutions are heavily affected by superficial features like the length of sentences or syntactic structures. In this paper, we propose a semantics-aware contrastive learning framework for sentence embeddings, termed Pseudo-Token BERT (PT-BERT), which is able to exploit the pseudo-token space (i.e., latent semantic space) representation of a sentence while eliminating the impact of superficial features such as sentence length and syntax. Specifically, we introduce an additional pseudo token embedding layer independent of the BERT encoder to map each sentence into a sequence of pseudo tokens in a fixed length. Leveraging these pseudo sequences, we are able to construct same-length positive and negative pairs based on the attention mechanism to perform contrastive learning. In addition, we utilize both the gradient-updating and momentum-updating encoders to encode instances while dynamically maintaining an additional queue to store the representation of sentence embeddings, enhancing the encoder's learning performance for negative examples. Experiments show that our model outperforms the state-of-the-art baselines on six standard semantic textual similarity (STS) tasks. Furthermore, experiments on alignments and uniformity losses, as well as hard examples with different sentence lengths and syntax, consistently verify the effectiveness of our method.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Arithmetic of Chatelet surfaces under extensions of base fields

For Châtelet surfaces defined over number fields, we study two arithmetic properties, the Hasse principle and weak approximation, when passing to an extension of the base field. Generalizing a construction of Y. Liang, we show that for an arbitrary extension of number fields $L/K,$ there is a Châtelet surface over $K$ which does not satisfy weak approximation over any intermediate field of $L/K,$ and a Châtelet surface over $K$ which satisfies the Hasse principle over an intermediate field $L'$ if and only if $[L' : K]$ is even.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Bias of Root Numbers for Hilbert Newforms of Cubic Level

We give a general formula of the bias of root numbers for Hilbert modular newforms of cubic level. Explicit calculation is given when the base field is $\mathbb{Q}, \mathbb{Q}(\sqrt{2}), \mathbb{Q}(\sqrt{5})$ and the level is the cube of certain rational integers. This complements a previous result of the second author and extends the bias phenomenon to the number fields. Our method is based on Jacquet-Zagier's trace formula, and the explicit calculation works generally for all real quadratic fields of narrow class number one and for rational cubic levels.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

CBlockSim: A Modular High-Performance Blockchain Simulator

Blockchain has attracted much attention from both academia and industry since emerging in 2008. Due to the inconvenience of the deployment of large-scale blockchains, blockchain simulators are used to facilitate blockchain design and implementation. We evaluate state-of-the-art simulators applied to both Bitcoin and Ethereum and find that they suffer from low performance and scalability which are significant limitations. To build a more general and faster blockchain simulator, we extend an existing blockchain simulator, i.e. BlockSim. We add a network module integrated with a network topology generation algorithm and a block propagation algorithm to generate a realistic blockchain network and simulate the block propagation efficiently. We design a binary transaction pool structure and migrate BlockSim from Python to C++ so that bitwise operations can be used to accelerate the simulation and reduce memory usage. Moreover, we modularize the simulator based on five primary blockchain processes. Significant blockchain elements including consensus protocols (PoW and PoS), information propagation algorithms (Gossip) and finalization rules (Longest rule and GHOST rule) are implemented in individual modules and can be combined flexibly to simulate different types of blockchains. Experiments demonstrate that the new simulator reduces the simulation time by an order of magnitude and improves scalability, enabling us to simulate more than ten thousand nodes, roughly the size of the Bitcoin and Ethereum networks. Two typical use cases are proposed to investigate network-related issues which are not covered by most other simulators.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

CMT: Convolutional Neural Networks Meet Vision Transformers

Vision transformers have been successfully applied to image recognition tasks due to their ability to capture long-range dependencies within an image. However, there are still gaps in both performance and computational cost between transformers and existing convolutional neural networks (CNNs). In this paper, we aim to address this issue and develop a network that can outperform not only the canonical transformers, but also the high-performance convolutional models. We propose a new transformer based hybrid network by taking advantage of transformers to capture long-range dependencies, and of CNNs to model local features. Furthermore, we scale it to obtain a family of models, called CMTs, obtaining much better accuracy and efficiency than previous convolution and transformer based models. In particular, our CMT-S achieves 83.5% top-1 accuracy on ImageNet, while being 14x and 2x smaller on FLOPs than the existing DeiT and EfficientNet, respectively. The proposed CMT-S also generalizes well on CIFAR10 (99.2%), CIFAR100 (91.7%), Flowers (98.7%), and other challenging vision datasets such as COCO (44.3% mAP), with considerably less computational cost.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Ensemble Method for Estimating Individualized Treatment Effects

In many medical and business applications, researchers are interested in estimating individualized treatment effects using data from a randomized experiment. For example in medical applications, doctors learn the treatment effects from clinical trials and in technology companies, researchers learn them from A/B testing experiments. Although dozens of machine learning models have been proposed for this task, it is challenging to determine which model will be best for the problem at hand because ground-truth treatment effects are unobservable. In contrast to several recent papers proposing methods to select one of these competing models, we propose an algorithm for aggregating the estimates from a diverse library of models. We compare ensembling to model selection on 43 benchmark datasets, and find that ensembling wins almost every time. Theoretically, we prove that our ensemble model is (asymptotically) at least as accurate as the best model under consideration, even if the number of candidate models is allowed to grow with the sample size.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Interpretable Personalized Experimentation

Black-box heterogeneous treatment effect (HTE) models are increasingly being used to create personalized policies that assign individuals to their optimal treatments. However, they are difficult to understand, and can be burdensome to maintain in a production environment. In this paper, we present a scalable, interpretable personalized experimentation system, implemented and deployed in production at Meta. The system works in a multiple treatment, multiple outcome setting typical at Meta to: (1) learn explanations for black-box HTE models; (2) generate interpretable personalized policies. We evaluate the methods used in the system on publicly available data and Meta use cases, and discuss lessons learnt during the development of the system.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Learning Localization-aware Target Confidence for Siamese Visual Tracking

Siamese tracking paradigm has achieved great success, providing effective appearance discrimination and size estimation by the classification and regression. While such a paradigm typically optimizes the classification and regression independently, leading to task misalignment (accurate prediction boxes have no high target confidence scores). In this paper, to alleviate this misalignment, we propose a novel tracking paradigm, called SiamLA. Within this paradigm, a series of simple, yet effective localization-aware components are introduced, to generate localization-aware target confidence scores. Specifically, with the proposed localization-aware dynamic label (LADL) loss and localization-aware label smoothing (LALS) strategy, collaborative optimization between the classification and regression is achieved, enabling classification scores to be aware of location state, not just appearance similarity. Besides, we propose a separate localization branch, centered on a localization-aware feature aggregation (LAFA) module, to produce location quality scores to further modify the classification scores. Consequently, the resulting target confidence scores, are more discriminative for the location state, allowing accurate prediction boxes tend to be predicted as high scores. Extensive experiments are conducted on six challenging benchmarks, including GOT-10k, TrackingNet, LaSOT, TNL2K, OTB100 and VOT2018. Our SiamLA achieves state-of-the-art performance in terms of both accuracy and efficiency. Furthermore, a stability analysis reveals that our tracking paradigm is relatively stable, implying the paradigm is potential to real-world applications.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Non-invariance of weak approximation with Brauer--Manin obstruction

In this paper, we study weak approximation with Brauer--Manin obstruction with respect to extensions of number fields. For any nontrivial extension $L/K,$ assuming a conjecture of M. Stoll, we prove that there exists a $K$-threefold satisfying weak approximation with Brauer--Manin obstruction off all archimedean places, while its base change to $L$ fails. Then we illustrate this construction with an explicit unconditional example.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Non-invariance of weak approximation with Brauer-Manin obstruction for surfaces

In this paper, we study the property of weak approximation with Brauer-Manin obstruction for surfaces with respect to field extensions of number fields. For any nontrivial extension of number fields L/K, assuming a conjecture of M. Stoll, we construct a smooth, projective, and geometrically connected surface over K such that it satisfies weak approximation with Brauer-Manin obstruction off all archimedean places, while its base change to L fails. Then we illustrate this construction with an explicit unconditional example.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Nonsymmorphic Symmetry-Protected Band Crossings in a Square-Net Metal PtPb$_4$

Topological semimetals with symmetry-protected band crossings have emerged as a rich landscape to explore intriguing electronic phenomena. Nonsymmorphic symmetries in particular have been shown to play an important role in protecting the crossings along a line (rather than a point) in momentum space. Here we report experimental and theoretical evidence for Dirac nodal line crossings along the Brillouin zone boundaries in PtPb$_4$, arising from the nonsymmorphic symmetry of its crystal structure. Interestingly, while the nodal lines would remain gapless in the absence of spin-orbit coupling (SOC), the SOC in this case plays a detrimental role to topology by lifting the band degeneracy everywhere except at a set of isolated points. Nevertheless, the nodal line is observed to have a bandwidth much smaller than that found in density functional theory (DFT). Our findings reveal PtPb$_4$ to be a material system with narrow crossings approximately protected by non-symmorhpic crystalline symmetries.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

On Joint Communication and Channel Discrimination

We consider a basic communication and sensing setup comprising a transmitter, a receiver and a sensor. The transmitter sends an encoded sequence to the receiver through a discrete memoryless channel, and the receiver is interested in decoding the sequence. On the other hand, the sensor picks up a noisy version of the transmitted sequence through one of two possible discrete memoryless channels. The sensor knows the transmitted sequence and wishes to discriminate between the two possible channels, i.e. to identify the channel that has generated the output given the input. We study the trade-off between communication and sensing in the asymptotic regime, captured in terms of the coding rate to the receiver against the discrimination error exponent at the sensor. We characterize the optimal rate-exponent trade-off for general discrete memoryless channels with an input cost constraint.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

On Motohashi's formula

We complement and offer a new perspective of the proof of a Motohashi-type formula relating the fourth moment of $L$-functions for $\mathrm{GL}_1$ with the third moment of $L$-functions for $\mathrm{GL}_2$ over number fields, studied earlier by Michel-Venkatesh and Nelson. Our main tool is a new type of pre-trace formula with test functions on $\mathrm{M}_2(\mathbb{A})$ instead of $\mathrm{GL}_2(\mathbb{A})$, on whose spectral side the matrix coefficients are replaced by the standard Godement-Jacquet zeta integrals. This is also a generalization of Bruggeman-Motohashi's other proof of Motohashi's formula. We give a variation of our method in the case of division quaternion algebras instead of $\mathrm{M}_2$, yielding a new spectral reciprocity, for which we are not sure if it is within the period formalism given by Michel-Venkatesh. We also indicate a further possible generalization, which seems to be beyond what the period method can offer.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Partial Likelihood Thompson Sampling

We consider the problem of deciding how best to target and prioritize existing vaccines that may offer protection against new variants of an infectious disease. Sequential experiments are a promising approach; however, challenges due to delayed feedback and the overall ebb and flow of disease prevalence make available methods inapplicable for this task. We present a method, partial likelihood Thompson sampling, that can handle these challenges. Our method involves running Thompson sampling with belief updates determined by partial likelihood each time we observe an event. To test our approach, we ran a semi-synthetic experiment based on 200 days of COVID-19 infection data in the US.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Radiation build-up and dissipation in random fiber laser

Random fiber laser (RFL) is a complex physical system that arises from the distributed amplification and the intrinsic stochasticity of the fiber scattering. There has been widespread interest in analyzing the underlying lightwave kinetics at steady state. However, the transient state, such as the RFL build-up and dissipation, is also particularly important for unfolding lightwave interaction process. Here, we investigate for the first time the RFL dynamics at transient state, and track the RFL temporal and spectral evolution theoretically and experimentally. Particularly, with the contribution of randomly distributed feedback, the build-up of RFL shows continuous Verhulst logistic growth curves without cavity-related features, which is significantly different from the step-like growth curve of conventional fiber lasers. Furthermore, the radiation build-up duration is inversely related to the pump power, and the spectral evolution of RFL undergoes two phases from spectral density increase to spectral broadening. From steady-state to pump switch-off state, the RFL output power dissipates immediately, and the remaining Stokes lightwave from the Rayleigh scattering will gradually disappear after one round-trip. This work provides new insights into the transient dynamics features of the RFL.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Stacked conductive metal organic framework nanorods for high performance vacuum electronic devices

Metal-organic frameworks (MOFs) possessing many unique features have been utilized in several fields in recent years. However, their application in field emission (FE) vacuum electronic device is hindered by their poor electrical conductivity. Herein, a novel conductive MOF of Cu-catecholate (Cu-CAT) with the nanorod length of 200 nm and conductivity of 0.01 S/cm is grown on the graphite paper (GP). Under an applied electric field, a large number of electrons can be emitted from the nanoscale emitter tips of MOF surface to the anode. The great field emission performance of Cu-CAT@GP cold cathode film including a low turn-on field of 0.59e6 V/m and ultra-high field enhancement factor of 29622, even comparable to most carbon-based materials that have been widely investigated in FE studies, is achieved in this work. Meanwhile, Cu-CAT@GP film has a good electrical stability with a current attenuation of 9.4% in two hours. The findings reveal the cathode film fabricated by conductive MOF can be a promising candidate of cold electron source for vacuum electronic applications.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Thompson Sampling with Unrestricted Delays

We investigate properties of Thompson Sampling in the stochastic multi-armed bandit problem with delayed feedback. In a setting with i.i.d delays, we establish to our knowledge the first regret bounds for Thompson Sampling with arbitrary delay distributions, including ones with unbounded expectation. Our bounds are qualitatively comparable to the best available bounds derived via ad-hoc algorithms, and only depend on delays via selected quantiles of the delay distributions. Furthermore, in extensive simulation experiments, we find that Thompson Sampling outperforms a number of alternative proposals, including methods specifically designed for settings with delayed feedback.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Zero-shot Cross-lingual Conversational Semantic Role Labeling

While conversational semantic role labeling (CSRL) has shown its usefulness on Chinese conversational tasks, it is still under-explored in non-Chinese languages due to the lack of multilingual CSRL annotations for the parser training. To avoid expensive data collection and error-propagation of translation-based methods, we present a simple but effective approach to perform zero-shot cross-lingual CSRL. Our model implicitly learns language-agnostic, conversational structure-aware and semantically rich representations with the hierarchical encoders and elaborately designed pre-training objectives. Experimental results show that our model outperforms all baselines by large margins on two newly collected English CSRL test sets. More importantly, we confirm the usefulness of CSRL to non-Chinese conversational tasks such as the question-in-context rewriting task in English and the multi-turn dialogue response generation tasks in English, German and Japanese by incorporating the CSRL information into the downstream conversation-based models. We believe this finding is significant and will facilitate the research of non-Chinese dialogue tasks which suffer the problems of ellipsis and anaphora.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Châtelet surfaces and non-invariance of the Brauer-Manin obstruction for $3$-folds

In this paper, we construct three kinds of Châtelet surfaces, which have some given arithmetic properties with respect to field extensions of number fields. We then use these constructions to study the properties of weak approximation with Brauer-Manin obstruction and the Hasse principle with Brauer-Manin obstruction for $3$-folds, which are pencils of Châtelet surfaces parameterized by a curve, with respect to field extensions of number fields. We give general constructions (conditional on a conjecture of M. Stoll) to negatively answer some questions, and illustrate these constructions and some exceptions with some explicit unconditional examples.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Non-Thermal Emergence of an Orbital-Selective Mott Phase in FeTe$_{1-x}$Se$_x$

Electronic correlation is of fundamental importance to high temperature superconductivity. Iron-based superconductors are believed to possess moderate correlation strength, which combined with their multi-orbital nature makes them a fascinating platform for the emergence of exotic phenomena. A particularly striking form is the emergence of an orbital selective Mott phase, where the localization of a subset of orbitals leads to a drastically reconstructed Fermi surface. Here, we report spectroscopic evidence of the reorganization of the Fermi surface from FeSe to FeTe as Se is substituted by Te. We uncover a particularly transparent way to visualize the localization of the $d_{xy}$ electron orbital through the suppression of its hybridization with the more coherent $d$ electron orbitals, which leads to a redistribution of the orbital-dependent spectral weight near the Fermi level. These noteworthy features of the Fermi surface are accompanied by a divergent behavior of a band renormalization in the $d_{xy}$ orbital. All of our observations are further supported by our theoretical calculations to be salient spectroscopic signatures of such a non-thermal evolution from a strongly correlated metallic phase towards an orbital-selective Mott phase in FeTe$_{1-x}$Se$_x$ as Se concentration is reduced.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

CoinMagic: A Differential Privacy Framework for Ring Signature Schemes

By allowing users to obscure their transactions via including "mixins" (chaff coins), ring signature schemes have been widely used to protect a sender's identity of a transaction in privacy-preserving blockchain systems, like Monero and Bytecoin. However, recent works point out that the existing ring signature scheme is vulnerable to the "chain-reaction" analysis (i.e., the spent coin in a given ring signature can be deduced through elimination). Especially, when the diversity of mixins is low, the spent coin will have a high risk to be detected. To overcome the weakness, the ring signature should be consisted of a set of mixins with high diversity and produce observations having "similar" distributions for any two coins. In this paper, we propose a notion, namely $ε$-coin-indistinguishability ($ε$-CI), to formally define the "similar" distribution guaranteed through a differential privacy scheme. Then, we formally define the CI-aware mixins selection problem with disjoint-superset constraint (CIA-MS-DS), which aims to find a mixin set that has maximal diversity and satisfies the constraints of $ε$-CI and the budget. In CIA-MS-DS, each ring signature is either disjoint with or the superset of its preceding ring signatures. We prove that CIA-MS-DS is NP-hard and thus intractable. To solve the CIA-MS-DS problem, we propose two approximation algorithms, namely the Progressive Algorithm and the Game Theoretic Algorithm, with theoretic guarantees. Through extensive experiments on both real data sets and synthetic data sets, we demonstrate the efficiency and the effectiveness of our approaches.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Deep Technology Tracing for High-tech Companies

Technological change and innovation are vitally important, especially for high-tech companies. However, factors influencing their future research and development (R&D) trends are both complicated and various, leading it a quite difficult task to make technology tracing for high-tech companies. To this end, in this paper, we develop a novel data-driven solution, i.e., Deep Technology Forecasting (DTF) framework, to automatically find the most possible technology directions customized to each high-tech company. Specially, DTF consists of three components: Potential Competitor Recognition (PCR), Collaborative Technology Recognition (CTR), and Deep Technology Tracing (DTT) neural network. For one thing, PCR and CTR aim to capture competitive relations among enterprises and collaborative relations among technologies, respectively. For another, DTT is designed for modeling dynamic interactions between companies and technologies with the above relations involved. Finally, we evaluate our DTF framework on real-world patent data, and the experimental results clearly prove that DTF can precisely help to prospect future technology emphasis of companies by exploiting hybrid factors.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Hit-Detector: Hierarchical Trinity Architecture Search for Object Detection

Neural Architecture Search (NAS) has achieved great success in image classification task. Some recent works have managed to explore the automatic design of efficient backbone or feature fusion layer for object detection. However, these methods focus on searching only one certain component of object detector while leaving others manually designed. We identify the inconsistency between searched component and manually designed ones would withhold the detector of stronger performance. To this end, we propose a hierarchical trinity search framework to simultaneously discover efficient architectures for all components (i.e. backbone, neck, and head) of object detector in an end-to-end manner. In addition, we empirically reveal that different parts of the detector prefer different operators. Motivated by this, we employ a novel scheme to automatically screen different sub search spaces for different components so as to perform the end-to-end search for each component on the corresponding sub search space efficiently. Without bells and whistles, our searched architecture, namely Hit-Detector, achieves 41.4\% mAP on COCO minival set with 27M parameters. Our implementation is available at https://github.com/ggjy/HitDet.pytorch.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Time-of-Flight LiDAR-based Precise Mapping

Last two decades, the problem of robotic mapping has made a lot of progress in the research community. However, since the data provided by the sensor still contains noise, how to obtain an accurate map is still an open problem. In this note, we analyze the problem from the perspective of mathematical analysis and propose a probabilistic map update method based on multiple explorations. The proposed method can help us estimate the number of rounds of robot exploration, which is meaningful for the hardware and time costs of the task.

0 citations0 reviewsNo code linkedOpen access
preprint2019arXiv

Deducing Selberg trace formula via Rankin-Selberg method for $\mathrm{GL}_2$

In the 80s, Zagier and Jacquet-Zagier tried to derive the Selberg trace formula by applying the Rankin-Selberg method to the automorphic kernel function. Their derivation was incomplete due to a puzzle of the computation of a residue. We solve this puzzle and complete the derivation. The main input is an extension of the theory of regularized integrals invented by Zagier, which is of independent interest.

0 citations0 reviewsNo code linkedOpen access