Dean Jacobs. Personal Communication, 2003.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....if S is the union of non empty anti chains T [ B with T B, and 2. f(S) 2 if and only if S is an anti chain. 3. In all other cases, f(S) 0. We need only use f(S) 2 to show jNn j is bounded by twice the number of subsets of day n games, proving the following theorem of Dean Hickerson s [Hic02]: Theorem 2 jNn j 2 g(n) 1 Dan Hoey [Hoe02] tightened this upper bound by using Corollary 1.1 more strongly: Theorem 3 g(n 1) g(n) 2 2. Proof: On day 0, the theorem holds. On subsequent days, the partial order of G n has a top and bottom (n and n) each comparable to all other ....

Dean Hickerson, 2002. Personal communication.

....to find the crossing number or rectilinear crossing number of K n and K m,n ,one can adopt a brute force computational approach to find exact values of the crossing number for small graphs. Such an approach is currently underway for determining #(K n ) by Applegate, Cook, Dash, and Dean [Dea00], where not only will they independently confirm that #(K 10 ) 62, but they will determine exact values of #(K n ) for other values of n # 11 as well. In fact, when each new value of #(K n ) is found, the lower bounds in equation (3) and equation (7) will improve by way of the technique given ....

N. Dean. Personal communication, 2000.

....particular, to nd the crossing number or rectilinear crossing number of K n and K m;n , one can adopt a brute force computational approach to nd exact values of the crossing number for small graphs. Such an approach is currently underway for determining (K n ) by Applegate, Cook, Dash, and Dean [Dea00], where not only will they independently con rm that (K 10 ) 62, but they will determine exact values of (K n ) for other values of n 11 as well. In fact, when each new value of (K n ) is found, the lower bounds in equation (3) and equation (7) will improve by way of the technique given in ....

N. Dean. Personal communication, 2000.

....to find the crossing number or rectilinear crossing number of Kn and K m;n , one can adopt a brute force computational approach to find exact values of the crossing number for small graphs. Such an approach is currently underway for determining cr(Kn ) by Applegate, Cook, 14 Dash, and Dean [Dea00], where not only will they independently confirm that cr(K 10 ) 62, but they will determine exact values of cr(Kn ) for other values of n 11 as well. In fact, when each new value of cr(Kn ) is found, the lower bounds in equation (3) and equation (7) will improve by way of the technique given ....

N. Dean. Personal communication, 2000.

....the example sketched above concerns mostly traditional environments. Linkers are now getting smarter, taking advantage of type information at link time and performing dynamic linking at run time. As an emerging issue, security in Java depends not only on safe typing, but also on safe linking [9]. Thus the potential for problems is increasing. We do not propose to attack all the obstacles at once: some have to do with language design, some with implementation Thursday, October 24, 1996, 11:36 am 3 technology, and some with environment engineering. However, it should be clear that ....

Dean, D., Personal communication. July 1996.

....4.3.2.2. Code Motion Multi grained code motion, that is, moving regions of any granularity, can be performed using the PDG. It may be used exploit control dependence speculation, unspeculation [SW93] to redistribute parallelism [GS87] or to integrate threads into a single flow of control [Dea97] Code motion is an application of PDG traversal. This subsection provides an intuitive feel for how PDG based code motion works, and further illustrates how labels are used in PDG traversal. Code motion of an active region node to the target location uses a broad traversal. Traversal to the ....

....to optimize binaries and tailor them for data sets and particular users. Pedigree s positioning as a post pass compilation tool means that it can be extended for use in these new areas of research. Specific potential future extensions to Pedigree include support for additional ISAs such as MIPS [Dea97] PowerPC and x86. Pedigree currently provides minimal support for using branch profiling input. It is currently being considered for use in analyzing and generating threads based on branch, dependence and profiling data in conjunction with a project to discover and exploit thread level ....

[Article contains additional citation context not shown here]

Alex Dean. Personal communication, September 1997.

....operational level, somelower level modules have addressed elements of higher level tasks. ALVINN [49] is a neural network based road follower that outputs a confidence measure along with steering recommendations. This output confidence can detect potential single vehicle roadway departure cases [50]. SAPIENT shall use ALVINN as its road follower and utilize the confidence measure in its reasoning. RACCOON [63, 64] is a taillight tracking car follower. To correctly follow vehicles around curves, it possesses a basic understanding of situational awareness: it follows the path of the lead ....

....since a competent road follower module is assumed to be active at all times. In the simplest implementation, the output from a road following module could be compared with the steering response of the human driver and if the difference exceeded a certain threshold, an alarm could be sounded [50]. The module could be manually suppressed during lane changing maneuvers. Unfortunately, this approach has two obvious drawbacks: 1. Driver intervention is necessary to temporarily suppress the system. 2. If a roadway departure occurs during a lane change maneuver, the system is powerless to ....

Dean A. Pomerleau, 1994. Personal communication.

....last point .cosine and sine of angle between first and last point .total gesture length . total angle traversed Rubine s original algorithm also computed the maximum speed (squared) and the path duration, but these two temporal features were not used as Rubine found they were not very useful [Rubine 1991a] 3.2.1.1 Limitations of Rubine s Algorithm The algorithm currently limits SILK to single stroke gestures for the primitive components. This means the components must be drawn with a single stroke of the pen (i.e. not lifting up the pen or mouse button during the stroke) A single stroke of ....

Dean Rubine. Personal Communication.

....= n Gamma1 n X i=1 (1 Gamma h ii ) i (7.3) and as.var(T 2 ) 2n 2 Gamma2 n X i=1 n X j=1 i j (ffi ij Gamma h ij ) 2 ; 7.4) where h ii , h ij are entries of the the matrix H of (7.2) and ffi ij = 1 if i = j, and equal to 0 otherwise. Note that the latter formula [6] corrects an error in the expression for as.var(T 2 ) given in Dean and Lawless [7, section 4.1] 7.1.3 Two Adjusted Statistics In order to improve the rate of convergence of T 1 and T 2 to the N(0; 1) distribution, Dean and Lawless [7] introduce adjustments to them. An adjusted version of T 1 ....

C. Dean. Personal communication, 1997.

....curve cutting could have an adverse impact on WOT, if a lane departure were to occur towards the inside of a sharp curve. In that case, the curve cutting adaptation would result in the alarm triggering later, reducing the driver s reaction time. However, based on an analysis of 200 ROR crashes, [60] shows that crashes where the vehicle drifts off the inside of a curve are four times less likely than accidents where the driver drifts off the outside of the curve. The next section shows the results of the same experiment described in Section 3.5, but with the additional curve cutting term in ....

....In this appendix, I present an analysis of warning system performance on the entrance of a rural section of curved road, and demonstrate that, providing adequate lane departure warning in such situations is very difficult. While 40 percent of run off road incidents occur on rural roads [60], driver reaction time and the sharp curves present on rural roads combine to preclude developing a system which both has a low nuisance alarm rate and warns early enough to prevent a roadway departure. There are many reasons for this. Rural roads are often narrow, have only one lane in each ....

Dean A. Pomerleau. Personal communication.

No context found.

Dean Jacobs. Personal Communication, 2003.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC