On an Invariant of Tournament Digraphs

To date, it is unknown whether it is possible to construct a complete graph invariant in polynomial time, so fast algorithms for checking non-isomorphism are important, including heuristic algorithms, and for successful implementations of such heuristics, both the tasks of some modification of previously described graph invariants and the description of new invariants remain relevant. Many of the described invariants make it possible to distinguish a larger number of graphs in the real time of a computer program. In this paper, we propose an invariant for a special kind of directed graphs, namely, for tournaments. The last ones, from our point of view, are interesting because when fixing the order of vertices, the number of different tournaments is exactly equal to the number of undirected graphs, also with fixing the order of vertices. In the invariant we are considering, all possible tournaments consisting of a subset of vertices of a given digraph with the same set of arcs are iterated over. For such subset tournaments, the places are calculated in the usual way, which are summed up to obtain the final values of the points of the vertices;these points form the proposed invariant. As we expected, calculations of the new invariant showed that it does not coincide with the most natural invariant for tournaments, in which the number of points is calculated for each participant. So far, we have conducted a small number of computational experiments, and the minimum value of the pair correlation between the sequences representing these two invariants that we found is for dimension 15.

A SUFFICIENT CONDITION FOR HAMILTONIAN CYCLES IN BIPARTITE TOURNAMENTS

In this paper, we present a new sufficient condition on degrees for a bipartite tournament to be Hamiltonian, that is, if an n × n bipartite tournament T satisfies the condition W（n - 3）, then T is Hamiltonian, except for four exceptional graphs. This result is shown to be best possible in a sense.

The Properties of Transitive Bipartite Tournaments

Let Γm，n^* denote all m × n strongly connected bipartite tournaments and a(m, n) the maximal integer k such that every m × n bipartite tournament contains at least a k × k transitive bipartite subtournament. Let t ( m, n, k, l ) = max{t( Tm,n，k, l ) : Tm,n∈Γm，n^*}, where t ( Tm,n, k, l ) is the number of k × l(k≥2,l≥2) transitive bipartite subtournaments contained in Tm,n∈Γm，n^*. We obtain a method of graph theory for solving some integral programmings, investigate the upper bounds of a(m,n) and obtain t (m,n, k，l).

ARC 1-ANTIDIRECTED CYCLES IN TOURNAMENTS

Let T=(V,A)be a tournament of order n and T_i,…,T_m be diconnectedcomponents in T.If uv ∈A and P is a directed path of length k-1(k≥3)from u to v,We call P ∪{uv}a 1-antidirected cycle of length k.Let k be an integer satisfying 3≤k≤n.If every arc e∈A is contained in a 1-antidirected cycle of length k,we will refer toT as arc k 1-antidirected cyclic.If T is arc k 1-antidirected cyclic for k=3,4,…,n,T iscalled arc 1-antidirected pancyclic.In this paper,we prove that T is arc 1-antidirectedpancyclic if and only if T satisfies one of the following conditions:(i)2≤m≤3 and forany T_i,every arc e∈T_i is contained in a Hamilton path in T_i;(ii)m=1,except some spe-cial tournaments which are to be shown.

SPECULATION ON DEVELOPING TOUR RESOURCES OF THE TOURNAMENT ATHLETICS IN HARBIN CITY

The exploitation and utilization of the tour resources of tournament athletics, including skiling, boat sailing, archery, ice engraving, snow engrav ing, has become a new trend of the development of Chinese tourism. Due to the un ique cold climate and superior geographic location,Harbin is a promising city f or developing tour resources of tournament athletics. Based on the analysis of t he superiority and peculiarity of Harbin,the speculation on development of tour resources of tournament athletics in Harbin is proposed as follows:1) Harbin s hould develop its special tour resources of tournament athletics associated with needs of market; 2) Harbin should take the advantages of rich resources and dev elop ice and snow entertainment in winter and travel for sight-seeing and spend ing summer; 3) the adjustment of the layout of ice and snow resources should be based on the idea of taking Harbin as the center and all-side opening at the la rge scale in the way of radiation; 4) tourism should be developed by the combine d efforts of various departments to make feasible plan, and the organizers shoul d pay much attention to ensuring the safety of tourists.

