๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A computer study of power-limiter diode behavior

โœ Scribed by Mamoru Kurata


Publisher
Elsevier Science
Year
1974
Tongue
English
Weight
805 KB
Volume
17
Category
Article
ISSN
0038-1101

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Limits on the computing power of biologi
โœ Michael Conrad; Arnon Rosenthal ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› Springer ๐ŸŒ English โš– 457 KB

The theory of computational complexity and certain explicitly-stated hypotheses imply limitations on the information processing power of biological systems. Parallelism, special purpose organization, and analog mechanisms may provide speedup critical for life processes, but have little power in the

Experimental mathematics. I. Computation
โœ Janos Szamosi; Sandor Kristyan ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 273 KB

## Abstract A computational procedure, developed from the power series method, is used to investigate oscillating systems. In addition to its great accuracy and reduced computer time, the method is very easily programmable since the algorithm is provided by the reaction mechanism itself.

Experimental study of a high-power CW di
โœ F. Hajiesmaeilbaigi; H. Razzaghi; M.M. Esfahani; M.R.A. Moghaddam; J. Sabbaghzad ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 137 KB ๐Ÿ‘ 1 views

In this paper we report on the characterization of a diode-side-pumped Nd:YAG rod laser operating at 300 W CW output power. The simulated and measured pump energy distributions in the crystal are compared. The thermal lens effect of the Nd:YAG have been experimentally investigated, and its influence

On limits on the computational power of
โœ Stefan D Bruda; Selim G Akl ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 102 KB

In the data-accumulating paradigm, inputs arrive continuously in real time, and the computation terminates when all the already received data are processed before another datum arrives. Previous research states that a constant upper bound on the running time of a successful algorithm within this par