Pub Date : 2016-09-01DOI: 10.1109/IConAC.2016.7604978
Fahad Mira, Antony Brown, Wei Huang
The field of computer security faces numerous vulnerabilities which cause network resources to become unavailable and violate systems confidentiality and integrity. Malicious software (Malware) has become one of the most serious security threats on the Internet. Malware is a widespread problem and despite the common use of anti-virus software, the diversity of malware is still increasing. A major challenge facing the anti-virus industry is how to effectively detect thousands of malware samples that are received every day. In this paper, a novel approach based on dynamic analysis of malware is proposed whereby Longest Common Subsequence (LCSS) and Longest Common Substring (LCS) algorithms are adopted to accurately detect malware. The empirical results show that the proposed approach performs favorably compared to other related work that use API call sequences.
{"title":"Novel malware detection methods by using LCS and LCSS","authors":"Fahad Mira, Antony Brown, Wei Huang","doi":"10.1109/IConAC.2016.7604978","DOIUrl":"https://doi.org/10.1109/IConAC.2016.7604978","url":null,"abstract":"The field of computer security faces numerous vulnerabilities which cause network resources to become unavailable and violate systems confidentiality and integrity. Malicious software (Malware) has become one of the most serious security threats on the Internet. Malware is a widespread problem and despite the common use of anti-virus software, the diversity of malware is still increasing. A major challenge facing the anti-virus industry is how to effectively detect thousands of malware samples that are received every day. In this paper, a novel approach based on dynamic analysis of malware is proposed whereby Longest Common Subsequence (LCSS) and Longest Common Substring (LCS) algorithms are adopted to accurately detect malware. The empirical results show that the proposed approach performs favorably compared to other related work that use API call sequences.","PeriodicalId":375052,"journal":{"name":"2016 22nd International Conference on Automation and Computing (ICAC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131595176","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-09-01DOI: 10.1109/IConAC.2016.7604918
K. Rajarathinam, J. Gomm, Dingli Yu, Ahmed Saad Abdelhadi
In this paper, a realistic excess oxygen model parameter identification by Standard Genetic Algorithms (SGAs) is proposed and demonstrated. The realistic excess oxygen model is developed by three sub-model; air-fuel ratio conversion model, dynamic continuous transfer function and excess oxygen look-up table to characterise the real excess oxygen plant's numerical data. The predetermined time constant approximation method is applied on 1st, 2nd, 3rd, 4th and 5th model orders for an initial value estimation with SGAs. For an optimal model order assessment and selection, the information criteria are applied. The simulation results assured that the 4th order continuous transfer function as a realistic model well characterises the real excess oxygen plant's response.
{"title":"Model parameters identification for excess oxygen by Standard Genetic Algorithm","authors":"K. Rajarathinam, J. Gomm, Dingli Yu, Ahmed Saad Abdelhadi","doi":"10.1109/IConAC.2016.7604918","DOIUrl":"https://doi.org/10.1109/IConAC.2016.7604918","url":null,"abstract":"In this paper, a realistic excess oxygen model parameter identification by Standard Genetic Algorithms (SGAs) is proposed and demonstrated. The realistic excess oxygen model is developed by three sub-model; air-fuel ratio conversion model, dynamic continuous transfer function and excess oxygen look-up table to characterise the real excess oxygen plant's numerical data. The predetermined time constant approximation method is applied on 1st, 2nd, 3rd, 4th and 5th model orders for an initial value estimation with SGAs. For an optimal model order assessment and selection, the information criteria are applied. The simulation results assured that the 4th order continuous transfer function as a realistic model well characterises the real excess oxygen plant's response.","PeriodicalId":375052,"journal":{"name":"2016 22nd International Conference on Automation and Computing (ICAC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133042107","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-09-01DOI: 10.1109/IConAC.2016.7604967
Tawfeeg S. Noor, N. Osman, I. Mkwawa
Quality of Experience has become a significant parameter in evaluating and rating video services. This paper presents the impact of gender on the Quality of Experience for video services. Initial results from subjective tests show that male viewers requested higher video quality compared to female viewers, while female viewers concentrated more on the contents of the video.
{"title":"The impact of gender on the Quality of Experience for video services","authors":"Tawfeeg S. Noor, N. Osman, I. Mkwawa","doi":"10.1109/IConAC.2016.7604967","DOIUrl":"https://doi.org/10.1109/IConAC.2016.7604967","url":null,"abstract":"Quality of Experience has become a significant parameter in evaluating and rating video services. This paper presents the impact of gender on the Quality of Experience for video services. Initial results from subjective tests show that male viewers requested higher video quality compared to female viewers, while female viewers concentrated more on the contents of the video.","PeriodicalId":375052,"journal":{"name":"2016 22nd International Conference on Automation and Computing (ICAC)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130821747","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-09-01DOI: 10.1109/IConAC.2016.7604886
Hang Geng, Yan Liang, C. Wen, Yonggang Chen
This paper formulates a joint estimation problem of fast-updating state and intermittent-updating state in multi-rate systems. The original multi-rate system is first transformed into a single-rate one. Since the direct use of Kalman filtering method on the lifted system will result in the Kalman smoother, the causality constraints must be taken into account in the filter design. Then, based on the lifted system a multi-rate filter (MRF) with causality constraints is derived in the linear minimum mean squared error (LMMSE) sense using the orthogonality principle. A numerical example is given to show the effectiveness of the proposed filter.
{"title":"Joint estimation of fast-updating state and intermittent-updating state","authors":"Hang Geng, Yan Liang, C. Wen, Yonggang Chen","doi":"10.1109/IConAC.2016.7604886","DOIUrl":"https://doi.org/10.1109/IConAC.2016.7604886","url":null,"abstract":"This paper formulates a joint estimation problem of fast-updating state and intermittent-updating state in multi-rate systems. The original multi-rate system is first transformed into a single-rate one. Since the direct use of Kalman filtering method on the lifted system will result in the Kalman smoother, the causality constraints must be taken into account in the filter design. Then, based on the lifted system a multi-rate filter (MRF) with causality constraints is derived in the linear minimum mean squared error (LMMSE) sense using the orthogonality principle. A numerical example is given to show the effectiveness of the proposed filter.","PeriodicalId":375052,"journal":{"name":"2016 22nd International Conference on Automation and Computing (ICAC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126664731","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-09-01DOI: 10.1109/IConAC.2016.7604944
Waleed Rafique, M. A. Shah
It is expected that billions of devices will be connected with each other through the Internet of Things (IoT). Different aspects of IoT, such as security, have been extensively explored in the literature. However, the research focuses on how to identify and secure the IoT. We believe that it is very important to investigate how the IoT infrastructure will response when a huge amount of data is generated by IoT devices. We also need to make sure that the existing network infrastructure will not be chocked, causing the existing services to block. Along with that, the security and privacy are the huge concern for IoT. In this research, our contribution is twofold. Firstly, we investigate the performance issues of IoT network infrastructures for parameters such as throughput, delay and load etc. Secondly, we analyze the overheads that are generated as a result of deploying security in IoT. We simulate different IoT scenarios. Some interesting results are revealed.
{"title":"Performance evaluation of IoT network infrastructure","authors":"Waleed Rafique, M. A. Shah","doi":"10.1109/IConAC.2016.7604944","DOIUrl":"https://doi.org/10.1109/IConAC.2016.7604944","url":null,"abstract":"It is expected that billions of devices will be connected with each other through the Internet of Things (IoT). Different aspects of IoT, such as security, have been extensively explored in the literature. However, the research focuses on how to identify and secure the IoT. We believe that it is very important to investigate how the IoT infrastructure will response when a huge amount of data is generated by IoT devices. We also need to make sure that the existing network infrastructure will not be chocked, causing the existing services to block. Along with that, the security and privacy are the huge concern for IoT. In this research, our contribution is twofold. Firstly, we investigate the performance issues of IoT network infrastructures for parameters such as throughput, delay and load etc. Secondly, we analyze the overheads that are generated as a result of deploying security in IoT. We simulate different IoT scenarios. Some interesting results are revealed.","PeriodicalId":375052,"journal":{"name":"2016 22nd International Conference on Automation and Computing (ICAC)","volume":"255 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133593029","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-09-01DOI: 10.1109/IConAC.2016.7604930
Zhenwei Gao, Yongqiang Bai
Fast single image dehazing has been a challenging problem in many fields, such as computer vision and real-time applications. The existing image dehazing algorithms cannot achieve a trade-off between the dehazing performance and the computational complexity. The proposed approach first applies the mean filter twice to estimate airlight, which include pixel-based dark channel and bright channel constraints. And then the relationship between channel values of the restored image and atmospheric light is qualitatively analyzed to give the optimum estimate of atmospheric light. Using the airlight and atmospheric light, we can easily restore the scene radiance via the atmospheric scattering model. Compared with others, the main advantage of the proposed approach is its high speed and significant visibility improvement even in the sky and white areas. This speed allows the enhanced haze image to be applied in real-time processing applications. A comparative study and quantitative evaluation are proposed with a few other state of the art algorithms which demonstrates that similar or better quality results are obtained.
{"title":"Single image haze removal algorithm using pixel-based airlight constraints","authors":"Zhenwei Gao, Yongqiang Bai","doi":"10.1109/IConAC.2016.7604930","DOIUrl":"https://doi.org/10.1109/IConAC.2016.7604930","url":null,"abstract":"Fast single image dehazing has been a challenging problem in many fields, such as computer vision and real-time applications. The existing image dehazing algorithms cannot achieve a trade-off between the dehazing performance and the computational complexity. The proposed approach first applies the mean filter twice to estimate airlight, which include pixel-based dark channel and bright channel constraints. And then the relationship between channel values of the restored image and atmospheric light is qualitatively analyzed to give the optimum estimate of atmospheric light. Using the airlight and atmospheric light, we can easily restore the scene radiance via the atmospheric scattering model. Compared with others, the main advantage of the proposed approach is its high speed and significant visibility improvement even in the sky and white areas. This speed allows the enhanced haze image to be applied in real-time processing applications. A comparative study and quantitative evaluation are proposed with a few other state of the art algorithms which demonstrates that similar or better quality results are obtained.","PeriodicalId":375052,"journal":{"name":"2016 22nd International Conference on Automation and Computing (ICAC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129670853","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-09-01DOI: 10.1109/IConAC.2016.7604974
Maxim Wilson, B. Bazli
File sharing applications that operate as form of peer-to-peer (P2P) networks have been popular amongst users and developers for their heterogeneity and easy deployments features. However, they have been used for illegal activities online. This brings new challenges to forensic investigations in detecting, retrieving and analysing the P2P applications. We investigate the characteristics of I2P network in order to outline the problems and methods in detection of I2P artefacts. Furthermore, we present new methods to detect the presence of I2P using forensically approved tools and reconstruct the history of I2P activity using artefacts left over by I2P router software.
{"title":"Forensic analysis of I2P activities","authors":"Maxim Wilson, B. Bazli","doi":"10.1109/IConAC.2016.7604974","DOIUrl":"https://doi.org/10.1109/IConAC.2016.7604974","url":null,"abstract":"File sharing applications that operate as form of peer-to-peer (P2P) networks have been popular amongst users and developers for their heterogeneity and easy deployments features. However, they have been used for illegal activities online. This brings new challenges to forensic investigations in detecting, retrieving and analysing the P2P applications. We investigate the characteristics of I2P network in order to outline the problems and methods in detection of I2P artefacts. Furthermore, we present new methods to detect the presence of I2P using forensically approved tools and reconstruct the history of I2P activity using artefacts left over by I2P router software.","PeriodicalId":375052,"journal":{"name":"2016 22nd International Conference on Automation and Computing (ICAC)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128432525","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-09-01DOI: 10.1109/IConAC.2016.7604924
Xiaofang Liu, Ruikang Li, Dansong Cheng, K. Cheng
As a machine learning method under sparse Bayesian framework, classical Relevance Vector Machine (RVM) applies kernel methods to construct Radial Basis Function(RBF) networks using a least number of relevant basis functions. Compared to the well-known Support Vector Machine (SVM), the RVM provides a better sparsity, and an automatic estimation of hyperparameters. However, the performance of the original RVM purely depends on the smoothness of the presumed prior of the connection weights and parameters. Consequently, the sparsity is actually still controlled by the selection of kernel functions or kernel parameters. This may lead to severe underfitting or overfitting in some cases. In the research presented in this paper, we explicitly involve the number of basis functions into the objective of the optimization procedure, and construct the RVM by the minimization of the cross entropy between the “hypothetical” probability distribution in the forward training pathway and the “true” probability distribution in the backward testing pathway. The experimental results have shown that our proposed methodology can achieve both the least complexity of structure and goodness of appropriate fit to data.
{"title":"Investigation on the construction of the Relevance Vector Machine based on cross entropy minimization","authors":"Xiaofang Liu, Ruikang Li, Dansong Cheng, K. Cheng","doi":"10.1109/IConAC.2016.7604924","DOIUrl":"https://doi.org/10.1109/IConAC.2016.7604924","url":null,"abstract":"As a machine learning method under sparse Bayesian framework, classical Relevance Vector Machine (RVM) applies kernel methods to construct Radial Basis Function(RBF) networks using a least number of relevant basis functions. Compared to the well-known Support Vector Machine (SVM), the RVM provides a better sparsity, and an automatic estimation of hyperparameters. However, the performance of the original RVM purely depends on the smoothness of the presumed prior of the connection weights and parameters. Consequently, the sparsity is actually still controlled by the selection of kernel functions or kernel parameters. This may lead to severe underfitting or overfitting in some cases. In the research presented in this paper, we explicitly involve the number of basis functions into the objective of the optimization procedure, and construct the RVM by the minimization of the cross entropy between the “hypothetical” probability distribution in the forward training pathway and the “true” probability distribution in the backward testing pathway. The experimental results have shown that our proposed methodology can achieve both the least complexity of structure and goodness of appropriate fit to data.","PeriodicalId":375052,"journal":{"name":"2016 22nd International Conference on Automation and Computing (ICAC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128665714","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-09-01DOI: 10.1109/IConAC.2016.7604926
Lin Zou, Qinyun Liu, Chi Zhang, Hongji Yang
Creative computing is a new concept on guiding human beings to create fresh, surprising and useful systems to achieve effective working in different fields. Creative computing aims at combining knowledge from different disciplines. Being interdisciplinary is able to accomplish a knowledge combination which will blur the boundary between distinct fields. A series of weaved knowledge may well enable solving problems because the knowledge is the origin of creativity. This paper aims to construct a Big Data based Knowledge System (BDBKE) Framework in a way of creative computing: knowledge combination. Related work about Creative Computing, Knowledge Engineering and Big Data will be reviewed first; then each sub-system of BDBKE will be presented in details; and next the core algorithms of Ontology Classification Inference Engines will be explained step by step.
{"title":"An approach to applying creative computing in tourism by constructing a Big Data based Knowledge System Framework","authors":"Lin Zou, Qinyun Liu, Chi Zhang, Hongji Yang","doi":"10.1109/IConAC.2016.7604926","DOIUrl":"https://doi.org/10.1109/IConAC.2016.7604926","url":null,"abstract":"Creative computing is a new concept on guiding human beings to create fresh, surprising and useful systems to achieve effective working in different fields. Creative computing aims at combining knowledge from different disciplines. Being interdisciplinary is able to accomplish a knowledge combination which will blur the boundary between distinct fields. A series of weaved knowledge may well enable solving problems because the knowledge is the origin of creativity. This paper aims to construct a Big Data based Knowledge System (BDBKE) Framework in a way of creative computing: knowledge combination. Related work about Creative Computing, Knowledge Engineering and Big Data will be reviewed first; then each sub-system of BDBKE will be presented in details; and next the core algorithms of Ontology Classification Inference Engines will be explained step by step.","PeriodicalId":375052,"journal":{"name":"2016 22nd International Conference on Automation and Computing (ICAC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130118501","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-09-01DOI: 10.1109/IConAC.2016.7604901
Xiaowen Yang, Qingde Li, Xie Han, Zhichun Zhang
Seamless interaction between human beings and computer generated 3D objects is an essential task for mixed reality technologies. With the availability of modern wearable tracking systems, it is now possible to interact virtual objects with hand directly. However, without a precise reconstruction of hand geometry, it is difficult to achieve realistic and natural interaction between hand and virtual objects. Today, it is not only necessary to recognize the motion of hand, more importantly, but also necessary to precisely reconstruct the hand geometry, so that a sensible interaction between an actual hand and virtual objects can become possible. In this paper, a technique for natural interaction between hand and virtual objects in virtual environment is proposed. In our method, the 3D hand geometry is implicitly represented as a kind of distance function based on finger joint positions from position tracker and the motion model of the hand is reconstructed according to the data of data glove. The experiment results show that our technique has a much better performance due to the fact that it is much convenient to perform object collision detection and shape matching tasks.
{"title":"Person-specific hand reconstruction for natural HCI","authors":"Xiaowen Yang, Qingde Li, Xie Han, Zhichun Zhang","doi":"10.1109/IConAC.2016.7604901","DOIUrl":"https://doi.org/10.1109/IConAC.2016.7604901","url":null,"abstract":"Seamless interaction between human beings and computer generated 3D objects is an essential task for mixed reality technologies. With the availability of modern wearable tracking systems, it is now possible to interact virtual objects with hand directly. However, without a precise reconstruction of hand geometry, it is difficult to achieve realistic and natural interaction between hand and virtual objects. Today, it is not only necessary to recognize the motion of hand, more importantly, but also necessary to precisely reconstruct the hand geometry, so that a sensible interaction between an actual hand and virtual objects can become possible. In this paper, a technique for natural interaction between hand and virtual objects in virtual environment is proposed. In our method, the 3D hand geometry is implicitly represented as a kind of distance function based on finger joint positions from position tracker and the motion model of the hand is reconstructed according to the data of data glove. The experiment results show that our technique has a much better performance due to the fact that it is much convenient to perform object collision detection and shape matching tasks.","PeriodicalId":375052,"journal":{"name":"2016 22nd International Conference on Automation and Computing (ICAC)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124226240","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
扫码关注我们
求助内容：
应助结果提醒方式：