We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given and another in which the mapping is not given. We present positive and negative results for the two versions of the problem. Among the positive results with given mapping, we show that we can embed two paths on an n×...

− The simultaneous localization and mapping (SLAM) with detection and tracking of moving objects (DATMO) problem is not only to solve the SLAM problem in dynamic environments but also to detect and track these dynamic objects. In this paper, we derive the Bayesian formula of the SLAM with DATMO problem, which provides a solid basis for understanding and solving this problem. In addition, we pro...

We constrain the total mass distribution in the cluster A3571, combining spatially resolved ASCA temperature data with ROSAT imaging data with the assumption that the cluster is in hydrostatic equilibrium.

This paper uses control variables to identify and estimate models with nonseparable, multidimensional disturbances. Triangular simultaneous equations models are considered, with instruments and disturbances independent and reduced form that is strictly monotonic in a scalar disturbance. Here it is shown that the conditional cumulative distribution function of the endogenous variable given the i...

A geometric simultaneous embedding of two graphs G1 = (V1, E1) and G2 = (V2, E2) with a bijective mapping of their vertex sets γ : V1 → V2 is a pair of planar straightline drawings Γ1 of G1 and Γ2 of G2, such that each vertex v2 = γ(v1) is mapped in Γ2 to the same point where v1 is mapped in Γ1, where v1 ∈ V1 and v2 ∈ V2. In this paper we examine several constrained versions of the geometric si...

Nowadays, there is a clear trend in industry towards employing the growing amount of transistors on chip in replicating execution cores, where each core is Simultaneous Multithreading (SMT). In order to appropriately connect such a growing number of on-chip execution cores to a shared cache subsystem, some traditional considerations regarding SMT should be re-

We investigate the prescriptive power of sequential iterated admissibility in coordination games of the Gale-Stewart style, i.e., perfectinformation games of infinite duration with only two payoffs. We show that, on this kind of games, the procedure of eliminating weakly dominated strategies is independent of the elimination order and that, under maximal simultaneous elimination, the procedure ...

This article presents SLAM, an Automatic Solver for Lexical Metaphors like “déshabiller* une pomme” (to undress* an apple). SLAM calculates a conventional solution for these productions. To carry on it, SLAM has to intersect the paradigmatic axis of the metaphorical verb “déshabiller*”, where “peler” (“to peel”) comes closer, with a syntagmatic axis that comes from a corpus where “peler une pom...

The simultaneous ascending auction has proved to be a successful method of auctioning many related items. Simultaneous sale and ascending bids promote price discovery, which helps bidders build desirable packages of items. Although package bids are not allowed, the auction format does handle mild complementarities well. I examine the auction design and its performance in practice.