A Framework for Designing and Managing a Best-of-N Sports Tournament

A framework is provided for analyzing the time and resource requirements for a tournament where matches are played to a best-of-N format, to ensure maximal use of available facilities and a maximal number of competitors. A baseline of average length of games and number of games played per match is necessary. The analysis informing development of the framework was carried out in the context of the sport of golf croquet. Based on the results of this analysis, golf croquet tournaments should have four best-of-three matches scheduled per court per day to optimize playing time and minimize the need to play matches outside regular playing hours.

Practical Study of the Sports Garbage Pickup Tournament in Japan-Sports Events to Solve Social Problems

The Sports Garbage Pickup Tournament is a sports event that incorporates elements of competition into cleaning activities,as opposed to traditional cleaning activities.As of the end of December 2016,a total of 552 Sports Garbage Pickup Tournaments have been held,mobilizing a cumulative total number of 62,989 people.As each tournament brings a revenue of over 300,000 yen,the total sales so far would be more than 165,000,000 yen.This game was recently reported on the International Olympic Committee channel.The garbage issue,a social problem for local communities,should be solved by residents,visitors,and workers themselves through sports,cooperating with local governments.This is an eco-friendly sport aimed at“solving local social problems through sports.”Sports Garbage Pickup Tournaments can be held anywhere,inside the city or in a natural environment.In addition,the competition allows participants to visually understand the environmental capacity of garbage produced in the community,as the points are weighted according to the types of garbage.The Sports Garbage Pickup Tournament is an educational program for sustainable development with emphasis on experience,pursuit,and practice,and also an action-based program aimed at promoting spontaneous action.This is an optimal competition for participants to acquire skills through mutual communication.As children,adults,and people with disabilities can play together,the competition will promote communication across the generations.

An Efficient Simulated Annealing Approach to the Travelling Tournament Problem

Scheduling sports leagues has drawn significant attention to itself in recent years, as it involves considerable revenue as well as challenging combinatorial optimization problems. A particular class of these problems is the Traveling Tournament Problem (TTP) which focuses on minimizing the total traveling distance for teams. In this paper, an efficient simulated annealing approach is presented for TTP which applies two simultaneous and disparate models for the problem in order to search the solutions space more effectively. Also, a computationally efficient modified greedy scheme is proposed for constructing a favorable initial solution for the simulated annealing algorithm. Our computational experiments, carried out on standard instances, demonstrate that this approach competes with previous offered methods in quality of found solutions and their computational time.

Increasing Civics Learning Achievement by Applying Cooperative Learning： Team Game Tournament Method

The most important goal in civics education is to ensure that each citizen has a good understanding of ethics and moral behavior, and thus stresses the constant link between knowledge and practice. In this context, to increase understanding of civics education for being able to create the best generation and condition in the future life, study on this issue is becoming a very crucial manner. In general, methods like discussion and dialogue are used to allow students to express themselves. However, cooperative learning in particular addresses many of the needs and concerns facing by educational systems and Team Game Tournament （TGT） method is one of the preferable methods of cooperative learning. This study was aiming to increase civics learning achievements by using cooperative learning based on TGT method on secondary school students of Jatisari of Indonesia. The action research procedure was also used so as to be able to evaluate the influent, impact, and result of TGT. Accordingly, cooperative learning with TGT method has successfully given positive contribution to increasing student learning civics achievement.

Tournament网络节点的排序算法

在组合网络理论中,常将网络节点抽象为图的节点,借助图来研究网络的性质。本文将Tournament网络抽象为图,并以网络中节点输出的信息量为依据,重点探讨了双向连通Tournament网络节点的排序问题,并给出相应的算法。

The Impact of Tournament Load on Neuromuscular Function, Perceived Wellness and Coach Ratings of Performance During Intensified Youth Netball Competition

