This paper introduces an innovative approach to the synchronized demand-capacity balance with special focus on sector capacity uncertainty within a centrally controlled collaborative air traffic flow management(ATFM)f...This paper introduces an innovative approach to the synchronized demand-capacity balance with special focus on sector capacity uncertainty within a centrally controlled collaborative air traffic flow management(ATFM)framework.Further with previous study,the uncertainty in capacity is considered as a non-negligible issue regarding multiple reasons,like the impact of weather,the strike of air traffic controllers(ATCOs),the military use of airspace and the spatiotemporal distribution of nonscheduled flights,etc.These recessive factors affect the outcome of traffic flow optimization.In this research,the focus is placed on the impact of sector capacity uncertainty on demand and capacity balancing(DCB)optimization and ATFM,and multiple options,such as delay assignment and rerouting,are intended for regulating the traffic flow.A scenario optimization method for sector capacity in the presence of uncertainties is used to find the approximately optimal solution.The results show that the proposed approach can achieve better demand and capacity balancing and determine perfect integer solutions to ATFM problems,solving large-scale instances(24 h on seven capacity scenarios,with 6255 flights and 8949 trajectories)in 5-15 min.To the best of our knowledge,our experiment is the first to tackle large-scale instances of stochastic ATFM problems within the collaborative ATFM framework.展开更多
To solve the load balancing problem in a triplet-based hierarchical interconnection network（THIN） system, a dynamic load balancing （DLB）algorithm--THINDLBA, which adopts multicast tree （MT）technology to improve ...To solve the load balancing problem in a triplet-based hierarchical interconnection network（THIN） system, a dynamic load balancing （DLB）algorithm--THINDLBA, which adopts multicast tree （MT）technology to improve the efficiency of interchanging load information, is presented. To support the algorithm, a complete set of DLB messages and a schema of maintaining DLB information in each processing node are designed. The load migration request messages from the heavily loaded node （HLN）are spread along an MT whose root is the HLN. And the lightly loaded nodes（LLNs） covered by the MT are the candidate destinations of load migration; the load information interchanged between the LLNs and the HLN can be transmitted along the MT. So the HLN can migrate excess loads out as many as possible during a one time execution of the THINDLBA, and its load state can be improved as quickly as possible. To avoid wrongly transmitted or redundant DLB messages due to MT overlapping, the MT construction is restricted in the design of the THINDLBA. Through experiments, the effectiveness of four DLB algorithms are compared, and the results show that the THINDLBA can effectively decrease the time costs of THIN systems in dealing with large scale computeintensive tasks more than others.展开更多
To decrease the cost of exchanging load information among processors, a dynamic load-balancing （DLB） algorithm which adopts multieast tree technology is proposed. The muhieast tree construction rules are also propos...To decrease the cost of exchanging load information among processors, a dynamic load-balancing （DLB） algorithm which adopts multieast tree technology is proposed. The muhieast tree construction rules are also proposed to avoid wrongly transferred or redundant DLB messages due to the overlapping of multicast trees. The proposed DLB algorithm is distributed controlled, sender initiated and can help heavily loaded processors with complete distribution of redundant loads with minimum number of executions. Experiments were executed to compare the effects of the proposed DLB algorithm and other three ones, the results prove the effectivity and practicability of the proposed algorithm in dealing with great scale compute-intensive tasks.展开更多
The real problem in cluster of workstations is the changes in workstation power or number of workstations or dynmaic changes in the run time behavior of the application hamper the efficient use of resources. Dynamic l...The real problem in cluster of workstations is the changes in workstation power or number of workstations or dynmaic changes in the run time behavior of the application hamper the efficient use of resources. Dynamic load balancing is a technique for the parallel implementation of problems, which generate unpredictable workloads by migration work units from heavily loaded processor to lightly loaded processors at run time. This paper proposed an efficient load balancing method in which parallel tree computations depth first search (DFS) generates unpredictable, highly imbalance workloads and moves through different phases detectable at run time, where dynamic load balancing strategy is applicable in each phase running under the MPI(message passing interface) and Unix operating system on cluster of workstations parallel platform computing.展开更多
We prove that a random labeled (unlabeled) tree is balanced. We also prove that random labeled and unlabeled trees are strongly k-balanced for any k ≥ 3. Definition: Color the vertices ...We prove that a random labeled (unlabeled) tree is balanced. We also prove that random labeled and unlabeled trees are strongly k-balanced for any k ≥ 3. Definition: Color the vertices of graph G with two colors. Color an edge with the color of its endpoints if they are colored with the same color. Edges with different colored endpoints are left uncolored. G is said to be balanced if neither the number of vertices nor and the number of edges of the two different colors differs by more than one.展开更多
The rapid growth of interconnected high performance workstations has produced a new computing paradigm called clustered of workstations computing. In these systems load balance problem is a serious impediment to achie...The rapid growth of interconnected high performance workstations has produced a new computing paradigm called clustered of workstations computing. In these systems load balance problem is a serious impediment to achieve good performance. The main concern of this paper is the implementation of dynamic load balancing algorithm, asynchronous Round Robin (ARR), for balancing workload of parallel tree computation depth-first-search algorithm on Cluster of Heterogeneous Workstations (COW) Many algorithms in artificial intelligence and other areas of computer science are based on depth first search in implicitty defined trees. For these algorithms a load-balancing scheme is required, which is able to evenly distribute parts of an irregularly shaped tree over the workstations with minimal interprocessor communication and without prior knowledge of the tree’s shape. For the (ARR) algorithm only minimal interprocessor communication is needed when necessary and it runs under the MPI (Message passing interface) that allows parallel execution on heterogeneous SUN cluster of workstation platform. The program code is written in C language and executed under UNIX operating system (Solaris version).展开更多
To improve data distribution efficiency a load-balancing data distribution LBDD method is proposed in publish/subscribe mode.In the LBDD method subscribers are involved in distribution tasks and data transfers while r...To improve data distribution efficiency a load-balancing data distribution LBDD method is proposed in publish/subscribe mode.In the LBDD method subscribers are involved in distribution tasks and data transfers while receiving data themselves.A dissemination tree is constructed among the subscribers based on MD5 where the publisher acts as the root. The proposed method provides bucket construction target selection and path updates furthermore the property of one-way dissemination is proven.That the average out-going degree of a node is 2 is guaranteed with the proposed LBDD.The experiments on data distribution delay data distribution rate and load distribution are conducted. Experimental results show that the LBDD method aids in shaping the task load between the publisher and subscribers and outperforms the point-to-point approach.展开更多
Red Fuji apple trees of Zn-deficiency were used as material in the experiment. The effect of different Zn application methods on the regularity of Zn transportation and nutrition was studied. It was found that the sto...Red Fuji apple trees of Zn-deficiency were used as material in the experiment. The effect of different Zn application methods on the regularity of Zn transportation and nutrition was studied. It was found that the storage of Zn in the branches was greatly increased by foliar application of the solution of 15% ZnSO4·7H2O before abscission. It had advantage to keep suitable Zn content in leaves, branches and roots, as well as between Zn and P and K, which increased Zn transportation and reusability. Zn content in roots increased when Zn was used in soil in autumn. However, the absorbed Zn did not transport to the top of the plant. It was used by the plant next year. Foliar application of ZnSO4·7H2O at early stage of the plant growth enhanced Zn content of the branch. However, the effect was kept for a short time. It had little effect on Zn transportation when Zn was sprayed three weeks after blossoming.展开更多
Purpose： This study introduces an algorithm to construct tag trees that can be used as a userfriendly navigation tool for knowledge sharing and retrieval by solving two issues of previous studies, i.e. semantic drift...Purpose： This study introduces an algorithm to construct tag trees that can be used as a userfriendly navigation tool for knowledge sharing and retrieval by solving two issues of previous studies, i.e. semantic drift and structural skew.Design/methodology/approach： Inspired by the generality based methods, this study builds tag trees from a co-occurrence tag network and uses the h-degree as a node generality metric. The proposed algorithm is characterized by the following four features：（1） the ancestors should be more representative than the descendants,（2） the semantic meaning along the ancestor-descendant paths needs to be coherent,（3） the children of one parent are collectively exhaustive and mutually exclusive in describing their parent, and（4） tags are roughly evenly distributed to their upper-level parents to avoid structural skew. Findings： The proposed algorithm has been compared with a well-established solution Heymann Tag Tree（HTT）. The experimental results using a social tag dataset showed that the proposed algorithm with its default condition outperformed HTT in precision based on Open Directory Project（ODP） classification. It has been verified that h-degree can be applied as a better node generality metric compared with degree centrality.Research limitations： A thorough investigation into the evaluation methodology is needed, including user studies and a set of metrics for evaluating semantic coherence and navigation performance.Practical implications： The algorithm will benefit the use of digital resources by generating a flexible domain knowledge structure that is easy to navigate. It could be used to manage multiple resource collections even without social annotations since tags can be keywords created by authors or experts, as well as automatically extracted from text.Originality/value： Few previous studies paid attention to the issue of whether the tagging systems are easy to navigate for users. The contributions of this study are twofold：（1） an algorithm was developed to construct tag trees with consideration given to both semanticcoherence and structural balance and（2） the effectiveness of a node generality metric, h-degree, was investigated in a tag co-occurrence network.展开更多
文摘This paper introduces an innovative approach to the synchronized demand-capacity balance with special focus on sector capacity uncertainty within a centrally controlled collaborative air traffic flow management(ATFM)framework.Further with previous study,the uncertainty in capacity is considered as a non-negligible issue regarding multiple reasons,like the impact of weather,the strike of air traffic controllers(ATCOs),the military use of airspace and the spatiotemporal distribution of nonscheduled flights,etc.These recessive factors affect the outcome of traffic flow optimization.In this research,the focus is placed on the impact of sector capacity uncertainty on demand and capacity balancing(DCB)optimization and ATFM,and multiple options,such as delay assignment and rerouting,are intended for regulating the traffic flow.A scenario optimization method for sector capacity in the presence of uncertainties is used to find the approximately optimal solution.The results show that the proposed approach can achieve better demand and capacity balancing and determine perfect integer solutions to ATFM problems,solving large-scale instances(24 h on seven capacity scenarios,with 6255 flights and 8949 trajectories)in 5-15 min.To the best of our knowledge,our experiment is the first to tackle large-scale instances of stochastic ATFM problems within the collaborative ATFM framework.
基金The National Natural Science Foundation of China(No.69973007).
文摘To solve the load balancing problem in a triplet-based hierarchical interconnection network（THIN） system, a dynamic load balancing （DLB）algorithm--THINDLBA, which adopts multicast tree （MT）technology to improve the efficiency of interchanging load information, is presented. To support the algorithm, a complete set of DLB messages and a schema of maintaining DLB information in each processing node are designed. The load migration request messages from the heavily loaded node （HLN）are spread along an MT whose root is the HLN. And the lightly loaded nodes（LLNs） covered by the MT are the candidate destinations of load migration; the load information interchanged between the LLNs and the HLN can be transmitted along the MT. So the HLN can migrate excess loads out as many as possible during a one time execution of the THINDLBA, and its load state can be improved as quickly as possible. To avoid wrongly transmitted or redundant DLB messages due to MT overlapping, the MT construction is restricted in the design of the THINDLBA. Through experiments, the effectiveness of four DLB algorithms are compared, and the results show that the THINDLBA can effectively decrease the time costs of THIN systems in dealing with large scale computeintensive tasks more than others.
基金the National Natural Science Foundation of China(69973007)
文摘To decrease the cost of exchanging load information among processors, a dynamic load-balancing （DLB） algorithm which adopts multieast tree technology is proposed. The muhieast tree construction rules are also proposed to avoid wrongly transferred or redundant DLB messages due to the overlapping of multicast trees. The proposed DLB algorithm is distributed controlled, sender initiated and can help heavily loaded processors with complete distribution of redundant loads with minimum number of executions. Experiments were executed to compare the effects of the proposed DLB algorithm and other three ones, the results prove the effectivity and practicability of the proposed algorithm in dealing with great scale compute-intensive tasks.
基金Natural Science Foundation of China (No.60 173 0 3 1)
文摘The real problem in cluster of workstations is the changes in workstation power or number of workstations or dynmaic changes in the run time behavior of the application hamper the efficient use of resources. Dynamic load balancing is a technique for the parallel implementation of problems, which generate unpredictable workloads by migration work units from heavily loaded processor to lightly loaded processors at run time. This paper proposed an efficient load balancing method in which parallel tree computations depth first search (DFS) generates unpredictable, highly imbalance workloads and moves through different phases detectable at run time, where dynamic load balancing strategy is applicable in each phase running under the MPI(message passing interface) and Unix operating system on cluster of workstations parallel platform computing.
文摘We prove that a random labeled (unlabeled) tree is balanced. We also prove that random labeled and unlabeled trees are strongly k-balanced for any k ≥ 3. Definition: Color the vertices of graph G with two colors. Color an edge with the color of its endpoints if they are colored with the same color. Edges with different colored endpoints are left uncolored. G is said to be balanced if neither the number of vertices nor and the number of edges of the two different colors differs by more than one.
文摘The rapid growth of interconnected high performance workstations has produced a new computing paradigm called clustered of workstations computing. In these systems load balance problem is a serious impediment to achieve good performance. The main concern of this paper is the implementation of dynamic load balancing algorithm, asynchronous Round Robin (ARR), for balancing workload of parallel tree computation depth-first-search algorithm on Cluster of Heterogeneous Workstations (COW) Many algorithms in artificial intelligence and other areas of computer science are based on depth first search in implicitty defined trees. For these algorithms a load-balancing scheme is required, which is able to evenly distribute parts of an irregularly shaped tree over the workstations with minimal interprocessor communication and without prior knowledge of the tree’s shape. For the (ARR) algorithm only minimal interprocessor communication is needed when necessary and it runs under the MPI (Message passing interface) that allows parallel execution on heterogeneous SUN cluster of workstation platform. The program code is written in C language and executed under UNIX operating system (Solaris version).
基金The National Key Basic Research Program of China(973 Program)
文摘To improve data distribution efficiency a load-balancing data distribution LBDD method is proposed in publish/subscribe mode.In the LBDD method subscribers are involved in distribution tasks and data transfers while receiving data themselves.A dissemination tree is constructed among the subscribers based on MD5 where the publisher acts as the root. The proposed method provides bucket construction target selection and path updates furthermore the property of one-way dissemination is proven.That the average out-going degree of a node is 2 is guaranteed with the proposed LBDD.The experiments on data distribution delay data distribution rate and load distribution are conducted. Experimental results show that the LBDD method aids in shaping the task load between the publisher and subscribers and outperforms the point-to-point approach.
文摘Red Fuji apple trees of Zn-deficiency were used as material in the experiment. The effect of different Zn application methods on the regularity of Zn transportation and nutrition was studied. It was found that the storage of Zn in the branches was greatly increased by foliar application of the solution of 15% ZnSO4·7H2O before abscission. It had advantage to keep suitable Zn content in leaves, branches and roots, as well as between Zn and P and K, which increased Zn transportation and reusability. Zn content in roots increased when Zn was used in soil in autumn. However, the absorbed Zn did not transport to the top of the plant. It was used by the plant next year. Foliar application of ZnSO4·7H2O at early stage of the plant growth enhanced Zn content of the branch. However, the effect was kept for a short time. It had little effect on Zn transportation when Zn was sprayed three weeks after blossoming.
基金funded by the National Natural Science Foundation of China(Grand No.:70903008)supported by COGS Lab in School of Government,Beijing Normal University
文摘Purpose： This study introduces an algorithm to construct tag trees that can be used as a userfriendly navigation tool for knowledge sharing and retrieval by solving two issues of previous studies, i.e. semantic drift and structural skew.Design/methodology/approach： Inspired by the generality based methods, this study builds tag trees from a co-occurrence tag network and uses the h-degree as a node generality metric. The proposed algorithm is characterized by the following four features：（1） the ancestors should be more representative than the descendants,（2） the semantic meaning along the ancestor-descendant paths needs to be coherent,（3） the children of one parent are collectively exhaustive and mutually exclusive in describing their parent, and（4） tags are roughly evenly distributed to their upper-level parents to avoid structural skew. Findings： The proposed algorithm has been compared with a well-established solution Heymann Tag Tree（HTT）. The experimental results using a social tag dataset showed that the proposed algorithm with its default condition outperformed HTT in precision based on Open Directory Project（ODP） classification. It has been verified that h-degree can be applied as a better node generality metric compared with degree centrality.Research limitations： A thorough investigation into the evaluation methodology is needed, including user studies and a set of metrics for evaluating semantic coherence and navigation performance.Practical implications： The algorithm will benefit the use of digital resources by generating a flexible domain knowledge structure that is easy to navigate. It could be used to manage multiple resource collections even without social annotations since tags can be keywords created by authors or experts, as well as automatically extracted from text.Originality/value： Few previous studies paid attention to the issue of whether the tagging systems are easy to navigate for users. The contributions of this study are twofold：（1） an algorithm was developed to construct tag trees with consideration given to both semanticcoherence and structural balance and（2） the effectiveness of a node generality metric, h-degree, was investigated in a tag co-occurrence network.
