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.     

Newton-Like Iteration Based on a Cubic Polynomial for Structured Matrices

We recall Newtons iteration for computing the inverse or Moore–Penrose generalized inverse of a matrix. Then we specialize this approach to the case of structured matrices where all input, output and intermediate auxiliary matrices are represented in a compressed form, via their short displacement generators. We design a new Newton-like iteration based on a cubic polynomial and show its effectiveness by some numerical experiments for matrices from the Toeplitz-like class and the Cauchy-like class.     

Robust H ∞ Filtering for a Class of Nonlinear Discrete-Time Markovian Jump Systems

This paper considers the problem of the robust H filtering for a class of nonlinear discrete-time Markovian jump systems with real time-varying norm-bounded parameter uncertainty. For each mode, the nonlinearity is assumed to satisfy the global Lipschitz conditions and appears in both the state and measured output equations. The problem that we address is the design of a nonlinear filter which ensures robust stochastic stability and a prescribed H performance level of the filtering error system for all admissible uncertainties. A sufficient condition for the solvability of this problem is obtained in terms of a set of linear matrix inequalities; an explicit expression of a desired nonlinear H filter is also given. Finally, an example is provided to demonstrate the effectiveness of the proposed approach.     

A General Decomposition Algorithm for Parallel Queues with Correlated Arrivals

Queueing with correlated arrivals occurs when customers arrive at a set of queues simultaneously. The difficulty in analyzing systems with correlated arrivals is due to the fact that the individual queueing systems are stochastically dependent. Exact methods for analyzing these systems are computationally intensive and are limited to only a few special cases. In this paper, we consider a system of parallel queues with bulk service and correlated arrivals. We show how the matrix-geometric approach can be used to obtain the performance measures of the system. We also develop an algorithm for large systems that efficiently approximates the performance measures by decomposing it into individual queueing systems. Finally, we describe how the principles of our decomposition algorithm can be extended to analyze a variety of different parallel queueing systems with correlated arrivals. We then evaluate the accuracy of our algorithm through a numerical study.     

Schopenhauer's Prolegomenon to Fuzziness

Prolegomenon means something said in advance of something else. In this study, we posit that part of the work by Arthur Schopenhauer (1788–1860) can be thought of as a prolegomenon to the existing concept of fuzziness. His epistemic framework offers a comprehensive and surprisingly modern framework to study individual decision making and suggests a bridgeway from the Kantian program into the concept of fuzziness, which may have had its second prolegomenon in the work by Frege, Russell, Wittgenstein, Peirce and Black. In this context, Zadeh's seminal contribution can be regarded as the logical consequence of the Kant-Schopenhauer representation framework.     

Constructive Matrix and Orderable Groups

We study into the relationship between constructivizations of an associative commutative ring K with unity and constructivizations of matrix groups GL _n(K) (general), SL _n(K) (special), and UT _n(K) (unitriangular) over K. It is proved that for n 3, a corresponding group is constructible iff so is K. We also look at constructivizations of ordered groups. It turns out that a torsion-free constructible Abelian group is orderly constructible. It is stated that the unitriangular matrix group UT _n(K) over an orderly constructible commutative associative ring K is itself orderly constructible. A similar statement holds also for finitely generated nilpotent groups, and countable free nilpotent groups.     

The Ring of Invariants of Three (3 × 3)-Matrices over a Field of Prime Characteristic

We find a minimal system of generators and a homogeneous system of parameters for the algebra of invariants of three matrices of third order over a field of an arbitrary characteristic.     

Point-to-Periodic and Periodic-to-Periodic Connections

In this work we consider computing and continuing connecting orbits in parameter dependent dynamical systems. We give details of algorithms for computing connections between equilibria and periodic orbits, and between periodic orbits. The theoretical foundation for these techniques is given by the seminal work of Beyn in 1994, “On well-posed problems for connecting orbits in dynamical systems”, where a numerical technique is also proposed. Our algorithms consist of splitting the computation of the connection from that of the periodic orbit(s). To set up appropriate boundary conditions, we follow the algorithmic approach used by Demmel, Dieci, and Friedman, for the case of connecting orbits between equilibria, and we construct and exploit the smooth block Schur decomposition of the monodromy matrices associated to the periodic orbits. Numerical examples illustrate the performance of the algorithms. This revised version was published online in July 2006 with corrections to the Cover Date.