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

검색결과 413건 처리시간 0.021초

A Modified Computing Algorithm for Raking Ratio Estimation Subject to Partial Marginal Information

  • Son, Chang Kyoon
    • Communications for Statistical Applications and Methods
    • /
    • 제11권2호
    • /
    • pp.419-433
    • /
    • 2004
  • We suggest the modified computing algorithm for raking ratio estimation under the assumption that the population total is partially known, and the sample total is completely known about survey variable in contingency table. We show that the proposed estimation procedure is useful to estimate the population cell count in this situation through an empirical study.

커뮤니티 컴퓨팅에서 사용자 요구 반영을 위한 통계적 패턴 인식 기법 (A Statistical Pattern Recognition Method for Providing User Demand in Community Computing)

  • 김성빈;정혜동;이형수;김석윤
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2009년도 정보 및 제어 심포지움 논문집
    • /
    • pp.287-289
    • /
    • 2009
  • The conventional computing is a centralizing system, but it has been gradually going to develop ubiquitous computing which moves roles away from the main. The Community Computing, a new paradigm, is proposed to implement environment of ubiquitous computing. In this environment, it is important to accept the user demand. Hence in this paper recognizes pattern of user's activity statistically and proposes a method of pattern estimation in community computing. In addition, user's activity varies with time and the activity has the priority We reflect these. Also, we improve accuracy of the method through Knowledge Base organization and the feedback system. We make program using Microsoft Visual C++ for evaluating performance of proposed method, then simulate it. We can confirm it from the experiment result that using proposal method is better in environment of community computing.

  • PDF

韓國統計의 現況과 將來 - 統計와 電算

  • 허문열
    • Journal of the Korean Statistical Society
    • /
    • 제10권
    • /
    • pp.77-80
    • /
    • 1981
  • 통계적 방법론이 실용성(적용성)을 상실할 때 수학과 다른 점이 없을 것이고 방법론이 실용성을 가진 훌륭한 이론이라 할지라도 계산이 불가능하다면 이는 호화로운 자동차를 가지고 있으면서 연료가 없어 운영치 못하는 것과 다를 바가 없겠다. 이제 한국통계학회가 창립 10주년을 맞아 발돋음 단계에 접어들 시점에서 그동안 특히 부진하고 미비했던 전산통계(혹은 계산통계 statistical computing) 분야에 대해 통계인들 사이에 과거, 현재와 그리고 미래의 나아갈 방향에 대해 의견을 교환하게 됨은 뜻깊은 의의가 있다고 하겠다.

  • PDF

Two Sample Test Procedures for Linear Rank Statistics for Garch Processes

  • Chandra S. Ajay;Vanualailai Jito;Raj Sushil D.
    • Communications for Statistical Applications and Methods
    • /
    • 제12권3호
    • /
    • pp.557-587
    • /
    • 2005
  • This paper elucidates the limiting Gaussian distribution of a class of rank order statistics {$T_N$} for two sample problem pertaining to empirical processes of the squared residuals from two independent samples of GARCH processes. A distinctive feature is that, unlike the residuals of ARMA processes, the asymptotics of {$T_N$} depend on those of GARCH volatility estimators. Based on the asymptotics of {$T_N$}, we empirically assess the relative asymptotic efficiency and effect of the GARCH specification for some GARCH residual distributions. In contrast with the independent, identically distributed or ARMA settings, these studies illuminate some interesting features of GARCH residuals.

On the Performance of Oracle Grid Engine Queuing System for Computing Intensive Applications

  • Kolici, Vladi;Herrero, Albert;Xhafa, Fatos
    • Journal of Information Processing Systems
    • /
    • 제10권4호
    • /
    • pp.491-502
    • /
    • 2014
  • In this paper we present some research results on computing intensive applications using modern high performance architectures and from the perspective of high computational needs. Computing intensive applications are an important family of applications in distributed computing domain. They have been object of study using different distributed computing paradigms and infrastructures. Such applications distinguish for their demanding needs for CPU computing, independently of the amount of data associated with the problem instance. Among computing intensive applications, there are applications based on simulations, aiming to maximize system resources for processing large computations for simulation. In this research work, we consider an application that simulates scheduling and resource allocation in a Grid computing system using Genetic Algorithms. In such application, a rather large number of simulations is needed to extract meaningful statistical results about the behavior of the simulation results. We study the performance of Oracle Grid Engine for such application running in a Cluster of high computing capacities. Several scenarios were generated to measure the response time and queuing time under different workloads and number of nodes in the cluster.

Simulation Optimization with Statistical Selection Method

  • Kim, Ju-Mi
    • Management Science and Financial Engineering
    • /
    • 제13권1호
    • /
    • pp.1-24
    • /
    • 2007
  • I propose new combined randomized methods for global optimization problems. These methods are based on the Nested Partitions(NP) method, a useful method for simulation optimization which guarantees global optimal solution but has several shortcomings. To overcome these shortcomings I hired various statistical selection methods and combined with NP method. I first explain the NP method and statistical selection method. And after that I present a detail description of proposed new combined methods and show the results of an application. As well as, I show how these combined methods can be considered in case of computing budget limit problem.

Reliability Expression for Complex System

  • Seong Cheol Lee
    • Communications for Statistical Applications and Methods
    • /
    • 제3권3호
    • /
    • pp.125-133
    • /
    • 1996
  • In this paper, we present a algebraic technique for computing system reliability for complex system. The method was originally developed as an aid to fault tree analysis but it applies to general problems of reliability assessment. A success expression which directly gives the reliability expression is formed and simplified by the procedure. Several algorithms and examples are illustrated.

  • PDF

A Game with N Players

  • Cho, Dae-Hyeon
    • Journal of the Korean Statistical Society
    • /
    • 제25권2호
    • /
    • pp.185-193
    • /
    • 1996
  • In this paper we consider the gambler's ruin problem with N players and derive the formula for computing the expected ruin time when the initial fortunes of all N players are the same. And we present an example for the case of N = 5.

  • PDF

On Computing a Cholesky Decomposition

  • Park, Jong-Tae
    • Communications for Statistical Applications and Methods
    • /
    • 제3권2호
    • /
    • pp.37-42
    • /
    • 1996
  • Maximum likelihood estimation of Cholesky decomposition is considered under normality assumption. It is shown that maximum liklihood estimation gives a Cholesky decomposition of the sample covariance matrix. The joint distribution of the maximum likelihood estimators is derived. The ussual algorithm for a Cholesky decomposition is shown to be equivalent to a maximumlikelihood estimation of a Cholesky root when the underlying distribution is a multivariate normal one.

  • PDF