Purpose This study examined the effects of tournament load on neuromuscular function,perceived wellness and coach rat-ings of performance across two 6-day netball tournaments.Methods Thirty-nine female youth netballers(age=14.6±0.5 years,stature=165.9±4.7 cm,body mass=56.5±7.2 kg)were categorised as HIGH(10-11 matches,n=20)or LOW(6 matches,n=19)tournament load.Match load,jump height,perceived wellness and coach ratings of performance were monitored daily.Results HIGH tournament load resulted in greater reductions in jump height on match-day 4(-8.3%,±5.6%)when compared to LOW.HIGH tournament load resulted in greater reductions in perceived soreness(-0.9,±1.1 AU)and overall wellness(-2.6,±2.3 AU)on match-day 3,and a greater reduction in perceived sleep(-0.9,±1.1 AU)on match-day 4.HIGH tournament load was negatively associated with sleep quality and coach ratings of performance(effect size correlation=-0.34 to-0.47)when compared to LOW.Conclusion Our results indicate that a higher tournament load resulted in greater increases in neuromuscular fatigue,reduced perceived wellness,and lower ratings of performance.Practitioners should consider pre-tournament preparation and monitoring strategies to minimise the physiological disturbances during an intensified tournament.

考虑心理倾向的大型水资源配置工程交易过程锦标激励

大型水资源配置工程特点是呈线状分布,项目法人一般组织多个工程承包方平行实施,即与多个承包方同时交易。在委托代理理论视阈下,这属于“一对多”的委托代理关系,即项目法人要同时面临源自多个代理人/承包方的道德风险。构建了考虑心理倾向的锦标激励模型,通过经典激励模型的求解,分析锦标激励差额及心理倾向对多承包方最优努力水平的影响。研究发现,承包方在质量、进度和施工安全上的最优努力水平随着锦标激励差额的增加而增加,随着承包方努力成本系数的增加而减少;承包方在这3个目标上的最优努力程度随着同情心理倾向系数的增加而减小,随着嫉妒心理偏好系数的增加而增加。因此,正确识别多承包方的心理倾向程度,并制定恰当的锦标激励机制,对提高大型水资源配置工程的建设绩效具有重要意义。

A note on hypertournaments

It is proved that for given integer k≥2, almost all k-hypertournaments are strong and in almost all k-hypertournaments, every pair of vertices lies on a 3-cycle.

行业锦标赛激发了企业策略性创新吗

合理的薪酬契约安排是促进员工努力工作并提高企业绩效的重要手段,企业内部薪酬差距的作用受到广泛关注,但外部薪酬差距及其激励效应并未得到充分重视。本文将锦标赛理论从企业内部拓展到企业外部,从理论上阐释了行业锦标赛激励影响企业渐进性创新与突破性创新的差异化机制。本研究基于发明专利被引情况对企业突破性创新加以识别,以中国制造业A股上市公司2008—2018年的面板数据为样本进行了实证检验。研究结果发现:行业锦标赛激励促进了企业的渐进性创新,但抑制了突破性创新,企业存在明显的策略性创新行为;依靠工具变量法解决内生性问题,通过替换变量、延长滞后期限、替换回归方法和增加控制变量,保证了研究结论的稳健性;异质性检验显示,民营与外资企业的策略性创新行为更为突出,国有企业的创新行为则与行业锦标赛激励无关,高科技企业的突破性创新也不会受到行业锦标赛激励的影响;机制检验表明,行业锦标赛激励通过提升企业短期投资占比和降低企业风险容忍程度作用于企业策略性创新行为。本文不仅为解释企业“创新假象”和“专利泡沫”困境提供了一个新视角,而且对于通过优化薪酬契约安排培育高质量技术创新具有启示意义。

行业锦标赛激励如何影响企业高质量发展——基于高管机会主义行为视角

