Searcharxiv⌕ Search

arXiv subjects

Xu Zhou

Publications and source records attributed to Xu Zhou.

At least 73 records · Page 4Linked to original sources

Multi-modal Attribute Prompting for Vision-Language Models

Pre-trained Vision-Language Models (VLMs), like CLIP, exhibit strong generalization ability to downstream tasks but struggle in few-shot scenarios. Existing prompting techniques primarily focus on global text and image representations, yet overlooking multi-modal attribute characteristics. This limitation hinders the model's ability to perceive fine-grained visual details and restricts its generalization ability to a broader range of unseen classes. To address this issue, we propose a Multi-modal Attribute Prompting method (MAP) by jointly exploring textual attribute prompting, visual attribute prompting, and attribute-level alignment. The proposed MAP enjoys several merits. First, we introduce learnable visual attribute prompts enhanced by textual attribute semantics to adaptively capture visual attributes for images from unknown categories, boosting fine-grained visual perception capabilities for CLIP. Second, the proposed attribute-level alignment complements the global alignment to enhance the robustness of cross-modal alignment for open-vocabulary objects. To our knowledge, this is the first work to establish cross-modal attribute-level alignment for CLIP-based few-shot adaptation. Extensive experimental results on 11 datasets demonstrate that our method performs favorably against state-of-the-art approaches.

cs.CV↗

MindSpore Quantum: A User-Friendly, High-Performance, and AI-Compatible Quantum Computing Framework

We introduce MindSpore Quantum, a pioneering hybrid quantum-classical framework with a primary focus on the design and implementation of noisy intermediate-scale quantum (NISQ) algorithms. Leveraging the robust support of MindSpore, an advanced open-source deep learning training/inference framework, MindSpore Quantum exhibits exceptional efficiency in the design and training of variational quantum algorithms on both CPU and GPU platforms, delivering remarkable performance. Furthermore, this framework places a strong emphasis on enhancing the operational efficiency of quantum algorithms when executed on real quantum hardware. This encompasses the development of algorithms for quantum circuit compilation and qubit mapping, crucial components for achieving optimal performance on quantum processors. In addition to the core framework, we introduce QuPack, a meticulously crafted quantum computing acceleration engine. QuPack significantly accelerates the simulation speed of MindSpore Quantum, particularly in variational quantum eigensolver (VQE), quantum approximate optimization algorithm (QAOA), and tensor network simulations, providing astonishing speed. This combination of cutting-edge technologies empowers researchers and practitioners to explore the frontiers of quantum computing with unprecedented efficiency and performance.

quant-ph↗

Distributed Exact Generalized Grover's Algorithm

Distributed quantum computation has garnered immense attention in the noisy intermediate-scale quantum (NISQ) era, where each computational node necessitates fewer qubits and quantum gates. In this paper, we focus on a generalized search problem involving multiple targets within an unordered database and propose a Distributed Exact Generalized Grover's Algorithm (DEGGA) to address this challenge by decomposing it into arbitrary $t$ components, where $2 \leq t \leq n$. Specifically, (1) our algorithm ensures accuracy, with a theoretical probability of identifying the target states at $100\%$; (2) if the number of targets is fixed, the pivotal factor influencing the circuit depth of DEGGA is the partitioning strategy, rather than the magnitude of $n$; (3) our method requires a total of $n$ qubits, eliminating the need for auxiliary qubits; (4) we elucidate the resolutions (two-node and three-node) of a particular generalized search issue incorporating two goal strings (000000 and 111111) by applying DEGGA. The feasibility and effectiveness of our suggested approach is further demonstrated by executing the quantum circuits on MindSpore Quantum (a quantum simulation software). Eventually, through the decomposition of multi-qubit gates, DEGGA diminishes the utilization of quantum gates by $90.7\%$ and decreases the circuit depth by $91.3\%$ in comparison to the modified Grover's algorithm by Long. It is increasingly evident that distributed quantum algorithms offer augmented practicality.

quant-ph↗

