On quasi-solution to infeasible linear complementarity problem obtained by Lemke’s method

For a linear complementarity problem with inconsistent system of constraints a notion of quasi-solution of Tschebyshev type is introduced. It’s shown that this solution can be obtained automatically by Lemke’s method if the constraint matrix of the original problem is copositive plus or belongs to the intersection of matrix classes P ₀ and Q ₀.     

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.     

Equations of Advanced–Retarded Type and Solutions of Traveling-Wave Type for Infinite-Dimensional Dynamic Systems

In the paper we study infinite-dimensional dynamic systems with the Frenkel–Kontorova potentials. For such systems we describe their traveling-wave-type solutions, which are solutions for the corresponding boundary-value problem with nonlocal conditions. Describing the mentioned solutions is equivalent to describing the space of solutions for a functional differential equation that can be canonically derived from the original dynamic system. The stability of traveling-wave-type solutions is also investigated.     

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.     

Solubility parameter determination of cationic surfactants by inverse GC

Summary The solubility parameters of cationic surfactants were obtained using the inverse gas chromatographic technique. The surfactants didodecyl dimethyl ammonium bromide, dioctadecyl dimethyl ammonium bromide and dodecyl pyridinium chloride were used as stationary phase and retention data of different probe solutes were measured at different temperatures. The results were analysed by the combination of Flory-Huggins and Hildebrand theories, and the solubility parameters of the surfactants were obtained in a range of temperatures between 80–120°C.     

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.