Please wait a minute...

Current Issue

    25 October 2021, Volume 42 Issue 10
    Topics: Deterministic Network
    Software-defined cross-domain scheduling mechanism for time-sensitive networking
    Shuo WANG, Yudong HUANG, Tao HUANG, Ru HUO, Yunjie LIU
    2021, 42(10):  1-9.  doi:10.11959/j.issn.1000-436x.2021182
    Asbtract ( 584 )   HTML ( 111)   PDF (851KB) ( 715 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the cross domain scheduling problem of time-sensitive network, a software-defined cross-domain scheduling mechanism for time-sensitive networking was proposed, which was based on three kinds of wide area clock synchronization technology to ensure nanosecond inter-domain time synchronization.Then, a time slot conflict-free cross domain scheduling model was proposed to solve the problem of time slot alignment caused by inter-domain link delay.The time slot conflict-free constraints were used to strictly limit the arrival time of cross-domain traffic at the edge node.Finally, the gate control list of fusion domains for global scheduling was calculated online.The simulation results show that the model can schedule hundreds of time-sensitive traffic in a typical cross-domain remote control scenario, and has a feasible algorithm execution time in seconds.

    Deterministic local multi-point fault detection method for industrial control topology
    Ruozhou LIANG, Xibin ZHAO, Hai WAN
    2021, 42(10):  10-22.  doi:10.11959/j.issn.1000-436x.2021202
    Asbtract ( 300 )   HTML ( 30)   PDF (992KB) ( 430 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In view of the fact that the existing network fault detection algorithms cannot meet the four requirements of determination of detection time, low detection overhead, multi-point fault detection ability and topology adaptability of industrial control network at the same time, a multi-point fault detection method of time sensitive network based on Boolean network mapping was proposed.The method was divided into offline preparation phase and online detection phase.In the offline preparation phase, the detection flow generation algorithm generated a set of detection flows based on the network topology.The detection flow set covered the edges of the network topology.In the online detection phase, the detection packet was sent periodically from the source node to the controller according to the predefined path.Then, the controller inferred the failed link according to the arrival state of each detection packet.The experimental results show that, compared with the existing methods, the proposed method can accurately identify multiple failed links in a certain time, and generate fewer detection path sets to meet the above four requirements.

    Computing method for periodic stream reservation in TSN combined with SDN controller
    Jianzhong SU, Huayu ZHANG, Hailong ZHU
    2021, 42(10):  23-31.  doi:10.11959/j.issn.1000-436x.2021204
    Asbtract ( 322 )   HTML ( 45)   PDF (1306KB) ( 539 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In recent years, with the development of TSN, its low latency, low jitter and predictable maximum delay can be widely used in automatic driving technology and industrial Internet.To solve the 75% (empirical value) bandwidth problem of stream reservation technology in TSN protocols, and combine with the separation of data plane and control plane in SDN, a stream reservation solution was put forward, which was combined with TSN-SDN controller and scheduling the transmission path and reservation of the entire topology in the control plane.And two reservation computing methods was put forward, which would give out a bandwidth with time slot.The simulation experimental results show that it can control the jitter to 0 based on require latency, and also use the bandwidth based on time slot to guarantee the utilization of bandwidth.

    DetNet service share protection scheme based on SRv6
    Shuopeng LI, Juan FANG, Ken CHEN
    2021, 42(10):  32-42.  doi:10.11959/j.issn.1000-436x.2021203
    Asbtract ( 337 )   HTML ( 39)   PDF (827KB) ( 652 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve the problem that existing methods are difficult to achieve efficient deployment and service protection in deterministic network (DetNet), a DetNet service protection architecture based on SRv6 was proposed.By leveraging this architecture, a service-oriented DetNet protection scheme was designed and the share protection policy was formulated.With the aid of backup bandwidth share, the proposed heuristic based on shortest path optimized network resource utilization and delay.The simulation results show that the share protection algorithm achieves better performance than non-share algorithm.

    Integrating 5G-U with time-sensitive networking for industrial Internet: architectures and technologies
    Yueping CAI, Dong LI, Chi XU, Zhen WANG, Xiaowen ZHANG
    2021, 42(10):  43-54.  doi:10.11959/j.issn.1000-436x.2021161
    Asbtract ( 559 )   HTML ( 58)   PDF (1409KB) ( 981 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Industrial Internet is one of enabling technologies for Industry 4.0.Networking is one indispensible technology of industrial Internet.The traffic types and communication requirements of typical industrial services were analyzed first.TSN (time-sensitive networking) and 5G-U (5G unlicensed) were considered as the promising wireline and wireless solutions for industrial Internet, respectively.The integration network architectures of 5G-U and TSN were presented based on four models, which included 5G-U as TSN networks, links, bridges/switches, and TSN as transport networks of 5G-U.The key technologies of the integrated architectures were integrations of time-synchronization plane, data plane, and control plane.Finally, research challenges and potential research directions in the filed were discussed.

    Papers
    Differentiated and negotiable mechanism for data communication
    Wenlong KOU, Fenghua LI, Xiuze DONG, Xiaogang CAO, Kui GENG, Qing LI
    2021, 42(10):  55-66.  doi:10.11959/j.issn.1000-436x.2021183
    Asbtract ( 213 )   HTML ( 24)   PDF (758KB) ( 266 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In view of the massive and differentiated computing units and terminal devices in the cloud environment and the Internet of things, the differences in hardware resources and computing capabilities posed new challenges to high reliability and high performance data communication, a data communication mechanism supporting differentiation and negotiation was proposed.A parameters negotiation method was proposed, and parameters were negotiated by the sender according to the difference of the receiver capability to achieve differentiated and negotiable data communication.A retransmission feedback mechanism was designed, and the transmission rate was dynamically adjusted and the data was retransmitted based on the data reception feedback of the receiver by the sender to improve communication efficiency and reliability.The experimental results show that the proposed mechanism can perform dynamic adaptive, efficient and parallel communication according to the difference of the receiver capability.

    AONT-and-NTRU-based rekeying scheme for encrypted deduplication
    Chunfu JIA, Guanxiong HA, Shaoqiang WU, Hang CHEN, Ruiqi LI
    2021, 42(10):  67-80.  doi:10.11959/j.issn.1000-436x.2021187
    Asbtract ( 318 )   HTML ( 29)   PDF (916KB) ( 280 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Rekeying is a good way to protect against key exposure.Most of the existing encrypted deduplication systems are implemented based on message-locked-encryption, in which multiple users with the identical data share the same encryption key.When a user updates keys, that update must be followed by all other data owners, which will incur large computational and communicational overheads.To solve this problem, an AONT-and-NTRU-based rekeying scheme was proposed, a variant of AONT was designed to solve the synchronization problem of multi-user rekeying, and a proxy re-encryption algorithm based on NTRU was introduced to reduce the communicational overhead for the system and computational overhead for clients during rekeying.The efficiency analysis and experimental results show that the proposed scheme has better encryption and decryption efficiency than existing schemes and the time cost of rekeying is significantly reduced.

    Time-based and privacy protection revocable and traceable data sharing scheme in cloud computing
    Jiawei ZHANG, Jianfeng MA, Zhuo MA, Teng LI
    2021, 42(10):  81-94.  doi:10.11959/j.issn.1000-436x.2021206
    Asbtract ( 369 )   HTML ( 56)   PDF (1127KB) ( 574 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    General ciphertext-policy attribute-based encryption (CP-ABE) provides fine-grained access control for data sharing in cloud computing, but its plaintext formed access policy may cause leakage of private and sensitive data.And revoking a malicious user by accurately tracing the identity according to a leaked decryption key is a huge challenge.Moreover, most of existing revocable schemes incur long user revocation list and low efficiency.To solve these problems, a time-based and privacy preserving revocable and traceable data sharing scheme was proposed based on CP-ABE to support expressive monotonic and partial hidden access policy, large attribute universe by conceal the attribute values in access policy.Time-limited data access control using hierarchical identity-based encryption was achieved to set key valid period for users.Moreover, with the approaches of white-box tracing and binary tree, efficient user tracing and direct revocation with shorter revocation list was realized together with high efficiency via online/offline and verifiable outsourced decryption techniques.Furthermore, the scheme was secure under decisional q-BDHE assumption.Theoretical analysis and extensive experiments demonstrate its advantageous performance in computational and storage cost.

    Adaptive gradient algorithm for hybrid precoding in mmWave MIMO system
    Yu ZHANG, Zhi ZHANG, Xiaodai DONG
    2021, 42(10):  95-105.  doi:10.11959/j.issn.1000-436x.2021207
    Asbtract ( 260 )   HTML ( 30)   PDF (759KB) ( 395 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To reduce the complexity of existing hybrid precoding algorithms based on alternating minimization (AltMin) and online learning via gradient descent with momentum in mmWave MIMO systems, aiming at the single-user scenario, the problem of designing the hybrid precoder was reconsidered and an equivalent single hidden layer neural network was proposed.Under the new architecture, the elements of the digital and analog precoder were equivalent to the connecting weights of a single hidden layer neural network, and their optimal solution could be obtained via the weights training method.Inspired by the back propagation (BP) algorithm in feed forward neural networks, an adaptive gradient (AG)-based BP algorithm for hybrid precoding was proposed.Furthermore, the proposed algorithm was extended to the multi-user scenario.The numerical results show that the proposed algorithm achieves approximately the same spectral efficiency as the fully-digital precoding in both the single-user and multi-user scenarios, while has lower complexity than the existing AltMin-based hybrid precoding algorithms and online learning hybrid precoding based on gradient descent with momentum.

    Semantic guidance attention network for occluded person re-identification
    Xuena REN, Dongming ZHANG, Xiuguo BAO, Bing LI
    2021, 42(10):  106-116.  doi:10.11959/j.issn.1000-436x.2021184
    Asbtract ( 296 )   HTML ( 37)   PDF (1395KB) ( 400 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve the problem of misalignment and mismatch in occluded person Re-ID, SGAN (semantic guided attention network) was proposed.In SGAN, the semantic masks of pedestrians were used as supervision to learn the global and local features through the attention modules, and the training process was dynamically adjusted according to the visibility of local regions.In the inference stage, the part-to-part matching strategy was adopted to adaptively measure visible features based on the feature visibility, which was obtained based on the learned masks from the attention modules.Experimental results show that the average accuracy of SGAN on the holistic datasets is better than most advanced models.Additionally, it is tolerant of occlusions and largely outperforms existing person Re-ID methods on two larger-scale complex occlusion datasets (Occluded-DukeMTMC and P-DukeMTMC-reID).

    Nanosecond level time synchronization in datacenter network based on Telemetry architecture
    Qianli ZHANG, Chaofan ZHANG, Jilong WANG, Xiangyu TANG, Zhengchen SHEN, Hui WANG
    2021, 42(10):  117-129.  doi:10.11959/j.issn.1000-436x.2021147
    Asbtract ( 294 )   HTML ( 30)   PDF (1238KB) ( 474 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve the problems of the traditional local time synchronization architecture being disconnected from centralized management, requiring extra interaction overhead, meanwhile with less time data susceptible to outliers, the nanosecond level time synchronization system was proposed based on Telemetry for the high-precision time synchronization requirements of data center networks.Combined with the outlier factor detection algorithm, timestamp information within the background traffic of the data center was collected, the large amount of time information reported was processed and analyzed, and a centralized automatic synchronization with nanosecond level precision was eventually achieved, which was convenient for subsequent global network scheduling.The proposed system was implemented and evaluated on the programmable switch.Experimental results show that between multiple hops and at different link rates, the nodes can achieve high-precision time synchronization at the nanosecond level.

    Deep factorization machine model based on attention capsule
    Yiran GU, Zhupeng YAO, Haigen YANG
    2021, 42(10):  130-139.  doi:10.11959/j.issn.1000-436x.2021185
    Asbtract ( 195 )   HTML ( 17)   PDF (848KB) ( 377 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the problems of single feature combination of recommendation model, resolution of a large amount of valuable feature information, and over-fitting in deep learning, a new attentional scoring mechanism called attention capsule was designed, and a deep factorization machine model based on attention capsule was proposed.Users’ historical clicking and candidate items were processed through weight calculation based on the DeepFM model, reducing the impact of irrelevant features on the model, and the differential impact of different historical behaviors on users’ interests was fully explored.The adaptive regularization formulation was added to the training, which effectively reduced over-fitting without affecting the training speed.The comparison test on two public data sets shows that the proposed model is significantly enhanced in loss function and GAUC compared to other models.

    Public key searchable encryption scheme in blockchain-enabled multi-user environment
    Dong ZHENG, Tianze ZHU, Rui GUO
    2021, 42(10):  140-152.  doi:10.11959/j.issn.1000-436x.2021130
    Asbtract ( 375 )   HTML ( 53)   PDF (1001KB) ( 502 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to meet the needs of data security sharing in multi-user environment, a public key searchable encryption scheme supporting one-to-many mode was proposed.Specifically, the data owner could specify multiple users to retrieve the ciphertext by executing the encryption algorithm once, so as to achieve more flexible sharing of ciphertext data.In addition, the specific file encryption key transfer algorithm was designed to ensure that the user could decrypt and obtain the plaintext correctly after retrieving the ciphertext.Combined with the blockchain technology, the smart contract execution detection algorithm was used to ensure the correctness of the retrieval results.In terms of security, based on the decisional bilinear Diffie-Hellman hypothesis and the modified bilinear Diffie-Hellman hypothesis, it was proved that the proposed scheme satisfies the security requirements of keyword indistinguishability and trapdoor information indistinguishability under the random oracle model, and could resist the internal keyword guessing attack.Finally, the proposed scheme and the existing related schemes were simulated by using jPBC cryptolibrary, and the test results show that the proposed scheme has high computational efficiency.

    Improved SOR signal detection algorithm in massive MIMO-TRDMA systems
    Mingyue WANG, Fangwei LI, Xiaorong JING, Haibo ZHANG, Junzhou XIONG
    2021, 42(10):  153-161.  doi:10.11959/j.issn.1000-436x.2021205
    Asbtract ( 178 )   HTML ( 12)   PDF (767KB) ( 251 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In the massive multi-input multi-output time-reversal division multiple access (MIMO-TRDMA) systems, the traditional linear minimum mean square error (MMSE) algorithm achieved approximately the best performance.However, the matrix inversion of the MMSE algorithm was too complicated to ensure real-time processing of signal detection.To solve this problem, an improved successive over-relaxation (SOR) signal detection optimization algorithm was proposed.The proposed algorithm reasonably upgraded the solution of linear equations to prevent the complicated calculation of matrix inversion.Meanwhile, the steepest descent idea was used to provide an effective search direction for the SOR signal detection algorithm, achieving a rapid convergence rate and stronger inspection performance.The simulation results show that the proposed algorithm has the similar best performance with fewer update times compared with the traditional MMSE algorithm, and the calculation complexity is reduced from O(M3)to O(2).

    Malicious domain name detection method based on associated information extraction
    Bin ZHANG, Renjie LIAO
    2021, 42(10):  162-172.  doi:10.11959/j.issn.1000-436x.2021181
    Asbtract ( 274 )   HTML ( 36)   PDF (855KB) ( 448 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To improve the accuracy of malicious domain name detection based on the associated information, a detection method combining resolution information and query time was proposed.Firstly, the resolution information was mapped to nodes and edges in a heterogeneous information network, which improved the utilization rate.Secondly, considering the problem of high computational complexity in extracting associated information with matrix multiplication, an efficiency breadth-first network traversal algorithm based on meta-path was proposed.Then, the query time was used to detect the domain names lacking meta-path information, which improved the coverage rate.Finally, domain names were vectorized by representation learning with adaptive weight.The Euclidean distance between domain name feature vectors was used to quantify the correlation between domain names.Based on the vectors learned above, a supervised classifier was constructed to detect malicious domain names.Theoretical analysis and experimental results show that the proposed method preforms well in extraction domain name associated information.The coverage rate and F1 score are 97.7% and 0.951 respectively.

    Text similarity detection method based on NLP
    Xiaoli DAI, Shifeng LIU, Daqing GONG
    2021, 42(10):  173-181.  doi:10.11959/j.issn.1000-436x.2021192
    Asbtract ( 489 )   HTML ( 44)   PDF (715KB) ( 636 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Current text similarity detection methods that ignore document structure information and lack semantic relevance.To solve these problems, a text-oriented similarity detection method was proposed.First, analytic hierarchy process (AHP) was used to calculate word position weight to extract feature words.Second, the Pearson correlation coefficient was used to measure semantic correlation between words which was the weight of generalized Dice coefficient to calculate similarity.Experimental results show that the proposed method can improve the precision of feature word extraction and the accuracy of similarity calculation results.

    Construction of quantum BCH code based on cyclotomic coset
    Lijuan XING, Zhuo LI
    2021, 42(10):  182-188.  doi:10.11959/j.issn.1000-436x.2021194
    Asbtract ( 179 )   HTML ( 22)   PDF (606KB) ( 339 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Quantum-error-correcting code can overcome quantum decoherence efficiently, which is the key technology to realize quantum computers.A series of quantum BCH code was proposed based on classical codes.First, a general way of well-chosen cyclotomic coset was introduced.A sufficient condition was given to calculate the number of elements in cyclotomic coset.Then, a series of quantum BCH (Bose-Chaudhuri-Hocquenghem) code over finite field Fq was constructed by CSS (Calderbank-Shor-Steane) construction and Steane construction.The results were extended to finite field Fq2 with Hermitian construction.Compared with the results in literature,the range of introduced cyclotomic coset is more wide, and the new quantum BCH code has higher dimensions and better lower bounds on minimum distances.Furthermore, a family of quantum maximum distance separable (quantum MDS) code over any finite fields is constructed.

    Channel estimation for hybrid intelligent reflecting surface structure assisted mmWave communications
    Youhua FU, Dong CHEN
    2021, 42(10):  189-196.  doi:10.11959/j.issn.1000-436x.2021197
    Asbtract ( 333 )   HTML ( 61)   PDF (781KB) ( 474 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    When adding intelligent reflecting surface (IRS) for assist communication in millimeter wave communication, the system becomes complicated and difficult to obtain channel state information (CSI).To solve these challenges, a hybrid intelligent reflecting surface structure was adopted, that is, the IRS was composed of a large number of passive elements and the limited radio frequency (RF) chains, where the limited RF chains were used to estimate the channel between the base station/terminal and the IRS.Based on the structure, a channel estimation scheme was proposed, which was based on the limited RF chains.First, an improved multiple signal classification algorithm was used to estimate the departure angle and arrival angle of the channel at the same time, and then a complex parallel deep neural network was proposed to estimate the path gain.Through simulation and comparison between the proposed scheme and other methods, the superiority of the proposed scheme is proved.

    Membership inference attacks against transfer learning for generalized model
    Jinyin CHEN, Wenchang SHANGGUAN, Jingjing ZHANG, Haibin ZHENG, Yayu ZHENG, Xuhong ZHANG
    2021, 42(10):  197-210.  doi:10.11959/j.issn.1000-436x.2021209
    Asbtract ( 328 )   HTML ( 30)   PDF (1035KB) ( 375 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the problem of poor performance of exciting membership inference attack (MIA) when facing the transfer learning model that is generalized, the MIA for the transfer learning model that is generalized was first systematically studied, the anomaly detection was designed to obtain vulnerable data samples, and MIA was carried out against individual samples.Finally, the proposed method was tested on four image data sets, which shows that the proposed MIA has great attack performance.For example, on the Flowers102 classifier migrated from VGG16 (pretraining with Caltech101), the proposed MIA achieves 83.15% precision, which reveals that in the environment of transfer learning, even without access to the teacher model, the MIA for the teacher model can be achieved by visiting the student model.

    Comprehensive Review
    Survey on cooperative fusion technologies with perception, communication and control coupled in industrial Internet
    Hui TIAN, Shuo HE, Shangjing LIN, Shaoshuai FAN, Gaofeng NIE, Xiurong JIANG
    2021, 42(10):  211-221.  doi:10.11959/j.issn.1000-436x.2021177
    Asbtract ( 719 )   HTML ( 107)   PDF (1668KB) ( 738 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The cooperative fusion with perception, communication and control is the inevitable trend of industrial Internet.Sorting out the research development and challenges of the cooperative fusion technologies with perception, communication and control in industrial Internet is of great significance to promote the development of industrial Internet.Firstly, the complicated coupling relationship among perception, communication and control in industrial Internet was introduced.Then, the related works and open problems of the cooperative fusion technologies with perception, communication and control were summarized.Finally, the future research directions were summarized and prospected for the problems of the cooperative fusion technologies with perception, communication and control in industrial Internet.

    Correspondences
    Doubly-selective channel estimation for generalized frequency division multiplexing systems based on deep learning
    Ying WANG, Jun REN, Ke SHI, Bin LIN
    2021, 42(10):  233-242.  doi:10.11959/j.issn.1000-436x.2021188
    Asbtract ( 270 )   HTML ( 38)   PDF (882KB) ( 269 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    There exist intrinsic inter-carrier interference and inter-subsymbol interference in generalized frequency division multiplexing (GFDM) systems.Under condition of time-frequency doubly selective channels, severe effects of pilot contamination would occur and lead to significant performance degradation for the pilot-based channel estimations.To this end, a channel estimation framework for GFDM systems based on deep learning was proposed, which took the low-resolution image constructed with the least squares estimated channel gains of the pilot symbols as input.Consequently, a high-resolution image about the channel time-frequency response was recovered through a deep residual network, and the channel estimation was achieved for GFDM systems.A simulation system for the proposed GFDM time-frequency doubly selective channel estimation algorithm based on deep residual network was developed, and the optimal parameters of the deep residual network were determined through an offline training process.Simulation results show that the proposed algorithm can achieve better performance near to minimum mean square error (MMSE) estimation in terms of estimation error and bit error rate (BER), and has robust Doppler frequency shift generalization capability.

    Performance analysis of dual-hop PLC-FSO communication system
    Shenghai CHEN, Xiaoqin YAN, Sai LI, Liang YANG
    2021, 42(10):  243-250.  doi:10.11959/j.issn.1000-436x.2021199
    Asbtract ( 238 )   HTML ( 19)   PDF (888KB) ( 390 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A dual-hop power line communication and free-space optical communication (PLC-FSO) system was proposed, where an amplify-and-forward (AF) relay was applied to help the signal transmission between the PLC link and the FSO link.More specifically, it was assumed that the PLC link was affected by both additive background noise and impulsive noise, and the channel fading followed log-normal distribution, while the fading induced by the atmospheric turbulence in the FSO link followed a Gamma-Gamma distribution, and the effect of pointing errors was also considered.Based on this model, closed-form expressions for the outage probability, bit error rate, and the channel capacity were derived.In addition, asymptotic analysis for the outage probability and BER, and upper bound expression for the channel capacity were presented.Finally, the accuracy of the analytical results was justified through Monte-Carlo simulations.The results show that the system outage probability decreases as the pointing error parameter increases and the smaller the PLC link impulse noise, the lower the bit error rate.The system capacity increases as the turbulence intensity decreases.

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: