• Title/Summary/Keyword: 연산지연

Search Result 453, Processing Time 0.023 seconds

An Improved Multi-Keyword Search Protocol to Protect the Privacy of Outsourced Cloud Data (아웃소싱된 클라우드 데이터의 프라이버시를 보호하기 위한 멀티 키워드 검색 프로토콜의 개선)

  • Kim, Tae-Yeon;Cho, Ki-Hwan;Lee, Young-Lok
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.10
    • /
    • pp.429-436
    • /
    • 2017
  • There is a growing tendency to outsource sensitive or important data in cloud computing recently. However, it is very important to protect the privacy of outsourced data. So far, a variety of secure and efficient multi-keyword search schemes have been proposed in cloud computing environment composed of a single data owner and multiple data users. Zhang et. al recently proposed a search protocol based on multi-keyword in cloud computing composed of multiple data owners and data users but their protocol has two problems. One is that the cloud server can illegally infer the relevance between data files by going through the keyword index and user's trapdoor, and the other is that the response for the user's request is delayed because the cloud server has to execute complicated operations as many times as the size of the keyword index. In this paper, we propose an improved multi-keyword based search protocol which protects the privacy of outsourced data under the assumption that the cloud server is completely unreliable. And our experiments show that the proposed protocol is more secure in terms of relevance inference between the data files and has higher efficiency in terms of processing time than Zhang's one.

The viterbi decoder implementation with efficient structure for real-time Coded Orthogonal Frequency Division Multiplexing (실시간 COFDM시스템을 위한 효율적인 구조를 갖는 비터비 디코더 설계)

  • Hwang Jong-Hee;Lee Seung-Yerl;Kim Dong-Sun;Chung Duck-Jin
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.2 s.332
    • /
    • pp.61-74
    • /
    • 2005
  • Digital Multimedia Broadcasting(DMB) is a reliable multi-service system for reception by mobile and portable receivers. DMB system allows interference-free reception under the conditions of multipath propagation and transmission errors using COFDM modulation scheme, simultaneously, needs powerful channel error's correction ability. Viterbi Decoder for DMB receiver uses punctured convolutional code and needs lots of computations for real-time operation. So, it is desired to design a high speed and low-power hardware scheme for Viterbi decoder. This paper proposes a combined add-compare-select(ACS) and path metric normalization(PMN) unit for computation power. The proposed PMN architecture reduces the problem of the critical path by applying fixed value for selection algorithm due to the comparison tree which has a weak point from structure with the high-speed operation. The proposed ACS uses the decomposition and the pre-computation technique for reducing the complicated degree of the adder, the comparator and multiplexer. According to a simulation result, reduction of area $3.78\%$, power consumption $12.22\%$, maximum gate delay $23.80\%$ occurred from punctured viterbi decoder for DMB system.

Bit-Rate Control Using Histogram Based Rate-Distortion Characteristics (히스토그램 기반의 비트율-왜곡 특성을 이용한 비트율 제어)

  • 홍성훈;유상조;박수열;김성대
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.9B
    • /
    • pp.1742-1754
    • /
    • 1999
  • In this paper, we propose a rate control scheme, using histogram based rate-distortion (R-D) estimation, which produces a consistent picture quality between consecutive frames. The histogram based R-D estimation used in our rate control scheme offers a closed-form mathematical model that enable us to predict the bits and the distortion generated from an encoded frame at a given quantization parameter (QP) and vice versa. The most attractive feature of the R-D estimation is low complexity of computing the R-D data because its major operation is just to obtain a histogram or weighted histogram of DCT coefficients from an input picture. Furthermore, it is accurate enough to be applied to the practical video coding. Therefore, the proposed rate control scheme using this R-D estimation model is appropriate for the applications requiring low delay and low complexity, and controls the output bit-rate ad quality accurately. Our rate control scheme ensures that the video buffer do not underflow and overflow by satisfying the buffer constraint and, additionally, prevents quality difference between consecutive frames from exceeding certain level by adopting the distortion constraint. In addition, a consistent considering the maximum tolerance BER of the voice service. Also in Rician fading channel of K=6 and K=10, considering CLP=$10^{-3}$ as a criterion, it is observed that the performance improment of about 3.5 dB and 1.5 dB is obtained, respectively, in terms of $E_b$/$N_o$ by employing the concatenated FEC code with pilot symbols.

  • PDF

Experimental Vibration Analysis of Vehicle Body-Engine Systems by Transfer Function Synthesis Method (전달함수합성법에 의한 차체-엔진계의 실험적 진동해석)

  • 정의봉;안세진;김원영
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 1995.10a
    • /
    • pp.289-295
    • /
    • 1995
  • 구조물의 동적부하에 대한 동적변형 응답을 정확히 예측하고, Over Design이나 Under Design이 아닌 합리적인 설계방안의 개발은 중요한 과제이다. 동적강도해석이나 소음 승차감과 같은 진동 및 충격에 기인하는 제반 문제를 복잡한 구조물을 대상으로 합리적으로 처리하기 위한 Dynamic Design Analysis는 높은 신뢰성의 추구와 더불어 필요불가결한 기술이 되고 있다. 동적해석 방법으로는 현재 유한요소법이 널리 사용되고 있으며 여러 종류의 범용 프로그램들이 보급되어 있는 실정이다. 그러나 특히 동적문제에 있어서는 형상이나 거동이 복잡한 구조물의 경우, 또는 차량의 차체와 같이 많은 장착물이 부착된 경우에는 유한요소법의 적용이 곤란하여, 지금까지 대처할 수 있는 유용한 방법이 없었다. 따라서 비교적 용이하고 간단하게 적용가능한 진동실험을 기초로 한 구조물의 동적 응답해석 및 설계 방안의 개발이 필요하다. 본 연구에서는 진동시험으로 얻어진 부분구조물의 응답특성과 결합특성으로부터 결합 후의 응답특성을 예측할 수 있는 방법을 전달함수합성이론을 기초로하여 프로그래밍 package화 한다. 그리고 평판구조물에 대하여 진동시험과 컴퓨터 시뮬레이션을 통하여 개발된 방법의 타당성을 검증한다. 또한 실제 차량에서 차체만의 진동시험과 엔진의 자유진동시험에 의한 시험데이터로부터 차체와 엔진이 마운트 결합된 후의 진동특성을 예측한다. 진동시험시에 입력과 출력에 노이즈가 필연적으로 혼입되어 주파수응답함수의 크기(magnitude)와 위상(phase)을 왜곡시킨다. 특히 위상의 왜곡은 복소수연산을 하는 전달함수합성법의 결과에 중요한 영향을 미치게 된다. 본 연구에서는 데이타 획득시 입력과 출력의 시간지연으로 생기는 위상왜곡을 보정하는 방법을 제시하고, 그 개선 정도를 조사한다.는 소견의 확실도로서 가능성을 표현한 것이다. 예를 들면, 진동진폭 스펙트럼상에 2X 성분이 상당히 크게 나타나 정렬불량의 가능성이 0.7 정도라고 판정하는 것 등은 이러한 수치적진리치를 이용하는 방법이다. 그러나 상기의 수치적 표현만으로는 확실도를 한개의 수치로서 대표하게 하는 것은 진단의 정밀도에 문제가 있을 것으로 생각된다. 따라서 언어적진리치가 도입되어 [상당히 확실], [확실], [약간 확실] 등의 언어적인 표현을 이용하여 애매성을 표현하게 되었다. 본 논문에서는 간이진단 결과로부터 추출된 애매한 진단결과중에서 가장 가능성이 높은 이상원인을 복수로 선정하고, 여러 종류의 수치화할 수 없는 언어적(linguistic)인 정보ㄷㄹ을 if-then 형식의 퍼지추론으로 종합하는 회전기계의 이상진단을 위한 정밀진단 알고리즘을 제안하고 그 유용성을 검토한다. 존재하여도 모우드 변수들을 항상 정확하게 구할 수 있으며, 또한 알고리즘의 안정성이 보장된 것이다.. 여기서는 실험실 수준의 평 판모델을 제작하고 실제 현장에서 이루어질 수 있는 진동제어 구조물에 대 한 동적실험 및 FRS를 수행하는 과정과 동일하게 따름으로써 실제 발생할 수 있는 오차나 error를 실험실내의 차원에서 파악하여 진동원을 있는 구조 물에 대한 진동제어기술을 보유하고자 한다. 이용한 해마의 부피측정은 해마경화증 환자의 진단에 있어 육안적인 MR 진단이 어려운 제한된 경우에만 실제적 도움을 줄 수 있는 보조적인 방법으로 생각된다.ofile whereas relaxivity at high field is not affected by τS. On the other hand, the change in τV does not affect low field profile but strongly in fluences on bot

  • PDF

