The advantages of avionics switched network in network scale and flexibility greatly improve the communication performance of avionics network, promote the development of IMA/DIMA technology and also increase network scale and complexity. Meanwhile, requirements for the management of the avionics system are also on the rise. In this paper, the characteristics of SNMP protocol and airborne switched network are analyzed. The IMA/DIMA system structure is outlined and key demands for system management are extracted According to an IMA system model adopting AFDX as its backbone network with cascading dual integrate processing computers for backup and interconnection, the system management functions of the IMA system are realized in line with the ARINC653 standard partition operating system based on the SNMP protocol, including structure management, fault management, configuration management, etc. specific to LRM/LRU and attached devices under the IMA/DIMA system as well as the dual-machine hot backup function, which can be applied in an IMA/DIMA system consisted of AFDX/FC/TTE and several other airborne switched networks.
{"title":"Design and realization of IMA/DIMA system management based on avionics switched network","authors":"Yukai Hao, Xiaohong Zhang, Xining Cui, Baolei Huang","doi":"10.1109/CITS.2016.7546441","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546441","url":null,"abstract":"The advantages of avionics switched network in network scale and flexibility greatly improve the communication performance of avionics network, promote the development of IMA/DIMA technology and also increase network scale and complexity. Meanwhile, requirements for the management of the avionics system are also on the rise. In this paper, the characteristics of SNMP protocol and airborne switched network are analyzed. The IMA/DIMA system structure is outlined and key demands for system management are extracted According to an IMA system model adopting AFDX as its backbone network with cascading dual integrate processing computers for backup and interconnection, the system management functions of the IMA system are realized in line with the ARINC653 standard partition operating system based on the SNMP protocol, including structure management, fault management, configuration management, etc. specific to LRM/LRU and attached devices under the IMA/DIMA system as well as the dual-machine hot backup function, which can be applied in an IMA/DIMA system consisted of AFDX/FC/TTE and several other airborne switched networks.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123432940","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-08-18DOI: 10.1109/CITS.2016.7546446
Jiasong Zhao, Lizhen Wang, Xuguang Bao, Y. Tan
Spatial co-location patterns represent the subsets of Boolean spatial features, and the instances of the pattern are frequently located together in a geographic space. Most existing co-location pattern mining methods mainly focus on whether spatial feature instances are frequently located together. However, that the occurrence of neighbor relationships is in the whole space or local area is not considered. In this paper, a new measurement using an evenness coefficient of the feature distribution is introduced, and a novel algorithm for co-location pattern mining is proposed, which takes into account the prevalence of the spatial feature and the spatial distribution characteristics of feature instances. Furthermore, some key techniques are presented, including region partition and count of row instances in this algorithm. The experimental evaluation with both synthetic data sets and a real world data set shows that the algorithm can discover prevalent and evenly distributional co-location patterns, and the number of the result set is effectively reduced compare to the traditional mined results.
{"title":"Mining co-location patterns with spatial distribution characteristics","authors":"Jiasong Zhao, Lizhen Wang, Xuguang Bao, Y. Tan","doi":"10.1109/CITS.2016.7546446","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546446","url":null,"abstract":"Spatial co-location patterns represent the subsets of Boolean spatial features, and the instances of the pattern are frequently located together in a geographic space. Most existing co-location pattern mining methods mainly focus on whether spatial feature instances are frequently located together. However, that the occurrence of neighbor relationships is in the whole space or local area is not considered. In this paper, a new measurement using an evenness coefficient of the feature distribution is introduced, and a novel algorithm for co-location pattern mining is proposed, which takes into account the prevalence of the spatial feature and the spatial distribution characteristics of feature instances. Furthermore, some key techniques are presented, including region partition and count of row instances in this algorithm. The experimental evaluation with both synthetic data sets and a real world data set shows that the algorithm can discover prevalent and evenly distributional co-location patterns, and the number of the result set is effectively reduced compare to the traditional mined results.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129333132","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-08-18DOI: 10.1109/CITS.2016.7546417
Cuiqin Dai, Nan-Nan Huang, Hai-Xia Ran
Asymmetric data transmission is a challenge factor in wireless communication channel. In this paper, we study the issue of data processing in asymmetric data transmission from different sources in wireless communication channel, and propose a Joint Hierarchical Modulation and Network Coding (JHMNC) scheme. In the proposed scheme, the procedure of JHMNC is analyzed and compared with the traditional zero padding and Opportunistic User Selection (OUS) schemes which are the generally existed schemes in asymmetric data transmission in wireless channel, and the closed-form expressions of the End-to-End (E2E) Bit Error Rate (BER) for the aforementioned schemes are derived by analyzing the transmission of each node. Simulation results illustrate that the proposed scheme improves the BER performance without additional complexity compared with the traditional zero padding scheme, also can outperform OUS scheme in terms of the average throughput and the channel access probability.
非对称数据传输是无线通信信道中的一个难题。本文研究了无线通信信道中不同来源的非对称数据传输中的数据处理问题，提出了一种联合分层调制和网络编码(JHMNC)方案。在该方案中，分析了JHMNC的过程，并与传统的零填充和机会用户选择(Opportunistic User Selection, ou)等无线信道非对称数据传输中普遍存在的方案进行了比较，通过分析各节点的传输情况，推导出了上述方案的端到端误码率(E2E)的封闭表达式。仿真结果表明，与传统的零填充方案相比，该方案在不增加复杂性的情况下提高了误码率性能，并且在平均吞吐量和信道访问概率方面优于ou方案。
{"title":"Joint hierarchical modulation and network coding for asymmetric data transmission in wireless cooperative communication","authors":"Cuiqin Dai, Nan-Nan Huang, Hai-Xia Ran","doi":"10.1109/CITS.2016.7546417","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546417","url":null,"abstract":"Asymmetric data transmission is a challenge factor in wireless communication channel. In this paper, we study the issue of data processing in asymmetric data transmission from different sources in wireless communication channel, and propose a Joint Hierarchical Modulation and Network Coding (JHMNC) scheme. In the proposed scheme, the procedure of JHMNC is analyzed and compared with the traditional zero padding and Opportunistic User Selection (OUS) schemes which are the generally existed schemes in asymmetric data transmission in wireless channel, and the closed-form expressions of the End-to-End (E2E) Bit Error Rate (BER) for the aforementioned schemes are derived by analyzing the transmission of each node. Simulation results illustrate that the proposed scheme improves the BER performance without additional complexity compared with the traditional zero padding scheme, also can outperform OUS scheme in terms of the average throughput and the channel access probability.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131181334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-08-18DOI: 10.1109/CITS.2016.7546434
Minglong Xue, Haifeng Wu, Yu Zeng
Cognitive radio could detect the white space of spectrum and utilize spectrum resource efficiently. In a cognitive radio system, the recognition of signal modulation is a key technology, which would help the cognitive radio system to configure and realize intelligent green communication. In general, the recognition of signal modulation is not a linear classification. Back propagation (BP) neural network could solve the nonlinear classification. In this paper, we propose a training technique, cubature Kalman filters (CKF) to train a BP network. The network could better classify the nonlinear problem for the modulation recognition in a cognitive radio system. Through the simulation, the results show that the proposed training technique works better than existing techniques for nonlinear modulation classification in a cognitive radio system.
{"title":"Multilayer perceptron for modulation recognition cognitive radio system","authors":"Minglong Xue, Haifeng Wu, Yu Zeng","doi":"10.1109/CITS.2016.7546434","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546434","url":null,"abstract":"Cognitive radio could detect the white space of spectrum and utilize spectrum resource efficiently. In a cognitive radio system, the recognition of signal modulation is a key technology, which would help the cognitive radio system to configure and realize intelligent green communication. In general, the recognition of signal modulation is not a linear classification. Back propagation (BP) neural network could solve the nonlinear classification. In this paper, we propose a training technique, cubature Kalman filters (CKF) to train a BP network. The network could better classify the nonlinear problem for the modulation recognition in a cognitive radio system. Through the simulation, the results show that the proposed training technique works better than existing techniques for nonlinear modulation classification in a cognitive radio system.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131016560","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-08-18DOI: 10.1109/CITS.2016.7546439
Shaopeng Duan, Lanjiang Zhou, Feng Zhou
The recognition of Laos organization name is a difficult problem in the entity recognition of Laos language. This paper presents a algorithm of Laos organization name recognition model based on cascaded conditional random fields. The algorithm solved the recognition of easy entity such as person name and location name in the lower model of conditional random fields(CRFs) and served the recognition of complicated organization names on the higher CRFs. This paper designed a efficient feature template and automatic feature selection algorithm for the conditional random fields model of organization names. In the open test of a mass linguistic data, the recall rate reached 79.67%, precision rate reached 77.72%, F - measure reached 78.68%.
{"title":"The recognition of Laos organization name based on a cascaded conditional random fields","authors":"Shaopeng Duan, Lanjiang Zhou, Feng Zhou","doi":"10.1109/CITS.2016.7546439","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546439","url":null,"abstract":"The recognition of Laos organization name is a difficult problem in the entity recognition of Laos language. This paper presents a algorithm of Laos organization name recognition model based on cascaded conditional random fields. The algorithm solved the recognition of easy entity such as person name and location name in the lower model of conditional random fields(CRFs) and served the recognition of complicated organization names on the higher CRFs. This paper designed a efficient feature template and automatic feature selection algorithm for the conditional random fields model of organization names. In the open test of a mass linguistic data, the recall rate reached 79.67%, precision rate reached 77.72%, F - measure reached 78.68%.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131317569","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Product replacement gives a simple approach for code construction. This paper investigates the use of replacement product graphs for the recursive construction of QC cycle LDPC codes. It is proved that the QC cycle LDPC codes constructed by our approach are of girth 6. Simulation results show that QC cycle LDPC codes constructed by the replacement product perform well over the AWGN channel.
{"title":"Recursive construction of quasi-cyclic cycle LDPC codes based on replacement products","authors":"Jiayi Huang, Xueqin Jiang, Xiaodong Zhang, Huiming Wang, Wei Duan","doi":"10.1109/CITS.2016.7546443","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546443","url":null,"abstract":"Product replacement gives a simple approach for code construction. This paper investigates the use of replacement product graphs for the recursive construction of QC cycle LDPC codes. It is proved that the QC cycle LDPC codes constructed by our approach are of girth 6. Simulation results show that QC cycle LDPC codes constructed by the replacement product perform well over the AWGN channel.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114454387","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-08-16DOI: 10.1109/CITS.2016.7546403
Xuezhi Zhang, Yuan Yuan, Xiaoqiang Lu
Object tracking is a challenging topic in the field of computer vision since its performance is easily disturbed by occlusion, illumination change, background clutter, scale variation, etc. In this paper, we introduce a robust tracking algorithm that fuses information from both visible images and infrared (IR) images. The proposed tracking algorithm not only incorporates convolutional feature maps from the visible channel, but also employs a scale pyramid representation from IR channel. We estimate the target location by fusing multilayer convolutional feature maps, and predict the target scale from a scale pyramid. The pipeline of the proposed method is as follows. First, the hierarchical convolutional feature maps are obtained from visible images using VGG-Nets. Then, the accurate target location is predicted by the maximum response of correlation filters with the visible image feature maps. Finally, we obtain the precise object scale with a scale pyramid from infrared images where the difference between the target and the background is clear. In order to verify the performance of the proposed method, we capture six video sequences under different conditions. These sequences contain both visible channel and IR channel. Ten state-of-the-art tracking algorithms are compared with our method, and the experimental results show the effectiveness of the proposed tracker.
{"title":"Deep object tracking with multi-modal data","authors":"Xuezhi Zhang, Yuan Yuan, Xiaoqiang Lu","doi":"10.1109/CITS.2016.7546403","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546403","url":null,"abstract":"Object tracking is a challenging topic in the field of computer vision since its performance is easily disturbed by occlusion, illumination change, background clutter, scale variation, etc. In this paper, we introduce a robust tracking algorithm that fuses information from both visible images and infrared (IR) images. The proposed tracking algorithm not only incorporates convolutional feature maps from the visible channel, but also employs a scale pyramid representation from IR channel. We estimate the target location by fusing multilayer convolutional feature maps, and predict the target scale from a scale pyramid. The pipeline of the proposed method is as follows. First, the hierarchical convolutional feature maps are obtained from visible images using VGG-Nets. Then, the accurate target location is predicted by the maximum response of correlation filters with the visible image feature maps. Finally, we obtain the precise object scale with a scale pyramid from infrared images where the difference between the target and the background is clear. In order to verify the performance of the proposed method, we capture six video sequences under different conditions. These sequences contain both visible channel and IR channel. Ten state-of-the-art tracking algorithms are compared with our method, and the experimental results show the effectiveness of the proposed tracker.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120986675","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-07-06DOI: 10.1109/CITS.2016.7546442
Yuwen Cao, Xueqin Jiang, Huiming Wang, Enjian Bai, Jun Li
The three-phase process of achieving secret sharing over a wiretap channel are, respectively, advantage distillation, information reconciliation, and privacy amplification. In this paper, we first generalize the extended orthogonal space time block codes (EO-STBCs). Then, based on the generalized EO-STBCs (GEO-STBCs) and the feedback bits from the legitimate receiver, we propose a new advantage distillation scheme for multiple-input multiple-output (MIMO) wiretap channels. Simulation results show that the bit error rate (BER) performance gain up to 4.2 dB is obtained by the legitimate receiver over the eavesdropper at the BER of 10-5. Moreover, it is shown that the feedback performance gain of the proposed advantage distillation scheme grows exponentially with signal-to-noise ratio (SNR).
{"title":"Advantage distillation over MIMO wiretap channels based on generalized extended orthogonal space-time block codes","authors":"Yuwen Cao, Xueqin Jiang, Huiming Wang, Enjian Bai, Jun Li","doi":"10.1109/CITS.2016.7546442","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546442","url":null,"abstract":"The three-phase process of achieving secret sharing over a wiretap channel are, respectively, advantage distillation, information reconciliation, and privacy amplification. In this paper, we first generalize the extended orthogonal space time block codes (EO-STBCs). Then, based on the generalized EO-STBCs (GEO-STBCs) and the feedback bits from the legitimate receiver, we propose a new advantage distillation scheme for multiple-input multiple-output (MIMO) wiretap channels. Simulation results show that the bit error rate (BER) performance gain up to 4.2 dB is obtained by the legitimate receiver over the eavesdropper at the BER of 10-5. Moreover, it is shown that the feedback performance gain of the proposed advantage distillation scheme grows exponentially with signal-to-noise ratio (SNR).","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127480282","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-07-06DOI: 10.1109/CITS.2016.7546410
Tingting Lv, H. Zhang, Xue-rong Cui, Jing Cui, T. Gulliver
The ranging and positioning accuracy of an impulse radio (IR) 60 GHz system is investigated. The corresponding Cramér-Rao lower bound (CRLB) over an additive white Gaussian noise (AWGN) channel is analyzed. The signal parameters which may affect the accuracy are examined. Performance results over AWGN and indoor residential channels are presented. In particular, the indoor residential channel models recommended by the IEEE 802.15.3c task group are employed. The theoretical and simulation results obtained show that the IR 60 GHz system can achieve millimeter accuracy in residential line-of-sight (LOS) environments even with a low signal-to-noise ratio (SNR) of 5 dB. For a residential non-line-of-sight (NLOS) environment with the same SNR, centimeter accuracy can be obtained.
{"title":"Accuracy analysis of an impulse radio 60 GHz positioning system","authors":"Tingting Lv, H. Zhang, Xue-rong Cui, Jing Cui, T. Gulliver","doi":"10.1109/CITS.2016.7546410","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546410","url":null,"abstract":"The ranging and positioning accuracy of an impulse radio (IR) 60 GHz system is investigated. The corresponding Cramér-Rao lower bound (CRLB) over an additive white Gaussian noise (AWGN) channel is analyzed. The signal parameters which may affect the accuracy are examined. Performance results over AWGN and indoor residential channels are presented. In particular, the indoor residential channel models recommended by the IEEE 802.15.3c task group are employed. The theoretical and simulation results obtained show that the IR 60 GHz system can achieve millimeter accuracy in residential line-of-sight (LOS) environments even with a low signal-to-noise ratio (SNR) of 5 dB. For a residential non-line-of-sight (NLOS) environment with the same SNR, centimeter accuracy can be obtained.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114775905","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-07-06DOI: 10.1109/CITS.2016.7546416
W. Liu, Chengrong Wu, Haolin Jin, Shiyong Zhang
Web security is an important part of information security. This paper proposes a new web anti-attack method based on URL randomization. Adding a random field in the URL leads that the attackers cannot get desired URLs through sniffing and scanning the static URLs. In the section of theoretical analysis, we analyze the probability that the attackers construct the correct URLs. Finally, we implement a prototype of the method we come up with and use it to measure the overhead the method will bring. Experiment results shows that the overhead the method brings is very little and this method has the significance of practical application.
{"title":"Design and implementation of a new web anti-attack method based on URL randomization","authors":"W. Liu, Chengrong Wu, Haolin Jin, Shiyong Zhang","doi":"10.1109/CITS.2016.7546416","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546416","url":null,"abstract":"Web security is an important part of information security. This paper proposes a new web anti-attack method based on URL randomization. Adding a random field in the URL leads that the attackers cannot get desired URLs through sniffing and scanning the static URLs. In the section of theoretical analysis, we analyze the probability that the attackers construct the correct URLs. Finally, we implement a prototype of the method we come up with and use it to measure the overhead the method will bring. Experiment results shows that the overhead the method brings is very little and this method has the significance of practical application.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124319612","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：