Please wait a minute...

Current Issue

    25 September 2022, Volume 43 Issue 9
    Papers
    Parallel orchestration and deployment system for scalable heterogeneous service function chain supporting polymorphic network
    Hao CHEN, Yuan YANG, Mingwei XU, Dan PEI, Yilin YOU
    2022, 43(9):  1-11.  doi:10.11959/j.issn.1000-436x.2022181
    Asbtract ( 313 )   HTML ( 63)   PDF (913KB) ( 471 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the problem of second-level service function chain orchestration and deployment in the polymorphic data center with the scale of 10 000 servers, a scalable heterogeneous SFC parallel orchestration and deployment (SHOD) system was proposed.The scale-out orchestration time of service chain was reduced to seconds by partitioning the data center and adopting a parallel orchestrator design that minimizes resource usage.Using a mediator design model that satisfies the single-responsibility principle, the heterogeneous equipment scalable orchestration and deployment were realized as well as service function chain building chain.Experimental results show that in a data center with 10 000 servers, the scale-out orchestration time of SHOD system is reduced to 1 12 of the existing system-Daisy, while only 1.5 times CPU utilization overhead is introduced.

    Optimized scheduling mechanism based on IEEE 802.1Qch standard in time-sensitive networking
    Hongrui NIE, Shaosheng LI, Yong LIU
    2022, 43(9):  12-26.  doi:10.11959/j.issn.1000-436x.2022183
    Asbtract ( 433 )   HTML ( 56)   PDF (1328KB) ( 787 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To address the problem of complex gating planning for generic time-aware shaper (TAS), a traffic scheduling mechanism of adaptive queue buffer size and hardware time slot length was proposed with the help of IEEE 802.1Qch standard.Taking traffic and network characteristics into account, a mixed integer linear programming routing and scheduling model was formulated to maximize the number of time-sensitive flows mapped to the target network and then further improve the network scheduling capability by balancing the traffic carried by each scheduling time slot.Moreover, the impact of traffic and network features on queue buffer and hardware scheduling time slot was obtained through different scenarios.Simulation results show that the proposed method could successfully deploy thousands of time-sensitive flows for solving the scheduling problem in local area networks, and can improve the scheduling success rate by up to 28% compared with other algorithms with feasible execution time.

    HDFS-oriented cryptographic key resource control mechanism
    Wei JIN, Fenghua LI, Mingjie YU, Yunchuan GUO, Ziyan ZHOU, Liang FANG
    2022, 43(9):  27-41.  doi:10.11959/j.issn.1000-436x.2022165
    Asbtract ( 192 )   HTML ( 44)   PDF (1248KB) ( 317 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The big data environment presents the characteristics of multi-user cross-network cross-access, multi-service collaborative computing, cross-service data flow, and complex management of massive files.The existing access control models and mechanisms are not fully applicable for big data scenarios.In response to the needs of fine-grained access control and multi-service strategy normalization for cryptographic data in the big data environment, starting from the scene elements and attributes of access control, the HDFS-oriented CKCM was proposed by mapping the cyberspace-oriented access control (CoAC) model.Subsequently, a fine-grained access control management model for HDFS was proposed, including management sub-models and management supporting models.The Z-notation was used to formally describe the management functions and management methods in the management model.Finally, the CKCM system was implemented based on XACML to realize fine-grained secure access control for managing file and secret keys in HDFS.

    Performance analysis and power optimization for FH secure communication under frequency and phase mismatch
    Changqing SONG, Hongzhi ZHAO, Lizhi QIN, Shihai SHAO
    2022, 43(9):  42-56.  doi:10.11959/j.issn.1000-436x.2022169
    Asbtract ( 164 )   HTML ( 28)   PDF (1194KB) ( 264 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The artificial noise (AN) shielded frequency hopping (FH) secure communication can counteract electromagnetic interference and wiretapping, but its carrier frequencies change rapidly within a wide bandwidth which will raise the level of carrier frequency offset and phase noise, yielding AN cancellation performance degradation.To tackle this, the signal distortion caused by frequency and phase mismatch (FPM) was mathematically modeled, the AN cancellation performance was evaluated via signal-to-noise ratio, and the system secrecy was scaled via secrecy capacity.On basis of this, the optimal power allocation scheme for AN and confidential signal was designed, and the scheme was expanded according to the FPM level and the propagation channel quality.Numerical simulations verify that FPM can significantly degrade the noise cancellation performance and system secrecy, and to counteract this, the power ratio of AN to confidential signals should decrease with an increasing FPM.

    HARQ scheme for sparse code multiple access based on network coding
    Ke LAI, Jing LEI, Wei LIU, Lei WEN
    2022, 43(9):  57-69.  doi:10.11959/j.issn.1000-436x.2022174
    Asbtract ( 225 )   HTML ( 45)   PDF (974KB) ( 314 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To fulfill the stringent reliability and throughput demand of the beyond-5G and the forthcoming 6G, a novel network coding (NC) based hybrid automatic retransmission request (HARQ) for low-density parity check (LDPC) coded SCMA was proposed.Two incorrectly received packets from different time slots were retransmitted by using NC principle under multi-user scenario.By doing so, the information came from two packets could be conveyed in one retransmission.Moreover, extra coding gain could be attained at the receiver.Furthermore, since the similarity between SCMA detector and LDPC decoder, and the one check node feature of NC decoder, a SCMA, LDPC and NC joint decoder based on message passing algorithm (MPA) was proposed.The proposed scheme could fully utilize the soft messages come from current and previous transmissions, and thus exploiting satisfied coding gain from NC.Simulation results show that the superiority of the proposed novel HARQ scheme for SCMA over the conventional HARQ on both throughput and reliability.

    Endogenous security common problems and solutions of the mobile communication networks
    Caixia LIU, Xinsheng JI, Jiangxing WU
    2022, 43(9):  70-79.  doi:10.11959/j.issn.1000-436x.2022176
    Asbtract ( 328 )   HTML ( 72)   PDF (776KB) ( 414 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on the understanding of the mobile communication essential characteristics and the mobile communication network inherent characteristics, from a new perspective, the genetic defects existing in the mobile communication network inherent mechanism, especially in the mobility management mechanism were analyzed.These genetic defects would not disappear with the intergenerational development of mobile communication network, therefore, they were also known as endogenous security defects or endogenous security common problems of mobile communication networks.The endogenous security threats that may be introduced by security defects such as “acquiescence in information authenticity” and “ubiquitous data visibility” were pointed out.Under the guidance of the cyberspace endogenous security theory, the ideas and methods to solve the endogenous security common problems in mobile communication networks were proposed, such as breaking the “default trust” with “zero trust” and realizing the “user data limited visibility” with“variable implicit mapping”.

    Generalized 2D polynomial chaotic map and its application in information transmission
    Wenhao YAN, Zijing JIANG, Xin HUANG, Shujuan ZHU, Qun DING
    2022, 43(9):  80-89.  doi:10.11959/j.issn.1000-436x.2022168
    Asbtract ( 174 )   HTML ( 23)   PDF (5311KB) ( 157 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Existing chaotic systems have many defects in engineering applications, such as discontinuous chaotic parameter range, weak chaos, uneven output of chaotic sequences and dynamic degradation.Therefore, a generalized 2D polynomial chaotic mapping model was proposed.By setting different control parameters and the highest degree of polynomial, a series of 2D robust chaotic maps with specific Lyapunov exponent could be obtained.In order to avoid the output of the second state equation collapsing to a fixed value, a random disturbance variable which did not change with time was introduced.Finally, a numerical example was given to verify the effectiveness of the proposed model, and the dynamic analysis showed that the mapping has complex dynamic behavior.Finally, the system was applied to information transmission technology.Compared with other chaotic maps, the system can achieve lower bit error rate, which indicates that the chaotic map is more suitable for chaotic information transmission.

    Research on throughput maximization for intelligent reflecting surface assisted dual-hop relay wireless powered communication network
    Zhen YANG, Xuan FENG, Bin LYU
    2022, 43(9):  90-99.  doi:10.11959/j.issn.1000-436x.2022182
    Asbtract ( 288 )   HTML ( 29)   PDF (907KB) ( 425 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To improve the energy and information transmission efficiency of relay-based wireless powered communication network (WPCN), a two intelligent reflecting surface (IRS) assisted dual-hop relay wireless transmission scheme was proposed.In particular, IRS1 and IRS2 were deployed between the base station (BS) and hybrid relay node (HRN), and between the HRN and users, respectively, which could improve the efficiency of energy transfer from the HRN to users, data transmission from users to the HRN and data forwarding from HRN to BS.To maximize the system throughput, an optimization problem was formulated, where the time scheduling of energy, information transmission and forwarding, the phase shifts of IRS, and the delivered power of users were jointly optimized.To address non-convexity of the formulated problem, an efficient alternating optimization algorithm was proposed and the sub-optimal solution was obtained.In addition, the convergence and computational complexity of the proposed algorithm were analyzed.Numerical results verify that IRS can effectively improve the throughput of WPCN based on relay.In addition, compared to the benchmark schemes, the proposed optimal transmission scheme can significantly improve the system performance in terms of throughput.

    BFV-Blockchainvoting: blockchain-based electronic voting systems with BFV full homomorphic encryption
    Yatao YANG, Deli LIU, Peihe LIU, Ping ZENG, Song XIAO
    2022, 43(9):  100-111.  doi:10.11959/j.issn.1000-436x.2022172
    Asbtract ( 444 )   HTML ( 55)   PDF (1042KB) ( 500 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Current electronic voting systems mostly relied on central server and the trusted third party, this kind system architecture increases the security risks of voting, and even makes voting fail.In order to solve this issue, an electronic voting system BFV-blockchainvoting that supported BFV homomorphic encryption was proposed, and this system applied the blockchain technology to the electronic voting system to replace the trusted third party.Firstly, an open and transparent bulletin board was used to record the vote information, and an intelligent contract was used to realize the functions of verification and self counting.Secondly, in order to further improve the security and reliability of the voting process, the voter’s registration information was signed by SM2 signature algorithm, the ballot was managed by both parties that can supervise each other, and the counting data was encrypted by the BFV full homomorphic encryption algorithm.Finally, the evaluation of performance shows that it only costs 1.69 ms to complete one ballot in the proposed electronic voting system.This electronic voting scheme based on the BFV full homomorphic encryption and blockchain has better security attributes such as manipulation-resistance, anonymity, verifiability, double-voting resistance, coercion-resistance and resistance to quantum attacks.The scheme is suitable for a variety of voting scenarios and can meet the efficiency requirements in large voting scenarios.

    Array amplitude-phase and mutual coupling error joint correction method based on sparse Bayesian
    Ding WANG, Weigang GAO, Zhidong WU
    2022, 43(9):  112-120.  doi:10.11959/j.issn.1000-436x.2022175
    Asbtract ( 170 )   HTML ( 22)   PDF (935KB) ( 285 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In the actual array direction finding system, there are often a variety of errors such as amplitude and phase, mutual coupling, which lead to serious deterioration of array direction finding performance.In order to solve the problem of array direction finding misalignment in the presence of low signal-to-noise ratio, small snapshots and multiple errors, the spatial sparsity of signals were introduced, and Bayesian sparse reconstruction technology was used to solve the passive correction and joint estimation of array signal azimuth in the presence of amplitude-phase and mutual coupling errors.The over-complete model of the received signal with error was constructed, and the posterior probability density function of the received signal was obtained.The EM algorithm was used to iteratively optimize the probability density function to solve the corresponding parameters.At the same time, the CRLB of array error and signal azimuth was derived, and by experimental simulation verifies the effectiveness of the proposed method.

    Cooperation-based location authentication scheme for crowdsensing applications
    Youliang TIAN, Maoqing TIAN, Hongfeng GAO, Miao HE, Jinbo XIONG
    2022, 43(9):  121-133.  doi:10.11959/j.issn.1000-436x.2022173
    Asbtract ( 252 )   HTML ( 35)   PDF (1084KB) ( 503 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Utilizing mobile devices to collect location-related data in crowdsensing has the security problem of a location cheating attack.How to guarantee the quality of these sensitive data has become a challenge.In response to this, a location authentication scheme was proposed based on cooperation to detect malicious users who submit false locations.Firstly, users with mobile devices were used to generate location proofs for each other, and a location verification scheme was designed based on distance bounding protocols for obtaining new information by multiple collisions of the same random number, which ensured the user’s location should be unforgeable and achieved the purpose of improving the quality of collected data.In addition, a location proof cooperator select method based on region division and reputation model was proposed which effectively prevented collusion attack and solved the problem of concentration of equity.Meanwhile, the incentive mechanism based on reputation value and task completion time was designed to effectively improve the location proof cooperator efficiency of task completion.Finally, security analysis and performance evaluation indicate that the scheme has proved to be correctness and secure, and the advantages in computational cost and communication overhead.

    Distributed anonymous authentication scheme based on the blockchain in VANET
    Xia FENG, Kaiping CUI, Qingqing XIE, Liangmin WANG
    2022, 43(9):  134-147.  doi:10.11959/j.issn.1000-436x.2022167
    Asbtract ( 408 )   HTML ( 95)   PDF (1323KB) ( 539 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Identity authentication is the first line of defense against malicious vehicles spreading false traffic information.However, due to the limited network bandwidth and computing power in the vehicle ad-hoc network (VANET), the existing schemes cannot meet the requirements of efficient authentication, nor can achieve fast and anonymous traceability of malicious vehicles.In view of this, a distributed anonymous authentication scheme based on the blockchain was proposed.The zero-knowledge proof was used to quickly and anonymously authenticate the identity of vehicles in VANET, and the pairing-free-based aggregating signature was used to provide fast batch verification, effectively reducing the computational burden generated during the authentication process.In addition, the regional trusted authority (RTA) could realize the anonymous traceability of malicious vehicle identities, and quickly revoke their identities by using the block chain.It could also update the short-term anonymous identities of vehicles based on local keys in time to ensure that vehicles anonymity and freshness of signatures.Security analysis and simulation show that the proposed scheme can satisfy various security requirements such as anonymity and unlinkability, and can effectively reduce computing and communication overhead, which is at least 27.28% higher in performance than similar schemes.

    Research on elastic handover algorithm of 6G network based on fine-grained slicing
    Xiaorong ZHU, Kang CHEN
    2022, 43(9):  148-156.  doi:10.11959/j.issn.1000-436x.2022177
    Asbtract ( 211 )   HTML ( 30)   PDF (970KB) ( 400 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    With the emergence of high-bandwidth services such as holographic communication and augmented reality in the future, high-bandwidth services will be divided into finer-grained service slices according to the rates to meet diverse requirements of users.For the problem of how to complete network switching in a fine-grained slicing of large bandwidth services, an elastic handover algorithm of 6G network based on bipartite graph stable matching was proposed.By optimizing “user-network slice-base station” association, the total rate of users was maximized, and the access problem was modeled as a hierarchical bipartite graph stable matching problem.Then by using the two matching ideas of “slice base station” integration and “slice first and then base station”, the adaptive handoff of the network was realized by using Gale-Shapley algorithm.Simulation results show that the access success rates of the proposed integrated and two-stage matching algorithms are 15% and 10% higher respectively than that of the traditional method, and the total rate of users is also significantly improved.

    Research on seed node mining algorithm in large-scale temporal graph
    Xiaohong ZOU, Chengwei XU, Jing CHEN, Biao SONG, Mingyue WANG
    2022, 43(9):  157-168.  doi:10.11959/j.issn.1000-436x.2022170
    Asbtract ( 164 )   HTML ( 13)   PDF (975KB) ( 263 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Most of the existing maximizing influence algorithms based on temporal graph were not applicable for large-scale networks due to the low time efficiency or narrow influence range.Therefore, the seed node mining algorithm named CHG combining heuristic algorithm and greedy strategy was proposed.Firstly, based on the time sequence characteristics of information diffusion in temporal graph, the concept of two-order degree of nodes was given, and the influence of nodes was heuristically evaluated.Secondly, the nodes were filtered according to the influence evaluation results, and the candidate seed node set was constructed.Finally, the marginal effect of candidate seed nodes was calculated to solve the overlap of influence ranges between nodes to ensure the optimal combination of seed nodes.The experiments were carried out on three different scale data sets, and the results show that the proposed algorithm can ensure the high influence of the seed node set even though its running time is relatively shorter.And it can achieve a better trade-off between the time efficiency and the influence range of the seed node set.

    Adversarial training driven malicious code detection enhancement method
    Yanhua LIU, Jiaqi LI, Zhengui OU, Xiaoling GAO, Ximeng LIU, Weizhi MENG, Baoxu LIU
    2022, 43(9):  169-180.  doi:10.11959/j.issn.1000-436x.2022171
    Asbtract ( 265 )   HTML ( 42)   PDF (1494KB) ( 295 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve the deficiency of the malicious code detector’s ability to detect adversarial input, an adversarial training driven malicious code detection enhancement method was proposed.Firstly, the applications were preprocessed by a decompiler tool to extract API call features and map them into binary feature vectors.Secondly, the Wasserstein generative adversarial network was introduced to build a benign sample library to provide a richer combination of perturbations for malicious sample evasion detectors.Then, a perturbation reduction algorithm based on logarithmic backtracking was proposed.The benign samples were added to the malicious code in the form of perturbations, and the added benign perturbations were culled dichotomously to reduce the number of perturbations with fewer queries.Finally, the adversarial malicious code samples were marked as malicious and the detector was retrained to improve its accuracy and robustness of the detector.The experimental results show that the generated malicious code adversarial samples can evade the detector well.Additionally, the adversarial training increases the target detector’s accuracy and robustness.

    Copyright protection algorithm based on differential privacy deep fake fingerprint detection model
    Chengsheng YUAN, Qiang GUO, Zhangjie FU
    2022, 43(9):  181-193.  doi:10.11959/j.issn.1000-436x.2022184
    Asbtract ( 312 )   HTML ( 43)   PDF (1573KB) ( 544 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A copyright protection algorithm based on differential privacy for deep fake fingerprint detection model (DFFDM) was proposed, realizing active copyright protection and passive copyright verification of DFFDM without weakening the performance of the original task.In the original task training, noise was added to introduce randomness, and the expected stability of the differential privacy algorithm was used to make classification decisions to reduce the sensitivity to noise.In passive verification, FGSM was used to generate adversarial samples, the decision boundary was fine-adjusted to establish a backdoor, and the mapping was used as an implanted watermark to realize passive verification.To solve the copyright confusion caused by multiple backdoors, a watermark verification framework was designed, which stamped the trigger backdoors and identified the copyright with the help of time order.In active protection, to provide users with hierarchical services, the key neurons in the task were frozen by probabilistic selection strategy, and the access rights were designed to realize the thawing of neurons, so as to obtain the right to use the original task.Experimental results show that the backdoor verification is still effective under different model performance, and the embedded backdoor shows a certain robustness to the model modification.Also, the proposed algorithm can resist not only the collusion attack by the attacker to recruit legitimate users, but also the fine-tuning and compression attacks caused by the model modification.

    Comprehensive Reviews
    Survey on video image reconstruction method based on generative model
    Yanwen WANG, Weimin LEI, Wei ZHANG, Huan MENG, Xinyi CHEN, Wenhui YE, Qingyang JING
    2022, 43(9):  194-208.  doi:10.11959/j.issn.1000-436x.2022178
    Asbtract ( 470 )   HTML ( 81)   PDF (1230KB) ( 728 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Traditional video compression technology based on pixel correlation has limited performance improvement space, semantic compression has become the new direction of video compression coding, and video image reconstruction is the key link of semantic compression coding.First, the video image reconstruction methods for traditional coding optimization were introduced, including how to use deep learning to improve prediction accuracy and enhance reconstruction quality with super-resolution techniques.Second, the video image reconstruction methods based on variational auto-encoders, generative adversarial networks, autoregressive models and transformer models were discussed emphatically.Then, the models were classified according to different semantic representations of images.The advantages, disadvantages, and applicable scenarios of various methods were compared.Finally, the existing problems of video image reconstruction were summarized, and the further research directions were prospected.

    Research progress of blockchain network covert channel
    Leixiao LI, Jinze DU, Hao LIN, Haoyu GAO, Yanyan YANG, Jing GAO
    2022, 43(9):  209-223.  doi:10.11959/j.issn.1000-436x.2022146
    Asbtract ( 370 )   HTML ( 64)   PDF (1424KB) ( 318 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Characterized by decentration, anonymity, strong robustness and tamper resistance, blockchain accompanied by digital currency is a natural carrier for building the covert communication channel.First, the definition and development history of the network covert channel, the framework of blockchain technology and the traditional network covert channel were introduced and the advantages of the channel in the blockchain were given.Thus, the channel in blockchain was classified on the basis of transaction address, signature algorithm, smart contract and P2P broadcast mechanism.The merits and demerits were analyzed in terms of crypticity, transmission efficiency, and communication costs.Lastly, problems and the future research direction of the network covert channel in blockchain were presented.

    Correspondences
    Unsupervised detection method of RoQ covert attacks based on multilayer features
    Jing ZHAO, Jun LI, Chun LONG, Wei WAN, Jinxia WEI, Kai CHEN
    2022, 43(9):  224-239.  doi:10.11959/j.issn.1000-436x.2022166
    Asbtract ( 200 )   HTML ( 28)   PDF (2479KB) ( 566 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve the problems that RoQ covert attacks are hidden in overwhelming background traffic and difficult to identify, besides the existing samples are scarce and cannot provide large-scale learning data, an unsupervised detection method of RoQ covert attacks based on multilayer features was proposed under the condition of very little prior knowledge.First, considering that most normal flow might interfere with subsequent results, a classification method based on semi-supervised spectral clustering was studied by flow characteristics, so that the proportion of normal samples in the filtered traffic was close to 100%.Secondly, in order to distinguish the nuance between the hidden attack features and normal flow without relying on the attack samples, an unsupervised detection model based on the n-Shapelet subsequence was constructed by packet characteristics, and the subsequences with obvious difference were used, which enabled detection of RoQ convert attacks.Experimental results demonstrate that with only a small number of learning samples, the proposed method has higher precision and recall rate than existing methods, and is robust to evading attacks.

    Text steganography method based on automatic selection coding and dynamic word selection strategy
    Hui LI, Jiali JIN, Shuyu JIN, Weijiao MA
    2022, 43(9):  240-253.  doi:10.11959/j.issn.1000-436x.2022179
    Asbtract ( 196 )   HTML ( 31)   PDF (1100KB) ( 399 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A text steganography method based on automatic selection coding and dynamic word selection strategy was proposed for the inflexible text coding method and candidate word increasing number leading to the low quality of generated steganographic text.Steganographic translations was generated based on Transformer’s neural machine translation model.In generating steganographic translations, fixed-length coding and Huffman coding were used to establish the mapping relationship between candidate words and codewords, and dynamic word selection based on the probability difference threshold was achieved by calculating the probability difference percentage between steganographic words and normal words.Finally, the size of the two generated steganographic translations Sacrebleu was compared to realize the automatic selection of coding mode.The experimental results show that the proposed method can generate steganographic translations with high fluency and readability.When the embedding rate is 11.19%, the Sacrebleu of the steganographic translation reaches 10.53.

Copyright Information
Authorized by: China Association for Science and Technology
Sponsored by: China Institute of Communications
Editor-in-Chief: Zhang Ping
Associate Editor-in-Chief:
Zhang Yanchuan, Ma Jianfeng, Yang Zhen, Shen Lianfeng, Tao Xiaofeng, Liu Hualu
Editorial Director: Wu Nada, Zhao Li
Address: F2, Beiyang Chenguang Building, Shunbatiao No.1 Courtyard, Fengtai District, Beijing, China
Post: 100079
Tel: 010-53933889、53878169、
53859522、010-53878236
Email: xuebao@ptpress.com.cn
Email: txxb@bjxintong.com.cn
ISSN 1000-436X
CN 11-2102/TN
Visited
Total visitors:
Visitors of today:
Now online: