1000 resultados para Silver Pohlig Hellman algorithm


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Upon UV-irradiation at 254 nm, the photoluminescence of silver atoms in zeolite-Y decreases, meanwhile an absorption band shows up around 840 nm. By photostimulation at 840 nm, fluorescence of silver atoms is detected, which is called photostimulated luminescence, and the photoluminescence of silver atoms is increased slightly. These phenomena are attributed to the charge-transfer interaction between the zeolite framework and the entrapped silver atoms. (C) 1997 Published by Elsevier Science B.V.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

An improved BP algorithm for pattern recognition is proposed in this paper. By a function substitution for error measure, it resolves the inconsistency of BP algorithm for pattern recognition problems, i.e. the quadratic error is not sensitive to whether the training pattern is recognized correctly or not. Trained by this new method, the computer simulation result shows that the convergence speed is increased to treble and performance of the network is better than conventional BP algorithm with momentum and adaptive step size.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A novel ameliorated phase generated carrier (PGC) demodulation algorithm based on arctangent function and differential-self-multiplying (DSM) is proposed in this paper. The harmonic distortion due to nonlinearity and the stability with light intensity disturbance (LID) are investigated both theoretically and experimentally. The nonlinearity of the PGC demodulation algorithm has been analyzed and an analytical expression of the total-harmonic-distortion (THD) has been derived. Experimental results have confirmed the low harmonic distortion of the ameliorated PGC algorithm as expected by the theoretical analysis. Compared with the traditional PGC-arctan and PGC-DCM algorithm, the ameliorated PGC algorithm has a much lower THD as well as a better signal-to-noise-and-distortion (SINAD). A THD of below 0.1% and a SINAD of 60 dB have been achieved with PGC modulation depth (value) ranges from 1.5 to 3.5 rad. The stability performance with LID has also been studied. The ameliorated PGC algorithm has a much higher stability than the PGC-DCM algorithm. It can keep stable operations with LID depth as large as 26.5 dB and LID frequency as high as 1 kHz. The system employing the ameliorated PGC demodulation algorithm has a minimum detectable phase shift of 5 mu rad/root Hz @ 1 kHz, a large dynamic range of 120 dB @ 100 Hz, and a high linearity of better than 99.99%.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

An electrically bistable device has been fabricated using nanocomposite films consisting of silver nanoparticles and a semiconducting polymer by a simple spin-coating method. The current-voltage characteristics of the as-fabricated devices exhibit an obvious electrical bistability and negative differential resistance effect. The current ratio between the high-conducting state and low-conducting state can reach more than 103 at room temperature. The electrical bistability of the device is attributed to the electric-filed-induced charge transfer between the silver nanoparticles and the polymer, and the negative differential resistance behavior is related to the charge trapping in the silver nanoparticles. The results open up a simple approach to fabricate high quality electrically bistable devices by doping metal nanoparticles into polymer.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Tianjin University of Technology

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, as an extension of minimum unsatisfied linear relations problem (MIN ULR), the minimum unsatisfied relations (MIN UR) problem is investigated. A triangle evolution algorithm with archiving and niche techniques is proposed for MIN UR problem. Different with algorithms in literature, it solves MIN problem directly, rather than transforming it into many sub-problems. The proposed algorithm is also applicable for the special case of MIN UR, in which it involves some mandatory relations. Numerical results show that the algorithm is effective for MIN UR problem and it outperforms Sadegh's algorithm in sense of the resulted minimum inconsistency number, even though the test problems are linear.