Informatica

The conjugate gradient method is an iterative technique used to solve systems of linear equations. The paper analyzes the performance of parallel preconditioned conjugate gradient algorithms. First, a theoretical model is proposed for estimation of the complexity of PPCG method and a scalability analysis is done for three different data decomposition cases. Computational experiments are done on IBM SP4 computer and some results are presented. It is shown that theoretical predictions agree well with computational results.

In this paper, a reliable information hiding scheme based on support vector machine and error correcting codes is proposed. To extract the hidden information bits from a possibly tampered watermarked image with a lower error probability, information hiding is modeled as a digital communication problem, and both the good generalization ability of support vector machine and the error correction code BCH are applied. Due to the good learning ability of support vector machine, it can learn the relationship between the hidden information and corresponding watermarked image; when the watermarked image is attacked by some intentional or unintentional attacks, the trained support vector machine can recover the right hidden information bits. The reliability of the proposed scheme has been tested under different attacks. The experimental results show that the embedded information bits are perceptually transparent and can successfully resist common image processing, jitter attack, and geometrical distortions. When the host image is heavily distorted, the hidden information can also be extracted recognizably, while most of existing methods are defeated. We expect this approach provide an alternative way for reliable information hiding by applying machine learning technologies.

Estimation of the ratio of two totals is considered, when a probability sample from the finite population is available. Four estimators of the ratio are examined. The first one – called “simple” – is the ratio of the Horvitz–Thompson estimators of totals; the second – the ratio of two ratio estimators of totals; the third one – the ratio of two regression estimators of totals. The fourth one is a calibrated estimator of the ratio. The variances of these estimators are compared. The properties of such estimators of the ratio are studied. The simulation results are presented.

The problem of system input selection, dubbed in the literature as Type I Structure Identification problem, is addressed in this paper using an effective novel method. More specifically, the fuzzy curve technique, introduced by Lin and Cunningham (1995), is extended to an advantageous fuzzy surface technique; the latter is used for fast building a coarse model of the system from a subset of the initial candidate inputs. A simple genetic algorithm, enhanced with a local search operator, is used for finding an optimal subset of necessary and sufficient inputs by considering jointly more than one inputs. Extensive simulation results on both artificial data and real world data have demonstrated comparatively the advantages of the proposed method.

A modernization of signature scheme published in (Sakalauskas, 2004) is presented. This scheme differs from the prototype by its structure and uses a more general algebraic systems. It has a higher security and shorter key length and is also more computationally effective.

This paper relates properties of operators with the well-known concepts of positive realness and passivity properties in dynamic systems and their associate transfer functions. Those concepts together with very close related ones are first examined from a physical point of view. Then, they are related with hyperstability and properties of transfer functions while the hyperstability theorem is revisited and interpreted. Finally, the above concepts are compared to the mathematical concepts of positivity and closely related ones in operator theory in Hilbert spaces.

The paper offers a new way of presenting the structure of a sentence. None of the two widely known methods of representation the syntactic structure of a sentence can be of any avail when applied to the Lithuanian language. Neither the tree, based on the phrase structure principle, nor the tree, suggested by the dependency grammar, do reflect all the syntactic information, which a Lithuanian sentence contains.

Most recent papers about visual cryptography for halftone images are dedicated to get a higher contrast decoded image. However, the hidden visual pattern often blends into the background image and leads to a confused image. In this paper, we propose an improved method for halftone image hiding. By using the proposed method, the background image can be eliminated and the hidden visual pattern can be revealed precisely. Experimental results show that the decoded visual patterns could reveal good visual quality under various kinds of input patterns. Furthermore, better visual quality can be obtained when more halftone images are overlaid.

In this paper, we study the fault diagnosis problem for distributed discrete event systems. The model assumes that the system is composed of distributed components that are modeled in labeled Petri nets and interact with each other via sets of common resources (places). Further, a component's own access to a common resource is an observable event. Based on the diagnoser approach proposed by Sampath et al, a distributed fault diagnosis algorithm with communication is presented. The distributed algorithm assumes that the local diagnosis process can exchange messages upon the occurrence of observable events. We prove the distribute diagnosis algorithm is correct in the sense that it recovers the same diagnostic information as the centralized diagnosis algorithm. And then, the OBDD (Ordered Binary Decision Diagrams) is introduced to manage the state explosion problem in state estimation of the system.

Efficient computation of the modular exponentiations is very important and useful for public-key cryptosystems. In this paper, an efficient parallel binary exponentiation algorithm is proposed which based on the Montgomery multiplication algorithm, the signed-digit-folding (SDF) and common-multiplicand-multiplicand (CMM) techniques. By using the CMM technique of computing the common part from two modular multiplications, the same common part in two modular multiplications can be computed once rather twice, we can thus improve the efficiency of the binary exponentiation algorithm by decreasing the number of modular multiplications. By dividing the bit pattern of the minimal-signed-digit recoding exponent into three equal length parts and using the technique of recording the common parts in the folded substrings, the proposed SDF-CMM algorithm can improve the efficiency of the binary algorithm, thus can further decrease the computational complexity of modular exponentiation. Furthermore, by using the proposed parallel SDF-CMM Montgomery binary exponentiation algorithm, on average the total number of single-precision multiplications can be reduced by about 61.3% and 74.1% as compared with Chang-Kuo-Lin's CMM modular exponentiation algorithm and Ha-Moon's CMM Montgomery modular exponentiation algorithm, respectively.