• Title/Summary/Keyword: sequences

Search Result 8,500, Processing Time 0.039 seconds

DEFERRED INVARIANT STATISTICAL CONVERGENCE OF ORDER 𝜂 FOR SET SEQUENCES

  • Gulle, Esra
    • Honam Mathematical Journal
    • /
    • v.44 no.1
    • /
    • pp.110-120
    • /
    • 2022
  • In this paper, we introduce the concepts of Wijsman invariant statistical, Wijsman deferred invariant statistical and Wijsman strongly deferred invariant convergence of order 𝜂 (0 < 𝜂 ≤ 1) for set sequences. Also, we investigate some properties of these concepts and some relationships between them.

Video Sequences Registration by using Interested Points Extraction (특징점 추출에 의한 비디오 영상등록)

  • Kim, Seong-Sam;Lee, Hye-Suk;Kim, Eui-Myoung;Yoo, Hwan-Hee
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2007.04a
    • /
    • pp.127-130
    • /
    • 2007
  • The increased availability of portable, low-cost, high resolution video devices has resulted in a rapid growth of the applications for video sequences. These video devices can be mounted in handhold unit, mobile unit and airborne platforms like maned or unmaned helicopter, plane, airship, etc. A core technique in use of video sequences is to align neighborhood video frames to each other or to reference images. For video sequences registration, we extracted interested points from aerial video sequences using Harris, $F{\square}rstner$, and KLT operators and implemented image matching using these points. As the result, we analysed image matching results for each operators and evaluated accuracy of aerial video registration.

  • PDF

Analysis of Cross-Correlation of m-sequences and Equation on Finite Fields (유한체상의 방정식과 m-수열의 상호상관관계 분석)

  • Choi, Un-Sook;Cho, Sung-Jin
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.7 no.4
    • /
    • pp.821-826
    • /
    • 2012
  • p-ary sequences of period $N=2^k-1$ are widely used in many areas of engineering and sciences. Some well-known applications include coding theory, code-division multiple-access (CDMA) communications, and stream cipher systems. The analysis of cross-correlations of these sequences is a very important problem in p-ary sequences research. In this paper, we analyze cross-correlations of p-ary sequences which is associated with the equation $(x+1)^d=x^d+1$ over finite fields.

Phylogenetic Relationships Among Six Vetigastropod Subgroups (Mollusca, Gastropoda) Based on 18S rDNA Sequences

  • Yoon, Sook Hee;Kim, Won
    • Molecules and Cells
    • /
    • v.19 no.2
    • /
    • pp.283-288
    • /
    • 2005
  • Complete 18S rDNA sequences were determined for 10 vetigastropods in order to investigate the phylogeny of Vetigastropoda, which is controversial. These sequences were analyzed together with published sequences for nine other vetigastropods and two nerites. With the two nerites as outgroups, the phylogeny was inferred by three analytical methods, neighbor-joining, maximum likelihood, and maximum parsimony. The 18S rDNA sequence data support the monophyly of four vetigastropod superfamilies, the Pleurotomarioidea, the Fissurelloidea, the Haliotoidea, and the Trochoidea. The present results yield the new branching order: (Pleurotomarioidea (Fissurelloidea ((Scissurelloidea, Lepetodriloidea) (Haliotoidea, Trochoidea)))) within the vetigastropod clade.

18S Ribosomal DNA Sequences Provide Insight into the Phylogeny of Patellogastropod Limpets (Mollusca: Gastropoda)

  • Yoon, Sook Hee;Kim, Won
    • Molecules and Cells
    • /
    • v.23 no.1
    • /
    • pp.64-71
    • /
    • 2007
  • To investigate the phylogeny of Patellogastropoda, the complete 18S rDNA sequences of nine patellogastropod limpets Cymbula canescens (Gmelin, 1791), Helcion dunkeri (Krauss, 1848), Patella rustica Linnaeus, 1758, Cellana toreuma (Reeve, 1855), Cellana nigrolineata (Reeve, 1854), Nacella magellanica Gmelin, 1791, Nipponacmea concinna (Lischke, 1870), Niveotectura pallida (Gould, 1859), and Lottia dorsuosa Gould, 1859 were determined. These sequences were then analyzed along with the published 18S rDNA sequences of 35 gastropods, one bivalve, and one chiton species. Phylogenetic trees were constructed by maximum parsimony, maximum likelihood, and Bayesian inference. The results of our 18S rDNA sequence analysis strongly support the monophyly of Patellogastropoda and the existence of three subgroups. Of these, two subgroups, the Patelloidea and Acmaeoidea, are closely related, with branching patterns that can be summarized as [(Cymbula + Helcion) + Patella] and [(Nipponacmea + Lottia) + Niveotectura]. The remaining subgroup, Nacelloidea, emerges as basal and paraphyletic, while its genus Cellana is monophyletic. Our analysis also indicates that the Patellogastropoda have a sister relationship with the order Cocculiniformia within the Gastropoda.

