A structure M ≤ N is symmetrically embedded in N if any σ ∈ Aut(M) extends to an automorphism of N . A countable structure M is symmetrically indivisible if for any coloring of M by two colors there exists a monochromatic M ≤ M such that M ∼= M and M is symmetrically embedded in M. We give a model-theoretic proof of the symmetric indivisibility of Rado’s countable random graph [9] and use these...

A graph is “nearly embedded” in a surface if it consists of graph G0 that is embedded in the surface, together with a bounded number of vortices having no large transactions. It is shown that every large wall (or grid minor) in a nearly embedded graph, many rows of which intersect the embedded subgraph G0 of the near-embedding, contains a large subwall that is planarly embedded within G0. This ...

A common challenge in processing large domain-specific models and in-memory object structures (e.g., complex XML documents) is writing traversals and queries on them. Object-oriented (OO) designs, particularly those based on the Visitor pattern, are commonly used for developing traversals. However, such OO designs limit the reusability and independent evolution of visitation actions (i.e., the ...

We study the electrochemistry of single layer graphene edges using a nanopore-based structure consisting of stacked graphene and Al(2)O(3) dielectric layers. Nanopores, with diameters ranging from 5 to 20 nm, are formed by an electron beam sculpting process on the stacked layers. This leads to a unique edge structure which, along with the atomically thin nature of the embedded graphene electrod...

Recent research shows that pre-existing network structure constrains the formation of new interorganizational alliances. Firms that are poorly embedded in a network structure are less likely to form alliances, because they lack the informational and reputational benefits that richlyembedded firms enjoy. This paper examines the types of ties that poorly-embedded firms can form to overcome the co...

Interactive Data Language (IDL) is an arrayoriented data analysis and visualization application, which is widely used in research, commerce, and education. It is meaningful to make end user IDL applications collaborative on events between computers over networks, using a common message broker as the underlying communication system, and deploy them in Peer-to-Peer Grid architecture. In order to ...

We prove that any countable directed acyclic graph can be embedded in the structure of intrinsic complexity of learning. This result illustrates the richness of this structure.

This paper describes a new static analysis to show the absence of memory errors, especially string buffer overflows in C programs. The analysis is specifically designed for the subset of C that is found in critical embedded software. It is based on the theory of abstract interpretation and relies on an abstraction of stores that retains the length of string buffers. A transport structure allows...

Embedded speaker recognition in mobile devices could involve several ergonomic constraints and a limited amount of computing resources. Even if they have proved their efficiency in more classical contexts, GMM/UBM based systems show their limits in such situations, with good accuracy demanding a relatively large quantity of speech data, but with negligible harnessing of linguistic content. The ...