946 resultados para AdS-CFT and dS-CFT Correspondence


Relevância:

100.00% 100.00%

Publicador:

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This folder contains a notebook that includes handwritten copies of Kirkland's letter of resignation addressed to the Corporation of Harvard University, March 28, 1828; an address of President Kirkland to the students, delivered in the College Chapel after morning prayers, April 1, 1828; a letter from Francis C. Gray accompanied by a vote of the Corporation, April 2, 1828; a letter from Mr. Gray and vote of the Corporation, April 4, 1828; President Kirkland's reply to Mr. Gray, April 5, 1828; the address of the senior class to the President, presented to him the morning after he took leave of the College, April 2, 1828; and an address of the immediate government to Kirkland, April 2, 1828.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Collection consists mainly of correspondence among family members and includes courtship correspondence of J. Doddridge to Julia, 1868-1875, and of Elsa and her future husband, Courtenay Hemenway, 1908-1912. Also included are photographs, genealogical material, a diary, commonplace and wedding books.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Ca. 165 ft. (ca. 60,000 items)

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Calendar published by the Library of Congress in 1917.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

"A series of textbools prepared for the students of the International Correspondence Schools, and containing in permanent form the instruction papers, examination questions, and keys used in their various courses."

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Catholic periodical and literature index

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Genetic algorithms (GAs) are known to locate the global optimal solution provided sufficient population and/or generation is used. Practically, a near-optimal satisfactory result can be found by Gas with a limited number of generations. In wireless communications, the exhaustive searching approach is widely applied to many techniques, such as maximum likelihood decoding (MLD) and distance spectrum (DS) techniques. The complexity of the exhaustive searching approach in the MLD or the DS technique is exponential in the number of transmit antennas and the size of the signal constellation for the multiple-input multiple-output (MIMO) communication systems. If a large number of antennas and a large size of signal constellations, e.g. PSK and QAM, are employed in the MIMO systems, the exhaustive searching approach becomes impractical and time consuming. In this paper, the GAs are applied to the MLD and DS techniques to provide a near-optimal performance with a reduced computational complexity for the MIMO systems. Two different GA-based efficient searching approaches are proposed for the MLD and DS techniques, respectively. The first proposed approach is based on a GA with sharing function method, which is employed to locate the multiple solutions of the distance spectrum for the Space-time Trellis Coded Orthogonal Frequency Division Multiplexing (STTC-OFDM) systems. The second approach is the GA-based MLD that attempts to find the closest point to the transmitted signal. The proposed approach can return a satisfactory result with a good initial signal vector provided to the GA. Through simulation results, it is shown that the proposed GA-based efficient searching approaches can achieve near-optimal performance, but with a lower searching complexity comparing with the original MLD and DS techniques for the MIMO systems.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Este trabalho faz uma leitura do fenômeno da crescente migração de membros no interior do pentecostalismo, na perspectiva da modernidade, demonstrando, através de fundamentação teórica e de pesquisa de campo, quais as relações existentes entre aquele fenômeno e as transformações sociais que caracterizam o mundo moderno. Assim, o primeiro capítulo discute as transformações que ocorrem no campo religioso com o surgimento do mundo moderno, especialmente a secularização, a partir do século XVI, na Europa, e a globalização, fenômeno mais recente, e analisa a situação específica da modernidade latino-americana e das relações próprias entre esta e a religião que nela se produz. O segundo capítulo caracteriza o pentecostalismo e analisa sua correspondência à modernidade tal como ela se manifesta na América Latina. No terceiro capítulo, são discutidas várias abordagens interpretativas do fenômeno da migração inter-religiosa ou trânsito religioso e são apresentados analiticamente os resultados da pesquisa de campo feita pelo autor entre pentecostais no município de São Bernardo do Campo, SP, demonstrando como eles evidenciam a existência de relações intrínsecas entre o fenômeno estudado e a modernidade.Dessa maneira, mostra-se como a religião, reconfigurando-se, seja por adaptação à modernidade, seja por reação a ela, coloca-se não somente como fruto, mas também como fator de modernidade.(AU)

Relevância:

100.00% 100.00%

Publicador:

Resumo:

We analyse the dynamics of a number of second order on-line learning algorithms training multi-layer neural networks, using the methods of statistical mechanics. We first consider on-line Newton's method, which is known to provide optimal asymptotic performance. We determine the asymptotic generalization error decay for a soft committee machine, which is shown to compare favourably with the result for standard gradient descent. Matrix momentum provides a practical approximation to this method by allowing an efficient inversion of the Hessian. We consider an idealized matrix momentum algorithm which requires access to the Hessian and find close correspondence with the dynamics of on-line Newton's method. In practice, the Hessian will not be known on-line and we therefore consider matrix momentum using a single example approximation to the Hessian. In this case good asymptotic performance may still be achieved, but the algorithm is now sensitive to parameter choice because of noise in the Hessian estimate. On-line Newton's method is not appropriate during the transient learning phase, since a suboptimal unstable fixed point of the gradient descent dynamics becomes stable for this algorithm. A principled alternative is to use Amari's natural gradient learning algorithm and we show how this method provides a significant reduction in learning time when compared to gradient descent, while retaining the asymptotic performance of on-line Newton's method.