• Title/Summary/Keyword: 커널기법

Search Result 347, Processing Time 0.027 seconds

Framework-assisted Selective Page Protection for Improving Interactivity of Linux Based Mobile Devices (리눅스 기반 모바일 기기에서 사용자 응답성 향상을 위한 프레임워크 지원 선별적 페이지 보호 기법)

  • Kim, Seungjune;Kim, Jungho;Hong, Seongsoo
    • Journal of KIISE
    • /
    • v.42 no.12
    • /
    • pp.1486-1494
    • /
    • 2015
  • While Linux-based mobile devices such as smartphones are increasingly used, they often exhibit poor response time. One of the factors that influence the user-perceived interactivity is the high page fault rate of interactive tasks. Pages owned by interactive tasks can be removed from the main memory due to the memory contention between interactive and background tasks. Since this increases the page fault rate of the interactive tasks, their executions tend to suffer from increased delays. This paper proposes a framework-assisted selective page protection mechanism for improving interactivity of Linux-based mobile devices. The framework-assisted selective page protection enables the run-time system to identify interactive tasks at the framework level and to deliver their IDs to the kernel. As a result, the kernel can maintain the pages owned by the identified interactive tasks and avoid the occurrences of page faults. The experimental results demonstrate the selective page protection technique reduces response time up to 11% by reducing the page fault rate by 37%.

Application of Homomorphic Filtering to Satellite Imagery and Geophysical Image Data (위성영상 및 지구물리 영상자료의 호모몰픽 필터링 적용)

  • Yoo Hee-Young;Lee Kiwon;Kwon Byung-Doo
    • Journal of the Korean earth science society
    • /
    • v.26 no.1
    • /
    • pp.58-65
    • /
    • 2005
  • Homomorphic filtering improves image by enhancing high components and reducing low components in the Sequency domain based on FFT, as one of useful digital image processing techniques. In this study, the application program f3r homomorphic filtering was developed. Using this program, satellite imageries and geophysical image such as magnetic image data were processed and their results were analyzed. In case of applying to other techniques suck as histogram equalization and kernel-based masking f3r the same purpose. they often cause the slight distortion of boundary or overall change of brightness values on the whole image. Whereas. homomorphic filtering has ability to enhance selectively detailed components in a target image. Therefore. this technique can be effectively used for extraction or separation of complex types of characteristics contained in the satellite imagery. In addition, this technique would be applicable to investigate anomalous zone in various geophysical image data.

Knee Articular Cartilage Segmentation with Priors Based On Gaussian Kernel Level Set Algorithm (사전정보를 이용한 가우시안 커널 레벨 셋 알고리즘 기반 무릎 관절 연골 자기공명영상 분할기법)

  • Ahn, Chunsoo;Bui, Toan;Lee, Yong-Woo;Shin, Jitae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.6
    • /
    • pp.490-496
    • /
    • 2014
  • The thickness of knee joint cartilage causes most diseases of knee. Therefore, an articular cartilage segmentation of knee magnetic resonance imaging (MRI) is required to diagnose a knee diagnosis correctly. In particular, fully automatic segmentation method of knee joint cartilage enables an effective diagnosis of knee disease. In this paper, we analyze a well-known level-set based segmentation method in brain MRI, and apply that method to knee MRI with solving some problems from different image characteristics. The proposed method, a fully automatic segmentation in whole process, enables to process faster than previous semi-automatic segmentation methods. Also it can make a three-dimension visualization which provides a specialist with an assistance for the diagnosis of knee disease. In addition, the proposed method provides more accurate results than the existing methods of articular cartilage segmentation in knee MRI through experiments.

Detecting TOCTOU Race Condition on UNIX Kernel Based File System through Binary Analysis (바이너리 분석을 통한 UNIX 커널 기반 File System의 TOCTOU Race Condition 탐지)

  • Lee, SeokWon;Jin, Wen-Hui;Oh, Heekuck
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.31 no.4
    • /
    • pp.701-713
    • /
    • 2021
  • Race Condition is a vulnerability in which two or more processes input or manipulate a common resource at the same time, resulting in unintended results. This vulnerability can lead to problems such as denial of service, elevation of privilege. When a vulnerability occurs in software, the relevant information is documented, but often the cause of the vulnerability or the source code is not disclosed. In this case, analysis at the binary level is necessary to detect the vulnerability. This paper aims to detect the Time-Of-Check Time-Of-Use (TOCTOU) Race Condition vulnerability of UNIX kernel-based File System at the binary level. So far, various detection techniques of static/dynamic analysis techniques have been studied for the vulnerability. Existing vulnerability detection tools using static analysis detect through source code analysis, and there are currently few studies conducted at the binary level. In this paper, we propose a method for detecting TOCTOU Race Condition in File System based on Control Flow Graph and Call Graph through Binary Analysis Platform (BAP), a binary static analysis tool.

Study to detect and block leakage of personal information : Android-platform environment (개인정보 유출 탐지 및 차단에 관한 연구 : 안드로이드 플랫폼 환경)

  • Choi, Youngseok;Kim, Sunghoon;Lee, Dong Hoon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.23 no.4
    • /
    • pp.757-766
    • /
    • 2013
  • The Malicious code that targets Android is growing dramatically as the number of Android users are increasing. Most of the malicious code have an intention of leaking personal information. Recently in Korea, a malicious code 'chest' has appeared and generated monetary damages by using malicious code to leak personal information and try to make small purchases. A variety of techniques to detect personal information leaks have been proposed on Android platform. However, the existing techniques are hard to apply to the user's smart-phone due to the characteristics of Android security model. This paper proposed a technique that detects and blocks file approaches and internet connections that are not allowed access to personal information by using the system call hooking in the kernel and white-list based approach policy. In addition, this paper proved the possibility of a real application on smart-phone through the implementation.

