The research developed, implemented, and evaluated traditional matrix and graph algorithms at large scale to allow an analyst with domain insight to explore more interactively the properties of large, e.g., consisting of millions or billions of nodes, social and information networks. Depending on the situation, these larger networks may not fit on a single machine. Although we considered traditional matrix and graph algorithms, e.g., regression and low-rank matrix approximation, we took a...

Topics: DTIC Archive, Saunders, Michael, Stanford University Stanford United States, algorithms, social...

0
0.0

Jul 11, 2020
07/20

Jul 11, 2020
by
Stewart, G. W. (Gilbert W.)

texts

######
eye 0

######
favorite 1

######
comment 0

xiii, 441 pages 24 cm

Topics: Matrices -- Data processing, Computers, Mathematics, Matrices -- Informatique, 31.76 numerical...

A computer program is described and presented for calculating finite memory predictors and prediction variances for autoregressive moving average time series models. The Cholesky decomposition algorithm is used, and a number of simplifying results are described and implemented in the program. (Author)

Topics: DTIC Archive, Newton,H Joseph, TEXAS A AND M UNIV COLLEGE STATION INST OF STATISTICS, *TIME SERIES...

A computer program is described and presented for calculating finite memory predictors and prediction variances for autoregressive moving average time series models. The Cholesky decomposition algorithm is used, and a number of simplifying results are described and implemented in the program. (Author)

Topics: DTIC Archive, Newton,H Joseph, TEXAS A AND M UNIV COLLEGE STATION INST OF STATISTICS, *TIME SERIES...

A computer program is described and presented for calculating finite memory predictors and prediction variances for autoregressive moving average time series models. The Cholesky decomposition algorithm is used, and a number of simplifying results are described and implemented in the program. (Author)

Topics: DTIC Archive, Newton,H Joseph, TEXAS A AND M UNIV COLLEGE STATION INST OF STATISTICS, *TIME SERIES...

A computer program is described and presented for calculating finite memory predictors and prediction variances for autoregressive moving average time series models. The Cholesky decomposition algorithm is used, and a number of simplifying results are described and implemented in the program. (Author)

Topics: DTIC Archive, Newton,H Joseph, TEXAS A AND M UNIV COLLEGE STATION INST OF STATISTICS, *TIME SERIES...

A computer program is described and presented for calculating finite memory predictors and prediction variances for autoregressive moving average time series models. The Cholesky decomposition algorithm is used, and a number of simplifying results are described and implemented in the program. (Author)

Topics: DTIC Archive, Newton,H Joseph, TEXAS A AND M UNIV COLLEGE STATION INST OF STATISTICS, *TIME SERIES...

A computer program is described and presented for calculating finite memory predictors and prediction variances for autoregressive moving average time series models. The Cholesky decomposition algorithm is used, and a number of simplifying results are described and implemented in the program. (Author)

Topics: DTIC Archive, Newton,H Joseph, TEXAS A AND M UNIV COLLEGE STATION INST OF STATISTICS, *TIME SERIES...

A computer program is described and presented for calculating finite memory predictors and prediction variances for autoregressive moving average time series models. The Cholesky decomposition algorithm is used, and a number of simplifying results are described and implemented in the program. (Author)

Topics: DTIC Archive, Newton,H Joseph, TEXAS A AND M UNIV COLLEGE STATION INST OF STATISTICS, *TIME SERIES...

A computer program is described and presented for calculating finite memory predictors and prediction variances for autoregressive moving average time series models. The Cholesky decomposition algorithm is used, and a number of simplifying results are described and implemented in the program. (Author)

Topics: DTIC Archive, Newton,H Joseph, TEXAS A AND M UNIV COLLEGE STATION INST OF STATISTICS, *TIME SERIES...

A computer program is described and presented for calculating finite memory predictors and prediction variances for autoregressive moving average time series models. The Cholesky decomposition algorithm is used, and a number of simplifying results are described and implemented in the program. (Author)

