Persons who served more than six months in the War of 1812 : letter from the Secretary of War, transmitting in compliance with a resolution of the House calling for a statement of the number of officers, non-commissioned officers, privates, &c., who served for a period of six months and upwards in the War of 1812.--

Caption title.

Flow regime prediction via froude number calculation in a rock-bedded stream

Mathematical predictions of flow conditions along a steep gradient rock bedded stream are examined. Stream gage discharge data and Manning's Equation are used to calculate alternative velocities, and subsequently Froude Numbers, assuming varying values of velocity coefficient, full depth or depth adjusted for vertical flow separation. Comparison of the results with photos show that Froude Numbers calculated from velocities derived from Manning's Equation, assuming a velocity coefficient of 1.30 and full depth, most accurately predict flow conditions, when supercritical flow is defined as Froude Number values above 0.84. Calculated Froude Number values between 0.8 and 1.1 correlate well with observed transitional flow, defined as the first appearance of small diagonal waves. Transitions from subcritical through transitional to clearly supercritical flow are predictable. Froude Number contour maps reveal a sinuous rise and fall of values reminiscent of pool riffle energy distribution.

The Number of Militia Called into the Public Service in 1813

Full Title: Letters from the Secretary of War to the Committee of Ways and Means, in relation to the number of Militia called into the public service in 1813, to a provision for paying the bounties and premiums to soldiers lately authorized, and to the strength of the army March, 3, 1814. Read, and ordered to be printed. U.S. 13th Congress 2nd Session, 1813-1814. House.

List of the number of loads dredged by Smiley’s Dredge since the 1st of October along the Welland Railway

List of the number of loads dredged by Smiley’s Dredge since the 1st of October along the Welland Railway. This is addressed to S.D. Woodruff and signed by James Woodall of Lock No. 1. There are holes and stains in the document. Text is not affected, Jan. 12, 1859.

Note regarding the number of days Fred Holmes was employed upon the Port Robinson and Thorold macadamized road during the months of July and August

Note regarding the number of days Fred Holmes was employed upon the Port Robinson and Thorold macadamized road during the months of July and August. This is signed by S.D. Woodruff and Fred Holmes, November, 1857.

On some Density Theorems in Number Theory and Group Theory

Gowers, dans son article sur les matrices quasi-aléatoires, étudie la question, posée par Babai et Sos, de l'existence d'une constante $c>0$ telle que tout groupe fini possède un sous-ensemble sans produit de taille supérieure ou égale a $c|G|$. En prouvant que, pour tout nombre premier $p$ assez grand, le groupe $PSL_2(\mathbb{F}_p)$ (d'ordre noté $n$) ne posséde aucun sous-ensemble sans produit de taille $c n^{8/9}$, il y répond par la négative. Nous allons considérer le probléme dans le cas des groupes compacts finis, et plus particuliérement des groupes profinis $SL_k(\mathbb{Z}_p)$ et $Sp_{2k}(\mathbb{Z}_p)$. La premiére partie de cette thése est dédiée à l'obtention de bornes inférieures et supérieures exponentielles pour la mesure suprémale des ensembles sans produit. La preuve nécessite d'établir préalablement une borne inférieure sur la dimension des représentations non-triviales des groupes finis $SL_k(\mathbb{Z}/(p^n\mathbb{Z}))$ et $Sp_{2k}(\mathbb{Z}/(p^n\mathbb{Z}))$. Notre théoréme prolonge le travail de Landazuri et Seitz, qui considérent le degré minimal des représentations pour les groupes de Chevalley sur les corps finis, tout en offrant une preuve plus simple que la leur. La seconde partie de la thése à trait à la théorie algébrique des nombres. Un polynome monogéne $f$ est un polynome unitaire irréductible à coefficients entiers qui endengre un corps de nombres monogéne. Pour un nombre premier $q$ donné, nous allons montrer, en utilisant le théoréme de densité de Tchebotariov, que la densité des nombres premiers $p$ tels que $t^q -p$ soit monogéne est supérieure ou égale à $(q-1)/q$. Nous allons également démontrer que, quand $q=3$, la densité des nombres premiers $p$ tels que $\mathbb{Q}(\sqrt[3]{p})$ soit non monogéne est supérieure ou égale à $1/9$.

Development of Time - Frequency Techniques for Sonar Applications

Sonar signal processing comprises of a large number of signal processing algorithms for implementing functions such as Target Detection, Localisation, Classification, Tracking and Parameter estimation. Current implementations of these functions rely on conventional techniques largely based on Fourier Techniques, primarily meant for stationary signals. Interestingly enough, the signals received by the sonar sensors are often non-stationary and hence processing methods capable of handling the non-stationarity will definitely fare better than Fourier transform based methods.Time-frequency methods(TFMs) are known as one of the best DSP tools for nonstationary signal processing, with which one can analyze signals in time and frequency domains simultaneously. But, other than STFT, TFMs have been largely limited to academic research because of the complexity of the algorithms and the limitations of computing power. With the availability of fast processors, many applications of TFMs have been reported in the fields of speech and image processing and biomedical applications, but not many in sonar processing. A structured effort, to fill these lacunae by exploring the potential of TFMs in sonar applications, is the net outcome of this thesis. To this end, four TFMs have been explored in detail viz. Wavelet Transform, Fractional Fourier Transfonn, Wigner Ville Distribution and Ambiguity Function and their potential in implementing five major sonar functions has been demonstrated with very promising results. What has been conclusively brought out in this thesis, is that there is no "one best TFM" for all applications, but there is "one best TFM" for each application. Accordingly, the TFM has to be adapted and tailored in many ways in order to develop specific algorithms for each of the applications.

Design and synthesis of efficient mac architectures for high speed decimal processor

Most of the commercial and financial data are stored in decimal fonn. Recently, support for decimal arithmetic has received increased attention due to the growing importance in financial analysis, banking, tax calculation, currency conversion, insurance, telephone billing and accounting. Performing decimal arithmetic with systems that do not support decimal computations may give a result with representation error, conversion error, and/or rounding error. In this world of precision, such errors are no more tolerable. The errors can be eliminated and better accuracy can be achieved if decimal computations are done using Decimal Floating Point (DFP) units. But the floating-point arithmetic units in today's general-purpose microprocessors are based on the binary number system, and the decimal computations are done using binary arithmetic. Only few common decimal numbers can be exactly represented in Binary Floating Point (BF P). ln many; cases, the law requires that results generated from financial calculations performed on a computer should exactly match with manual calculations. Currently many applications involving fractional decimal data perform decimal computations either in software or with a combination of software and hardware. The performance can be dramatically improved by complete hardware DFP units and this leads to the design of processors that include DF P hardware.VLSI implementations using same modular building blocks can decrease system design and manufacturing cost. A multiplexer realization is a natural choice from the viewpoint of cost and speed.This thesis focuses on the design and synthesis of efficient decimal MAC (Multiply ACeumulate) architecture for high speed decimal processors based on IEEE Standard for Floating-point Arithmetic (IEEE 754-2008). The research goal is to design and synthesize deeimal'MAC architectures to achieve higher performance.Efficient design methods and architectures are developed for a high performance DFP MAC unit as part of this research.