Matrix Power S-box Analysis

* Work supported by the Lithuanian State Science and Studies Foundation.

Probabilistic Approach to the Neumann Problem for a Symmetric Operator

2000 Mathematics Subject Classification: Primary 60J45, 60J50, 35Cxx; Secondary 31Cxx.

On the Isoenergetical Non-Degeneracy of the Problem of two Centers of Gravitation

* Partialy supported by contract MM 523/95 with Ministry of Science and Technologies of Republic of Bulgaria.

On The Cauchy Problem for Non Effectively Hyperbolic Operators, The Ivrii-Petkov-Hörmander Condition and the Gevrey Well Posedness

2000 Mathematics Subject Classification: 35L15, Secondary 35L30.

Applying Genetic Algorithm In Query Improvement Problem

This paper presents an adaptive method using genetic algorithm to modify user’s queries, based on relevance judgments. This algorithm was adapted for the three well-known documents collections (CISI, NLP and CACM). The method is shown to be applicable to large text collections, where more relevant documents are presented to users in the genetic modification. The algorithm shows the effects of applying GA to improve the effectiveness of queries in IR systems. Further studies are planned to adjust the system parameters to improve its effectiveness. The goal is to retrieve most relevant documents with less number of non-relevant documents with respect to user's query in information retrieval system using genetic algorithm.

Solving a Direct Marketing Problem by Three Types of ARTMAP Neural Networks

An important task for a direct mailing company is to detect potential customers in order to avoid unnecessary and unwanted mailing. This paper describes a non-linear method to predict profiles of potential customers using dARTMAP, ARTMAP-IC, and Fuzzy ARTMAP neural networks. The paper discusses advantages of the proposed approaches over similar techniques based on MLP neural networks.

Application of Classification Methods to a Problem Related to Specific Groups of E-Government Users

This paper was partly supported by ELOST – a SSA EU project – No 27287.

Examples Illustrating some Aspects of the Weak Deligne-Simpson Problem

Research partially supported by INTAS grant 97-1644

Algorithmic Minimization of Non-zero Entries in 0,1-Matrices

In this paper we present algorithms which work on pairs of 0,1- matrices which multiply again a matrix of zero and one entries. When applied over a pair, the algorithms change the number of non-zero entries present in the matrices, meanwhile their product remains unchanged. We establish the conditions under which the number of 1s decreases. We recursively define as well pairs of matrices which product is a specific matrix and such that by applying on them these algorithms, we minimize the total number of non-zero entries present in both matrices. These matrices may be interpreted as solutions for a well known information retrieval problem, and in this case the number of 1 entries represent the complexity of the retrieve and information update operations.

Active Monitoring and Decision Making Problem

Active monitoring and problem of non-stable of sound signal parameters in the regime of piling up response signal of environment is under consideration. Math model of testing object by set of weak stationary dynamic actions is offered. The response of structures to the set of signals is under processing for getting important information about object condition in high frequency band. Making decision procedure by using researcher’s heuristic and aprioristic knowledge is discussed as well. As an example the result of numerical solution is given.

Fundamental Investigations on the Isomorphism of Commutative Group Algebras in Bulgaria

The isomorphism problem of arbitrary algebraic structures plays always a central role in the study of a given algebraic object. In this paper we give the first investigations and also some basic results on the isomorphism problem of commutative group algebras in Bulgaria.

Explicit Solution of Bitsadze-Samarskii Problem

Иван Димовски, Юлиан Цанков - В статията е намерено точно решение на задачата на Бицадзе-Самрски (1) за уравнението на Лаплас, като е използвано операционно смятане основано на некласическа двумернa конволюция. На това точно решение може да се гледа като начин за сумиране на нехармоничния ред по синуси на решението, получен по метода на Фурие.

N–Dimensional Orthogonal Tile Sizing Problem

AMS subject classification: 68Q22, 90C90

About Strictly Hyperbolic Operators with Non-Regular Coefficients

2002 Mathematics Subject Classification: 35L15, 35L80, 35S05, 35S30

Variable Neighborhood Search for Solving the Capacitated Single Allocation Hub Location Problem

In this paper a Variable Neighborhood Search (VNS) algorithm for solving the Capacitated Single Allocation Hub Location Problem (CSAHLP) is presented. CSAHLP consists of two subproblems; the first is choosing a set of hubs from all nodes in a network, while the other comprises finding the optimal allocation of non-hubs to hubs when a set of hubs is already known. The VNS algorithm was used for the first subproblem, while the CPLEX solver was used for the second. Computational results demonstrate that the proposed algorithm has reached optimal solutions on all 20 test instances for which optimal solutions are known, and this in short computational time.