Informatica

In the previous papers (Pupeikis, 2000; Genov et al., 2006), a direct approach for estimating the parameters of a discrete-time linear time-invariant (LTI) dynamic system, acting in a closed-loop in the case of additive correlated noise with contaminating outliers uniformly spread in it, is presented. It is assumed here that the parameters of the LQG (Linear Quadratic Gaussian Control) controller are known beforehand. The aim of the given paper is development of a parametric identification approach for a closed-loop system when the parameters of an LTI system as well as that of LQG controller are not known and ought to be estimated. The recursive techniques based on an the M- and GM- estimator algorithms are applied here in the calculation of the system as well as noise filter parameters. Afterwards, the recursive parameter estimates are used in each current iteration to determine unknown parameters of the LQG-controller, too. The results of numerical simulation by computer are discussed.

Advanced Encryption Standard (AES) block cipher system is widely used in cryptographic applications. A nonlinear substitution operation is the main factor of the AES cipher system strength. The purpose of the proposed approach is to generate the random S-boxes changing for every change of the secret key. The fact that the S-boxes are randomly key-dependent and unknown is the main strength of the new approach, since both linear and differential cryptanalysis require known S-boxes. In the paper, we briefly analyze the AES algorithm, substitution S-boxes, linear and differential cryptanalysis, and describe a randomly key-dependent S-box and inverse S-box generation algorithm. After that, we introduce the independency measure of the S-box elements, and experimentally investigate the quality of the generated S-boxes.

We tested the ability of humans and machines (data mining techniques) to assign stress to Slovene words. This is a challenging comparison for machines since humans accomplish the task outstandingly even on unknown words without any context. The goal of finding good machine-made models for stress assignment was set by applying new methods and by making use of a known theory about rules for stress assignment in Slovene. The upgraded data mining methods outperformed expert-defined rules on practically all subtasks, thus showing that data mining can more than compete with humans when constructing formal knowledge about stress assignment is concerned. Unfortunately, compared to humans directly, the data mining methods still failed to achieve as good results as humans on assigning stress to unknown words.

This paper presents a novel data modulation scheme PCCD-OFDM-ASK: the phase continuous context dependent orthogonal frequency division multiplexing amplitude shift keying. The proposed modulation is successfully applied in the mobile payment system. It is used to transmit the digital data over the speech channel of the mobile communication system GSM, as well as CDMA. The main key points of the proposed modulation schemes are: precise signal synchronization between the modulator and demodulator, signal energy independent operation, on line adaptation of frequency characteristics of the transmission channel, and controlled frequency bandwidth thus enabling non-overlapped full duplex communication over the GSM's voice channel.

The objective of this paper is the description, justification, and web-based implementation of polynomial time algorithms for equilibrium search of Quadratic Bimatrix Games (QBG). An algorithm is proposed combining exact and heuristic parts. The exact part has the Irelevant Fraud (IF) component for cases when an equilibrium exists with no pure strategies. The Direct Search (DS) component finds a solution if an equilibrium exists in pure strategies. The heuristic Quadratic Strategy Elimination (QSE) part applies IF and DS to reduced matrices obtained by sequential elimination of strategies that lead to non-positive IF solutions. Finally, penalties needed to prevent unauthorized deals are calculated based on Nash axioms of two-person bargaining theory. In the numeric experiments QSE provided correct solution in all examples. The novel results include necessary and sufficient conditions when the QBG problem is solved by IF algorithm, the development of software and the experimental testing of large scale QBG problems up to n=800. The web-site http://pilis.if.ktu.lt/~jmockus includes this and accompanying optimization models.

This paper has two achievements. The first aim of this paper is optimization of the lossy compression coder realized as companding quantizer with optimal compression law. This optimization is achieved by optimizing maximal amplitude for that optimal companding quantizer for Laplacian source. Approximate expression in closed form for optimal maximal amplitude is found. Although this expression is very simple and suitable for practical implementation, it satisfy optimality criterion for Lloyd–Max quantizer (for R >= 6 bits/sample). In the second part of this paper novel simple lossless compression method is presented. This method is much simpler than Huffman method, but it gives better results. Finally, at the end of the paper, we join optimal companding quantizer and lossless coding method together in one generalized compression method. This method is applied on the concrete still image and good results are obtained. Besides still images, this method also could be used for compression speech and bio-medical signals.

The paper presents a novel method for the extraction of facial features based on the Gabor-wavelet representation of face images and the kernel partial-least-squares discrimination (KPLSD) algorithm. The proposed feature-extraction method, called the Gabor-based kernel partial-least-squares discrimination (GKPLSD), is performed in two consecutive steps. In the first step a set of forty Gabor wavelets is used to extract discriminative and robust facial features, while in the second step the kernel partial-least-squares discrimination technique is used to reduce the dimensionality of the Gabor feature vector and to further enhance its discriminatory power. For optimal performance, the KPLSD-based transformation is implemented using the recently proposed fractional-power-polynomial models. The experimental results based on the XM2VTS and ORL databases show that the GKPLSD approach outperforms feature-extraction methods such as principal component analysis (PCA), linear discriminant analysis (LDA), kernel principal component analysis (KPCA) or generalized discriminant analysis (GDA) as well as combinations of these methods with Gabor representations of the face images. Furthermore, as the KPLSD algorithm is derived from the kernel partial-least-squares regression (KPLSR) model it does not suffer from the small-sample-size problem, which is regularly encountered in the field of face recognition.

Secure communication between set-top boxes (STBs) and smart cards is directly related to the benefit of the service providers and the legal rights of users, while key exchange is the essential part of a secure communication. In 2004, Jiang et al. proposed a key exchange protocol for STBs and smart cards based upon Schnorr's digital signature protocol and a one-way hash function. This paper, however, demonstrates that Jiang et al.'s protocol is vulnerable to an impersonation attack and does not provide perfect forward secrecy. In addition, in order to isolate such problems, we present a new secure key exchange protocol based on a one-way hash function and Diffie–Hellman key exchange algorithm.

To restore the underexposure image, an illumination compensation inpainting model which employs the joint-diffused partial differential equations (PDEs) is proposed. Firstly, the novel model compensates the illumination effect in multi-scaled underexposure images respectively. Secondly, the information in the fused compensated image is restored by PDEs which diffuse the geometric property and gray information into the target region simultaneously. Experimental results demonstrate that the novel model can properly restore scratches while compensating the illumination effect in underexposure image, and the joint-diffused PDEs which are employed in it lead to a better performance than the conventional PDE inpainting models.