• Journal of applied mathematics & informatics
• /
• v.39 no.3_4
• /
• pp.303-319
• /
• 2021

In this paper, we introduce the concepts of Wijsman strongly p-lacunary summability of order 𝛼, Wijsman lacunary statistical convergence of order 𝛼 and Hausdorff lacunary statistical convergence of order 𝛼 for double set sequences. Also, we investigate some properties of these new concepts and examine the existence of some relationships between them. Furthermore, we study the relationships between these new concepts and some concepts in the literature.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.156-160
• /
• 2005

We introduce a fully automatic clustering method to classier candidate paralog clusters from a set of protein sequences within one genome. A set of protein sequences is represented as a set of nodes, each represented by the amino acid sequence for a protein with the sequence similarities among them constituting a set of edges in a graph of protein relationships. We use graph-based clustering methods to identify structurally consistent sets of nodes which are strongly connected with each other. Our results are consistent with those from current leading systems such as COG/KOG and KEGG based on manual curation. All the results are viewable at http://www.cs.rutgers.edu/${\sim}$seabee.

• Journal of Microbiology
• /
• v.44 no.1
• /
• pp.29-34
• /
• 2006

The purpose of this study was to develop molecular identification method for medical mushrooms and their preparations based on the nucleotide sequences of nuclear large subunit (LSD) rDNA. Four specimens were collected of each of the three representative medicinal mushrooms used in Korea: Ganoderma Incidum, Coriolus versicolor, and Fomes fomentarius. Fungal material used in these experiments included two different mycelial cultures and two different fruiting bodies from wild or cultivated mushrooms. The genomic DNA of mushrooms were extracted and 3 nuclear LSU rDNA fragments were amplified: set 1 for the 1.1-kb DNA fragment in the upstream region, set 2 for the 1.2-kb fragment in the middle, and set 3 for the 1.3-kb fragment downstream. The amplified gene products of nuclear large subunit rDNA from 3 different mushrooms were cloned into E. coli vector and subjected to nucleotide sequence determination. The sequence thus determined revealed that the gene sequences of the same medicinal mushroom species were more than $99.48\%$ homologous, and the consensus sequences of 3 different medicinal mushrooms were more than $97.80\%$ homologous. Restriction analysis revealed no useful restriction sites for 6-bp recognition enzymes for distinguishing the 3 sequences from one another, but some distinctive restriction patterns were recognized by the 4-bp recognition enzymes AccII and HhaI. This analysis was also confirmed by PCR-RFLP experiments on medicinal mushrooms.

• Journal of applied mathematics & informatics
• /
• v.4 no.2
• /
• pp.513-528
• /
• 1997

A sort sequence $S_n$ is a sequence of all unordered pairs of indices in $I_n\;=\;{1,\;2,v...,\;n}$. With a sort sequence Sn we assicuate a sorting algorithm ($AS_n$) to sort input set $X\;=\;{x_1,\;x_2,\;...,\;x_n}$ as follows. An execution of the algorithm performs pairwise comparisons of elements in the input set X as defined by the sort sequence $S_n$, except that the comparisons whose outcomes can be inferred from the outcomes of the previous comparisons are not performed. Let $X(S_n)$ denote the acverage number of comparisons required by the algorithm $AS_n$ assuming all input orderings are equally likely. Let $X^{\ast}(n)\;and\;X^{\circ}(n)$ denote the minimum and maximum value respectively of $X(S_n)$ over all sort sequences $S_n$. Exact determination of $X^{\ast}(n),\;X^{\circ}(n)$ and associated extremal sort sequenes seems difficult. Here, we obtain bounds on $X^{\ast}(n)\;and\;X^{\circ}(n)$.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.23-25
• /
• 1998

Many of the currently used PN code acquisition algorithms detect the phase of the incoming PN signal on the basis of ML estimation principle and utilize statistics grounded in taking inner products. By showing that any set of 2n-1 PN sequences arising in SSRG or MSRG (those typically used in IS'95 implementations) configuration constitutes a linearly independent set and that the number of candidate PN sequences has to equal the dimension of the span of the candidate PN sequences, we prove that the lowerbounding computational complexity involved in any PN code acquistion, utilizing (only) inner product computations at each stage of acquisition, corresponds precisely to those, such as double dwell acquistion circuitries, currently used.

• Korean Journal of Agricultural Science
• /
• v.30 no.1
• /
• pp.59-65
• /
• 2003

To investigate the relationship of endogenous retroviruses in peccaries and pigs, a set of degenerate primers was used in this study to amplify peccary retroviral sequences. The sequences of two putative retroviral clones showed close homology to mouse and pig retroviral sequences. The peccary endogenous retroviral sequences are significant in that they are the first such sequences reported in peccary species and repudiate old claims in the literature that peccaries do not have C-type retroviral sequences.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.4
• /
• pp.511-517
• /
• 1998

In this paper a new technique to generate spreading code sequences in the CDMA communication is introduced. It is an effective method to generate optimal code sequences using the orthogonality of wavelet packet basis set of subspaces. With a three-stage Quadrature Mirror Filter(QMF), generation of optimal code sequences has been demonstrated. Since these generated optimal code sequences are non-binary and have an arbitrary waveform which is different from that of the conventional PN-based Gold code sequences, a strong security against the intended interceptor is feasible. Encouraging good correlation properties are also achieved with this new method.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.237-245
• /
• 2006

The set S of distinct scores (outdegrees) of the vertices of a k-partite tournament T($X_l,\;X_2, ..., X_k$) is called its score set. In this paper, we prove that every set of n non-negative integers, except {0} and {0, 1}, is a score set of some 3-partite tournament. We also prove that every set of n non-negative integers is a score set of some k-partite tournament for every $n{\ge}k{\ge}2$.

• Journal of applied mathematics & informatics
• /
• v.37 no.5_6
• /
• pp.459-467
• /
• 2019

In this work, via Orlicz functions, we have obtained a generalization of rough statistical convergence of asymptotically equivalent triple sequences a new non-matrix convergence method, which is intermediate between the ordinary convergence and the rough statistical convergence. We also have examined some inclusion relations related to this concept. We obtain the results are non negative real numbers with respect to the partial order on the set of real numbers.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.27.4-27
• /
• 2001

A stabilizing control method for linear systems with model uncertainties and hard input constraints is developed, which does not require on-line optimizations. This work is motivated by the constrained robust MPC(CRMPC) approach [3] which adopts the dual mode prediction strategy (i.e. free control moves and invariant set) and minimizes a worst case performance criterion. Based on the observation that, a feasible control sequence for a particular state can be found as a linear combination of feasible sequences for other states, we suggest a stabilizing control algorithm providing sub-optimal and feasible control sequences using pre-computed optimal sequences for some canonical states. The on-line computation of the proposed method reduces to simple matrix multiplication.