The Sloan Digital Sky Survey Reverberation Mapping Project: Key Results

We present the final data from the Sloan Digital Sky Survey Reverberation Mapping (SDSS-RM) project, a precursor to the SDSS-V Black Hole Mapper Reverberation Mapping program. This data set includes 11-year photometric and 7-year spectroscopic light curves for 849 broad-line quasars over a redshift range of 0.1 =0.62+-0.07 for the line dispersion measured from the RMS spectrum. The intrinsic scatter of individual virial factors is 0.31+-0.07 dex, indicating a factor of two systematic uncertainty in RM black hole masses. Our lag measurements reveal significant R-L relations for Hbeta and MgII at high redshift, consistent with the latest measurements based on heterogeneous samples. While we are unable to robustly constrain the slope of the R-L relation for CIV given the limited dynamical range in luminosity, we found substantially larger scatter in CIV lags at fixed L1350. Using the SDSS-RM lag sample, we derive improved single-epoch (SE) mass recipes for Hbeta, MgII and CIV, which are consistent with their respective RM masses as well as between the SE recipes from two different lines, over the luminosity range probed by our sample. The new Hbeta and MgII recipes are approximately unbiased estimators at given RM masses, but there are systematic biases in the CIV recipe. The intrinsic scatter of SE masses around RM masses is ~0.45 dex for Hbeta and MgII, increasing to ~0.58 dex for CIV.

astro-ph.GA↗

V2X-PC: Vehicle-to-everything Collaborative Perception via Point Cluster

The objective of the collaborative vehicle-to-everything perception task is to enhance the individual vehicle's perception capability through message communication among neighboring traffic agents. Previous methods focus on achieving optimal performance within bandwidth limitations and typically adopt BEV maps as the basic collaborative message units. However, we demonstrate that collaboration with dense representations is plagued by object feature destruction during message packing, inefficient message aggregation for long-range collaboration, and implicit structure representation communication. To tackle these issues, we introduce a brand new message unit, namely point cluster, designed to represent the scene sparsely with a combination of low-level structure information and high-level semantic information. The point cluster inherently preserves object information while packing messages, with weak relevance to the collaboration range, and supports explicit structure modeling. Building upon this representation, we propose a novel framework V2X-PC for collaborative perception. This framework includes a Point Cluster Packing (PCP) module to keep object feature and manage bandwidth through the manipulation of cluster point numbers. As for effective message aggregation, we propose a Point Cluster Aggregation (PCA) module to match and merge point clusters associated with the same object. To further handle time latency and pose errors encountered in real-world scenarios, we propose parameter-free solutions that can adapt to different noisy levels without finetuning. Experiments on two widely recognized collaborative perception benchmarks showcase the superior performance of our method compared to the previous state-of-the-art approaches relying on BEV maps.

cs.CV↗

MobFuzz: Adaptive Multi-objective Optimization in Gray-box Fuzzing

Coverage-guided gray-box fuzzing (CGF) is an efficient software testing technique. There are usually multiple objectives to optimize in CGF. However, existing CGF methods cannot successfully find the optimal values for multiple objectives simultaneously. In this paper, we propose a gray-box fuzzer for multi-objective optimization (MOO) called MobFuzz. We model the multi-objective optimization process as a multi-player multi-armed bandit (MPMAB). First, it adaptively selects the objective combination that contains the most appropriate objectives for the current situation. Second, our model deals with the power schedule, which adaptively allocates energy to the seeds under the chosen objective combination. In MobFuzz, we propose an evolutionary algorithm called NIC to optimize our chosen objectives simultaneously without incurring additional performance overhead. To prove the effectiveness of MobFuzz, we conduct experiments on 12 real-world programs and the MAGMA data set. Experiment results show that multi-objective optimization in MobFuzz outperforms single-objective fuzzing in the baseline fuzzers. In contrast to them, MobFuzz can select the optimal objective combination and increase the values of multiple objectives up to 107%, with at most a 55% reduction in the energy consumption. Moreover, MobFuzz has up to 6% more program coverage and finds 3x more unique bugs than the baseline fuzzers. The NIC algorithm has at least a 2x improvement with a performance overhead of approximately 3%.

