Searcharxiv⌕ Search

arXiv subjects

Bo Huang

Publications and source records attributed to Bo Huang.

At least 55 records · Page 3Linked to original sources
arXiv2024

EFACT: an External Function Auto-Completion Tool to Strengthen Static Binary Lifting

Static binary lifting is essential in binary rewriting frameworks. Existing tools overlook the impact of External Function Completion (EXFC) in static binary lifting. EXFC recovers the prototypes of External Functions (EXFs, functions defined in standard shared libraries) using only the function symbols available. Incorrect EXFC can misinterpret the source binary, or cause memory overflows in static binary translation, which eventually results in program crashes. Notably, existing tools struggle to recover the prototypes of mangled EXFs originating from binaries compiled from C++. Moreover, they require time-consuming manual processing to support new libraries. This paper presents EFACT, an External Function Auto-Completion Tool for static binary lifting. Our EXF recovery algorithm better recovers the prototypes of mangled EXFs, particularly addressing the template specialization mechanism in C++. EFACT is designed as a lightweight plugin to strengthen other static binary rewriting frameworks in EXFC. Our evaluation shows that EFACT outperforms RetDec and McSema in mangled EXF recovery by 96.4% and 97.3% on SPEC CPU 2017. Furthermore, we delve deeper into static binary translation and address several cross-ISA EXFC problems. When integrated with McSema, EFACT correctly translates 36.7% more benchmarks from x86-64 to x86-64 and 93.6% more from x86-64 to AArch64 than McSema alone on EEMBC.

cs.SE↗
arXiv2024

On the magnetic field properties of protostellar envelopes in Orion

