• Title/Summary/Keyword: Re-Coding

Search Result 91, Processing Time 0.025 seconds

Surveillance Evaluation of the National Cancer Registry in Sabah, Malaysia

  • Jeffree, Saffree Mohammad;Mihat, Omar;Lukman, Khamisah Awang;Ibrahim, Mohd Yusof;Kamaludin, Fadzilah;Hassan, Mohd Rohaizat;Kaur, Nirmal;Myint, Than
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.17 no.7
    • /
    • pp.3123-3129
    • /
    • 2016
  • Background: Cancer is the fourth leading cause of death in Sabah Malaysia with a reported age-standardized incidence rate was 104.9 per 100,000 in 2007. The incidence rate depends on non-mandatory notification in the registry. Under-reporting will provide the false picture of cancer control program effectiveness. The present study was to evaluate the performance of the cancer registry system in terms of representativeness, data quality, simplicity, acceptability and timeliness and provision of recommendations for improvement. Materials and Methods: The evaluation was conducted among key informants in the National Cancer Registry (NCR) and reporting facilities from Feb-May 2012 and was based on US CDC guidelines. Representativeness was assessed by matching cancer case in the Health Information System (HIS) and state pathology records with those in NCR. Data quality was measured through case finding and re-abstracting of medical records by independent auditors. The re-abstracting portion comprised 15 data items. Self-administered questionnaires were used to assess simplicity and acceptability. Timeliness was measured from date of diagnosis to date of notification received and data dissemination. Results: Of 4613 cancer cases reported in HIS, 83.3% were matched with cancer registry. In the state pathology centre, 99.8% was notified to registry. Duplication of notification was 3%. Data completeness calculated for 104 samples was 63.4%. Registrars perceived simplicity in coding diagnosis as moderate. Notification process was moderately acceptable. Median duration of interval 1 was 5.7 months. Conclusions: The performances of registry's attributes are fairly positive in terms of simplicity, case reporting sensitivity, and predictive value positive. It is moderately acceptable, data completeness and inflexible. The usefulness of registry is the area of concern to achieve registry objectives. Timeliness of reporting is within international standard, whereas timeliness to data dissemination was longer up to 4 years. Integration between existing HIS and national registration department will improve data quality.

The Effect of College Festival Participants' Experience on Festival Satisfaction, Re-participation and Peer Relation Enhancement: Focusing on College Life Participation (대학축제체험이 축제만족, 재참가의도, 교우관계에 미치는 영향: 대학생활 참여정도를 중심으로)

  • Yang, Soung-Hoon
    • The Journal of the Korea Contents Association
    • /
    • v.19 no.7
    • /
    • pp.246-257
    • /
    • 2019
  • This research aimed to verify possibly expanding college festival's performance to ordinary life. College festivals have consolidated student communities and created college culture. Recently, the festivals have been challenged for commercialization such as celebrity concert and company sponsorship. College festival is a text, which is based on ordinary college life and should served a role to restore college life. Pine & Gilmore's experience model was used to find that quality festival experience leads to satisfaction and satisfaction enhance peer relations. More participate school life, the better experience the festival program. Total 195 of questionnaires were administered to college festival participants and coding data were analyzed by regression and t test. Result found that College festival experience significantly affects festival satisfaction(H1), festival satisfaction affect re-participation(H2) and peer relations(H3). High level of school life participation group showed significant differences in festival experience and other variables in compare with low level group(H4). Theoretical /practical significances and research limitation were included.

