Let I ⊂ R be a compact interval symmetric about 0. Let M and N , be compact oriented smooth manifolds of dimensions d and d+1 respectively. We suppose that we have an embedded copy of I ×M inside of N . (See Figure 1). Let N denote the complement of the hypersurface {0} ×M . We consider families ǫ → g(ǫ) of Riemannian metric (tensors) on N each of whose restriction to I ×M is a warped product o...

In wireless communication networks, optimal use of the directional antenna is very important. The directional antenna coverage (DAC) problem is to cover all clients with the smallest number of directional antennas. In this paper, we consider the variable-size rectangle covering (VSRC) problem, which is a transformation of the DAC problem. There are n points above the base line y = 0 of the two-...

Dynamics of nanoscopic arrays of monodomain magnetic elements is simulated by means of the Pardavi-Horvath algorithm. Experimental hys-teresis loop is reproduced for the arrays of Ni, with period 100 [nm] and the mean coercive field 710 [Oe]. We investigate the fractal character of the cluster of elements with a given magnetic moments by means of box-counting and damage spreading techniques. No...

Let’s suppose we have a set of one-dimensional ranges S = {s1, s2, ..., sN}, with each range in the form (x1, x2) and a set of queries Q = {q1, q2, ..., qN}. Batched Stabbing Query Problem (BSQP) asks to report for each element qi ∈ S, which ranges sj ∈ S contain qi. Another way to look at the problem is to view the set S as horizontal segments and Q as infinite vertical lines (as depicted in F...

The problem of spiraling Black incarceration The United States has the world’s highest incarceration rate. This massive incarceration is a product of exponential growth since the 1970s (see Figure 1). By the end of the 1990s, even White European Americans were incarcerated at rates three to four times higher than Europeans. But the wave of massive incarceration fell disproportionately on Black ...

K e y w o r d s : graphs, algori thms, HHD-free graphs, t reewidth, min imum fill-in. MSC: 68R10. 1 I n t r o d u c t i o n A graph is HHD-free if it does not contain a house (i.e., the complement of Ps), a hole (Ck for k _> 5) or a domino (see Figure 1). Fig. 1. 'House' (left), 'hole' (middle) and 'domino' (right) * kloks@math, utwente, nl

In the following case study, we consider the so-called shallow water equations. They describe the behaviour of a fluid, in particular water, of a certain (possibly varying) depth h in a twodimensional domain – imagine, for example, a puddle of water or a shallow pond (and compare the 1D sketch given in Figure 1). The main modelling assumption is that we can neglect effects of flow in vertical d...

This review is primarily concerned with the rupture process of large subduction-zone earthquakes determined by various seismological methods, and with its interpretation in terms of an asperity model. It is not possible to make a thorough and extensive review on the subject because of the limited length. Consequently, this review is inevitably biased toward the works in which I was directly inv...

A city and its transportation network are both complicated systems. Fractal geometry provides an effective way to describe the complex property of geographical features. This paper uses a modified box-counting method to describe the fractal property of urban transportation networks. Assuming that human settlements of different sizes are all operated by the same growth procedure, this paper inve...

Innovation is often associated with positive descriptors such as “fun” or “creativity”, but the authors suggest it is really about hard work and is a challenging process, both emotionally and intellectually taxing. Successful innovation emanates from the diverse thinking of diverse people. However, that same diversity often leads to passionate disagreement that must be carefully managed. Manage...