• Title/Summary/Keyword: Source Code Convert

Search Result 15, Processing Time 0.025 seconds

Development of bio-signal analysis system applying source code based on various algorithm development tools (다양한 알고리즘 개발 툴 기반의 소스 코드를 적용한 생체신호 분석 시스템 개발)

  • Ju, Mun-Il;Kim, Won-Il;Kim, Hui-Cheol
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2018.10a
    • /
    • pp.238-240
    • /
    • 2018
  • Recently, healthcare services have been developed and studied using various bio-signal analysis tools. Most bio-signal analysis studies utilize Matlab and R Programming. However, in order to apply the algorithm developed by Matlab and R Programming to the system, it is necessary to convert the source code. This paper proposes a smart interface that can skip source code conversion.

  • PDF

Adaptive Multi-Rate(AMR) Speech Coding Algorithm (Adaptive Multi-Rate(AMR) 음성부호화 알고리즘)

  • 서정욱;배건성
    • Proceedings of the IEEK Conference
    • /
    • 2000.06d
    • /
    • pp.92-97
    • /
    • 2000
  • An AMR(Adaptive Multi-Rate) speech coding algorithm has been adopted as a standard speech codec for IMT-2000. It is based on the algebraic CELP, and consists of eight speech coding modes having the bit rate from 4.75 kbit/s to 12.2 kbit/s. It also contains the VAD(Voice Activity Detector), SCR (Source Controlled Rate) operation, and error concealment scheme for robustness in a radio channel. The bit rate of AMR is changed on a frame basis depending on the channel condition. In this paper, we introduced AMR speech coding algorithm and performed the real-time implementation using TMS320C6201, i.e., a Texas Instrument's fixed-point DSP. With the ANSI C source code released from ETSI and 3GPP, we convert and optimize the program to make it run in real time using the C compiler and assembly language. It is verified that the decoded result of the implemented speech codec on the DSP is identical with the PC simulation result using ANSI C code for test sequences. Also, actual sound input/output test using microphone and speaker demonstrates its proper real-time operation without distortions or delays.

  • PDF

A Study on the Interface Circuit Creation Algorithm using the Flow Chart (흐름도를 이용한 인터페이스 회로 생성 알고리즘에 관한 연구)

  • 우경환;이천희
    • Journal of the Korea Society for Simulation
    • /
    • v.10 no.1
    • /
    • pp.25-34
    • /
    • 2001
  • In this paper, we describe the generation method of interface logic which replace between IP & IP handshaking signal with asynchronous logic circuit. Especially, we suggest the new asynchronous sequential "Waveform to VHDL" code creation algorithm by flow chart conversion : Wave2VHDL - if only mixed asynchronous timing waveform is presented the level type input and pulse type input for handshaking, we convert waveform to flowchart and then replace with VHDL code according to converted flowchart. Also, we confirmed that asynchronous electronic circuits are created by applying extracted VHDL source code from suggest algorithm to conventional domestic/abroad CAD Tool, Finally, we assured the simulation result and the suggest timing diagram are identical.

  • PDF

Converting Panax ginseng DNA and chemical fingerprints into two-dimensional barcode

  • Cai, Yong;Li, Peng;Li, Xi-Wen;Zhao, Jing;Chen, Hai;Yang, Qing;Hu, Hao
    • Journal of Ginseng Research
    • /
    • v.41 no.3
    • /
    • pp.339-346
    • /
    • 2017
  • Background: In this study, we investigated how to convert the Panax ginseng DNA sequence code and chemical fingerprints into a two-dimensional code. In order to improve the compression efficiency, GATC2Bytes and digital merger compression algorithms are proposed. Methods: HPLC chemical fingerprint data of 10 groups of P. ginseng from Northeast China and the internal transcribed spacer 2 (ITS2) sequence code as the DNA sequence code were ready for conversion. In order to convert such data into a two-dimensional code, the following six steps were performed: First, the chemical fingerprint characteristic data sets were obtained through the inflection filtering algorithm. Second, precompression processing of such data sets is undertaken. Third, precompression processing was undertaken with the P. ginseng DNA (ITS2) sequence codes. Fourth, the precompressed chemical fingerprint data and the DNA (ITS2) sequence code were combined in accordance with the set data format. Such combined data can be compressed by Zlib, an open source data compression algorithm. Finally, the compressed data generated a two-dimensional code called a quick response code (QR code). Results: Through the abovementioned converting process, it can be found that the number of bytes needed for storing P. ginseng chemical fingerprints and its DNA (ITS2) sequence code can be greatly reduced. After GTCA2Bytes algorithm processing, the ITS2 compression rate reaches 75% and the chemical fingerprint compression rate exceeds 99.65% via filtration and digital merger compression algorithm processing. Therefore, the overall compression ratio even exceeds 99.36%. The capacity of the formed QR code is around 0.5k, which can easily and successfully be read and identified by any smartphone. Conclusion: P. ginseng chemical fingerprints and its DNA (ITS2) sequence code can form a QR code after data processing, and therefore the QR code can be a perfect carrier of the authenticity and quality of P. ginseng information. This study provides a theoretical basis for the development of a quality traceability system of traditional Chinese medicine based on a two-dimensional code.

