• Title/Summary/Keyword: 디지털 정보환경

Search Result 2,711, Processing Time 0.034 seconds

Study on Navigation Data Preprocessing Technology for Efficient Route Clustering (효율적인 항로 군집화를 위한 항해 데이터 전처리 기술에 관한 연구)

  • Dae-Han Lee
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.30 no.5
    • /
    • pp.415-425
    • /
    • 2024
  • The global maritime industry is developing rapidly owing to the emergence of autonomous ship technology, and interest in utilizing artificial intelligence derived from marine data is increasing. Among the diverse technological developments, ship-route clustering is emerging as an important technology for the commercialization of autonomous ships. Through route clustering, ship-route patterns are extracted from the sea to obtain the fastest and safest route and serve as a basis for the development of a collision-prevention system. High-quality, well-processed data are essential in ensuring the accuracy and efficiency of route-clustering algorithms. In this study, among the various route-clustering methods, we focus on the ship-route-similarity-based clustering method, which can accurately reflect the actual shape and characteristics of a route. To maximize the efficiency of this method, we attempt to formulate an optimal combination of data-preprocessing technologies. Specifically, we combine four methods of measuring similarity between ship routes and three dimensionality-reducing methods. We perform k-means cluster analysis for each combination and then quantitatively evaluate the results using the silhouette index to obtain the best-performing preprocessing combination. This study extends beyond merely identifying the optimal preprocessing technique and emphasizes the importance of extracting meaningful information from a wide range of ocean data. Additionally, this study can be used as a reference for effectively responding to the digital transformation of the maritime and shipping industry in the Fourth Industrial Revolution era.

MNFS: Design of Mobile Multimedia File System based on NAND FLASH Memory (MNFS : NAND 플래시메모리를 기반으로 하는 모바일 멀티미디어 파일시스템의 설계)

  • Kim, Hyo-Jin;Won, You-Jip;Kim, Yo-Hwan
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.11
    • /
    • pp.497-508
    • /
    • 2008
  • Mobile Multimedia File System, MNFS, is a file system which extensively exploits NAND FLASH Memory, Since general Flash file systems does not precisely meet the criteria of mobile devices such as MP3 Player, PMP, Digital Camcorder, MNFS is designed to guarantee the optimal performance of FLASH Memory file system. Among many features MNFS provides, there are three distinguishable characteristics. MNFS guarantees, first, constant response time in sequential write requests of the file system, second, fast file system mounting time, and lastly least memory footprint. MNFS implements four schemes to provide such features, Hybrid mapping scheme to map file system metadata and user data, manipulation of user data allocation to fit allocation unit of file data into allocation unit of NAND FLASH Memory, iBAT (in core only Block Allocation Table) to minimize the metadata, and bottom-up representation of directory. Prototype implementation of MNFS was tested and measured its performance on ARM9 processor and 1Gbit NAND FLASH Memory environment. Its performance was compared with YAFFS, NAND FLASH File system, and FAT file system which use FTL. This enables to observe constant request time for sequential write request. It shows 30 times faster mounting time to YAFFS, and reduces 95% of HEAP memory consumption compared to YAFFS.

Thin Capitalization - The Arm's Length Approach through Blockchain

  • Lee, Jeong-Mi
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.10
    • /
    • pp.185-191
    • /
    • 2020
  • This article proposes the unified an arm's length price of transfer pricing for thin capitalization since the scope of permanent establishment has been enlarged under Digital Economy and the implementation of Blackchain system to resolve the drawback of finding an arm's length price. The rule of current thin capitalization runs against the non-discrimination of taxation of the tax treaties and the national treatment which deals fairly with goods, sercice and capital money within the country under the treaty of commerce and navigator. In addition, the information of comparable uncontrolled debt are not available of current system to prove the debt which is not subject to the rule of thin capitalization. The united an arm's length price of transfer pricing for thin capitalization can apply to foreign investment as well as domestic corporations, thereby resolving the problem of the non-discrimination of taxation of the tax treaties and the treaty of commerce and navigation. The availability of transaction level data through Blockchain platform to decide whether the debt can be subject to thin capitalization can resolve the issue of comparable uncontrolled debt transaction which can't be found in current business transactions. This article should shed light on the proposing of the unified an arm's length price of transfer pricing for thin capitalization and Blockchain system to prevent the income shifting. This propose provide implication for policymakers on current system of thin capitalization and arm's length principles.

