2,256 research outputs found
Pet Watch
This paper outlines our project of building Pet Watch. Pet Watch is a device similar to a Fit Bit except that it tracks your pet’s activity instead of your own. You can then access this data on our website. This paper defines our requirements, how the system works, and how we built this system
Data collection system: Earth Resources Technology Satellite-1
Subjects covered at the meeting concerned results on the overall data collection system including sensors, interface hardware, power supplies, environmental enclosures, data transmission, processing and distribution, maintenance and integration in resources management systems
Sapporo2: A versatile direct -body library
Astrophysical direct -body methods have been one of the first production
algorithms to be implemented using NVIDIA's CUDA architecture. Now, almost
seven years later, the GPU is the most used accelerator device in astronomy for
simulating stellar systems. In this paper we present the implementation of the
Sapporo2 -body library, which allows researchers to use the GPU for -body
simulations with little to no effort. The first version, released five years
ago, is actively used, but lacks advanced features and versatility in numerical
precision and support for higher order integrators. In this updated version we
have rebuilt the code from scratch and added support for OpenCL,
multi-precision and higher order integrators. We show how to tune these codes
for different GPU architectures and present how to continue utilizing the GPU
optimal even when only a small number of particles () is integrated.
This careful tuning allows Sapporo2 to be faster than Sapporo1 even with the
added options and double precision data loads. The code runs on a range of
NVIDIA and AMD GPUs in single and double precision accuracy. With the addition
of OpenCL support the library is also able to run on CPUs and other
accelerators that support OpenCL.Comment: 15 pages, 7 figures. Accepted for publication in Computational
Astrophysics and Cosmolog
Sixth annual conference on alaskan placer mining
An abridged format of papers, presentations and addresses given during the 1984 conference held on March 28-29, 1984, compiled and edited by Daniel E. Walsh and M. Susan Wray
Solving rank structured Sylvester and Lyapunov equations
We consider the problem of efficiently solving Sylvester and Lyapunov
equations of medium and large scale, in case of rank-structured data, i.e.,
when the coefficient matrices and the right-hand side have low-rank
off-diagonal blocks. This comprises problems with banded data, recently studied
by Haber and Verhaegen in "Sparse solution of the Lyapunov equation for
large-scale interconnected systems", Automatica, 2016, and by Palitta and
Simoncini in "Numerical methods for large-scale Lyapunov equations with
symmetric banded data", SISC, 2018, which often arise in the discretization of
elliptic PDEs.
We show that, under suitable assumptions, the quasiseparable structure is
guaranteed to be numerically present in the solution, and explicit novel
estimates of the numerical rank of the off-diagonal blocks are provided.
Efficient solution schemes that rely on the technology of hierarchical
matrices are described, and several numerical experiments confirm the
applicability and efficiency of the approaches. We develop a MATLAB toolbox
that allows easy replication of the experiments and a ready-to-use interface
for the solvers. The performances of the different approaches are compared, and
we show that the new methods described are efficient on several classes of
relevant problems
Color television study Final report, Nov. 1965 - Mar. 1966
Color television camera for transmission from lunar and earth orbits and lunar surfac
Space station stabilization and control study Final engineering report
Simulation of stabilization and control for spinning, manned space station to provide artificial gravity station environmen
Quantum Modeling
We present a modification of Simon's algorithm that in some cases is able to
fit experimentally obtained data to appropriately chosen trial functions with
high probability. Modulo constants pertaining to the reliability and
probability of success of the algorithm, the algorithm runs using only
O(polylog(|Y|)) queries to the quantum database and O(polylog(|X|,|Y|))
elementary quantum gates where |X| is the size of the experimental data set and
|Y| is the size of the parameter space.We discuss heuristics for good
performance, analyze the performance of the algorithm in the case of linear
regression, both one-dimensional and multidimensional, and outline the
algorithm's limitations.Comment: 16 pages, 5 figures, in Proceedings, SPIE Conference on Quantum
Computation and Quantum Information, pp. 116-127, April 21-22, 200
- …