We present 870 um polarimetric observations toward 61 protostars in the Orion molecular clouds, with ~400 au (1") resolution using the Atacama Large Millimeter/submillimeter Array. We successfully detect dust polarization and outflow emission in 56 protostars, in 16 of them the polarization is likely produced by self-scattering. Self-scattering signatures are seen in several Class 0 sources, suggesting that grain growth appears to be significant in disks at earlier protostellar phases. For the rest of the protostars, the dust polarization traces the magnetic field, whose morphology can be approximately classified into three categories: standard-hourglass, rotated-hourglass (with its axis perpendicular to outflow), and spiral-like morphology. 40.0% (+-3.0%) of the protostars exhibit a mean magnetic field direction approximately perpendicular to the outflow on several 100--1000 au scales. However, in the remaining sample, this relative orientation appears to be random, probably due to the complex set of morphologies observed. Furthermore, we classify the protostars into three types based on the C17O (3--2) velocity envelope's gradient: perpendicular to outflow, non-perpendicular to outflow, and unresolved gradient (<1.0~km/s/arcsec). In protostars with a velocity gradient perpendicular to outflow, the magnetic field lines are preferentially perpendicular to outflow, most of them exhibit a rotated hourglass morphology, suggesting that the magnetic field has been overwhelmed by gravity and angular momentum. Spiral-like magnetic fields are associated with envelopes having large velocity gradients, indicating that the rotation motions are strong enough to twist the field lines. All of the protostars with a standard-hourglass field morphology show no significant velocity gradient due to the strong magnetic braking.

astro-ph.GA↗
arXiv2024

Xiwu: A Basis Flexible and Learnable LLM for High Energy Physics

Large Language Models (LLMs) are undergoing a period of rapid updates and changes, with state-of-the-art (SOTA) model frequently being replaced. When applying LLMs to a specific scientific field, it's challenging to acquire unique domain knowledge while keeping the model itself advanced. To address this challenge, a sophisticated large language model system named as Xiwu has been developed, allowing you switch between the most advanced foundation models and quickly teach the model domain knowledge. In this work, we will report on the best practices for applying LLMs in the field of high-energy physics (HEP), including: a seed fission technology is proposed and some data collection and cleaning tools are developed to quickly obtain domain AI-Ready dataset; a just-in-time learning system is implemented based on the vector store technology; an on-the-fly fine-tuning system has been developed to facilitate rapid training under a specified foundation model. The results show that Xiwu can smoothly switch between foundation models such as LLaMA, Vicuna, ChatGLM and Grok-1. The trained Xiwu model is significantly outperformed the benchmark model on the HEP knowledge question-and-answering and code generation. This strategy significantly enhances the potential for growth of our model's performance, with the hope of surpassing GPT-4 as it evolves with the development of open-source models. This work provides a customized LLM for the field of HEP, while also offering references for applying LLM to other fields, the corresponding codes are available on Github.

hep-ph↗
arXiv2024

Bridging the Gap between Chemical Reaction Pretraining and Conditional Molecule Generation with a Unified Model

Chemical reactions are the fundamental building blocks of drug design and organic chemistry research. In recent years, there has been a growing need for a large-scale deep-learning framework that can efficiently capture the basic rules of chemical reactions. In this paper, we have proposed a unified framework that addresses both the reaction representation learning and molecule generation tasks, which allows for a more holistic approach. Inspired by the organic chemistry mechanism, we develop a novel pretraining framework that enables us to incorporate inductive biases into the model. Our framework achieves state-of-the-art results on challenging downstream tasks. By possessing chemical knowledge, our generative framework overcome the limitations of current molecule generation models that rely on a small number of reaction templates. In the extensive experiments, our model generates synthesizable drug-like structures of high quality. Overall, our work presents a significant step toward a large-scale deep-learning framework for a variety of reaction-based applications.

cs.LG↗
arXiv2024

Mapping electrostatic potential in electrolyte solution

Mapping the electrostatic potential (ESP) distribution around ions in electrolyte solution is crucial for the establishment of a microscopic understanding of electrolyte solution properties. For solutions in the bulk phase, it has not been possible to measure the ESP distribution on Angstrom scale. Here we show that liquid electron scattering experiment using state-of-the-art relativistic electron beam can be used to measure the Debye screening length of aqueous LiCl, KCl, and KI solutions across a wide range of concentrations. We observe that the Debye screening length is long-ranged at low concentration and short-ranged at high concentration, providing key insight into the decades-long debate over whether the impact of ions in water is long-ranged or short-ranged. In addition, we show that the measured ESP can be used to retrieve the non-local dielectric function of electrolyte solution, which can serve as a promising route to investigate the electrostatic origin of special ion effects. Our observations show that, interaction, as one of the two fundamental perspectives for understanding electrolyte solution, can provide much richer information than structure.

cond-mat.soft↗
arXiv2024

MetaSeg: Content-Aware Meta-Net for Omni-Supervised Semantic Segmentation

Noisy labels, inevitably existing in pseudo segmentation labels generated from weak object-level annotations, severely hampers model optimization for semantic segmentation. Previous works often rely on massive hand-crafted losses and carefully-tuned hyper-parameters to resist noise, suffering poor generalization capability and high model complexity. Inspired by recent advances in meta learning, we argue that rather than struggling to tolerate noise hidden behind clean labels passively, a more feasible solution would be to find out the noisy regions actively, so as to simply ignore them during model optimization. With this in mind, this work presents a novel meta learning based semantic segmentation method, MetaSeg, that comprises a primary content-aware meta-net (CAM-Net) to sever as a noise indicator for an arbitrary segmentation model counterpart. Specifically, CAM-Net learns to generate pixel-wise weights to suppress noisy regions with incorrect pseudo labels while highlighting clean ones by exploiting hybrid strengthened features from image content, providing straightforward and reliable guidance for optimizing the segmentation model. Moreover, to break the barrier of time-consuming training when applying meta learning to common large segmentation models, we further present a new decoupled training strategy that optimizes different model layers in a divide-and-conquer manner. Extensive experiments on object, medical, remote sensing and human segmentation shows that our method achieves superior performance, approaching that of fully supervised settings, which paves a new promising way for omni-supervised semantic segmentation.

cs.CV↗
arXiv2023

SAM-Assisted Remote Sensing Imagery Semantic Segmentation with Object and Boundary Constraints

Semantic segmentation of remote sensing imagery plays a pivotal role in extracting precise information for diverse down-stream applications. Recent development of the Segment Anything Model (SAM), an advanced general-purpose segmentation model, has revolutionized this field, presenting new avenues for accurate and efficient segmentation. However, SAM is limited to generating segmentation results without class information. Consequently, the utilization of such a powerful general vision model for semantic segmentation in remote sensing images has become a focal point of research. In this paper, we present a streamlined framework aimed at leveraging the raw output of SAM by exploiting two novel concepts called SAM-Generated Object (SGO) and SAM-Generated Boundary (SGB). More specifically, we propose a novel object loss and further introduce a boundary loss as augmentative components to aid in model optimization in a general semantic segmentation framework. Taking into account the content characteristics of SGO, we introduce the concept of object consistency to leverage segmented regions lacking semantic information. By imposing constraints on the consistency of predicted values within objects, the object loss aims to enhance semantic segmentation performance. Furthermore, the boundary loss capitalizes on the distinctive features of SGB by directing the model's attention to the boundary information of the object. Experimental results on two well-known datasets, namely ISPRS Vaihingen and LoveDA Urban, demonstrate the effectiveness of our proposed method. The source code for this work will be accessible at https://github.com/sstary/SSRS.

cs.CV↗
arXiv2023

PEACE: Prototype lEarning Augmented transferable framework for Cross-domain rEcommendation

To help merchants/customers to provide/access a variety of services through miniapps, online service platforms have occupied a critical position in the effective content delivery, in which how to recommend items in the new domain launched by the service provider for customers has become more urgent. However, the non-negligible gap between the source and diversified target domains poses a considerable challenge to cross-domain recommendation systems, which often leads to performance bottlenecks in industrial settings. While entity graphs have the potential to serve as a bridge between domains, rudimentary utilization still fail to distill useful knowledge and even induce the negative transfer issue. To this end, we propose PEACE, a Prototype lEarning Augmented transferable framework for Cross-domain rEcommendation. For domain gap bridging, PEACE is built upon a multi-interest and entity-oriented pre-training architecture which could not only benefit the learning of generalized knowledge in a multi-granularity manner, but also help leverage more structural information in the entity graph. Then, we bring the prototype learning into the pre-training over source domains, so that representations of users and items are greatly improved by the contrastive prototype learning module and the prototype enhanced attention mechanism for adaptive knowledge utilization. To ease the pressure of online serving, PEACE is carefully deployed in a lightweight manner, and significant performance improvements are observed in both online and offline environments.

cs.IR↗
arXiv2023

Dataset Distillation via Adversarial Prediction Matching

Dataset distillation is the technique of synthesizing smaller condensed datasets from large original datasets while retaining necessary information to persist the effect. In this paper, we approach the dataset distillation problem from a novel perspective: we regard minimizing the prediction discrepancy on the real data distribution between models, which are respectively trained on the large original dataset and on the small distilled dataset, as a conduit for condensing information from the raw data into the distilled version. An adversarial framework is proposed to solve the problem efficiently. In contrast to existing distillation methods involving nested optimization or long-range gradient unrolling, our approach hinges on single-level optimization. This ensures the memory efficiency of our method and provides a flexible tradeoff between time and memory budgets, allowing us to distil ImageNet-1K using a minimum of only 6.5GB of GPU memory. Under the optimal tradeoff strategy, it requires only 2.5$\times$ less memory and 5$\times$ less runtime compared to the state-of-the-art. Empirically, our method can produce synthetic datasets just 10% the size of the original, yet achieve, on average, 94% of the test accuracy of models trained on the full original datasets including ImageNet-1K, significantly surpassing state-of-the-art. Additionally, extensive tests reveal that our distilled datasets excel in cross-architecture generalization capabilities.

cs.CV↗
arXiv2023

Generation of 3D Molecules in Pockets via Language Model

Generative models for molecules based on sequential line notation (e.g. SMILES) or graph representation have attracted an increasing interest in the field of structure-based drug design, but they struggle to capture important 3D spatial interactions and often produce undesirable molecular structures. To address these challenges, we introduce Lingo3DMol, a pocket-based 3D molecule generation method that combines language models and geometric deep learning technology. A new molecular representation, fragment-based SMILES with local and global coordinates, was developed to assist the model in learning molecular topologies and atomic spatial positions. Additionally, we trained a separate noncovalent interaction predictor to provide essential binding pattern information for the generative model. Lingo3DMol can efficiently traverse drug-like chemical spaces, preventing the formation of unusual structures. The Directory of Useful Decoys-Enhanced (DUD-E) dataset was used for evaluation. Lingo3DMol outperformed state-of-the-art methods in terms of drug-likeness, synthetic accessibility, pocket binding mode, and molecule generation speed.

cs.LG↗
arXiv2023

Which Matters Most in Making Fund Investment Decisions? A Multi-granularity Graph Disentangled Learning Framework

In this paper, we highlight that both conformity and risk preference matter in making fund investment decisions beyond personal interest and seek to jointly characterize these aspects in a disentangled manner. Consequently, we develop a novel M ulti-granularity Graph Disentangled Learning framework named MGDL to effectively perform intelligent matching of fund investment products. Benefiting from the well-established fund graph and the attention module, multi-granularity user representations are derived from historical behaviors to separately express personal interest, conformity and risk preference in a fine-grained way. To attain stronger disentangled representations with specific semantics, MGDL explicitly involve two self-supervised signals, i.e., fund type based contrasts and fund popularity. Extensive experiments in offline and online environments verify the effectiveness of MGDL.

cs.LG↗
arXiv2023

Bounding and Filling: A Fast and Flexible Framework for Image Captioning

Most image captioning models following an autoregressive manner suffer from significant inference latency. Several models adopted a non-autoregressive manner to speed up the process. However, the vanilla non-autoregressive manner results in subpar performance, since it generates all words simultaneously, which fails to capture the relationships between words in a description. The semi-autoregressive manner employs a partially parallel method to preserve performance, but it sacrifices inference speed. In this paper, we introduce a fast and flexible framework for image captioning called BoFiCap based on bounding and filling techniques. The BoFiCap model leverages the inherent characteristics of image captioning tasks to pre-define bounding boxes for image regions and their relationships. Subsequently, the BoFiCap model fills corresponding words in each box using two-generation manners. Leveraging the box hints, our filling process allows each word to better perceive other words. Additionally, our model offers flexible image description generation: 1) by employing different generation manners based on speed or performance requirements, 2) producing varied sentences based on user-specified boxes. Experimental evaluations on the MS-COCO benchmark dataset demonstrate that our framework in a non-autoregressive manner achieves the state-of-the-art on task-specific metric CIDEr (125.6) while speeding up 9.22x than the baseline model with an autoregressive manner; in a semi-autoregressive manner, our method reaches 128.4 on CIDEr while a 3.69x speedup. Our code and data is available at https://github.com/ChangxinWang/BoFiCap.

