### Table 8. Cut-off frequencies A of the filter array at 200a0

2005

"... In PAGE 14: ...able 7. Design parameters of the common mode feedback circuit. ...............................64 Table8 .... In PAGE 79: ...nd the typical lowpass filter frequency response. Moreover, Fig. 39 shows temperature (~200a0 C). Also, it shows a trivial deviation of the filter gain from the ideal value the very stable variation of 3dB point of Filter #3 in Table8 . As you see, the deviation of the 3dB point is so small that the filter can operate at the high temperature without serious modification.... In PAGE 79: ... Therefore, it is concluded that the filter maintains a relatively fixed 3dB point over the wide temperature variation due to the constant gm biasing circuit. All the filter specifications achieved in the simulation are tabulated in Table8 and 9. Actually, the filter array and the transimpedance amplifier are fabricated together on the same chip.... ..."

### Table 2: Filtering per array.

"... In PAGE 3: ... Results on the total data set Data from the cDNA experiments were analysed and pre- processed as described in the Methods section. See Table 1 and Table2 for details on filtered genes. The experi- ments using aRNA produced superior hybridization qual- ity.... In PAGE 3: ... This was reflected in the lower number of filtered genes per array compared with the total RNA hybridiza- tions. On average, 35% of the genes were filtered from ar- rays hybridized with amplified material, versus 63% of the genes filtered from arrays hybridized with non-ampli- fied material ( Table2 ). As a measurement of array quality, Pearson correlations were calculated between the different arrays.... ..."

### TABLE I FILTERING MODES OF A MACROBLOCK Mode Left* Top* Current

2005

Cited by 1

### Table 1: The table shows Haar wavelet decomposition of array A = [1; 3; 5; 11; 12; 13; 0; 1] and the general formula, with entries in the latter shifted horizontally to fit. The wavelet coefficients (i.e., the local differences) are in bold at each level. The final average (16.2635) plus the wavelet coefficients represent the Haar wavelet transformation of the original array.

2001

"... In PAGE 4: ... We will develop the wavelet background as is typically done using an example computation; see [26] for similar background. Consider the signal of length4 N = 8 given by array A = [1; 3; 5; 11; 12; 13; 0; 1]; its Haar wavelet trans- form computation is shown in Table1 . The transform is computed by convolving the signal with the low pass filter 3Under the North American Numbering Plan, npa is the three digit area code, nxx is the three digit exchange code, and line gives the four digit specific numbering to a telephone in that npa-nxx.... In PAGE 4: ... We will unravel the computation and visualize Haar wavelet transforms in terms of vec- tor computations. Let us number the levels of the binary tree as shown in Table1 with the bottommost level be- ing 0, and the topmost being log N = 3 in this case. For j = 1; : : : ; log N and k = 0; : : : ; 2j ? 1, define the vector j;k(l) =1 for k(N=2j) l k(N=2j)+N=2j ?1, and 0 otherwise.... ..."

Cited by 146

### Table 1: The table shows Haar wavelet decomposition of array A =#5B1;3;5;11; 12; 13; 0; 1#5D and the general formula, with entries in the latter shifted horizontally to fit. The wavelet coefficients (i.e., the local differences) are in bold at each level. The final average (16.2635) plus the wavelet coefficients represent the Haar wavelet transformation of the original array.

2001

"... In PAGE 4: ... We will develop the wavelet background as is typically done using an example computation; see [26] for similar background. Consider the signal of length4 N =8given by array A =#5B1;3;5;11; 12; 13; 0; 1#5D; its Haar wavelet trans- form computation is shown in Table1 . The transform is computed by convolving the signal with the low pass filter 3Under the North American Numbering Plan, npa is the three digit area code, nxx is the three digit exchange code, and line gives the four digit specific numbering to a telephone in that npa-nxx.... In PAGE 4: ... We will unravel the computation and visualize Haar wavelet transforms in terms of vec- tor computations. Let us number the levels of the binary tree as shown in Table1 with the bottommost level be- ing 0, and the topmost being log N =3in this case. For j =1;:::;log N and k =0;:::;2 j ,1, define the vector #1E j;k #28l#29=1fork#28N=2 j #29 #14 l #14 k#28N=2 j #29+N=2 j ,1,and0 otherwise.... ..."

