An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a given graph G, X(G), is defined to have vertices the arcs of G. Two arcs uv, xy are adjacent in X(G) if and only if (v, u, x, y) is a 3-arc of G. This notion was introduced in recent studies of arc-transitive graphs. In this...

BACKGROUND Anomalous retinal correspondence (ARC) is a neural adaptation to eye misalignment in which non-corresponding retinal points are linked in the visual cortex to provide binocular fusion. ARC within the striate cortex would require that horizontal neurons link right-eye and left-eye ocular dominance columns (ODCs) separated by a distance in the cortex proportional to the angle of strabi...

The Hotelling's  control chart, is the most widely used multivariate procedure for monitoring  two or more related quality characteristics, but it’s power lacks the desired performance in detecting small to moderate shifts. Recently, the variable sampling intervals (VSI) control scheme in which the length of successive sampling intervals is determined upon the preceding values has been proved t...

It has been long expected that there exists a deep connection between singularities of certain arc spaces and harmonic analysis over nonarchimedean fields. For instance, certain functions appearing naturally in harmonic analysis can be interpreted as the function attached to the trace of the Frobenius operator on what should be the stalks of the intersection complex of certain arc spaces, see [...

Digital tomosynthesis (DTS) was evaluated as an alternative to cone-beam computed tomography (CBCT) for patient setup. DTS is preferable when there are constraints with setup time, gantry-couch clearance, and imaging dose using CBCT. This study characterizes DTS data acquisition and registration parameters for the setup of breast cancer patients using nonclinical Varian DTS software. DTS images...

We show that all maximum length paths in a connected circular arc graph have non–empty intersection.

The robust detection of lines and arcs in scanned documents or technical drawings is an important problem in document image understanding. We present a new solution to this problem that works directly on run-length encoded data. The method finds globally optimal solutions to parameterized thick line and arc models. Line thickness is part of the model and directly used during the matching proces...

We present exact algorithms for the NP-complete Longest Common Subsequence problem for sequences with nested arc annotations, a problem occurring in structure comparison of RNA. Given two sequences of length at most n and nested arc structure, one of our algorithms determines (if existent) in O(3.31k1+k2 · n) time an arc-preserving subsequence of both sequences, which can be obtained by deletin...

Ankle-foot orthoses (AFOs) are intended to improve toe clearance during swing and ankle position at initial contact (IC) and midstance. Changes that lead to improved ankle-foot kinematics may result in a more biomimetic roll-over shape (ROS). ROS is the effective geometry to which the ankle-foot complex conforms between IC and contralateral IC. An effective ROS during gait may facilitate forwar...

We determine the slip rate and pattern of interseismic coupling on the Main Himalayan Thrust along the entire Himalayan arc based on a compilation of geodetic, interferometric synthetic aperture radar, and microseismicity data. We show that convergence is perpendicular to the arc and increases eastwards from 13.3 ± 1.7 mm/yr to 21.2 ± 2.0 mm/yr. These rates are comparable to geological and geom...