• Title/Summary/Keyword: sequence number

Search Result 1,745, Processing Time 0.028 seconds

A COMPLETE FORMULA FOR THE ORDER OF APPEARANCE OF THE POWERS OF LUCAS NUMBERS

  • Pongsriiam, Prapanpong
    • Communications of the Korean Mathematical Society
    • /
    • v.31 no.3
    • /
    • pp.447-450
    • /
    • 2016
  • Let $F_n$ and $L_n$ be the nth Fibonacci number and Lucas number, respectively. The order of appearance of m in the Fibonacci sequence, denoted by z(m), is the smallest positive integer k such that m divides $F_k$. Marques obtained the formula of $z(L^k_n)$ in some cases. In this article, we obtain the formula of $z(L^k_n)$ for all $n,k{\geq}1$.

The Forbidden Number of a Knot

  • CRANS, ALISSA S.;MELLOR, BLAKE;GANZELL, SANDY
    • Kyungpook Mathematical Journal
    • /
    • v.55 no.2
    • /
    • pp.485-506
    • /
    • 2015
  • Every classical or virtual knot is equivalent to the unknot via a sequence of extended Reidemeister moves and the so-called forbidden moves. The minimum number of forbidden moves necessary to unknot a given knot is an invariant we call the forbidden number. We relate the forbidden number to several known invariants, and calculate bounds for some classes of virtual knots.

A Study on the Covert Channel Detection in the TCP/IP Header based on the Support Vector Machine (Support Vector Machine 기반 TCP/IP 헤더의 은닉채널 탐지에 관한 연구)

  • 손태식;서정우;서정택;문종섭;최홍민
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.14 no.1
    • /
    • pp.35-45
    • /
    • 2004
  • In explosively increasing internet environments, information security is one of the most important consideration. Nowadays, various security solutions are used as such problems countermeasure; IDS, Firewall and VPN. However, basically internet has much vulnerability of protocol itself. Specially, it is possible to establish a covert channel using TCP/IP header fields such as identification, sequence number, acknowledge number, timestamp and so on. In this Paper, we focus cm the covert channels using identification field of IP header and the sequence number field of TCP header. To detect such covert channels, we used Support Vector Machine which has excellent performance in pattern classification problems. Our experiments showed that proposed method could discern the abnormal cases(including covert channels) from normal TCP/IP traffic using Support Vector Machine.

PEBBLING ON THE MIDDLE GRAPH OF A COMPLETE BINARY TREE

  • LOURDUSAMY, A.;NELLAINAYAKI, S. SARATHA;STEFFI, J. JENIFER
    • Journal of applied mathematics & informatics
    • /
    • v.37 no.3_4
    • /
    • pp.163-176
    • /
    • 2019
  • Given a distribution of pebbles on the vertices of a connected graph G, a pebbling move is defined as the removal of two pebbles from some vertex and the placement of one of those pebbles at an adjacent vertex. The t-pebbling number, $f_t(G)$, of a connected graph G, is the smallest positive integer such that from every placement of $f_t(G)$ pebbles, t pebbles can be moved to any specified vertex by a sequence of pebbling moves. A graph G has the 2t-pebbling property if for any distribution with more than $2f_t(G)$ - q pebbles, where q is the number of vertices with at least one pebble, it is possible, using the sequence of pebbling moves, to put 2t pebbles on any vertex. In this paper, we determine the t-pebbling number for the middle graph of a complete binary tree $M(B_h)$ and we show that the middle graph of a complete binary tree $M(B_h)$ satisfies the 2t-pebbling property.

A Study on a Binary Random Sequence Generator with Two Characteristic Polynomials (두개의 특성 다항식으로 구성된 이진 난수열 발생기에 관한 연구)

  • 김대엽;주학수;임종인
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.12 no.3
    • /
    • pp.77-85
    • /
    • 2002
  • A Research of binary random sequence generator that uses a linear shift register had been studied since the 1970s. These generators were used in stream cipher. In general, the binary random sequence generator consists of linear shift registers that generate sequences of maximum period and a nonlinear filter function or a nonlinear combination function to generate a sequence of high linear complexity. Therefore, To generate a sequence that have long period as well as high linear complexity becomes an important factor to estimate safety of stream cipher. Usually, the maximum period of the sequence generated by a linear feedback shift register with L resistors is less than or equal to $2^L$-1. In this paper, we propose new binary random sequence generator that consist of L registers and 2 sub-characteristic polynomials. According to an initial state vector, the least period of the sequence generated by the proposed generator is equal to or ions than it of the sequence created by the general linear feedback shift register, and its linear complexity is increased too.

Sequence based Intrusion Detection using Similarity Matching of the Multiple Sequence Alignments (다중서열정렬의 유사도 매칭을 이용한 순서기반 침입탐지)

  • Kim Yong-Min
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.16 no.1
    • /
    • pp.115-122
    • /
    • 2006
  • The most methods for intrusion detection are based on the misuse detection which accumulates hewn intrusion information and makes a decision of an attack against any behavior data. However it is very difficult to detect a new or modified aoack with only the collected patterns of attack behaviors. Therefore, if considering that the method of anomaly behavior detection actually has a high false detection rate, a new approach is required for very huge intrusion patterns based on sequence. The approach can improve a possibility for intrusion detection of known attacks as well as modified and unknown attacks in addition to the similarity measurement of intrusion patterns. This paper proposes a method which applies the multiple sequence alignments technique to the similarity matching of the sequence based intrusion patterns. It enables the statistical analysis of sequence patterns and can be implemented easily. Also, the method reduces the number of detection alerts and false detection for attacks according to the changes of a sequence size.

Mitochondrial Genome Microsatellite Instability and Copy Number Alteration in Lung Carcinomas

  • Dai, Ji-Gang;Zhang, Zai-Yong;Liu, Quan-Xing;Min, Jia-Xin
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.14 no.4
    • /
    • pp.2393-2399
    • /
    • 2013
  • Objective: Mitochondrial DNA (mtDNA) is considered a hotspot of mutations in various tumors. However, the relationship between microsatellite instability (MSI) and mtDNA copy number alterations in lung cancer has yet to be fully clarifieds. In the current study, we investigated the copy number and MSI of mitochondrial genome in lung carcinomas, as well as their significance for cancer development. Methods: The copy number and MSI of mtDNA in 37 matched lung carcinoma/adjacent histological normal lung tissue samples were examined by polymerase chain reaction-single strand conformation polymorphism (PCR-SSCP) assays for sequence variation, followed by sequence analysis and fluorogenic 5'-nuclease real-time PCR. Student's t test and linear regression analyses were employed to analyze the association between mtDNA copy number alterations and mitochondrial MSI (mtMSI). Results: The mean copy number of mtDNA in lung carcinoma tissue samples was significantly lower than that of the adjacent histologically normal lung tissue samples (p<0.001). mtMSI was detected in 32.4% (12/37) of lung carcinoma samples. The average copy number of mtDNA in lung carcinoma samples containing mtMSI was significantly lower than that in the other lung carcinoma samples (P<0.05). Conclusions: Results suggest that mtMSI may be an early and important event in the progression of lung carcinogenesis, particularly in association with variation in mtDNA copy number.

A Development of Integrated Operation System of Container Terminals in Ubiquitous Environment using RFID

  • Park, Doo-Jin;Yoo, Ju-Young;Nam, Ki-Chan
    • Journal of Navigation and Port Research
    • /
    • v.30 no.9
    • /
    • pp.741-748
    • /
    • 2006
  • Number of researches on efficient terminal operation system applying RFID(Radio Frequency Identification) are in progress. However, RFID has limitations on tracking and providing accurate positions of containers. In this paper, to enhance the performance of the integrated terminal operation system, an efficient loading management of yard is proposed by applying RFID based RTLS(Real Time Locating System) that provides real time accurate positions of containers. It was found that a group based sequence system is more efficient than the existing individual sequence number system in the container yard In the group based sequence system, the containers in the same group should have similar characteristics such as port of destination(POD), size, weight, etc. In order to run this system, we proposed the parameters to the unspecified N bytes of RFID tag which are specified in ISO 18000 7. And then, we developed an integrated operation system of container terminal using RFID. The proposed system reduces the ship turnaround time in ubiquitous port environments.

Performance analysis on the nonlinear distortion in OFCDM downlink system using clipped multilevel-PSK (Clipped multilevel-PSK를 이용한 OFCDM 순방향 링크에서 비선형 왜곡에 대한 성능 분석)

  • 안치훈;최영관;장승훈;김동구
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.11
    • /
    • pp.17-26
    • /
    • 2003
  • To reduce the nonlinear distortion of high power amplifier(HPA) in down link OFCDM system to employ time domain spreading, we apply technology which transmits MPSK(Multilevel-PSK) signal after clipping on multilevel input signal of IFFT subcarrier. In case that the nonlinear distortion of HPA is considered in AWGN channel, performacne of clipping OFCDM system using extended m sequence is over 2.2㏈ better than that of OFCDM system using extended m sequence when the number of user is 8 and 16. In case that the nonlinear distortion of HPA is considered in quasi-static channel, performacne of clipping OFCDM system using extended m code is over 2㏈ better than that of OFCDM system using extended m sequence when the number of user is 8 and 16.

Detection of hydin Gene Duplication in Personal Genome Sequence Data

  • Kim, Jong-Il;Ju, Young-Seok;Kim, Shee-Hyun;Hong, Dong-Wan;Seo, Jeong-Sun
    • Genomics & Informatics
    • /
    • v.7 no.3
    • /
    • pp.159-162
    • /
    • 2009
  • Human personal genome sequencing can be done with high efficiency by aligning a huge number of short reads derived from various next generation sequencing (NGS) technologies to the reference genome sequence. One of the major obstacles is the incompleteness of human reference genome. We tried to analyze the effect of hidden gene duplication on the NGS data using the known example of hydin gene. Hydin2, a duplicated copy of hydin on chromosome 16q22, has been recently found to be localized to chromosome 1q21, and is not included in the current version of standard human genome reference. We found that all of eight personal genome data published so far do not contain hydin2, and there is large number of nsSNPs in hydin. The heterozygosity of those nsSNPs was significantly higher than expected. The sequence coverage depth in hydin gene was about two fold of average depth. We believe that these unique finding of hydin can be used as useful indicators to discover new hidden multiplication in human genome.