cs.CR↗

Online Network Traffic Classification Based on External Attention and Convolution by IP Packet Header

Network traffic classification is an important part of network monitoring and network management. Three traditional methods for network traffic classification are flow-based, session-based, and packet-based, while flow-based and session-based methods cannot meet the real-time requirements and existing packet-based methods will violate user's privacy. To solve the above problems, we propose a network traffic classification method only by the IP packet header, which satisfies the requirements of both the user's privacy protection and online classification performances. Through statistical analyses, we find that IP packet header information is effective on the network traffic classification tasks and this conclusion is also demonstrated by experiments. Furthermore, we propose a novel external attention and convolution mixed (ECM) model for online network traffic classification. This model adopts both low-computational complexity external attention and convolution to respectively extract the byte-level and packet-level characteristics for traffic classification. Therefore, it can achieve high classification accuracy and low time consumption. The experiments show that ECM can achieve the highest classification accuracy and the lowest delay, compared with other state-of-art models. The accuracy can respectively achieve 98.39% and 95.57% on two datasets and the classification time is shorten to meet the real-time requirements.

cs.NI↗

The Progress, Challenges, and Perspectives of Directed Greybox Fuzzing

Greybox fuzzing is a scalable and practical approach for software testing. Most greybox fuzzing tools are coverage-guided as reaching high code coverage is more likely to find bugs. However, since most covered codes may not contain bugs, blindly extending code coverage is less efficient, especially for corner cases. Unlike coverage-guided greybox fuzzing which increases code coverage in an undirected manner, directed greybox fuzzing (DGF) spends most of its time allocation on reaching specific targets (e.g., the bug-prone zone) without wasting resources stressing unrelated parts. Thus, DGF is particularly suitable for scenarios such as patch testing,bug reproduction, and special bug detection. For now, DGF has become an active research area. However, DGF has general limitations and challenges that are worth further studying. Based on the investigation of 42 state-of-the-art fuzzers that are closely related to DGF, we conduct the first in-depth study to summarize the empirical evidence on the research progress of DGF. This paper studies DGF from a broader view, which takes into account not only the location-directed type that targets specific code parts, but also the behavior-directed type that aims to expose abnormal program behaviors. By analyzing the benefits and limitations of DGF research, we try to identify gaps in current research, meanwhile, reveal new research opportunities, and suggest areas for further investigation.

cs.CR↗

Handling Data Heterogeneity in Federated Learning via Knowledge Distillation and Fusion

Federated learning (FL) supports distributed training of a global machine learning model across multiple devices with the help of a central server. However, data heterogeneity across different devices leads to the client model drift issue and results in model performance degradation and poor model fairness. To address the issue, we design Federated learning with global-local Knowledge Fusion (FedKF) scheme in this paper. The key idea in FedKF is to let the server return the global knowledge to be fused with the local knowledge in each training round so that the local model can be regularized towards the global optima. Therefore, the client model drift issue can be mitigated. In FedKF, we first propose the active-inactive model aggregation technique that supports a precise global knowledge representation. Then, we propose a data-free knowledge distillation (KD) approach to enable each client model to learn the global knowledge (embedded in the global model) while each client model can still learn the local knowledge (embedded in the local dataset) simultaneously, thereby realizing the global-local knowledge fusion process. The theoretical analysis and intensive experiments demonstrate the superiority of FedKF over previous solutions.

cs.LG↗

Cross-Layer Assisted Early Congestion Control for Cloud VR Services in 5G Edge Network

