• Title/Summary/Keyword: Data Sequence

Search Result 3,093, Processing Time 0.033 seconds

Reversible Data Embedding Algorithm Using the Locality of Image and the Adjacent Pixel Difference Sequence (영상의 지역성과 인접 픽셀 차분 시퀀스를 이용하는 가역 데이터 임베딩 기법)

  • Jung, Soo-Mok
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.9 no.6
    • /
    • pp.573-577
    • /
    • 2016
  • In this paper, reversible data embedding scheme was proposed using the locality of image and the adjacent pixel difference sequence. Generally, locality exists in natural image. The proposed scheme increases the amount of embedding data and enables data embedding at various levels by applying a technique of predicting adjacent pixel values using image locality to an existing technique APD(Adjacent Pixel Difference). The experimental results show that the proposed scheme is very useful for reversible data embedding.

A Primer for Disease Gene Prioritization Using Next-Generation Sequencing Data

  • Wang, Shuoguo;Xing, Jinchuan
    • Genomics & Informatics
    • /
    • v.11 no.4
    • /
    • pp.191-199
    • /
    • 2013
  • High-throughput next-generation sequencing (NGS) technology produces a tremendous amount of raw sequence data. The challenges for researchers are to process the raw data, to map the sequences to genome, to discover variants that are different from the reference genome, and to prioritize/rank the variants for the question of interest. The recent development of many computational algorithms and programs has vastly improved the ability to translate sequence data into valuable information for disease gene identification. However, the NGS data analysis is complex and could be overwhelming for researchers who are not familiar with the process. Here, we outline the analysis pipeline and describe some of the most commonly used principles and tools for analyzing NGS data for disease gene identification.

Sequence Data Indexing Method based on Minimum DTW Distance (최소 DTW 거리 기반의 데이터 시퀀스 색인 기법)

  • Khil, Ki-Jeong;Song, Seok-Il;Song, Chai-Jong;Lee, Seok-Pil;Jang, Sei-Jin;Lee, Jong-Seol
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.12
    • /
    • pp.52-59
    • /
    • 2011
  • In this paper, we propose an indexing method to support efficient similarity search for sequence databases. We present a new distance measurement called minimum DTW distance to enhance the filtering effects. The minimum DTW distance is to measure the minimum distance between a sequence data and the group of similar sequences. It enables similarity search through hierarchical index structure by filtering sequence databases. Finally, we show the superiority of our method through some experiments.

A Functional Design of Programmable Logic Controller Based on Parallel Architecture (병렬 구조에 의한 가변 논리제어장치의 기능적 설계)

  • 이정훈;신현식
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.40 no.8
    • /
    • pp.836-844
    • /
    • 1991
  • PLC(programmable logic controller) system is widely used for the control of factory. PLC system receives ladder diagram which is drawn by the user to implement hardware logic, converts the ladder diagram into sequence program which is executable in the PLC system, and executes the sequence program indefinitely unless user breaks. The sequence program processes the data of on/off signal, and endures 1 scan delay and missing of pulse-type signal shorter than a scan time. So, data dependency doesn't exist. By applying theis characteristics to multiprocessor architecture, we design parellel PLC functionally and evaluate performance upgrade. Parallel PLC consists of central processing module, N general processing unit, and a shared memory by master-slave type. Each module executes allocated sequence program by the control of central processing module. We can expect performance upgrade by parallel processing, and reliability by relocation of sequence program when error occurs in processing module.

  • PDF

A Novel M-ary Code-Selected Direct Sequence BPAM UWB Communication System

  • Bai, Zhiquan;Kwak, Kyung-Sup
    • ETRI Journal
    • /
    • v.28 no.1
    • /
    • pp.95-98
    • /
    • 2006
  • In this letter, a novel M-ary code-selected direct sequence (DS) ultra-wideband (UWB) communication system is presented. Our purpose is to achieve a high data rate by an M-ary code-selected direct sequence bipolar pulse amplitude modulation (MCSDS-BPAM) scheme. In this system, a particular DS code sequence is selected by the $log_2M$/2 bits from the DS gold code set. This scheme can accomplish both a high data rate without increasing the system bandwidth or changing the pulse shape and improve the BER with an increase of modulation level M even at a lower signal-to-noise ratio (SNR). The receiver signal processing algorithm is given for an MCSDS-BPAM UWB system over an ideal AWGN channel and correlation receivers.

  • PDF

