نتایج جستجو برای: leap graphs

تعداد نتایج: 101092  

Journal: :Theor. Comput. Sci. 2000
Bruno Courcelle

We introduce nite relational structures called sketches, that represent edge crossings in drawings of nite graphs. We consider the problem of characterizing sketches in Monadic Second-Order logic. We answer positively the question for framed sketches, i.e., for those representing drawings of graphs consisting of a planar connected spanning subgraph (the frame) augmented with additional edges th...

Journal: :Discrete Applied Mathematics 2017
Jennifer Diemunsch Nathan Graber Lucas Kramer Victor Larsen Lauren M. Nelsen Luke L. Nelsen Devon Sigler Derrick Stolee Charlie Suer

Let c : E(G) → [k] be an edge-coloring of a graph G, not necessarily proper. For each vertex v, let c̄(v) = (a1, . . . , ak), where ai is the number of edges incident to v with color i. Reorder c̄(v) for every v in G in nonincreasing order to obtain c∗(v), the color-blind partition of v. When c∗ induces a proper vertex coloring, that is, c∗(u) 6= c∗(v) for every edge uv in G, we say that c is col...

Journal: :Microscopy and microanalysis : the official journal of Microscopy Society of America, Microbeam Analysis Society, Microscopical Society of Canada 2004
Thomas F Kelly Tye T Gribb Jesse D Olson Richard L Martens Jeffrey D Shepard Scott A Wiener Thomas C Kunicki Robert M Ulfig Daniel R Lenz Eric M Strennen Edward Oltman Joseph H Bunton David R Strait

The first dedicated local electrode atom probes (LEAP [a trademark of Imago Scientific Instruments Corporation]) have been built and tested as commercial prototypes. Several key performance parameters have been markedly improved relative to conventional three-dimensional atom probe (3DAP) designs. The Imago LEAP can operate at a sustained data collection rate of 1 million atoms/minute. This is ...

1996
Frank Linton Brigham Bell Charles Bloom

LEAP is a coached practice environment that optimizes the learning process by maintaining and consulting a detailed student model. LEAP calculates a student model score for every action, exercise, and topic the student tries, then uses the scores both to provide feedback to the student and to select topics, exercises and actions for the student to practice. Using the student model to focus prac...

2015
Suzette M. Evans W. Miles Cox Javad S. Fadardi Steven G. Hosier Emmanuel M. Pothos

Two cognitive-motivational variables that help to solidify drinkers' intentions to drink are their alcohol attentional bias and their maladaptive motivation. The Alcohol Attention Control Training Programme (AACTP) was designed to rectify the former, and the Life Enhancement and Advancement Programme (LEAP) was designed to rectify the latter. The present study used a factorial design to compare...

1999
Randall Sparks Scott Dooley Lori Meiskey Rick Blumenthal

An important goal of current work in computer-based learning environments is to develop systems that combine the richness and effectiveness of an individually crafted intelligent tutoring system (ITS) with the generality and flexibility of a computer-assisted instruction (CAI) authoring tool. Our effort to achieve this goal is demonstrated in the Learn, Explore and Practice (LEAP) ITS shell and...

Journal: :Robotics and mechatronics : proceedings of the 4th IFToMM International Symposium on Robotics and Mechatronics. IFToMM International Symposium on Robotics and Mechatronics 2016
T A Travaglini P J Swaney Kyle D Weaver R J Webster

The Leap Motion controller is a low-cost, optically-based hand tracking system that has recently been introduced on the consumer market. Prior studies have investigated its precision and accuracy, toward evaluating its usefulness as a surgical robot master interface. Yet due to the diversity of potential slave robots and surgical procedures, as well as the dynamic nature of surgery, it is chall...

Journal: :J. Graph Algorithms Appl. 2009
Michael Jünger Michael Schulz

We examine the simultaneous embedding with fixed edges problem for two planar graphs G1 and G2 with the focus on their intersection S = G1∩G2. In particular, we will present the complete set of intersection graphs S that guarantee a simultaneous embedding with fixed edges for (G1, G2). More formally, we define the subset ISEFE of all planar graphs as follows: A graph S lies in ISEFE if every pa...

Journal: :Theor. Comput. Sci. 1999
Bruno Courcelle

We prove that the unique decomposition of connected graphs defined by Tutte is definable by formulas of Monadic Second-Order Logic. This decomposition has two levels: every connected graph is a tree of "2-connected components" called blocks ; every 2-connected graph is a tree of so-called 3-blocks. Our proof uses 2dags which are certain acyclic orientations of the considered graphs. We obtain a...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید