• Journal of Information Processing Systems
• /
• 제12권2호
• /
• pp.226-233
• /
• 2016

Cloud computing is a distributed computing model that has lot of drawbacks and faces difficulties. Many new innovative and emerging techniques take advantage of its features. In this paper, we explore the security threats to and Risk Assessments for cloud computing, attack mitigation frameworks, and the risk-based dynamic access control for cloud computing. Common security threats to cloud computing have been explored and these threats are addressed through acceptable measures via governance and effective risk management using a tailored Security Risk Approach. Most existing Threat and Risk Assessment (TRA) schemes for cloud services use a converse thinking approach to develop theoretical solutions for minimizing the risk of security breaches at a minimal cost. In our study, we propose an improved Attack-Defense Tree mechanism designated as iADTree, for solving the TRA problem in cloud computing environments.

• Journal of Information Processing Systems
• /
• 제6권2호
• /
• pp.197-208
• /
• 2010

Test scenarios can be derived based on some system models for requirements validation purposes. Model-based test suite reduction aims to provide a smaller set of test scenarios which can preserve the original test coverage with respect to some testing criteria. We are proposing to apply Formal Concept Analysis (FCA) in analyzing the association between a set of test scenarios and a set of transitions specified in a state machine model. By utilizing the properties of concept lattice, we are able to determine incrementally a minimal set of test scenarios with adequate test coverage.

• 한국식품저장유통학회지
• /
• 제5권3호
• /
• pp.305-314
• /
• 1998

In the drying process, many undesirable physicochemical changes occur that influence dried food product qualities. Pretreatments method is used to reduce the deterioration of dried food product qualities such as color, flavor, texture, rehydration ability and retention of nutrients. The methods of pretreatments are blanching, chemical treatment and osmotic dehydration. Osmotic dehydration is a water removal process which is based on placing foods in a concentrated osmotic solution or in a dry osmotic material. A large number of process variables have a significant effect on process and final product quality. In order to improve final product quality it is necessary to know the role of each process variable and understand the mecanisms throughout the process. Osmotic dehydration is a valuable processing tool with great future in minimal processing of fruits and vegetables.

• 대한전자공학회논문지
• /
• 제21권1호
• /
• pp.57-61
• /
• 1984

본 논문에서는 마이크로프로세서의 데이터 처리부 시험을 위한 최적시험명령어 \ulcorner을 구하는 방법을 제시하였다. 기본 자료로는 user's manual로부터 얻을 수 있는 명령어 \ulcorner을 이용하였다. 최적시험명령어 선정 과정은 3단계로 설명된다: 1) 기능적으로 분리된 명령어에 대한 시험처리선도의 구성, 2) 필수선도, 제거선도 및 적임선도의 결정, 3) 최적시험명령어 \ulcorner의 확정 INTEL 8048인 경우, 최적의 시험명령어는 명령어 레퍼터리(96개의 명령어) 중 50개이다.

• 한국정보처리학회논문지
• /
• 제7권2S호
• /
• pp.629-637
• /
• 2000

The content-based information retrieval for a multimedia database uses feature information extracted from the compressed videos. This paper presents an effective method to detect scene changes from compressed videos. Scene changes are detected with DC values of DCT coefficients in MPEG-1 encoded video sequences. Instead of decoding full frames. partial macroblocks of each frame, horizontal and vertical macroblocks, are decoded to detect scene changes. This method detects abrupt scene changes by decoding minimal number of blocks and saves a lot of computation time. The performance of the proposed algorithm is analyzed based on the precision and the recall. The experimental results show the effectiveness in computation time and detection rate to detect scene changes of various MPEG-1 video streams.

• Journal of Information Processing Systems
• /
• 제9권3호
• /
• pp.489-498
• /
• 2013

In this paper, we propose a common simulation model that can be reused for different performance evaluations of networked virtual environments. To this end, we analyzed the common features of NVEs, in which multiple regions compose a shared space, and where a user has his/her own interest area. Communication architecture can be client-server or peer-server models. In usual simulations, users move around the world while the number of users varies with the system. Our model provides various simulation parameters to customize the region configuration and user movement pattern. Furthermore, our model introduces a way to mimic a lot of users in a minimal experiment environment. The proposed model is integrated with our network framework, which supports various scalability approaches. We specifically applied our model to the interest management and load distribution schemes to evaluate communication overhead. With the proposed simulation model, a new simulation can be easily designed in a large-scale environment.

• 로봇학회논문지
• /
• 제6권2호
• /
• pp.165-172
• /
• 2011

This paper presents a robust lane detection algorithm based on RGB color and shape information during autonomous car control in realtime. For realtime control, our algorithm increases its processing speed by employing minimal elements. Our algorithm extracts yellow and white pixels by computing the average and standard deviation values calculated from specific regions, and constructs elements based on the extracted pixels. By clustering elements, our algorithm finds the yellow center and white stop lanes on the road. Our algorithm is insensitive to the environment change and its processing speed is realtime-executable. Experimental results demonstrate the feasibility of our algorithm.

• Journal of Electrical Engineering and information Science
• /
• 제2권6호
• /
• pp.1-6
• /
• 1997

The scheduling problem of satisfying both 0/1 constraint and the timing constraint while minimizing the total error is NP-complete when the optional parts have arbitrary processing times. In this paper, we present a heuristic scheduling algorithm for 0/1 constraint imprecise systems which consist of communicating tasks running on multiple processors. The algorithm is based on the program graph which is similar to the one presented in[4]. To check the schedulability, we apply Lawler and Moore's theorem. To analyze the performance of the proposed algorithm, intensive simulation is done. The results of the simulation shows that the longest processing first selection strategy outperforms random or minimal laxity policies.

• 한국군사과학기술학회지
• /
• 제14권6호
• /
• pp.1073-1080
• /
• 2011

In this study, a target detection algorithm was proposed for using hyperspectral imagery. The proposed algorithm is designed to have minimal processing time, low false alarm rate, and flexible threshold selection. The target detection procedure can be divided into two steps. Initially, candidates of target pixel are extracted using matching ratio of spectral pattern that can be calculated by spectral derivation. Secondly, spectral distance is computed only for those candidates using Euclidean distance. The proposed two-step method showed lower false alarm rate than the Euclidean distance detector applied over the whole image. It also showed much lower processing time as compared to the Mahalanobis distance detector.

• 융합신호처리학회논문지
• /
• 제12권1호
• /
• pp.26-32
• /
• 2011

This paper proposes a new method to process panoramic image stitching using SURF(Speeded Up Robust Features). Panoramic image stitching is considered a problem of the correspondence matching. In computer vision, it is difficult to find corresponding points in variable environment where a scale, rotation, view point and illumination are changed. However, SURF algorithm have been widely used to solve the problem of the correspondence matching because it is faster than SIFT(Scale Invariant Feature Transform). In this work, we also describe an efficient approach to decreasing computation time through the homography estimation using RANSAC(random sample consensus). RANSAC is a robust estimation procedure that uses a minimal set of randomly sampled correspondences to estimate image transformation parameters. Experimental results show that our method is robust to rotation, zoom, Gaussian noise and illumination change of the input images and computation time is greatly reduced.