Informatica

Influence of projection pursuit on classification errors and estimates of a posteriori probabilities from the sample is considered. Observed random variable is supposed to satisfy a multidimensional Gaussian mixture model. Presented computer simulation results show that for comparatively small sample size classification using projection pursuit algorithm gives better accuracy of estimates of a posteriori probabilities and less classification error.

One of the problem in business process reengineering is the identification and implementation of new workflow procedures for specific business processes, if they are not clearly defined. Analysis of unstructured (ad-hoc) activities cannot be based on traditional approaches using existing business procedures and expert knowledge. The method of business processes analysis in unstructured environments is presented in this paper. The creation of new business procedures is based on investigation of the communication acts, and application of similar workflow patterns. This method is useful in the earliest stages of business process reengineering. Preliminary analysis in ad-hoc area can be done for process identification, applying the existing knowledge baggage, reducing the analytical efforts, and creating the strong motivation for managers.

In the (t,n) proxy signature scheme, the signature, originally signed by a signer, can be signed by t or more proxy signers out of a proxy group of n members. Recently, an efficient nonrepudiable threshold proxy signature scheme with known signers was proposed by H.-M. Sun. Sun's scheme has two advantages. One is nonrepudiation. The proxy group cannot deny that having signed the proxy signature. Any verifier can identify the proxy group as a real signer. The other is identifiable signers. The verifier is able to identify the actual signers in the proxy group. Also, the signers cannot deny that having generated the proxy signature. In this article, we present a cryptanalysis of the Sun's scheme. Further, we propose a secure, nonrepudiable and known signers threshold proxy signature scheme which remedies the weakness of the Sun's scheme.

Many heuristics, such as simulated annealing, genetic algorithms, greedy randomized adaptive search procedures are stochastic. In this paper, we propose a deterministic heuristic algorithm, which is applied to the quadratic assignment problem. We refer this algorithm to as intensive search algorithm (or briefly intensive search). We tested our algorithm on the various instances from the library of the QAP instances – QAPLIB. The results obtained from the experiments show that the proposed algorithm appears superior, in many cases, to the well-known algorithm – simulated annealing.

The aim of the given paper is a development of the direct approach used for the estimation of parameters of a closed-loop discrete-time dynamic system in the case of additive noise with outliers contaminated uniformly in it (Fig. 1). To calculate M-estimates of unknown parameters of such a system by means of processing input and noisy output observations (Fig. 2), the recursive robust H-technique based on an ordinary recursive least square (RLS) algorithm is applied here. The results of numerical simulation of closed-loop system (Fig. 3) by computer (Figs. 4–7) are given.

A concept of regional technological cooperation is developed based on a cooperative game theoretic model, in which a plan of payoff distributions induces an agreement that is acceptable to each participant. Under certain conditions, the underlying game is shown to be convex, and hence to have a nonempty core with the Shapley value allocations belonging to the core. A compensation scheme is devised based on the Shapley value allocations, whereby participants who enjoy a greater payoff with respect to the technological cooperation compensate the participants who receive a relatively lesser payoff via cooperation. In this manner, regional technological cooperation can bring overall benefits to all the involved players in the game. Some insightful examples are provided to illustrate the methodological concept.

Two models for an age-structured nonlimited population dynamics with maternal care of offspring are presented. One of them deals with a bisexual population and includes a harmonic mean type mating of sexes and females' pregnancy. The other one describes dynamics of an asexual population. Migration is not taken into account. The existence and uniqueness theorem for the general case of vital rates is proved, the extinction and growth of the population are considered, and a class of the product (separable) solutions is obtained for these two models. The long-time behavior of the asexual population is obtained in the stationary case of vital rates.

Color constancy is the perceived stability of the color of objects under different illuminants. Four-layer neural network for color constancy has been developed. It has separate input channels for the test chip and for the background. Input of network was RGB receptors. Second layer consisted of color opponent cells and output have three neurons signaling x, y, Y coordinates (1931 CIE). Network was trained with the back-propagation algorithm. For training and testing we used nine illuminants with wide spectrum. Neural network was able to achieve color constancy. Input of background coordinates and nonlinearity of network have crucial influence for training.