• Title/Summary/Keyword: duplicated contents

Search Result 73, Processing Time 0.025 seconds

The Study on Aesthetic Characteristics in designer Lee, Young-Hee Works (디자이너 이영희 작품에 나타난 미적특성 연구)

  • 김영란
    • Journal of the Korea Fashion and Costume Design Association
    • /
    • v.6 no.2
    • /
    • pp.1-13
    • /
    • 2004
  • The purpose of this study is followings. First, We analyze the times from initial works to present ones. Second, Detail element of Modificational process of Hanbok design with a expession element of clothes. Third, We intend to liquidate characteristics of External beauty and internal values for Lee Young Hee' s works, besides we expect that Hanbok is harmonized with modern times, is globalized, and is universalized. It is research method and region that we observe characteristics of korean beauty with theoretical background and we examinate formalism and contents of korean style of dresses through analysis of data. So, we insinuate a standard for analysis of beauty. Analysis data is her possession and slide from 1980 to ‘2000 A/W’ and ninety collection magazine data. We analyze beautiful characteristics along the expression elements of dresses and every year. So, We can find beautiful characteristics of works for expression elements of dresses, every year, and physical beauty and internal value of dresses. As a result, initial works have succession and development of tradition. But through second & third period, inclined physical beauty have duplicated aspects with closing and opening characteristics. So, She has expressed internal beauty.

  • PDF

Automatic Document Summary Technique Using Fuzzy Theory (퍼지이론을 이용한 자동문서 요약 기술)

  • Lee, Sanghoon;Moon, Seung-Jin
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.3 no.12
    • /
    • pp.531-536
    • /
    • 2014
  • With the very large quantity of information available on the Internet, techniques for dealing with the abundance of documents have become increasingly necessary but the problem of processing information in the documents is still technically challenging and remains under study. Automatic document summary techniques have been considered as one of critical solutions for processing documents to retain the important points and to remove duplicated contents of the original documents. In this paper, we propose a document summarization technique that uses a fuzzy theory. Proposed summary technique solves the ambiguous problem of various features determining the importance of the sentence and the experiment result shows that the technique generates better results than other previous techniques.

Development of integrated basic dental hygiene curriculum (기초치위생 교과목 통합교육과정 개발)

  • Lee, Sun-Mi;Ahn, Se-Youn;Won, Young-Soon;Kim, Chang-Hee
    • Journal of Korean society of Dental Hygiene
    • /
    • v.16 no.2
    • /
    • pp.165-172
    • /
    • 2016
  • The purpose of the study is to develop the integrated basic dental hygiene curriculum after reviewing and analyzing the traditional curriculum. First, the standardization of curriculum in three years and four years dental hygiene department curriculum is needed. Second, integration between subjects should include learning objectives of the curriculum. Third, the basic subjects of dental hygiene should provide and satisfy the learning goals of dental biochemistry, nutrition, dentistry and dental pharmacology, and the basic subjects should be integrated into clinical considerations. Fourth, the integration of the curriculum should make the students dental hygiene experts by nurturing and integration of basic sciences. The integration of curriculum is able to provide the unified subject that does not same and duplicated contents.

An Energy-Efficient Multiple Path Data Routing Scheme Using Virtual Label in Sensor Network (센서 네트워크 환경에서 가상 식별자를 이용한 에너지 효율적인 다중 경로 데이터 라우팅 기법)

  • Park, Jun-Ho;Yeo, Myung-Ho;Seong, Dong-Ook;Kwon, Hyun-Ho;Lee, Hyun-Jung;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.7
    • /
    • pp.70-79
    • /
    • 2011
  • The multi-path routing schemes that assigns labels to sensor nodes for the reliability of data transmission and the accuracy of an aggregation query over the sensor networks where data transfer is prone to defect have been proposed. However, the existing schemes have high costs for reassigning labels to nodes when the network topology is changed. In this paper, we propose a novel routing method that avoids duplicated data and reduces the update cost of a sensor node. In order to show the superiority of the proposed scheme, we compare it with the existing scheme through the various experiments. Our experimental results show that our proposed method reduces about 95% the amount of the transmitted data for restoration to node failure and about 220% the amount of the transmitted data for query processing over the existing method on average.

