It is important to predict battle damage level timely and accurately for operation commander to adjust firing action intent, issue command, control situations, and make decisions correctly. Adaptive neural fuzzy inference system (ANFIS) architecture and the hybrid-learning algorithm by applying back-propagation and least mean squares procedure are studied. ANFIS model for battle damage level prediction is established based on the analysis of the main influence factors of battle damage level. The prediction of battle damage level being consistent with the factual damage level is achieved by training the proposed ANFIS model using damage test data. Simulations comparing analysis for battle damage level prediction results are conducted using the proposed method and BP neutral network respectively. Simulation results demonstrate that the proposed method can predict battle damage level correctly and the precision is higher than that of BP neutral network, and thus may provide an effective method for battle damage level prediction.
{"title":"Study on Battle Damage Level Prediction Using Hybrid-learning Algorithm","authors":"Cheng Zhang, Quan Shi, T. Liu, W. Zhao","doi":"10.1109/ICCIS.2012.298","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.298","url":null,"abstract":"It is important to predict battle damage level timely and accurately for operation commander to adjust firing action intent, issue command, control situations, and make decisions correctly. Adaptive neural fuzzy inference system (ANFIS) architecture and the hybrid-learning algorithm by applying back-propagation and least mean squares procedure are studied. ANFIS model for battle damage level prediction is established based on the analysis of the main influence factors of battle damage level. The prediction of battle damage level being consistent with the factual damage level is achieved by training the proposed ANFIS model using damage test data. Simulations comparing analysis for battle damage level prediction results are conducted using the proposed method and BP neutral network respectively. Simulation results demonstrate that the proposed method can predict battle damage level correctly and the precision is higher than that of BP neutral network, and thus may provide an effective method for battle damage level prediction.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130999401","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}
Lei Du, Guixing Zheng, Bo You, Xiankun Zhang, Lina Bai
In the past twenty years, online education has grown as a main part of current education. However, the unambiguous and uniform expression of online education is a crucial challenge. Since ontology is becoming a recognized vehicle for knowledge reuse, knowledge sharing and modeling, online education(OE_Onto) is designed by using ABC model as upper ontology in order to solve these problems. OE_Onto can provide the shared knowledge in semantics to achieve the cooperation and reuse between people and the different online education systems. In this paper, OE_Onto is respectively described in five-tuple involving the concepts, relations, functions, axioms and instances. Finally, the experiment of an online education process is completed to validate OE_Onto.
{"title":"Research of Online Education Ontology Model","authors":"Lei Du, Guixing Zheng, Bo You, Xiankun Zhang, Lina Bai","doi":"10.1109/ICCIS.2012.233","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.233","url":null,"abstract":"In the past twenty years, online education has grown as a main part of current education. However, the unambiguous and uniform expression of online education is a crucial challenge. Since ontology is becoming a recognized vehicle for knowledge reuse, knowledge sharing and modeling, online education(OE_Onto) is designed by using ABC model as upper ontology in order to solve these problems. OE_Onto can provide the shared knowledge in semantics to achieve the cooperation and reuse between people and the different online education systems. In this paper, OE_Onto is respectively described in five-tuple involving the concepts, relations, functions, axioms and instances. Finally, the experiment of an online education process is completed to validate OE_Onto.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115234838","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}
Order acceptance is a key success factor in make-to-order (MTO) manufacturing firms. In this work, in order to maximize average revenue in an infinite planning horizon, we use dynamic programming to model the order acceptance problem, and solve it with reinforcement learning approach. A novel approach for simulation-based development for dynamic order acceptance using average-reward reinforcement learning is proposed. Through the simulation, an intelligent decision policy to dynamically control the coming orders is learned by the agent. Comparisons made with First-Come-First-Serve (FCFS) highlight the effectiveness of the proposed novel approach to maximize the average revenue.
{"title":"Agent-Based Dynamic Order Acceptance Policy in Make-to-Order Manufacturing","authors":"Juan Hao, Jianjun Yu","doi":"10.1109/ICCIS.2012.60","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.60","url":null,"abstract":"Order acceptance is a key success factor in make-to-order (MTO) manufacturing firms. In this work, in order to maximize average revenue in an infinite planning horizon, we use dynamic programming to model the order acceptance problem, and solve it with reinforcement learning approach. A novel approach for simulation-based development for dynamic order acceptance using average-reward reinforcement learning is proposed. Through the simulation, an intelligent decision policy to dynamically control the coming orders is learned by the agent. Comparisons made with First-Come-First-Serve (FCFS) highlight the effectiveness of the proposed novel approach to maximize the average revenue.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124273354","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}
Regarding to the limitations of the existing K nearest neighbor non-parametric regression methods, spatial autocorrelation analysis is used to determine the state vector in this paper. In order to improve the speed of searching data, this paper uses the method of clipping samples to reduce data storage and split the sample quickly by KD-Tree. It also reduces the search volume of the nearest neighbor through the pruning principle of KD-Tree, gets the subset by proportional sampling in the KD-Tree subset, and runs K-Means clustering multiple times. Then the optimal K value is selected which can improve the forecast error of the uniform K value on the traditional non-parametric regression. The experimental results show that improved forecasting method is superior to the traditional method.
{"title":"Research on K Nearest Neighbor Non-parametric Regression Algorithm Based on KD-Tree and Clustering Analysis","authors":"Zheng-Wu Yuan, Yuan-Hui Wang","doi":"10.1109/ICCIS.2012.246","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.246","url":null,"abstract":"Regarding to the limitations of the existing K nearest neighbor non-parametric regression methods, spatial autocorrelation analysis is used to determine the state vector in this paper. In order to improve the speed of searching data, this paper uses the method of clipping samples to reduce data storage and split the sample quickly by KD-Tree. It also reduces the search volume of the nearest neighbor through the pruning principle of KD-Tree, gets the subset by proportional sampling in the KD-Tree subset, and runs K-Means clustering multiple times. Then the optimal K value is selected which can improve the forecast error of the uniform K value on the traditional non-parametric regression. The experimental results show that improved forecasting method is superior to the traditional method.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127184514","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}
C. Shenghui, Jiang Zhifang, Qiang Qi, Shuo Li, Xiangxu Meng
Parallel coordinates is a very important visualization method, but the dimensions it can express are limited by the length or width of the screen. In this paper, we present the polar parallel coordinates method. First, we define the polar parallel coordinates as the coordinate whose axes exist between the same degree and show the expression of the axis. We give the algorithms for the polar parallel coordinates generation and data shown in the polar parallel coordinates. Then we point out two feathers of the polar parallel coordinates. It can express more axes than parallel coordinates and reflect the characteristics of time-series data. Based on this, we compare the parallel coordinates with the polar parallel coordinates by the time-series data visualization.
{"title":"The Polar Parallel Coordinates Method for Time-Series Data Visualization","authors":"C. Shenghui, Jiang Zhifang, Qiang Qi, Shuo Li, Xiangxu Meng","doi":"10.1109/ICCIS.2012.334","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.334","url":null,"abstract":"Parallel coordinates is a very important visualization method, but the dimensions it can express are limited by the length or width of the screen. In this paper, we present the polar parallel coordinates method. First, we define the polar parallel coordinates as the coordinate whose axes exist between the same degree and show the expression of the axis. We give the algorithms for the polar parallel coordinates generation and data shown in the polar parallel coordinates. Then we point out two feathers of the polar parallel coordinates. It can express more axes than parallel coordinates and reflect the characteristics of time-series data. Based on this, we compare the parallel coordinates with the polar parallel coordinates by the time-series data visualization.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124935999","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}
Currently, with the large number of data and the increasing importance of it, how to find useful pattern in the large data, has become an important application of data mining. The rough set attribute reduction algorithm, used to study how to contain the same information when we use fewer properties to describe the objects, has been more widely used, so that the concept of soft computing is becoming increasingly popular. Rough set attribute reduction algorithm can only be applied to discrete data sets, and how to apply it to the continuous collections of the real data is a hot issue in the fuzzy mathematics. By applying the concept of fuzzy set in this issue, we can reduce the loss of information in discretization of continuous attributes. Thus the reduction results have less properties for description and contain the same information at the same time. Because of the difference between the directions of fuzzy set theory applications, that is, the reduction is based on the degree of dependence or the discernibility matrices. It can produce different fuzzy rough set attribute reductions. CCD-FRSAR(attribute reduction based on the compact computational domain of fuzzy-rough set) and FRSAR-SAT (fuzzy-rough set attribute reduction of satisfiability problem)are new and have practical values in these algorithms. Two algorithms have different ways to apply fuzzy sets theory, so the effects of them are different, too. This article describes the related ideas of fuzzy mathematics, describes the two algorithms and compares them.
{"title":"Comparison of Two Algorithms of Attribute Reduction Based on Fuzzy Rough Set","authors":"JianLiang Meng, Ye Xu, Junwei Zhang","doi":"10.1109/ICCIS.2012.107","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.107","url":null,"abstract":"Currently, with the large number of data and the increasing importance of it, how to find useful pattern in the large data, has become an important application of data mining. The rough set attribute reduction algorithm, used to study how to contain the same information when we use fewer properties to describe the objects, has been more widely used, so that the concept of soft computing is becoming increasingly popular. Rough set attribute reduction algorithm can only be applied to discrete data sets, and how to apply it to the continuous collections of the real data is a hot issue in the fuzzy mathematics. By applying the concept of fuzzy set in this issue, we can reduce the loss of information in discretization of continuous attributes. Thus the reduction results have less properties for description and contain the same information at the same time. Because of the difference between the directions of fuzzy set theory applications, that is, the reduction is based on the degree of dependence or the discernibility matrices. It can produce different fuzzy rough set attribute reductions. CCD-FRSAR(attribute reduction based on the compact computational domain of fuzzy-rough set) and FRSAR-SAT (fuzzy-rough set attribute reduction of satisfiability problem)are new and have practical values in these algorithms. Two algorithms have different ways to apply fuzzy sets theory, so the effects of them are different, too. This article describes the related ideas of fuzzy mathematics, describes the two algorithms and compares them.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126036388","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}
Rongmao Chen, Bofeng Zhang, Jiangchun Ren, Zhenghu Gong
Computer electromagnetic radiation Trojan arouses concern gradually due to its particularity in route of transmission. Currently, technologies for preventing electromagnetic radiation are mainly divided into two types of software and hardware. Hardware has a high cost and limited range of application, while most of current software protection mechanism is in theoretical research stage with quite complex principles. This paper makes exploration on prevention methods for displayer electromagnetic Trojan. Trojans need to be realized through changes of pixel on the displayer when working, their function called by their bottom of system would also present characteristics of corresponding sequence. Based on this characteristic, this paper proposes Trojan detection methods based on API sequence cycle mining, and pixel interference is also proposed as a prevention method at the end of this paper. It is indicated by experiments, the method could better detect displayer electromagnetic Trojan programs and has a strong versatility, low cost, and easy to deploy applications.
{"title":"Detection of Electromagnetic Trojans Based on API Cycle Mining","authors":"Rongmao Chen, Bofeng Zhang, Jiangchun Ren, Zhenghu Gong","doi":"10.1109/ICCIS.2012.128","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.128","url":null,"abstract":"Computer electromagnetic radiation Trojan arouses concern gradually due to its particularity in route of transmission. Currently, technologies for preventing electromagnetic radiation are mainly divided into two types of software and hardware. Hardware has a high cost and limited range of application, while most of current software protection mechanism is in theoretical research stage with quite complex principles. This paper makes exploration on prevention methods for displayer electromagnetic Trojan. Trojans need to be realized through changes of pixel on the displayer when working, their function called by their bottom of system would also present characteristics of corresponding sequence. Based on this characteristic, this paper proposes Trojan detection methods based on API sequence cycle mining, and pixel interference is also proposed as a prevention method at the end of this paper. It is indicated by experiments, the method could better detect displayer electromagnetic Trojan programs and has a strong versatility, low cost, and easy to deploy applications.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125281621","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 this paper, we utilized comprehensive geological analysis methods to identify sedimentary micro-facies in Wuqi Oilfield. Based on identification marks of sedimentary facies such as lithologic features, sedimentary structures and paleontological fossil, we classified the sedimentary micro-facies in this field into 4 types, including underwater distributary channel, mouth bar, distal bar and interdistributary bay facies. According to the observation of cores and casting thin sections, we made analysis on the pore characteristics of Chang 6 reservoir. The pore characteristic of target area is mainly intergranular space, which takes 3.27%, followed by feldspar and rock debris dissolution pore. The analysis shows that, the sedimentary thichness and grain size of underwater distributary channel are both quite big. The content of flake silicate mineral, for example, mica, is relatively low, but its porosity and permeability is high compared with mouth bar and distal bar. Interdistributary bay facies that has the lowest porosity and permeability are very strong.
{"title":"Research on Reservoir Sedimentary and Pore Characteristics of Chang 6 in Wuqi Oilfield","authors":"Fengxia Li, Zhengku Wang","doi":"10.1109/ICCIS.2012.252","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.252","url":null,"abstract":"In this paper, we utilized comprehensive geological analysis methods to identify sedimentary micro-facies in Wuqi Oilfield. Based on identification marks of sedimentary facies such as lithologic features, sedimentary structures and paleontological fossil, we classified the sedimentary micro-facies in this field into 4 types, including underwater distributary channel, mouth bar, distal bar and interdistributary bay facies. According to the observation of cores and casting thin sections, we made analysis on the pore characteristics of Chang 6 reservoir. The pore characteristic of target area is mainly intergranular space, which takes 3.27%, followed by feldspar and rock debris dissolution pore. The analysis shows that, the sedimentary thichness and grain size of underwater distributary channel are both quite big. The content of flake silicate mineral, for example, mica, is relatively low, but its porosity and permeability is high compared with mouth bar and distal bar. Interdistributary bay facies that has the lowest porosity and permeability are very strong.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122768309","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}
Along with the rapid development of peer-to-peer network technology and the fast increasing number of users, the problems of security in peer-to-peer network is becoming more and more important. By researching the previous trust model of peer-to-peer network, we propose a trust model(PTM) for peer-to-peer networks based on punish mechanism. Firstly, we use the method of social grouping nodes in the calculation model of trust. Then bring in punish mechanism in trust model. This model can stimulate nodes which provide sincere reliable service.
{"title":"The Trust Model Based on Punish Mechanism in Peer-to-Peer Network","authors":"Xiaoyan Ma","doi":"10.1109/ICCIS.2012.357","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.357","url":null,"abstract":"Along with the rapid development of peer-to-peer network technology and the fast increasing number of users, the problems of security in peer-to-peer network is becoming more and more important. By researching the previous trust model of peer-to-peer network, we propose a trust model(PTM) for peer-to-peer networks based on punish mechanism. Firstly, we use the method of social grouping nodes in the calculation model of trust. Then bring in punish mechanism in trust model. This model can stimulate nodes which provide sincere reliable service.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122971361","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}
Partitioning network, especially some DTN, can use Message Ferry(MF) scheme to restore network connection. Message TTL describes the maximum delay tolerance of transmission and messages with out-of-date TTL should be dropped. In this paper, we will study the problem of how to design the ferry's moving route dynamically to get high message delivery ratio under the constraint of message TTL, which we call it TAFR problem as well as algorithms. We compare TAFRA to existing SIRA and Random Way point algorithm with different message TTLs and ferry number in two scenarios. The simulation shows that TAFRA can get nearly twice the delivery ratio than SIRA in low message TTL conditions, and 50% more delivery ratio with increasing ferry number. Furthermore, the simulation shows that TAFRA provides on-demand characteristics which are more suitable in some non-uniformly distribute message condition.
{"title":"TAFR: A TTL-aware Message Ferry Scheme in DTN","authors":"Xiaoyang Wu, Yingwen Chen, Ming Xu, Wei Peng","doi":"10.1109/ICCIS.2012.309","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.309","url":null,"abstract":"Partitioning network, especially some DTN, can use Message Ferry(MF) scheme to restore network connection. Message TTL describes the maximum delay tolerance of transmission and messages with out-of-date TTL should be dropped. In this paper, we will study the problem of how to design the ferry's moving route dynamically to get high message delivery ratio under the constraint of message TTL, which we call it TAFR problem as well as algorithms. We compare TAFRA to existing SIRA and Random Way point algorithm with different message TTLs and ferry number in two scenarios. The simulation shows that TAFRA can get nearly twice the delivery ratio than SIRA in low message TTL conditions, and 50% more delivery ratio with increasing ferry number. Furthermore, the simulation shows that TAFRA provides on-demand characteristics which are more suitable in some non-uniformly distribute message condition.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129505087","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
扫码关注我们
求助内容：
应助结果提醒方式：