Topics: DTIC Archive, Newton,H Joseph, TEXAS A AND M UNIV COLLEGE STATION INST OF STATISTICS, *TIME SERIES...

A computer program is described and presented for calculating finite memory predictors and prediction variances for autoregressive moving average time series models. The Cholesky decomposition algorithm is used, and a number of simplifying results are described and implemented in the program. (Author)

Topics: DTIC Archive, Newton,H Joseph, TEXAS A AND M UNIV COLLEGE STATION INST OF STATISTICS, *TIME SERIES...

Intuitively, if a density operator has small rank, then it should be easier to estimate from experimental data, since in this case only a few eigenvectors need to be learned. We prove two complementary results that confirm this intuition. Firstly, we show that a low-rank density matrix can be estimated using fewer copies of the state, i.e. the sample complexity of tomography decreases with the rank. Secondly, we show that unknown low-rank states can be reconstructed from an incomplete set of...

Topics: DTIC Archive, Flammia, Steven T, University of Washington Seattle United States, quantum theory,...

The focus of this research has been primarily on the development and testing of interactive methodology for attacking very complex and difficult scheduling and routing problems. The research has involved three major components: (1) determining the level of human interaction, (2) developing an interactive interface, and (3) developing mathematical models to aid in the decision making process. The interactive interface has been built around a colorgraphics computer terminal. Two such units have...

Topics: DTIC Archive, Ratliff,H Donald, GEORGIA INST OF TECH ATLANTA SCHOOL OF INDUSTRIAL AND SYSTEMS...

The focus of this research has been primarily on the development and testing of interactive methodology for attacking very complex and difficult scheduling and routing problems. The research has involved three major components: (1) determining the level of human interaction, (2) developing an interactive interface, and (3) developing mathematical models to aid in the decision making process. The interactive interface has been built around a colorgraphics computer terminal. Two such units have...

Topics: DTIC Archive, Ratliff,H Donald, GEORGIA INST OF TECH ATLANTA SCHOOL OF INDUSTRIAL AND SYSTEMS...

The focus of this research has been primarily on the development and testing of interactive methodology for attacking very complex and difficult scheduling and routing problems. The research has involved three major components: (1) determining the level of human interaction, (2) developing an interactive interface, and (3) developing mathematical models to aid in the decision making process. The interactive interface has been built around a colorgraphics computer terminal. Two such units have...

Topics: DTIC Archive, Ratliff,H Donald, GEORGIA INST OF TECH ATLANTA SCHOOL OF INDUSTRIAL AND SYSTEMS...

The focus of this research has been primarily on the development and testing of interactive methodology for attacking very complex and difficult scheduling and routing problems. The research has involved three major components: (1) determining the level of human interaction, (2) developing an interactive interface, and (3) developing mathematical models to aid in the decision making process. The interactive interface has been built around a colorgraphics computer terminal. Two such units have...

Topics: DTIC Archive, Ratliff,H Donald, GEORGIA INST OF TECH ATLANTA SCHOOL OF INDUSTRIAL AND SYSTEMS...

The focus of this research has been primarily on the development and testing of interactive methodology for attacking very complex and difficult scheduling and routing problems. The research has involved three major components: (1) determining the level of human interaction, (2) developing an interactive interface, and (3) developing mathematical models to aid in the decision making process. The interactive interface has been built around a colorgraphics computer terminal. Two such units have...

Topics: DTIC Archive, Ratliff,H Donald, GEORGIA INST OF TECH ATLANTA SCHOOL OF INDUSTRIAL AND SYSTEMS...

The focus of this research has been primarily on the development and testing of interactive methodology for attacking very complex and difficult scheduling and routing problems. The research has involved three major components: (1) determining the level of human interaction, (2) developing an interactive interface, and (3) developing mathematical models to aid in the decision making process. The interactive interface has been built around a colorgraphics computer terminal. Two such units have...

