Pub Date : 2017-04-01DOI: 10.1109/ICNISC.2017.00047
Gang Yang, Chao Feng, Xing Zhang, Chaojing Tang
In-memory fuzzing is a research hotspot in the field of vulnerability mining in recent years, due to the high efficiency and lightweight. However its incompleteness, poor robustness, and low automation, make in-memory fuzzing difficult to be applied in the actual vulnerability discovering. In this paper, we combine the taint analysis with in-memory fuzzing, to solve the above problems. And the experiments show that our method can improve the level of automation and robustness, reduce incompleteness effectively.
{"title":"Automatic In-Memory Fuzzing with the Assistance of Taint Flow Analysis","authors":"Gang Yang, Chao Feng, Xing Zhang, Chaojing Tang","doi":"10.1109/ICNISC.2017.00047","DOIUrl":"https://doi.org/10.1109/ICNISC.2017.00047","url":null,"abstract":"In-memory fuzzing is a research hotspot in the field of vulnerability mining in recent years, due to the high efficiency and lightweight. However its incompleteness, poor robustness, and low automation, make in-memory fuzzing difficult to be applied in the actual vulnerability discovering. In this paper, we combine the taint analysis with in-memory fuzzing, to solve the above problems. And the experiments show that our method can improve the level of automation and robustness, reduce incompleteness effectively.","PeriodicalId":429511,"journal":{"name":"2017 International Conference on Network and Information Systems for Computers (ICNISC)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127004276","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 : 2017-04-01DOI: 10.1109/ICNISC.2017.00043
Yunpeng Zhang, Beibei Zhang, Zhiwen Wang
this paper proposes a data flow test model for attribute-based access control (ABAC) systems. First, the data flows of attribute values are described by formal forms and then the optimized histogram technique is used to analyze the range and the trend of the data flows. Then, an improved test coverage standard which is suitable for ABAC is used to analyze the error types and the causes of the test results. Finally, in order to verify the model's coverage rate and the effectiveness of generated test cases, the attribute mutation technique is used to compare the proposed method in this paper with related random algorithms and generation algorithms of simple test cases. The results of a large number of experiments show that the model is superior to the related random algorithms and simple test cases generation algorithms in terms of coverage rate and the effectiveness of test cases.
{"title":"Research of a Data Flow Test Method for Attribute-Based Access Control Systems","authors":"Yunpeng Zhang, Beibei Zhang, Zhiwen Wang","doi":"10.1109/ICNISC.2017.00043","DOIUrl":"https://doi.org/10.1109/ICNISC.2017.00043","url":null,"abstract":"this paper proposes a data flow test model for attribute-based access control (ABAC) systems. First, the data flows of attribute values are described by formal forms and then the optimized histogram technique is used to analyze the range and the trend of the data flows. Then, an improved test coverage standard which is suitable for ABAC is used to analyze the error types and the causes of the test results. Finally, in order to verify the model's coverage rate and the effectiveness of generated test cases, the attribute mutation technique is used to compare the proposed method in this paper with related random algorithms and generation algorithms of simple test cases. The results of a large number of experiments show that the model is superior to the related random algorithms and simple test cases generation algorithms in terms of coverage rate and the effectiveness of test cases.","PeriodicalId":429511,"journal":{"name":"2017 International Conference on Network and Information Systems for Computers (ICNISC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129749575","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 : 2017-04-01DOI: 10.1109/ICNISC.2017.00045
Lukai Xu, Xianqiao Chen
To avoid the situation that the Camshift algorithm which based on color characteristic will lose the target vehicle when other similar-color vehicles appear in the same video, we propose a method that can apply to multi-video tracking. Firstly, set Bhattacharyya distance at 0.8 as the standard of a successful tracking. Then in continuous frame image, use the Kalman filtering to estimate the next position of the target in order to narrow the tracking range and avoid losing target. In the case of discontinuous frame image, we suggest that use the color characteristic of the camshaft to track at first. If tracking fails due to color interference, then use the SIFT to track targets. Based on the above, we can achieve multi-video tracking. The experiment shows the method has the accuracy rate of 94.8% in continuous frame image and 91.4% in discontinuous frame image under a poor environment excluding a poor visibility.
{"title":"A Multi-Video Vehicle Tracking Method Based on Camshift with Color Interference","authors":"Lukai Xu, Xianqiao Chen","doi":"10.1109/ICNISC.2017.00045","DOIUrl":"https://doi.org/10.1109/ICNISC.2017.00045","url":null,"abstract":"To avoid the situation that the Camshift algorithm which based on color characteristic will lose the target vehicle when other similar-color vehicles appear in the same video, we propose a method that can apply to multi-video tracking. Firstly, set Bhattacharyya distance at 0.8 as the standard of a successful tracking. Then in continuous frame image, use the Kalman filtering to estimate the next position of the target in order to narrow the tracking range and avoid losing target. In the case of discontinuous frame image, we suggest that use the color characteristic of the camshaft to track at first. If tracking fails due to color interference, then use the SIFT to track targets. Based on the above, we can achieve multi-video tracking. The experiment shows the method has the accuracy rate of 94.8% in continuous frame image and 91.4% in discontinuous frame image under a poor environment excluding a poor visibility.","PeriodicalId":429511,"journal":{"name":"2017 International Conference on Network and Information Systems for Computers (ICNISC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127868233","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 : 2017-04-01DOI: 10.1109/ICNISC.2017.00056
Chang Su, Xiaotao Jia, Xianzhong Xie, Ning Li
Community detection is an effective tool for mining hidden information in social networks. Label propagation is a widely used and effective community detection algorithm. A lot of work has been done based on label propagation for standalone machine computing. While in location based social networks (LBSN), paralleled label propagation is needed to deal with large scale datasets. In this paper, we propose paralleled label propagation using MapReduce in Hadoop which improves the efficiency of community detection in the LBSN. We apply community detection to explore the friendship circles among the users and within each friendship circle recommend POI for each user. In the LBSN, we establish the user-location network and define the user-location score to calculate users' similarity. Comparing to direct recommendation, our method improves the accuracy of the recommendation and recall rate, the recommended effect has been improved.
{"title":"Community Detection and Location Recommendation Based on LBSN","authors":"Chang Su, Xiaotao Jia, Xianzhong Xie, Ning Li","doi":"10.1109/ICNISC.2017.00056","DOIUrl":"https://doi.org/10.1109/ICNISC.2017.00056","url":null,"abstract":"Community detection is an effective tool for mining hidden information in social networks. Label propagation is a widely used and effective community detection algorithm. A lot of work has been done based on label propagation for standalone machine computing. While in location based social networks (LBSN), paralleled label propagation is needed to deal with large scale datasets. In this paper, we propose paralleled label propagation using MapReduce in Hadoop which improves the efficiency of community detection in the LBSN. We apply community detection to explore the friendship circles among the users and within each friendship circle recommend POI for each user. In the LBSN, we establish the user-location network and define the user-location score to calculate users' similarity. Comparing to direct recommendation, our method improves the accuracy of the recommendation and recall rate, the recommended effect has been improved.","PeriodicalId":429511,"journal":{"name":"2017 International Conference on Network and Information Systems for Computers (ICNISC)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116310163","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 : 2017-04-01DOI: 10.1109/ICNISC.2017.00013
Q. Tang, Jian Wang
In this paper, we propose an improved method of DV-Hop localization algorithm in wireless sensor networks based on the time difference of arrival (TDOA) quantization assisted. The number of hops of the nodes in the DV-Hop localization algorithm is quantified by combining with the low error characteristic of TDOA when measuring close distance. And the average per hop distance of each anchor node is corrected by means of using the hop weighted and limiting the propagation of hops to make it more close to the true value. Through simulations, we compare the performance of improved algorithm with other localization schemes and show that improved algorithm has more efficient and stable performance.
{"title":"An Improved DV-Hop Localization Algorithm for Wireless Sensor Network Based on TDOA Quantization","authors":"Q. Tang, Jian Wang","doi":"10.1109/ICNISC.2017.00013","DOIUrl":"https://doi.org/10.1109/ICNISC.2017.00013","url":null,"abstract":"In this paper, we propose an improved method of DV-Hop localization algorithm in wireless sensor networks based on the time difference of arrival (TDOA) quantization assisted. The number of hops of the nodes in the DV-Hop localization algorithm is quantified by combining with the low error characteristic of TDOA when measuring close distance. And the average per hop distance of each anchor node is corrected by means of using the hop weighted and limiting the propagation of hops to make it more close to the true value. Through simulations, we compare the performance of improved algorithm with other localization schemes and show that improved algorithm has more efficient and stable performance.","PeriodicalId":429511,"journal":{"name":"2017 International Conference on Network and Information Systems for Computers (ICNISC)","volume":"580 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115974535","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 : 2017-04-01DOI: 10.1109/ICNISC.2017.00011
Decheng Gan, S. He, Zhijiang Dai, Tian Qi, Decheng Gan
A miniaturized multi-layered wideband bandpass filter (BPF) based on the low-temperature-cofired ceramic (LTCC) technology is proposed in this paper. The proposed filter consists of a T-shaped short stub and a pair parallel transmission lines. Owing to the multi-path effect, multiple transmission zeros can be realized near the passband for enhanced selectivity. A wide-band filter from 3.59 GHz to 8.21 GHz is designed, fabricated and measured. The measured results show that the center frequency is 6 GHz with a fractional bandwidth (FBW) of 74.8%. Three transmission zeros were introduced near the passband, located at 2.1 GHz with 36.25 dB rejection, 9.25 GHz with 27.02 dB rejection, 10.56 GHz with 28.58 dB rejection.
{"title":"Compact Multi-Layered Wideband Bandpass Filter with Multiple Transmission Zeros","authors":"Decheng Gan, S. He, Zhijiang Dai, Tian Qi, Decheng Gan","doi":"10.1109/ICNISC.2017.00011","DOIUrl":"https://doi.org/10.1109/ICNISC.2017.00011","url":null,"abstract":"A miniaturized multi-layered wideband bandpass filter (BPF) based on the low-temperature-cofired ceramic (LTCC) technology is proposed in this paper. The proposed filter consists of a T-shaped short stub and a pair parallel transmission lines. Owing to the multi-path effect, multiple transmission zeros can be realized near the passband for enhanced selectivity. A wide-band filter from 3.59 GHz to 8.21 GHz is designed, fabricated and measured. The measured results show that the center frequency is 6 GHz with a fractional bandwidth (FBW) of 74.8%. Three transmission zeros were introduced near the passband, located at 2.1 GHz with 36.25 dB rejection, 9.25 GHz with 27.02 dB rejection, 10.56 GHz with 28.58 dB rejection.","PeriodicalId":429511,"journal":{"name":"2017 International Conference on Network and Information Systems for Computers (ICNISC)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128243051","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 : 2017-04-01DOI: 10.1109/ICNISC.2017.00037
Liang-Liang Shi, Jian Chen
In order to solve the difficult issues in Command Information System security situation assessment such as having wide sources of training samples, the time and space complexity is high and the method solving the problems are strong subjective and so on, an approach based on twin support vector machines is proposed. Firstly, the main factors which affect the command information system security are analyzed. Then based on the twin support vector machines, the assessment model of command information system security situation is established. Based on this, the TWSVM is used for sample data learning and parameter estimation, then the global optimum solution is get. Simulation results show that compared with traditional assessment methods, the proposed method can improve the accuracy of the assessment system, reflect the security situation of the current system quickly and efficiently, and has strong robustness.
{"title":"Assessment Model of Command Information System Security Situation Based on Twin Support Vector Machines","authors":"Liang-Liang Shi, Jian Chen","doi":"10.1109/ICNISC.2017.00037","DOIUrl":"https://doi.org/10.1109/ICNISC.2017.00037","url":null,"abstract":"In order to solve the difficult issues in Command Information System security situation assessment such as having wide sources of training samples, the time and space complexity is high and the method solving the problems are strong subjective and so on, an approach based on twin support vector machines is proposed. Firstly, the main factors which affect the command information system security are analyzed. Then based on the twin support vector machines, the assessment model of command information system security situation is established. Based on this, the TWSVM is used for sample data learning and parameter estimation, then the global optimum solution is get. Simulation results show that compared with traditional assessment methods, the proposed method can improve the accuracy of the assessment system, reflect the security situation of the current system quickly and efficiently, and has strong robustness.","PeriodicalId":429511,"journal":{"name":"2017 International Conference on Network and Information Systems for Computers (ICNISC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128243263","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 : 2017-04-01DOI: 10.1109/ICNISC.2017.00024
Hanwu Wang, Beibei Yang
In this paper, we consider a buffer-aided two-way relay networks with two end nodes and N relay nodes. With the objective of maximizing throughput and network life time, a new residual energy based relay selection and joint scheduling scheme is proposed. In the proposed scheme, we jointly consider the channel state information (CSI), buffering capacity and residual energy status of the relay nodes. The relay selection metric based on the CSI can guarantee to obtain better channel gain. And that considering both buffer occupancy information and residual energy of relay nodes can ensure the quality of the service (QoS) of transmission. Next we make a comparison with the existing scheduling schemes in two-way relay networks. And simulation results illustrate that the proposed scheme in this paper can achieve larger throughput gain than the existing scheduling schemes.
{"title":"A New Residual Energy Based Relay Selection in Two-Way Buffer-Aided Relay Networks","authors":"Hanwu Wang, Beibei Yang","doi":"10.1109/ICNISC.2017.00024","DOIUrl":"https://doi.org/10.1109/ICNISC.2017.00024","url":null,"abstract":"In this paper, we consider a buffer-aided two-way relay networks with two end nodes and N relay nodes. With the objective of maximizing throughput and network life time, a new residual energy based relay selection and joint scheduling scheme is proposed. In the proposed scheme, we jointly consider the channel state information (CSI), buffering capacity and residual energy status of the relay nodes. The relay selection metric based on the CSI can guarantee to obtain better channel gain. And that considering both buffer occupancy information and residual energy of relay nodes can ensure the quality of the service (QoS) of transmission. Next we make a comparison with the existing scheduling schemes in two-way relay networks. And simulation results illustrate that the proposed scheme in this paper can achieve larger throughput gain than the existing scheduling schemes.","PeriodicalId":429511,"journal":{"name":"2017 International Conference on Network and Information Systems for Computers (ICNISC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123156417","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 : 2017-04-01DOI: 10.1109/ICNISC.2017.00020
Zhi-hui Ye, Ziwei Zhang
Hybrid OFDM modulation signals are analysis for spectrum correlation in this paper, and are apply to cognitive cooperative networks. Four kinds of channel states of spectrum idle, master signals transmitting, secondary signals transmitting, and hybrid signals transmitting can be distinguished agilely, by using distinct cyclic spectrum features, and embedding exclusive cyclostationary identification artificially, which help to strengthen spectrum characteristic of signal, so as to access and withdraw fast and reliable. Further, by signing different cognitive networks with the locations of hybrid modulation signals, cognitive nodes can identification signals from different networks. Cyclostationary identification and hybrid modulation location are combined to endow the signal the capability of agilely networking. Simulations show that, the proposed model can achieve agilely network building with the improving spectrum efficiency.
{"title":"Research on Fast Networking Technologies Based on Hybrid OFDM Modulation for Cognitive Radio Networks","authors":"Zhi-hui Ye, Ziwei Zhang","doi":"10.1109/ICNISC.2017.00020","DOIUrl":"https://doi.org/10.1109/ICNISC.2017.00020","url":null,"abstract":"Hybrid OFDM modulation signals are analysis for spectrum correlation in this paper, and are apply to cognitive cooperative networks. Four kinds of channel states of spectrum idle, master signals transmitting, secondary signals transmitting, and hybrid signals transmitting can be distinguished agilely, by using distinct cyclic spectrum features, and embedding exclusive cyclostationary identification artificially, which help to strengthen spectrum characteristic of signal, so as to access and withdraw fast and reliable. Further, by signing different cognitive networks with the locations of hybrid modulation signals, cognitive nodes can identification signals from different networks. Cyclostationary identification and hybrid modulation location are combined to endow the signal the capability of agilely networking. Simulations show that, the proposed model can achieve agilely network building with the improving spectrum efficiency.","PeriodicalId":429511,"journal":{"name":"2017 International Conference on Network and Information Systems for Computers (ICNISC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128377674","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 : 2017-04-01DOI: 10.1109/ICNISC.2017.00028
Jing-long Yang, Dongliang He
In recent years, the unexpected factors leading to frequent accidents which causing heavy casualties and economic losses. Therefore, how to make use of computer technology to simulate the evacuation process has an important practical significance. In this paper, we propose a new model for evacuation. Based on the traditional particle swarm algorithm, we revise the inertia weight of the algorithm to balance the global and local search ability according to the aggregation degree of the population. Taking the interaction between individual and others, individual and obstacles or wall into account, we introduce the social force model to simulate this phenomenon and use it as a collision resolution strategy. Then, we combine the improved PSO-based model with modified Social Force Model to form the velocity updating rule. In the end, through simulation and analyzation, we testify the modified model is very effective.
{"title":"An Evacuation Model Based on the Improved Particle Swarm Optimization","authors":"Jing-long Yang, Dongliang He","doi":"10.1109/ICNISC.2017.00028","DOIUrl":"https://doi.org/10.1109/ICNISC.2017.00028","url":null,"abstract":"In recent years, the unexpected factors leading to frequent accidents which causing heavy casualties and economic losses. Therefore, how to make use of computer technology to simulate the evacuation process has an important practical significance. In this paper, we propose a new model for evacuation. Based on the traditional particle swarm algorithm, we revise the inertia weight of the algorithm to balance the global and local search ability according to the aggregation degree of the population. Taking the interaction between individual and others, individual and obstacles or wall into account, we introduce the social force model to simulate this phenomenon and use it as a collision resolution strategy. Then, we combine the improved PSO-based model with modified Social Force Model to form the velocity updating rule. In the end, through simulation and analyzation, we testify the modified model is very effective.","PeriodicalId":429511,"journal":{"name":"2017 International Conference on Network and Information Systems for Computers (ICNISC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121790430","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
扫码关注我们
求助内容：
应助结果提醒方式：