When children learn their native language, they have to deal with a confusing array of dependencies between various elements in an utterance. The dependent elements may be adjacent to one another or separated by intervening material. Prior studies suggest that nonadjacent dependencies are hard to learn when the intervening material has little variability, which may be due to a tradeoff between ...

A graph is said to be determined by the adjacency and Laplacian spectrum (or to be a DS graph, for short) if there is no other non-isomorphic graph with the same adjacency and Laplacian spectrum, respectively. It is known that connected graphs of index less than 2 are determined by their adjacency spectrum. In this paper, we focus on the problem of characterization of DS graphs of index less th...

Introduction Software implementations for graph structures can represent a graph as an adjacency list or a sparse adjacency matrix. There are no standards regarding the implementation details of adjacency list or adjacency matrix structures. Notable parties propose different implementations for adjacency lists [1]. Guido van Rossum suggests using a hash table with arrays, where the arrays indic...

For a graph Γ with adjacency matrix A, we consider a switching operation that takes Γ into a graph Γ′ with adjacency matrix A′, defined by A′ = Q > AQ, where Q is a regular orthogonal matrix of level 2 (that is, Q > Q = I, Q1 = 1, 2Q is integral, and Q is not a permutation matrix). If such an operation exists, and Γ is nonisomorphic with Γ′, then we say that Γ′ is semi-isomorphic with Γ. Semiis...

Range map registration is still the most time consuming phase in the processing of 3D scanning data. This is because real scanning sets are composed of hundreds of range maps and their registration is still partially manual. We propose a new method to manage complex scan sets acquired by following a regular scanner pose pattern. Our goal is to define an initial adjacency graph by coarsely align...

Learning takes place over long periods of time that are hard to study directly. Even the learning experience involved in solving a challenging math problem in a collaborative online setting can be spread across hundreds of brief postings during an hour or more. Such long-term interactions are constructed out of posting-level interactions, such as the strategic proposing of a next step. This pap...

This paper shows some useful properties of the adjacency structures of a class of combinatorial polyhedra including the equality constrained 0-1 polytopes. The class of polyhedra considered here includes 0-1 polytopes related to some combinatorial optimization problems; e.g., set partitioning polytopes, set packing polytopes, perfect matching polytopes, vertex packing polytopes and all the face...

Abstract. Rectangular layouts, subdivisions of an outer rectangle into smaller rectangles, have many applications in visualizing spatial information, for instance in rectangular cartograms in which the rectangles represent geographic or political regions. A spatial treemap is a rectangular layout with a hierarchical structure: the outer rectangle is subdivided into rectangles that are in turn s...

Adjacency trees can model the nesting structure of spatial regions. In many applications it is necessary to model foreground and background regions which exhibit changes over time such as splitting, where one region divides into two. For example, the qualitative description of the development of wildfires would use the foreground for areas on fire and the background for areas not on fire. Such ...

Social interactions with adults around them are the main exposures to language that children receive, and these contribute significantly their development. In response this, this article examines participation of two-year-old in conversations adults, aimed at describing parties initiating conversation topics identifying structure conversations. The research used a qualitative method form case s...