It is now generally accepted that chromosomes in the cell nucleus are organized in distinct domains, first called chromosome territories in 1909 by the great cytologist Theodor Boveri. Yet, even today chromosomes have remained enigmatic individuals, whose structures, arrangements and functions in cycling and post-mitotic cells still need to be explored in full detail. Whereas numerous recent re...

Is it possible to extract the size and structure of chromosomal territories (confined domain) from the encounter frequencies of chromosomal loci? To answer this question, we estimate the mean time for two monomers located on the same polymer to encounter, which we call the mean first encounter time in a confined microdomain (MFETC). We approximate the confined domain geometry by a harmonic pote...

For many species, mate guarding results in dramatic departures from normal behaviour that reflect compromised attention to feeding and other activities. Such departures have previously been difficult to document in primates, however. Data were gathered on two aspects of male behaviour that were predicted to be constrained during consortships, individual travel distance and duration of feeding b...

the territory of serbia is vulnerable to various types of natural hazards and the risk is not equal across the entire territory; it varies depending on the type of hazard and the expected potential for damage. the first aim of this research was to determine the geographical distributions of the major types of natural hazards. seismic hazards, landslides, rock falls, floods, torrential floods...

When training a deep neural network for supervised image classification, one can broadly distinguish between two types of latent features of images that will drive the classification: (i) ‘immutable’ or ‘core’ features that are really inherent to the object in question and do not change substantially from one instance of the object to another and (ii) ‘mutable’ or ‘style’ features such as posit...

A set G of points on a 1.5-dimensional terrain, also known as an x-monotone polygonal chain, is said to guard the terrain if any point on the terrain is seen by a point in G. Two points on the terrain see each other if and only if the line segment between them is never strictly below the terrain. The minimum terrain guarding problem asks for a minimum guarding set for the given input terrain. W...

We consider guarding a city of k vertical buildings, each having a rectangular base, by placing guards only at vertices. The aim is to use the smallest number of guards. The problem is a 2.5D variant of the traditional art gallery problem, and finds applications in urban security. We give upper and lower bounds on the number of guards needed for a few versions of the problem. Specifically, we p...

We obtain a polynomial time approximation scheme for the 1.5D terrain guarding problem, improving upon several recent constant factor approximations. Our algorithm is a local search algorithm inspired by the recent results of Chan and Har-Peled [3] and Mustafa and Ray [18]. Our key contribution is to show the existence of a planar graph that appropriately relates the local and global optimum.