Correlation Analysis between Regulatory Sequence Motifs and Expression Profiles by Kernel CCA

  • Rhee, Je-Keun;Joung, Je-Gun;Chang, Jeong-Ho;Zhang, Byoung-Tak
    • Proceedings of the Korean Society for Bioinformatics Conference
    • /
    • 2005.09a
    • /
    • pp.63-68
    • /
    • 2005
  • Transcription factors regulate gene expression by binding to gene upstream region. Each transcription factor has the specific binding site in promoter region. So the analysis of gene upstream sequence is necessary for understanding regulatory mechanism of genes, under a plausible idea that assumption that DNA sequence motif profiles are closely related to gene expression behaviors of the corresponding genes. Here, we present an effective approach to the analysis of the relation between gene expression profiles and gene upstream sequences on the basis of kernel canonical correlation analysis (kernel CCA). Kernel CCA is a useful method for finding relationships underlying between two different data sets. In the application to a yeast cell cycle data set, it is shown that gene upstream sequence profile is closely related to gene expression patterns in terms of canonical correlation scores. By the further analysis of the contributing values or weights of sequence motifs in the construction of a pair of sequence motif profiles and expression profiles, we show that the proposed method can identify significant DNA sequence motifs involved with some specific gene expression patterns, including some well known motifs and those putative, in the process of the yeast cell cycle.

  • PDF

A Process Mining using Association Rule and Sequence Pattern (연관규칙과 순차패턴을 이용한 프로세스 마이닝)

  • Chung, So-Young;Kwon, Soo-Tae
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.31 no.2
    • /
    • pp.104-111
    • /
    • 2008
  • A process mining is considered to support the discovery of business process for unstructured process model, and a process mining algorithm by using the associated rule and sequence pattern of data mining is developed to extract information about processes from event-log, and to discover process of alternative, concurrent and hidden activities. Some numerical examples are presented to show the effectiveness and efficiency of the algorithm.

Comparison of Two Algorithms using CAZAC Sequence for Cable Modem Uplink (케이블 모뎀 상향링크에 적합한 CAZAC sequence를 이용한 coarse timing recovery의 두 알고리즘 비교)

  • Ha, Hyun-Ju;Oh, Wang-Rok;Kim, Whan-Woo
    • Proceedings of the IEEK Conference
    • /
    • 2007.07a
    • /
    • pp.53-54
    • /
    • 2007
  • As Cable Network is developing for 2-way high speed data service, it should be developed to transfer high speed data using limited bandwidth. If QAM is using for this, synchronization algorithms become important system parameters. In this paper, we present two methods of coarse timing recovery using CAZAC sequence for cable modem uplink.

  • PDF

Efficient Synchronization Scheme for Cooperative Communication System over Fading Channel (페이딩 환경에서의 효율적인 협력통신 시스템 동기 알고리즘 연구)

  • Kim, Yoon-Hyun;Kim, Jin-Young
    • Journal of Satellite, Information and Communications
    • /
    • v.5 no.2
    • /
    • pp.64-68
    • /
    • 2010
  • In this paper, we studied the novel synchronization algorithm for cooperative communication system over fading. We research mainly on the decode-and-forward scheme. Also, we inserted spreading sequence in origin data frame to control efficiently data synchronization. In mobile station, inserted spreading sequence in data frame passed through the corelation process. We had decide the delay value of received data through result of correlation process. In simulation, We applied that channel gain of three node had different value in various fading environment. Finally we will be possible to control the received data synchronization using result of corelation value in each node between relay to mobile station and base station to mobile station. The results of this paper can be applicable to the cooperative systems.

A K-Nearest Neighbor Algorithm for Categorical Sequence Data (범주형 시퀀스 데이터의 K-Nearest Neighbor알고리즘)

  • Oh Seung-Joon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.2 s.34
    • /
    • pp.215-221
    • /
    • 2005
  • TRecently, there has been enormous growth in the amount of commercial and scientific data, such as protein sequences, retail transactions, and web-logs. Such datasets consist of sequence data that have an inherent sequential nature. In this Paper, we study how to classify these sequence datasets. There are several kinds techniques for data classification such as decision tree induction, Bayesian classification and K-NN etc. In our approach, we use a K-NN algorithm for classifying sequences. In addition, we propose a new similarity measure to compute the similarity between two sequences and an efficient method for measuring similarity.

  • PDF