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.--

At head of title: [78].

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.

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.

Process profiling using frequencies of system calls

In this paper we discuss our research in developing general and systematic method for anomaly detection. The key ideas are to represent normal program behaviour using system call frequencies and to incorporate probabilistic techniques for classification to detect anomalies and intrusions. Using experiments on the sendmail system call data, we demonstrate that we can construct concise and accurate classifiers to detect anomalies. We provide an overview of the approach that we have implemented

Median Sets and Median Number of a Graph

A profile is a finite sequence of vertices of a graph. The set of all vertices of the graph which minimises the sum of the distances to the vertices of the profile is the median of the profile. Any subset of the vertex set such that it is the median of some profile is called a median set. The number of median sets of a graph is defined to be the median number of the graph. In this paper, we identify the median sets of various classes of graphs such as Kp − e, Kp,q forP > 2, and wheel graph and so forth. The median numbers of these graphs and hypercubes are found out, and an upper bound for the median number of even cycles is established.We also express the median number of a product graph in terms of the median number of their factors.

The Parity of the Number of Irreducible Factors for Some Pentanomials

It is well known that Stickelberger-Swan theorem is very important for determining reducibility of polynomials over a binary field. Using this theorem it was determined the parity of the number of irreducible factors for some kinds of polynomials over a binary field, for instance, trinomials, tetranomials, self-reciprocal polynomials and so on. We discuss this problem for type II pentanomials namely x^m +x^{n+2} +x^{n+1} +x^n +1 \in\ IF_2 [x]. Such pentanomials can be used for efficient implementing multiplication in finite fields of characteristic two. Based on the computation of discriminant of these pentanomials with integer coefficients, it will be characterized the parity of the number of irreducible factors over IF_2 and be established the necessary conditions for the existence of this kind of irreducible pentanomials.

Parity of the Number of Irreducible Factors for Composite Polynomials

Various results on parity of the number of irreducible factors of given polynomials over finite fields have been obtained in the recent literature. Those are mainly based on Swan’s theorem in which discriminants of polynomials over a finite field or the integral ring Z play an important role. In this paper we consider discriminants of the composition of some polynomials over finite fields. The relation between the discriminants of composed polynomial and the original ones will be established. We apply this to obtain some results concerning the parity of the number of irreducible factors for several special polynomials over finite fields.

Influence of occupation number of single particle levels on K - K charge transfer in collisions of 90 keV - Ne{^9+} on Ne

The influence of the occupation of the single particle levels on the impact parameter dependent K - K charge transfer occuring in collisions of 90 keV Ne{^9+} on Ne was studied using coupled channel calculations. The energy eigenvalues and matrixelements for the single particle levels were taken from ab initio self consistent MO-LCAO-DIRAC-FOCK-SLATER calculations with occupation numbers corresponding to the single particle amplitudes given by the coupled channel calculations.

Analysis of the relationship between the number of citations and the quality evaluated by experts in psychology journals

Resumen tomado de la publicaci??n

Analysis of successful modes for the implementation and use of open course ware (OCW) & open educational resources (OER) in higher education : the virtual mobility case

Resumen basado en el de la publicaci??n

Image classification for a large number of object categories

L'increment de bases de dades que cada vegada contenen imatges més difícils i amb un nombre més elevat de categories, està forçant el desenvolupament de tècniques de representació d'imatges que siguin discriminatives quan es vol treballar amb múltiples classes i d'algorismes que siguin eficients en l'aprenentatge i classificació. Aquesta tesi explora el problema de classificar les imatges segons l'objecte que contenen quan es disposa d'un gran nombre de categories. Primerament s'investiga com un sistema híbrid format per un model generatiu i un model discriminatiu pot beneficiar la tasca de classificació d'imatges on el nivell d'anotació humà sigui mínim. Per aquesta tasca introduïm un nou vocabulari utilitzant una representació densa de descriptors color-SIFT, i desprès s'investiga com els diferents paràmetres afecten la classificació final. Tot seguit es proposa un mètode par tal d'incorporar informació espacial amb el sistema híbrid, mostrant que la informació de context es de gran ajuda per la classificació d'imatges. Desprès introduïm un nou descriptor de forma que representa la imatge segons la seva forma local i la seva forma espacial, tot junt amb un kernel que incorpora aquesta informació espacial en forma piramidal. La forma es representada per un vector compacte obtenint un descriptor molt adequat per ésser utilitzat amb algorismes d'aprenentatge amb kernels. Els experiments realitzats postren que aquesta informació de forma te uns resultats semblants (i a vegades millors) als descriptors basats en aparença. També s'investiga com diferents característiques es poden combinar per ésser utilitzades en la classificació d'imatges i es mostra com el descriptor de forma proposat juntament amb un descriptor d'aparença millora substancialment la classificació. Finalment es descriu un algoritme que detecta les regions d'interès automàticament durant l'entrenament i la classificació. Això proporciona un mètode per inhibir el fons de la imatge i afegeix invariança a la posició dels objectes dins les imatges. S'ensenya que la forma i l'aparença sobre aquesta regió d'interès i utilitzant els classificadors random forests millora la classificació i el temps computacional. Es comparen els postres resultats amb resultats de la literatura utilitzant les mateixes bases de dades que els autors Aixa com els mateixos protocols d'aprenentatge i classificació. Es veu com totes les innovacions introduïdes incrementen la classificació final de les imatges.