• Title/Summary/Keyword: d-sequences

Search Result 1,085, Processing Time 0.026 seconds

The Study of the Equation $(x+1)^d=x^d+1$ over Finite Fields (유한체위에서 방정식 $(x+1)^d=x^d+1$에 대한 연구)

  • Cho, Song-Jin;Kim, Han-Doo;Choi, Un-Sook;Kwon, Sook-Hee;Kwon, Min-Jeong;Kim, Jin-Gyoung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.237-240
    • /
    • 2012
  • Binary sequences of period $N=2^k-1$ are widely used in many areas of engineering and sciences. Some well-known applications include code-division multiple-access (CDMA) communications and stream cipher systems. In this paper, we analyze the equation $(x+1)^d=x^d+1$ over finite fields. The $d$ of the equation is used to analyze cross-correlation of binary sequences.

  • PDF

Mining Maximal Frequent Contiguous Sequences in Biological Data Sequences (생물학적 데이터 서열들에서 빈번한 최대길이 연속 서열 마이닝)

  • Kang, Tae-Ho;Yoo, Jae-Soo
    • The KIPS Transactions:PartD
    • /
    • v.15D no.2
    • /
    • pp.155-162
    • /
    • 2008
  • Biological sequences such as DNA sequences and amino acid sequences typically contain a large number of items. They have contiguous sequences that ordinarily consist of hundreds of frequent items. In biological sequences analysis(BSA), a frequent contiguous sequence search is one of the most important operations. Many studies have been done for mining sequential patterns efficiently. Most of the existing methods for mining sequential patterns are based on the Apriori algorithm. In particular, the prefixSpan algorithm is one of the most efficient sequential pattern mining schemes based on the Apriori algorithm. However, since the algorithm expands the sequential patterns from frequent patterns with length-1, it is not suitable for biological dataset with long frequent contiguous sequences. In recent years, the MacosVSpan algorithm was proposed based on the idea of the prefixSpan algorithm to significantly reduce its recursive process. However, the algorithm is still inefficient for mining frequent contiguous sequences from long biological data sequences. In this paper, we propose an efficient method to mine maximal frequent contiguous sequences in large biological data sequences by constructing the spanning tree with the fixed length. To verify the superiority of the proposed method, we perform experiments in various environments. As the result, the experiments show that the proposed method is much more efficient than MacosVSpan in terms of retrieval performance.

3D Non-local Means(NLM) Algorithm Based on Stochastic Distance for Low-dose X-ray Fluoroscopy Denoising (저선량 X-ray 영상의 잡음 제거를 위한 확률 거리 기반 3차원 비지역적 평균 알고리즘)

  • Lee, Min Seok;Kang, Moon Gi
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.4
    • /
    • pp.61-67
    • /
    • 2017
  • Low-dose X-ray fluoroscopic image sequences to avoid radiation exposure risk are contaminated by quantum noise. To restore these noisy sequences, we propose a 3D nonlocal means (NLM) filter based on stochastic distancesed can be applied to the denoising of X-ray fluoroscopic image sequences. The stochastic distance is obtained within motion-compensated noise filtering support to remove the Poisson noise. In this paper, motion-adaptive weight which reflected the frame similarity is proposed to restore the noisy sequences without motion artifact. Experimental results including comparisons with conventional algorithms for real X-ray fluoroscopic image sequences show the proposed algorithm has a good performance in both visual and quantitative criteria.