Topics: DTIC Archive, Ratliff,H Donald, GEORGIA INST OF TECH ATLANTA SCHOOL OF INDUSTRIAL AND SYSTEMS...

The focus of this research has been primarily on the development and testing of interactive methodology for attacking very complex and difficult scheduling and routing problems. The research has involved three major components: (1) determining the level of human interaction, (2) developing an interactive interface, and (3) developing mathematical models to aid in the decision making process. The interactive interface has been built around a colorgraphics computer terminal. Two such units have...

Topics: DTIC Archive, Ratliff,H Donald, GEORGIA INST OF TECH ATLANTA SCHOOL OF INDUSTRIAL AND SYSTEMS...

The focus of this research has been primarily on the development and testing of interactive methodology for attacking very complex and difficult scheduling and routing problems. The research has involved three major components: (1) determining the level of human interaction, (2) developing an interactive interface, and (3) developing mathematical models to aid in the decision making process. The interactive interface has been built around a colorgraphics computer terminal. Two such units have...

Topics: DTIC Archive, Ratliff,H Donald, GEORGIA INST OF TECH ATLANTA SCHOOL OF INDUSTRIAL AND SYSTEMS...

The focus of this research has been primarily on the development and testing of interactive methodology for attacking very complex and difficult scheduling and routing problems. The research has involved three major components: (1) determining the level of human interaction, (2) developing an interactive interface, and (3) developing mathematical models to aid in the decision making process. The interactive interface has been built around a colorgraphics computer terminal. Two such units have...

Topics: DTIC Archive, Ratliff,H Donald, GEORGIA INST OF TECH ATLANTA SCHOOL OF INDUSTRIAL AND SYSTEMS...

The focus of this research has been primarily on the development and testing of interactive methodology for attacking very complex and difficult scheduling and routing problems. The research has involved three major components: (1) determining the level of human interaction, (2) developing an interactive interface, and (3) developing mathematical models to aid in the decision making process. The interactive interface has been built around a colorgraphics computer terminal. Two such units have...

Topics: DTIC Archive, Ratliff,H Donald, GEORGIA INST OF TECH ATLANTA SCHOOL OF INDUSTRIAL AND SYSTEMS...

The ratio of the values of optimal integer and fractional solutions to a set covering problem was shown by Johnson and Lovasz to be bounded by B(d) = 1 + ln(d), where d is the largest column sum.

Topics: DTIC Archive, Balas,Egon, CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP,...

The ratio of the values of optimal integer and fractional solutions to a set covering problem was shown by Johnson and Lovasz to be bounded by B(d) = 1 + ln(d), where d is the largest column sum.

Topics: DTIC Archive, Balas,Egon, CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP,...

The ratio of the values of optimal integer and fractional solutions to a set covering problem was shown by Johnson and Lovasz to be bounded by B(d) = 1 + ln(d), where d is the largest column sum.

Topics: DTIC Archive, Balas,Egon, CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP,...

The ratio of the values of optimal integer and fractional solutions to a set covering problem was shown by Johnson and Lovasz to be bounded by B(d) = 1 + ln(d), where d is the largest column sum.

Topics: DTIC Archive, Balas,Egon, CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP,...

The ratio of the values of optimal integer and fractional solutions to a set covering problem was shown by Johnson and Lovasz to be bounded by B(d) = 1 + ln(d), where d is the largest column sum.

Topics: DTIC Archive, Balas,Egon, CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP,...

The ratio of the values of optimal integer and fractional solutions to a set covering problem was shown by Johnson and Lovasz to be bounded by B(d) = 1 + ln(d), where d is the largest column sum.

Topics: DTIC Archive, Balas,Egon, CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP,...

The ratio of the values of optimal integer and fractional solutions to a set covering problem was shown by Johnson and Lovasz to be bounded by B(d) = 1 + ln(d), where d is the largest column sum.

Topics: DTIC Archive, Balas,Egon, CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP,...