Efficient Complex Event Processing Scheme Considering Similar and Duplication Operations (유사 연산과 중복 연산을 고려한 효율적인 복합 이벤트 처리 기법)

  • Kim, Daeyun;Ko, Geonsik;Kim, Byounghoon;Noh, Yeonwoo;Lim, Jongtae;Bok, Kyoungsoo;Yoo, Jaesoo
    • The Journal of the Korea Contents Association
    • /
    • v.17 no.3
    • /
    • pp.370-381
    • /
    • 2017
  • Recently, a complex event processing system has been introduced to quickly and efficiently process real-time events in various applications. Since the existing complex event processing schemes do not consider the similarity and duplication of operators, they perform a lot of computations and consume memory. To solve such problems, this paper proposes an efficient complex event processing scheme considering similar operators and duplication operations. When the same primitive events have similar operations, the proposed scheme combines them into one virtual operator. For duplicated operations, the proposed scheme processes only one of them first, and then processes the others using the results of the already processed operation when the same operation is subsequently performed. It is shown through performance comparison that the proposed scheme outperforms the existing scheme in terms of the whole operation throughput.

Codebook-Based Foreground Extraction Algorithm with Continuous Learning of Background (연속적인 배경 모델 학습을 이용한 코드북 기반의 전경 추출 알고리즘)

  • Jung, Jae-Young
    • Journal of Digital Contents Society
    • /
    • v.15 no.4
    • /
    • pp.449-455
    • /
    • 2014
  • Detection of moving objects is a fundamental task in most of the computer vision applications, such as video surveillance, activity recognition and human motion analysis. This is a difficult task due to many challenges in realistic scenarios which include irregular motion in background, illumination changes, objects cast shadows, changes in scene geometry and noise, etc. In this paper, we propose an foreground extraction algorithm based on codebook, a database of information about background pixel obtained from input image sequence. Initially, we suppose a first frame as a background image and calculate difference between next input image and it to detect moving objects. The resulting difference image may contain noises as well as pure moving objects. Second, we investigate a codebook with color and brightness of a foreground pixel in the difference image. If it is matched, it is decided as a fault detected pixel and deleted from foreground. Finally, a background image is updated to process next input frame iteratively. Some pixels are estimated by input image if they are detected as background pixels. The others are duplicated from the previous background image. We apply out algorithm to PETS2009 data and compare the results with those of GMM and standard codebook algorithms.

Complete Chloroplast DNA Sequence from a Korean Endemic Genus, Megaleranthis saniculifolia, and Its Evolutionary Implications

  • Kim, Young-Kyu;Park, Chong-wook;Kim, Ki-Joong
    • Molecules and Cells
    • /
    • v.27 no.3
    • /
    • pp.365-381
    • /
    • 2009
  • The chloroplast DNA sequences of Megaleranthis saniculifolia, an endemic and monotypic endangered plant species, were completed in this study (GenBank FJ597983). The genome is 159,924 bp in length. It harbors a pair of IR regions consisting of 26,608 bp each. The lengths of the LSC and SSC regions are 88,326 bp and 18,382 bp, respectively. The structural organizations, gene and intron contents, gene orders, AT contents, codon usages, and transcription units of the Megaleranthis chloroplast genome are similar to those of typical land plant cp DNAs. However, the detailed features of Megaleranthis chloroplast genomes are substantially different from that of Ranunculus, which belongs to the same family, the Ranunculaceae. First, the Megaleranthis cp DNA was 4,797 bp longer than that of Ranunculus due to an expanded IR region into the SSC region and duplicated sequence elements in several spacer regions of the Megaleranthis cp genome. Second, the chloroplast genomes of Megaleranthis and Ranunculus evidence 5.6% sequence divergence in the coding regions, 8.9% sequence divergence in the intron regions, and 18.7% sequence divergence in the intergenic spacer regions, respectively. In both the coding and noncoding regions, average nucleotide substitution rates differed markedly, depending on the genome position. Our data strongly implicate the positional effects of the evolutionary modes of chloroplast genes. The genes evidencing higher levels of base substitutions also have higher incidences of indel mutations and low Ka/Ks ratios. A total of 54 simple sequence repeat loci were identified from the Megaleranthis cp genome. The existence of rich cp SSR loci in the Megaleranthis cp genome provides a rare opportunity to study the population genetic structures of this endangered species. Our phylogenetic trees based on the two independent markers, the nuclear ITS and chloroplast MatK sequences, strongly support the inclusion of the Megaleranthis to the Trollius. Therefore, our molecular trees support Ohwi's original treatment of Megaleranthis saniculifolia to Trollius chosenensis Ohwi.

