Lattice valued intuitionistic fuzzy sets

In this paper a new definition of a lattice valued intuitionistic fuzzy set (LIFS) is introduced, in an attempt to overcome the disadvantages of earlier definitions. Some properties of this kind of fuzzy sets and their basic operations are given. The theorem of synthesis is proved: For every two families of subsets of a set satisfying certain conditions, there is an lattice valued intuitionistic fuzzy set for which these are families of level sets. The research supported by Serbian Ministry of Science and Technology, Grant No. 1227.     

Reliability Estimation of Classification Algorithms. I. Introduction to the Problem. Point Frequency Estimates

The study deals with estimating the reliability of classification algorithms. The present article (the first of three) examines the statistical methods used for point estimation of the reliability of classifiers in the frequency approach. The estimation results are applicable to the small-sample case, which is of considerable importance in practice.     

Simulation of Convective Flow of an Electrically Conducting Fluid in a Cavity

A new quasi-hydrodynamic algorithm is proposed for numerical analysis of convective flows in the presence of a homogeneous external magnetic field. The Marangoni convection problem in a square cross-section cavity is solved.     

Lubin–Tate Formal Groups over the Ring of Integers of a Multidimensional Local Field

Some isomorphism criteria for Lubin–Tate formal groups over the ring of integers of a multidimensional local field are given. Bibliography: 4 titles.     

Embedding of Nonprimary Subgroups in the Symmetric Group S 9

The nonprimary subgroups of the symmetric group S ₉ are investigated. Embedding properties of these subgroups are listed in a table. Properties such as abnormality, pronormality, paranormality, weak normality, etc. were checked with the help of a computer. Algorithms and codes of the first author were used for this purpose. The research leans upon the technique of Burnside marks, as well as upon pertinent information on the table of marks of S ₉ from the computer algebra package GAP. The subgroups were investigated up to conjugacy; the total number of conjugacy classes of nonprimary subgroups of S ₉ is 432. Some subgroups were additionally checked by other programs based on the double coset method. Bibliography: 24 titles.     

On the computation of scaling coefficients of Daubechies' wavelets

In the present paper, Daubechies' wavelets and the computation of their scaling coefficients are briefly reviewed. Then a new method of computation is proposed. This method is based on the work [7] concerning a new orthonormality condition and relations among scaling moments, respectively. For filter lengths up to 16, the arising system can be explicitly solved with algebraic methods like Gröbner bases. Its simple structure allows one to find quickly all possible solutions.     

The representation dimension of domestic weakly symmetric algebras

Auslander’s representation dimension measures how far a finite dimensional algebra is away from being of finite representation type. In [1], M. Auslander proved that a finite dimensional algebra A is of finite representation type if and only if the representation dimension of A is at most 2. Recently, R. Rouquier proved that there are finite dimensional algebras of an arbitrarily large finite representation dimension. One of the exciting open problems is to show that all finite dimensional algebras of tame representation type have representation dimension at most 3. We prove that this is true for all domestic weakly symmetric algebras over algebraically closed fields having simply connected Galois coverings.     

Heuristic Rejection in Interval Global Optimization

Based on the investigation carried out in Ref. 1, this paper incorporates new studies about the properties of inclusion functions on subintervals while a branch-and-bound algorithm is solving global optimization problems. It is found that the relative place of the global minimum value within the inclusion function value of the objective function at the current interval indicates mostly whether the given interval is close to a minimizer point. This information is used in a heuristic interval rejection rule that can save a considerable amount of computation. Illustrative examples are discussed and an extended numerical study shows the advantages of the new approach.