The Solution of Content Creation for User Side Using Animation Management System (애니메이션 공정관리시스템을 활용한 사용자 중심 콘텐츠 생성 방안)

  • Lim, Yang-Mi;Kim, Sung-Rea;Kim, Ho-Sung
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2006.11a
    • /
    • pp.163-167
    • /
    • 2006
  • The previous media has the function that was information of the contents was delivered by only content providers, but the current media makes the interactive function between content providers and general receivers. For this reason, the role of receivers are also expanded in the realm of multimedia and receivers have the roles of the sending and getting information for content user, not more receiver. The constituent members relative to content are content providers, users and user-created content. This paper introduces "the wonderland" the animation process management system for high-level user group. Also, most of images which are made of the animation process are publicly accessible, providing the public or the average user group for making resources easily by using "the wonderland." Although, the general user can get an environment to reedit their own new movie with making the most of provided movie sources are scene and cut units, according to one's taste and one's idea. The materialization of process management system can expand dramatically enough contents, and save the time to edit digital animation or movie, control numerous sources, made an animation processing, and the result output. Such "the wonderland" will significantly help to create future content.

  • PDF

GIS-based Water Pollution Analysis (GIS기반의 오폐수 분석에 관한 연구)

  • Lee, Chol-Young;Kim, Kye-Hyun;Park, Tae-Og
    • 한국공간정보시스템학회:학술대회논문집
    • /
    • 2007.06a
    • /
    • pp.111-116
    • /
    • 2007
  • 현재 한강수계를 제외한 3대강 수계에서 수질오염총량관리제도가 의무제로써 시행되고 있다. 그러나 과학적 타당성과 외국의 성공사례들로 하여금 한강수계에 대해서도 수질오염총량제도를 의무제화 하려는 시도가 추진되고 있고 있는 실정이다. 이 제도가 한강수계에도 도입된다면, 한강권역에 포함되는 모든 지자체는 해당 유역에서 하천으로 유입되는 배출부하량을 할당받은 할당부하량 이하로 관리하여야만 정해진 유역의 목표수질을 달성할 수 있으며, 배출부하량 관리를 계획한데로 이행하지 못한 지자체는 범칙금 내지는 행정제재를 받게 된다. 따라서 체계적이고 과학적인 모니터링 및 분석 수단이 필요하다. 이 연구는 환경부 고시 한강기술지침에 의거하여 GIS를 이용하여 인천일대의 오폐수 발생부하량 및 배출부하량을 제시하고 과학적인 오염물질 삭감방안을 모색하는 것을 목적으로 진행되었다. 생활계, 산업계, 축산계, 양식계의 4 가지로 분류된 점오염원과 토지 이용 분류에 따른 비점오염원에 대한 각각의 발생부하량을 GIS를 통해 산정하고, 모든 오염원별로 처리경로를 고려하고 처리시설별, 방법별 삭감 효율을 반영하여 배출부하량을 산정하여 GIS상에서 제시하고 분석하였다. 인천일대는 인근지역에 비해 인구밀도가 높고 산업단지가 발달하여 생활계와 산업계 오염원에 의한 발생부하량 및 배출부하량이 많았으며, 특정 오염물에 대해서는 삭감 계획이 필요함을 확인할 수 있었다. 따라서 수질오염총량관리제도에 대비하고 실제 수질 개선을 위하여 본 연구의 결과를 바탕으로 수질관리를 위한 시스템의 보완 및 삭감계획의 수립에 관한 연구가 필요하다.알 수 있었다. 이상의 결과를 토대로 기존 압출추출방법과 초임계 추출 방법을 비교한 결과 $\gamma$-토코페롤의 농도가 1.3${\~}$1.6배 증가함을 확인할 수 있었다.게 상관성이 있어 앞으로 심도 있는 연구가 더욱 필요하다.qrt{F}}}{\pm}e_0$)에서 단정도실수 및 배정도실수의 역수 제곱근 계산에 필요한 평균 곱셈 횟수를 계산한다 이들 평균 곱셈 횟수를 종래 알고리즘과 비교하여 본 논문에서 제안한 알고리즘의 우수성을 증명한다. 본 논문에서 제안한 알고리즘은 오차가 일정한 값보다 작아질 때까지만 반복하므로 역수 제곱근 계산기의 성능을 높일 수 있다. 또한 최적의 근사 역수 제곱근 테이블을 구성할 수 있다. 본 논문의 연구 결과는 디지털 신호처리, 컴퓨터 그라픽스, 멀티미디어, 과학 기술 연산 등 부동소수점 계산기가 사용되는 분야에서 폭 넓게 사용될 수 있다.>16$\%$>0$\%$ 순으로 좋게 평가되었다. 결론적으로 감농축액의 첨가는 당과 탄닌성분을 함유함으로써 인절미의 노화를 지연시키고 저장성을 높이는데 효과가 있는 것으로 생각된다. 또한 인절미를 제조할 때 찹쌀가루에 8$\%$의 감농축액을 첨가하는 것이 감인절미의 색, 향, 단맛, 씹힘성이 적당하고 쓴맛과 떫은맛은 약하게 느끼면서 촉촉한 정도와 부드러운 정도는 강하게 느낄수 있어서 전반적인 기호도에서 가장 적절한 방법으로 사료된다.비위생 점수가 유의적으로 높은 점수를 나타내었다. 조리종사자의 위생지식 점수와 위생관리

  • PDF

