u n d o u b t e d l y, i n t h e l a s t d e c a d e s, t h e a s s e t p r i c i n g m o d e l i so n e o f m o s t i m p o r t a n t a n d, a t t h e s a m e t i m e, a t t r a c t i v e, f i n a n c e a r e a s. c a p m h a s b e e n t h e d o m i n a n t m o d e l i n t h i s s e c t i o n f o r m o r e t h a n 40 y e a r s. o n e r e a s o n i s i t s s t r o n g b a s e, w h i c h h a s b...

The aim of this paper is to introduce and study set- valued homomorphism on lattices and T-rough lattice with respect to a sublattice. This paper deals with T-rough set approach on the lattice theory. The result of this study contributes to, T-rough fuzzy set and approximation theory and proved in several papers. Keywords: approximation space; lattice; prime ideal; rough ideal; T-rough set; set...

A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...