Advertisement Dissemination Scheme Using User Preferences in Mobile P2P Environments (모바일 P2P 환경에서 사용자 선호도를 이용한 광고 전송 기법)

  • Jeong, Jiwon;Lee, Suji;Yun, Jinkyoung;Lim, Jongtae;Shin, Jaeryong;Bok, Kyoungsoo;Yoo, Jaesoo
    • The Journal of the Korea Contents Association
    • /
    • v.15 no.12
    • /
    • pp.35-49
    • /
    • 2015
  • Recently, with the development of wireless communication technologies and mobile equipments, various studies on mobile P2P networks have been conducted. In this paper, we propose an advertisement dissemination method considering peer's mobilities and preferences in mobile P2P networks. The proposed scheme generates a peer's preference through the analysis of users' activities to disseminate advertisements with user preferences. To reduce duplicated advertising messages and improve reception ratio, the priority of advertisement re-dissemination is determined according to peer's preferences, mobilities, and advertisement reception ratio. We improve the participation rate of the advertisement dissemination of mobile peers using the incentive mechanism in mobile P2P networks. To show the superiority of the proposed scheme, we compare it with the existing scheme in terms of the number of messages and accuracy.

Weighted Disassemble-based Correction Method to Improve Recognition Rates of Korean Text in Signboard Images (간판영상에서 한글 인식 성능향상을 위한 가중치 기반 음소 단위 분할 교정)

  • Lee, Myung-Hun;Yang, Hyung-Jeong;Kim, Soo-Hyung;Lee, Guee-Sang;Kim, Sun-Hee
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.2
    • /
    • pp.105-115
    • /
    • 2012
  • In this paper, we propose a correction method using phoneme unit segmentation to solve misrecognition of Korean Texts in signboard images using weighted Disassemble Levenshtein Distance. The proposed method calculates distances of recognized texts which are segmented into phoneme units and detects the best matched texts from signboard text database. For verifying the efficiency of the proposed method, a database dictionary is built using 1.3 million words of nationwide signboard through removing duplicated words. We compared the proposed method to Levenshtein Distance and Disassemble Levenshtein Distance which are common representative text string comparison algorithms. As a result, the proposed method based on weighted Disassemble Levenshtein Distance represents an improvement in recognition rates 29.85% and 6% on average compared to that of conventional methods, respectively.

Watermarking of Gray Logo & Color Image based on Human Visual System (인간시각 시스템 기반의 그레이로고 & 컬러 이미지의 워터마킹)

  • NOH Jin Soo;SHIN Kwang Gyu;RHEE Kang Hyeon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.3 s.303
    • /
    • pp.73-82
    • /
    • 2005
  • Recently, The wide range of the Internet applications and the related technology developments enabled the ease use of the digital multimedia contents (fixed images, movies, digital audios). However, due to the replay ability which the contents may be easily duplicated and not only the duplicates are capable of providing the same original quality. There are mainly the encipher techniques and the watermarking techniques which are studied and used as solutions for the above problem in order to protect the license holders' rights. To the protection of the IP(Intellectual Property) rights of the owner, digital watermarking is the technique that authenticates the legal copyrighter. This paper proposed the watermarking algorithms to watermark the 256 gray logo image and the color image by applying the wavelet transformation to the color stand-still images. The proposed algorithms conducted the watermark insertion at the LH frequency region among the wavelet transformation regions (LL, LH, HL, HH). The interleaving algorithms which applied in data communication was applied to the watermark. the amount of watermark increased which consequently caused the PSNR to decrease but this might provide the perseverance against the external attacks such as extraction, filtering, and crop.