Skeleton Code Generation for Transforming an XML Document with DTD using Metadata Interface (메타데이터 인터페이스를 이용한 DTD 기반 XML 문서 변환기의 골격 원시 코드 생성)

  • Choe Gui-Ja;Nam Young-Kwang
    • The KIPS Transactions:PartD
    • /
    • v.13D no.4 s.107
    • /
    • pp.549-556
    • /
    • 2006
  • In this paper, we propose a system for generating skeleton programs for directly transforming an XML document to another document, whose structure is defined in the target DTD with GUI environment. With the generated code, the users can easily update or insert their own codes into the program so that they can convert the document as the way that they want and can be connected with other classes or library files. Since most of the currently available code generation systems or methods for transforming XML documents use XSLT or XQuery, it is very difficult or impossible for users to manipulate the source code for further updates or refinements. As the generated code in this paper reveals the code along the XPaths of the target DTD, the result code is quite readable. The code generating procedure is simple; once the user maps the related elements represented as trees in the GUI interface, the source document is transformed into the target document and its corresponding Java source program is generated, where DTD is given or extracted from XML documents automatically by parsing it. The mapping is classified 1:1, 1:N, and N:1, according to the structure and semantics of elements of the DTD. The functions for changing the structure of elements designated by the user are amalgamated into the metadata interface. A real world example of transforming articles written in XML file into a bibliographical XML document is shown with the transformed result and its code.

A Study on the VHDL Code Generation Algorithm by the Asynchronous Sequential Waveform Flow Chart Conversion (비동기 순차회로 파형의 흐름도 변환에 의한 VHDL 코드 생성 알고리즘에 관한 연구)

  • 우경환;이용희;임태영;이천희
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2001.05a
    • /
    • pp.82-87
    • /
    • 2001
  • In this paper we described the generation method of interface logic which can be replace between IP and IP handshaking signal with asynchronous logic circuit. Especially, we suggest the new \"Waveform Conversion Algorithm : Wave2VHDL\", if only mixed asynchronous timing waveform suggested which level type input and pulse type input for handshaking, we can convert waveform to flowchart and then replaced with VHDL code according to converted flowchart. Also, we assure that asynchronous electronic circuits for IP interface are generated by applying extracted VHDL source code from suggested algorithm to conventional domestic/abroad CAD Tool, and then we proved that coincidence simulation result and suggested timing diagram.g diagram.

  • PDF

COEX-Seq: Convert a Variety of Measurements of Gene Expression in RNA-Seq

  • Kim, Sang Cheol;Yu, Donghyeon;Cho, Seong Beom
    • Genomics & Informatics
    • /
    • v.16 no.4
    • /
    • pp.36.1-36.3
    • /
    • 2018
  • Next generation sequencing (NGS), a high-throughput DNA sequencing technology, is widely used for molecular biological studies. In NGS, RNA-sequencing (RNA-Seq), which is a short-read massively parallel sequencing, is a major quantitative transcriptome tool for different transcriptome studies. To utilize the RNA-Seq data, various quantification and analysis methods have been developed to solve specific research goals, including identification of differentially expressed genes and detection of novel transcripts. Because of the accumulation of RNA-Seq data in the public databases, there is a demand for integrative analysis. However, the available RNA-Seq data are stored in different formats such as read count, transcripts per million, and fragments per kilobase million. This hinders the integrative analysis of the RNA-Seq data. To solve this problem, we have developed a web-based application using Shiny, COEX-seq (Convert a Variety of Measurements of Gene Expression in RNA-Seq) that easily converts data in a variety of measurement formats of gene expression used in most bioinformatic tools for RNA-Seq. It provides a workflow that includes loading data set, selecting measurement formats of gene expression, and identifying gene names. COEX-seq is freely available for academic purposes and can be run on Windows, Mac OS, and Linux operating systems. Source code, sample data sets, and supplementary documentation are available as well.