The ratio of the values of optimal integer and fractional solutions to a set covering problem was shown by Johnson and Lovasz to be bounded by B(d) = 1 + ln(d), where d is the largest column sum.

Topics: DTIC Archive, Balas,Egon, CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP,...

The ratio of the values of optimal integer and fractional solutions to a set covering problem was shown by Johnson and Lovasz to be bounded by B(d) = 1 + ln(d), where d is the largest column sum.

Topics: DTIC Archive, Balas,Egon, CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP,...

The ratio of the values of optimal integer and fractional solutions to a set covering problem was shown by Johnson and Lovasz to be bounded by B(d) = 1 + ln(d), where d is the largest column sum.

Topics: DTIC Archive, Balas,Egon, CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP,...

The derivation of the method developed by Frieman and Kroll (1973) for the calculation of electromagnetic fields due to a transmitting antenna within a one-dimensional profile of electrical conductivity starts with Maxwell's equations in the charge-rationalized MKS system of units. (Author)

Topics: DTIC Archive, Young,Peter D, SCRIPPS INSTITUTION OF OCEANOGRAPHY LA JOLLA CA, *MATHEMATICAL MODELS,...

The derivation of the method developed by Frieman and Kroll (1973) for the calculation of electromagnetic fields due to a transmitting antenna within a one-dimensional profile of electrical conductivity starts with Maxwell's equations in the charge-rationalized MKS system of units. (Author)

Topics: DTIC Archive, Young,Peter D, SCRIPPS INSTITUTION OF OCEANOGRAPHY LA JOLLA CA, *MATHEMATICAL MODELS,...

The derivation of the method developed by Frieman and Kroll (1973) for the calculation of electromagnetic fields due to a transmitting antenna within a one-dimensional profile of electrical conductivity starts with Maxwell's equations in the charge-rationalized MKS system of units. (Author)

Topics: DTIC Archive, Young,Peter D, SCRIPPS INSTITUTION OF OCEANOGRAPHY LA JOLLA CA, *MATHEMATICAL MODELS,...

The derivation of the method developed by Frieman and Kroll (1973) for the calculation of electromagnetic fields due to a transmitting antenna within a one-dimensional profile of electrical conductivity starts with Maxwell's equations in the charge-rationalized MKS system of units. (Author)

Topics: DTIC Archive, Young,Peter D, SCRIPPS INSTITUTION OF OCEANOGRAPHY LA JOLLA CA, *MATHEMATICAL MODELS,...

The derivation of the method developed by Frieman and Kroll (1973) for the calculation of electromagnetic fields due to a transmitting antenna within a one-dimensional profile of electrical conductivity starts with Maxwell's equations in the charge-rationalized MKS system of units. (Author)

Topics: DTIC Archive, Young,Peter D, SCRIPPS INSTITUTION OF OCEANOGRAPHY LA JOLLA CA, *MATHEMATICAL MODELS,...

The derivation of the method developed by Frieman and Kroll (1973) for the calculation of electromagnetic fields due to a transmitting antenna within a one-dimensional profile of electrical conductivity starts with Maxwell's equations in the charge-rationalized MKS system of units. (Author)

Topics: DTIC Archive, Young,Peter D, SCRIPPS INSTITUTION OF OCEANOGRAPHY LA JOLLA CA, *MATHEMATICAL MODELS,...

The derivation of the method developed by Frieman and Kroll (1973) for the calculation of electromagnetic fields due to a transmitting antenna within a one-dimensional profile of electrical conductivity starts with Maxwell's equations in the charge-rationalized MKS system of units. (Author)

Topics: DTIC Archive, Young,Peter D, SCRIPPS INSTITUTION OF OCEANOGRAPHY LA JOLLA CA, *MATHEMATICAL MODELS,...

The derivation of the method developed by Frieman and Kroll (1973) for the calculation of electromagnetic fields due to a transmitting antenna within a one-dimensional profile of electrical conductivity starts with Maxwell's equations in the charge-rationalized MKS system of units. (Author)

