• Korean Journal of Remote Sensing
• /
• v.22 no.5
• /
• pp.457-462
• /
• 2006

Sequential Pattern Mining is the mining approach which addresses the problem of discovering the existent maximal frequent sequences in a given databases. In the daily and scientific life, sequential data are available and used everywhere based on their representative forms as text, weather data, satellite data streams, business transactions, telecommunications records, experimental runs, DNA sequences, histories of medical records, etc. Discovering sequential patterns can assist user or scientist on predicting coming activities, interpreting recurring phenomena or extracting similarities. For the sake of that purpose, the core of sequential pattern mining is finding the frequent sequence which is contained frequently in all data sequences. Beside the discovery of frequent itemsets, sequential pattern mining requires the arrangement of those itemsets in sequences and the discovery of which of those are frequent. So before mining sequences, the main task is checking if one sequence is a subsequence of another sequence in the database. In this paper, we implement the subsequence matching method as the preprocessing step for sequential pattern mining. Matched sequences in our implementation are the normalized sequences as the form of number chain. The result which is given by this method is the review of matching information between input mapped sequences.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.13-30
• /
• 2010

Let C be a nonempty closed convex subset of a real Hilbert space H. Consider the following iterative algorithm given by $x_0\;{\in}\;C$ arbitrarily chosen, $x_{n+1}\;=\;{\alpha}_n{\gamma}f(W_nx_n)+{\beta}_nx_n+((1-{\beta}_n)I-{\alpha}_nA)W_nP_C(I-s_nB)x_n$, ${\forall}_n\;{\geq}\;0$, where $\gamma$ > 0, B : C $\rightarrow$ H is a $\beta$-inverse-strongly monotone mapping, f is a contraction of H into itself with a coefficient $\alpha$ (0 < $\alpha$ < 1), $P_C$ is a projection of H onto C, A is a strongly positive linear bounded operator on H and $W_n$ is the W-mapping generated by a finite family of nonexpansive mappings $T_1$, $T_2$, ${\ldots}$, $T_N$ and {$\lambda_{n,1}$}, {$\lambda_{n,2}$}, ${\ldots}$, {$\lambda_{n,N}$}. Nonexpansivity of each $T_i$ ensures the nonexpansivity of $W_n$. We prove that the sequence {$x_n$} generated by the above iterative algorithm converges strongly to a common fixed point $q\;{\in}\;F$ := $\bigcap^N_{i=1}F(T_i)\;\bigcap\;VI(C,\;B)$ which solves the variational inequality $\langle({\gamma}f\;-\;A)q,\;p\;-\;q{\rangle}\;{\leq}\;0$ for all $p\;{\in}\;F$. Using this result, we consider the problem of finding a common fixed point of a finite family of nonexpansive mappings and a strictly pseudocontractive mapping and the problem of finding a common element of the set of common fixed points of a finite family of nonexpansive mappings and the set of zeros of an inverse-strongly monotone mapping. The results obtained in this paper extend and improve the several recent results in this area.

• Journal of Life Science
• /
• v.12 no.6
• /
• pp.715-720
• /
• 2002

A mutant Arabidopsis thaliana which is very sensitive to Ultraviolet-B(UV-B) radiation has been isolated by ethylmethane sulfonate(EMS) mutagenesis. Genetic cross proved the UV-sensitive gene(uvs) to segregate as a single Mendelian locus. For mapping of uvs, we crossed Arabidopsis thaliana Lansberg with uvs plant(Columbia), and made F2 plants by F1 selfcross. We designed 10 kinds of CAPS marker primers. Each primers amplifies a single mapped DNA sequence from uvs and Lansberg erecta ecotyres. Also identified was at least one restriction endonuclase for each of these PCR product that generates ecotype-specific digestion pattern. We got crossing over value of UB-sensitivity and each CAPS marker which located on different chromosome arm. The value of crossing over showed that uvs was linked to LFY3 which was on chromosome 5.

• Journal of the Korea Computer Graphics Society
• /
• v.5 no.2
• /
• pp.43-52
• /
• 1999

In this paper, we present an animation toolkit based on motion mapping technique in a graphics user interface that can represent data structures necessary for generating character motions. The motion mapping means that an animation sequence generated once can be mapped to another object directly according a data structure in the graphics user interface. Users can generate animation sequences interactively using a mouse. These are obtained automatically by modifying motion data structures interactively. Compared with other conventional tools, the toolkit has different features that two hierarchical structures necessary for representing modeling and animation data are managed independently each other, and that animations generated can be applied to any other characters by connecting the two hierarchical structures in the user interface.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.227-245
• /
• 2011

In this paper, we introduce a new iterative method for finding a common element of the set of solutions for mixed equilibrium problem, the set of solutions of the variational inequality for a ${\beta}$inverse-strongly monotone mapping and the set of fixed points of a family of finitely nonexpansive mappings in a real Hilbert space by using the viscosity and Ces$\`{a}$ro mean approximation method. We prove that the sequence converges strongly to a common element of the above three sets under some mind conditions. Our results improve and extend the corresponding results of Kumam and Katchang [A viscosity of extragradient approximation method for finding equilibrium problems, variational inequalities and fixed point problems for nonexpansive mapping, Nonlinear Analysis: Hybrid Systems, 3(2009), 475-86], Peng and Yao [Strong convergence theorems of iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems, Mathematical and Computer Modelling, 49(2009), 1816-828], Shimizu and Takahashi [Strong convergence to common fixed points of families of nonexpansive mappings, Journal of Mathematical Analysis and Applications, 211(1) (1997), 71-83] and some authors.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.753-762
• /
• 2010

Let K be a nonempty closed convex subset of a real Hilbert space H. Let T : K $\rightarrow$ K be a nonexpansive mapping with a nonempty fixed point set Fix(T). Let f : K $\rightarrow$ K be a contraction mapping. Let {$\alpha_n$} and {$\beta_n$} be sequences in (0, 1) such that $\lim_{x{\rightarrow}0}{\alpha}_n=0$, (0.1) $\sum_{n=0}^{\infty}\;{\alpha}_n=+{\infty}$, (0.2) 0 < a ${\leq}\;{\beta}_n\;{\leq}$ b < 1 for all $n\;{\geq}\;0$. (0.3) Then it is proved that the modified Krasnoselski-Mann iterative sequence {$x_n$} given by {$x_0\;{\in}\;K$, $y_n\;=\;{\alpha}_{n}f(x_n)+(1-\alpha_n)x_n$, $n\;{\geq}\;0$, $x_{n+1}=(1-{\beta}_n)y_n+{\beta}_nTy_n$, $n\;{\geq}\;0$, (0.4) converges strongly to a point p $\in$ Fix(T} which satisfies the variational inequality

$\leq$ 0, z $\in$ Fix(T). (0.5) This result improves and extends the corresponding results of Yao et al[Y.Yao, H. Zhou, Y. C. Liou, Strong convergence of a modified Krasnoselski-Mann iterative algorithm for non-expansive mappings, J Appl Math Com-put (2009)29:383-389.

• Genomics & Informatics
• /
• v.7 no.4
• /
• pp.181-186
• /
• 2009

Myotonic dystrophy type 1 (DM1), which is a dominantly inherited neurodegenerative disorder, results from a CTG trinucleotide repeat expansion in the 3'-untranslated region (3'-UTR) of the myotonic dystrophy protein kinase (DMPK) gene. Retention of mutant DMPK (mDMPK) transcripts in the nuclei of affected cells has been known to be the main cause of pathogenesis of the disease. Thus, reducing the RNA toxicity through elimination of the mutant RNA has been suggested as one therapeutic strategy against DM1. In this study, we suggested RNA replacement with a trans -splicing ribozyme as an alternate genetic therapeutic approach for amelioration of DM1. To this end, we identified the regions of mDMPK 3'-UTR RNA that were accessible to ribozymes by using an RNA mapping strategy based on a trans-splicing ribozyme library. We found that particularly accessible sites were present not only upstream but also downstream of the expanded repeat sequence. Repair or replacement of the mDMPK transcript with the specific ribozyme will be useful for DM1 treatment through reduction of toxic mutant transcripts and simultaneously restore wild-type DMPK or release nucleus-entrapped mDMPK transcripts to the cytoplasm.

• Korean Journal of Plant Tissue Culture
• /
• v.24 no.2
• /
• pp.113-117
• /
• 1997

Simple sequence repeats (SSR) are widely dispersed throughout eukaryotic genomes, highly polymorphic, and easily typed using polymerase chain reaction (PCR). The objective of this study was to determine the polymorphism of different Chlamydomonas reinhartdtii strains and to determine the mode of inheritance of the SSR locus in Chlamydomonas. A genomic DNA library of C. reinhardtii was constructed and screened with a radiolabeled $(AC)_{11}$ probe for the selection of (CA/GT)n repeat clone. Selected clone was seqeuenced, and PCR primer set flanking (CA/GT)n sequence was constructed. PCR was used to specifically amplify the SSR locus from multiple isolates of C. reinhardtii. The locus was polymorphic in some of the C. reinhardtii isolates. However, the locus was amplified only 4 of 6 isolates of C. reinhardtii, not in other 2 isolates of C. reinhardtii, suggesting that this locus is not extensively conserved. A simple Mendelian inheritance pattern was found, which showed 2:2 segregation in the tetrads resulting from a cross between C. reinhardtii and C. smithii. Our results suggest that this simple sequence repeat DNA polymorphism will be useful for identity testing, population studies, linkage analysis, and genome mapping in Chlamydomonas.

• Bulletin of the Korean Mathematical Society
• /
• v.42 no.4
• /
• pp.661-670
• /
• 2005

In this paper, we deal with approximations of com­mon fixed points of the iterative sequences with errors for three asymptotically nonexpansive mappings in a uniformly convex Banach space. Our results generalize and improve the corresponding results of Khan and Takahashi, Schu, Takahashi and Tamura, and others.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.1-7
• /
• 2006

Quadrature amplitude modulation-spread spectrum (QAM-SS) and code division multiplexing (CDM) are multi-level modulation schemes with high performance but they cause a large peak-average power ratio (PAPR). Therefore, this paper proposes a novel modulation scheme for high-rate transmission which follows a sequence of CDM-mapping-CDM not only to correct the above-mentioned problem but also offer a high flexibility in obtaining arbitrary multilevel modulation with very low implementation complexity and high performance.