首页 > 最新文献

International Conference on Fuzzy Systems and Knowledge Discovery最新文献

英文 中文
The implementation of KMP algorithm based on MPI + OpenMP 基于MPI + OpenMP的KMP算法实现
Pub Date : 2012-05-29 DOI: 10.1109/FSKD.2012.6234095
Duan Geng, Weichang Shen, J. Cui, Lin Quan
KMP algorithm is a common method of string matching. In view of the characteristics of the string matching and cluster, this article uses MPI + OpenMP hybrid programming model; and KMP algorithm was improved to statistics the number of target words appearing in parallel. Experiments show that the parallel algorithm improves effectively the matching speed, and is higher utilization with memory and less communication time than pure MPI.
KMP算法是一种常用的字符串匹配方法。针对字符串匹配和聚类的特点,本文采用MPI + OpenMP混合编程模型;改进KMP算法,统计目标词并行出现的数量。实验表明,该算法有效地提高了匹配速度,并且比纯MPI算法具有更高的内存利用率和更少的通信时间。
{"title":"The implementation of KMP algorithm based on MPI + OpenMP","authors":"Duan Geng, Weichang Shen, J. Cui, Lin Quan","doi":"10.1109/FSKD.2012.6234095","DOIUrl":"https://doi.org/10.1109/FSKD.2012.6234095","url":null,"abstract":"KMP algorithm is a common method of string matching. In view of the characteristics of the string matching and cluster, this article uses MPI + OpenMP hybrid programming model; and KMP algorithm was improved to statistics the number of target words appearing in parallel. Experiments show that the parallel algorithm improves effectively the matching speed, and is higher utilization with memory and less communication time than pure MPI.","PeriodicalId":337941,"journal":{"name":"International Conference on Fuzzy Systems and Knowledge Discovery","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115716437","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}
引用次数: 4
Research and simulation on the upper bound of the price of network anarchy 网络无政府状态代价上界的研究与仿真
Pub Date : 2012-05-29 DOI: 10.1109/FSKD.2012.6233759
Hu-sheng Liao, Guangyuan Dai, Ruoyun Chen
Uncoordinated agents in society usually assumed to take their own optimal strategies do not always achieve the social optimum. In transportation network, travelers are assumed to choose the route that minimizes their own travel costs, which will form a Nash Equilibrium called user equilibrium where no one could be better off by changing routes in the network. This type of routing strategy named self-routing is socially suboptimal. Consequently the society has to pay a price of anarchy for the lack of coordination among travelers. In this paper we revisit the definition of price of anarchy (POA) and analyze its upper bound under different latency functions. We review some simulation results of several major cities and investigate the difference between optimum and actual system performance in the real transportation network. A numerical simulation of Sioux network is conducted based on the classical computational procedures. The results indicate that the shape of POA as a function of input flow is not diatonic but rather fluctuating. Then we propose some more insights of POA.
社会中不协调的主体通常被认为采取自己的最优策略,但并不总能达到社会最优。在交通网络中,假设出行者选择自己出行成本最小的路线,这将形成一个纳什均衡,称为用户均衡,在这种均衡中,没有人可以通过改变网络中的路线而获得更好的收益。这种称为自路由的路由策略在社会上是次优的。因此,由于旅行者之间缺乏协调,社会不得不付出混乱的代价。本文重新讨论了无状态价格(POA)的定义,并分析了在不同延迟函数下的无状态价格上界。我们回顾了几个主要城市的模拟结果,并研究了在实际交通网络中最优系统性能与实际系统性能之间的差异。基于经典计算方法,对苏族网络进行了数值模拟。结果表明,POA的形状作为输入流量的函数不是全音阶的,而是波动的。然后,我们对POA提出了更多的见解。
{"title":"Research and simulation on the upper bound of the price of network anarchy","authors":"Hu-sheng Liao, Guangyuan Dai, Ruoyun Chen","doi":"10.1109/FSKD.2012.6233759","DOIUrl":"https://doi.org/10.1109/FSKD.2012.6233759","url":null,"abstract":"Uncoordinated agents in society usually assumed to take their own optimal strategies do not always achieve the social optimum. In transportation network, travelers are assumed to choose the route that minimizes their own travel costs, which will form a Nash Equilibrium called user equilibrium where no one could be better off by changing routes in the network. This type of routing strategy named self-routing is socially suboptimal. Consequently the society has to pay a price of anarchy for the lack of coordination among travelers. In this paper we revisit the definition of price of anarchy (POA) and analyze its upper bound under different latency functions. We review some simulation results of several major cities and investigate the difference between optimum and actual system performance in the real transportation network. A numerical simulation of Sioux network is conducted based on the classical computational procedures. The results indicate that the shape of POA as a function of input flow is not diatonic but rather fluctuating. Then we propose some more insights of POA.","PeriodicalId":337941,"journal":{"name":"International Conference on Fuzzy Systems and Knowledge Discovery","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115731773","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}
引用次数: 1
Research of process management on drilling engineering collaborative design system based on workflow 基于工作流的钻井工程协同设计系统过程管理研究
Pub Date : 2012-05-29 DOI: 10.1109/FSKD.2012.6234118
Bing Zhang, Jiyou Xiong, Zhikun Liu, Yanwei Bai, Qi Li
The drilling engineering design of a well needs collaborative work of designers from multidisciplinary fields such as geology, reservoir engineering and drilling engineering, or designers distributed in different departments. Because there is closely data relevance among every parts of the drilling engineering design which needs the designers in different departments to exchange a lot of data and documents according to a certain design process, any delay in parts of design process will affect the timeliness and accuracy of the whole drilling engineering design. The authors integrated workflow theory into process management of drilling engineering collaborative design system, built workflow management model of Drilling Engineering Collaborative Design System. The paper analyses function of the five sub-modules in this model in detail combining realization process of the system. So it provides an effective method for process management of Drilling Engineering Collaborative Design System, and improved actual operating efficiency of the system.
一口井的钻井工程设计需要来自地质、油藏工程、钻井工程等多学科领域的设计人员或分布在不同部门的设计人员的协同工作。由于钻井工程设计的各个部分之间存在着紧密的数据关联,需要不同部门的设计人员按照一定的设计流程进行大量的数据和文件的交换,因此设计过程中的任何一个部分的延迟都会影响整个钻井工程设计的及时性和准确性。将工作流理论融入钻井工程协同设计系统的流程管理中,建立了钻井工程协同设计系统的工作流管理模型。结合系统的实现过程,详细分析了该模型中五个子模块的功能。为钻井工程协同设计系统的过程管理提供了一种有效的方法,提高了系统的实际运行效率。
{"title":"Research of process management on drilling engineering collaborative design system based on workflow","authors":"Bing Zhang, Jiyou Xiong, Zhikun Liu, Yanwei Bai, Qi Li","doi":"10.1109/FSKD.2012.6234118","DOIUrl":"https://doi.org/10.1109/FSKD.2012.6234118","url":null,"abstract":"The drilling engineering design of a well needs collaborative work of designers from multidisciplinary fields such as geology, reservoir engineering and drilling engineering, or designers distributed in different departments. Because there is closely data relevance among every parts of the drilling engineering design which needs the designers in different departments to exchange a lot of data and documents according to a certain design process, any delay in parts of design process will affect the timeliness and accuracy of the whole drilling engineering design. The authors integrated workflow theory into process management of drilling engineering collaborative design system, built workflow management model of Drilling Engineering Collaborative Design System. The paper analyses function of the five sub-modules in this model in detail combining realization process of the system. So it provides an effective method for process management of Drilling Engineering Collaborative Design System, and improved actual operating efficiency of the system.","PeriodicalId":337941,"journal":{"name":"International Conference on Fuzzy Systems and Knowledge Discovery","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123902295","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}
引用次数: 0
Simulation study on the performance of several classifiers in face recognition 几种分类器在人脸识别中的性能仿真研究
Pub Date : 2012-05-29 DOI: 10.1109/FSKD.2012.6233940
C. Chen, Jia Tang
Classifier is the important content in the face recognition system. This paper uses PCA to extract the face image feature and then compares the recognition performance of several classifiers. Based on ORL and YALE face database, the paper carries out simulation experiment by using minimum distance classifier, nearest-neighbor classifier and K-neighbor classifier respectively. Besides, this paper researches different distance measures' effects on the recognition result of the classifiers, Euclidean distance, Minkowski distance, cosine distance and absolute distance.
分类器是人脸识别系统的重要内容。本文利用主成分分析法提取人脸图像特征,然后比较几种分类器的识别性能。基于ORL和YALE人脸数据库,分别采用最小距离分类器、最近邻分类器和k近邻分类器进行仿真实验。此外,本文还研究了不同距离度量对分类器识别结果的影响,欧几里得距离、闵可夫斯基距离、余弦距离和绝对距离。
{"title":"Simulation study on the performance of several classifiers in face recognition","authors":"C. Chen, Jia Tang","doi":"10.1109/FSKD.2012.6233940","DOIUrl":"https://doi.org/10.1109/FSKD.2012.6233940","url":null,"abstract":"Classifier is the important content in the face recognition system. This paper uses PCA to extract the face image feature and then compares the recognition performance of several classifiers. Based on ORL and YALE face database, the paper carries out simulation experiment by using minimum distance classifier, nearest-neighbor classifier and K-neighbor classifier respectively. Besides, this paper researches different distance measures' effects on the recognition result of the classifiers, Euclidean distance, Minkowski distance, cosine distance and absolute distance.","PeriodicalId":337941,"journal":{"name":"International Conference on Fuzzy Systems and Knowledge Discovery","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129280713","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}
引用次数: 1
Research of calculating CFI value used in LTE system LTE系统中CFI值的计算方法研究
Pub Date : 2012-05-29 DOI: 10.1109/FSKD.2012.6233744
Dan Wang, Haifeng Jia
This paper investigated the traditional method to determine Physical Downlink Control Channel (PDCCH) format and Control Format Indicator (CFI) value in LTE (Long Term Evolution) system. A modified method to calculate CFI value and the PDCCH format was proposed. Firstly, this method determined the PDCCH format based on the channel conditions, and then calculated the number of Resource Elements (RE) occupied by all the downlink control channels and reference signals. Finally, determined the CFI value based on the calculated number. The simulation results show that this modified method can effectively eliminate the average number of PDCCH blind detection.
研究了LTE(长期演进)系统中确定物理下行链路控制信道(PDCCH)格式和控制格式指示器(CFI)值的传统方法。提出了一种计算CFI值和PDCCH格式的改进方法。该方法首先根据信道条件确定PDCCH格式,然后计算所有下行控制信道和参考信号占用的资源元素(Resource element, RE)数。最后,根据计算出的数确定CFI值。仿真结果表明,该改进方法可以有效地消除平均盲检测次数。
{"title":"Research of calculating CFI value used in LTE system","authors":"Dan Wang, Haifeng Jia","doi":"10.1109/FSKD.2012.6233744","DOIUrl":"https://doi.org/10.1109/FSKD.2012.6233744","url":null,"abstract":"This paper investigated the traditional method to determine Physical Downlink Control Channel (PDCCH) format and Control Format Indicator (CFI) value in LTE (Long Term Evolution) system. A modified method to calculate CFI value and the PDCCH format was proposed. Firstly, this method determined the PDCCH format based on the channel conditions, and then calculated the number of Resource Elements (RE) occupied by all the downlink control channels and reference signals. Finally, determined the CFI value based on the calculated number. The simulation results show that this modified method can effectively eliminate the average number of PDCCH blind detection.","PeriodicalId":337941,"journal":{"name":"International Conference on Fuzzy Systems and Knowledge Discovery","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129394898","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}
引用次数: 5
A novel call admission control scheme based on triangle module operator for heterogeneous wireless networks 一种基于三角形模块算子的异构无线网络呼叫接纳控制方案
Pub Date : 2012-05-29 DOI: 10.1109/FSKD.2012.6233839
Zheng Yang, Jie Sheng, Liangrui Tang
Since existing call admission control (CAC) algorithms designed for heterogeneous wireless networks have failed to consider different characteristics of mobile users and the network load sufficiently, a CAC algorithm based on triangle module operator is proposed. First, proper utility functions are formed with consideration of user satisfaction and mobility as well as the network performance, and then fused by the use of triangle module operator to select the candidate network with the highest trustworthy as the optimal access network. Simulation results demonstrate that the proposed CAC scheme can benefit both users and networks by handling the uncertainty and time-varying information appropriately on finally fuzzy decision.
针对现有针对异构无线网络设计的呼叫接纳控制(CAC)算法未能充分考虑移动用户和网络负载的不同特性的问题,提出了一种基于三角模块算子的呼叫接纳控制算法。首先考虑用户满意度、移动性和网络性能,形成适当的效用函数,然后使用三角模块算子进行融合,选择可信度最高的候选网络作为最优接入网。仿真结果表明,通过对最终模糊决策的不确定性和时变信息进行适当处理,所提出的CAC方案对用户和网络都有好处。
{"title":"A novel call admission control scheme based on triangle module operator for heterogeneous wireless networks","authors":"Zheng Yang, Jie Sheng, Liangrui Tang","doi":"10.1109/FSKD.2012.6233839","DOIUrl":"https://doi.org/10.1109/FSKD.2012.6233839","url":null,"abstract":"Since existing call admission control (CAC) algorithms designed for heterogeneous wireless networks have failed to consider different characteristics of mobile users and the network load sufficiently, a CAC algorithm based on triangle module operator is proposed. First, proper utility functions are formed with consideration of user satisfaction and mobility as well as the network performance, and then fused by the use of triangle module operator to select the candidate network with the highest trustworthy as the optimal access network. Simulation results demonstrate that the proposed CAC scheme can benefit both users and networks by handling the uncertainty and time-varying information appropriately on finally fuzzy decision.","PeriodicalId":337941,"journal":{"name":"International Conference on Fuzzy Systems and Knowledge Discovery","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122663421","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}
引用次数: 1
Application of 0-1 knapsack MPI + OpenMP hybrid programming algorithm at MH method 0-1背包MPI + OpenMP混合规划算法在MH方法中的应用
Pub Date : 2012-05-29 DOI: 10.1109/FSKD.2012.6234092
Lin Quan, Weichang Shen, J. Cui, Duan Geng
The paper aims at the problem that is 0–1 knapsack algorithm used to MH method, analyzes several kinds of method of the 0–1 knapsack, and puts forward the MPI + OpenMP optimal hybrid programming model which is used to this application. The experimental results show that the hybrid programming model is an effective method to solve this problem.
本文针对0-1背包算法应用于MH方法的问题,分析了0-1背包的几种方法,提出了用于该应用的MPI + OpenMP最优混合规划模型。实验结果表明,混合规划模型是解决这一问题的有效方法。
{"title":"Application of 0-1 knapsack MPI + OpenMP hybrid programming algorithm at MH method","authors":"Lin Quan, Weichang Shen, J. Cui, Duan Geng","doi":"10.1109/FSKD.2012.6234092","DOIUrl":"https://doi.org/10.1109/FSKD.2012.6234092","url":null,"abstract":"The paper aims at the problem that is 0–1 knapsack algorithm used to MH method, analyzes several kinds of method of the 0–1 knapsack, and puts forward the MPI + OpenMP optimal hybrid programming model which is used to this application. The experimental results show that the hybrid programming model is an effective method to solve this problem.","PeriodicalId":337941,"journal":{"name":"International Conference on Fuzzy Systems and Knowledge Discovery","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127658370","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}
引用次数: 1
The research on optimization method for dynamic reduct 动态约简优化方法的研究
Pub Date : 2012-05-29 DOI: 10.1109/FSKD.2012.6233767
Jia-yang Wang, Shuang-ying Xue, Sirui Chen
The paper analyses the deficiencies of traditional generalized dynamic reduct algorithm and proposes a fast algorithm based on the validity of reduct. The algorithm only needs to calculate part of the subtable to get the generalized dynamic reduct. It decreases the number of subtables that need to calculate the reduct by using the stability threshold, and filters the reduct of subtables that are not to be the generalized dynamic reduct by utilizing the optimal stability coefficient. The result shows that the fast method is more effective than the traditional algorithm.
分析了传统广义动态约简算法的不足,提出了一种基于约简有效性的快速算法。该算法只需计算部分子表即可得到广义动态约简。利用稳定性阈值减少需要计算约简的子表数量,利用最优稳定性系数过滤不需要进行广义动态约简的子表的约简。结果表明,该方法比传统算法更有效。
{"title":"The research on optimization method for dynamic reduct","authors":"Jia-yang Wang, Shuang-ying Xue, Sirui Chen","doi":"10.1109/FSKD.2012.6233767","DOIUrl":"https://doi.org/10.1109/FSKD.2012.6233767","url":null,"abstract":"The paper analyses the deficiencies of traditional generalized dynamic reduct algorithm and proposes a fast algorithm based on the validity of reduct. The algorithm only needs to calculate part of the subtable to get the generalized dynamic reduct. It decreases the number of subtables that need to calculate the reduct by using the stability threshold, and filters the reduct of subtables that are not to be the generalized dynamic reduct by utilizing the optimal stability coefficient. The result shows that the fast method is more effective than the traditional algorithm.","PeriodicalId":337941,"journal":{"name":"International Conference on Fuzzy Systems and Knowledge Discovery","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121395583","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}
引用次数: 1
Layered event ontology model 分层事件本体模型
Pub Date : 2012-05-29 DOI: 10.1109/FSKD.2012.6234237
Mei-li Huang, Zongtian Liu
Event plays an important role in the field of semantic understanding that associates entities. Although traditional ontology is an effective model to represent domain concept hierarchies and semantics, it simply considers event same as static concept or describes it as relationship. This paper proposes a layered event ontology model which emphasis on event and layered the traditional ontology by excluding events from concepts have the static characterization, describing them at different levels respectively, meanwhile tie them by element relationship. It finally suggests the method to construct layered event ontology from existent ontology which is under the traditional model, and provides an example to explain it.
事件在实体关联的语义理解中起着重要的作用。传统本体虽然是表示领域概念层次和语义的有效模型,但它将事件简单地视为静态概念或描述为关系。本文提出了一种以事件为重点的分层事件本体模型,将传统本体从概念中剔除,使其具有静态表征,在不同层次上分别进行描述,同时通过元素关系将其联系起来。最后提出了在传统模型下从已有的本体构造分层事件本体的方法,并给出了实例说明。
{"title":"Layered event ontology model","authors":"Mei-li Huang, Zongtian Liu","doi":"10.1109/FSKD.2012.6234237","DOIUrl":"https://doi.org/10.1109/FSKD.2012.6234237","url":null,"abstract":"Event plays an important role in the field of semantic understanding that associates entities. Although traditional ontology is an effective model to represent domain concept hierarchies and semantics, it simply considers event same as static concept or describes it as relationship. This paper proposes a layered event ontology model which emphasis on event and layered the traditional ontology by excluding events from concepts have the static characterization, describing them at different levels respectively, meanwhile tie them by element relationship. It finally suggests the method to construct layered event ontology from existent ontology which is under the traditional model, and provides an example to explain it.","PeriodicalId":337941,"journal":{"name":"International Conference on Fuzzy Systems and Knowledge Discovery","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114770134","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}
引用次数: 1
Research on complex network topology model based information warfare system 基于复杂网络拓扑模型的信息战系统研究
Pub Date : 2012-05-29 DOI: 10.1109/FSKD.2012.6234219
Su-Hong He, Lei Chen
The complex network theory provides the new ways to explore warfare law. The precondition of network-centric warfare is the construction of warfare network topology models. Studying the impact of network topology on military combat performance based on complex networks theory. A good warfare network needs small average path length, great cluster coefficient and scale-free degree distribution. The experimental results show that traditional tree network can not reflect the characteristics of the information warfare. We give some proposals to improve tree network and select random Apollonian network as the best representation of combat network.
复杂网络理论为研究战争规律提供了新的途径。网络中心战的前提是建立作战网络拓扑模型。基于复杂网络理论研究网络拓扑结构对军事作战性能的影响。一个好的作战网络需要较小的平均路径长度、较大的聚类系数和无标度分布。实验结果表明,传统的树状网络不能很好地反映信息战的特点。我们提出了一些改进树网络的建议,并选择随机Apollonian网络作为战斗网络的最佳代表。
{"title":"Research on complex network topology model based information warfare system","authors":"Su-Hong He, Lei Chen","doi":"10.1109/FSKD.2012.6234219","DOIUrl":"https://doi.org/10.1109/FSKD.2012.6234219","url":null,"abstract":"The complex network theory provides the new ways to explore warfare law. The precondition of network-centric warfare is the construction of warfare network topology models. Studying the impact of network topology on military combat performance based on complex networks theory. A good warfare network needs small average path length, great cluster coefficient and scale-free degree distribution. The experimental results show that traditional tree network can not reflect the characteristics of the information warfare. We give some proposals to improve tree network and select random Apollonian network as the best representation of combat network.","PeriodicalId":337941,"journal":{"name":"International Conference on Fuzzy Systems and Knowledge Discovery","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130105854","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}
引用次数: 3
期刊
International Conference on Fuzzy Systems and Knowledge Discovery
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1