نتایج جستجو برای: l intersection number
تعداد نتایج: 1744190 فیلتر نتایج به سال:
PM**£(*') f° r h£rS$2 where h ( < ^ ) is the point nearest to s* at which €(li)«<r(4j). If $(52)==<r(52), then let h~$%. For r<t2 let p(r) =p(^)+log log log fc — log log log r for Ui^r^h where #1 (<*2) is the point of intersection of y—p with y = p (£2) + log log log fe—log log log r. Let p(r)~p for r i^ rgwi . It is always possible to choose H SO large that r\<ti\. We repeat the procedure and ...
Article history: Received 14 November 2009 Received in revised form 29 April 2010 Accepted 6 May 2010
Given a simple generalized polygonA of line segments and arcs that is free to move and rotate and an oriented monotone chainB composed of smooth parametric curved edges, the positions and orientations forA to gouge-freely contactB (i.e., the contact configurations) is a C0 continuous surface in a three dimensional space R3. Past results either limitB to be polygonal or depend on the very compli...
This report defines various operations and describes algorithms for weighted multi-tape automata (WMTAs). It presents, among others, a new approach to multi-tape intersection, meaning the intersection of a number of tapes of one WMTA with the same number of tapes of another WMTA, which can be seen as a generalization of transducer intersection. In our approach, multi-tape intersection is not co...
in this paper, construction properties of branches in the root locus of a positive feedback system whose loop transfer function is not strictly proper have been investigated. we have introduced and proved the formulations for calculating the number of branches passing through infinity, point of intersection of the asymptotes on the real axis, and angle of these asymptotes with positive directio...
In this paper we examine spectral properties of random intersection graphs when the number of vertices is equal to the number of labels. We call this class symmetric random intersection graphs. We examine symmetric random intersection graphs when the probability that a vertex selects a label is close to the connectivity threshold τc. In particular, we examine the size of the second eigenvalue o...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید