Simultaneous scheduling of football games and referees using Turkish league data

Assignment decisions of referees to football (soccer) games are highly debated in sports media. Referee assignments are typically done on a weekly basis as the league progresses. However, this practice ignores important workload constraints on referees. Moreover, referees' skill levels should also be considered in determining their assignments. In this article, we first give a mixed integer linear program formulation for the problem of simultaneously generating a game schedule and assigning main referees to games by incorporating specific rules in the Turkish league. We also approach this problem using a genetic algorithm (GA) because of the computational difficulties in solving the problem. In the GA solution pool, we suggest using templates for referee assignments that follow several referee‐related workload constraints. We explain how these templates can be obtained by solving a mixed integer linear model prior to running the GA. The usage of these templates for referee assignments is conceptually similar to using a basic match schedule for game scheduling such as the one used in the Turkish Football League. We use the Turkish Football League fixtures for 2010–2013 as a case study. Experiments with the GA using real‐world data show a rather modest performance in terms of computation time and objective function value. Our numerical results indicate that the problem is extremely hard to solve.     

Auto-tuning Similarity Search Algorithms on Multi-core Architectures

In recent times, large high-dimensional datasets have become ubiquitous. Video and image repositories, financial, and sensor data are just a few examples of such datasets in practice. Many applications that use such datasets require the retrieval of data items similar to a given query item, or the nearest neighbors (NN or $k$ -NN) of a given item. Another common query is the retrieval of multiple sets of nearest neighbors, i.e., multi $k$ -NN, for different query items on the same data. With commodity multi-core CPUs becoming more and more widespread at lower costs, developing parallel algorithms for these search problems has become increasingly important. While the core nearest neighbor search problem is relatively easy to parallelize, it is challenging to tune it for optimality. This is due to the fact that the various performance-specific algorithmic parameters, or “tuning knobs”, are inter-related and also depend on the data and query workloads. In this paper, we present (1) a detailed study of the various tuning knobs and their contributions on increasing the query throughput for parallelized versions of the two most common classes of high-dimensional multi-NN search algorithms: linear scan and tree traversal, and (2) an offline auto-tuner for setting these knobs by iteratively measuring actual query execution times for a given workload and dataset. We show experimentally that our auto-tuner reaches near-optimal performance and significantly outperforms un-tuned versions of parallel multi-NN algorithms for real video repository data on a variety of multi-core platforms.     

Coarse‐to‐Fine Isometric Shape Correspondence by Tracking Symmetric Flips

We address the symmetric flip problem that is inherent to multi‐resolution isometric shape matching algorithms. To this effect, we extend our previous work which handles the dense isometric correspondence problem in the original 3D Euclidean space via coarse‐to‐fine combinatorial matching. The key idea is based on keeping track of all optimal solutions, which may be more than one due to symmetry especially at coarse levels, throughout denser levels of the shape matching process. We compare the resulting dense correspondence algorithm with state‐of‐the‐art techniques over several 3D shape benchmark datasets. The experiments show that our method, which is fast and scalable, is performance‐wise better than or on a par with the best performant algorithms existing in the literature for isometric (or nearly isometric) shape correspondence. Our key idea of tracking symmetric flips can be considered as a meta‐approach that can be applied to other multi‐resolution shape matching algorithms, as we also demonstrate by experiments.     

River: an intermediate language for stream processing

This paper presents both a calculus for stream processing, named Brooklet, and its realization as an intermediate language, named River. Because River is based on Brooklet, it has a formal semantics that enables reasoning about the correctness of source translations and optimizations. River builds on Brooklet by addressing the real‐world details that the calculus elides. We evaluated our system by implementing front‐ends for three streaming languages, and three important optimizations, and a back‐end for the System S distributed streaming runtime. Overall, we significantly lower the barrier to entry for new stream‐processing languages and thus grow the ecosystem of this crucial style of programming. Copyright © 2015 John Wiley & Sons, Ltd.     

人脸检测系统的研究

人脸检测系统采用的是一种基于模板匹配的快速人脸定位算法。该算法利用积分投影法先预测出人脸可能的范围与位置,然后在限定的范围内利用模板匹配的方法定位人脸,从而实现了快速而且可靠的人脸定位。     

Mode competition using TE03 gyrotron cavities

The gyrotron is a powerful source of millimetre wave radiation. Fusion applications require more power per tube than is currently available This in turn means that the resonator must be highly overmoded, with a dense mode spectrum, which leads to mode competition. The influence of external parameters, such as the applied magnetic field, electron beam, and resonator geometry, on mode competition in tubes designed to operate at 150 and 140 GHz in the TE⁰³ mode is investigated theoretically and experimentally. It can be shown that even when the mode spectrum is fairly dense, single mode operation of a gyrotron is possible. The influence of startup conditions on output power is investigated in the 150 GHz experiment. In some cases, modes with an axial index of 2 were excited.     

AODV的本地修复算法

提出了一种新的路由本地修复算法,将修复尽量限制在断链的局部范围内,减少了修复时间和降低路由维护的开销, 且不用考虑失效链路在整个路由上的相对位置,均可对其进行修复,提高了处理失效链路的能力,有利于提高网络的可扩展性.仿真表明,这种新的路由本地修复算法明显地提高了网络多方面的性能.     

渤海湾盆地东营—惠民凹陷油气成藏模式和油气富集控制因素

东营凹陷和惠民凹陷作为济阳坳陷南部两个相邻的、构造格局相似的陆相箕状断陷,其石油地质特征有相似之处,但油气富集程度有明显差异。控制油气富集的主要因素有油源条件、构造特征、火山活动以及生储盖组合与构造的配置等。生储盖组合与构造特征的配置,是造成不同构造部位主要储油气层位和油气藏类型差异性的直接原因。结合油源特征、生储盖组合和输导系统特征,东营、惠民凹陷的油气成藏模式可归为5种类型:洼陷带自生自储-侧向运移成藏模式、洼陷区上生下储-垂向运移成藏模式、中央隆起带和北部陡坡带下生上储-垂向运移成藏模式、南部斜坡带下生上储-复合运移成藏模式和周边凸起区新生古储-复合成藏模式。     

Technical note Seafloor characterization through side scan sonar image processing

This paper presents the most suitable image processing techniques being used at present for recognising features either lying on the seafloor or floating in the water column. The preprocessing methodology is already incorporated in the sonar system, and as we cannot access the raw data, it is not included in this paper. The studied images correspond to the Cabrera Archipelago, in the Mediterranean Sea.     

Diagonal stabilization of linear multivariable systems

A new procedure is presented for the synthesis of diagonal compensators for N × N linear multivariable systems that are free of fixed modes with respect to constant diagonal output feedbacks. The synthesis procedure employs simple polynomial algebra and it is in the form of an N-step algorithm. The geometric configurations 2N- and 2^N-cells in N-space are shown to be especially suitable for visualizing diagonal feedback and aiding the application of the synthesis algorithm.