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.     

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.     

Rhythmic pattern formations in gels and Matalon—Packter law: A fresh perspective

The periodic precipitation pattern formation in gelatinous media is interpreted as a moving boundary problem. The time law, spacing law and width law are revisited on the basis of the new scenario. The explicit dependence of the geometric structure on the initial concentrations of the reactants is derived. Matalon—Packter law, which relates the spacing coefficient with the initial concentrations is reformulated removing many ambiguities and impractical parameters. Experimental results are discussed to establish the significance of moving boundary concept in the diffusion controlled pattern forming systems     

Hysteresis and Eddy-current Relaxation in SiFe Materials

The rate-dependent effects in metallic ferromagnetic materials with magnetization processes attributed to domain-walls motion were studied. The experimental method for eddy-current relaxation time determination was proposed. Some discrepancies between the data and theoretical predictions were observed and discussed. The origin of these discrepancies is accounted for by the decrease of viscous-type relaxation process as the rate of change of averaged magnetization is approaching zero.     

Branes,Quantum Nambu Brackets and the Hydrogen Atom

The Nambu-bracket quantization of the hydrogen atom is worked out as an illustration of the general method. The dynamics of topological open branes is controlled classically by Nambu brackets. Such branes then may be quantized through the consistent quantization of the underlying Nambu brackets: properly defined, the quantum Nambu-brackets comprise an associative structure, although the naive derivation property is mooted through operator entwinement. For superintegrable systems, such as the hydrogen atom, the results coincide with those furnished by Hamiltonian quantization - but the method is not limited to Hamiltonian systems.     

直径不超过4的树的割宽

§ 1　IntroductionThe cutwidth problem for graphs,as well as a class of optimal labeling and embed-ding problems,have significant applications in VLSI designs,network communicationsand other areas (see [2 ] ) .We shall follow the graph-theoretic terminology and notation of [1 ] .Let G=(V,E)be a simple graph with vertex set V,| V| =n,and edge set E.A labeling of G is a bijec-tion f:V→ { 1 ,2 ,...,n} ,which can by regarded as an embedding of G into a path Pn.Fora given labeling f of G,th…