as an aromatic and colorful plant of substantive taste, saffron (crocus sativus l.) owes such properties of matter to growing class of the secondary metabolites derived from the carotenoids, apocarotenoids. regarding the critical role of micrornas in secondary metabolic synthesis and the limited number of identified mirnas in c. sativus, on the other hand, one may see the point how the characte...

The understanding of the dynamic behavior of distillation columns has received considerable attention because distillation is one of the most widely used unit operations in chemical process industries. This paper reports a dynamic simulation study of the possible distillation columns sequences of Dew pointing unit in the second phase of South Pars Gas Refinery. In this unit, three columns are u...

A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...

1.Honigberg, G. and F. Mohn. 1973. An improved method for the isolation of highly polymerized native deoxyribonucleic acid from certain protozoa. J. Protozool. 20:146150. 2.Riley, D.E. and J.N. Krieger. 1992. Rapid and practical DNA isolation from Trichomonas vaginalis and other nuclease-rich protozoa. Mol. Biochem. Parasitol. 51:161164. 3.Rubino, S., R. Muresu, P. Rappelli,, P. Fiori, P. Rizzu...

Tracking through long image sequences is a fundamental research issue in computer vision. This task relies on estimating correspondences between image pairs over time where error accumulation in tracking can result in drift. In this paper, we propose an optimization framework that utilises a novel Anchor Patch algorithm which significantly reduces overall tracking errors given long sequences co...

programming partitions the problem into not completely independent sub problems and solves every sub problem just once and then saves its answer in a table in forward path. The required space for this table usually is proportional to the square of the input size that is contained a huge part of memory. In this paper we describe a new method for reducing the space complexity of dynamic programmi...

The linear complexity of a periodic sequence over GF (pm) plays an important role in cryptography and communication [12]. In this correspondence, we prove a result which reduces the computation of the linear complexity and minimal connection polynomial of a period un sequence over GF (pm) to the computation of the linear complexities and minimal connection polynomials of u period n sequences. T...

The linear complexity of a periodic sequence over GF (p) play an important role in cryptography and communication([1]). In this correspondence, we prove a result which reduces the computation of the linear complexity and minimal connection polynomial of an arbitrary period un (where u|p−1, gcd(n, p −1) = 1) sequence over GF (p) to the computation of the linear complexities and minimal connectio...