### Table 3. Invariance of (0.1) with respect to the Weyl algebra

2000

### Table 1: Examples of important features of the algebra. Description Format Examples

"... In PAGE 4: ... This compaction mechanism can also be used when some portion of the entire state is symmetric, since superposition is associative. The definitions for the two types of symmetric entanglement are presented in Table1 . Formally, we de- fine these states to be the result of a function a7 a1a0 , which is derived from the EPR function, but we use the a1 operator as semantic sugar to des- ignate symmetric entanglement.... In PAGE 4: ... The algebra is also complete and expressive, as it is capable of de- scribing any legal quantum state or operation. The a4 , a19a21a20a23a22a25a24 , and a21 gates have been declared in Table1 and form a universal set, so the algebra can express any quantum state or algorithm [8]. We need not restrict ourselves to the primitive gates, however.... ..."

### Table 1. Entanglement of

2003

"... In PAGE 4: ... Because she knows the initial state of her created qubits i Q and j Q , her result from measuring j Q and k Q , and the state of qubits sent from Tr, Alice can determine the state of the now entangled qubits i Q and l Q . Using the state of i Q and j Q , and the result of her measure of j Q and k Q , the entangled state of i Q and l Q can be determined from Table1... ..."

### Table 2: Characteristics of Quantum Fireballer.

1996

"... In PAGE 102: ...4%) 59(24%) 6 42 48 61(.8%) 63(6%) 66(54%) 64(27%) Table2 0: Admission control performance for a cycle time of 1 second, using a uniformly distributed workload with low bit rate videos. Tables 20 and 21 shows the results of the experiments.... In PAGE 103: ... Determ. Statistical Statistical No Worst-Case Average Worst-Case Average Prediction 2 46 59 66 70(7%) 69(2%) 4 65 70 83 85(5%) 86(14%) 86(10%) 6 74 82 98 102(2%) 102(2%) 103(24%) Table2 1: Admission control performance for a cycle time of 2 seconds, using a uniformly distributed workload with short videos. the 180KBps case and the 60KBps, however, is not dramatic.... In PAGE 103: ... The expectation is that the worst-case deterministic algorithms will perform less well while the statistical algorithms continue to perform close to the optimum. As shown in Table 16 and Table2 3, the performance gap between the Statistical/Worst-... In PAGE 104: ...VIDEO STORAGE SYSTEM ADMISSION CONTROL 91 Video 0 1 2 3 4 5 6 7 8 9 No. of Requests 140 86 45 31 26 6 7 4 2 1 Table2 2: Distribution of videos used in the non-uniform admission control experiments. For each video, the associated number represents the number of times during the experiment that the video is requested to be displayed.... In PAGE 104: ... Statistical Statistical No Worst-Case Average Worst-Case Average Prediction 2 17 23 26(.9%) 26(2%) 27(37%) 27(39%) 4 26 30 35 35(2%) 37(46%) 36(7%) 6 32 35 42(3%) 42(3%) 43(12%) 43(13%) Table2 3: Admission control performance for a cycle time of 1 second, using a \favorite movie quot; workload with medium length videos. as expected.... In PAGE 104: ...7%) 32(15%) 32(10%) 4 35 43 47 48(5%) 49(33%) 49(40%) 6 46 57 66(1%) 65(.6%) 67(39%) 6 46 57 66(1%) 66(10%) Table2 4: Admission control performance for a cycle time of 2 seconds, using a \favorite... In PAGE 119: ... The frame can be decoded correctly in both directions. Movie # Frames Original New Loss % Sukhoi 760 611172 778268 27 Mjackson 564 379168 468100 23 Alien 263 216304 270218 24 Olympics 4008 3383771 4138911 22 3 Stooges 1797 8577387 10859203 26 Table2 5: Loss in compression e ciency when using the SBVS encoding scheme. macroblocks to be dependent on speci c macroblocks, this di erence is higher since the optimal dependent block may not be used.... In PAGE 120: ... Note that the increased playback rate method is not presented since there are no software or hardware devices that can display videos at a speed greater than 30fps. Version # Frames Size BitRate Network I/O (Bytes) (bps) (ms) (ms) Original 4008 20399475 1008492 28 37 Skip Frames 1336 8552763 1516539 43 58 Skip 2 Segments 1338 5698427 1008933 34 37 Skip Subsegments 1068 6543847 1452251 41 208 Alternate File 1337 4138911 733953 21 35 Table2 6: Clip information for the di erent versions of the Olympics video. The network time is the time to send each media block during one cycle.... In PAGE 121: ...FAST FORWARD/REWIND OF MPEG FILES 108 Version # Frames Size BitRate Network I/O (Bytes) (bps) (ms) (ms) Original 1797 11228563 1180574 34 39 Skip Frames 591 7221007 2315977 66 82 Skip 2 Segments 584 3644371 1177279 34 39 Skip Subsegments 591 5731255 1837634 52 209 Alt. File 585 3272963 886204 25 37 Table2 7: Clip information for the di erent versions of the Three stooges video. The network time is the time to send each media block during one cycle.... In PAGE 125: ... Slight loss in quality. Table2 8: Summary of the various methods for implementing fast forward rewind in a dis- tributed video server. Table 28 brie y summarizes the various aspects of each FF/FR method.... ..."

Cited by 1

### Table . Solutions of nonlinear systems (8)

Cited by 1

### Table 2.1: A summary of the SM-fields and their superpartners present in the S-QFD model. The quantum numbers of the various fields are also summarized. All fermion fields are given in terms of two-component (Weyl) spinors.

1995

### Table 1. Translations between logical and algebraic systems.

1997

"... In PAGE 11: ... Composing the translations arising from the Burris-McKenzie approach with those arising from algebraisation yields a further two translations from rst- order logic to quasi-propositional skew Boolean logic and its dual. Table1 summarises the translations between systems: the trivial translations are indicated by \? quot; and the transla- tions of interest here are denoted by \X quot;. In the table and in the sequel, S is the enriched right-handed countable-valued skew Boolean intersection algebra, Sd is the enriched left-handed dual skew Boolean intersection algebra, S is quasi-propositional skew Boolean logic, Sd is quasi- propositional dual skew Boolean logic, and L is a system of rst-order logic with equality.... ..."