Encryption algorithms are known to be computationally intensive. They consume a significant amount of computing resources such as CPU time, memory, and battery power. A wireless device, usually with very limited resources, especially battery power, is subject to the problem of energy consumption due to encryption algorithms. Designing energy efficient security protocols first requires an unders...

Traffic monitoring and analysis based on general purpose systems with high speed interfaces, such as Gigabit Ethernet and 10 Gigabit Ethernet, requires carefully designed software in order to achieve the needed performance. One approach to attain such a performance relies on deploying multiple processors. This work analyses some general issues in multiprocessor systems that are particularly cri...

The researcher measured the least number of frequency response functions required for the identification of modal parameters, in order to simplify the identification of modal properties of such systems. In this work, the orbital machines are supposed to be a combination of orbital and non-orbital components. Structural Approach specified the identification of dynamic properties only to those ph...

We consider the direct solution of sparse skew symmetric matrices. We see that the pivoting strategies are similar, but simpler, to those used in the factorization of sparse symmetric indefinite matrices, and we briefly describe the algorithms used in a forthcoming direct code based on multifrontal techniques for the factorization of real skew symmetric matrices. We show how this factorization ...

In this paper, we present a method to solve the quantum marginal problem for symmetric $d$-level systems. The is built upon an efficient semi-definite program that determines compatibility conditions of $m$-body reduced density with global $n$-body matrix supported on space. We illustrate applicability in central information problems several exemplary case studies. Namely, (i) fast variational ...

and Applied Analysis 3 The input and output constraints are satisfied if there exists symmetric matrixX and Y such that [ X ∗ Y T Q ] ≥ 0 with X rr ≤ u 2 r,max, r = 1, 2, . . . , m,

Let k be an algebraically closed field of characteristic not 2 or 3, V a 3-dimensional vector space over k, R a 3-dimensional subspace of V ⊗V , and TV /(R) the quotient of the tensor algebra on V by the ideal generated by R. Raf Bocklandt proved that if TV /(R) is 3-Calabi-Yau, then it is isomorphic to J(w), the “Jacobian algebra” of some w ∈ V . This paper classifies the w ∈ V ⊗3 such that J(...

We present a fast and numerically stable algorithm for computing the eigendecom-position of a symmetric block diagonal plus semiseparable matrix. We report numerical experiments that indicate that our algorithm is signiicantly faster than the standard method which treats the given matrix as a general symmetric dense matrix.

The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection methods onto matrix Kr...

An integral square matrix A is called principally unimodular (PU if every nonsingular principal submatrix is unimodular (that is, has determinant \1). Principal unimodularity was originally studied with regard to skew-symmetric matrices; see [2, 4, 5]; here we consider symmetric matrices. Our main theorem is a generalization of Tutte's excluded minor characterization of totally unimodular matri...