2-D Graphical Representation for Characteristic Sequences of DNA and its Application

  • Li, Chun;Hu, Ji
    • BMB Reports
    • /
    • v.39 no.3
    • /
    • pp.292-296
    • /
    • 2006
  • DNA sequencing has resulted in an abundance of data on DNA sequences for various species. Hence, the characterization and comparison of sequences become more important but still difficult tasks. In this paper, we first give a 2-D ladderlike graphical representation for the characteristic sequences of a DNA sequence, and then construct a 3-component vector, in which the normalized ALE-indices extracted from such three 2-D graphs via D/D matrices are individual components, to characterize the DNA sequence. The examination of similarities/dissimilarities among sequences of the $\beta$-globin genes of different species illustrates the utility of the approach.

Setup and Operation Sequence Generation from Manufacturability Evaluation for Prismatic Parts (제조성 평가를 기반으로 한 비회전형상 부품의 작업준비 및 작업순서 생성)

  • Choi, Hoo Gon;Han, Jung Hyun;Kang, Mujin
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.31 no.4
    • /
    • pp.316-333
    • /
    • 2005
  • Although some successful recognition algorithms have been developed, most of them did emphasize on extracting accurate interpretations without considerations of manufacturability. Evaluating the manufacturability for multiple features leads to produce the machining sequences. In this paper, the A* algorithm guarantees the optimal setup sequences with minimizing the machining cost. Also, tolerances including surface roughness are converted to STEP formats to be utilized for more reliable process plans. Finally, decision tables are used to create the detailed operational sequences based on geometric tolerances and surface roughness. Machining parameters such as feed, depth of cut, and cutting speed for each operation are added to the routing sheet. Windows are presented to show how the entire system works for a sample part.

Sufficient Conditions for Fully Orthotropic Stacking Sequences (완전 직교이방성 적층순서에 대한 충분조건)

  • Lee, Jong-Won;Kim, Jin-Won
    • Proceedings of the KSME Conference
    • /
    • 2007.05a
    • /
    • pp.28-32
    • /
    • 2007
  • Sufficient Conditions are proposed herein for analytically obtaining fully orthotropic (A16=A26=0, Bij=0, D16=D26=0) laminate stacking sequences together with a brief literature survey. A number of specially chosen anti-symmetric balanced stacking sequences are analytically studied, in which all coupling stiffnesses including B16 and B26 are identically zero. Those specially chosen anti-symmetric balanced stacking sequences are then arranged symmetrically with respect to the laminate mid-plane to obtain a number of symmetric stacking balanced stacking sequences of which the elastic stiffnesses are fully orthotropic.

  • PDF

ESSENTIAL EXACT SEQUENCES

  • Akray, Ismael;Zebari, Amin
    • Communications of the Korean Mathematical Society
    • /
    • v.35 no.2
    • /
    • pp.469-480
    • /
    • 2020
  • Let R be a commutative ring with identity and M a unital R-module. We give a new generalization of exact sequences called e-exact sequences. A sequence $0{\rightarrow}A{\longrightarrow[20]^f}B{\longrightarrow[20]^g}C{\rightarrow}0$ is said to be e-exact if f is monic, Imf ≤e Kerg and Img ≤e C. We modify many famous theorems including exact sequences to one includes e-exact sequences like 3 × 3 lemma, four and five lemmas. Next, we prove that for torsion-free module M, the contravariant functor Hom(-, M) is left e-exact and the covariant functor M ⊗ - is right e-exact. Finally, we define e-projective module and characterize it. We show that the direct sum of R-modules is e-projective module if and only if each summand is e-projective.