Descriptive Sets and the Topology of Nonseparable Banach Spaces

This paper was extensively circulated in manuscript form beginning in the Summer of 1989. It is being published here for the first time in its original form except for minor corrections, updated references and some concluding comments.

Criterion of Normality of the Completely Regular Topology of Separate Continuity

2000 Mathematics Subject Classification: 54C10, 54D15, 54G12.

Generalizing of Neural Nets: Functional Nets of Special Type

Special generalizing for the artificial neural nets: so called RFT – FN – is under discussion in the report. Such refinement touch upon the constituent elements for the conception of artificial neural network, namely, the choice of main primary functional elements in the net, the way to connect them(topology) and the structure of the net as a whole. As to the last, the structure of the functional net proposed is determined dynamically just in the constructing the net by itself by the special recurrent procedure. The number of newly joining primary functional elements, the topology of its connecting and tuning of the primary elements is the content of the each recurrent step. The procedure is terminated under fulfilling “natural” criteria relating residuals for example. The functional proposed can be used in solving the approximation problem for the functions, represented by its observations, for classifying and clustering, pattern recognition, etc. Recurrent procedure provide for the versatile optimizing possibilities: as on the each step of the procedure and wholly: by the choice of the newly joining elements, topology, by the affine transformations if input and intermediate coordinate as well as by its nonlinear coordinate wise transformations. All considerations are essentially based, constructively and evidently represented by the means of the Generalized Inverse.

Mathematical Modeling of the Weaving Structure Design

Красимир Йорджев, Христина Костадинова - В работата се разглежда една релация на еквивалентност в множеството от всички квадратни бинарни матрици. Обсъдена е комбинаторната задача за намиране мощността и елементите на фактормножеството относно тази релация. Разгледана е и възможността за получаване на някои специални елементи на това фактормножество. Предложен е алгоритъм за решаване на поставените задачи. Получените в статията резултати намират приложение при описанието топологията на различните тъкачни структури.

On Generalized Models and Singular Products of Distributions in Colombeau Algebra G(R)

MSC 2010: 46F30, 46F10

An Example Concerning Valdivia Compact Spaces

∗ Supported by Research grants GAUK 190/96 and GAUK 1/1998

Porosity and Variational Principles

We prove that in some classes of optimization problems, like lower semicontinuous functions which are bounded from below, lower semi-continuous or continuous functions which are bounded below by a coercive function and quasi-convex continuous functions with the topology of the uniform convergence, the complement of the set of well-posed problems is σ-porous. These results are obtained as realization of a theorem extending a variational principle of Ioffe-Zaslavski.

The Matrix Method of Determining the Fault Tolerance Degree of a Computer Network Topology

This work presents a theoretical-graph method of determining the fault tolerance degree of the computer network interconnections and nodes. Experimental results received from simulations of this method over a distributed computing network environment are also presented.