arXiv subjects

Peng Yang

Publications and source records attributed to Peng Yang.

At least 109 records · Page 6Linked to original sources

arXiv2024

Connection Performance Modeling and Analysis of a Radiosonde Network in a Typhoon

This paper is concerned with the theoretical modeling and analysis of uplink connection performance of a radiosonde network deployed in a typhoon. Similar to existing works, the stochastic geometry theory is leveraged to derive the expression of the uplink connection probability (CP) of a radiosonde. Nevertheless, existing works assume that network nodes are spherically or uniformly distributed. Different from the existing works, this paper investigates two particular motion patterns of radiosondes in a typhoon, which significantly challenges the theoretical analysis. According to their particular motion patterns, this paper first separately models the distributions of horizontal and vertical distances from a radiosonde to its receiver. Secondly, this paper derives the closed-form expressions of cumulative distribution function (CDF) and probability density function (PDF) of a radiosonde's three-dimensional (3D) propagation distance to its receiver. Thirdly, this paper derives the analytical expression of the uplink CP for any radiosonde in the network. Finally, extensive numerical simulations are conducted to validate the theoretical analysis, and the influence of various network design parameters are comprehensively discussed. Simulation results show that when the signal-to-interference-noise ratio (SINR) threshold is below -35 dB, and the density of radiosondes remains under 0.01/km^3, the uplink CP approaches 26%, 39%, and 50% in three patterns.

cs.NI↗

arXiv2024

Adaptive Offloading and Enhancement for Low-Light Video Analytics on Mobile Devices

In this paper, we explore adaptive offloading and enhancement strategies for video analytics tasks on computing-constrained mobile devices in low-light conditions. We observe that the accuracy of low-light video analytics varies from different enhancement algorithms. The root cause could be the disparities in the effectiveness of enhancement algorithms for feature extraction in analytic models. Specifically, the difference in class activation maps (CAMs) between enhanced and low-light frames demonstrates a positive correlation with video analytics accuracy. Motivated by such observations, a novel enhancement quality assessment method is proposed on CAMs to evaluate the effectiveness of different enhancement algorithms for low-light videos. Then, we design a multi-edge system, which adaptively offloads and enhances low-light video analytics tasks from mobile devices. To achieve the trade-off between the enhancement quality and the latency for all system-served mobile devices, we propose a genetic-based scheduling algorithm, which can find a near-optimal solution in a reasonable time to meet the latency requirement. Thereby, the offloading strategies and the enhancement algorithms are properly selected under the condition of limited end-edge bandwidth and edge computation resources. Simulation experiments demonstrate the superiority of the proposed system, improving accuracy up to 20.83\% compared to existing benchmarks.

cs.MM↗

arXiv2024

Resource-Efficient Generative AI Model Deployment in Mobile Edge Networks

The surging development of Artificial Intelligence-Generated Content (AIGC) marks a transformative era of the content creation and production. Edge servers promise attractive benefits, e.g., reduced service delay and backhaul traffic load, for hosting AIGC services compared to cloud-based solutions. However, the scarcity of available resources on the edge pose significant challenges in deploying generative AI models. In this paper, by characterizing the resource and delay demands of typical generative AI models, we find that the consumption of storage and GPU memory, as well as the model switching delay represented by I/O delay during the preloading phase, are significant and vary across models. These multidimensional coupling factors render it difficult to make efficient edge model deployment decisions. Hence, we present a collaborative edge-cloud framework aiming to properly manage generative AI model deployment on the edge. Specifically, we formulate edge model deployment problem considering heterogeneous features of models as an optimization problem, and propose a model-level decision selection algorithm to solve it. It enables pooled resource sharing and optimizes the trade-off between resource consumption and delay in edge generative AI model deployment. Simulation results validate the efficacy of the proposed algorithm compared with baselines, demonstrating its potential to reduce overall costs by providing feature-aware model deployment decisions.

cs.LG↗

arXiv2024

Joint Model Assignment and Resource Allocation for Cost-Effective Mobile Generative Services

Artificial Intelligence Generated Content (AIGC) services can efficiently satisfy user-specified content creation demands, but the high computational requirements pose various challenges to supporting mobile users at scale. In this paper, we present our design of an edge-enabled AIGC service provisioning system to properly assign computing tasks of generative models to edge servers, thereby improving overall user experience and reducing content generation latency. Specifically, once the edge server receives user requested task prompts, it dynamically assigns appropriate models and allocates computing resources based on features of each category of prompts. The generated contents are then delivered to users. The key to this system is a proposed probabilistic model assignment approach, which estimates the quality score of generated contents for each prompt based on category labels. Next, we introduce a heuristic algorithm that enables adaptive configuration of both generation steps and resource allocation, according to the various task requests received by each generative model on the edge.Simulation results demonstrate that the designed system can effectively enhance the quality of generated content by up to 4.7% while reducing response delay by up to 39.1% compared to benchmarks.

cs.DC↗

arXiv2024

Design of a large-scale superconducting dipole magnet for the CEE spectrometer

The CSR External-target Experiment (CEE) is a large-scale spectrometer under construction at the Heavy Ion Research Facility in Lanzhou (HIRFL) for studying the phase structure of nuclear matter at high baryon density and the equation of states of nuclear matter at supra-saturation densities. One of the key components is a large acceptance dipole magnet with a central field of 0.5 T and the homogeneity of 5% within a 1 m long, 1.2 m wide, and 0.9 m high aperture. Detectors will be installed within this aperture. An innovative design for the superconducting detector magnet is proposed that goes beyond the conventional approach. The magnet is designed as a coil-dominant type, with conductors discretized on a racetrack-shaped cross-section to generate the necessary fields. A warm iron yoke is used to enhance the central field and minimize the stray field. The magnet has overall dimensions of 3.4 meters in length, 2.7 meters in height, and 4.3 meters in width. The coils will be wound using a 19-strand rope cable comprised of 12 NbTi superconducting wires and 7 copper wires. The ratio of copper to superconductor of the cable is 6.9. The keel supports serve as the primary structural support for the coils to withstand the electromagnetic force. The coils will be indirectly cooled by liquid helium within three external helium vessels. To ensure reliable protection of the magnet during a quench, an active protection method combined with quench-back effect is employed. In this paper, we mainly present the detailed design of the magnetic field, structure, quench protection and cryostat for the spectrometer magnet.

physics.ins-det↗

arXiv2024

Pilot-Aided Joint Time Synchronization and Channel Estimation for OTFS

This letter proposes a pilot-aided joint time synchronization and channel estimation (JTSCE) algorithm for orthogonal time frequency space (OTFS) systems. Unlike existing algorithms, JTSCE employs a maximum length sequence (MLS) rather than an isolated signal as the pilot. Distinctively, JTSCE explores MLS's autocorrelation properties to estimate timing offset and channel delay taps. After obtaining delay taps, closed-form expressions of Doppler and channel gain for each propagation path are derived. Simulation results indicate that, compared to its counterpart, JTSCE achieves better bit error rate performance, close to that with perfect time synchronization and channel state information.

eess.SP↗

arXiv2024

A UAV-Enabled Time-Sensitive Data Collection Scheme for Grassland Monitoring Edge Networks

Grassland monitoring is essential for the sustainable development of grassland resources. Traditional Internet of Things (IoT) devices generate critical ecological data, making data loss unacceptable, but the harsh environment complicates data collection. Unmanned Aerial Vehicle (UAV) and mobile edge computing (MEC) offer efficient data collection solutions, enhancing performance on resource-limited mobile devices. In this context, this paper is the first to investigate a UAV-enabled time-sensitive data collection problem (TSDCMP) within grassland monitoring edge networks (GMENs). Unlike many existing data collection scenarios, this problem has three key challenges. First, the total amount of data collected depends significantly on the data collection duration and arrival time of UAV at each access point (AP). Second, the volume of data at different APs varies among regions due to differences in monitoring objects and vegetation coverage. Third, the service requests time and locations from APs are often not adjacent topologically. To address these issues, We formulate the TSDCMP for UAV-enabled GMENs as a mixed-integer programming model in a single trip. This model considers constraints such as the limited energy of UAV, the coupled routing and time scheduling, and the state of APs and UAV arrival time. Subsequently, we propose a novel cooperative heuristic algorithm based on temporal-spatial correlations (CHTSC) that integrates a modified dynamic programming (MDP) into an iterated local search to solve the TSDCMP for UAV-enabled GMENs. This approach fully takes into account the temporal and spatial relationships between consecutive service requests from APs. Systematic simulation studies demonstrate that the mixed-integer programming model effectively represents the TSDCMP within UAV-enabled GMENs.