Topics: DTIC Archive, Young,Peter D, SCRIPPS INSTITUTION OF OCEANOGRAPHY LA JOLLA CA, *MATHEMATICAL MODELS,...

The derivation of the method developed by Frieman and Kroll (1973) for the calculation of electromagnetic fields due to a transmitting antenna within a one-dimensional profile of electrical conductivity starts with Maxwell's equations in the charge-rationalized MKS system of units. (Author)

Topics: DTIC Archive, Young,Peter D, SCRIPPS INSTITUTION OF OCEANOGRAPHY LA JOLLA CA, *MATHEMATICAL MODELS,...

The derivation of the method developed by Frieman and Kroll (1973) for the calculation of electromagnetic fields due to a transmitting antenna within a one-dimensional profile of electrical conductivity starts with Maxwell's equations in the charge-rationalized MKS system of units. (Author)

Topics: DTIC Archive, Young,Peter D, SCRIPPS INSTITUTION OF OCEANOGRAPHY LA JOLLA CA, *MATHEMATICAL MODELS,...

Two modifications are described which have been developed for the single-target ship tracking algorithm of NRL Report 7969 and NRL Memorandum Report 3991. One modification improves the tracking response to strong target maneuvers, and the other allows the use of reports giving target bearing only. (Author)

Topics: DTIC Archive, Willman,W W, NAVAL RESEARCH LAB WASHINGTON DC, *ALGORITHMS, *TRACKING, *OCEAN...

Two modifications are described which have been developed for the single-target ship tracking algorithm of NRL Report 7969 and NRL Memorandum Report 3991. One modification improves the tracking response to strong target maneuvers, and the other allows the use of reports giving target bearing only. (Author)

Topics: DTIC Archive, Willman,W W, NAVAL RESEARCH LAB WASHINGTON DC, *ALGORITHMS, *TRACKING, *OCEAN...

Two modifications are described which have been developed for the single-target ship tracking algorithm of NRL Report 7969 and NRL Memorandum Report 3991. One modification improves the tracking response to strong target maneuvers, and the other allows the use of reports giving target bearing only. (Author)

Topics: DTIC Archive, Willman,W W, NAVAL RESEARCH LAB WASHINGTON DC, *ALGORITHMS, *TRACKING, *OCEAN...

Two modifications are described which have been developed for the single-target ship tracking algorithm of NRL Report 7969 and NRL Memorandum Report 3991. One modification improves the tracking response to strong target maneuvers, and the other allows the use of reports giving target bearing only. (Author)

Topics: DTIC Archive, Willman,W W, NAVAL RESEARCH LAB WASHINGTON DC, *ALGORITHMS, *TRACKING, *OCEAN...

Two modifications are described which have been developed for the single-target ship tracking algorithm of NRL Report 7969 and NRL Memorandum Report 3991. One modification improves the tracking response to strong target maneuvers, and the other allows the use of reports giving target bearing only. (Author)

Topics: DTIC Archive, Willman,W W, NAVAL RESEARCH LAB WASHINGTON DC, *ALGORITHMS, *TRACKING, *OCEAN...

Two modifications are described which have been developed for the single-target ship tracking algorithm of NRL Report 7969 and NRL Memorandum Report 3991. One modification improves the tracking response to strong target maneuvers, and the other allows the use of reports giving target bearing only. (Author)

Topics: DTIC Archive, Willman,W W, NAVAL RESEARCH LAB WASHINGTON DC, *ALGORITHMS, *TRACKING, *OCEAN...

Two modifications are described which have been developed for the single-target ship tracking algorithm of NRL Report 7969 and NRL Memorandum Report 3991. One modification improves the tracking response to strong target maneuvers, and the other allows the use of reports giving target bearing only. (Author)

Topics: DTIC Archive, Willman,W W, NAVAL RESEARCH LAB WASHINGTON DC, *ALGORITHMS, *TRACKING, *OCEAN...