It is very important to study computer network intrusion effect evaluation on studying security of computer network information system and harmfulness of computer network intrusion behavior. This is a concise overview paper about main research results and development foreground of computer network intrusion effect evaluation. In this paper we focus on the research results of the follow aspects: formal analysis of computer network intrusion behavior, taxonomy and analysis of security vulnerability and intrusion behavior, modeling and simulation of computer network intrusion behavior, evaluation model and method of computer network intrusion effect. In this paper we have given a full analysis of the main research work on computer network intrusion effect evaluation. At the end of this paper we summarize computer network intrusion effect evaluation and open up prospects for this area.
{"title":"Study on Computer Network Intrusion Effect Evaluation","authors":"Jing-ju Liu, Yong-jie Wang","doi":"10.1109/IMCCC.2013.80","DOIUrl":"https://doi.org/10.1109/IMCCC.2013.80","url":null,"abstract":"It is very important to study computer network intrusion effect evaluation on studying security of computer network information system and harmfulness of computer network intrusion behavior. This is a concise overview paper about main research results and development foreground of computer network intrusion effect evaluation. In this paper we focus on the research results of the follow aspects: formal analysis of computer network intrusion behavior, taxonomy and analysis of security vulnerability and intrusion behavior, modeling and simulation of computer network intrusion behavior, evaluation model and method of computer network intrusion effect. In this paper we have given a full analysis of the main research work on computer network intrusion effect evaluation. At the end of this paper we summarize computer network intrusion effect evaluation and open up prospects for this area.","PeriodicalId":360796,"journal":{"name":"2013 Third International Conference on Instrumentation, Measurement, Computer, Communication and Control","volume":"517 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133340429","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}
According to the problem that liquid turbidity detection is vulnerable to the noise, a novel liquid turbidity detection method based on Bidimensional Empirical Mode Decomposition (BEMD) and Robert operator is proposed. The key part of method is the BEMD algorithm, with which, liquid images can be decomposed to several Intrinsic Mode Functions (IMFs), then we can use Robert operator to detect the edge of each IMF to reconstruct the image edges selectively for highlighting edge details of the liquid and impurity. Experimental results show that the method presented can reduce the influence of random noise on the turbidity detection effectively, and improve the accuracy of turbidity detection.
{"title":"Liquid Opacity Detection Method Based on Bidimensional Empirical Mode Decomposition","authors":"Guo Qiang, Song Wen-ming","doi":"10.1109/IMCCC.2013.277","DOIUrl":"https://doi.org/10.1109/IMCCC.2013.277","url":null,"abstract":"According to the problem that liquid turbidity detection is vulnerable to the noise, a novel liquid turbidity detection method based on Bidimensional Empirical Mode Decomposition (BEMD) and Robert operator is proposed. The key part of method is the BEMD algorithm, with which, liquid images can be decomposed to several Intrinsic Mode Functions (IMFs), then we can use Robert operator to detect the edge of each IMF to reconstruct the image edges selectively for highlighting edge details of the liquid and impurity. Experimental results show that the method presented can reduce the influence of random noise on the turbidity detection effectively, and improve the accuracy of turbidity detection.","PeriodicalId":360796,"journal":{"name":"2013 Third International Conference on Instrumentation, Measurement, Computer, Communication and Control","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132592441","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}
Ying Yuan, Cuirong Wang, Cong Wang, Chongyang Zhang, N. Zhu
Network virtualization allows multiple virtual networks to coexist on a shared physical substrate infrastructure. As network virtualization becomes popular, the problem of efficiently mapping a virtual network while guaranteeing its survivability in the event of failures becomes increasingly important. In this paper, the reliability problem of virtual network is solved based on a node and link redundant backup strategy. We model the virtual network mapping problem as an integer linear programming and present a discrete particle swarm optimization based algorithm to solve the problem. Experimental results show that the proposed algorithm has higher recovery success ratio and can reduce backup bandwidth simultaneously.
{"title":"Fault Tolerant Virtual Network Embedding Algorithm Based on Redundant Backup Resource","authors":"Ying Yuan, Cuirong Wang, Cong Wang, Chongyang Zhang, N. Zhu","doi":"10.1109/IMCCC.2013.81","DOIUrl":"https://doi.org/10.1109/IMCCC.2013.81","url":null,"abstract":"Network virtualization allows multiple virtual networks to coexist on a shared physical substrate infrastructure. As network virtualization becomes popular, the problem of efficiently mapping a virtual network while guaranteeing its survivability in the event of failures becomes increasingly important. In this paper, the reliability problem of virtual network is solved based on a node and link redundant backup strategy. We model the virtual network mapping problem as an integer linear programming and present a discrete particle swarm optimization based algorithm to solve the problem. Experimental results show that the proposed algorithm has higher recovery success ratio and can reduce backup bandwidth simultaneously.","PeriodicalId":360796,"journal":{"name":"2013 Third International Conference on Instrumentation, Measurement, Computer, Communication and Control","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131277026","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}
Network services face various security challenges such as targeted attacks exploiting security vulnerabilities. Fuzz testing plays an important role in security testing of network service. However, current fuzzing approaches focus on protocol syntax and packet structure, more than multi-phase behavioral interactions between client and server of network service. This paper presents a model-based behavioral fuzzing approach to discover vulnerabilities of network services, which supports state-aware and multi-phase fuzz testing. Based on the model-based fuzzing framework, a finite state machine model EXT-NSFSM is proposed to manipulate the fuzzing process and guarantee the validation of fuzz test cases. The approach is implemented and then is experimented on several network services of DBMS and FTP. The test result has proved effectiveness of this approach.
{"title":"A Model-Based Behavioral Fuzzing Approach for Network Service","authors":"Jiajie Wang, Tao Guo, Puhan Zhang, Qixue Xiao","doi":"10.1109/IMCCC.2013.250","DOIUrl":"https://doi.org/10.1109/IMCCC.2013.250","url":null,"abstract":"Network services face various security challenges such as targeted attacks exploiting security vulnerabilities. Fuzz testing plays an important role in security testing of network service. However, current fuzzing approaches focus on protocol syntax and packet structure, more than multi-phase behavioral interactions between client and server of network service. This paper presents a model-based behavioral fuzzing approach to discover vulnerabilities of network services, which supports state-aware and multi-phase fuzz testing. Based on the model-based fuzzing framework, a finite state machine model EXT-NSFSM is proposed to manipulate the fuzzing process and guarantee the validation of fuzz test cases. The approach is implemented and then is experimented on several network services of DBMS and FTP. The test result has proved effectiveness of this approach.","PeriodicalId":360796,"journal":{"name":"2013 Third International Conference on Instrumentation, Measurement, Computer, Communication and Control","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115795513","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}
Building integrated photo-voltaic systems often operate under partially shaded conditions. Current versus voltage characteristics and power versus voltage characteristics of PV arrays are characterized by multiple steps and peaks under partially shaded conditions. Most of existing strategies always fail to track the real maximum power. On the basis of improving the conventional MPPT method perturbation and observation (P&O) and analysis of characteristic curves under uniform and non uniform solar irradiance, this paper proposes a novel algorithm combining the improved P&O method and scanning method to track the global power peak under partially shaded conditions for building integrated photovoltaic systems (BIPV). This algorithm has high efficiency and avoids oscillation. It has all the advantages of the P&O method, also may not fail into the global maximum power point. The control algorithm is verified to be effective by simulations.
{"title":"A New Maximum Power Point Tracking Scheme for Building Integrated Photovoltaic Systems","authors":"Yajun Rong, Le Chen, Mingyong Cui","doi":"10.1109/IMCCC.2013.139","DOIUrl":"https://doi.org/10.1109/IMCCC.2013.139","url":null,"abstract":"Building integrated photo-voltaic systems often operate under partially shaded conditions. Current versus voltage characteristics and power versus voltage characteristics of PV arrays are characterized by multiple steps and peaks under partially shaded conditions. Most of existing strategies always fail to track the real maximum power. On the basis of improving the conventional MPPT method perturbation and observation (P&O) and analysis of characteristic curves under uniform and non uniform solar irradiance, this paper proposes a novel algorithm combining the improved P&O method and scanning method to track the global power peak under partially shaded conditions for building integrated photovoltaic systems (BIPV). This algorithm has high efficiency and avoids oscillation. It has all the advantages of the P&O method, also may not fail into the global maximum power point. The control algorithm is verified to be effective by simulations.","PeriodicalId":360796,"journal":{"name":"2013 Third International Conference on Instrumentation, Measurement, Computer, Communication and Control","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124114879","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}
In recent years, with the application of GPS, RFID, sensor technology, rapid development and popularization of 3G network technology and IT technology, car networking applications in the transportation industry has been more and more deeply. Along with the network popularization, make it become an important part of transportation industry of the Internet of things. The network technology into the bus industry, combined with intelligent scheduling and can bus technology, make the public transit service implementation more automation, intelligent. This paper presents the cloud platform architecture of intelligent public transportation system. Intelligent scheduling algorithm based on the collected information, vehicle location, vehicle condition information and other business data through the acquisition of the Intelligent Car Networking system, automatic generation of bus service data through the information system, and based on the data details automatically generated summary report. At the same time, also can be combined with GIS technology and create a smart and efficient platform for public enterprises.
{"title":"The Intelligent Platform of Bus Industry Based on Car Networking","authors":"Xingming Hou","doi":"10.1109/IMCCC.2013.90","DOIUrl":"https://doi.org/10.1109/IMCCC.2013.90","url":null,"abstract":"In recent years, with the application of GPS, RFID, sensor technology, rapid development and popularization of 3G network technology and IT technology, car networking applications in the transportation industry has been more and more deeply. Along with the network popularization, make it become an important part of transportation industry of the Internet of things. The network technology into the bus industry, combined with intelligent scheduling and can bus technology, make the public transit service implementation more automation, intelligent. This paper presents the cloud platform architecture of intelligent public transportation system. Intelligent scheduling algorithm based on the collected information, vehicle location, vehicle condition information and other business data through the acquisition of the Intelligent Car Networking system, automatic generation of bus service data through the information system, and based on the data details automatically generated summary report. At the same time, also can be combined with GIS technology and create a smart and efficient platform for public enterprises.","PeriodicalId":360796,"journal":{"name":"2013 Third International Conference on Instrumentation, Measurement, Computer, Communication and Control","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124320922","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}
SMT solver which is an automated program analysis technique is increasingly used by Vulnerability discovering platforms, especially in the integer security problems checking. An integer vulnerability discovering platform is mostly decided by the SMT solver. We have analyzed integer security problems and several SMT solvers, such as Boolector, Z3, STP and so on. We evaluated the ability of the SMT solvers in integer overflows checking from the view of vulnerability discovering. We also developed a set of APIs to check the integer overflows based on STP.
{"title":"SMT Solvers for Integer Overflows","authors":"Qixue Xiao, Yu Chen, Hui Huang, Lan-lan Qi","doi":"10.1109/IMCCC.2013.30","DOIUrl":"https://doi.org/10.1109/IMCCC.2013.30","url":null,"abstract":"SMT solver which is an automated program analysis technique is increasingly used by Vulnerability discovering platforms, especially in the integer security problems checking. An integer vulnerability discovering platform is mostly decided by the SMT solver. We have analyzed integer security problems and several SMT solvers, such as Boolector, Z3, STP and so on. We evaluated the ability of the SMT solvers in integer overflows checking from the view of vulnerability discovering. We also developed a set of APIs to check the integer overflows based on STP.","PeriodicalId":360796,"journal":{"name":"2013 Third International Conference on Instrumentation, Measurement, Computer, Communication and Control","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114772962","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}
Zhao Yan, Xu Gui-li, Tian Yu-peng, Gu Rui-peng, Wang Biao, Li Kai-yu
Image matching based on contour is an important issue in computer vision, navigation and pattern recognition. The image matching methods like curvature-based methods and corner-based methods have poor robustness to the contour's noise and distortion, and some matching methods are applied only to closed contours. A novel contour representation and matching algorithm, based on local curvature scale, is proposed in this paper. First, build each point's c-scale segment and calculate the curvature of contour points. Then, the invariant characteristic curve is established based on curvature integral, which is invariant to RST (rotation, scale and translation). Finally, the matching points of contours are captured by measuring the similarity of invariant characteristic curves. Experimental results show that this method can achieve better performance than previous methods. Also it fits for the matching between two closed contours, two open curves and the matching between an open contour and a part of closed contour. The proposed method reduces the impact of noise and scale variation effectively, and it has better robustness to rotation, scale and translation of contour.
{"title":"Contour Matching Based on Local Curvature Scale","authors":"Zhao Yan, Xu Gui-li, Tian Yu-peng, Gu Rui-peng, Wang Biao, Li Kai-yu","doi":"10.1109/IMCCC.2013.376","DOIUrl":"https://doi.org/10.1109/IMCCC.2013.376","url":null,"abstract":"Image matching based on contour is an important issue in computer vision, navigation and pattern recognition. The image matching methods like curvature-based methods and corner-based methods have poor robustness to the contour's noise and distortion, and some matching methods are applied only to closed contours. A novel contour representation and matching algorithm, based on local curvature scale, is proposed in this paper. First, build each point's c-scale segment and calculate the curvature of contour points. Then, the invariant characteristic curve is established based on curvature integral, which is invariant to RST (rotation, scale and translation). Finally, the matching points of contours are captured by measuring the similarity of invariant characteristic curves. Experimental results show that this method can achieve better performance than previous methods. Also it fits for the matching between two closed contours, two open curves and the matching between an open contour and a part of closed contour. The proposed method reduces the impact of noise and scale variation effectively, and it has better robustness to rotation, scale and translation of contour.","PeriodicalId":360796,"journal":{"name":"2013 Third International Conference on Instrumentation, Measurement, Computer, Communication and Control","volume":"294 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116411960","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}
Zhang Xin, Sha Hai, Zhang Yong-hu, Zhang Guo-zhu, Ou Gang
When transmitting BPSK modulated signal, GPS simulator can be used to calibrate hardware delay under a wide variety of conditions by determine the average measured time difference between the one pulse-per-second (1 pps) reference and the bi-phase modulated code transition point. In practice, an AM (Amplitude Modulation) phenomenon rather than ideal BPSK modulation code transition point can be observed. Considering the structure of GPS L1CA signal, this AM phenomenon is analyzed by using Fourier series expansion, and serious impact of signal reflection on AM phenomenon is assessed by simulation.
{"title":"Analysis of AM Phenomenon in GPS Signal","authors":"Zhang Xin, Sha Hai, Zhang Yong-hu, Zhang Guo-zhu, Ou Gang","doi":"10.1109/IMCCC.2013.159","DOIUrl":"https://doi.org/10.1109/IMCCC.2013.159","url":null,"abstract":"When transmitting BPSK modulated signal, GPS simulator can be used to calibrate hardware delay under a wide variety of conditions by determine the average measured time difference between the one pulse-per-second (1 pps) reference and the bi-phase modulated code transition point. In practice, an AM (Amplitude Modulation) phenomenon rather than ideal BPSK modulation code transition point can be observed. Considering the structure of GPS L1CA signal, this AM phenomenon is analyzed by using Fourier series expansion, and serious impact of signal reflection on AM phenomenon is assessed by simulation.","PeriodicalId":360796,"journal":{"name":"2013 Third International Conference on Instrumentation, Measurement, Computer, Communication and Control","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122065968","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}
Conventional quantization-based data hiding algorithms used uniform quantization. This scheme may be easily estimated by averaging on a set of embedded signals. Furthermore, by uniform quantization, the perceptual characteristics of the original signal are not considered and the watermark energy is distributed uniformly within the original signal, which introduces visual distortions in some parts of it. Therefore, we introduce a logarithmic quantization-based data hiding method based on the visual model by using the wavelet transform that takes advantage of the properties of Watson's visual model and logarithmic quantization index modulation (LQIM). Its improved robustness is due to embedding in the high energy blocks of original image and by applying the logarithmic scheme. In the detection scheme, we model the wavelet coefficients of image by the generalized Gaussian distribution (GGD). Under this assumption, the bit error probability of proposed method is analytically calculated. Performance of the proposed method is analyzed and verified by simulation. Results of experiments demonstrate the imperceptibility of the proposed method and its robustness.
{"title":"A Logarithmic Quantization Index Modulation Data Hiding Using the Wavelet Transform","authors":"Jinhua Liu, P. Ye","doi":"10.1109/IMCCC.2013.262","DOIUrl":"https://doi.org/10.1109/IMCCC.2013.262","url":null,"abstract":"Conventional quantization-based data hiding algorithms used uniform quantization. This scheme may be easily estimated by averaging on a set of embedded signals. Furthermore, by uniform quantization, the perceptual characteristics of the original signal are not considered and the watermark energy is distributed uniformly within the original signal, which introduces visual distortions in some parts of it. Therefore, we introduce a logarithmic quantization-based data hiding method based on the visual model by using the wavelet transform that takes advantage of the properties of Watson's visual model and logarithmic quantization index modulation (LQIM). Its improved robustness is due to embedding in the high energy blocks of original image and by applying the logarithmic scheme. In the detection scheme, we model the wavelet coefficients of image by the generalized Gaussian distribution (GGD). Under this assumption, the bit error probability of proposed method is analytically calculated. Performance of the proposed method is analyzed and verified by simulation. Results of experiments demonstrate the imperceptibility of the proposed method and its robustness.","PeriodicalId":360796,"journal":{"name":"2013 Third International Conference on Instrumentation, Measurement, Computer, Communication and Control","volume":"211 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124739053","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}