Cloud virtual reality (VR) has emerged as a promising technology, offering users a highly immersive and easily accessible experience. However, the current 5G radio access network faces challenges in accommodating the bursty traffic generated by multiple cloudVR flows simultaneously, leading to congestion at the 5G base station and increased delays. In this research, we present a comprehensive quantitative analysis that highlights the underlying causes for the poor delay performance of cloudVR flows within the existing 5G protocol stack and network. To address these issues, we propose a novel cross-layer informationassisted congestion control mechanism deployed in the 5G edge network. Experiment results show that our mechanism enhances the number of concurrent flows meeting delay standards by 1.5x to 2.5x, while maintaining a smooth network load. These findings underscore the potential of leveraging 5G edge nodes as a valuable resource to effectively meet the anticipated demands of future services.

cs.NI↗

Astrometric Calibration of the Beijing$-$Arizona Sky Survey

We present the astrometric calibration of the Beijing-Arizona Sky Survey (BASS). The BASS astrometry was tied to the International Celestial Reference Frame via the \emph{Gaia} Data Release 2 reference catalog. For effects that were stable throughout the BASS observations, including differential chromatic refraction and the low charge transfer efficiency of the CCD, we corrected for these effects at the raw image coordinates. Fourth-order polynomial intermediate longitudinal and latitudinal corrections were used to remove optical distortions. The comparison with the \emph{Gaia} catalog shows that the systematic errors, depending on color or magnitude, are less than 2 milliarcseconds (mas). The position systematic error is estimated to be about $-0.01\pm0.7$ mas in the region between 30 and 60 degrees of declination and up to $-0.07 \pm 0.9$ mas in the region north of declination 60 degrees.

astro-ph.IM↗

SN 2016ije: An SN 2002es-like Type Ia Supernova Exploded in a Metal-poor and Low-surface Brightness Galaxy

We have conducted photometric and spectroscopic observations of the peculiar Type Ia supernova (SN Ia) 2016ije that was discovered through the Tsinghua-NAOC Transient Survey. This peculiar object exploded in the outskirts of a metal-poor, low-surface brightness galaxy (i.e., $M_{g}$ = $-$14.5 mag). Our photometric analysis reveals that SN 2016ije is subluminous ($M_{B,\rm{max}}$ = $-$17.65$\pm$0.06 mag) but exhibits relatively broad light curves ($Δm_{15}(B)$ = 1.35$\pm$0.14 mag), similar to the behavior of SN 2002es. Our analysis of the bolometric light curve indicates that only 0.14$\pm$0.04 $M_{\odot}$ of $^{56}$Ni was synthesized in the explosion of SN 2016ije, which suggests a less energetic thermonuclear explosion when compared to normal SNe Ia, and this left a considerable amount of unburned materials in the ejecta. Spectroscopically, SN 2016ije resembles other SN 2002es-like SNe Ia, except that the ejecta velocity inferred from its carbon absorption line ($\sim$ 4500 km s$^{-1}$) is much lower than that from silicon lines ($\sim$ 8300 km s$^{-1}$) at around the maximum light. Additionally, most of the absorption lines are broader than other 02es-like SNe Ia. These peculiarities suggest the presence of significant unburned carbon in the inner region and a wide line-forming region along the line of sight. These characteristics suggest that SN 2016ije might originate from the violent merger of a white dwarf binary system, when viewed near an orientation along the iron-group-element cavity caused by the companion star.

astro-ph.HE↗

Distributed exact quantum algorithms for Bernstein-Vazirani and search problems

Distributed quantum computation has gained extensive attention since small-qubit quantum computers seem to be built more practically in the noisy intermediate-scale quantum (NISQ) era. In this paper, we give a distributed Bernstein-Vazirani algorithm (DBVA) with $t$ computing nodes, and a distributed exact Grover's algorithm (DEGA) that solve the search problem with only one target item in the unordered databases. Though the designing techniques are simple in the light of BV algorithm, Grover's algorithm, the improved Grover's algorithm by Long, and the distributed Grover's algorithm by Qiu et al, in comparison to BV algorithm, the circuit depth of DBVA is not greater than $2^{\text{max}(n_0, n_1, \cdots, n_{t-1})}+3$ instead of $2^{n}+3$, and the circuit depth of DEGA is $8(n~\text{mod}~2)+9$, which is less than the circuit depth of Grover's algorithm, $1 + 8\left\lfloor \fracπ{4}\sqrt{2^n} \right\rfloor$. In particular, we provide situations of our DBVA and DEGA on MindQuantum (a quantum software) to validate the correctness and practicability of our methods. By simulating the algorithms running in the depolarized channel, it further illustrates that distributed quantum algorithm has superiority of resisting noise.

quant-ph↗

UltraFuzz: Towards Resource-saving in Distributed Fuzzing

Recent research has sought to improve fuzzing performance via parallel computing. However, researchers focus on improving efficiency while ignoring the increasing cost of testing resources. Parallel fuzzing in the distributed environment amplifies the resource-wasting problem caused by the random nature of fuzzing. In the parallel mode, owing to the lack of an appropriate task dispatching scheme and timely fuzzing status synchronization among different fuzzing instances, task conflicts and workload imbalance occur, making the resource-wasting problem severe. In this paper, we design UltraFuzz, a fuzzer for resource-saving in distributed fuzzing. Based on centralized dynamic scheduling, UltraFuzz can dispatch tasks and schedule power globally and reasonably to avoid resource-wasting. Besides, UltraFuzz can elastically allocate computing power for fuzzing and seed evaluation, thereby avoiding the potential bottleneck of seed evaluation that blocks the fuzzing process. UltraFuzz was evaluated using real-world programs, and the results show that with the same testing resource, UltraFuzz outperforms state-of-the-art tools, such as AFL, AFL-P, PAFL, and EnFuzz. Most importantly, the experiment reveals certain results that seem counter-intuitive, namely that parallel fuzzing can achieve ``super-linear acceleration'' when compared with single-core fuzzing. We conduct additional experiments to reveal the deep reasons behind this phenomenon and dig deep into the inherent advantages of parallel fuzzing over serial fuzzing, including the global optimization of seed energy scheduling and the escape of local optimal seed. Additionally, 24 real-world vulnerabilities were discovered using UltraFuzz.

cs.CR↗

Searching Extra-tidal Features around the Globular Cluster Whiting 1

Whiting 1 is a faint and young globular cluster in the halo of the Milky Way, and was suggested to have originated in the Sagittarius spherical dwarf galaxy (Sgr dSph). In this paper, we use the deep DESI Legacy Imaging Surveys to explore tentative spatial connection between Whiting 1 and the Sgr dSph. We redetermine the fundamental parameters of Whiting 1 and use the best-fitting isochrone (age $τ$=6.5 Gyr, metalicity Z=0.005 and $\rm d_{\odot}$=26.9 kpc) to construct a theoretical matched filter for the extra-tidal features searching. Without any smooth technique to the matched filter density map, we detect a round-shape feature with possible leading and trailing tails on either side of the cluster. This raw image is not totally new compared to old discoveries, but confirms that no more large-scale features can be detected under a depth of r<=22.5 mag. In our results, the whole feature stretches 0.1-0.2 degree along the orbit of Whiting 1, which gives a much larger area than the cluster core. The tails on both sides of the cluster align along the orbital direction of the Sgr dSph as well as the cluster itself, which implies that these debris are probably stripped remnants of Whiting 1 by the Milky Way.

astro-ph.GA↗

Photometric redshifts and Galaxy Clusters for DES DR2, DESI DR9, and HSC-SSP PDR3 Data

