K. Raeburn, June 2002, Personal communication.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....two pair of vertices x, y there exist two more vertices w = w xy , w # = w # xy such that #(x, y) #(x,w) #(x,w # ) Using the above mentioned quadruples of points of #, we may define the structure of a partial linear space L of line size 4 on #. The idea to consider L is due to Hans Cuypers [7]. To complete the current case it su#ces to show that L is a (finite) locally GQ with a#ne planes. This means the following. Consider the set of minimal byinclusion subspaces generated by the pairs of intersecting lines of L (such subspaces are usually called planes) We require all the planes ....

H. Cuypers, June 1992. Personal communication.

....made up to date. Without some secondary data structures, this could require a full pass over the document. In addition, whenever multiple components are inserted or deleted by a single editor operation they must be scanned for the presence of numbered components. A third approach, taken in Grif [14], computes component numbers dynamically as they are displayed. This approach avoids computing component numbers that are not displayed, but requires recomputation of component numbers and cross references to them each time they are redisplayed. In a Grif document containing 200 numbered ....

Vincent Quint, June 1990. Personal communication.

....a set of timers. One mechanism for managing timers is the calendar queue [3] An implementation of RCSP which is based on the calendar queue and requires constant number of processing steps per packet is proposed in [27] Another implementation based on a two dimensional shifters is proposed in [18]. Both Stop and Go and RCSP needs a mechanism to service packets according to a non preemptive static priority policy, which is easy to implement in high speed switches. In fact, even early implementations of commercial ATM switches have at least two priority levels [2] Experimental ATM switches ....

M. Maresca, June 1993. Personal communication.

....structures used in the proposed implementation are simple: arrays and linked lists. The operations are all constant time ones: array indexing, insertion at the tail of a linked list, deletion from the head of a linked list. Another implementation based on two dimensional shifters is proposed in [22]. Both Stop and Go and RCSP need a mechanism to service packets according to a non preemptive static priority policy, which is easy to implement in high speed switches. In fact, even early implementations of commercial ATM switches have at least two priority levels [2] Experimental ATM switches ....

M. Maresca, June 1993. Personal communication.

....update. Recent research [6] erroneously reported that the prediction accuracy of speculatively updated predictors dramatically decreased as the number of unresolved branches present in the machine increased. The study s author reports that the incorrect result was due to an error in their simulator[5]. The correct result shows that the prediction accuracy is not affected by the number of unresolved branches present. Because only branch predictions made while the machine is speculatively executing down the correct path of the program affect the execution time, only those predictions contribute ....

A. R. Talcott, June 1994. Personal communication.

.... One mechanism for managing timers is the calendar queue [2] An implementation of RCSP [28] which is based on the calendar queue and requires constant number of processing steps per packet is proposed in [28] Another implementation based on a two dimensional array of shifters is also proposed [19]. Thus, the only difference between a delay jitter controlling regulator and a rate jitter controlling regulator is in the computation of the eligibility time. To implement delay jitter controlling regulators, there must be some mechanism for the synchronization between consecutive switches. In ....

M. Maresca, June 1993. Personal communication.

.... converge to a function that has a number of derivatives that grows linearly with N [16, 14] For larger M the situation appears to be that the minimum length interpolator converges to a function where the number of derivatives grows linearly with N for M even, and proportional to log N for M odd [48]. Once convergence of the product is assured the signal can be written x a (t) 1 X n= Gamma1 x a (nT )fl(t Gamma nT ) 27) where Gamma(w) 1 Y k=0 P (e jw=M k ) In other words the infinite iteration of the discrete time interpolation gives a function that can be used to ....

P. N. Heller, June 1994. Personal Communication.

....in the proposed implementation are simple: arrays and linked lists. The operations are all constant time ones: array indexing, insertion at the tail of a linked list, deletion from the head of a linked list. Another implementation of RCSP that is based on a two dimensional shifters is proposed in [44]. We would like to point out that a calendar queue is a simpler mechanism that a sorted priority queue. In a calendar queue, only packets pointed by the current time pointer are dequeued at every clock tick. In a sorted priority queue, the next packet needs to be dequeued each time the server ....

M. Maresca, June 1993. Personal communication.

No context found.

K. Raeburn, June 2002, Personal communication.

No context found.

K. Raeburn, June 2002, Personal communication.

No context found.

C. Neuman, June 2002, Personal communication.

No context found.

F. Hady, June 2002. Personal Communication.

No context found.

K. Raeburn, June 2002, Personal communication.

No context found.

C. Neuman, June 2002, Personal communication.

No context found.

C. Hagwood and J. Yen, June 1999. Personal Communication.

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