Detecting Peripheral Nerves in the Elbow using Three-Dimensional Diffusion-Weighted PSIF Sequences: a Feasibility Pilot Study

  • Na, Domin;Ryu, Jaeil;Hong, Suk-Joo;Hong, Sun Hwa;Yoon, Min A;Ahn, Kyung-Sik;Kang, Chang Ho;Kim, Baek Hyun
    • Investigative Magnetic Resonance Imaging
    • /
    • v.20 no.2
    • /
    • pp.81-87
    • /
    • 2016
  • Purpose: To analyze the feasibility of three-dimensional (3D) diffusion-weighted (DW) PSIF (reversed FISP [fast imaging with steady-state free precession]) sequence in order to evaluate peripheral nerves in the elbow. Materials and Methods: Ten normal, asymptomatic volunteers were enrolled (6 men, 4 women, mean age 27.9 years). The following sequences of magnetic resonance images (MRI) of the elbow were obtained using a 3.0-T machine: 3D DW PSIF, 3D T2 SPACE (sampling perfection with application optimized contrasts using different flip angle evolution) with SPAIR (spectral adiabatic inversion recovery) and 2D T2 TSE (turbo spin echo) with modified Dixon (m-Dixon) sequence. Two observers used a 5-point grading system to analyze the image quality of the ulnar, median, and radial nerves. The signal-to-noise ratio (SNR) and contrast-to-noise ratio (CNR) of each nerve were measured. We compared 3D DW PSIF images with other sequences using the Wilcoxon-signed rank test and Friedman test. Inter-observer agreement was measured using intraclass correlation coefficient (ICC) analysis. Results: The mean 5-point scores of radial, median, and ulnar nerves in 3D DW PSIF (3.9/4.2/4.5, respectively) were higher than those in 3D T2 SPACE SPAIR (1.9/2.8/2.8) and 2D T2 TSE m-Dixon (1.7/2.8/2.9) sequences (P < 0.05). The mean SNR in 3D DW PSIF was lower than 3D T2 SPACE SPAIR, but there was no difference between 3D DW PSIF and 2D T2 TSE m-Dixon in all of the three nerves. The mean CNR in 3D DW PSIF was lower than 3D T2 SPACE SPAIR and 2D T2 TSE m-Dixon in the median and ulnar nerves, but no difference among the three sequences in the radial nerve. Conclusion: The three-dimensional DW PSIF sequence may be feasible to evaluate the peripheral nerves around the elbow in MR imaging. However, further optimization of the image quality (SNR, CNR) is required.

Genetic diversity analysis of Thai indigenous chickens based on complete sequences of mitochondrial DNA D-loop region

  • Teinlek, Piyanat;Siripattarapravat, Kannika;Tirawattanawanich, Chanin
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.31 no.6
    • /
    • pp.804-811
    • /
    • 2018
  • Objective: Complete mtDNA D-loop sequences of four Thai indigenous chicken varieties, including Pra-dhu-hang-dam (PD), Leung-hang-khao (LK), Chee (CH), and Dang (DA) were explored for genetic diversity and relationships with their potential ancestor and possible associates to address chicken domestication in Thailand. Methods: A total of 220 complete mtDNA D-loop sequences of the four Thai indigenous chicken varieties were obtained by Sanger direct sequencing of polymerase chain reaction amplicons of 1,231 to 1,232 base pair in size. A neighbor-joining dendrogram was constructed with reference complete mtDNA D-loop sequences of Red Junglefowl (RJF) and those different chicken breeds available on National Center for Biotechnology Information database. Genetic diversity indices and neutrality test by Tajima's D test were performed. Genetic differences both within and among populations were estimated using analysis of molecular variance (AMOVA). Pairwise fixation index ($F_{ST}$) was conducted to evaluated genetic relationships between these varieties. Results: Twenty-three identified haplotypes were classified in six haplogroups (A-E and H) with the majority clustered in haplogroup A and B. Each variety was in multiple haplogroups with haplogroups A, B, D, and E being shared by all studied varieties. The averaged haplotype and nucleotide diversities were, respectively 0.8607 and 0.00579 with non-significant Tajima's D values being observed in all populations. Haplogroup distribution was closely related to that of RJF particularly Gallus gallus gallus (G. g. gallus) and G. g. spadiceus. As denoted by AMOVA, the mean diversity was mostly due to within-population variation (90.53%) while between-population variation (9.47%) accounted for much less. By pairwise $F_{ST}$, LK was most closely related to DA ($F_{ST}=0.00879$) while DA was farthest from CH ($F_{ST}=0.24882$). Conclusion: All 4 Thai indigenous chickens are in close relationship with their potential ancestor, the RJF. A contribution of shared, multiple maternal lineages was in the nature of these varieties, which have been domesticated under neutral selection.

