A practical transportation problem for finding the “departure” time at “all source nodes” in order to arrive at “some destination nodes” at specified time for both FIFO (i.e., First In First Out) and Non-FIFO “...A practical transportation problem for finding the “departure” time at “all source nodes” in order to arrive at “some destination nodes” at specified time for both FIFO (i.e., First In First Out) and Non-FIFO “Dynamic ” Networks is considered in this study. Although shortest path (SP) for dynamic networks have been studied/documented by various researchers, contributions from this present work consists of a sparse matrix storage scheme for efficiently storing large scale sparse network’s connectivity, a concept of Time Delay Factor (TDF) combining with a “general piece- wise linear function” to describe the link cost as a function of time for Non-FIFO links’ costs, and Backward Dijkstra SP Algorithm with simple heuristic rules for rejecting unwanted solutions during the backward search algorithm. Both small-scale (academic) networks as well as large- scale (real-life) networks are investigated in this work to explain and validate the proposed dynamic algorithms. Numerical results obtained from this research work have indicated that the newly proposed dynamic algorithm is reliable, and efficient. Based on the numerical results, the calculated departure time at the source node(s), for a given/specified arrival time at the destination node(s), can be non-unique, for some Non-FIFO networks’ connectivity.展开更多
By studying principles and methods related to early-warning model of plant diseases and using PSO method, parameter optimization was conducted to backward propagation neural network, and a pre-warning model for plant ...By studying principles and methods related to early-warning model of plant diseases and using PSO method, parameter optimization was conducted to backward propagation neural network, and a pre-warning model for plant diseases based on particle swarm and neural network algorithm was established. The test results showed that the construction of early-warning model is effective and feasible, which will provide a via- ble model structure to establish the effective early-warning platform.展开更多
In this article, we investigate Programming Evaluation and Review Technique networks with independently and generally distributed activity durations. For any path in this network, we select all the activities related ...In this article, we investigate Programming Evaluation and Review Technique networks with independently and generally distributed activity durations. For any path in this network, we select all the activities related to this path such that the completion time of the sub-network （only consisting of all the related activities） is equal to the completion time of this path. We use the elapsed time as the supplementary variables and model this sub-network as a Markov skeleton process, the state space is related to the subnetwork structure. Then use the backward equation to compute the distribution of the sub-network＇s completion time, which is an important rule in project management and scheduling.展开更多
<div style="text-align:justify;"> <span style="font-family:Verdana;">Sensitivity analysis of neural networks to input variation is an important research area as it goes some way to addr...<div style="text-align:justify;"> <span style="font-family:Verdana;">Sensitivity analysis of neural networks to input variation is an important research area as it goes some way to addressing the criticisms of their black-box behaviour. Such analysis of RBFNs for hydrological modelling has previously been limited to exploring perturbations to both inputs and connecting weights. In this paper, the backward chaining rule that has been used for sensitivity analysis of MLPs, is applied to RBFNs and it is shown how such analysis can provide insight into physical relationships. A trigonometric example is first presented to show the effectiveness and accuracy of this approach for first order derivatives alongside a comparison of the results with an equivalent MLP. The paper presents a real-world application in the modelling of river stage shows the importance of such approaches helping to justify and select such models.</span> </div>展开更多
文摘A practical transportation problem for finding the “departure” time at “all source nodes” in order to arrive at “some destination nodes” at specified time for both FIFO (i.e., First In First Out) and Non-FIFO “Dynamic ” Networks is considered in this study. Although shortest path (SP) for dynamic networks have been studied/documented by various researchers, contributions from this present work consists of a sparse matrix storage scheme for efficiently storing large scale sparse network’s connectivity, a concept of Time Delay Factor (TDF) combining with a “general piece- wise linear function” to describe the link cost as a function of time for Non-FIFO links’ costs, and Backward Dijkstra SP Algorithm with simple heuristic rules for rejecting unwanted solutions during the backward search algorithm. Both small-scale (academic) networks as well as large- scale (real-life) networks are investigated in this work to explain and validate the proposed dynamic algorithms. Numerical results obtained from this research work have indicated that the newly proposed dynamic algorithm is reliable, and efficient. Based on the numerical results, the calculated departure time at the source node(s), for a given/specified arrival time at the destination node(s), can be non-unique, for some Non-FIFO networks’ connectivity.
基金Supported by a Grant from the Science and Technology Project ofYunnan Province(2006NG02)~~
文摘By studying principles and methods related to early-warning model of plant diseases and using PSO method, parameter optimization was conducted to backward propagation neural network, and a pre-warning model for plant diseases based on particle swarm and neural network algorithm was established. The test results showed that the construction of early-warning model is effective and feasible, which will provide a via- ble model structure to establish the effective early-warning platform.
基金supported by the National Natural Science Foundation of China(10671212,10901164,90820302)the Graduate Research Innovation Projects in Hunan Province(CX2009B020)the Graduate Degree Thesis Innovation Foundation of Central Sourth University(2009ybfz11)
文摘In this article, we investigate Programming Evaluation and Review Technique networks with independently and generally distributed activity durations. For any path in this network, we select all the activities related to this path such that the completion time of the sub-network （only consisting of all the related activities） is equal to the completion time of this path. We use the elapsed time as the supplementary variables and model this sub-network as a Markov skeleton process, the state space is related to the subnetwork structure. Then use the backward equation to compute the distribution of the sub-network＇s completion time, which is an important rule in project management and scheduling.
文摘<div style="text-align:justify;"> <span style="font-family:Verdana;">Sensitivity analysis of neural networks to input variation is an important research area as it goes some way to addressing the criticisms of their black-box behaviour. Such analysis of RBFNs for hydrological modelling has previously been limited to exploring perturbations to both inputs and connecting weights. In this paper, the backward chaining rule that has been used for sensitivity analysis of MLPs, is applied to RBFNs and it is shown how such analysis can provide insight into physical relationships. A trigonometric example is first presented to show the effectiveness and accuracy of this approach for first order derivatives alongside a comparison of the results with an equivalent MLP. The paper presents a real-world application in the modelling of river stage shows the importance of such approaches helping to justify and select such models.</span> </div>