行业劳动力市场的锦标赛激励会改变高管的心理特质和决策行为,进而影响企业发展质量。本研究以沪深A股上市公司为研究对象,基于高管机会主义行为视角,以真实盈余管理和投融资期限错配为中介变量,考察行业锦标赛激励影响企业高质量发展的内在机制。基于有效企业样本的调查数据,运用多元回归方法进行实证分析和稳健分析。研究发现:行业锦标赛激励抑制企业高质量发展,真实盈余管理和投融资期限错配在此影响过程中发挥中介作用。

On the Strong n-partite Tournaments with Exactly Two Cycles of Length n-1

Gutin and Rafiey（Australas J. Combin. 34（2006）, 17-21） provided an example of an n-partite tournament with exactly n-m ＋ 1 cycles of length of m for any given m with 4 ≤ m ≤ n, and posed the following question. Let 3 ≤ m ≤n and n ≥ 4. Are there strong n-partite tournaments, which are not themselves tournaments, with exactly n-m ＋ 1 cycles of length m for two values of m？ In the same paper,they showed that this question has a negative answer for two values n-1 and n. In this paper, we prove that a strong n-partite tournament with exactly two cycles of length n-1 must contain some given multipartite tournament as subdigraph. As a corollary, we also show that the above question has a negative answer for two values n-1 and any l with 3 ≤ l ≤ n and l ≠n-1.

Local Officials' Incentives and China's Economic Growth:Tournament Thesis Reexamined and Alternative Explanatory Framework

To explain China＇s dramatic economic growth, researchers have proposed a ＂tournament thesis. ＂＂ According to this thesis, the central government＇s ability to set growth targets has played a crucial role in growth since political promotion is largely based on local economic growth. We use provincial officials＂ career mobility data to test this thesis. For both time periods （1979-1995 and 1979-2002）, economic performance, measured in annual, average and relative terms, did not affect these officials＇ career advancement. We then sketch an alternative analytical framework to explain Chinese local officials＇ strong urge for developmentalism and, finally, draw policy implications from this explanatory framework.

“问责接受区”:基层回避政策加码的一种解释——基于湖北省C镇乡村振兴衔接专项资金使用的案例分析

政策加码现象始终难以根除,回避政策加码现象也普遍存在。基于体制结构、问责制度及行动者差异的整体性分析框架,考察湖北省武汉市C镇回避政策加码行为,发现基层回避政策加码行为源于晋升锦标赛下不确定性竞争事项强激励生产的动力机制、非正式制度弱化正式问责刚性约束的强化机制及积极官员助推“问责接受区”所形成的实现机制的综合作用。上述3项机制催生基层回避政策加码行为的内在逻辑在于,积极应对的基层官员围绕回避政策加码在体制结构、问责制度下创造了预期收益为正的区间,即“问责接受区”。“问责接受区”能为基层官员回避政策加码等冒险性政策执行行为提供普适性解释。

国外极限飞盘比赛研究现状分析

运用文献资料法、逻辑分析法,以Web of science核心合集数据库以及Google Scholar收录的26篇极限飞盘比赛相关的文献为研究对象,梳理国外有关极限飞盘比赛的研究。研究发现,国外极限飞盘在研究内容上主要集中在极限飞盘项目特征及运动员体能、极限飞盘运动员损伤、极限飞盘比赛技术统计、极限飞盘技术动作运动生物力学分析等方面。认为极限飞盘比赛要求运动员具备得分时的无氧爆发力以及在攻防过程中的有氧持续能力,是一项技战术复杂多变,对运动员体能和心智、团队协作能力要求较高的项目;在比赛过程中的运动损伤主要是运动员之间直接接触造成的,最常见的身体损伤部位为下肢;比赛球员数据统计、球队数据统计已是国外极限飞盘研究的重点;采用运动生物力学分析极限飞盘比赛时的技术动作能帮助队伍在比赛中获利。

ON REID CONJECTURE OF SCORE SETS FOR TOURNAMENTS

In 1978, K. B. Reid proposed a conjecture as follows: 'Every finite and nonempty set S of positive integers is a set of scores for some tournaments'. And he proved that the conjecture is true for |S|=1, 2, 3. In 1984, M. Hager