Cited by 146

### Table 1: The table shows Haar wavelet decomposition of array A = [1; 3; 5; 11; 12; 13; 0; 1] and the general formula, with entries in the latter shifted horizontally to fit. The wavelet coefficients (i.e., the local differences) are in bold at each level. The final average (16.2635) plus the wavelet coefficients represent the Haar wavelet transformation of the original array.

2001

"... In PAGE 4: ... We will develop the wavelet background as is typically done using an example computation; see [26] for similar background. Consider the signal of length4 N = 8 given by array A = [1; 3; 5; 11; 12; 13; 0; 1]; its Haar wavelet trans- form computation is shown in Table1 . The transform is computed by convolving the signal with the low pass filter 3Under the North American Numbering Plan, npa is the three digit area code, nxx is the three digit exchange code, and line gives the four digit specific numbering to a telephone in that npa-nxx.... In PAGE 4: ... We will unravel the computation and visualize Haar wavelet transforms in terms of vec- tor computations. Let us number the levels of the binary tree as shown in Table1 with the bottommost level be- ing 0, and the topmost being log N = 3 in this case. For j = 1; : : : ; log N and k = 0; : : : ; 2j ? 1, define the vector j;k(l) =1 for k(N=2j) l k(N=2j)+N=2j ?1, and 0 otherwise.... ..."

Cited by 146

### Table 1: The table shows Haar wavelet decomposition of array A =#5B1;3;5;11; 12; 13; 0; 1#5D and the general formula, with entries in the latter shifted horizontally to fit. The wavelet coefficients (i.e., the local differences) are in bold at each level. The final average (16.2635) plus the wavelet coefficients represent the Haar wavelet transformation of the original array.

2001

"... In PAGE 4: ... We will develop the wavelet background as is typically done using an example computation; see [26] for similar background. Consider the signal of length4 N =8given by array A =#5B1;3;5;11; 12; 13; 0; 1#5D; its Haar wavelet trans- form computation is shown in Table1 . The transform is computed by convolving the signal with the low pass filter 3Under the North American Numbering Plan, npa is the three digit area code, nxx is the three digit exchange code, and line gives the four digit specific numbering to a telephone in that npa-nxx.... In PAGE 4: ... We will unravel the computation and visualize Haar wavelet transforms in terms of vec- tor computations. Let us number the levels of the binary tree as shown in Table1 with the bottommost level be- ing 0, and the topmost being log N =3in this case. For j =1;:::;log N and k =0;:::;2 j ,1, define the vector #1E j;k #28l#29=1fork#28N=2 j #29 #14 l #14 k#28N=2 j #29+N=2 j ,1,and0 otherwise.... ..."

Cited by 146

### Table 5. The bands in these plots are very tight for most of the response fits. Since the confidence curves cross the horizontal line in every case, the models are significant at the 5% confidence level.

"... In PAGE 7: ...9 For each of the responses monitored during the cycle experimentation (the cycle responses as well as the configuration responses for fitting the second level of these partitioned response surfaces), the mean and standard deviation data are calculated for each run of the inner control array across the runs of the outer noise array. Response surface models for mean and standard deviation are then fit to this data; resulting model fits are summarized in Table5 . For each mean and standard deviation response, second and third order response surfaces are fit, and the best fit is chosen (the modified composite experiment is a five level experiment, and thus the third order terms can be added to the basic model of Equation 3 or Equations 4-7; three-way interaction terms are not added).... In PAGE 7: ... For each mean and standard deviation response, second and third order response surfaces are fit, and the best fit is chosen (the modified composite experiment is a five level experiment, and thus the third order terms can be added to the basic model of Equation 3 or Equations 4-7; three-way interaction terms are not added). The order of fit and R2 values for each mean and standard deviation response are given in Table5 . Recall that the response models fit for the configuration mean responses in the cycle factors are actually the second portion of these models, the intercept term models (see Figure 3); the primary models for the configuration... In PAGE 8: ...American Institute of Aeronautics and Astronautics Also, no model is fit for standard deviation of the fan diameter response as this response does not change with the noise factors; no deviation is observed. Table5 Response Surface Fits for Cycle Experimentation Response Order R2 Name of Fit value Performance: Mean SFC SFC 3rd 0.998 Standard Deviation of SFC STDSFC 3rd 0.... In PAGE 8: ... With these relatively small standard deviations these standard deviation approximations for the configuration responses are accepted. In Figure 5 the response model fits for the SFC responses (mean and standard deviation) of Table5 are shown graphically as actual response data (experiment points) versus predicted response values. In these plots, the angled line represents the ideal fit (actual and predicted values being equal) around which the predicted data is scattered; the horizontal dashed line represents the response mean value.... ..."

