Diurnal and semi-diurnal tides in the Taiwan Strait and its adjacent areas are calculated by using a two-dimensional finite-difference model. Compared with data of more than 20 observation stations around the Taiwan S...Diurnal and semi-diurnal tides in the Taiwan Strait and its adjacent areas are calculated by using a two-dimensional finite-difference model. Compared with data of more than 20 observation stations around the Taiwan Strait, the model-produced results agree quite well with those of previous researches using observational data from coastal tidal gauge stations. According to the results, the co-tidal and co-range charts are given. Furthermore, the characteristics of 8 major tidal constituents have been uminated respectively. The result shows that： （1） The tide motion can be attributed to the interaction between the degenerative rotary tidal system in the north and the progressive tidal system in the south. （2） The southward and northward tidal waves of semi-diurnal tide converge in the middle of the Taiwan Strait while the diurnal tidal waves propagate southwestward through the Taiwan Strait and the Luzon Strait. （3） The maximum amplitude of semi-diurnal tides exists at the area between the Meizhou Bay and Xinghua Bay, and that of diurnal tides appears in the region to the east of the Leizhou Peninsula, （4） The patterns of co-tidal and co-range charts of N2, K2 and P1, Q1 tidal constituents are similar to those of M2, S2 and K1 O1 tidat constituents, respectively展开更多
The main objective of this paper is to propose a two-phase solution algorithm for solving the Inventory Routing Problem with Time Windows （IRPTW）, which has not been excessively researched in the literature. The sol...The main objective of this paper is to propose a two-phase solution algorithm for solving the Inventory Routing Problem with Time Windows （IRPTW）, which has not been excessively researched in the literature. The solution approach is based on （a） a simple simulation for the planning phase （Phase I） and （b） the Variable Neighborhood Search Algorithm （VNS） for the routing phase （Phase II）. Testing instances are established to investigate algorithmic performance, and the computational results are then reported. The computational study underscores the importance of integrating the inventory and vehicle routing decisions. Graphical presentation formats are provided to convey meaningful insights into the problem.展开更多
In this paper, we present an acceleration strategy for Smoothed Particle Hydrodynamics （SPH） on multi-GPU platform. For single-GPU, we first use a neighborhood search algorithm of compacting cell index combined with...In this paper, we present an acceleration strategy for Smoothed Particle Hydrodynamics （SPH） on multi-GPU platform. For single-GPU, we first use a neighborhood search algorithm of compacting cell index combined with spatial domain characteristics For multi-GPU, we focus on the changing patterns of SPH＇s computational time. Simple dynamic load balancing algorithm works well because the computational time of each time step changes slowly compared to previous time step. By further optimizing dynamic load balancing algorithm and the communication strategy among GPUs, a nearly linear speedup is achieved in different scenarios with a scale of millions particles. The quality and efficiency of our methods are demonstrated using multiple scenes with different particle numbers.展开更多
基金supported by the National Natural Science Foundation of China under contract Nos. 40576015, 40810069004 and 40821063by the key research project of Fujian Province under contract No. 2004N203by the Fujian demonstrating region of the "863" Project of the Ministry of Science and Technology of China
文摘Diurnal and semi-diurnal tides in the Taiwan Strait and its adjacent areas are calculated by using a two-dimensional finite-difference model. Compared with data of more than 20 observation stations around the Taiwan Strait, the model-produced results agree quite well with those of previous researches using observational data from coastal tidal gauge stations. According to the results, the co-tidal and co-range charts are given. Furthermore, the characteristics of 8 major tidal constituents have been uminated respectively. The result shows that： （1） The tide motion can be attributed to the interaction between the degenerative rotary tidal system in the north and the progressive tidal system in the south. （2） The southward and northward tidal waves of semi-diurnal tide converge in the middle of the Taiwan Strait while the diurnal tidal waves propagate southwestward through the Taiwan Strait and the Luzon Strait. （3） The maximum amplitude of semi-diurnal tides exists at the area between the Meizhou Bay and Xinghua Bay, and that of diurnal tides appears in the region to the east of the Leizhou Peninsula, （4） The patterns of co-tidal and co-range charts of N2, K2 and P1, Q1 tidal constituents are similar to those of M2, S2 and K1 O1 tidat constituents, respectively
文摘The main objective of this paper is to propose a two-phase solution algorithm for solving the Inventory Routing Problem with Time Windows （IRPTW）, which has not been excessively researched in the literature. The solution approach is based on （a） a simple simulation for the planning phase （Phase I） and （b） the Variable Neighborhood Search Algorithm （VNS） for the routing phase （Phase II）. Testing instances are established to investigate algorithmic performance, and the computational results are then reported. The computational study underscores the importance of integrating the inventory and vehicle routing decisions. Graphical presentation formats are provided to convey meaningful insights into the problem.
文摘In this paper, we present an acceleration strategy for Smoothed Particle Hydrodynamics （SPH） on multi-GPU platform. For single-GPU, we first use a neighborhood search algorithm of compacting cell index combined with spatial domain characteristics For multi-GPU, we focus on the changing patterns of SPH＇s computational time. Simple dynamic load balancing algorithm works well because the computational time of each time step changes slowly compared to previous time step. By further optimizing dynamic load balancing algorithm and the communication strategy among GPUs, a nearly linear speedup is achieved in different scenarios with a scale of millions particles. The quality and efficiency of our methods are demonstrated using multiple scenes with different particle numbers.