cs.NI↗

arXiv2024

AxiomVision: Accuracy-Guaranteed Adaptive Visual Model Selection for Perspective-Aware Video Analytics

The rapid evolution of multimedia and computer vision technologies requires adaptive visual model deployment strategies to effectively handle diverse tasks and varying environments. This work introduces AxiomVision, a novel framework that can guarantee accuracy by leveraging edge computing to dynamically select the most efficient visual models for video analytics under diverse scenarios. Utilizing a tiered edge-cloud architecture, AxiomVision enables the deployment of a broad spectrum of visual models, from lightweight to complex DNNs, that can be tailored to specific scenarios while considering camera source impacts. In addition, AxiomVision provides three core innovations: (1) a dynamic visual model selection mechanism utilizing continual online learning, (2) an efficient online method that efficiently takes into account the influence of the camera's perspective, and (3) a topology-driven grouping approach that accelerates the model selection process. With rigorous theoretical guarantees, these advancements provide a scalable and effective solution for visual tasks inherent to multimedia systems, such as object detection, classification, and counting. Empirically, AxiomVision achieves a 25.7\% improvement in accuracy.

cs.MM↗

arXiv2024

Asymmetric Drift Map of the Milky Way disk Populations between 8$-$16 kpc with LAMOST and Gaia datasets

The application of asymmetric drift (AD) tomography across different populations provides valuable insights into the kinematics, dynamics, and rotation curves of the Galactic disk. By leveraging common stars identified in both the LAMOST and Gaia surveys, alongside Gaia DR3's circular velocity curve, we conducted a qualitative exploration of asymmetric drift distributions within the Galactic disk spanning distances from 8 to 16 kpc. In the R-Z plane, we observed that the asymmetric drift is minimal near the mid-plane of the Galactic disk and gradually increases with vertical distance, resulting in a distinctive ``horn" shape. Additionally, our analysis revealed that populations with higher [$α$/Fe] ratios exhibit greater asymmetric drift compared to those with lower [$α$/Fe] ratios. Specifically, we found the asymmetric drift around the solar location to be approximately 6 km s$^{-1}$, with a median value of 16 km s$^{-1}$ across the entire sample. Notably, the median asymmetric drift in the northern region of the Galactic disk (20 km s$^{-1}$) surpasses that in the southern region (13 km s$^{-1}$), with errors remaining within 2 km s$^{-1}$. Furthermore, our investigation into mono-age stellar populations unveiled that older stellar populations tend to exhibit larger asymmetric drift and velocity dispersion, aligning closely with predictions from previous numerical models. Finally, based on chemical compositions, we observed that the median asymmetric drift of the thick disk significantly exceeds that of the thin disk and found that star formation within the thick disk primarily occurred earlier than 8-10 billion years, whereas the thin disk's predominant star formation period spanned 6-8 billion years ago.

astro-ph.GA↗

arXiv2024

Expensive Multi-Objective Bayesian Optimization Based on Diffusion Models

Multi-objective Bayesian optimization (MOBO) has shown promising performance on various expensive multi-objective optimization problems (EMOPs). However, effectively modeling complex distributions of the Pareto optimal solutions is difficult with limited function evaluations. Existing Pareto set learning algorithms may exhibit considerable instability in such expensive scenarios, leading to significant deviations between the obtained solution set and the Pareto set (PS). In this paper, we propose a novel Composite Diffusion Model based Pareto Set Learning algorithm, namely CDM-PSL, for expensive MOBO. CDM-PSL includes both unconditional and conditional diffusion model for generating high-quality samples. Besides, we introduce an information entropy based weighting method to balance different objectives of EMOPs. This method is integrated with the guiding strategy, ensuring that all the objectives are appropriately balanced and given due consideration during the optimization process; Extensive experimental results on both synthetic benchmarks and real-world problems demonstrates that our proposed algorithm attains superior performance compared with various state-of-the-art MOBO algorithms.

