نتایج جستجو برای: 41 and 32 sweeping

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

Journal: :International Journal of Plant Sciences 2020

Journal: :Computer Methods in Applied Mechanics and Engineering 1999

Journal: :Proceedings of the National Academy of Sciences 1933

2012
MESSAOUD BOUNKHEL

In a previous work the authors proved under a complex assumption on the set-valued mapping, the existence of Lipschitz solutions for second order convex sweeping processes in p-uniformly smooth and q-uniformly convex Banach spaces. In the present work we prove the same result, under a condition on the distance function to the images of the set-valued mapping. Our assumption is much simpler than...

Journal: :Journal of safety research 2013
Helen Scott Lynne Hall Damien Litchfield Diane Westwood

INTRODUCTION Older drivers and young novice drivers have problems negotiating road junctions. Explanations for problems largely focus on limitations in visual information processing and observation errors associated with age and experience. METHOD Gaze transitions provide information on the positional relationship of fixations, providing a useful tool for highlighting gaps in driver's visual ...

Journal: :JTHTL 2005
Richard C. Notebaert

I. THE 1996 TELECOM ACT OVERVIEW...................................... 32 II. IS THE FCC THE REGULATORY SOLUTION? ........................... 33 A. Disparities in Regularity Treatment ...................................... 34 1. Pricing issues.................................................................... 35 2. Service roll out .................................................................

2012
Jing Qi Mario Olmedo Ning Zhan Jianlin Liu

Unipolar resistive switching memory cells were fabricated using a Mg0.84Zn0.16O2−δ thin film, sandwiched between p+-Si (100) substrate and Cr/Au top electrodes. Electrical measurements showed a large memory window and memory window margin of 107 and 104, respectively. Furthermore, a wide switching voltage distribution gap of 3.6 V between the switching-ON and -OFF processes was obtained for dif...

2004
Brian Alspach

This papers surveys some of the work done on trying to capture an intruder in a graph. If the intruder may be located only at vertices, the term searching is employed. If the intruder may be located at vertices or along edges, the term sweeping is employed. There are a wide variety of applications for searching and sweeping. Old results, new results and active research directions are discussed.

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

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