نتایج جستجو برای: uncontrolled intersections

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

2016
Amr Elmasry Frank Kammer

We introduce space-efficient plane-sweep algorithms for basic planar geometric problems. It is assumed that the input is in a read-only array of n items and that the available workspace is Θ(s) bits, where lgn ≤ s ≤ n · lg n. In particular, we give an almost-optimal algorithm for finding the closest pair among a set of n points that runs in O(n/s+n·lg s) time. We give a simple algorithm to enum...

1997
A. Baumgartner C. Steger H. Mayer W. Eckstein

This paper presents a multi-resolution approach for automatic extraction of roads from digital aerial imagery. Roads are modeled as a network of intersections and links between the intersections. of the image into context regions is done by texture analysis. The approach to detect roads is based on the extraction of edges in a high resolution image and the extraction of lines in an image of red...

2016
Jhonghyun An Baehoon Choi Kwee-Bo Sim Euntai Kim

There are several types of intersections such as merge-roads, diverge-roads, plus-shape intersections and two types of T-shape junctions in urban roads. When an autonomous vehicle encounters new intersections, it is crucial to recognize the types of intersections for safe navigation. In this paper, a novel intersection type recognition method is proposed for an autonomous vehicle using a multi-...

Journal: :Physical chemistry chemical physics : PCCP 2011
Donald G Truhlar C Alden Mead

A recent paper in this journal proposed the conversion of conical intersections to avoided crossings by lowering the symmetry with an optical field. The article also claimed that the characters of nonadiabatic transitions caused by avoided crossings and conical intersections are qualitatively different. The present comment shows that this proposal and this claim result from an incorrect appreci...

2005
MARC CHARDIN NGUYEN CONG

This paper proves the formulae reg(IJ) ≤ reg(I) + reg(J), reg(I ∩ J) ≤ reg(I) + reg(J) for arbitrary monomial complete intersections I and J , and provides examples showing that these inequalities do not hold for general complete intersections.

Journal: :Physical review letters 2012
Peter Hamm Gerhard Stock

Presenting true crossings of adiabatic potential energy surfaces, conical intersections are a paradigm of ultrafast and efficient electronic relaxation dynamics. The same mechanism is shown to apply also for vibrational conical intersections, which may occur when two high-frequency modes (such as OH stretch vibrations) are coupled to low-frequency modes (such as hydrogen bonding modes). By deri...

Journal: :Chaos 2000
Hector E. Lomeli James D. Meiss

We study families of volume preserving diffeomorphisms in R(3) that have a pair of hyperbolic fixed points with intersecting codimension one stable and unstable manifolds. Our goal is to elucidate the topology of the intersections and how it changes with the parameters of the system. We show that the "primary intersection" of the stable and unstable manifolds is generically a neat submanifold o...

Journal: :Accident; analysis and prevention 2016
H Bar-Gera O Musicant E Schechtman T Ze'evi

The yellow signal driver behavior, reflecting the dilemma zone behavior, is analyzed using naturalistic data from digital enforcement cameras. The key variable in the analysis is the entrance time after the yellow onset, and its distribution. This distribution can assist in determining two critical outcomes: the safety outcome related to red-light-running angle accidents, and the efficiency out...

Journal: :journal of algebraic systems 2014
mahmood behboodi reza jahani-nezhad mohammad hasan naderi

in this paper we investigate decompositions of submodules in modules over a proufer domain into intersections of quasi-primary and classical quasi-primary submodules. in particular, existence and uniqueness of quasi-primary decompositions in modules over a proufer domain of finite character are proved. proufer domain; primary submodule; quasi-primary submodule; classical quasi-primary; decomposi...

2017
Simon Andrews

This paper describes how improvements in the performance of Close-by-One type algorithms can be achieved by making use of empty intersections in the computation of formal concepts. During the computation, if the intersection between the current concept extent and the next attribute-extent is empty, this fact can be simply inherited by subsequent children of the current concept. Thus subsequent ...

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

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