MicroRNA-214 Regulates the Acquired Resistance to Gefitinib via the PTEN/AKT Pathway in EGFR-mutant Cell Lines

  • Wang, Yong-Sheng;Wang, Yin-Hua;Xia, Hong-Ping;Zhou, Song-Wen;Schmid-Bindert, Gerald;Zhou, Cai-Cun
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.13 no.1
    • /
    • pp.255-260
    • /
    • 2012
  • Patients with non-small cell lung cancer (NSCLC) who have activating epidermal growth factor receptor (EGFR) mutations derive clinical benefit from treatment with EGFR-tyrosine kinase inhibitors ((EGFR-TKIs)-namely gefitinib and erlotinib. However, these patients eventually develop resistance to EGFR-TKIs. Despite the fact that this acquired resistance may be the result of a secondary mutation in the EGFR gene, such as T790M or amplification of the MET proto-oncogene, there are other mechanisms which need to be explored. MicroRNAs (miRs) are a class of small non-coding RNAs that play pivotal roles in tumorigenesis, tumor progression and chemo-resistance. In this study, we firstly successfully established a gefitinib resistant cell line-HCC827/GR, by exposing normal HCC827 cells (an NSCLC cell line with a 746E-750A in-frame deletion of EGFR gene) to increasing concentrations of gefitinib. Then, we found that miR-214 was significantly up-regulated in HCC827/GR. We also showed that miR-214 and PTEN were inversely expressed in HCC827/GR. Knockdown of miR-214 altered the expression of PTEN and p-AKT and re-sensitized HCC827/GR to gefitinib. Taken together, miR-214 may regulate the acquired resistance to gefitinib in HCC827 via PTEN/AKT signaling pathway. Suppression of miR-214 may thus reverse the acquired resistance to EGFR-TKIs therapy.

A Study on Literary Therapeutic Codes of Sijo Fused by Transference (전이에 의해 융합되는 시조의 문학치료 코드 연구)

  • Park, In-Kwa
    • Journal of the Korea Convergence Society
    • /
    • v.8 no.10
    • /
    • pp.167-172
    • /
    • 2017
  • The purpose of this study is to analyze the emotional codes of Sijo, which has been acknowledged to have excellent therapeutic function, to activate the contents of the therapy of humanities. Sijo as a function of healing forms emotional codes of therapy, which is the total of emotions, through the fusion of emotions formed during the process of appreciation of various works. This process enables the literary therapeutic activities to proceed physiologically in the human body. Just as machine learning is self-learning by cognitive functions, the coding process for encoding and re-encoding at all times operates on collections of numerous neurons in the human system. In such a process, it is predicted that amino acids are synthesized in the human body by collective encoding of emotion codes. These amino acids regulate the signaling system of the human body. In the future, if the study on the healing process as such at the contact point of humanities and human physiology proceeds, it is expected that a program of higher quality humanistic therapy will be activated.

Detect of Hypericin (HyH) gene in Hypericum erectum in Korea and Comparison of H. perforatum in Europe (한국내 고추나물의 하이퍼리신 유전자(HyH)의 탐색과 유럽의 서양고추나물과 비교)

  • Huh, Man-Kyu
    • Journal of Life Science
    • /
    • v.17 no.8 s.88
    • /
    • pp.1034-1038
    • /
    • 2007
  • Hypericin (HyH) is a substance which is isolated a medicinal herb, Hypericum perforatum L., commonly known as St. John's Wort. Hypericum erectum is a long-lived herb that is distributed in Korea. Cloned HyH genes H. erectum of were conformed by sequencing. The cDNA Hyp-1 sequence has 732 bp with an open reading frame of 567. Thus coding for a protein of 152 amino acid residues. A BLAST re-search using the deduced nucleotide sequences in HyH gene produced significant alignments with the H. perforatum. Sequences in HyH gene showed significant homology with Rubus idaeus putative allergen Rub-i-1 mRNA, Protein sequence comparisons revealed significant homology between Hyp-1 and the phenolic oxidative coupling protein hyp-1 of H. perforatum (98%). Additionally, Hyp-1 showed sig-nificant homology with various other classes of allergens, including Pru-av-1 (62%) from Prunus avium and allergen Bet-vl-Sc3 from Betula pendula (60%). Thus, the result of this study may offer an important information to establish an assay system for chemicals of the herbal medicines for H. erectum as well as H. perforatum.

Genetic Transformation of Chlamydomonas reinhardtii with the RNAi Suppressor p19 Gene of Tombus Virus (Tombus 바이러스의 RNAi Suppressor p19 유전자에 의한 Chlamydomonas reinhardtii의 형질전환)

  • Jeong, Won-Joong;Liu, Jang-Ryol;Cerutti, Heriberto
    • Journal of Plant Biotechnology
    • /
    • v.34 no.4
    • /
    • pp.307-312
    • /
    • 2007
  • Chlamydomonas reinhardtii was transformed with the coding sequence of the Tombus virus gene p19 to determine whether the gene functions as an RNAi suppressor in C. reinhardtii. Transformants were confirmed to have 1 to several copies of p19 gene in their chromosomes. When an RNAi strain of C. reinhardtii generated by transforming the inverted repeat (IR) sequence homologous to the 3'UTR region of the MAA7 gene was re-transformed with the gene p19, MAA7 transcript levels of transformants fluctuated and proliferation of trans-formants on the medium containing 5-FI was suppressed. Overall results suggest that p19-mediated silencing suppression works at a low level in C. reinhardtii because of difference in codon usage resulting in weak P19 expression unless p19-mediated silencing suppression in C. reinhardtii works in a different manner from higher plants.

Direction-Oriented Fast Full Search Algorithm at the Divided Search Range (세분화된 탐색 범위에서의 방향 지향적 전영역 고속 탐색 알고리즘)

  • Lim, Dong-Young;Park, Sang-Jun;Jeong, Je-Chang
    • Journal of Broadcast Engineering
    • /
    • v.12 no.3
    • /
    • pp.278-288
    • /
    • 2007
  • We propose the fast full search algorithm that reduces the computational load of the block matching algorithm which is used for a motion estimation in the video coding. Since the conventional spiral search method starts searching at the center of the search window and then moves search point to estimate the motion vector pixel by pixel, it is good for the slow motion picture. However we proposed the efficient motion estimation method which is good for the fast and slow motion picture. Firstly, when finding the initial threshold value, we use the expanded predictor that can approximately calculate minimum threshold value. The proposed algorithm estimates the motion in the new search order after partitioning the search window and adapt the directional search order in the re-divided search window. At the result, we can check that the proposed algorithm reduces the computational load 94% in average compared to the conventional spiral full search algorithm without any loss of image quality.

Cooperative Diversity Performance Using Duo-Binary Turbo Codes (Duo-Binary 터보 부호를 이용한 협동 다이버시티 성능 분석)

  • Yeo, Sung-Moon;Kim, Soo-Young
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.2
    • /
    • pp.38-45
    • /
    • 2009
  • In this paper, we propose an efficient cooperative diversity technique, which partition the codewords of each mobile and transmit portions of each codeword through independent fading channels using duo-binary turbo codes. A coded diversity technique can achieve high cooperative diversity gain by decoding and transmitting of the re-encoded signal, while this can also cause high performance degradation due to failure of the decoding. In this paper, we introduce various coded diversity technique using duo-binary turbo codes which are defined as channel coding schemes in the IEEE WiMax specification, and also demonstrate performance simulation results with the analysis. We also propose a cooperative diversity technique using rate-compatible duo-binary turbo codes, where user terminals with different parity symbols cooperate each other. Simulation results investigated in this paper reveal that the proposed scheme show high diversity gain at a reasonal SNR range.

A Fast Coeff_token Decoding Method for Efficient Implimentation of H.264/AVC CAVLC Decoder (효율적인 H.264/AVC CAVLC 복호화기 구현을 위한 고속 Coeff_token 복원 방식)

  • Moon, Yong-Ho;Park, Tae-Hee
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.5
    • /
    • pp.35-42
    • /
    • 2008
  • In this paper, we propose a fast coeff_token decoding method based on the re-constructed VLCT. Since the conventional decoding method is still based on large memory accesses, it is not suitable for the multimedia services such as PMP, PMB, DVH-H where fast decoding and low power consumption are required. Based on the analysis for the codeword structure, new structure of the codeword and the corresponding memory architecture are developed in this paper. The simulation results show that the proposed algorithm achieves memory access saving from 10% to 57%, compared to the conventional decoding method. This meant that the issues of tow power consumption and high speed decoding can be resolved without video-quality and coding efficiency degradation.

An Adaptive Rank-Based Reindexing Scheme for Lossless Indexed Image Compression (인덱스 이미지에서의 무손실 압축을 위한 적응적 순위 기반 재인덱싱 기법)

  • You Kang-Soo;Lee Bong-Ju;Jang Euee S.;Kwak Hoon-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.7C
    • /
    • pp.658-665
    • /
    • 2005
  • Re-assignment scheme of index in index image is called reindexing. It has been well known that index image can be reindexed without losslessness. In this paper, we introduces an adaptive rank based reindexing scheme using co-occurrence frequency between neighboring pixels. Original index image can be converted into rank image by the proposed scheme. Using the proposed scheme, a better compression efficiency can be expected because most of the reindexed values(rank) get distributed with a smaller variance than the original index image. Experinental results show that the proposed scheme achieves a much better compression performance over GIF, arithmetic coding, Zeng's algorithm and RIAC scheme.