cs.CV↗
arXiv2023

UniKG: A Benchmark and Universal Embedding for Large-Scale Knowledge Graphs

Irregular data in real-world are usually organized as heterogeneous graphs (HGs) consisting of multiple types of nodes and edges. To explore useful knowledge from real-world data, both the large-scale encyclopedic HG datasets and corresponding effective learning methods are crucial, but haven't been well investigated. In this paper, we construct a large-scale HG benchmark dataset named UniKG from Wikidata to facilitate knowledge mining and heterogeneous graph representation learning. Overall, UniKG contains more than 77 million multi-attribute entities and 2000 diverse association types, which significantly surpasses the scale of existing HG datasets. To perform effective learning on the large-scale UniKG, two key measures are taken, including (i) the semantic alignment strategy for multi-attribute entities, which projects the feature description of multi-attribute nodes into a common embedding space to facilitate node aggregation in a large receptive field; (ii) proposing a novel plug-and-play anisotropy propagation module (APM) to learn effective multi-hop anisotropy propagation kernels, which extends methods of large-scale homogeneous graphs to heterogeneous graphs. These two strategies enable efficient information propagation among a tremendous number of multi-attribute entities and meantimes adaptively mine multi-attribute association through the multi-hop aggregation in large-scale HGs. We set up a node classification task on our UniKG dataset, and evaluate multiple baseline methods which are constructed by embedding our APM into large-scale homogenous graph learning methods. Our UniKG dataset and the baseline codes have been released at https://github.com/Yide-Qiu/UniKG.