Color Image Segmentation and Textile Texture Mapping of 2D Virtual Wearing System (2D 가상 착의 시스템의 컬러 영상 분할 및 직물 텍스쳐 매핑)

  • Lee, Eun-Hwan;Kwak, No-Yoon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.5
    • /
    • pp.213-222
    • /
    • 2008
  • This paper is related to color image segmentation and textile texture mapping for the 2D virtual wearing system. The proposed system is characterized as virtually wearing a new textile pattern selected by user to the clothing shape section, based on its intensity difference map, segmented from a 2D clothes model image using color image segmentation technique. Regardless of color or intensity of model clothes, the proposed system is possible to virtually change the textile pattern or color with holding the illumination and shading properties of the selected clothing shape section, and also to quickly and easily simulate, compare, and select multiple textile pattern combinations for individual styles or entire outfits. The proposed system can provide higher practicality and easy-to-use interface, as it makes real-time processing possible in various digital environment, and creates comparatively natural and realistic virtual wearing styles, and also makes semi-automatic processing possible to reduce the manual works to a minimum. According to the proposed system, it can motivate the creative activity of the designers with simulation results on the effect of textile pattern design on the appearance of clothes without manufacturing physical clothes and, as it can help the purchasers for decision-making with them, promote B2B or B2C e-commerce.

T-Commerce Sale Prediction Using Deep Learning and Statistical Model (딥러닝과 통계 모델을 이용한 T-커머스 매출 예측)

  • Kim, Injung;Na, Kihyun;Yang, Sohee;Jang, Jaemin;Kim, Yunjong;Shin, Wonyoung;Kim, Deokjung
    • Journal of KIISE
    • /
    • v.44 no.8
    • /
    • pp.803-812
    • /
    • 2017
  • T-commerce is technology-fusion service on which the user can purchase using data broadcasting technology based on bi-directional digital TVs. To achieve the best revenue under a limited environment in regard to the channel number and the variety of sales goods, organizing broadcast programs to maximize the expected sales considering the selling power of each product at each time slot. For this, this paper proposes a method to predict the sales of goods when it is assigned to each time slot. The proposed method predicts the sales of product at a time slot given the week-in-year and weather of the target day. Additionally, it combines a statistical predict model applying SVD (Singular Value Decomposition) to mitigate the sparsity problem caused by the bias in sales record. In experiments on the sales data of W-shopping, a T-commerce company, the proposed method showed NMAE (Normalized Mean Absolute Error) of 0.12 between the prediction and the actual sales, which confirms the effectiveness of the proposed method. The proposed method is practically applied to the T-commerce system of W-shopping and used for broadcasting organization.

Survey and Analysis of the Audio Description Acceptance for Improving the Media Accessibility of the Visually Impaired (시각장애인 미디어접근권 향상을 위한 해설오디오 수용도 조사 및 분석)

  • Jang, Inseon;Ahn, ChungHyun;Seo, Jeongil;Lee, Eun Ha;Kang, Wan Sic
    • Journal of Broadcast Engineering
    • /
    • v.22 no.2
    • /
    • pp.214-233
    • /
    • 2017
  • For people with physical or sensory limitations, broadcasting is the main means of information acquisition and leisure. Recently, changes in the media environment, such as convergence of broadcasting and communication, digital mobile conversion of broadcasting, and active media usage behavior of users, make broadcasting accessibility of the disabled difficult, and as a result, the information gap between the disabled and the non-disabled is increasing. A notice on broadcasting rights for the disabled was enacted in consequence of the amendment of the Broadcasting Law in July 2011 and the web accessibility guideline became more effective with the amendment of the National Informatization Act in 2013 so that legal basis for the right of media access for the disabled was established. However, media services for them are still lacking quantitatively and qualitatively. In this study, we describe the present status of the audio description service for the visually impaired, and analyze the results of the questionnaire survey on the usage status, satisfaction and improvement requirements of the audio description service for 100 visually impaired people.

