A simple and effective image inpainting method is proposed in this paper, which is proved to be suitable for different kinds of target regions with shapes from little scraps to large unseemly objects in a wide range o...A simple and effective image inpainting method is proposed in this paper, which is proved to be suitable for different kinds of target regions with shapes from little scraps to large unseemly objects in a wide range of images. It is an important improvement upon the traditional image inpainting techniques. By introducing a new bijeetive-mapping term into the matching cost function, the artificial repetition problem in the final inpainting image is practically solved. In addition, by adopting an inpainting error map, not only the target pixels are refined gradually during the inpainting process but also the overlapped target patches are combined more seamlessly than previous method. Finally, the inpainting time is dramatically decreased by using a new acceleration method in the matching process.展开更多
This paper considers an efficient priority service model with two-level-polling scheme which the message packets conform to the discrete-time Geom/G/1 queue with multiple vacations and bulk arrival. By the embedded Ma...This paper considers an efficient priority service model with two-level-polling scheme which the message packets conform to the discrete-time Geom/G/1 queue with multiple vacations and bulk arrival. By the embedded Markov chain theory and the probability generating function method, we set up the mathematics functions and give closed form expressions for obtaining the mean cyclic period （MCP）, the mean queue length （MQL） and the mean waiting time （MWT） characteristics, the analytical results are also verified through extensive computer simulations. The performance analysis reveals that this priority polling scheme can gives better efficiency as well as impartiality in terms of system characteristics, and it can be used for differentiating priority service to guarantee better QoS and system stability in design and improvement of MAC protocol.展开更多
This paper provides a mathematical model for Three Gorges-Gezhou dam co-scheduling problem, based on full analysis of Three Corges-Gezhou dam＇s actual needs, to maximize the total throughput of Three Gorges-Cezhou da...This paper provides a mathematical model for Three Gorges-Gezhou dam co-scheduling problem, based on full analysis of Three Corges-Gezhou dam＇s actual needs, to maximize the total throughput of Three Gorges-Cezhou dam and the utilization ratio of shiplock area and minimize the total navigation shiplock waiting time under multiple constraints. This paper proposes a series queuing network （SQN） scheduling algorithm to divide the total ships that intend to pass through the shiplocks into four queues and calculate dynamically the weight of priority for each ship. The SQN scheduling algorithm schedules ships according to their priority weights which is determined by the characteristics of each ship, such as length, width, affiliation, waiting time, and so on. In the process, the operation conditions of Gezhou dam related to the navigable shiplocks and the task balancing among different shiplocks also should be considered. The SQN algorithm schedules ships circularly and optimizes the results step by step. Real operation data from our project shows that our SQN scheduling algorithm outperforms the traditional manual scheduling in which the less computational time is taken, the area utilization ratio of the five shiplocks is increased, the waiting time of high-prioritized ships is shorten, and a better balanced and alternating run-mode is provided for the three shiplocks in the Gezhou dam.展开更多
基金Supported by the National Natural Science Foundation of China （No. 60403044, No. 60373070） and partly funded by Microsoft Research Asia： Project 2004-Image-01.
文摘A simple and effective image inpainting method is proposed in this paper, which is proved to be suitable for different kinds of target regions with shapes from little scraps to large unseemly objects in a wide range of images. It is an important improvement upon the traditional image inpainting techniques. By introducing a new bijeetive-mapping term into the matching cost function, the artificial repetition problem in the final inpainting image is practically solved. In addition, by adopting an inpainting error map, not only the target pixels are refined gradually during the inpainting process but also the overlapped target patches are combined more seamlessly than previous method. Finally, the inpainting time is dramatically decreased by using a new acceleration method in the matching process.
基金Supported by the National Natural Science Foundation of China （No. 69862001, F0424104, 60362001 and 61072079）.
文摘This paper considers an efficient priority service model with two-level-polling scheme which the message packets conform to the discrete-time Geom/G/1 queue with multiple vacations and bulk arrival. By the embedded Markov chain theory and the probability generating function method, we set up the mathematics functions and give closed form expressions for obtaining the mean cyclic period （MCP）, the mean queue length （MQL） and the mean waiting time （MWT） characteristics, the analytical results are also verified through extensive computer simulations. The performance analysis reveals that this priority polling scheme can gives better efficiency as well as impartiality in terms of system characteristics, and it can be used for differentiating priority service to guarantee better QoS and system stability in design and improvement of MAC protocol.
基金supported by the National Natural Science Foundation of China under Grant No. 60904074the Natural Science Foundation of Hubei Province of China under Grant No. 2008CDB012the Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No. 200804871150
文摘This paper provides a mathematical model for Three Gorges-Gezhou dam co-scheduling problem, based on full analysis of Three Corges-Gezhou dam＇s actual needs, to maximize the total throughput of Three Gorges-Cezhou dam and the utilization ratio of shiplock area and minimize the total navigation shiplock waiting time under multiple constraints. This paper proposes a series queuing network （SQN） scheduling algorithm to divide the total ships that intend to pass through the shiplocks into four queues and calculate dynamically the weight of priority for each ship. The SQN scheduling algorithm schedules ships according to their priority weights which is determined by the characteristics of each ship, such as length, width, affiliation, waiting time, and so on. In the process, the operation conditions of Gezhou dam related to the navigable shiplocks and the task balancing among different shiplocks also should be considered. The SQN algorithm schedules ships circularly and optimizes the results step by step. Real operation data from our project shows that our SQN scheduling algorithm outperforms the traditional manual scheduling in which the less computational time is taken, the area utilization ratio of the five shiplocks is increased, the waiting time of high-prioritized ships is shorten, and a better balanced and alternating run-mode is provided for the three shiplocks in the Gezhou dam.