Consideration of Roman Character in KS × 1001 Code System for Information Interchange considered AMI/HDB-3 and HDLC FLAG (AMI/HDB-3 회선부호화 및 HDLC FLAG를 고려한 KS × 1001 정보 교환용 로마문자 부호체계고찰)

  • Hong, Wan-Pyo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.7
    • /
    • pp.1017-1023
    • /
    • 2013
  • Datacommunications transmit the source codes that are coded in information devices, such as computer to the transmission line by means of the line coded signal. AMI method is applied to the line coding method to transmit the signal for long distance. The disadvantage of the AMI method is to loss the bit synchronization when consecutive binary bit '0' over 4ea is coming into line coder. The scrambling technique is used to overcome the problem. The HDB-3 scrambling method is used in Korea standard which standard in ITU-T. When the HDB-3 technology is used. the method should convert the consecutive bit '0' over 4ea to certain bits format. As a result, when there are many such kind of '0' bit stream in source codes, data transmission efficiency will be decreased to treat in line coder, etc. This paper is directed to study the Roman character code system in $KS{\times}1001$, Korea standard for information exchange code in datacommunication systems. Based on the study result, this paper proposed the maximum optimized Roman character code system. In the study, Character coding rule for $4{\times}4$bits and the statistical data for roman character using frequency were considered to simulate. The paper shows the result that when the proposed new roman character coding system is applied to use, the data transmission efficiency could be increased to about 134% compared to existing code system.

Development of CAPSS2SMOKE Program for Standardized Input Data of SMOKE Model (배출 모델 표준입력자료 작성을 위한 CAPSS2SMOKE 프로그램 개발)

  • Lee, Yong-Mi;Lee, Dae-Gyun;Lee, Mi-Hyang;Hong, Sung-Chul;Yoo, Chul;Jang, Kee-Won;Hong, Ji-Hyung;Lee, Suk-Jo
    • Journal of Korean Society for Atmospheric Environment
    • /
    • v.29 no.6
    • /
    • pp.838-848
    • /
    • 2013
  • The Community Multiscale Air Quality (CMAQ) model is capable of providing high quality atmospheric chemistry profiles through the utilization of high-resolution meteorology and emissions data. However, it cannot simulate air quality accurately if input data are not appropriate and reliable. One of the most important inputs required by CMAQ is the air pollutants emissions, which determines air pollutants concentrations during the simulation. For the CMAQ simulation of Korean peninsula, we, in general, use the Korean National Emission Inventory data which are estimated by Clean Air Policy Support System (CAPSS). However, since they are not provided by model-ready emission data, we should convert CAPSS emissions into model-ready data. The SMOKE is the emission model we used in this study to generate CMAQ-ready emissions. Because processing the emissions data is very monotonous and tedious work, we have developed CAPSS2SMOKE program to convert CAPSS emissions into SMOKE-ready data with ease and effective. CAPSS2SMOKE program consists of many codes and routines such as source classification code, $PM_{10}$ to $PM_{2.5}$ ratio code, map projection conversion routine, spatial allocation routine, and so on. To verify the CAPSS2SMOKE program, we have run SMOKE using the CAPSS 2009 emissions and found that the SMOKE results inherits CAPSS emissions quite well.

On the Program Conversion and Conditional Simplification for VECTRAN Code (백트란 코드화를 위한 프로그램 변환과 단순화)

  • Hwang, Seon-Myeong;Kim, Haeng-Gon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.1 no.1
    • /
    • pp.38-49
    • /
    • 1994
  • One of the most common problems encountered in the automatic translation of FORTRAN source code to VECTRAN is the occurrence of conditional transfer of control within loops. Transfers of control create control dependencies, in which the execution of a statement is dependent on the value of a variable in another statement. In this paper I propose algorithms involve an attempt to convert statements in the loop into conditional assignment statements that can be easily analyzed for data dependency, and this paper presents a simplification method for conditional assignment statement. Especially, I propose not only a method for simplifying boolean functions but extended method for n-state functions.

  • PDF