### Table 2-3 Filter category constants for filter usage

"... In PAGE 20: ... An image unit, which is simply a bundle, can contain one or more image processing filters. If the image unit is installed in one of the locations shown in Table 2-1, then it can be used by any application that calls one of the load methods provided by the CIPlugin class and shown in Table2 -1. You need to load image units only once.... In PAGE 20: ... Filters are categorized to make the list more manageable. If you know a filter category, you can find out the filters available for that category by calling the method filterNamesInCategory: and supplying one of the category constants listed in Table2 -2, Table 2-3 (page 21), or Table 2-4 (page 22). If you want to find all available filters for a list of categories, you can call the method filterNamesInCategories:, supplying an array of category constants from those listed in the tables.... In PAGE 21: ...The usage of the filter (still image, video, high dynamic range, and so forth). See Table2 -3 (page 21). a73 Whether the filter is provided by Core Image (built-in).... In PAGE 21: ... a73 Whether the filter is provided by Core Image (built-in). See Table2 -4 (page 22). Table 2-2 Filter category constants for effect types Indicates Effect type Distortion effects, such as bump, twirl, hole kCICategoryDistortionEffect Geometry adjustment, such as affine transform, crop, perspective transform kCICategoryGeometryAdjustment Compositing, such as source over, minimum, source atop, color dodge blend mode kCICategoryCompositeOperation Halftone effects, such as screen, line screen, hatched kCICategoryHalftoneEffect Color adjustment, such as gamma adjust, white point adjust, exposure kCICategoryColorAdjustment Color effect, such as hue adjust, posterize kCICategoryColorEffect Transitions between images, such as dissolve, disintegrate... In PAGE 26: ... Listing 2-4 Creating a Core Image context from an OpenGL graphics context CIContext *myCIContext; const NSOpenGLPixelFormatAttribute attr[] = { NSOpenGLPFAAccelerated, NSOpenGLPFANoRecovery, NSOpenGLPFAColorSize, 32, 0 }; pf = [[NSOpenGLPixelFormat alloc] initWithAttributes:(void *) amp;attr]; myCIContext = [CIContext contextWithCGLContext: CGLGetCurrentContext() pixelFormat: [pf CGLPixelFormatObj] options: nil]; Get the Image to Process Core Image filters process Core Image images (CIImage objects). Table2 -5 lists the methods that create a CIImage object. The method you use depends on the source of the image.... In PAGE 68: ... See Create a Core Image Context (page 25). Fixed formatting and, in online versions of this document, provided hyperlinks to the image creation functions in Table2 -5 (page 26). Added hyperlinks to most symbols and to sample code available in the ADC Reference Library.... ..."

### Table 1 Number of vias after horizontal/vertical filters ( C* are ISCAS benchmarks) Circuit Transistor Vias# Vias# Reduction quot;underground

"... In PAGE 9: ... This vertical polysilicon is a short wire, with no impact in the parasitic capacitance of the cell. Table1 illustrates in the third column the number of vias when using a greedy router with no optimizations (filters), in the fourth column the number of vias after vertical and horizontal optimizations, in the fifth column the via reduction rate and finally the total number of quot;underground quot; solutions in these circuits. The number of vias is in the channel routing, without the vias of the interface line .... ..."