Pub Date : 2014-04-09DOI: 10.4304/jnw.9.9.2279-2288
Lei Yang, Yifang Qin, Xu Zhou, Hongjia Li, S. Ci, Hui Tang
Recent advances in intelligent mobile terminal result in the rapid development of wireless mobile networks, which has inherently properties of high access time, low bandwidth and other shortcoming that pull down the Quality of Service (QoS). Cache technologies are considered as the most favorable tools for dealing with the problems of wireless traffic flow, having attracted tremendous interest from both the engineering and academic fields. However, most of the algorithms and tools developed are essentially based on descriptive models instead of predictive models, which are not capable of processing content traffic in the optimal way for wireless users with strong social characteristics. In this paper, a novel social relation based cache distribution policy is proposed, by which not only interaction among network users is used to detect the influential users among them, but also inherent friend relationships are used to predict desirable contents. These features are utilized to assist cache distribution among caching servers in advance for the purpose of serving the future needs of wireless mobile users. Evaluation analyzes the realistic network dataset, and the simulation results demonstrate the superior performance of the proposed optimization framework over existing systems
{"title":"Social Relation Based Cache Distribution Policy in Wireless Mobile Networks","authors":"Lei Yang, Yifang Qin, Xu Zhou, Hongjia Li, S. Ci, Hui Tang","doi":"10.4304/jnw.9.9.2279-2288","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2279-2288","url":null,"abstract":"Recent advances in intelligent mobile terminal result in the rapid development of wireless mobile networks, which has inherently properties of high access time, low bandwidth and other shortcoming that pull down the Quality of Service (QoS). Cache technologies are considered as the most favorable tools for dealing with the problems of wireless traffic flow, having attracted tremendous interest from both the engineering and academic fields. However, most of the algorithms and tools developed are essentially based on descriptive models instead of predictive models, which are not capable of processing content traffic in the optimal way for wireless users with strong social characteristics. In this paper, a novel social relation based cache distribution policy is proposed, by which not only interaction among network users is used to detect the influential users among them, but also inherent friend relationships are used to predict desirable contents. These features are utilized to assist cache distribution among caching servers in advance for the purpose of serving the future needs of wireless mobile users. Evaluation analyzes the realistic network dataset, and the simulation results demonstrate the superior performance of the proposed optimization framework over existing systems","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"9 1 1","pages":"2279-2288"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83408019","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 : 2014-04-09DOI: 10.4304/jnw.9.9.2353-2359
Jian Zhou, F. Yang, Ke Wang
The inverse shortest path problem is to minimize the modification on the edge weights such that a predetermined path becomes the shortest one from the origin to the destination with respect to the new edge weights. In this paper, the inverse shortest path problem is considered on a graph with uncertain edge weights. It is shown that the model of the uncertain inverse shortest path problem can be transformed into a deterministic counterpart and then be solved efficiently. A numerical example is presented as well for illustration.
{"title":"An Inverse Shortest Path Problem on an Uncertain Graph","authors":"Jian Zhou, F. Yang, Ke Wang","doi":"10.4304/jnw.9.9.2353-2359","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2353-2359","url":null,"abstract":"The inverse shortest path problem is to minimize the modification on the edge weights such that a predetermined path becomes the shortest one from the origin to the destination with respect to the new edge weights. In this paper, the inverse shortest path problem is considered on a graph with uncertain edge weights. It is shown that the model of the uncertain inverse shortest path problem can be transformed into a deterministic counterpart and then be solved efficiently. A numerical example is presented as well for illustration.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"69 1","pages":"2353-2359"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78960271","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 : 2014-04-09DOI: 10.4304/jnw.9.9.2490-2497
Hengshan Zong, Guozhu Jia, Feng Jin, Jili Kong
As the core of the production means of enterprises, knowledge has become the strategic resource of the supply chain. Through the knowledge sharing among the enterprises in the supply chain, the efficiency of knowledge innovation and application can be improved. In this paper, based on the state-of-the-art literature, the evolutionary game model of asymmetric upstream and downstream enterprises in the supply chain is built; the dynamic evolutionary process and the influencing factors of the selection of knowledge sharing strategies are analyzed. Based on those analysis, the results show that selecting knowledge sharing strategy in the upstream and downstream enterprises are affected by the factors: the cost coefficient of knowledge sharing, the risk coefficient of knowledge sharing, the gap between the amount of knowledge sharing of enterprises, which have negative correlation to selecting knowledge sharing strategy in the upstream and downstream enterprises; the coefficient of gains in social relationships, the synergistic effect coefficient of knowledge sharing, the incentive and punishment factor of knowledge sharing, which have positive correlation to selecting knowledge sharing strategy. On the basis of these factors, the concrete measures to promote knowledge sharing are put forward. This research has a positive significance for remodeling and strengthening the supply chain core advantages in the era of knowledge economy
{"title":"Evolutionary Game Analysis of Knowledge Sharing in Asymmetric Upstream and Downstream Enterprises of Supply Chain","authors":"Hengshan Zong, Guozhu Jia, Feng Jin, Jili Kong","doi":"10.4304/jnw.9.9.2490-2497","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2490-2497","url":null,"abstract":"As the core of the production means of enterprises, knowledge has become the strategic resource of the supply chain. Through the knowledge sharing among the enterprises in the supply chain, the efficiency of knowledge innovation and application can be improved. In this paper, based on the state-of-the-art literature, the evolutionary game model of asymmetric upstream and downstream enterprises in the supply chain is built; the dynamic evolutionary process and the influencing factors of the selection of knowledge sharing strategies are analyzed. Based on those analysis, the results show that selecting knowledge sharing strategy in the upstream and downstream enterprises are affected by the factors: the cost coefficient of knowledge sharing, the risk coefficient of knowledge sharing, the gap between the amount of knowledge sharing of enterprises, which have negative correlation to selecting knowledge sharing strategy in the upstream and downstream enterprises; the coefficient of gains in social relationships, the synergistic effect coefficient of knowledge sharing, the incentive and punishment factor of knowledge sharing, which have positive correlation to selecting knowledge sharing strategy. On the basis of these factors, the concrete measures to promote knowledge sharing are put forward. This research has a positive significance for remodeling and strengthening the supply chain core advantages in the era of knowledge economy","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"11 1","pages":"2490-2497"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87193375","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 : 2014-04-09DOI: 10.4304/jnw.9.9.2474-2481
Ningzhe Xing
Electric power communication requires two nodes in the network or cable period expires, the communication network as a whole is still can continue to run. Reliable power network can provide reliable operation of electric power for dispatching communication security. Due to many key network nodes external connectivity in the electric power, communication network has only one path, so once the link damage because of emergencies, these networks because of the failure of nodes (or communication link) and power operation scheduling of exception can occur easily, thus to cause great damage to the safe operation of the whole power network. In order to improve the robustness of system in this case, this paper designed a new optimization algorithm based on the equivalent network to simplify the real network and the network analysis. This paper studies the nature of circular web spider's webs and predator characteristics, analysis of the structure characteristics of the orb web and information transfer mechanism, which constructs the network topology model of single and double artificially cobweb; all terminal reliability of the factor theorem analysis of single-layer artificial spider network topology, analysis results show that, compared with the network topology artificial spider web structure and the traditional star network, ring network, double loop network and star network, with better all terminal reliability and stronger survivability
{"title":"Optimization Algorithm of Power Communication Network Based on the Equivalent Network","authors":"Ningzhe Xing","doi":"10.4304/jnw.9.9.2474-2481","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2474-2481","url":null,"abstract":"Electric power communication requires two nodes in the network or cable period expires, the communication network as a whole is still can continue to run. Reliable power network can provide reliable operation of electric power for dispatching communication security. Due to many key network nodes external connectivity in the electric power, communication network has only one path, so once the link damage because of emergencies, these networks because of the failure of nodes (or communication link) and power operation scheduling of exception can occur easily, thus to cause great damage to the safe operation of the whole power network. In order to improve the robustness of system in this case, this paper designed a new optimization algorithm based on the equivalent network to simplify the real network and the network analysis. This paper studies the nature of circular web spider's webs and predator characteristics, analysis of the structure characteristics of the orb web and information transfer mechanism, which constructs the network topology model of single and double artificially cobweb; all terminal reliability of the factor theorem analysis of single-layer artificial spider network topology, analysis results show that, compared with the network topology artificial spider web structure and the traditional star network, ring network, double loop network and star network, with better all terminal reliability and stronger survivability","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"10 1","pages":"2474-2481"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87774996","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 : 2014-04-09DOI: 10.4304/jnw.9.9.2521-2528
Hui Hu, Zhongxiao Hao, Pengfei Guo, Xilong Qu
The paper proposes a new output feedback tracking controller using neural network (NN) for a class of SISO strict-feedback nonlinear systems that only the output variables can be measured. The distinguished aspect of the controller is that no backstepping design is employed, and the strict-feedback systems could be transformed into the standard affine form. The gains of observer and controller are simultaneously tuned according to output tracking error based on non-separation principle design. With the universal approximation property of NN and the simultaneous parametrisation, no Lipschitz assumption and SPR condition are employed which makes the system construct simple. The proposed neural network controller can guarantee that output tracking error and all the states in the closed-loop system are the semi-globally ultimately bounded by Lyapunov approach. Finally the simulation results are used to demonstrate the effectiveness of the control scheme.
{"title":"Output Feedback Tracking Control Based on Neural Network for a Class of SISO Strict Feedback Nonlinear Systems","authors":"Hui Hu, Zhongxiao Hao, Pengfei Guo, Xilong Qu","doi":"10.4304/jnw.9.9.2521-2528","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2521-2528","url":null,"abstract":"The paper proposes a new output feedback tracking controller using neural network (NN) for a class of SISO strict-feedback nonlinear systems that only the output variables can be measured. The distinguished aspect of the controller is that no backstepping design is employed, and the strict-feedback systems could be transformed into the standard affine form. The gains of observer and controller are simultaneously tuned according to output tracking error based on non-separation principle design. With the universal approximation property of NN and the simultaneous parametrisation, no Lipschitz assumption and SPR condition are employed which makes the system construct simple. The proposed neural network controller can guarantee that output tracking error and all the states in the closed-loop system are the semi-globally ultimately bounded by Lyapunov approach. Finally the simulation results are used to demonstrate the effectiveness of the control scheme.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"32 1","pages":"2521-2528"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81084235","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 : 2014-04-09DOI: 10.4304/jnw.9.9.2456-2461
Yajun Hou
With the rapid development of computer technique in the past decades, the emergence of P2P techniqueprompts the network computing model evolving from centralized network to distributed network. Although P2P technique has brought tremendous changes to the network technique, P2P technique also exposes a lot of problems during its implementation. If we can manage the P2P network traffic effectively,e.g. identifies and controls its traffic and distinguishes its services, then it will make great sense for research on improving the performance of network service and use efficiency. However,the traditional approaches have shown a great lack of adaptability in dealing with samples which contain heterogeneous information.large scale of samples,unnormalizeddata or uneven data distributed in high dimensional feature space. This paper is based on therelated researches, to overcomethe limitations and shortcomings of current network traffic identification; we explored network traffic identification and came up with an approach of network traffic identification based on random forest. This paper uses campus network of North China University of Water Resources and Electric Power and takes its outlet flow as sample data to experiment. The result shows that random forest is suitable for large scale of data situation, complex dimensional situation, data contain lots of heterogeneous information etc. Additionally, random forest algorithm provide broad application prospects and rich design ideas for machine learning in feature extraction, multiple class object detection and pattern recognition fields
{"title":"P2P Network Traffic Identification Based on Random Forest Algorithm","authors":"Yajun Hou","doi":"10.4304/jnw.9.9.2456-2461","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2456-2461","url":null,"abstract":"With the rapid development of computer technique in the past decades, the emergence of P2P techniqueprompts the network computing model evolving from centralized network to distributed network. Although P2P technique has brought tremendous changes to the network technique, P2P technique also exposes a lot of problems during its implementation. If we can manage the P2P network traffic effectively,e.g. identifies and controls its traffic and distinguishes its services, then it will make great sense for research on improving the performance of network service and use efficiency. However,the traditional approaches have shown a great lack of adaptability in dealing with samples which contain heterogeneous information.large scale of samples,unnormalizeddata or uneven data distributed in high dimensional feature space. This paper is based on therelated researches, to overcomethe limitations and shortcomings of current network traffic identification; we explored network traffic identification and came up with an approach of network traffic identification based on random forest. This paper uses campus network of North China University of Water Resources and Electric Power and takes its outlet flow as sample data to experiment. The result shows that random forest is suitable for large scale of data situation, complex dimensional situation, data contain lots of heterogeneous information etc. Additionally, random forest algorithm provide broad application prospects and rich design ideas for machine learning in feature extraction, multiple class object detection and pattern recognition fields","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"28 1","pages":"2456-2461"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87405323","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 : 2014-04-09DOI: 10.4304/jnw.9.9.2482-2489
Hongdong Zhang, Yuli Song
Wireless sensor network (WSN) is composed of a large number of sensor nodes, it can real-time monitor and collect various information of monitored objects and passed to the user for analysis and use. This paper studies and designs a hierarchical WSN network management architecture and communication model, focus on the wireless sensor network topology control mechanism and based on the analysis of the existing hierarchical topology control algorithms. On the introduction of node load, the judgment method and the backup cluster head, design a load balancing topology control algorithm, the cluster management WSN, effectively balance the node energy consumption, reducing the number of network clusters, and the cluster head failure. Design of WSN network management protocol has a simple data type, operation type and the format of the message level HWSNMP, the improved MER protocol code to PDU code, the coded data length ratio after using the BER code length is reduced by 10%. Based on the hierarchical structure as the research object and energy-saving topology, a comprehensive analysis of the LEACH algorithm in layered structures (physical model, algorithm), and compares the advantages and disadvantages and the existing typical algorithms based on LEACH, the cluster algorithm based on node energy balance, balance the node energy consumption to meet the clusters in the theory history
{"title":"Study on the Survival of Wireless Sensor Networks Based on Hierarchical Topology Control Method","authors":"Hongdong Zhang, Yuli Song","doi":"10.4304/jnw.9.9.2482-2489","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2482-2489","url":null,"abstract":"Wireless sensor network (WSN) is composed of a large number of sensor nodes, it can real-time monitor and collect various information of monitored objects and passed to the user for analysis and use. This paper studies and designs a hierarchical WSN network management architecture and communication model, focus on the wireless sensor network topology control mechanism and based on the analysis of the existing hierarchical topology control algorithms. On the introduction of node load, the judgment method and the backup cluster head, design a load balancing topology control algorithm, the cluster management WSN, effectively balance the node energy consumption, reducing the number of network clusters, and the cluster head failure. Design of WSN network management protocol has a simple data type, operation type and the format of the message level HWSNMP, the improved MER protocol code to PDU code, the coded data length ratio after using the BER code length is reduced by 10%. Based on the hierarchical structure as the research object and energy-saving topology, a comprehensive analysis of the LEACH algorithm in layered structures (physical model, algorithm), and compares the advantages and disadvantages and the existing typical algorithms based on LEACH, the cluster algorithm based on node energy balance, balance the node energy consumption to meet the clusters in the theory history","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"1 1","pages":"2482-2489"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88323142","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 increased focus on Internet privacy, especially after the exposure of PRISM(an Internet surveillance program), anonymous communication have been getting more and more attentions. One of the most widely used anonymous communication systems is I2P(Invisible Internet Project). And as opposed to Tor’s(another popular anonymous communication system) directory-based approach, which provides a centralized directory server to manage the overall ‘view’ of the network, I2P is fully distributed and self organizing, which aims to avoid attackers’ enumeration of all I2P’s routers. In this paper, based on I2P’s operating mechanism, we presented two passive and two active methods to discover I2P routers. In a more than two week’s collecting experiment, about 25640 routers were discovered everyday, which turned out to be an almost full coverage(94.9%) of the I2P network compared with the data announced on the official website [1]. And based on the routers collected, this paper further made a preliminary analysis of both the I2P network’s overall status and its security. The result showed that I2P is a well structured P2P network, while some powerful attackers operating several routers are still possible to perform compromise attack to break I2P users’ anonymity given the current I2P’s security mechanism. Finally, this paper discussed some countermeasures to improve the security of the I2P network.
{"title":"Empirical Measurement and Analysis of I2P Routers","authors":"Peipeng Liu, Lihong Wang, Qingfeng Tan, Quangang Li, Xuebin Wang, Jinqiao Shi","doi":"10.4304/jnw.9.9.2269-2278","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2269-2278","url":null,"abstract":"With the increased focus on Internet privacy, especially after the exposure of PRISM(an Internet surveillance program), anonymous communication have been getting more and more attentions. One of the most widely used anonymous communication systems is I2P(Invisible Internet Project). And as opposed to Tor’s(another popular anonymous communication system) directory-based approach, which provides a centralized directory server to manage the overall ‘view’ of the network, I2P is fully distributed and self organizing, which aims to avoid attackers’ enumeration of all I2P’s routers. In this paper, based on I2P’s operating mechanism, we presented two passive and two active methods to discover I2P routers. In a more than two week’s collecting experiment, about 25640 routers were discovered everyday, which turned out to be an almost full coverage(94.9%) of the I2P network compared with the data announced on the official website [1]. And based on the routers collected, this paper further made a preliminary analysis of both the I2P network’s overall status and its security. The result showed that I2P is a well structured P2P network, while some powerful attackers operating several routers are still possible to perform compromise attack to break I2P users’ anonymity given the current I2P’s security mechanism. Finally, this paper discussed some countermeasures to improve the security of the I2P network.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"12 1","pages":"2269-2278"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81722786","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 : 2014-04-09DOI: 10.4304/jnw.9.9.2556-2566
Kete Wang, Lisheng Wang, Xinkao Liao, George Albert
The emerging multi-core processor architecture has greatly escalated scientific computing, but, at the same time, made parallel programming increasingly complex and challenging. In this paper, the use of the Auto Parallel Classification (APC) model in an Object-Oriented Parallel Model (OOPModel) environment is demonstrated. A designed module provides a traversal and a reduction of the DAG task graph. The parallel characteristics vectors, which are analyzed according to Naive Bayesian classification theory, are critical parameters for matching and generating parallel design patterns and various skeletal frameworks. Through extensive experimentation, it is demonstrated, that by using the Map-Reduce pattern to develop a minimum-sort algorithm, in conjunction with the APC model, we can achieve a reduction in the complexity of parallel programming and the minimization of errors. Most importantly, through scientific experimentation, this document will further demonstrate that correct computational results and movements toward linear speed-up can be accomplished.
{"title":"An Auto-Matching Model with Pattern Recognition Using Bayesian Classifier for Parallel Programming on A Multi-Core Processor","authors":"Kete Wang, Lisheng Wang, Xinkao Liao, George Albert","doi":"10.4304/jnw.9.9.2556-2566","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2556-2566","url":null,"abstract":"The emerging multi-core processor architecture has greatly escalated scientific computing, but, at the same time, made parallel programming increasingly complex and challenging. In this paper, the use of the Auto Parallel Classification (APC) model in an Object-Oriented Parallel Model (OOPModel) environment is demonstrated. A designed module provides a traversal and a reduction of the DAG task graph. The parallel characteristics vectors, which are analyzed according to Naive Bayesian classification theory, are critical parameters for matching and generating parallel design patterns and various skeletal frameworks. Through extensive experimentation, it is demonstrated, that by using the Map-Reduce pattern to develop a minimum-sort algorithm, in conjunction with the APC model, we can achieve a reduction in the complexity of parallel programming and the minimization of errors. Most importantly, through scientific experimentation, this document will further demonstrate that correct computational results and movements toward linear speed-up can be accomplished.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"33 1","pages":"2556-2566"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87908043","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 : 2014-04-09DOI: 10.4304/jnw.9.9.2529-2535
Yu Liu, Shihong Chen, Yunhua Wang
with the ability to assist people to make reasonable decisions in an emergency, scenario-response paradigm has been widely regarded as one of the most effective emergency management models. In order to promote the processing capacity of scenario information for Emergency Response System (ERS), a new kind of scenario ontology is proposed in this paper. Following the well-known modeling primitives, the scenario ontology is constructed on the basis of PROTON (Proto Ontology), the reference layer ontology of FactForge that includes some central datasets of Linked Open Data (LOD). The event module, scenario module and mitigation module comprise the core level scenario ontology, defined with some core concepts and relations, which can be reused in the domain level scenario ontology. Considering earthquake is a representative emergency, we analyze the scenario information required by decision makers in some earthquakes, and design the scenario ontology of earthquake as an example in the domain level scenario ontologies. To show the validity of the scenario ontology, we implement the scenario ontology of earthquake with Protege and develop a prototype system, which can retrieve some parts of scenario information from FactForge and provide a visualization interface for decision makers to browse the scenario instances involved in an earthquake
{"title":"SOFERS: Scenario Ontology for Emergency Response System","authors":"Yu Liu, Shihong Chen, Yunhua Wang","doi":"10.4304/jnw.9.9.2529-2535","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2529-2535","url":null,"abstract":"with the ability to assist people to make reasonable decisions in an emergency, scenario-response paradigm has been widely regarded as one of the most effective emergency management models. In order to promote the processing capacity of scenario information for Emergency Response System (ERS), a new kind of scenario ontology is proposed in this paper. Following the well-known modeling primitives, the scenario ontology is constructed on the basis of PROTON (Proto Ontology), the reference layer ontology of FactForge that includes some central datasets of Linked Open Data (LOD). The event module, scenario module and mitigation module comprise the core level scenario ontology, defined with some core concepts and relations, which can be reused in the domain level scenario ontology. Considering earthquake is a representative emergency, we analyze the scenario information required by decision makers in some earthquakes, and design the scenario ontology of earthquake as an example in the domain level scenario ontologies. To show the validity of the scenario ontology, we implement the scenario ontology of earthquake with Protege and develop a prototype system, which can retrieve some parts of scenario information from FactForge and provide a visualization interface for decision makers to browse the scenario instances involved in an earthquake","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"16 1","pages":"2529-2535"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79007679","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
扫码关注我们
求助内容：
应助结果提醒方式：