Photometric redshift (photo-z) is a fundamental parameter for multi-wavelength photometric surveys, while galaxy clusters are important cosmological probers and ideal objects for exploring the dense environmental impact on galaxy evolution. We extend our previous work on estimating photo-z and detecting galaxy clusters to the latest data releases of the Dark Energy Spectroscopic Instrument (DESI) imaging surveys, Dark Energy Survey (DES), and Hyper Suprime-Cam Subaru Strategic Program (HSC-SSP) imaging surveys and make corresponding catalogs publicly available for more extensive scientific applications. The photo-z catalogs include accurate measurements of photo-z and stellar mass for about 320, 293, and 134 million galaxies with $r<23$, $i<24$, and $i<25$ in DESI DR9, DES DR2, and HSC-SSP PDR3 data, respectively. The photo-z accuracy is about 0.017, 0.024, and 0.029 and the general redshift coverage is $z<1$, $z<1.2$, and $z<1.6$, respectively for those three surveys. The uncertainties of the logarithmic stellar mass that is inferred from stellar population synthesis fitting is about 0.2 dex. With the above photo-z catalogs, galaxy clusters are detected using a fast cluster-finding algorithm. A total of 532,810, 86,963, and 36,566 galaxy clusters with the number of members larger than 10 are discovered for DESI, DES, and HSC-SSP, respectively. Their photo-z accuracy is at the level of 0.01. The total mass of our clusters are also estimated by using the calibration relations between the optical richness and the mass measurement from X-ray and radio observations. The photo-z and cluster catalogs are available at ScienceDB (https://www.doi.org/10.11922/sciencedb.o00069.00003) and PaperData Repository (https://doi.org/10.12149/101089).

astro-ph.GA↗

TransMUSE: Transferable Traffic Prediction in MUlti-Service EdgeNetworks

The Covid-19 pandemic has forced the workforce to switch to working from home, which has put significant burdens on the management of broadband networks and called for intelligent service-by-service resource optimization at the network edge. In this context, network traffic prediction is crucial for operators to provide reliable connectivity across large geographic regions. Although recent advances in neural network design have demonstrated potential to effectively tackle forecasting, in this work we reveal based on real-world measurements that network traffic across different regions differs widely. As a result, models trained on historical traffic data observed in one region can hardly serve in making accurate predictions in other areas. Training bespoke models for different regions is tempting, but that approach bears significant measurement overhead, is computationally expensive, and does not scale. Therefore, in this paper we propose TransMUSE, a novel deep learning framework that clusters similar services, groups edge-nodes into cohorts by traffic feature similarity, and employs a Transformer-based Multi-service Traffic Prediction Network (TMTPN), which can be directly transferred within a cohort without any customization. We demonstrate that TransMUSE exhibits imperceptible performance degradation in terms of mean absolute error (MAE) when forecasting traffic, compared with settings where a model is trained for each individual edge node. Moreover, our proposed TMTPN architecture outperforms the state-of-the-art, achieving up to 43.21% lower MAE in the multi-service traffic prediction task. To the best of our knowledge, this is the first work that jointly employs model transfer and multi-service traffic prediction to reduce measurement overhead, while providing fine-grained accurate demand forecasts for edge services provisioning.

cs.NI↗

Revisiting the Full Sets of Orbital Parameters for the XO-3 System: No evidence for Temporal Variation of the Spin-Orbit Angle

We present 12 new transit light curves and 16 new out-of-transit radial velocity measurements for the XO-3 system. By modelling our newly collected measurements together with archival photometric and Doppler velocimetric data, we confirmed the unusual configuration of the XO-3 system, which contains a massive planet ($M_P=11.92^{+0.59}_{-0.63} M_J$) on a relatively eccentric ($e=0.2853^{+0.0027}_{-0.0026}$) and short-period ($3.19152 \pm 0.00145\,$day) orbit around a massive star ($M_*=1.219^{+0.090}_{-0.095} M_{\odot}$). Furthermore, we find no strong evidence for a temporal change of either $V\sin i_{*}$ (and by extension, the stellar spin vector of XO-3), or the transit profile (and thus orbital angular momentum vector of XO-3b). We conclude that the discrepancy in previous Rossiter-McLaughlin measurements ($70.0^{\circ} \pm 15.0^{\circ}$ (Hebrard et al. 2008); $37.3^{\circ} \pm 3.7^{\circ}$ (Winn et al. 2009); $37.3^{\circ} \pm 3.0^{\circ}$ (Hirano et al. 2011)) may have stemmed from systematic noise sources.

astro-ph.EP↗