Please wait a minute...

Current Issue

    25 November 2012, Volume 33 Issue 11
    Academic paper
    Blind recognition of real orthogonal STBC based on independent component analysis
    Zhi-jin ZHAO,Lin CHEN,Hai-quan WANG,Lei SHEN
    2012, 33(11):  1-7.  doi:10.3969/j.issn.1000-436x.2012.11.001
    Asbtract ( 244 )   HTML ( 0)   PDF (180KB) ( 448 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A method for blind recognition of orthogonal space-time block coding (OSTBC) based on independent component analysis (ICA) was proposed.Firstly,the model of received signal was given.And then independent component analysis technology was used to separate the virtual channel matrix which contains coding matrix information.Using the characteristics of coding matrix,it was proved that the correlation matrix of the virtual channel matrix in OSTBC communication systems was diagonal matrix.Finally,two characteristic parameters were proposed: sparsity and variance,which could recognize OSTBC.Simulation results demonstrated that the proposed method is able to identify OSTBC while achieves good performance.

    Research on pulse width model of optical signal based on effects of combined physical impairments
    Ji-jun ZHAO,Kun GUO,Zhi-hua LI,Li-rong WANG,Wen-yu ZHAO
    2012, 33(11):  8-16.  doi:10.3969/j.issn.1000-436x.2012.11.002
    Asbtract ( 173 )   HTML ( 2)   PDF (213KB) ( 318 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the accurate assessment of physical impairments,the suppression or enhancement effect of self phase modulation (SPM) on group velocity dispersion(GVD) were analyzed.Then,a pulse width model based on their combined effects on signal distortion was proposed.This model considered the effects of combined physical impairments,and it was applied in the simulation of the impairment-aware routing and wavelength assignment(IA-RWA) algorithm.The results indicate that comprehensive consideration of the effects caused by combined physical impairments is conductive to accurately avoid more serious physical impairments during routing and reduces blocking rate.

    Game theoretical routing protocol with fairness problem in wireless mesh networks
    Wen-jiang JI,Jian-feng MA,You-liang TIAN,Zhuo MA
    2012, 33(11):  17-23.  doi:10.3969/j.issn.1000-436x.2012.11.003
    Asbtract ( 214 )   HTML ( 3)   PDF (146KB) ( 572 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on game theory,a routing protocol studied with irness problem was proposed.Each router had the same opportunities of Internet access no matter how far from the gateway.Based on the tree topology,the calculation of route could be distributed to every branches of the tree,which greatly reduced the load of the root and more suitable for wireless mesh networks.The simulation results show that the new protocol is more suitable for wireless mesh networks compare with AODV and HWMP,no matter in network throughput or average end-to-end delays,as far as fairness.

    Improving achievable traffic load of cognitive wireless networks under GoS constraints
    Liang YU,Tao JIANG,Yang CAO
    2012, 33(11):  24-32.  doi:10.3969/j.issn.1000-436x.2012.11.004
    Asbtract ( 140 )   HTML ( 0)   PDF (260KB) ( 527 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To improve the achievable traffic load of secondary user(SU) under grade of service (GoS) constraints in cognitive wireless networks with heterogeneous traffic,a novel spectrum sharing scheme was proposed.The key idea of the proposed scheme was to introduce preemptive priority and buffering mechanism for real-time traffic and non-real-time traffic,respectively,according to their different delay characteristics.The proposed scheme could reduce the forced termination probability and the blocking probability for heterogeneous calls simultaneously.Numerical results show that the proposed scheme can effectively improve the achievable traffic load of SUs under GoS constraints.

    Optimal configuration algorithm for static segment of FlexRay
    Yong XIE,Ren-fa LI,Hua-bin RUAN,Xin PENG
    2012, 33(11):  33-40.  doi:10.3969/j.issn.1000-436x.2012.11.005
    Asbtract ( 274 )   HTML ( 4)   PDF (134KB) ( 413 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    FlexRay,which could provide high data bandwidth,time determinism and reliability,was recognized as the standard of the next generation automotive buses,but the complexity of the configuration hindered its wide application in automotive electronics systems.Slot ID assignment of static segment was the key part of its configuration.Started from the system-level point of view,a new system-level scheduling unit model was defined.Based on confining the iable slot IDs and analyzing delay for each scheduling unit,a branch and bound-based searching was carried on to search the optimal slot ID assignment plan that realized the minimization of system’s end-to-end delay.Both theoretical proving and experimental results show that the slot ID assignment method is optimal in optimizing system’s end-to-end delay.

    Context-aware and self-adaptive trust model for pervasive computing
    Jiang-tao WANG,Zhi-gang CHEN,Xiao-heng DENG
    2012, 33(11):  41-48.  doi:10.3969/j.issn.1000-436x.2012.11.006
    Asbtract ( 299 )   HTML ( 2)   PDF (133KB) ( 447 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To cope with the behaviour trust problems emerging at ve environments,a context-aware and selfadaptive trust model(CASATM) for pervasive environments was proposed,the trust model provided security protection based on service content adaptively at various level,nd be sensitive to contexts such as time,location and service content.A simple and efficient risk evaluation model was presented to initialize trust value to unknown entities which was a common phenomenon in pervasive environments.Simulation results testify to the contexts awareness of this model,as well as resistance of periodically cheating behaviour from malicious entity.

    Research towards IoT-oriented universal control system security model
    Jin-cui YANG,Bin-xing FANG,Li-dong ZHAI,Fang-jiao ZHANG
    2012, 33(11):  49-56.  doi:10.3969/j.issn.1000-436x.2012.11.007
    Asbtract ( 355 )   HTML ( 2)   PDF (143KB) ( 531 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In Internet of things,the control loop of industrial Ethernet and real-time Ethernet is easily exploited by hackers for malicious attacks,causing serious security incidents in the physical world; a universal control system model (IoTC) was put forward by analysing the working principle of the control system in IoT,on which some disturbing factors the system faces were discussed; for the disturbing factors in the system,one universal control system security model (S-IoTC) was given,adding security authentication module in responding disturbing factor to achieve secure system; the components,safety justice and typical realization process of S-IoTC were also described in detail at last.

    Life cycle constrained backoff algorithm for ad hoc network
    Ye-qun WANG,Guo-ce HUANG,Heng-yang ZHANG,Bo ZHENG,Yuan JING
    2012, 33(11):  57-66.  doi:10.3969/j.issn.1000-436x.2012.11.008
    Asbtract ( 295 )   HTML ( 0)   PDF (339KB) ( 394 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on researching binary exponential backoff algorithm which defined in IEEE 802.11 standard,a life cycle constrained adaptive backoff algorithm(LCAB) was proposed.LCAB used life cycle instead of maximum retransmission times as the reference of packet dropping,and controlled process of backoff adaptively according to degree of network congestion.It fitted for real-time traffic such as VoIP which used widely in ad hoc network.A Markov model was introduced to analyze the performance of LCAB,and the normalized effective throughput of LCAB was obtained.The results show that the theoretic analysis is in accordance with the simulation,and the throughput of LCAB is better than that of BEB.

    Optimized design of complex field network coding scheme in non-orthogonal multiple access relay system
    Xi CAI,Ping-zhi FAN,Qing-chun CHEN
    2012, 33(11):  67-73.  doi:10.3969/j.issn.1000-436x.2012.11.009
    Asbtract ( 218 )   HTML ( 0)   PDF (231KB) ( 274 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Wireless relay and network coding are two fundamental techniques to enhance the throughput of wireless communication system.The optimized design of complex field network coding scheme in non-orthogonal multiple access single relay system was addressed.Firstly,given the total transmitting power at all source nodes (equal transmitting power at every source node was assumed) and the relay node,the system might achieve the minimal symbol error probability (SEP) when the total transmitting power were equally allocated to all source nodes and relay node.Secondly,the choice of the complex field network coding coefficients plays an important role in the achieved SEP for the non-orthogonal multiple access single relay system was disclosed,and the optimized coding coefficient design in terms of the maximal coding gain were presented for arbitrary number of source nodes.It was shown that,the similarity of network coded signal of multiple source signals could be effectively avoided by using the optimized coding coefficient,which accounted for the realized performance improvement in the non-orthogonal multiple access single relay system.

    Opportunistic spectrum sharing protocol and optimal resource allocation based on OFDM cooperation relaying
    Wei-dang LU,Xuan-li WU,Xue-jun SHA,Nai-tong ZHANG
    2012, 33(11):  74-86.  doi:10.3969/j.issn.1000-436x.2012.11.010
    Asbtract ( 186 )   HTML ( 0)   PDF (243KB) ( 513 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An opportunistic spectrum sharing protocol based on OFDM cooperation relaying was proposed.When the primary user experiences weak channel conditions,it could not achieve its target rate.If the cognitive user could help the primary user achieve its target rate,it accessed the pectrum of the primary user in the cooperation way.In this access way,the cognitive user used a fraction of the subcarriers to amplify-and-forward the signal of the primary user,to help the primary user achieve its target rate.And uses the remained subcarriers to transmit its own signal.The resource allocation was analyzed in this cooperation way.An optimal resource allocation algorithm based on dual ethod was proposed,which maximized the rate of the cognitive user while g anteeing the primary user achieve its target rate.If the cognitive user could not help the primary user achieve its target rate,to make use the spectrum efficiently,the cognitive user accessed the spectrum of the primary user in the non-cooperation way,and uses the whole accessed spectrum to transmit its own signal.The simulation demonstrates the efficiency of the proposed spectrum sharing protocol as well as its benefit to both primary and cognitive user.

    Design of network management and regulation system over flexible reconfiguration
    Yu-feng LI,Han QIU,Qin-rang LIU,Ju-long LAN
    2012, 33(11):  84-90.  doi:10.3969/j.issn.1000-436x.2012.11.011
    Asbtract ( 208 )   HTML ( 0)   PDF (181KB) ( 463 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Network management and regulation system is a new arising appliance for the manageable,controllable and trustworthy demand of the Internet.The architecture design of the backbone link-level management and regulation system usually follows the core router,in which the separation of the data plane and the control plane could not meet the requirement of HW/SW data co-process,the rigid connection with closed building style could not satisfy the flexible identification of new applications.The loosely coupled switching HW/SW co-process architecture and the iterative looping HW/SW migration architecture were proposed,which could satisfy the above HW/SW co-process demand and the new application flexible identification demand.

    Novel method of constructing the zero-sum distinguishers
    Le DONG,Wen-ling WU,Shuang WU,Jian ZHOU
    2012, 33(11):  91-99.  doi:10.3969/j.issn.1000-436x.2012.11.012
    Asbtract ( 268 )   HTML ( 3)   PDF (211KB) ( 429 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel method of constructing the zero-sum distinguishers for AES-like permutations was proposed by considering the diffusion properties of these permutations,which have the similar construction.The method combined the higher-order integral attack and the higher-order differential attack.Utilizing the selected intermediate-state-structure whose active mode was determined,a higher-order integral path was constructed.Then,a higher-order differential trace was built from the two ends of the integral path.Applying the method,the full-round zero-sum attack on two permutations adopted by the PHOTON family was improved.Besides,a 31.5-round zero-sum distinguisher of the core function of JH hash function was constructed,which entered into the final round of the SHA-3 competition.

    Scalable video coding algorithm based on 3D hybrid tree and visual characteristics
    Ming-zhe FU,Xiang-hai WANG,Chuan-ming SONG
    2012, 33(11):  100-107.  doi:10.3969/j.issn.1000-436x.2012.11.013
    Asbtract ( 238 )   HTML ( 0)   PDF (139KB) ( 346 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The distribution characteristic of three-dimensional wavelet coefficients of video data was ana ed,and a scalable video coding algorithm was subsequently addressed based on hybrid three-dimensional tree and human visual system (HVS) characteristics.First,the hybrid tree structure was adaptively determined according to the auto-correlation of low-pass and high-pass coefficients.It reduced obviously the number of ion bits locating significant wavelet coefficients when scanning and processing low-pass and high-pass coefficients in temporal dimension.Second,each wavelet coefficient was weighted in terms of HVS sensitivity to its corresponding subband.Significant coefficients thus tended to be coded with high priority and arranged at the front of bitstream,and the reconstructed video quality was improved at low and medium bitrates to a great extent.Experimental results in terms of peak signal-to-noise ratio (PSNR) verified the effectiveness of the proposed algorithm on several test videos with varying characteristics.0.65dB,1.75dB,and 1.77dB higher PSNR are gained than asymmetric 3-D orientation tree for Y,U,and V components,respectively.Moreover,0.23dB,2.11dB,and 1.72dB higher PSNR are reached than single temporal-spatial orientation tree separately for Y,U,and V components.Besides,better subjective quality is obtained through effectively attenuating ringing artifact.

    Performance analysis and re-modeling of secondary users in cognitive radio system
    Wei LIN,Yu FU,Qin-yu ZHANG,Ye WANG,Sheng WANG
    2012, 33(11):  108-121.  doi:10.3969/j.issn.1000-436x.2012.11.014
    Asbtract ( 253 )   HTML ( 0)   PDF (304KB) ( 431 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A number of errors in the past Markov model and theoretical analysis were discussed in spectrum access based on cognitive radio network (CRN).To imitate the behav ary user (PU) and secondary user (SU) factually,new models for access strategy were presented.The performance of CRN based on different access strategies were reappraised and compared by using matrix geometric theory and event scheduling of discrete events system simulation.Theoretical analysis results and simulation experiments were tally close,which confirms the reliability of proposed models.The access strategies with handoff and channel reservation efficiently decrease the call dropping probability,as while as,increase the blocking probability.And the thought for CRN can reach the maximum in the latter with the optimum number of reserved channels.

    Technical Report
    Self-adaptive encryption algorithm for image based on affine and composed chaos
    Chang-ci WEN,Qin WANG,Fu-min HUANG,Zhi-shu YUAN,Chun-sheng TAO
    2012, 33(11):  119-127.  doi:10.3969/j.issn.1000-436x.2012.11.015
    Asbtract ( 224 )   HTML ( 5)   PDF (297KB) ( 574 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    On the basis of three-dimensional affine transformation in limited integer domain and composed chaos,a novel digital image encryption algorithm was proposed.Firstly,it scrambled pixels’ position and confused pixels’ value according to corresponding coordination.Secondly,it took a series of nonlinear diffusion,substitution and re-diffusion.In the process of substitution,it introduced pixels’ value to perturb multiple chaos systems that were coupled together for self-adaptive encryption.The algorithm proceeded the above two steps for 3 times to defend chosen plaintext attack,and had huge key space to defend violent attack.The scrambling function in it was compatible with images at any ratio of length to width without any preprocessing; the constructed whole chaos system which had a simple form was designed modularly,and could be realized parallel conveniently.

    Clustered P2P based resource query and dissemination for multi-hop wireless mesh network
    Ji-gang WEN,Kun XIE,Gao-gang XIE,Guang-xing ZHANG,Ren-fa LI
    2012, 33(11):  128-135.  doi:10.3969/j.issn.1000-436x.2012.11.016
    Asbtract ( 230 )   HTML ( 0)   PDF (135KB) ( 336 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    According to the character of mesh topology and character of the different types of mesh nodes,the multi-hop wireless mesh network was modeled as clustered P2P.Moreover,in order to save the message bandwidth,the Bloom filter as the message to represent the resource list abstract was used,and the message was transmitted among the constructed P2P clusters.To minimize the downloading interruption due to mobility of clients,a resource-density-sensitive resource query and dissemination algorithm in which the query was transmitted to the cluster that had the maximum number of replica resources was proposed.The simulation results show that the proposed resource query and distribution algorithm can provide appealing resource downloading performance.

    Technique for target recognition based on intuitionistic fuzzy c-means clustering and kernel matching pursuit
    Yang LEI,Wei-wei KONG,Ying-jie LEI
    2012, 33(11):  136-143.  doi:10.3969/j.issn.1000-436x.2012.11.017
    Asbtract ( 186 )   HTML ( 2)   PDF (182KB) ( 555 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Kernel matching pursuit requires every step of searching process be global optimal searching in the redundant dictionary of function.Namely,the dictionary learning time of KMP was too long.To the above drawbacks,a novel technique for KMP based on IFCM was proposed to substitute local searching for global searching by the property superiority of dynamic clustering performance,which was also the superiority in Intuitionistic fuzzy c-means algorithm.Then two testing including classification and effectiveness were carried out towards four real sample data.Subsequently,high resolution range profile (HRRP)was selected from the classical properties of target recognition in e middle ballistic trajectory,which were extracted for getting sub-range profile.Finally,three algorithms including FCM,KMP,IFCM-KMP were carried out respectively towards different kinds of sub-range profile samples in emulation platform,the conclusion of which fully demonstrates that the IFCM-KMP algorithm is superior over FCM and KMP when it comes to target recognition in the middle ballistic trajectory.

    Clustering scheme of base stations cooperation based on maximizing the average system performance
    Kun LI,Kai-zhi HUANG,Jiang JI,Tao FENG,Yan-qing JIN
    2012, 33(11):  144-150.  doi:10.3969/j.issn.1000-436x.2012.11.018
    Asbtract ( 167 )   HTML ( 0)   PDF (221KB) ( 237 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel clustering scheme based on maximizing average system performance was proposed.Firstly,according to the probability distribution of signal-to-interference-ratio (SIR)gain of base stations cooperation the average SIR gains were obtained.Then,the cluster structure was generated in the standard of maximizing the average system performance.Not only the average system performance was guaranteed but also the influence of CSI distortion was decreased,while the overall cost was reduced.Simulation results show that when the factors of CSI distortion and channel vibration both are 0.3,the proposed scheme provide a 0.7bit/s/Hz/cell increase of the average system performance compared with the benefit-tree clustering scheme.

    Method for reducing the complexity of clock domain crossing design and its verification in system-on-chips
    Dan LIU,Yi FENG,Xiang-lei DANG,Dong TONG,Xu CHENG,Ke-yi WANG
    2012, 33(11):  151-158.  doi:10.3969/j.issn.1000-436x.2012.11.019
    Asbtract ( 216 )   HTML ( 2)   PDF (160KB) ( 519 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Existing methods for clock domain crossing (CDC) design were used directly in a system-on-chip (SoC),which result in high design and verification complexity.To solve this problem,a design method was proposed.It separated CDC design completely from functional design and transmits all the CDC signals in an IP design with the help of an independent and dedicated CDC processing module.It also scaled down the total number of CDC signals to two groups of opposite directions through encapsulating point-to-point communication interface as well as processing CDC signals of the same direction in combination.Experiment results demonstrate that this method is able to sharply reduce the verification complexity of CDC design and also simplify the whole SoC design,without significant adding to transfer delay or area cost of an IP design.

    Academic communication
    Research on dynamic array honeypot for collaborative network defense strategy
    Le-yi SHI,Jie LI,Xin LIU,Chun-fu JIA
    2012, 33(11):  159-164.  doi:10.3969/j.issn.1000-436x.2012.11.020
    Asbtract ( 344 )   HTML ( 14)   PDF (460KB) ( 1034 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Inspired by the ancient battle diagram for military purpose,a concept of dynamic array honeypot was proposed to bewilder the attackers by coordinating and changing the role pseudo-randomly as a huge dynamic puzzle.The dynamic array honeypot model was presented,system simulation through NS2 was performed,and the prototype implementation with Java was carried out.Detailed empirical studies were launched upon both the simulation model and the prototype.The simulation results demonstrates that the dynamic array honeypot system is feasible and effective for active network confrontation.

    Efficient storage method for FPGA-based partially parallel QC-LDPC decoder
    Rui-jia YUAN,Bao-ming BAI
    2012, 33(11):  165-170.  doi:10.3969/j.issn.1000-436x.2012.11.021
    Asbtract ( 184 )   HTML ( 1)   PDF (113KB) ( 670 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An efficient storage method of hard decisions sharing intrinsic and extrinsic memory banks for partially parallel QC-LDPC decoder was proposed.Extra memory banks for storing hard decisions were avoided in this method,which result in significantly reduced consumption of RAM resources and routed complexity.Implementation results based on a Xilinx XC2V6 000-5ff1 152 FPGA show that the proposed method improves the frequency and decodes throughput of the system,and significantly reduced the requirements for the number of BRAM.

    Joint estimation of doppler frequency and DOA-DOD based on FRFT in bistatic MIMO radar system
    Li LI,Tian-shuang QIU
    2012, 33(11):  171-176.  doi:10.3969/j.issn.1000-436x.2012.11.022
    Asbtract ( 265 )   HTML ( 1)   PDF (148KB) ( 232 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel method for the joint parameters estimate in the bistatic multiple-input multiple-output (MIMO) radar system was proposed.Firstly,a novel signal model to accurately estimate parameters of the et was proposed.Two Doppler parameters,initial Doppler frequency and Doppler frequency rate,were estimated by peak-searching in the fractional Fourier transform (FRFT) domain.Two sub-array models to accurately estimated the direction of departure (DOD) and direction of arrival (DOA) by employing the proposed fractional Fourier transform based MUSIC (FRFT-MUSIC) algorithm and the fractional Fourier transform ESPRIT (FRFT-ESPRIT) algorithm.Simulation results were presented to verify the effectiveness of the proposed method.

    Perceptual image hashing sensitive to content modification
    Li-jia NI,Shuo-zhong WANG,Qiu-min WU,Bei PEI
    2012, 33(11):  177-184.  doi:10.3969/j.issn.1000-436x.2012.11.023
    Asbtract ( 237 )   HTML ( 1)   PDF (330KB) ( 197 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A perceptual image hashing method based on the image content and color distribution was proposed.The image was scaled to a fixed size and divided into blocks.Each block was then classified semantically into complex or plain according to the ratio of the first two singular values of its luminance matrix so as to give a table of complexity indices.RGB components of each complex block were used to form a color-feature vector,which was combined with the complexity table and encrypted to produce the image hash.Experiments show that the hash is robust against content-preserving image manipulations such as JPEG compression,smoothing and re-scaling,and sensitive to tampering of the image content.

    Guess and determine attack on E0algorithm
    Ying-jie ZHAN,Lin DING,Jie GUAN
    2012, 33(11):  185-190.  doi:10.3969/j.issn.1000-436x.2012.11.024
    Asbtract ( 201 )   HTML ( 1)   PDF (103KB) ( 515 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A guess and determine attack on E0was presented,the stream cipher that was used in the short-range wireless technology Bluetooth.In the attack,an ingenious assumption by linear approximation to diminish the number of values that have to be guessed was made.Futher more,a test equation to reduce the number of the guessed candidates was used.The guess and determine attack on E0with time complexity of O(276)required about 988 keystream bit.Compared with long keystream attacks,short keystream attacks were more threatening to E0cipher which require less than 2 745 bit.This attack which belongs to short keystream attack was the fastest state recovery attack on E0so far compared with any other existed short keystream attacks.

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: