We are investigating the use of GPS carrier-phase for high accuracy time transfer measurements. We have conducted a long-term time transfer experiment between the United States Naval Observatory (USNO) Master Clock and Alternate Master Clock (AMC). These clocks are located at the USNO in Washington D.C. and Schriever Air Force Base near Colorado Springs, Colorado, respectively. At both location...

A nontrivial connected graph is matching covered if each of its edges lies in a perfect matching. Two types of decompositions of matching covered graphs, namely ear decompositions and tight cut decompositions, have played key roles in the theory of these graphs. Any tight cut decomposition of a matching covered graph results in an essentially unique list of special matching covered graphs, call...

A set S of vertices of a connected graph G is convex, if for any pair of vertices u, v ∈ S , every shortest path joining u and v is contained in S . The convex hull CH(S ) of a set of vertices S is defined as the smallest convex set in G containing S . The set S is geodetic, if every vertex of G lies on some shortest path joining two vertices in S, and it is said to be a hull set if its convex ...

Early vision algorithms often have a first stage of linear-filtering that 'extracts' from the image information at multiple scales of resolution and multiple orientations. A common difficulty in the design and implementation of such schemes is that one feels compelled to discretize coarsely the space of scales and orientations in order to reduce computation and storage costs. This discretizatio...

The presence of edge-disjoint Hamiltonian cycles provides an advantage when implementing algorithms that require a ring structure by allowing message traffic to be spread evenly across the network. Edge-disjoint Hamiltonian cycles also provide the edge-fault tolerant hamiltonicity of an interconnection network. In this paper, we first study the property of edge-disjoint Hamiltonian cycles in tr...

We demonstrate that a tight-binding Hamiltonian with nearest- and next-nearest-neighbor hopping integrals can be decomposed into bulk and boundary parts for honeycomb lattice systems. The Hamiltonian decomposition reveals that next-nearest-neighbor hopping causes sizable changes in the energy spectrum of surface states even if the correction to the energy spectrum of bulk states is negligible. ...

We consider the dihamiltonian decomposition problem for 3regular graphs. A graphG is dihamiltonian decomposable if in the digraph obtained fromG by replacing each edge of G as two directed edges, the set of edges are partitioned into 3 edge-disjoint directed hamiltonian cycles. We suggest some conditions for dihamiltonian decomposition of 3-regular graphs: for a 3-regular graph G, it is dihamil...

We consider the dihamiltonian decomposition problem for 3-regular graphs. A graph G is dihamiltonian decomposable if in the digraph obtained from G by replacing each edge of G as two directed edges, the set of edges are partitioned into 3 edge-disjoint directed hamiltonian cycles. We suggest some conditions for dihamiltonian decomposition of 3-regular graphs: for a 3-regular graph G, it is diha...