964 resultados para dispersion curves
Resumo:
We present a novel tunable dispersion compensator that can provide pure slope compensation. The approach uses two specially designed complex fiber Bragg gratings (FBGs) with reversely varied third-order group delay curves to generate the dispersion slope. The slope can be changed by adjusting the relative wavelength positions of the two FBGs. Several design examples of such complex gratings are presented and discussed. Experimentally, we achieve a dispersion slope tuning range of +/-650ps/nm2 with >0.9nm usable bandwidth.
Resumo:
In this study, it was developed a methodology for the determination of the dispersion of a gaseous tracer in porous media using the radiotracer technique. In order to evaluate several porous media, a cylindrical filter was constructed in PVC and connected to a system with constant flow. Inside this unit silica crystals (16-20) mesh was used as porous media and CH3Br (Methyl Bromide) marked with 82Br was used as radiotracer. An instantaneous pulse of tracer was applied in the system entrance and registered by two NaI (3x3)” scintillation detectors located one before and the other after the filter. The curves produced by the radioactive cloud and recorded by the detector were analyzed statistically using the weighted moment method. The mathematical model one considered as great dispersion of tracer was used to evaluate the flow conditions inside the filter system. The results show us that the weight moment method associated with radiotracer techniques is useful to evaluated an industrial filter and allows to measure the residence time distribution, τ, and the axial dispersion, DAB, gas in a porous medium.
Resumo:
The rural electrification is characterized by geographical dispersion of the population, low consumption, high investment by consumers and high cost. Moreover, solar radiation constitutes an inexhaustible source of energy and in its conversion into electricity photovoltaic panels are used. In this study, equations were adjusted to field conditions presented by the manufacturer for current and power of small photovoltaic systems. The mathematical analysis was performed on the photovoltaic rural system I- 100 from ISOFOTON, with power 300 Wp, located at the Experimental Farm Lageado of FCA/UNESP. For the development of such equations, the circuitry of photovoltaic cells has been studied to apply iterative numerical methods for the determination of electrical parameters and possible errors in the appropriate equations in the literature to reality. Therefore, a simulation of a photovoltaic panel was proposed through mathematical equations that were adjusted according to the data of local radiation. The results have presented equations that provide real answers to the user and may assist in the design of these systems, once calculated that the maximum power limit ensures a supply of energy generated. This real sizing helps establishing the possible applications of solar energy to the rural producer and informing the real possibilities of generating electricity from the sun.
Resumo:
This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a wide range of applications. Notably, the new addition algorithm uses for suitably selected curve constants. In comparison, the fastest point addition algorithms for (twisted) Edwards curves stated in the literature use . It is also shown that the new addition algorithm can be implemented with four processors dropping the effective cost to . This implies an effective speed increase by the full factor of 4 over the sequential case. Our results allow faster implementation of elliptic curve scalar multiplication. In addition, the new point addition algorithm can be used to provide a natural protection from side channel attacks based on simple power analysis (SPA).
Resumo:
This paper provides new results about efficient arithmetic on Jacobi quartic form elliptic curves, y 2 = d x 4 + 2 a x 2 + 1. With recent bandwidth-efficient proposals, the arithmetic on Jacobi quartic curves became solidly faster than that of Weierstrass curves. These proposals use up to 7 coordinates to represent a single point. However, fast scalar multiplication algorithms based on windowing techniques, precompute and store several points which require more space than what it takes with 3 coordinates. Also note that some of these proposals require d = 1 for full speed. Unfortunately, elliptic curves having 2-times-a-prime number of points, cannot be written in Jacobi quartic form if d = 1. Even worse the contemporary formulae may fail to output correct coordinates for some inputs. This paper provides improved speeds using fewer coordinates without causing the above mentioned problems. For instance, our proposed point doubling algorithm takes only 2 multiplications, 5 squarings, and no multiplication with curve constants when d is arbitrary and a = ±1/2.