cs.AI↗
arXiv2023

Design and Sample Size Determination for Multiple-dose Randomized Phase II Trials for Dose Optimization

The conventional more-is-better dose selection paradigm, which targets the maximum tolerated dose (MTD), is not suitable for the development of targeted therapies and immunotherapies as the efficacy of these novel therapies may not increase with the dose. The U.S. Food and Drug Administration (FDA) has launched Project Optimus "to reform the dose optimization and dose selection paradigm in oncology drug development", and recently published a draft guidance on dose optimization, which outlines various approaches to achieve this goal. One highlighted approach involves conducting a randomized phase II trial following the completion of a phase I trial, where multiple doses (typically including the MTD and one or two doses lower than the MTD) are compared to identify the optimal dose that maximizes the benefit-risk tradeoff. This paper focuses on the design of such a multiple-dose randomized trial, specifically the determination of the sample size. We propose a MERIT (Multiple-dosE RandomIzed Trial design for dose optimization based on toxicity and efficacy) design that can be easily implemented with pre-calculated decision boundaries included in the protocol. We generalized the standard definitions of type I error and power to accommodate the unique characteristics of dose optimization and derived a decision rule along with an algorithm to determine the optimal sample size. Simulation studies demonstrate that the resulting MERIT design has desirable operating characteristics. To facilitate the implementation of the MERIT design, we provide software, available at www.trialdesign.org.

