International Telemetering Conference Proceedings / October 26-29, 1992 / Town and Country Hotel and Convention Center, San Diego, California / The SMART (Smart Modularized Advanced Reusable Telemeter) is an advanced telemetry system. The SMART system enhances the quality of a weapon system by providing an adaptable built-in telemetry capability for the weapon. Existing weapon telemetry systems are centralized, separate components which require many fault-prone interconnections. This system reduces the number of interconnections and provides higher performance than current systems. The modular system uses a high data-rate serial data link that connects remote measurement modules located throughout the unit-under-test. A smart processor is used to analyze and compress data from the various modules prior to transmission, making more effective use of the telemetry bandwidth. The smart processing unit also adapts the measurement units for changing test conditions on-the-fly. The system will allow more complete testing of the weapon system and solve a broader range of problems. The goal of the SMART project is to utilize the most advanced technology to overcome the current design methodologies that have perpetuated shortcomings in present systems. This project is being conceptualized to encompass a broader range of telemetry applications beyond the present weapon systems at Sandia.

Tese de mestr.. Faculdade de Engenharia. Universidade do Porto. 1998

In many areas of engineering and applied mathematics, spectral methods provide very powerful tools for solving and analyzing problems. For instance, large to extremely large sizes of numbers can efficiently be multiplied by using discrete Fourier transform and convolution property. Such computations are needed when computing π to millions of digits of precision, factoring and also big prime search projects. When it comes to the utilization of spectral techniques for modular operations in public key cryptosystems two difficulties arise; the first one is the reduction needed after the multiplication step and the second is the cryptographic sizes which are much shorter than the optimal asymptotic crossovers of spectral methods. In this dissertation, a new modular reduction technique is proposed. Moreover, modular multiplication is given based on this reduction. These methods work fully in the frequency domain with some exceptions such as the initial, final and partial transformations steps. Fortunately, the new technique addresses the reduction problem however, because of the extra complexity coming from the overhead of the forward and backward transformation computations, the second goal is not easily achieved when single operations such as modular multiplication or reduction are considered. On the contrary, if operations that need several modular multiplications with respect to the same modulus are considered, this goal is more tractable. An obvious example of such an operation is the modular exponentiation i.e., the computation of c=m[superscript e] mod n where c, m, e, n are large integers. Therefore following the spectral modular multiplication operation a new modular exponentiation method is presented. Since forward and backward transformation calculations do not need to be performed for every multiplication carried during the exponentiation, the asymptotic crossover for modular exponentiation is decreased to cryptographic sizes. The method yields an efficient and highly parallel architecture for hardware implementations of public-key cryptosystems. / Graduation date: 2006

Thesis (doctoral)--Universität Basel, 1911. / Vita. Includes bibliographical references.

Thesis (Ph. D.)--University of Illinois, 1920. / Vita. "Reprinted from the Transactions of the American Mathematica Society, vol. 23, no. 2, March, 1922."

Thesis (Ph. D.)--University of Chicago. / Autobiography. "Reprinted from the American journal of mathematics, vol. 27, no. 1."

No description available.

No description available.

The Harris-Venkatesh conjecture posits a relationship between the action of derived Hecke operators on weight-one modular forms and Stark units. We prove the full Harris-Venkatesh conjecture for all CM dihedral weight-one modular forms. This reproves results of Darmon-Harris-Rotger-Venkatesh, extends their work to the adelic setting, and removes all assumptions on primality and ramification from the imaginary dihedral case of the Harris-Venkatesh conjecture. This is done by introducing the Harris-Venkatesh period on cuspidal one-forms on modular curves, introducing two-variable optimal modular forms, evaluating GL(2) × GL(2) Rankin-Selberg convolutions on optimal forms and newforms, and proving a modulo-ℓᵗ comparison theorem between the Harris-Venkatesh and Rankin-Selberg periods. Furthermore, these methods explicitly describe local factors appearing in the constant of proportionality prescribed by the Harris-Venkatesh conjecture. We also look at the application of our methods to non-dihedral forms.

published_or_final_version / abstract / Mathematics / Master / Master of Philosophy