To solve the issues in credibility assessment for training simulators such as the afterthought assessment, both human-in-the-loop and hardware-in-the-loop simulation, a new credibility assessment framework for training simulators is presented comprehensively. An overview of representative credibility assessment methodologies for training simulators is summarized and the problems which including the complex tailoring process of existing credibility assessment framework and the one-sided assessment measurement are analyzed. Then, a new credibility assessment framework which comprises project processes, technical processes and information artifacts is developed. Different evaluation perspectives including system function evaluation, system performance evaluation, sense fidelity evaluation and training effectiveness evaluation are considered in technical processes. Finally, an application case is given to demonstrate how to use the framework proposed to assess the credibility of training simulators.
{"title":"A New Credibility Assessment Framework for Training Simulators","authors":"Shenglin Lin, Wei Li, P. Ma, Ming Yang","doi":"10.1145/3036331.3036351","DOIUrl":"https://doi.org/10.1145/3036331.3036351","url":null,"abstract":"To solve the issues in credibility assessment for training simulators such as the afterthought assessment, both human-in-the-loop and hardware-in-the-loop simulation, a new credibility assessment framework for training simulators is presented comprehensively. An overview of representative credibility assessment methodologies for training simulators is summarized and the problems which including the complex tailoring process of existing credibility assessment framework and the one-sided assessment measurement are analyzed. Then, a new credibility assessment framework which comprises project processes, technical processes and information artifacts is developed. Different evaluation perspectives including system function evaluation, system performance evaluation, sense fidelity evaluation and training effectiveness evaluation are considered in technical processes. Finally, an application case is given to demonstrate how to use the framework proposed to assess the credibility of training simulators.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"6 1","pages":"182-186"},"PeriodicalIF":0.0,"publicationDate":"2017-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88168364","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}
IT Demand Management (ITDM) is a key process for business. Through IT Demand Management (ITDM) business areas get the added value and meet its strategic objectives. Several ITDM models have been proposed but the IT projects have lower success rates. In this article we analyze the ITDM current situation using the systematic review methodology with the purpose of identify the critical factors and barriers or limitations for demand management. Ten studies were selected. The results of the systematic review indicate that ITDM has a direct relationship with IT Governance, business alignment and leadership for strategic alignment, which are considered critical factors, while unrealistic expectations, lack of business knowledge and incompetent demand management, are pointed out as barriers or constraints to effective implementation of the ITDM.
{"title":"IT Demand Management in Organizations: A Review","authors":"Luis Palacios Quichiz, Sussy Bayona Oré","doi":"10.1145/3036331.3050423","DOIUrl":"https://doi.org/10.1145/3036331.3050423","url":null,"abstract":"IT Demand Management (ITDM) is a key process for business. Through IT Demand Management (ITDM) business areas get the added value and meet its strategic objectives. Several ITDM models have been proposed but the IT projects have lower success rates. In this article we analyze the ITDM current situation using the systematic review methodology with the purpose of identify the critical factors and barriers or limitations for demand management. Ten studies were selected. The results of the systematic review indicate that ITDM has a direct relationship with IT Governance, business alignment and leadership for strategic alignment, which are considered critical factors, while unrealistic expectations, lack of business knowledge and incompetent demand management, are pointed out as barriers or constraints to effective implementation of the ITDM.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"63 1","pages":"95-99"},"PeriodicalIF":0.0,"publicationDate":"2017-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75125875","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}
Grounding grids have been performed an essential role in electric transformer substations. The nondestructive diagnosis system applies transforms the condition of the undergrounding conductors to the surficial induced electric signal in sensing coil. However, the induced signal cannot be used directly to diagnosis due to the raw measurement is a mixture of responses from signal of interest, strong interference and other unknown noises. Therefore the separation of individual signatures from the mixture is posed as a blind source separation (BSS) problem. To extract the induced signal corrupted by noise, the independent component analysis (ICA) method is considered. By combining the EEMD and FastICA, the single-channel signal is decomposed into its ICs. The desired signal is then reconstructed to visualize the break point of the grounding grid. The results show this approach can be used to effectively diagnosis grounding gird in harsh electromagnetic environment.
{"title":"EMI-based Diagnosis to Grounding Grids by Combining Ensemble Empirical Mode Decomposition and ICA","authors":"Hengli Song, Qiang Wu, H. Dong","doi":"10.1145/3036331.3036361","DOIUrl":"https://doi.org/10.1145/3036331.3036361","url":null,"abstract":"Grounding grids have been performed an essential role in electric transformer substations. The nondestructive diagnosis system applies transforms the condition of the undergrounding conductors to the surficial induced electric signal in sensing coil. However, the induced signal cannot be used directly to diagnosis due to the raw measurement is a mixture of responses from signal of interest, strong interference and other unknown noises. Therefore the separation of individual signatures from the mixture is posed as a blind source separation (BSS) problem. To extract the induced signal corrupted by noise, the independent component analysis (ICA) method is considered. By combining the EEMD and FastICA, the single-channel signal is decomposed into its ICs. The desired signal is then reconstructed to visualize the break point of the grounding grid. The results show this approach can be used to effectively diagnosis grounding gird in harsh electromagnetic environment.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"9 1","pages":"196-200"},"PeriodicalIF":0.0,"publicationDate":"2017-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81980638","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}
The swath-plate engine is an engine with high pressure air as working medium, and it is designed to meet the underwater launch. In order to explore the performance of the engine, the dynamic model is built by using the method of Kane on the basis of the kinematics and dynamic analysis of the main parts of the engine such as the pistons and links, etc. The simulation of the work process of the engine is realized by the use of the simulation program based on the dynamic model. The prototype engine is tested on the experiment system. The comparison of the experimental results and simulation results show that the dynamic simulation model is basically correct and can be used to optimize the engine design.
{"title":"Dynamic Modelling and Simulation of Swash-Plate Engine Based on Kane Method","authors":"Y. Lian, Chunlai Li","doi":"10.1145/3036331.3036359","DOIUrl":"https://doi.org/10.1145/3036331.3036359","url":null,"abstract":"The swath-plate engine is an engine with high pressure air as working medium, and it is designed to meet the underwater launch. In order to explore the performance of the engine, the dynamic model is built by using the method of Kane on the basis of the kinematics and dynamic analysis of the main parts of the engine such as the pistons and links, etc. The simulation of the work process of the engine is realized by the use of the simulation program based on the dynamic model. The prototype engine is tested on the experiment system. The comparison of the experimental results and simulation results show that the dynamic simulation model is basically correct and can be used to optimize the engine design.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"256 1","pages":"57-62"},"PeriodicalIF":0.0,"publicationDate":"2017-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79420793","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}
N. Khattab, Shaheera Rashwan, H. M. Ebeid, Howida A. Shedeed, W. Sheta, M. Tolba
Classification of hyperspectral images is a hot topic in remote sensing field because of its immense dimensionality. Several machine learning approaches had been effectively proposed for hyperspectral image processing. Multiple kernel learning (MKL) approaches are the most used techniques that have been promoted to improve the adaptability of kernel based learning machine. In this paper, an adaptive MKL approach is promoted for the classification of hyperspectral imagery problem. The core idea in the introduced algorithm is to optimize the convex combinations of the given base kernels during the training process of Self-Organizing Maps. Diverse types of kernel functions are used. The performance of the classifier based on the choice of the kernel function and its variables, Benchmark hyperspectral datasets are used. The experimental results demonstrate that the introduced MKLSOM learning algorithm gives a comparative solution to the state-of-the-art algorithms.
{"title":"Adaptive Multiple Kernel Self-organizing Maps for Hyperspectral Image Classification","authors":"N. Khattab, Shaheera Rashwan, H. M. Ebeid, Howida A. Shedeed, W. Sheta, M. Tolba","doi":"10.1145/3036331.3050417","DOIUrl":"https://doi.org/10.1145/3036331.3050417","url":null,"abstract":"Classification of hyperspectral images is a hot topic in remote sensing field because of its immense dimensionality. Several machine learning approaches had been effectively proposed for hyperspectral image processing. Multiple kernel learning (MKL) approaches are the most used techniques that have been promoted to improve the adaptability of kernel based learning machine. In this paper, an adaptive MKL approach is promoted for the classification of hyperspectral imagery problem. The core idea in the introduced algorithm is to optimize the convex combinations of the given base kernels during the training process of Self-Organizing Maps. Diverse types of kernel functions are used. The performance of the classifier based on the choice of the kernel function and its variables, Benchmark hyperspectral datasets are used. The experimental results demonstrate that the introduced MKLSOM learning algorithm gives a comparative solution to the state-of-the-art algorithms.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"4 1","pages":"119-124"},"PeriodicalIF":0.0,"publicationDate":"2017-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80829533","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}
Modelling complex dynamical systems plays a crucial role to understand several phenomena in different domains such as physics, engineering, biology and social sciences. In this paper, a genetic programming ensemble method is proposed to learn complex dynamical systems' underlying mathematical models, represented as differential equations, from systems' time series observations. The proposed method relies on decomposing the modelling space based on given variable dependencies. An ensemble of learners is then applied in this decomposed space and their output is combined to generate the final model. Two examples of complex dynamical systems are used to test the performance of the proposed methodology where the standard genetic programming method has struggled to find matching model equations. The empirical results show the effectiveness of the proposed methodology in learning closely matching structure of almost all system equations.
{"title":"A Genetic Programming Ensemble Method for Learning Dynamical System Models","authors":"Hassan Abdelbari, Kamran Shafi","doi":"10.1145/3036331.3036336","DOIUrl":"https://doi.org/10.1145/3036331.3036336","url":null,"abstract":"Modelling complex dynamical systems plays a crucial role to understand several phenomena in different domains such as physics, engineering, biology and social sciences. In this paper, a genetic programming ensemble method is proposed to learn complex dynamical systems' underlying mathematical models, represented as differential equations, from systems' time series observations. The proposed method relies on decomposing the modelling space based on given variable dependencies. An ensemble of learners is then applied in this decomposed space and their output is combined to generate the final model. Two examples of complex dynamical systems are used to test the performance of the proposed methodology where the standard genetic programming method has struggled to find matching model equations. The empirical results show the effectiveness of the proposed methodology in learning closely matching structure of almost all system equations.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"106 1","pages":"47-51"},"PeriodicalIF":0.0,"publicationDate":"2017-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88392398","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}
With the robots being applied for more and more fields, security issues attracted more attention. In this paper, we propose that the key center in cloud send a polynomial information to each robot component, the component would put their information into the polynomial to get a group of new keys using in next slot, then check and update its key groups after success in hash. Because of the degree of the polynomial is higher than the number of components, even if an attacker got all the key values of the components, he also cannot restore the polynomial. The information about the keys will be discarded immediately after used, so an attacker cannot obtain the session key used before by the invasion of a component. This article solves the security problems about robotic system caused by cyber-attacks and physical attacks.
{"title":"Polynomial-based Key Management Scheme for robotic system","authors":"秦云川, Qi Xiao","doi":"10.1145/3036331.3050418","DOIUrl":"https://doi.org/10.1145/3036331.3050418","url":null,"abstract":"With the robots being applied for more and more fields, security issues attracted more attention. In this paper, we propose that the key center in cloud send a polynomial information to each robot component, the component would put their information into the polynomial to get a group of new keys using in next slot, then check and update its key groups after success in hash. Because of the degree of the polynomial is higher than the number of components, even if an attacker got all the key values of the components, he also cannot restore the polynomial. The information about the keys will be discarded immediately after used, so an attacker cannot obtain the session key used before by the invasion of a component. This article solves the security problems about robotic system caused by cyber-attacks and physical attacks.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"10 1","pages":"105-108"},"PeriodicalIF":0.0,"publicationDate":"2017-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82561005","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}
Seokho Son, Hyun-Hwa Choi, Byeong Thaek Oh, S. Kim, Byoung-Seob Kim
In the past few years, cloud computing has been realized and has achieved advancement. Sincemany cloud systems and providers have been deployed in this world, various models and platforms have been developed to support multiple cloud (i.e., multi-cloud) environments (e.g., inter-cloud, federated cloud, distributed cloud, hybrid cloud, multi-cloud management platform, and cloud service brokerageplatform). Whereas those models provide a multi-cloud environment, they are different according to their objectives, service models, SLA (service level agreement) models, and so on. Even though SLA is considered as a very important issue in cloud computing, SLA relationships in multi-cloud models are not formally described yet. Therefore, in this paper, we introduce various multi-cloud models and analyze the multi-cloud models in term of SLA relationship based on the proposed SLA relationship description model. In addition, this paper introduces open source multi-cloud projects to understand practices in cloud SLA relationships.
{"title":"Cloud SLA relationships in multi-cloud environment: models and practices","authors":"Seokho Son, Hyun-Hwa Choi, Byeong Thaek Oh, S. Kim, Byoung-Seob Kim","doi":"10.1145/3036331.3050422","DOIUrl":"https://doi.org/10.1145/3036331.3050422","url":null,"abstract":"In the past few years, cloud computing has been realized and has achieved advancement. Sincemany cloud systems and providers have been deployed in this world, various models and platforms have been developed to support multiple cloud (i.e., multi-cloud) environments (e.g., inter-cloud, federated cloud, distributed cloud, hybrid cloud, multi-cloud management platform, and cloud service brokerageplatform). Whereas those models provide a multi-cloud environment, they are different according to their objectives, service models, SLA (service level agreement) models, and so on. Even though SLA is considered as a very important issue in cloud computing, SLA relationships in multi-cloud models are not formally described yet. Therefore, in this paper, we introduce various multi-cloud models and analyze the multi-cloud models in term of SLA relationship based on the proposed SLA relationship description model. In addition, this paper introduces open source multi-cloud projects to understand practices in cloud SLA relationships.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"13 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84968072","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}
The vocabulary semantic similarity calculation is one of the key technologies of natural language processing, and it has been widely used in many fields such as information extraction and text classification. So how to effectively acquire the information relationships is the core issue in the study of data mining and knowledge organization.This research puts forward the concepts of semantic correlation degree and the same semantic ratio according to the semantic system structure of HowNet, and designs a computation method of vocabulary semantic similarity based on semantic distance and the degree of semantic association. The method not only considers the effect of sememes' relation to semantic similarity, but also takes into account the lexical semantic correlation degree to semantic similarity. Experimental results prove that the improved algorithm effectively improved the veracity and accuracy of semantic similarity computation method, which makes the consequence satisfy people's subjective cognition and more reasonable.
{"title":"Algorithm Improvement of Vocabulary Semantic Similarity with HowNet","authors":"Y. Qu, Tie-Zhu Yang, Min Wang","doi":"10.1145/3036331.3036333","DOIUrl":"https://doi.org/10.1145/3036331.3036333","url":null,"abstract":"The vocabulary semantic similarity calculation is one of the key technologies of natural language processing, and it has been widely used in many fields such as information extraction and text classification. So how to effectively acquire the information relationships is the core issue in the study of data mining and knowledge organization.This research puts forward the concepts of semantic correlation degree and the same semantic ratio according to the semantic system structure of HowNet, and designs a computation method of vocabulary semantic similarity based on semantic distance and the degree of semantic association. The method not only considers the effect of sememes' relation to semantic similarity, but also takes into account the lexical semantic correlation degree to semantic similarity. Experimental results prove that the improved algorithm effectively improved the veracity and accuracy of semantic similarity computation method, which makes the consequence satisfy people's subjective cognition and more reasonable.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"1 1","pages":"114-118"},"PeriodicalIF":0.0,"publicationDate":"2017-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82895161","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}
The Rapidly-exploring Random Tree (RRT) is a useful path planning algorithm and has been extensively researched in recent years. Till now parameters setting of the RRT algorithm have not yet been explored and are usually set based on the expert experience. In this paper, lots of simulation experiments are conducted for different parameter values. The influence of the parameters on the performance of the algorithm is analyzed through the statistical experiments data. At last, the suggestion of parameters setting is given.
{"title":"Experimental Study of Parameters for Rapidly-exploring Random Tree Algorithm","authors":"Li Meng, Song Qing, Zhao Qin Jun","doi":"10.1145/3036331.3036358","DOIUrl":"https://doi.org/10.1145/3036331.3036358","url":null,"abstract":"The Rapidly-exploring Random Tree (RRT) is a useful path planning algorithm and has been extensively researched in recent years. Till now parameters setting of the RRT algorithm have not yet been explored and are usually set based on the expert experience. In this paper, lots of simulation experiments are conducted for different parameter values. The influence of the parameters on the performance of the algorithm is analyzed through the statistical experiments data. At last, the suggestion of parameters setting is given.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"7 1","pages":"19-23"},"PeriodicalIF":0.0,"publicationDate":"2017-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74369202","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
扫码关注我们
求助内容：
应助结果提醒方式：