PN Sequence Generation from 2-D Array of Shift Registers

  • Kim, Hyun-Jung;Lee, In-Kyu;Kim, Woon-Kyung M.
    • ETRI Journal
    • /
    • v.27 no.3
    • /
    • pp.273-279
    • /
    • 2005
  • Toward code division multiple access (CDMA) communications and data protection, we propose and analyze pseudorandom noise (PN) sequences generated from a 2-dimensional array structure of shift-registers. For any positive integers m and n, we construct PN sequences of period $2^{mm}-1$ using an $m{\times}n$ array of registers and show that we can generate all shifted PN sequences as required by IS-95x with the proper linear combination of available sequences.

  • PDF

The distribution of the values of the cross-correlation function between the maximal period binary sequences (최대 주기를 갖는 이진 수열의 상호상관 함숫값의 분포)

  • Kwon, Min-Jeong;Cho, Sung-Jin
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.6
    • /
    • pp.891-897
    • /
    • 2013
  • The spectrum and the number of the values of the cross-correlation function between the maximal period binary sequences have been extensively studied because of their importance in communications applications. In this paper, we propose the new family of the sequences using the decimation $d=2^{m-1}(3{\cdot}2^{m}-1)$. And we find the spectrum of the cross-correlation function of the sequences and analyze the number of times each value occurs for $0{\leq}{\tau}{\leq}2^{n}-2$.

ON MINIMAL PRODUCT-ONE SEQUENCES OF MAXIMAL LENGTH OVER DIHEDRAL AND DICYCLIC GROUPS

  • Oh, Jun Seok;Zhong, Qinghai
    • Communications of the Korean Mathematical Society
    • /
    • v.35 no.1
    • /
    • pp.83-116
    • /
    • 2020
  • Let G be a finite group. By a sequence over G, we mean a finite unordered sequence of terms from G, where repetition is allowed, and we say that it is a product-one sequence if its terms can be ordered such that their product equals the identity element of G. The large Davenport constant D(G) is the maximal length of a minimal product-one sequence, that is, a product-one sequence which cannot be factored into two non-trivial product-one subsequences. We provide explicit characterizations of all minimal product-one sequences of length D(G) over dihedral and dicyclic groups. Based on these characterizations we study the unions of sets of lengths of the monoid of product-one sequences over these groups.

(±1)-INVARIANT SEQUENCES AND TRUNCATED FIBONACCI SEQUENCES OF THE SECOND KIND

  • CHOI GYOUNG-SIK;HWANG SUK-GEUN;KIM IK-PYO
    • Journal of the Korean Mathematical Society
    • /
    • v.42 no.4
    • /
    • pp.761-771
    • /
    • 2005
  • In this paper we present another characterization of (${\pm}1$)-invariant sequences. We also introduce truncated Fibonacci and Lucas sequences of the second kind and show that a sequence $x\;{\in}\;R^{\infty}$ is (-1)-invariant(l-invariant resp.) if and only if $D[_x^0]$ is perpendicular to every truncated Fibonacci(truncated Lucas resp.) sequence of the second kind where $$D=diag((-1)^0,\; (-1)^1,\;(-1)^2,{\ldots})$$.

2-D graphical representation of protein sequences and its application to coronavirus phylogeny

  • Li, Chun;Xing, Lili;Wang, Xin
    • BMB Reports
    • /
    • v.41 no.3
    • /
    • pp.217-222
    • /
    • 2008
  • Based on a five-letter model of the 20 amino acids, we propose a new 2-D graphical representation of protein sequence. Then we transform the 2-D graphical representation into a numerical characterization that will facilitate quantitative comparisons of protein sequences. As an application, we construct the phylogenetic tree of 56 coronavirus spike proteins. The resulting tree agrees well with the established taxonomic groups.