cs.LG↗

arXiv2024

SFPDML: Securer and Faster Privacy-Preserving Distributed Machine Learning based on MKTFHE

In recent years, distributed machine learning has garnered significant attention. However, privacy continues to be an unresolved issue within this field. Multi-key homomorphic encryption over torus (MKTFHE) is one of the promising candidates for addressing this concern. Nevertheless, there may be security risks in the decryption of MKTFHE. Moreover, to our best known, the latest works about MKTFHE only support Boolean operation and linear operation which cannot directly compute the non-linear function like Sigmoid. Therefore, it is still hard to perform common machine learning such as logistic regression and neural networks in high performance. In this paper, we first discover a possible attack on the existing distributed decryption protocol for MKTFHE and subsequently introduce secret sharing to propose a securer one. Next, we design a new MKTFHE-friendly activation function via \emph{homogenizer} and \emph{compare quads}. Finally, we utilize them to implement logistic regression and neural network training in MKTFHE. Comparing the efficiency and accuracy between using Taylor polynomials of Sigmoid and our proposed function as an activation function, the experiments show that the efficiency of our function is 10 times higher than using 7-order Taylor polynomials straightly and the accuracy of the training model is similar to using a high-order polynomial as an activation function scheme.

cs.CR↗

arXiv2024

Topological Quantum Mechanics on Orbifolds and Orbifold Index

In this paper, we study topological quantum mechanical models on symplectic orbifolds. The correlation map gives an explicit orbifold version of quantum HKR map. The exact semi-classical approximation in this model leads to a geometric and quantum field theoretic interpretation of the orbifold algebraic index.

math.QA↗

arXiv2024

Pointer Networks Trained Better via Evolutionary Algorithms

Pointer Network (PtrNet) is a specific neural network for solving Combinatorial Optimization Problems (COPs). While PtrNets offer real-time feed-forward inference for complex COPs instances, its quality of the results tends to be less satisfactory. One possible reason is that such issue suffers from the lack of global search ability of the gradient descent, which is frequently employed in traditional PtrNet training methods including both supervised learning and reinforcement learning. To improve the performance of PtrNet, this paper delves deeply into the advantages of training PtrNet with Evolutionary Algorithms (EAs), which have been widely acknowledged for not easily getting trapped by local optima. Extensive empirical studies based on the Travelling Salesman Problem (TSP) have been conducted. Results demonstrate that PtrNet trained with EA can consistently perform much better inference results than eight state-of-the-art methods on various problem scales. Compared with gradient descent based PtrNet training methods, EA achieves up to 30.21\% improvement in quality of the solution with the same computational time. With this advantage, this paper is able to at the first time report the results of solving 1000-dimensional TSPs by training a PtrNet on the same dimensionality, which strongly suggests that scaling up the training instances is in need to improve the performance of PtrNet on solving higher-dimensional COPs.

cs.NE↗

arXiv2024

Energy-Efficient URLLC Service Provision via a Near-Space Information Network

The integration of a near-space information network (NSIN) with the reconfigurable intelligent surface (RIS) is envisioned to significantly enhance the communication performance of future wireless communication systems by proactively altering wireless channels. This paper investigates the problem of deploying a RIS-integrated NSIN to provide energy-efficient, ultra-reliable and low-latency communications (URLLC) services. We mathematically formulate this problem as a resource optimization problem, aiming to maximize the effective throughput and minimize the system power consumption, subject to URLLC and physical resource constraints. The formulated problem is challenging in terms of accurate channel estimation, RIS phase alignment, theoretical analysis, and effective solution. We propose a joint resource allocation algorithm to handle these challenges. In this algorithm, we develop an accurate channel estimation approach by exploring message passing and optimize phase shifts of RIS reflecting elements to further increase the channel gain. Besides, we derive an analysis-friend expression of decoding error probability and decompose the problem into two-layered optimization problems by analyzing the monotonicity, which makes the formulated problem analytically tractable. Extensive simulations have been conducted to verify the performance of the proposed algorithm. Simulation results show that the proposed algorithm can achieve outstanding channel estimation performance and is more energy-efficient than diverse benchmark algorithms.

cs.IT↗

arXiv2024

Sharing Energy in Wide Area: A Two-Layer Energy Sharing Scheme for Massive Prosumers

The popularization of distributed energy resources transforms end-users from consumers into prosumers. Inspired by the sharing economy principle, energy sharing markets for prosumers are proposed to facilitate the utilization of renewable energy. This paper proposes a novel two-layer energy sharing market for massive prosumers, which can promote social efficiency by wider-area sharing. In this market, there is an upper-level wide-area market (WAM) in the distribution system and numerous lower-level local-area markets (LAMs) in communities. Prosumers in the same community share energy with each other in the LAM, which can be uncleared. The energy surplus and shortage of LAMs are cleared in the WAM. Thanks to the wide-area two-layer structure, the market outcome is near-social-optimal in large-scale systems. However, the proposed market forms a complex mathematical program with equilibrium constraints (MPEC). To solve the problem, we propose an efficient and hierarchically distributed bidding algorithm. The proposed two-layer market and bidding algorithm are verified on the IEEE 123-bus system with 11250 prosumers, which demonstrates the practicality and efficiency for large-scale markets.

cs.GT↗

arXiv2023

Holographic dissipative space-time supersolids

Driving a system out of equilibrium enriches the paradigm of spontaneous symmetry breaking, which could then take place not only in space but also in time. The interplay between temporal and spatial symmetries, as well as symmetries from other internal degrees of freedom, can give rise to novel nonequilibrium phases of matter. In this study, we investigate a driven-dissipative superfluid model using holographic methods and reveal the existence of a space-time supersolid (STS) phase which concomitantly breaks the time translation, spatial translation, and the internal U(1) symmetry. The holographic methods naturally include finite temperature effects, which enables us to explore the complex phase diagram of this model and observe a cascade of out-of-equilibrium phase transitions from the STS phase to a synchronized superfluid phase, and finally to a normal fluid phase, by increasing the temperature.

hep-th↗

arXiv2023

Reducing Idleness in Financial Cloud Services via Multi-objective Evolutionary Reinforcement Learning based Load Balancer

In recent years, various companies have started to shift their data services from traditional data centers to the cloud. One of the major motivations is to save on operational costs with the aid of cloud elasticity. This paper discusses an emerging need from financial services to reduce the incidence of idle servers retaining very few user connections, without disconnecting them from the server side. This paper considers this need as a bi-objective online load balancing problem. A neural network based scalable policy is designed to route user requests to varied numbers of servers for the required elasticity. An evolutionary multi-objective training framework is proposed to optimize the weights of the policy. Not only is the new objective of idleness is reduced by over 130% more than traditional industrial solutions, but the original load balancing objective itself is also slightly improved. Extensive simulations with both synthetic and real-world data help reveal the detailed applicability of the proposed method to the emergent problem of reducing idleness in financial services.

cs.NE↗

arXiv2023

Heating up quadruply quantized vortices: Splitting patterns and dynamical transitions

Using holographic duality, we investigate the impact of finite temperature on the instability and splitting patterns of quadruply quantized vortices, providing the first-ever analysis in this context. Through linear stability analysis, we reveal the occurrence of two consecutive dynamical transitions. At a specific low temperature, the dominant unstable mode transitions from the $2$-fold rotational symmetry mode to the $3$-fold one, followed by a transition from the $3$-fold one to the $4$-fold one at a higher temperature. As the temperature is increased, we also observe the $5$ and $6$-fold rotational symmetry unstable modes get excited successively. Employing the full non-linear numerical simulations, we further demonstrate that these two novel dynamical transitions, along with the temperature-induced instabilities for the $5$ and $6$-fold rotational symmetry modes, can be identified by examining the resulting distinct splitting patterns, which offers a promising route for the experimental verification in the cold atom gases.

cond-mat.quant-gas↗