stat.ME↗
arXiv2023

Stability and chaos of the duopoly model of Kopel: A study based on symbolic computations

Since Kopel's duopoly model was proposed about three decades ago, there are almost no analytical results on the equilibria and their stability in the asymmetric case. The first objective of our study is to fill this gap. This paper analyzes the asymmetric duopoly model of Kopel analytically by using several tools based on symbolic computations. We discuss the possibility of the existence of multiple positive equilibria and establish necessary and sufficient conditions for a given number of positive equilibria to exist. The possible positions of the equilibria in Kopel's model are also explored. Furthermore, in the asymmetric model of Kopel, if the duopolists adopt the best response reactions or homogeneous adaptive expectations, we establish rigorous conditions for the local stability of equilibria for the first time. The occurrence of chaos in Kopel's model seems to be supported by observations through numerical simulations, which, however, is challenging to prove rigorously. The second objective is to prove the existence of snapback repellers in Kopel's map, which implies the existence of chaos in the sense of Li-Yorke according to Marotto's theorem.

math.DS↗
arXiv2023

Using Symbolic Computation to Analyze Zero-Hopf Bifurcations of Polynomial Differential Systems

This paper is devoted to the study of infinitesimal limit cycles that can bifurcate from zero-Hopf equilibria of differential systems based on the averaging method. We develop an efficient symbolic program using Maple for computing the averaged functions of any order for continuous differential systems in arbitrary dimension. The program allows us to systematically analyze zero-Hopf bifurcations of polynomial differential systems using symbolic computation methods. We show that for the first-order averaging, $\ell\in\{0,1,\ldots,2^{n-3}\}$ limit cycles can bifurcate from the zero-Hopf equilibrium for the general class of perturbed differential systems and up to the second-order averaging, the maximum number of limit cycles can be determined by computing the mixed volume of a polynomial system obtained from the averaged functions. A number of examples are presented to demonstrate the effectiveness of the proposed algorithmic approach.

cs.SC↗
arXiv2023

Mediated interactions between Fermi polarons and the role of impurity quantum statistics

The notion of quasi-particles is essential for understanding the behaviour of complex many-body systems. A prototypical example of a quasi-particle, a polaron, is an impurity strongly interacting with a surrounding medium. Fermi polarons, created in a Fermi sea, provide a paradigmatic realization of this concept. As an inherent and important property such quasi-particles interact with each other via modulation of the medium. While quantum simulation experiments with ultracold atoms have significantly improved our understanding of individual polarons, the detection of their interactions has remained elusive in these systems. Here, we report the unambiguous observation of mediated interactions between Fermi polarons consisting of K impurities embedded in a Fermi sea of Li atoms. Our results confirm two landmark predictions of Landau's Fermi-liquid theory: the shift of the polaron energy due to mediated interactions, linear in the concentration of impurities, and its sign inversion with impurity quantum statistics. For weak to moderate interactions between the impurities and the medium, we find excellent agreement with the static (zero-momentum and energy) predictions of Fermi-liquid theory. For stronger impurity-medium interactions, we show that the observed behaviour at negative energies can be explained by a more refined many-body treatment including retardation and molecule formation

cond-mat.quant-gas↗
arXiv2023

Algorithmic Averaging for Studying Periodic Orbits of Planar Differential Systems

One of the main open problems in the qualitative theory of real planar differential systems is the study of limit cycles. In this article, we present an algorithmic approach for detecting how many limit cycles can bifurcate from the periodic orbits of a given polynomial differential center when it is perturbed inside a class of polynomial differential systems via the averaging method. We propose four symbolic algorithms to implement the averaging method. The first algorithm is based on the change of polar coordinates that allows one to transform a considered differential system to the normal form of averaging. The second algorithm is used to derive the solutions of certain differential systems associated to the unperturbed term of the normal of averaging. The third algorithm exploits the partial Bell polynomials and allows one to compute the integral formula of the averaged functions at any order. The last algorithm is based on the aforementioned algorithms and determines the exact expressions of the averaged functions for the considered differential systems. The implementation of our algorithms is discussed and evaluated using several examples. The experimental results have extended the existing relevant results for certain classes of differential systems.

cs.SC↗