Development of GPS Multipath Error Reduction Method Based on Image Processing in Urban Area (디지털 영상을 활용한 도심지 내 GPS 다중경로오차 경감 방법 개발)

  • Yoon, Sung Joo;Kim, Tae Jung
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.36 no.2
    • /
    • pp.105-112
    • /
    • 2018
  • To determine the position of receiver, the GPS (Global Positioning System) uses position information of satellites and pseudo ranges based on signals. These are reflected by surrounding structures and multipath errors occur. This paper proposes a method for multipath error reduction using digital images to enhance the accuracy. The goal of the study is to calculate the shielding environment of receiver using image processing and apply it to GPS positioning. The proposed method, firstly, performs a preprocessing to reduce the effect of noise on images. Next, it uses hough transform to detect the outline of building roofs and determines mask angles and permissible azimuth range. Then, it classifies the satellites according to the condition using the image processing results. Finally, base on point positioning, it computes the receiver position by applying a weight model that assigns different weights to the classified satellites. We confirmed that the RMSE (Root Mean Square Error) was reduced by 2.29m in the horizontal direction and by 15.62m in the vertical direction. This paper showed the potential for the hybrid of GPS positioning and image processing technology.

An Analysis of Information Visualization Problems using User Interface Design Principles (이용자 인터페이스 설계 원칙에 의한 정보시각화 시스템 평가 및 문제점 분석)

  • Lee, Jee-Yeon
    • Journal of Information Management
    • /
    • v.34 no.2
    • /
    • pp.67-88
    • /
    • 2003
  • There have been increased interests in information visualization. Information visualization has been considered as a way to summarize textual data so that the users can access large amount of data more efficiently and effectively. However, many information visualization techniques stem from scientific visualization techniques, which might be difficult for the regular users to understand. More importantly, the system models used by most of the information visualization techniques do not have real world counterpart. For example, most of the users do not represent or process the textual data in terms of fisheye view or a topological map. This means that there is no affordance on the current information visualization systems from the users point of view. In this paper, we analyzed this problem by using the user interface design principles to point out what lacks in the current information visualization systems. More specifically, we have applied Nielson's Heuristic Evaluation technique to review four representative information visualization techniques. The analysis results confirmed our original hypothesis on why the current information visualization systems are not part of the mainstream information systems. Finally, we suggested to invest more efforts in improving the currently prevalent and familiar bullet list type textual information presentation method based on the usability studies and the intelligent content analysis.

Hybrid PKI Public Certificate Security Method Based on Device ID (디바이스 ID 기반의 하이브리드 PKI 공인 인증 보안 기법)

  • Son, Young-Hwan;Choi, Woon-Soo;Kim, Ki-Hyun;Choi, Han-Na;Lee, Dae-Yoon;Oh, Chung-Shick;Cho, Yong-Hwan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.5
    • /
    • pp.113-124
    • /
    • 2010
  • In this study, the hybrid authorization quotation technique is based on the device ID for the integrity of the source region guarantee of user certificate, in order to improve the convenience and security for user in the hybrid PKI certificate Mechanism for authentication. The feature of the model in which it is presented from this paper is 5. First, because the user can select the policy himself in which it matches with each authentication situation and security level, the convenience can be improved. Second, the integrity of the source region of the user certificate can be guaranteed through the comparison of the DLDI Key, that is the hash-value of the device ID. Third, the security can be improved by continuously changing an encoding, and the value of the key in which it decodes through the EOTP Key. Fourth, the index value is added to a certificate, and the storage of a certificate is possible at the Multi-Device. Fifth, since the addi the inan aratus for the integrity of the source region guarantee of a certificate is not needed, the authentication process time can be reduced and the computational load of the certificate server can be reduced also.

