### Table 1: Grids employed.

1994

"... In PAGE 6: ... Ham- mond apos;s experiments with the CM-2 using Dahl apos;s com- munication compiler showed that was a reasonably faithful predictor of communication time. Some statistics of the grids, and their mapping to a 1K-processor machine, are given in Table1 . The last column is the average dilation per grid edge.... ..."

Cited by 2

### Table 1: Implementation results for chaotic time-series prediction

1998

"... In PAGE 4: ...Matlab neural network toolbox and trained using conventional backpropagation algorithms. A summary of the implementation results obtained are presented in Table1 . Two different simulation approaches were used for the chaotic time series prediction problem.... In PAGE 4: ...ifference between the predicted and actual results, in terms of the prediction error is illustrated in Fig. 5. This compares favourably with a conventional fuzzy approach which employed an even finer-grained partitioning strategy ranging from 15 to 29 fuzzy sets to achieve a similar accuracy [Wang92]. For further comparison, the results using a conventional neural network approach which contains 40 nodes in the hidden layer are also included in Table1 . Previous work demonstrated that this size of network resulted in a similar degree of accuracy as a conventional fuzzy reasoning approach employing seven fuzzy sets on each input domain [Wang92].... In PAGE 4: ... Previous work demonstrated that this size of network resulted in a similar degree of accuracy as a conventional fuzzy reasoning approach employing seven fuzzy sets on each input domain [Wang92]. Table1 illustrates that the FNN approach provides a more accurate prediction of the time-series as compared to the conventional neural network approach. However, these results do not highlight that the training time of the conventional neural network was more than a factor of two slower than the largest FNN employed.... ..."

Cited by 2

### Table 7. Characteristics of Standard Oscillators

"... In PAGE 22: ... Existing atomic oscillators are based on the transitions of hydrogen, cesium, rubidium and mercury atoms, although other means using active and passive masers and lasers of various kinds and even pulsars are available [ALL89]. Table7 shows the characteristics for typical oscillators of various types including quartz-crystal oscillators commonly found in electronic equipment. Pulsars are not included in the table because their long term stability, estimated at 6x10-14, is believed better than all other available sources except other pulsars, but only one of them has been studied so far [RAW87].... In PAGE 22: ... On the other hand, local clocks used in computing equipment almost always are designed with uncompensated crystal oscillators. For the three atomic oscillators listed in Table7 the drift/aging column shows the maximum frequency offset per day from nominal standard frequency due to systematic environmental, mechanical and electrical characteristics. The characteristics of cesium clocks have been extensively studied and a parametric model developed [TRY83].... ..."

### Table 6: Employment structure and the local level of innovation Electronics Instruments Chemistry

"... In PAGE 14: ... We expect the coefficient k b , 4 to be more positive if knowledge produced by research field k is a more important input of the innovation sector. Estimation results of (5) are displayed in Table6 . As before, only the coefficients that significantly differ from zero have been kept.... In PAGE 14: ... As before, only the coefficients that significantly differ from zero have been kept. Table6 : Neighbourhood effects on the local level of innovation Electronics Instruments Chemistry Biotechnolo gies Industrial Processes Machines Consumption Employment (Logged) 1,25 [.000] 1,53 [.... ..."

### Table 2. Contents, pricing, and ordering information of a simple electronics toolkit.

1997

"... In PAGE 3: ... Beyond that, students will be furnished with a basic electronics toolkit that is owned by the department. The contents of the toolkits are detailed in Table2 . Its total cost is less than $45.... ..."

Cited by 1

### Table 1 shows a typical subset of the Intermedi- ate Representation as generated by FAST for SIM- PLE, a CFD code,. It describes calculations and mes- sage exchanges taking place at the points of the two- dimensional grid employed by SIMPLE. Grid-point [0, 2]

1994

"... In PAGE 3: ... Table1 : Fraction of the Intermediate Representation for SIMPLE. In a future version of FAST, instead of having the user manually writing the code that generates the In- termediate Representation, we could replace FAST apos;s front-end with the front-end of a parallel programming language like JADE.... ..."

Cited by 19

### Table 5: Oscillation processes in a Neutrino Factory

2006

