Synthesizing high-quality tabular data is essential for privacy-preserving data analysis. However, this task remains challenging due to two key factors: (1) distribution complexity : imbalanced and skewed data make it challenging to learn the data distribution accurately; and (2) semantic coherence : implicit relationships and logical dependencies among fields must be preserved to ensure valid and meaningful synthetic samples. To address these issues, we propose SynDiSC, a high-quality tabular data synthesis approach that enforces both distributional and semantic consistency. It comprises three core designs: (1) a distribution-aware encoding that effectively handles heterogeneous data types and complex distributions; (2) a multi-dimensional semantic conditioning that leverages multi-dimensional conditional dependencies to enforce semantic validity during generation; and (3) a conditional consistency controller that guides the generator to produce diverse samples satisfying multiple conditional constraints while mitigating mode collapse. Extensive experiments on datasets from various application domains demonstrate that SynDiSC significantly improves data quality, conditional controllability, and downstream task performance compared to state-of-the-art methods. Our code and data samples are open-sourced in the GitHub repository. https://github.com/Knightz9/SynDiSC.

Cellular operators face significant challenges in cutting operating expenses while maintaining the quality of service (QoS) for users due to growing network traffic and dynamic user connections. These challenges are addressed by the cloud radio access network (C-RAN) architecture, which includes a centralized pool of baseband units (BBUs) and distributes them from remote radio heads (RRHs). The key to improving C-RAN performance is to dynamically allocate large-scale RRHs to different BBUs in real time. In this paper, we propose a user behavior-aware RRH-BBU mapping framework to improve the performance of large-scale C-RANs by predicting RRH traffic and users in advance. First, we propose a Multivariate RRH time series Prediction Model (MRPM) that captures the spatio-temporal patterns in the data to predict the traffic volume and the number of users of RRHs, which represents key indicators of RRH connection states. Second, we formulate the RRH-BBU mapping as a Markov decision process problem to optimize cost and QoS by considering BBU utilization, BBU energy consumption, RRH migration frequency, and BBU load balancing. Third, we propose a prediction-based RRH-BBU mapping scheme (PB-RBM) to find the optimal RRH-BBU mapping strategy by leveraging the prediction information of MRPM. In the PB-RBM algorithm, we employ an A3C algorithm to learn the mapping policy and group the RRHs based on a defined popularity metric to reduce the state and action space of the reinforcement learning algorithm. Finally, extensive experiments are conducted on a real-world dataset, and our algorithm is compared with several matching algorithms, such as ACKTR, heuristic, etc., to demonstrate its superiority, especially reducing 17.5% in RMSE compared to the best-performing baseline.