In this research we introduce and idea for image compression, based on JPEG technique and Sequential Search Algorithm, at first using Discrete Wavelet Transform (DWT) to obtain LL sub-band, then apply JPEG technique on the LL sub-band. JPEG technique consist of; JPEG Transformation, and JPEG Coding. The LL sub-band transformed by JPEG transformation for obtaining more compression ratio. Before apply JPEG coding, our algorithm used feedbacks system for inverse JPEG transformation to get decoded LL sub-band, and then the difference between decoded LL and original LL are stored in a new matrix called D- Matrix, finally the D-Matrix compressed by Sequential Search Algorithm. The Decompression algorithm consists of; Inverse JPEG transformation to get decoded LL, Sequential Search Algorithm to find D-Matrix, Add D-Matrix with the decoded LL and apply inverse DWT to get decompressed image. Our algorithm tested on two different gray level images and compared with JPEG and JPEG2000.

This  paper  investigates  an  interval  valued  economic  order  quantity  (EOQ)  problem  without shortage.  Since  it  is  almost  impossible  to  find  an  analytic  method  to  solve  the  proposed  model,  an optimization algorithm is designed. First, a brief survey of the existing works on comparing and ranking any two  interval  numbers  on  the  real  line  is  presented.  Finally,  the  effectiveness  of  the  designed  algorithm  is illustrated by a numerical example.

In this paper, we define intuitionistic neutrosophic set (INSs). In fact, all INSs are neutrosophic set but all neutrosophic sets are not INSs. We have shown by means of example that the definition for neutrosophic sets the complement and union are not true for INSs also give new definition of complement, union and intersection of INSs. We define the relation of INSs and four special type of INSs relations. Finally we have studied some properties of INSs relations.

Arithmetic coding is the most powerful lossless data compression technique that has attracted much attention in recent years. This paper presents a new implementation of bit-level arithmetic coding using integer additions and shifts. The algorithm has less computational complexity and more flexibility, and thus is very suitable for hardware design. We show that degradation of the proposed algorithm is bounded by 0.2075.

We present a new 6-point ternary interpolating scheme with a shape parameter. The scheme is C2 continuous over the parametric interval. The differentiable properties of proposed as well as two other existing 6-point ternary interpolating schemes have been explored. Application of proposed scheme is given to show its visual smoothness.

A cactus graph is a connected graph in which every block is either an edge or a cycle. An )(nO time, optimal algorithm is presented here to find a maximum weight 2-coloured set on cactus graphs in where n is the total number of vertices of the graph. The cactus graph has many applications in real life problems, specially in radio communication system.

In this paper, we improve the disc separation of the Schur complement of strictly diagonally dominant matrices presented in Liu [SIAM. J. Matrix Anal. Appl., 27 (2005): 665-674]. As applications, we present some new bounds for determinants of original matrices and estimations for eigenvalues of Schur complement. By theoretical analysis, we improve the bounds of determinants established in Huang [Comput. Math. Appl., 50 (2005): 1677-1684].

Q A denote A matrix whose entries consist of  nn  matrices B such that the signs of entries in B match the corresponding entries in the set of all real A . For nonnegative sign patterns, sign idempotent patterns have been characterized. In this paper, we Firstly give an equi-valent proposition to characterize general sign idempotent matrices (sign idempotent). Next, we study properties of a class of matrices which can be generalized permutationally similar to specialized sign patterns. Finally, we consider the relationships among the allowance of idempotent, generalized inverses and the allowance of tripotent in symmetric sign idempotent patterns.