"... In PAGE 35: ...s explained on Fig. 16. The full demonstration that a Neutrino Factory alone with a complete set of appropriate detectors and two baselines could unambiguously do the job remains, however, to be worked out. According to Table5 , Neutrino Factory potential could be further improved with a detector capable of measuring the charge of the electrons. R amp;D efforts for a liquid argon detector embedded in a magnetic eld are ongoing [141]; the rst curved tracks were recently observed in a 10 litre liquid argon TPC embedded in a magnetic eld [142].... ..."

### Table 1: Observer functions that infer facts from models Observation about state variable x Implications for the model f(x; t) = 0 autonomous cannot explicitly contain t (i.e., f(x) = 0) chaotic cannot be linear chaotic and autonomous order gt; 2 oscillation and autonomous imaginary part of one pair of roots gt; 0 oscillation and autonomous order 2

1996

"... In PAGE 8: ...Table 2: Some observations and the corresponding inferences drawn by the logic system The collection of Scheme functions that identi es mathematical properties of the current candidate model essentially implements the basic operations found in any mathematics text. Some representative examples are shown in Table1 . Mathematical properties of both the model and the physical system are represented declaratively.... In PAGE 16: ... A similar knowledge growth process is also performed for the model. Vari- ous Scheme functions (see Table1 on page 7) are applied to the current candidate model, yielding an initial set of model properties. These model properties take the role of \obser- vations quot; about the behavior of the model, which are then compared to the behavior of the target system.... ..."

Cited by 3

### Table 1: A brief survey of the chaotic image encryption literature Scheme Strengths Weakness and known at- tacks

2008

"... In PAGE 3: ... The first approach has been widely used to design chaotic stream ciphers, while the second is specially employed by chaos-based block encryption schemes. (Refer Table1 for a brief overview on some recent chaos-based image encryption schemes and their properties). The rest of the paper is organized as follows: The next section gives a brief description of the original line map algorithm and its use in encrypting and decrypting images as developed in [2].... ..."

### Table 12 and thence into the polynomials defined by Tables 13 and 14. Thus, K is a chaotically derived integer set equivalent to

"... In PAGE 15: ... All s C , x C , and P have one of the form types shown in Table 12. Table12 . Elementary Form Types for Composites and Primes Simple (Cs) and Primes 2,3,5 Complex (Cx) and Primes gt; 5 A B C D E F G H I J K 2(n+1) 3(n+1) 5(n+1) 30n + 7 30n + 11 30n + 13 30n + 17 30n + 19 30n + 23 30n + 29 30n + 31 Slot 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 Cs A B A C A A B A A A C A A A B A A C A B A A Cx|Pi D E F G H I J K For any integer n, the range 2 30 g43 n to 31 30 g43 n represents a repeating 30-slot module, of which 8 slots, designated D-K in Table 12, hold either primes ( gt; 5) or complex composites.... In PAGE 15: ... Table 12. Elementary Form Types for Composites and Primes Simple (Cs) and Primes 2,3,5 Complex (Cx) and Primes gt; 5 A B C D E F G H I J K 2(n+1) 3(n+1) 5(n+1) 30n + 7 30n + 11 30n + 13 30n + 17 30n + 19 30n + 23 30n + 29 30n + 31 Slot 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 Cs A B A C A A B A A A C A A A B A A C A B A A Cx|Pi D E F G H I J K For any integer n, the range 2 30 g43 n to 31 30 g43 n represents a repeating 30-slot module, of which 8 slots, designated D-K in Table12 , hold either primes ( gt; 5) or complex composites. In effect, the primes and composites compete for these slots, and the stochastic properties of the two sets may be evaluated by the predictability that any given slot will be occupied by a prime or a complex composite.... In PAGE 17: ...Page 17 These characteristics are consistent with a chaotic system, which manifests itself in unpredictability, as n gets large, whether any given Cx|P slot defined in Table12 will be occupied by a prime or a complex composite. The source of this unpredictability is in the intrinsic complexity of solving a system of 36 nonlinear recurrent polynomials in 72 independent variables where the range of each variable extends to infinity.... In PAGE 17: ...Table12... In PAGE 18: ... P and p G also converge to equivalent random distributions in the limit as Sx g165 g174 . As shown in Proposition 4 above, sets P and x C compete for slots in the set of form types D-K defined in Table12 . If, for any slot Si, if there exists no integer pair (n,m) which solves at least one of the polynomials associated with Si, then the slot is occupied by a prime number.... ..."