We consider the problem of traveling the contour of the set of all points that are within distance 1 of a connected planar curve arrangement P, forming an embedding of the graph G. We show that if the overall length of P is L, there is a closed roundtrip that visits all points of the contour and has length no longer than 2L + 2. This result carries over in a more general setting: if R is a comp...

This study empirically investigates whether agglomeration discourages married couples' fertility decisions. Exploiting Japanese social survey data to control for economic and social factors underlying fertility, it examines whether agglomeration affects completed fertility and the timing of childbirth. Results indicate that agglomeration impedes completed fertility. In addition, this study find...

In this paper, results from a perception experiment on perceived prosodic boundary strength in spontaneous speech are presented. The analysis of the listeners’ responses reveals a good agreement in rating the strength of prosodic phrase boundaries on a visual analogue scale (VAS), and a strong correlation between perceived boundary strength and pause duration.

This paper makes three original contributions: (1) Explicit closed-form parametric formulas for the boundary of the Minkowski sum and difference of two arbitrarily oriented solid ellipsoids in n-dimensional Euclidean space are presented; (2) Based on this, new closed-form lower and upper bounds for the volume contained in these Minkowski sums and differences are derived in the 2D and 3D cases a...

We investigate a lattice construction method for the Coppersmith technique for finding small solutions of a modular equation. We consider its variant for simultaneous equations and propose a method to construct a lattice by combining lattices for solving single equations. As applications, we consider a new RSA cryptanalyses. Our algorithm can factor an RSA modulus from l ≥ 2 pairs of RSA public...

The objective of this paper is to present two types of results on Minkowski sums of convex polytopes. The first is about a special class of polytopes called perfectly centered and the combinatorial properties of the Minkowski sum with their own dual. In particular, we have a characterization of faces of the sum in terms of the face lattice of a given perfectly centered polytope. Exact face coun...

Objective: A direct comparison of different kinds of scale formats of ratings of comfort and of mood states as well as their relation to the cardiovascular response was the objective. It was expected that activation-related scales are associated with physiological measures and that comfort scales and ratings of mood states would give complementary information on the impact of environmental cond...

Rackoff’s small witness property for the coverability problem is the standard means to prove tight upper bounds in vector addition systems (VAS) and many extensions. We show how to derive the same bounds directly on the computations of the VAS instantiation of the generic backward coverability algorithm. This relies on a dual view of the algorithm using ideal decompositions of downwards-closed ...

We propose a new method for computing the 2-d Minkowski sum of non-convex polygons. Our method is convolution based. The main idea is to use the reduced convolution and filter the boundary by using the topological properties of the Minkowski sum. The main benefit of this proposed approach is from the fact that, in most cases, the complexity of the complete convolution is much higher than the co...