A deflated restarted Lanczos algorithm is given for both solving symmetric linear equations and computing eigenvalues and eigenvectors. The restarting limits the storage so that finding eigenvectors is practical. Meanwhile, the deflating from the presence of the eigenvectors allows the linear equations to generally have good convergence in spite of the restarting. Some reorthogonalization is ne...

We study the scaling behavior of the size of minimum dominating set (MDS) in scale-free networks, with respect to network size N and power-law exponent c, while keeping the average degree fixed. We study ensembles generated by three different network construction methods, and we use a greedy algorithm to approximate theMDS.With a structural cutoff imposed on themaximal degree kmax~ ffiffiffiffi...

abstract Exponential windowing is a widely used technique for suppressing the eeects of old data as new data is added to a matrix. Speciically, given an n p matrix X n and a \forgetting factor" 2 (0; 1), one works with the matrix diag(n1 ; n2 ; : : : ; 1)X n. In this paper we examine an updating algorithm for computing the QR factorization of diag(n1 ; n2 ; : : :; 1)X n and show that it is unco...

Identifying persons with the same stance in topic documents that contain competing viewpoints can help readers construct the background of a topic and facilitate topic reading. In this paper, we propose an unsupervised method for identifying topic persons with the same stance. Specifically, we employ a model-based Expectation-Maximization (EM) method to cluster individuals into positively corre...

The article presents the general notions and algorithm about the Gauss-Jordan method. An eloquent example is given and the Turbo C program illustrated this method. We conclude that we can obtain by this method the determinant, by simple calculations and reducing the rounding errors Cuvinte cheie: metoda Gauss-Jordan, matricea inversă, limbaj de programare Turbo C, pivot. 1. Noţiuni generale Met...

In 1980, Hellman introduced a time/memory trade-off (TMTO) algorithm satisfying the TMTO curve TM = N, where T is the online time, M is the memory and N is the size of the search space. Later work by Biryukov-Shamir incorporated multiple data to obtain the curve TMD = N, where D is the number of data points. In this paper, we describe a new table structure obtained by combining Hellman’s struct...

Signature recognition is the process of verifying a writer’s identity by checking the signature against samples previously stored in the database. Several techniques such as the distance-based and statistical classifiers used for feature extraction on a signature image are not invariant to scaling and rotation and the Scale invariant feature transform (SIFT) though invariant to scaling and rota...

One of the primary approaches to the increasingly important problem of computer security is the Intrusion Detection System. Various architectures and approaches have been proposed including: Statistical, rule-based approaches; Neural Networks; Immune Systems; Genetic Algorithms; and Genetic Programming. This paper focuses on the development of an off-line Intrusion Detection System to analyze a...

In this paper, we apply the Variation of Parameters Method (VPM) for solving initial and boundary value problems of diversified physical nature. The analytical results are calculated in terms of convergent series with easily computable components. The proposed VPM is applied without any discretization, perturbation, transformation or restrictive assumptions and is free from round off errors and...

This paper considers a ray-casting point-in polyhedron test. Although it is conceptually the simple extension of a well-known point-in-polygon ray-casting algorithm, various practical problems appear in 3D, especially, when the boundary of a geometric object is represented as a triangulated surface. When a larger number of points have to be tested regarding their positions on the considered geo...