Page 1 Next

Displaying 1 – 20 of 253

Showing per page

A chaos-based secure cluster protocol for wireless sensor networks

Qian Fang, Ying Liu, Xiaoqun Zhao (2008)


Security mechanisms for wireless sensor networks (WSN) face a great challenge due to the restriction of their small sizes and limited energy. Hence, many protocols for WSN are not designed with the consideration of security. Chaotic cryptosystems have the advantages of high security and little cost of time and space, so this paper proposes a secure cluster routing protocol based on chaotic encryption as well as a conventional symmetric encryption scheme. First, a principal-subordinate chaotic function...

A collector for information without probability in a fuzzy setting

Doretta Vivona, Maria Divari (2005)


In the fuzzy setting, we define a collector of fuzzy information without probability, which allows us to consider the reliability of the observers. This problem is transformed in a system of functional equations. We give the general solution of that system for collectors which are compatible with composition law of the kind “inf”.

A Fractional LC − RC Circuit

Ayoub, N., Alzoubi, F., Khateeb, H., Al-Qadi, M., Hasan (Qaseer), M., Albiss, B., Rousan, A. (2006)

Fractional Calculus and Applied Analysis

Mathematics Subject Classification: 26A33, 30B10, 33B15, 44A10, 47N70, 94C05We suggest a fractional differential equation that combines the simple harmonic oscillations of an LC circuit with the discharging of an RC circuit. A series solution is obtained for the suggested fractional differential equation. When the fractional order α = 0, we get the solution for the RC circuit, and when α = 1, we get the solution for the LC circuit. For arbitrary α we get a general solution which shows how the...

A generalization of the graph Laplacian with application to a distributed consensus algorithm

Guisheng Zhai (2015)

International Journal of Applied Mathematics and Computer Science

In order to describe the interconnection among agents with multi-dimensional states, we generalize the notion of a graph Laplacian by extending the adjacency weights (or weighted interconnection coefficients) from scalars to matrices. More precisely, we use positive definite matrices to denote full multi-dimensional interconnections, while using nonnegative definite matrices to denote partial multi-dimensional interconnections. We prove that the generalized graph Laplacian inherits the spectral...

A large family of Boolean functions

Huaning Liu, Min Zhang (2016)

Acta Arithmetica

In a series of papers many Boolean functions with good cryptographic properties were constructed using number-theoretic methods. We construct a large family of Boolean functions by using polynomials over finite fields, and study their cryptographic properties: maximum Fourier coefficient, nonlinearity, average sensitivity, sparsity, collision and avalanche effect.

A multiplication theorem for two-variable positive real matrices

Fazlollah M. Reza (1985)

Aplikace matematiky

A multiplication-division theorem is derived for the positive real functions of two complex variables. The theorem is generalized to encompass the product of positive real functions of two complex variables. The theorem is generalized to encompass the product of positive real matrices whose elements are functions of two complex variables. PRF and PR matrices occur frequantly in the study of electrical multiports and multivariable systems (such as digital filters).

A numerically efficient approach to the modelling of double-Qdot channels

A. Shamloo, A.P. Sowa (2013)

Nanoscale Systems: Mathematical Modeling, Theory and Applications

We consider the electronic properties of a system consisting of two quantum dots in physical proximity, which we will refer to as the double-Qdot. Double-Qdots are attractive in light of their potential application to spin-based quantum computing and other electronic applications, e.g. as specialized sensors. Our main goal is to derive the essential properties of the double-Qdot from a model that is rigorous yet numerically tractable, and largely circumvents the complexities of an ab initio simulation....

A Test for the Stability of Networks

Agnieszka Rowinska-Schwarzweller, Christoph Schwarzweller (2013)

Formalized Mathematics

A complex polynomial is called a Hurwitz polynomial, if all its roots have a real part smaller than zero. This kind of polynomial plays an all-dominant role in stability checks of electrical (analog or digital) networks. In this article we prove that a polynomial p can be shown to be Hurwitz by checking whether the rational function e(p)/o(p) can be realized as a reactance of one port, that is as an electrical impedance or admittance consisting of inductors and capacitors. Here e(p) and o(p) denote...

Currently displaying 1 – 20 of 253

Page 1 Next