In this paper,we propose a novel adjustable multiple cross-hexagonal search(AMCHS) algorithm for fast block motion estimation. It employs adjustable multiple cross search patterns(AMCSP) in the first step and then use...In this paper,we propose a novel adjustable multiple cross-hexagonal search(AMCHS) algorithm for fast block motion estimation. It employs adjustable multiple cross search patterns(AMCSP) in the first step and then uses half-way-skip and half-way-stop technique to determine whether to employ two hexagonal search patterns(HSPs) subsequently. The AMCSP can be used to find small motion vectors efficiently while the HSPs can be used to find large ones accurately to ensure prediction quality. Simulation results showed that our proposed AMCHS achieves faster search speed,and provides better distortion performance than other popular fast search algorithms,such as CDS and CDHS.展开更多
The complexity of the physical demands of soccer requires the completion of a multi-component training programme. The development, planning, and implementation of such a programme are difficult due partly to the pract...The complexity of the physical demands of soccer requires the completion of a multi-component training programme. The development, planning, and implementation of such a programme are difficult due partly to the practical constraints related to the competitive schedule at the top level. The effective planning and organisation of training are therefore crucial to the effective delivery of the training stimulus for both individual players and the team. The aim of this article is to provide an overview of the principles of training that can be used to prepare players for the physical demands of soccer. Information relating to periodisation is supported by an outline of the strategies used to deliver the acute training stress in a soccer environment. The importance of monitoring to support the planning process is also reviewed.展开更多
In this paper,a local-learning algorithm for multi-agent is presented based on the fact that individual agent performs local perception and local interaction under group environment.As for in-dividual-learning,agent a...In this paper,a local-learning algorithm for multi-agent is presented based on the fact that individual agent performs local perception and local interaction under group environment.As for in-dividual-learning,agent adopts greedy strategy to maximize its reward when interacting with envi-ronment.In group-learning,local interaction takes place between each two agents.A local-learning algorithm to choose and modify agents' actions is proposed to improve the traditional Q-learning algorithm,respectively in the situations of zero-sum games and general-sum games with unique equi-librium or multi-equilibrium.And this local-learning algorithm is proved to be convergent and the computation complexity is lower than the Nash-Q.Additionally,through grid-game test,it is indicated that by using this local-learning algorithm,the local behaviors of agents can spread to globe.展开更多
Two Gaussian air quality dispersion models, the industrial source complex short-term model (ISCST3) with and without modification have been used to simulate the pollutant concentration distribution in urban areas base...Two Gaussian air quality dispersion models, the industrial source complex short-term model (ISCST3) with and without modification have been used to simulate the pollutant concentration distribution in urban areas based on the meteorological data and the emissions distribution of sulfur dioxide. The verified data show that the modified model is more accurate in the urban area of Shijiazhuang. Using the modified model predictions, the control strategies of sulfur dioxide in the urban area have been studied, and the result show that the second long-term (to 2010) strategy can mitigate air pollution significantly and maintain pollution levels within permissible limits.展开更多
Planning, as a task condition, is hypothesized to influence L2 test performance and thus test scores（Skehan, 1998）. This study investigates the effects of lengths of strategic planning time on L2 paired oral test pe...Planning, as a task condition, is hypothesized to influence L2 test performance and thus test scores（Skehan, 1998）. This study investigates the effects of lengths of strategic planning time on L2 paired oral test performance, moderated by L2 proficiency. It aims to determine whether differences in performance result from 0, 1, 2 or 3 minutes of planning time, and whether planning time and proficiency interactively affect performance. The participants were 72 Chinese EFL learners, divided into four groups, each performing the same dialogic task with 1 or 2 or 3 minute planning time or none. All speech recordings were rated by two trained raters, and the transcripts of the speech samples subjected to a discourse analysis, measuring fluency features of Rate A and Rate B, complexity features of syntactic complexity, syntactic variety and lexical variety, and accuracy features of error-free clauses and correct verb forms. Findings show a stable accuracy, higher fluency in the planned condition, and greater syntactic complexity when learners are given 3 minutes＇ planning time. No interaction is found between planning time and proficiency.展开更多
One of the fundamental problems in pinning control of complex networks is selecting appropriate pinning nodes, such that the whole system is controlled. This is particularly useful for complex networks with huge numbe...One of the fundamental problems in pinning control of complex networks is selecting appropriate pinning nodes, such that the whole system is controlled. This is particularly useful for complex networks with huge numbers of nodes. Recent research has yielded several pinning node selection strategies, which may be efficient. However, selecting a set of pinning nodes and identifying the nodes that should be selected first remain challenging problems. In this paper, we present a network control strategy based on left Perron vector. For directed networks where nodes have the same in-and out-degrees, there has so far been no effective pinning node selection strategy, but our method can find suitable nodes. Likewise, our method also performs well for undirected networks where the nodes have the same degree. In addition, we can derive the minimum set of pinning nodes and the order in which they should be selected for given coupling strengths. Our proofs of these results depend on the properties of non-negative matrices and M-matrices. Several examples show that this strategy can effectively select appropriate pinning nodes, and that it can achieve better results for both directed and undirected networks.展开更多
文摘In this paper,we propose a novel adjustable multiple cross-hexagonal search(AMCHS) algorithm for fast block motion estimation. It employs adjustable multiple cross search patterns(AMCSP) in the first step and then uses half-way-skip and half-way-stop technique to determine whether to employ two hexagonal search patterns(HSPs) subsequently. The AMCSP can be used to find small motion vectors efficiently while the HSPs can be used to find large ones accurately to ensure prediction quality. Simulation results showed that our proposed AMCHS achieves faster search speed,and provides better distortion performance than other popular fast search algorithms,such as CDS and CDHS.
文摘The complexity of the physical demands of soccer requires the completion of a multi-component training programme. The development, planning, and implementation of such a programme are difficult due partly to the practical constraints related to the competitive schedule at the top level. The effective planning and organisation of training are therefore crucial to the effective delivery of the training stimulus for both individual players and the team. The aim of this article is to provide an overview of the principles of training that can be used to prepare players for the physical demands of soccer. Information relating to periodisation is supported by an outline of the strategies used to deliver the acute training stress in a soccer environment. The importance of monitoring to support the planning process is also reviewed.
文摘In this paper,a local-learning algorithm for multi-agent is presented based on the fact that individual agent performs local perception and local interaction under group environment.As for in-dividual-learning,agent adopts greedy strategy to maximize its reward when interacting with envi-ronment.In group-learning,local interaction takes place between each two agents.A local-learning algorithm to choose and modify agents' actions is proposed to improve the traditional Q-learning algorithm,respectively in the situations of zero-sum games and general-sum games with unique equi-librium or multi-equilibrium.And this local-learning algorithm is proved to be convergent and the computation complexity is lower than the Nash-Q.Additionally,through grid-game test,it is indicated that by using this local-learning algorithm,the local behaviors of agents can spread to globe.
文摘Two Gaussian air quality dispersion models, the industrial source complex short-term model (ISCST3) with and without modification have been used to simulate the pollutant concentration distribution in urban areas based on the meteorological data and the emissions distribution of sulfur dioxide. The verified data show that the modified model is more accurate in the urban area of Shijiazhuang. Using the modified model predictions, the control strategies of sulfur dioxide in the urban area have been studied, and the result show that the second long-term (to 2010) strategy can mitigate air pollution significantly and maintain pollution levels within permissible limits.
基金part of a project funded by Humanities and Social Science Research Foundation of the Ministry of Education of China,project No:12YJC740101
文摘Planning, as a task condition, is hypothesized to influence L2 test performance and thus test scores（Skehan, 1998）. This study investigates the effects of lengths of strategic planning time on L2 paired oral test performance, moderated by L2 proficiency. It aims to determine whether differences in performance result from 0, 1, 2 or 3 minutes of planning time, and whether planning time and proficiency interactively affect performance. The participants were 72 Chinese EFL learners, divided into four groups, each performing the same dialogic task with 1 or 2 or 3 minute planning time or none. All speech recordings were rated by two trained raters, and the transcripts of the speech samples subjected to a discourse analysis, measuring fluency features of Rate A and Rate B, complexity features of syntactic complexity, syntactic variety and lexical variety, and accuracy features of error-free clauses and correct verb forms. Findings show a stable accuracy, higher fluency in the planned condition, and greater syntactic complexity when learners are given 3 minutes＇ planning time. No interaction is found between planning time and proficiency.
基金supported by the National Natural Science Foundation of China(Grant Nos.61573096,61374011,61833005)the China Postdoctoral Science Foundation(Grant No.2014M561557)+1 种基金the Shandong Province University Scientific Research Project of China(Grant No.J15LI12)the Postdoctoral Science Foundation of Jiangsu Province of China(Grant No.1402040B)
文摘One of the fundamental problems in pinning control of complex networks is selecting appropriate pinning nodes, such that the whole system is controlled. This is particularly useful for complex networks with huge numbers of nodes. Recent research has yielded several pinning node selection strategies, which may be efficient. However, selecting a set of pinning nodes and identifying the nodes that should be selected first remain challenging problems. In this paper, we present a network control strategy based on left Perron vector. For directed networks where nodes have the same in-and out-degrees, there has so far been no effective pinning node selection strategy, but our method can find suitable nodes. Likewise, our method also performs well for undirected networks where the nodes have the same degree. In addition, we can derive the minimum set of pinning nodes and the order in which they should be selected for given coupling strengths. Our proofs of these results depend on the properties of non-negative matrices and M-matrices. Several examples show that this strategy can effectively select appropriate pinning nodes, and that it can achieve better results for both directed and undirected networks.
