This paper presents an efficient algorithm for optimization of radial distribution systems by a network reconfiguration to balance feeder loads and eliminate overload conditions. The system load-balancing index is use...This paper presents an efficient algorithm for optimization of radial distribution systems by a network reconfiguration to balance feeder loads and eliminate overload conditions. The system load-balancing index is used to determine the loading conditions of the system and maximum system loading capacity. The index value has to be minimum in the optimal network reconfiguration of load balancing. The tabu search algorithm is employed to search for the optimal network reconfiguration. The basic idea behind the search is a move from a current solution to its neighborhood by effectively utilizing a memory to provide an efficient search for optimality. It presents low computational effort and is able to find good quality configurations. Simulation results for a radial 69-bus system. The study results show that the optimal on/off patterns of the switches can be identified to give the best network reconfiguration involving balancing of feeder loads while respecting all the constraints.展开更多
We study strong stability of Nash equilibria in load balancing games of m(m 2)identical servers,in which every job chooses one of the m servers and each job wishes to minimize its cost,given by the workload of the ser...We study strong stability of Nash equilibria in load balancing games of m(m 2)identical servers,in which every job chooses one of the m servers and each job wishes to minimize its cost,given by the workload of the server it chooses.A Nash equilibrium(NE)is a strategy profile that is resilient to unilateral deviations.Finding an NE in such a game is simple.However,an NE assignment is not stable against coordinated deviations of several jobs,while a strong Nash equilibrium(SNE)is.We study how well an NE approximates an SNE.Given any job assignment in a load balancing game,the improvement ratio(IR)of a deviation of a job is defined as the ratio between the pre-and post-deviation costs.An NE is said to be aρ-approximate SNE(ρ1)if there is no coalition of jobs such that each job of the coalition will have an IR more thanρfrom coordinated deviations of the coalition.While it is already known that NEs are the same as SNEs in the 2-server load balancing game,we prove that,in the m-server load balancing game for any given m 3,any NE is a(5/4)-approximate SNE,which together with the lower bound already established in the literature yields a tight approximation bound.This closes the final gap in the literature on the study of approximation of general NEs to SNEs in load balancing games.To establish our upper bound,we make a novel use of a graph-theoretic tool.展开更多
This paper proposes an ontology-driven discovering model for the geographical information services to improve their recall ratio and precision ratio. This model uses the geographical information service ontology. In t...This paper proposes an ontology-driven discovering model for the geographical information services to improve their recall ratio and precision ratio. This model uses the geographical information service ontology. In this paper, first we study the multilevel matching arithmetic of geographical information services. This arithmetic is used for filtering and matching the services in the service register center according to the similarity between services selected and services requested from the definition of the function similarity and credit standing similarity. The matching arithmetic, geographical information service ontology and semantic description constitute the discovering model. Finally, we test and analyze the model from the recall ratio, precision ratio, responsivity and load balance. The result indicates that the ontology-driven discovering model is excellent in recall ratio and precision ratio, and can maintain the dynamic load balance of service copy.展开更多
文摘This paper presents an efficient algorithm for optimization of radial distribution systems by a network reconfiguration to balance feeder loads and eliminate overload conditions. The system load-balancing index is used to determine the loading conditions of the system and maximum system loading capacity. The index value has to be minimum in the optimal network reconfiguration of load balancing. The tabu search algorithm is employed to search for the optimal network reconfiguration. The basic idea behind the search is a move from a current solution to its neighborhood by effectively utilizing a memory to provide an efficient search for optimality. It presents low computational effort and is able to find good quality configurations. Simulation results for a radial 69-bus system. The study results show that the optimal on/off patterns of the switches can be identified to give the best network reconfiguration involving balancing of feeder loads while respecting all the constraints.
基金supported by the Taishan Scholarship of the Government of Shandong Province of ChinaNational Natural Science Foundation of China (Grant No.11071142)Natural Science Foundation of Shandong Province of China (Grant No.ZR2010AM034)
文摘We study strong stability of Nash equilibria in load balancing games of m(m 2)identical servers,in which every job chooses one of the m servers and each job wishes to minimize its cost,given by the workload of the server it chooses.A Nash equilibrium(NE)is a strategy profile that is resilient to unilateral deviations.Finding an NE in such a game is simple.However,an NE assignment is not stable against coordinated deviations of several jobs,while a strong Nash equilibrium(SNE)is.We study how well an NE approximates an SNE.Given any job assignment in a load balancing game,the improvement ratio(IR)of a deviation of a job is defined as the ratio between the pre-and post-deviation costs.An NE is said to be aρ-approximate SNE(ρ1)if there is no coalition of jobs such that each job of the coalition will have an IR more thanρfrom coordinated deviations of the coalition.While it is already known that NEs are the same as SNEs in the 2-server load balancing game,we prove that,in the m-server load balancing game for any given m 3,any NE is a(5/4)-approximate SNE,which together with the lower bound already established in the literature yields a tight approximation bound.This closes the final gap in the literature on the study of approximation of general NEs to SNEs in load balancing games.To establish our upper bound,we make a novel use of a graph-theoretic tool.
基金Supported by the Degree Dissertation of Doctor Natural Science Innovation Foundation of Information Engineering University(2007)
文摘This paper proposes an ontology-driven discovering model for the geographical information services to improve their recall ratio and precision ratio. This model uses the geographical information service ontology. In this paper, first we study the multilevel matching arithmetic of geographical information services. This arithmetic is used for filtering and matching the services in the service register center according to the similarity between services selected and services requested from the definition of the function similarity and credit standing similarity. The matching arithmetic, geographical information service ontology and semantic description constitute the discovering model. Finally, we test and analyze the model from the recall ratio, precision ratio, responsivity and load balance. The result indicates that the ontology-driven discovering model is excellent in recall ratio and precision ratio, and can maintain the dynamic load balance of service copy.
