• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 80,795
Next 10 →

Table 2: Bounds (10), (12), (14), (24), and (26) for Examples 4, 5, 6, and 14.

in Where is the Nearest Non-Regular Pencil?
by Ralph Byers, Chunyang He, Volker Mehrmann
"... In PAGE 20: ... A Comparison In this appendix we tabulate a brief comparison of some of the upper and lower bounds derived in the body of this paper. Table2 reports bounds (10), (12), (14), (15), (24), and (26) for Examples 4, 5, 6, and the following engineering application. Example 14 The simpli ed, linearized model of a two-dimensional, three-link mobile manipulator derived in [25] is a linear, time invariant descriptor control system E _ x = Ax + Bu y = Cx: The explicit data listed in [25] are E = 2 4 I3 0 0 0 M0 0 0 0 0 3 5 ; A = 2 4 0 I3 0 ?K0 ?D0 FT 0 F0 0 0 3 5 ; B = 2 4 0 S0 0 3 5 ; and C = 2 4 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 3 5 ; where M0 = 2 4 18:7532 ?7:94493 7:94494 ?7:94493 31:8182 ?26:8182 7:94494 ?26:8182 26:8182 3 5 ; D0 = 2 4 ?1:52143 ?1:55168 1:55168 3:22064 3:28467 ?3:28467 ?3:22064 ?3:28467 3:28467 3 5 ; K0 = 2 4 67:4894 69:2393 ?69:2393 69:8124 1:68624 ?1:68617 ?69:8123 ?1:68617 ?68:2707 3 5 ; S0 = 2 4 ?0:216598 ?:033806 0:554659 0:458506 ?0:845154 0:386648 ?:458506 0:845153 0:613353 3 5 ; F0 = 1 0 0 0 0 1 : For Table 2 we applied the bounds to (A; E) for the open-loop pencil A ? E.... In PAGE 20: ... Table 2 reports bounds (10), (12), (14), (15), (24), and (26) for Examples 4, 5, 6, and the following engineering application. Example 14 The simpli ed, linearized model of a two-dimensional, three-link mobile manipulator derived in [25] is a linear, time invariant descriptor control system E _ x = Ax + Bu y = Cx: The explicit data listed in [25] are E = 2 4 I3 0 0 0 M0 0 0 0 0 3 5 ; A = 2 4 0 I3 0 ?K0 ?D0 FT 0 F0 0 0 3 5 ; B = 2 4 0 S0 0 3 5 ; and C = 2 4 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 3 5 ; where M0 = 2 4 18:7532 ?7:94493 7:94494 ?7:94493 31:8182 ?26:8182 7:94494 ?26:8182 26:8182 3 5 ; D0 = 2 4 ?1:52143 ?1:55168 1:55168 3:22064 3:28467 ?3:28467 ?3:22064 ?3:28467 3:28467 3 5 ; K0 = 2 4 67:4894 69:2393 ?69:2393 69:8124 1:68624 ?1:68617 ?69:8123 ?1:68617 ?68:2707 3 5 ; S0 = 2 4 ?0:216598 ?:033806 0:554659 0:458506 ?0:845154 0:386648 ?:458506 0:845153 0:613353 3 5 ; F0 = 1 0 0 0 0 1 : For Table2 we applied the bounds to (A; E) for the open-loop pencil A ? E.... In PAGE 21: ...Table 2: Bounds (10), (12), (14), (24), and (26) for Examples 4, 5, 6, and 14. In Table2 , the bound (14) requires a choice of Q and Z in the generalized Schur decomposition. For Examples 4, 5, and 6 we used Q = Z = I, because in these three examples E and A are already upper triangular.... ..."

Table 1: Load Balancing Statistics [18] Shasha D. and Goodman N. Concurrent Search Tree Algorithms, ACM Transactions on Database Systems, 13(1), 1988, pp. 53-90. [19] Weihl E. W. and Wang P. Multi-version Memory: Software cache Management for Concurrent B- Trees, Proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing, 1990, pp. 650-655. [20] Yen I. and Bastani F. Hash Table in Massively Parallel Systems, Proceedings of the 1992 Interna- tional Conferences on Computer Languages, April 20-23, 1992, pp. 660-664.

in Implementing Distributed Search Structures
by Padmashree Krishna, Theodore Johnson 1992
"... In PAGE 16: ... With hot spots the variation is much greater, indicating the nice e ect load balancing has for smoothing the variation and reducing the gradient. Finally Table1 shows the calculated average number of moves made by a node in the entire system, with and without hot spots and with and without load balancing, and the normalized variation of the capacity at each processor from the mean. The table shows that the load balancing reduces the coe cient of variation at the cost of a very small increase in the average moves in the system, indicating that load balancing is e ective with low overhead.... ..."
Cited by 4