A Feature -Based Word Spotting for Content-Based Retrieval of Machine-Printed English Document Images (내용기반의 인쇄체 영문 문서 영상 검색을 위한 특징 기반 단어 검색)

  • Jeong, Gyu-Sik;Gwon, Hui-Ung
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.10
    • /
    • pp.1204-1218
    • /
    • 1999
  • 문서영상 검색을 위한 디지털도서관의 대부분은 논문제목과/또는 논문요약으로부터 만들어진 색인에 근거한 제한적인 검색기능을 제공하고 있다. 본 논문에서는 영문 문서영상전체에 대한 검색을 위한 단어 영상 형태 특징기반의 단어검색시스템을 제안한다. 본 논문에서는 검색의 효율성과 정확도를 높이기 위해 1) 기존의 단어검색시스템에서 사용된 특징들을 조합하여 사용하며, 2) 특징의 개수 및 위치뿐만 아니라 특징들의 순서를 포함하여 매칭하는 방법을 사용하며, 3) 특징비교에 의해 검색결과를 얻은 후에 여과목적으로 문자인식을 부분적으로 적용하는 2단계의 검색방법을 사용한다. 제안된 시스템의 동작은 다음과 같다. 문서 영상이 주어지면, 문서 영상 구조가 분석되고 단어 영역들의 조합으로 분할된다. 단어 영상의 특징들이 추출되어 저장된다. 사용자의 텍스트 질의가 주어지면 이에 대응되는 단어 영상이 만들어지며 이로부터 영상특징이 추출된다. 이 참조 특징과 저장된 특징들과 비교하여 유사한 단어를 검색하게 된다. 제안된 시스템은 IBM-PC를 이용한 웹 환경에서 구축되었으며, 영문 문서영상을 이용하여 실험이 수행되었다. 실험결과는 본 논문에서 제안하는 방법들의 유효성을 보여주고 있다. Abstract Most existing digital libraries for document image retrieval provide a limited retrieval service due to their indexing from document titles and/or the content of document abstracts. This paper proposes a word spotting system for full English document image retrieval based on word image shape features. In order to improve not only the efficiency but also the precision of a retrieval system, we develop the system by 1) using a combination of the holistic features which have been used in the existing word spotting systems, 2) performing image matching by comparing the order of features in a word in addition to the number of features and their positions, and 3) adopting 2 stage retrieval strategies by obtaining retrieval results by image feature matching and applying OCR(Optical Charater Recognition) partly to the results for filtering purpose. The proposed system operates as follows: given a document image, its structure is analyzed and is segmented into a set of word regions. Then, word shape features are extracted and stored. Given a user's query with text, features are extracted after its corresponding word image is generated. This reference model is compared with the stored features to find out similar words. The proposed system is implemented with IBM-PC in a web environment and its experiments are performed with English document images. Experimental results show the effectiveness of the proposed methods.

Run-time Memory Optimization Algorithm for the DDMB Architecture (DDMB 구조에서의 런타임 메모리 최적화 알고리즘)

  • Cho, Jeong-Hun;Paek, Yun-Heung;Kwon, Soo-Hyun
    • The KIPS Transactions:PartA
    • /
    • v.13A no.5 s.102
    • /
    • pp.413-420
    • /
    • 2006
  • Most vendors of digital signal processors (DSPs) support a Harvard architecture, which has two or more memory buses, one for program and one or more for data and allow the processor to access multiple words of data from memory in a single instruction cycle. We already addressed how to efficiently assign data to multi-memory banks in our previous work. This paper reports on our recent attempt to optimize run-time memory. The run-time environment for dual data memory banks (DBMBs) requires two run-time stacks to control activation records located in two memory banks corresponding to calling procedures. However, activation records of two memory banks for a procedure are able to have different size. As a consequence, dual run-time stacks can be unbalanced whenever a procedure is called. This unbalance between two memory banks causes that usage of one memory bank can exceed the extent of on-chip memory area although there is free area in the other memory bank. We attempt balancing dual run-time slacks to enhance efficiently utilization of on-chip memory in this paper. The experimental results have revealed that although our algorithm is relatively quite simple, it still can utilize run-time memories efficiently; thus enabling our compiler to run extremely fast, yet minimizing the usage of un-time memory in the target code.