the supercapacitive behavior of polyaniline/mno2-carbon black (pani/mno2-cb), mno2-cb nanocompositesand cb was studied. mno2-cb made by the in situ direct coating method to deposit mno2 onto cb; then pani coating was coated on it. morphology of the nanocomposite was studied by x-ray diffraction (xrd), fourier transform infrared (ft-ir) spectroscopy and scanning electron microscopy (sem). the el...

Contraction theory provides an elegant way of analyzing the behaviors of systems subject to external inputs. Under sometimes easy to check hypotheses, systems can be shown to have the incremental stability property that all trajectories converge to a unique solution. This property is especially interesting when forcing functions are periodic (a globally attracting limit cycle results), as well ...

in this paper, we introduce fractional order of a planar fractional prey-predator system with a nonmonotonic functional response and anti-predator behaviour such that the adult preys can attack vulnerable predators. we analyze the existence and stability of all possibleequilibria. numerical simulations reveal that anti-predator behaviour notonly makes the coexistence of the prey and predator po...

Pure carbon bulk junctions are fabricated based on carbon nanotube (CNT) macrostructures and their electrical transport characteristics are investigated. The planar 1D/2D strand-on-film (SOF) junctions show interesting forceand light-controlled transport behaviors. Considering the excellent chemical stability and good mechanical properties (strength, hardness and elasticity) of CNTs, the SOF ju...

this paper considers the problem of stable limit cycles generating in a class of uncertain nonlinear systems which leads to stable oscillations in the system’s output.this is a wanted behavior in many practical engineering problems. for this purpose, first the equation of the desirable limit cycle is achieved according to shape, amplitude and frequency of the required output oscillations. then,...

In 1996 Kouider and Lonc proved the following natural generalization of Dirac’s Theorem: for any integer k > 2, if G is an n-vertex graph with minimum degree at least n/k, then there are k − 1 cycles in G that together cover all the vertices. This is tight in the sense that there are n-vertex graphs that have minimum degree n/k − 1 and that do not contain k − 1 cycles with this property. A conc...