In 2009, Peter Cameron introduced a common generalization of various classes of combinatorial designs such as balanced incomplete block designs, resolvable designs and orthogonal arrays. Generalized covering and packing designs can be defined in analogous way. These objects bring into this framework further classes of designs, including covering and packing arrays, Howell designs, monogamous cy...

Efforts to detect targets of recent positive selection (“selective sweeps”) in the genome frequently involve an initial screen of a region of the genome at a low density of markers (either SNPs or microsatellites), followed by a denser screen in the region flanking markers that show reduced or skewed variation relative to that predicted by an equilibrium neutral model or relative to “background...

This talk concerns Dirichlet and Neumann boundary value problems for second order elliptic divergence form equations with non-symmetric, or more general complex, and measurable coefficients independent of the transversal coordinate in the upper half space. I shall discuss some recent results obtained which shows that, in the case of non-symmetric coefficients, the solutions obtained with the bo...

In team sports, players move in complex but surprisingly predictable ways. With state-of-the-art computer vision and machine learning methods, it is now possible to collect sufficiently large player tracking datasets and learn patterns of how players actually move. In this talk, I will describe how this knowledge has been used at Disney Research to generate new analytics and sports broadcasting...

Our understanding of the notion “dynamic system” is a rather broad one: such a system has states, which can change over time. Ontologies are used to describe the states of the system, possibly in an incomplete way. Monitoring is then concerned with deciding whether some run of the system or all of its runs satisfy a certain property, which can be expressed by a formula of an appropriate tempora...

This report documents the program and the outcomes of Dagstuhl Seminar 17121 “Computational Complexity of Discrete Problems”. The first section gives an overview of the topics covered and the organization of the meeting. Section 2 lists the talks given in alphabetical order. The last section contains the abstracts of the talks. Seminar March 19–24, 2017 – http://www.dagstuhl.de/17121 1998 ACM S...

s for talks scheduled for the 2007 annual meeting of the J.B. Johnston Club are listed in alphabetical order by presenting author. The final schedule of talks will be sent to the membership prior to the meeting and will be available at the registration desk during the meeting. This year’s Karger Invited Speaker will be Louis Lefebvre. Dr. Lefebvre’s abstract is listed first. Behavioral Drive an...