A Local Buffer Allocation Scheme for Multimedia Data on Linux (리눅스 상에서 멀티미디어 데이타를 고려한 지역 버퍼 할당 기법)

  • 신동재;박성용;양지훈
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.9 no.4
    • /
    • pp.410-419
    • /
    • 2003
  • The buffer cache of general operating systems such as Linux manages file data by using global block replacement policy and read ahead. As a result, multimedia data with a low locality of reference and various consumption rate have low cache hit ratio and consume additional buffers because of read ahead. In this paper we have designed and implemented a new buffer allocation algorithm for multimedia data on Linux. Our approach keeps one read-ahead cache per every opened multimedia file and dynamically changes the read-ahead group size based on the buffer consumption rate of the file. This distributes resources fairly and optimizes the buffer consumption. This paper compares the system performance with that of Linux 2.4.17 in terms of buffer consumption and buffer hit ratio.

Translation Techniques for Mobile Games (모바일 게임을 위한 번역 기법)

  • Park, Ji-Woo;Oh, Se-Man
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.9
    • /
    • pp.936-947
    • /
    • 2010
  • In the mobile gaming market, it is desirable for a specific content to be served on various platforms. Recently, it is a very important issue in the market for mobile games. This problem incurs extra cost, because we need to redevelop existing contents to be executed on another platforms. Moreover, the release of a new platform has spent much more effort and cost developing many contents in short period of time. Therefore, we need to research about translation techniques that enable the existing contents to run on a different platform. In this paper, we propose translation techniques for mobile games. The techniques can be applied on converting mobile contents to runnable contents on a new platform. To realize it, we design and implement a source-level contents translator which is targeting Android platform using the suggested techniques. Our source-level contents translator is implemented systematically by applying compiler theory. Also, we solve partially translation problems between different programming languages. The translator has been implemented separately divided into three tasks such as kernel porting, library mapping as well as language translation. We expect these techniques to increase utilization of existing mobile games and contribute to vitalizations of mobile contents industry.

Analyzing the Overhead of the Memory Mapped File I/O for In-Memory File Systems (메모리 파일시스템에서 메모리 매핑을 이용한 파일 입출력의 오버헤드 분석)

  • Choi, Jungsik;Han, Hwansoo
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.10
    • /
    • pp.497-503
    • /
    • 2016
  • Emerging next-generation storage technologies such as non-volatile memory will help eliminate almost all of the storage latency that has plagued previous storage devices. In conventional storage systems, the latency of slow storage devices dominates access latency; hence, software efficiency is not critical. With low-latency storage, software costs can quickly dominate memory latency. Hence, researchers have proposed the memory mapped file I/O to avoid the software overhead. Mapping a file into the user memory space enables users to access the file directly. Therefore, it is possible to avoid the complicated I/O stack. This minimizes the number of user/kernel mode switchings. In addition, there is no data copy between kernel and user areas. Despite of the benefits in the memory mapped file I/O, its overhead still needs to be addressed, as the existing mechanism for the memory mapped file I/O is designed for slow block devices. In this paper, we identify the overheads of the memory mapped file I/O via experiments.

Clustering-based Statistical Machine Translation Using Syntactic Structure and Word Similarity (문장구조 유사도와 단어 유사도를 이용한 클러스터링 기반의 통계기계번역)

  • Kim, Han-Kyong;Na, Hwi-Dong;Li, Jin-Ji;Lee, Jong-Hyeok
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.4
    • /
    • pp.297-304
    • /
    • 2010
  • Clustering method which based on sentence type or document genre is a technique used to improve translation quality of SMT(statistical machine translation) by domain-specific translation. But there is no previous research using sentence type and document genre information simultaneously. In this paper, we suggest an integrated clustering method that classifying sentence type by syntactic structure similarity and document genre by word similarity information. We interpolated domain-specific models from clusters with general models to improve translation quality of SMT system. Kernel function and cosine measures are applied to calculate structural similarity and word similarity. With these similarities, we used machine learning algorithms similar to K-means to clustering. In Japanese-English patent translation corpus, we got 2.5% point relative improvements of translation quality at optimal case.

Flow Simulation of High Flow Concrete using Incompressible Smoothed Particle Hydrodynamics (ISPH) Method (ISPH 기법을 이용한 고유동 콘크리트의 유동 해석)

  • Kim, Sang-Sin;Chung, Chul-Woo;Lee, Chang-Joon
    • Journal of the Korea Institute of Building Construction
    • /
    • v.19 no.1
    • /
    • pp.39-46
    • /
    • 2019
  • A three-dimensional flow simulation model for high flow concrete was developed using Incompressible Smoothed Particle Hydrodynamics (ISPH), which can solved Navier-Stokes equation with the assumption of a fluid to be incompressible. For the simulation, a computer program code for ISPH was implemented with MATALB programming code. A piecewise cubic spline function was used for the kernel function of ISPH. Projetion method was used to calculate the velocity and pressure of particles as a function of time. Fixed ghost particle was used for wall boundary condition. Free surface boundaries were determined by using virtual density of particles. In order to validate the model and the code, the simulation results of slump flow test, $T_{500}$ test and L-box test were compared with experimental ones. The simulation results were well matched with the experimental results. The simulation described successfully the characteristics of the flow phenomenon according to the change of the viscosity and yield stress of high flow concrete.