Efficiently Hybrid $MSK_k$ Method for Multiplication in $GF(2^n)$ ($GF(2^n)$ 곱셈을 위한 효율적인 $MSK_k$ 혼합 방법)

  • Ji, Sung-Yeon;Chang, Nam-Su;Kim, Chang-Han;Lim, Jong-In
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.44 no.9
    • /
    • pp.1-9
    • /
    • 2007
  • For an efficient implementation of cryptosystems based on arithmetic in a finite field $GF(2^n)$, their hardware implementation is an important research topic. To construct a multiplier with low area complexity, the divide-and-conquer technique such as the original Karatsuba-Ofman method and multi-segment Karatsuba methods is a useful method. Leone proposed an efficient parallel multiplier with low area complexity, and Ernst at al. proposed a multiplier of a multi-segment Karatsuba method. In [1], the authors proposed new $MSK_5$ and $MSK_7$ methods with low area complexity to improve Ernst's method. In [3], the authors proposed a method which combines $MSK_2$ and $MSK_3$. In this paper we propose an efficient multiplication method by combining $MSK_2,\;MSK_3\;and\;MSK_5$ together. The proposed method reduces $116{\cdot}3^l$ gates and $2T_X$ time delay compared with Gather's method at the degree $25{\cdot}2^l-2^l with l>0.

Numerical Modeling of a Short-range Three-dimensional Flash LIDAR System Operating in a Scattering Atmosphere Based on the Monte Carlo Radiative Transfer Matrix Method (몬테 카를로 복사 전달 행렬 방법을 사용한 산란 대기에서 동작하는 단거리 3차원 플래시 라이다 시스템의 수치적 모델링)

  • An, Haechan;Na, Jeongkyun;Jeong, Yoonchan
    • Korean Journal of Optics and Photonics
    • /
    • v.31 no.2
    • /
    • pp.59-70
    • /
    • 2020
  • We discuss a modified numerical model based on the Monte Carlo radiative transfer (MCRT) method, i.e., the MCRT matrix method, for the analysis of atmospheric scattering effects in three-dimensional flash LIDAR systems. Based on the MCRT method, the radiative transfer function for a LIDAR signal is constructed in a form of a matrix, which corresponds to the characteristic response. Exploiting the superposition and convolution of the characteristic response matrices under the paraxial approximation, an extended computer simulation model of an overall flash LIDAR system is developed. The MCRT matrix method substantially reduces the number of tracking signals, which may grow excessively in the case of conventional Monte Carlo methods. Consequently, it can readily yield fast acquisition of the signal response under various scattering conditions and LIDAR-system configurations. Using the computational model based on the MCRT matrix method, we carry out numerical simulations of a three-dimensional flash LIDAR system operating under different atmospheric conditions, varying the scattering coefficient in terms of visible distance. We numerically analyze various phenomena caused by scattering effects in this system, such as degradation of the signal-to-noise ratio, glitches, and spatiotemporal spread and time delay of the LIDAR signals. The MCRT matrix method is expected to be very effective in analyzing a variety of LIDAR systems, including flash LIDAR systems for autonomous driving.

An Efficient Page-Level Mapping Algorithm for Handling Write Requests in the Flash Translation Layer by Exploiting Temporal Locality (플래시 변환 계층에서 시간적 지역성을 이용하여 쓰기 요청을 처리하는 효율적인 페이지 레벨 매핑 알고리듬)

  • Li, Hai-Long;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.10
    • /
    • pp.1167-1175
    • /
    • 2016
  • This paper proposes an efficient page-level mapping algorithm that reduces the erase count in the FTL for flash memory systems. By maintaining the weight for each write request in the request buffer, the proposed algorithm estimates the degree of temporal locality for each incoming write request. To exploit temporal locality deliberately for determination of hot request, the degree of temporal locality should be much higher than the reference point determined experimentally. While previous LRU algorithm treats a new write request to have high temporal locality, the proposed algorithm allows write requests that are estimated to have high temporal locality to access hot blocks to store hot data intensively. The pages are more frequently updated in hot blocks than warm blocks. A hot block that has most of invalid pages is always selected as victim block at Garbage Collection, which results in delayed erase operation and in reduced erase count. Experimental results show that erase count is reduced by 9.3% for real I/O workloads, when compared to the previous LRU algorithm.