Sticker systems over monoids

Molecular computing has gained many interests among researchers since Head introduced the first theoretical model for DNA based computation using the splicing operation in 1987. Another model for DNA computing was proposed by using the sticker operation which Adlemanused in his successful experiment for the computation of Hamiltonian paths in a graph: a double stranded DNA sequence is composed by prolonging to the left and to the right a sequence of (single or double) symbols by using given single stranded strings or even more complex dominoes with sticky ends, gluing these ends together with the sticky ends of the current sequence according to a complementarity relation. According to this sticker operation, a language generative mechanism, called a sticker system, can be defined: a set of (incomplete) double-stranded sequences (axioms) and a set of pairs of single or double-stranded complementary sequences are given. The initial sequences are prolonged to the left and to the right by using sequences from the latter set, respectively. The iterations of these prolongations produce “computations” of possibly arbitrary length. These processes stop when a complete double stranded sequence is obtained. Sticker systems will generate only regular languages without restrictions. Additional restrictions can be imposed on the matching pairs of strands to obtain more powerful languages. Several types of sticker systems are shown to have the same power as regular grammars; one type is found to represent all linear languages whereas another one is proved to be able to represent any recursively enumerable language. The main aim of this research is to introduce and study sticker systems over monoids in which with each sticker operation, an element of a monoid is associated and a complete double stranded sequence is considered to be valid if the computation of the associated elements of the monoid produces the neutral element. Moreover, the sticker system over monoids is defined in this study

Curvelet based texture features for breast cancer classifications

One of the sources of death among women is breast cancer. It is well known that Mammogram is the best method for breast cancer detection. Subsequently, there are solid requirements for the improvement of computer aided diagnosis (CAD) systems to assist radiologists in making decision. In this paper, the curvelet changes is proposed to classify the breast cancer. Curvelet refers to multi-level change which have the characteristics of directionality and anisotropy. It splits several characteristic impediments of wavelet to edges of an image. Two component extraction techniques were created associated with curvelet and wavelet coefficients to separate among various classes of breast. Finally, the K-Nearest Neighbor (KNN) classifiers were utilized to decide if the district is unusual or ordinary. The adequacy of the suggested strategies has been implemented with Mammographic Image Analysis Society (MIAS) data images. All the dataset is utilized by the suggested strategies. Then calculations have been applied with both curvelet and wavelet for correlation test were performed. The general outcomes show that curvelet change shows superior compared to the wavelet and the thing that matters is measurably noteworthy

Splicing systems over permutation groups of length two

The first theoretical model of DNA computing, called a splicing system, for the study of the generative power of deoxyribonucleic acid (DNA) in the presence of restriction enzymes and ligases was introduced by Head in 1987. Splicing systems model the recombinant behavior of double-stranded DNA (dsDNA) and the enzymes which perform operation of cutting and pasting on dsDNA. Splicing systems with finite sets of axioms and rules generate only regular languages when no additional control is assumed. With several restrictions to splicing rules, the generative power increase up to recursively enumerable languages. Algebraic structures can also be used in order to control the splicing systems. In the literature, splicing systems with additive and multiplicative valences have been investigated, and it has been shown that the family of languages generated by valence splicing systems is strictly included in the family of context-sensitive languages. This motivates the study of splicing systems over permutation groups. In this paper, we define splicing systems over permutation groups and investigate the generative power of the languages produced

Aljabar linear permulaan edisi ketujuh

Buku ini mengandungi beberapa bab iaitu, bab 1 sistem persamaan linear dan matriks, pengenalan kepada sistem persamaan linear, penghapusan Gaussan. Bab 2 penentu, fungsi penentu, menilaikan penentu melalui penurunan baris. Bab 3 vektor dalam ruang–2 dan ruang–3, pengenalan kepada vektor (Geometri) norma bagi vektor, aritmetik vektor. Bab 4 ruang vektor euklidan, ruang–n Euklidan, penjelmaan linear dari Rn ke Rm. Bab 5 ruang vektor am, ruang vektor nyata subruang. Bab 6 ruang hasil darab terkedalam, hasil darab terkedalam sudut dan keortogonan dalam ruang hasil darab terkedalam. Bab 7 nilai Eigen vektor Eigen, nilai Eigen dan vektor Eigen, pempepenjuruan. Bab 8 penjelmaan linear penjelmaan linear am, inti dan julat. Bab 9 topik tambahan penggunaan kepada persamaan pembezaan, geometri bagi pengoperasi linear ke atas R2. Bab 10 ruang vektor kompleks, nombor kompleks, modulus, konjugat kompleks, pembahagian, jawapan kepada latihan, indeks