Table 5. Bifurcation curve labels for gures 2{7 To complete our work, we consider the curve of Hopf bifurcation of the mixed mode, given by (17)-(18). We begin by noting that this complicated curve passes through the origin tangent to the line 1 = ? 1=a2 22 0 2 = a11(a12 ? a22)=[a22(a11 ? a21)] 2 and asymptotically behaves as the parabola 1 ?a122 a2 22 2 2. In principle, conditions similar to those of (22), (24), (26) may be formulated for the Hopf bifurcation by requiring that at least one of the mixed modes exist and the determinant of the linearization at this mixed mode (16) be negative. Deriving these conditions is quite involved, thus

in Analysis of the normal form associated with a degenerate Hopf-Hopf interaction
by Campbellz And, S A Campbellz, S Saujanix

Table 11: Data for ATUM Traces on 8K Caches References [1] Anant Agarwal, John Hennessy, and Mark Horowitz, \Cache Performance of Operating Systems and Multiprogramming, quot; ACM Transactions on Computer Systems, 6(4):393{431, November 1988. [2] Anant Agarwal and Steven D. Pudar, \Column-Associative Caches: A Technique for Re- ducing the Miss Rate of Direct-Mapped Caches, quot; in Proceedings of the 20th Annual Inter- national Symposium on Computer Architecture, San Diego, California, pp. 179{190, ACM SIGARCH and IEEE Computer Society, May 17{19, 1993. Computer Architecture News, 21(2), May 1993.

in A Unified Framework for Hybrid Access Cache Design and Its Applications
by Kevin B. Theobald, Herbert H. J. Humy, Guang R. Gao 1993
Cited by 1

Table 13: Data for ATUM Traces on 128K Caches [6] Norman P. Jouppi, \Improving Direct-Mapped Cache Performance by the Addition of a Small Fully-Associative Cache and Prefetch Bu ers, quot; in Proceedings of the 17th Annual International Symposium on Computer Architecture, Seattle, Washington, pp. 364{373, IEEE Computer Society and ACM SIGARCH, May 28{31, 1990. Computer Architecture News, 18(2), June 1990. [7] S. Przybylski, M. Horowitz, and J. Hennessy, \Performance Tradeo s in Cache Design, quot; in Proceedings of the 15th Annual International Symposium on Computer Architecture, Honolulu, Hawaii, pp. 290{298, IEEE Computer Society and ACM SIGARCH, May 30{ June 2, 1988. Computer Architecture News, 16(2), May 1988. 36

in A Unified Framework for Hybrid Access Cache Design and Its Applications
by Kevin B. Theobald, Herbert H. J. Humy, Guang R. Gao 1993
Cited by 1

Table 14: Data for Multitasking Traces on 8K Caches [8] Andr e Seznec, \A case for two-way skewed-associative caches, quot; in Proceedings of the 20th Annual International Symposium on Computer Architecture, San Diego, California, pp. 169{178, ACM SIGARCH and IEEE Computer Society, May 17{19, 1993. Computer Architecture News, 21(2), May 1993. [9] Alan Jay Smith, \Cache Memories, quot; ACM Computing Surveys, 14(3):473{530, September 37

in A Unified Framework for Hybrid Access Cache Design and Its Applications
by Kevin B. Theobald, Herbert H. J. Humy, Guang R. Gao 1993
Cited by 1

TABLE III Comparison of state estimate RMSE over 120 time points for system defined by (23) and (24). standard deviation of 0.0111) over the 120 time points is somewhat larger than the 0.2120 and 0.2122 reported for the two neural lters in Figure 2.4 of [26], one should keep in mind that the number of training data N = 800 we used is much smaller than the e ective size of the training set

in Optimum Nonlinear Filtering
by Simon Haykin, Paul Yee, Eric Derbez 1997
Cited by 2

Table 10. Glycemic Parameters in 24- to 26-Week Combination Studies of AVANDIA Plus Sulfonylurea

in unknown title
by unknown authors
"... In PAGE 31: ... In these studies, the combination of AVANDIA 4 mg or 8 mg daily (administered as single or twice daily divided doses) and a sulfonylurea significantly reduced FPG and HbA1c compared to placebo plus sulfonylurea or further up-titration of the sulfonylurea. Table10 shows pooled data for 8 studies in which AVANDIA added to sulfonylurea was compared to placebo plus sulfonylurea. ... ..."

Table 1: Average test performance by di erent formulations and cross-validation methods on sunspot. (Each entry in the second thru fth columns represents a mean value with 95% con dence and 10% of the value indicated. The last column shows the number of runs needed to achieve the required level of con dence. Bold numbers indicate the best results. Each run took approximately 24 to 26 seconds on a 450-MHz Pentium-III computer under Solaris 7. The ANN used has one input, two hidden units, one output, and 11 weights.) Method 1921-1955 1956-1979 1980-1994 1921-1994 Runs

in Time-series predictions using constrained formulations for neural-network training and cross validation
by Benjamin W. Wah, Minglun Qian 2000
"... In PAGE 5: ... CSA amp;V2: Constrained formulation trained by CSA with proposed cross-validation, using sunspot patterns from 1881 to 1920 as the vali- dation set. Table1 compares the average test performance of the ve methods. The much better results of CSA over SA on all four test durations (without cross val- idation) demonstrate the merits of using constraints in the problem formulation.... ..."
Cited by 6

Table 2: Socfindo establishment costs and up keep for new palm oil plantings

in Indonesia's Palm Oil Subsector
by Donald F. Larson
"... In PAGE 13: ... However, a recent paper based on field costs nine oil palm estates owned by Socfindo (International Planters Conference, October 24-26, 1994) suggests that the costs may be much lower. Table2 provides the average costs for establishing new palm plants and maintaining the immature plants. Table 3 provides cost of production data for mature plantations, including depreciation and overhead.... ..."
Next 10 →
Results 1 - 10 of 80,795
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University