• 제목/요약/키워드: Approximate computing

검색결과 140건 처리시간 0.027초

An Efficient Somewhat HE scheme over Integers and Its Variation

  • Yang, Haomiao;Kim, Hyunsung;Tang, Dianhua;Li, Hongwei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권10호
    • /
    • pp.2497-2513
    • /
    • 2013
  • In 2010, Dijk et al. demonstrated a simple somewhat homomorphic encryption (HE) scheme over the integers of which this simplicity came at the cost of a public key size in $\tilde{O}({\lambda}^{10})$. Although in 2011 Coron et al. reduced the public key size to $\tilde{O}({\lambda}^7)$, it is still too large for practical applications, especially for the cloud computing. In this paper, we propose a new form of somewhat HE scheme to reduce further the public key size and a variation of the scheme to optimize the ciphertext size. First of all, we propose a new somewhat HE scheme which is built on the hardness of the approximate greatest common divisor (GCD) problem of two integers, where the public key size in the scheme is reduced to $\tilde{O}({\lambda}^3)$. Furthermore, we can reduce the length of the ciphertext of the new somewhat HE scheme by applying the modular reduction technique. Additionally, we give simulation results for evaluating ability of the proposed scheme.

기상청 기후자료의 균질성 문제 (II): 통계지침의 변경 (Inhomogeneities in Korean Climate Data (II): Due to the Change of the Computing Procedure of Daily Mean)

  • 류상범;김연희
    • 대기
    • /
    • 제17권1호
    • /
    • pp.17-26
    • /
    • 2007
  • The station relocations, the replacement of instruments, and the change of a procedure for calculating derived climatic quantities from observations are well-known nonclimatic factors that seriously contaminate the worthwhile results in climate study. Prior to embarking on the climatological analysis, therefore, the quality and homogeneity of the utilized data sets should be properly evaluated with metadata. According to the metadata of the Korea Meteorological Administration (KMA), there have been plenty of changes in the procedure computing the daily mean values of temperature, humidity, etc, since 1904. For routine climatological work, it is customary to compute approximate daily mean values for individual days from values observed at fixed hours. In the KMA, fixed hours were totally 5 times changed: at four-hourly, four-hourly interval with additional 12 hour, eight-hourly, six-hourly, three-hourly intervals. In this paper, the homogeneity in the daily mean temperature dataset of the KMA was assessed with the consistency and efficiency of point estimators. We used the daily mean calculated from the 24 hourly readings as a potential true value. Approximate daily means computed from temperatures observed at different fixed hours have statistically different properties. So this inhomogeneity in KMA climate data should be kept in mind if you want to analysis secular aspects of Korea climate using this data set.

대용량 컴뮤트 타임 임베딩을 위한 연산 속도 개선 방식 제안 (Proposing the Methods for Accelerating Computational Time of Large-Scale Commute Time Embedding)

  • 한희일
    • 전자공학회논문지
    • /
    • 제52권2호
    • /
    • pp.162-170
    • /
    • 2015
  • 컴뮤트 타임 임베딩을 구현하려면 그래프 라플라시안 행렬의 고유값과 고유벡터를 구하여야 하는데, $o(n^3)$의 계산량이 요구되어 대용량 데이터에는 적용하기 어려운 문제가 있다. 이를 줄이기 위하여 표본화 과정을 통하여 크기가 줄어든 그래프 라플라시안 행렬에서 구한 다음, 원래의 고유값과 고유벡터를 근사화시키는 Nystr${\ddot{o}}$m 기법을 주로 채택한다. 이 과정에서 많은 오차가 발생하는데, 이를 개선하기 위하여 본 논문에서는 그래프 라플라시안 대신에 가중치 행렬을 표본화하고 이로부터 구한 고유값과 고유벡터를 그래프 라플라시안의 고유값과 고유벡터로 변환하는 기법을 이용하여 대용량 데이터로 구성된 스펙트럴 그래프를 근사적으로 컴뮤트 타임 임베딩하는 기법을 제안한다. 하지만, 이 방식도 스펙트럼 분해를 계산하여야 하므로 데이터의 크기가 증가하면 적용하기 어려운 문제가 발생한다. 이의 대안으로, 스펙트럼 분해를 계산하지 않고도 데이터 집합의 크기에 영향을 받지 않으면서 컴뮤트 타임을 근사적으로 계산하는 방식을 구현하고 이들의 특성을 실험적으로 분석한다.

GPH 분포를 이용한 파산확률의 계산 (Computing Ruin Probability Using the GPH Distribution)

  • 윤복식
    • 한국경영과학회지
    • /
    • 제40권3호
    • /
    • pp.39-48
    • /
    • 2015
  • Even though ruin probability is a fundamental value to determine the insurance premium and policy, the complexity involved in computing its exact value forced us resort to an approximate method. In this paper, we first present an exact method to compute ruin probability under the assumption that the claim size has a GPH distribution, Then, for the arbitrary claim size distribution, we provide a method computing ruin probability quite accurately by approximating the distribution as a GPH. The validity of the proposed method demonstrated by a numerical example. The GPH approach seems to be valid for heavy-tailed claims as well as usual light-tailed claims.

An Efficient Correction Storage Scheme for Unsteady Flows

  • Kim, Youn J.;Cheong, Jo-Soon
    • Journal of Mechanical Science and Technology
    • /
    • 제15권1호
    • /
    • pp.125-138
    • /
    • 2001
  • An efficient correction storage scheme on a structured grid is applied to a sequence of approximate Jacobian systems arising at each time step from a linearization of the discrete nonlenear system of equations, obtained by the implicit time discretization of the conservation laws for unsteady fluid flows. The contribution of freezing the Jacobian matrix to computing costs is investigated within the correction storage scheme. The performance of the procedure is exhibited by measuring CPU time required to obtain a fully developed laminar vortex shedding flow past a circular cylinder, and is compared with that of a collective iterative method on a single grid. In addition, some computed results of the flow are presented in terms of some functionals along with measured data. The computational test shows that the computing costs may be saved in favor of the correction storage scheme with the frozen Jacobian matrix, to a great extent.

  • PDF

근사인자화법의 개량과 비압축성 유동해석에의 응용 (An Imprevement of the Approximate-Factorization Scheme and Its Application to the Analysis of Incompressible Viscous Flows)

  • 신병록
    • 대한기계학회논문집
    • /
    • 제19권8호
    • /
    • pp.1950-1963
    • /
    • 1995
  • A modification of the approximate-factorization method is made to accelerate the convergency rate and to take sufficiently large Courant number without loss of accuracy. And a stable implicit finite-difference scheme for solving the incompressible Navier-Stokes equations employed above modified method is developed. In the present implicit scheme, the volume fluxes with contravariant velocity components and the pressure formulation in curvilinear coordinates is adopted. In order to satisfy the continuity condition completely and to remove spurious errors for the pressure, the Navier-Stokes equations are solved by a modified SMAC scheme using a staggered gird. The upstream-difference scheme such as the QUICK scheme is also employed to the right hand side. The implicit scheme is unconditionally stable and satisfies a diagonally dominant condition for scalar diagonal linear systems of implicit operator on the left hand side. Numerical results for some test calculations of the two-dimensional flow in a square cavity and over a backward-facing step are obtained using both usual approximate-factorization method and the modified one, and compared with each other. It is shown that the present scheme allows a sufficiently large Courant number of O(10$^{2}$) and reduces the computing time.

인터넷 기반 근사 형상최적설계의 분산처리 (Distributed Process of Approximate Shape Optimization Based on the Internet)

  • 임오강;최은호;김우현
    • 한국전산구조공학회논문집
    • /
    • 제21권4호
    • /
    • pp.317-324
    • /
    • 2008
  • 대형 구조물에 대한 최적설계를 고려할 때 구조해석에 많은 시간과 노력이 소비된다. 한대의 개인용 컴퓨터에 의한 대형 구조물의 구조해석은 대용량의 기억장치와 많은 계산시간이 요구되므로 반복적 해석이 필요한 대형 구조물의 설계에 효율적으로 이용되기 어렵다. 따라서 본 논문에서는 이러한 문제의 대안으로 인터넷이 연결된 다수의 개인용 컴퓨터들로 고성능 병렬연산시스템을 구성하여 구조해석을 분산 처리하여 계산시간을 절감하였다. 아울러 반응표면의 근사를 위해 요구되는 구조해석을 상용 구조해석 어플리케이션으로 해결할 수 있다면 상용성이 확보되어 일반 구조물에 대하여도 반응표면법을 이용한 최적설계를 수행할 수 있을 것이다.

이중골조에 대한 비선형 약산법들의 응답특성 (The Response Characteristics of Approximate Nonlinear Methods with RC Dual System)

  • 남영우;강병두;전대한;김재웅
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2005년도 춘계 학술발표회 논문집
    • /
    • pp.71-78
    • /
    • 2005
  • In performance-based design methods, it is clear that the evaluation of the nonlinear response is required. The methods available to the design engineer today are nonlinear tim history analyses, or monotonic static nonlinear analyses, or equivalent static analyses with simulated inelastic influences. The nonlinear time analysis is the most accurate method in computing the nonlinear response of structures, but it is time-consuming and necessitate more efforts. Some codes proposed the capacity spectrum method based on the nonlinear static analysis to determine earthquake-induced demand given the structure pushover curve. This procedure is conceptually simple but iterative and time consuming with some errors. The nonlinear direct spectrum method is proposed and studied to evaluate nonlinear response of structures, without iterative computations, given by the structural linear vibration period and yield strength from the pushover analysis. The purpose of this paper is to compare the accuracy and the reliability of approximate nonlinear methods with respect to RC dual system and various earthquakes.

  • PDF

Enabling Energy Efficient Image Encryption using Approximate Memoization

  • Hong, Seongmin;Im, Jaehyung;Islam, SM Mazharul;You, Jaehee;Park, Yongjun
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • 제17권3호
    • /
    • pp.465-472
    • /
    • 2017
  • Security has become one of the most important requirements for various devices for multi-sensor based embedded systems. The AES (Advanced Encryption Standard) algorithm is widely used for security, however, it requires high computing power. In order to reduce the CPU power for the data encryption of images, we propose a new image encryption module using hardware memoization, which can reuse previously generated data. However, as image pixel data are slightly different each other, the reuse rate of the simple memoization system is low. Therefore, we further apply an approximate concept to the memoization system to have a higher reuse rate by sacrificing quality. With the novel technique, the throughput can be highly improved by 23.98% with 14.88% energy savings with image quality loss minimization.

AN ITERATIVE ALGORITHM FOR THE LEAST SQUARES SOLUTIONS OF MATRIX EQUATIONS OVER SYMMETRIC ARROWHEAD MATRICES

  • Ali Beik, Fatemeh Panjeh;Salkuyeh, Davod Khojasteh
    • 대한수학회지
    • /
    • 제52권2호
    • /
    • pp.349-372
    • /
    • 2015
  • This paper concerns with exploiting an oblique projection technique to solve a general class of large and sparse least squares problem over symmetric arrowhead matrices. As a matter of fact, we develop the conjugate gradient least squares (CGLS) algorithm to obtain the minimum norm symmetric arrowhead least squares solution of the general coupled matrix equations. Furthermore, an approach is offered for computing the optimal approximate symmetric arrowhead solution of the mentioned least squares problem corresponding to a given arbitrary matrix group. In addition, the minimization property of the proposed algorithm is established by utilizing the feature of approximate solutions derived by the projection method. Finally, some numerical experiments are examined which reveal the applicability and feasibility of the handled algorithm.