• Title/Summary/Keyword: Basic computation

Search Result 252, Processing Time 0.026 seconds

Comparing Solution Methods for a Basic RBC Model

  • Joo, Semin
    • Management Science and Financial Engineering
    • /
    • v.21 no.2
    • /
    • pp.25-30
    • /
    • 2015
  • This short article compares different solution methods for a basic RBC model (Hansen, 1985). We solve and simulate the model using two main algorithms: the methods of perturbation and projection, respectively. One novelty is that we offer a type of the hybrid method: we compute easily a second-order approximation to decision rules and use that approximation as an initial guess for finding Chebyshev polynomials. We also find that the second-order perturbation method is most competitive in terms of accuracy for standard RBC model.

Improvement of Iterative Algorithm for Live Variable Analysis based on Computation Reordering (사용할 변수의 예측에 사용되는 반복적 알고리즘의 계산순서 재정렬을 통한 수행 속도 개선)

  • Yun Jeong-Han;Han Taisook
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.8
    • /
    • pp.795-807
    • /
    • 2005
  • The classical approaches for computing Live Variable Analysis(LVA) use iterative algorithms across the entire programs based on the Data Flow Analysis framework. In case of Zephyr compiler, average execution time of LVA takes $7\%$ of the compilation time for the benchmark programs. The classical LVA algorithm has many aspects for improvement. The iterative algorithm for LVA scans useless basic blocks and calculates large sets of variables repeatedly. We propose the improvement of Iterative algorithm for LVA based on used variables' upward movement. Our algorithm produces the same result as the previous iterative algorithm. It is based on use-def chain. Reordering of applying the flow equation in DFA reduces the number of visiting basic blocks and redundant flow equation executions, which improves overall processing time. Experimental results say that our algorithm ran reduce $36.4\%\;of\;LVA\;execution\;time\;and\;2.6\%$ of overall computation time in Zephyr compiler with benchmark programs.

The 'Two Basics' Mathematics Teaching Approach and the Open Ended Problem Solving in China

  • Zhang, Dianzhou;Dai, Zaiping
    • Research in Mathematical Education
    • /
    • v.8 no.3
    • /
    • pp.123-144
    • /
    • 2004
  • There is a tradition of advocating the 'two basics' (basic knowledge and basic skills) in Chinese mathematics education. The direct consequence is that Chinese students are able to produce excellent performance in the international mathematics examinations and outstanding results in the international mathematics competitions. In this article, we will present why and how Chinese teachers teach the 'two basics,' and how combine the pupil's creativity with their 'two basics.' Open ended problem solving is a way to meet the goal. The following topics will be concerned: Culture background; the speed of computation; 'make perfect' ; Efficiency in classroom; Balance between 'two basics' and personal development. In Particular, Chinese mathematics educators pay more attentions to the link between open ended problem solving and the 'two basics' principal.

  • PDF

Development of a Computation Program for Automatic Processing of Calibration Data of Radiation Instrument (방사선 측정기 교정 데이터의 자동처리를 위한 전산프로그램 개발)

  • Jang, Ji-Woon;Shin, Hee-Sung;Youn, Cheung;Lee, Yun-Hee;Kim, Ho-Dong;Jung, Ki-Jung
    • Journal of the Korean Society for Nondestructive Testing
    • /
    • v.26 no.4
    • /
    • pp.246-254
    • /
    • 2006
  • A computation program has been developed for automatic data processing in the calibration process of gamma survey meter. The automatic processing program has been developed based on Visual Basic. The program has been coded according to steps of calibration procedure. The OLE(object linking an embedding) Excel automation method fur automatic data processing is used in this program, which is a kind of programming technique for the Excel control. The performance test on the basis of reference data has been carried out by using the developed program. In the results of performance test, the values of calibration factors and uncertainties by the developed program were equal to those obtained from the reference data. In addition, It was revealed that the efficiency and precision of working are significantly increased by using the developed program.

Transport Protocols in Cognitive Radio Networks: A Survey

  • Zhong, Xiaoxiong;Qin, Yang;Li, Li
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.11
    • /
    • pp.3711-3730
    • /
    • 2014
  • Cognitive radio networks (CRNs) have emerged as a promising solution to enhance spectrum utilization by using unused or less used spectrum in radio environments. The basic idea of CRNs is to allow secondary users (SUs) access to licensed spectrum, under the condition that the interference perceived by the primary users (PUs) is minimal. In CRNs, the channel availability is uncertainty due to the existence of PUs, resulting in intermittent communication. Transmission control protocol (TCP) performance may significantly degrade in such conditions. To address the challenges, some transport protocols have been proposed for reliable transmission in CRNs. In this paper we survey the state-of-the-art transport protocols for CRNs. We firstly highlight the unique aspects of CRNs, and describe the challenges of transport protocols in terms of PU behavior, spectrum sensing, spectrum changing and TCP mechanism itself over CRNs. Then, we provide a summary and comparison of existing transport protocols for CRNs. Finally, we discuss several open issues and research challenges. To the best of our knowledge, our work is the first survey on transport protocols for CRNs.

An Investigation Study on the Coefficient of Occupants Density for Performance Evacuation Capacity Computation in Buildings (성능적 피난용량산정을 위한 대형할인마트의 재실자밀도 계수 조사연구)

  • Seo, Dong-Goo;Shin, Yi-Chul;Lee, Jae-Young;Kwon, Young-Jin
    • Fire Science and Engineering
    • /
    • v.23 no.5
    • /
    • pp.1-8
    • /
    • 2009
  • As the rapid and various changing of social aspects, the structures are getting bigger, higher and more complex. The importance of evacuation is on the rise as increased using frequency of multiplex sale facility and it's a high population density. According to the result of a survey with 4 domestic wholesales mart's population density, the maximum was 0.30, 0.46, 0.42, 0.38 人/$m^2$ in and 0.46 人/$m^2$). Considering evacuation dangerousness, the maximum value will be suitable for computation of evacuation capacity and this will be submitted as a basic DATA for computation of evacuation capacity.

A Study on the Numerical Simulation Method of Two-dimensional Incompressible Fluid Flows using ISPH Method (ISPH법을 이용한 2차원 비압축성 유체 유동의 수치시뮬레이션 기법 연구)

  • Kim, Cheol-Ho;Lee, Young-Gill;Jeong, Kwang-Leol
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.48 no.6
    • /
    • pp.560-568
    • /
    • 2011
  • In SPH(Smoothed Particle Hydrodynamics) method, the fluid has been assumed that it is weakly compressible to solve the basic equations composed of Navier-Stokes equations and continuity equation. That leads to some drawbacks such as non-physical pressure fluctuations and a restriction as like small time steps in computation. In this study, to improve these problems we assume that the fluid is incompressible and the velocity-pressure coupling problem is solved by a projection method(that is, by ISPH method). The two-dimensional computation results of dam breaking and gravitational wave generation are respectively compared with the results of finite volume method and analytical method to confirm the accuracy of the present numerical computation technique. And, the agreements are comparatively acceptable. Subsequently, the green water simulations of a two-dimensional fixed barge are carried out to inspect the possibility of practical application to ship hydrodynamics, those correspond to one of the violent free surface motions with impact loads. The agreement between the experimental data and the present computational results is also comparatively good.

Efficient Fault Injection Attack to the Miller Algorithm in the Pairing Computation using Affine Coordinate System (아핀좌표를 사용하는 페어링 연산의 Miller 알고리듬에 대한 효과적인 오류주입공격)

  • Bae, Ki-Seok;Park, Jea-Hoon;Sohn, Gyo-Yong;Ha, Jae-Cheol;Moon, Sang-Jae
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.21 no.3
    • /
    • pp.11-25
    • /
    • 2011
  • The Miller algorithm is employed in the typical pairing computation such as Weil, Tate and Ate for implementing ID based cryptosystem. By analyzing the Mrabet's attack that is one of fault attacks against the Miller algorithm, this paper presents au efficient fault attack in Affine coordinate system, it is the most basic coordinates for construction of elliptic curve. The proposed attack is the effective model of a count check fault attack, it is verified to work well by practical fault injection experiments and can omit the probabilistic analysis that is required in the previous counter fault model.

A Study on the Escape capacity for Evacuation safety Design of PBD foothold in Korea(II) (국내 PBD기반 피난안전설계를 위한 피난용량 산정에 관한 연구(II) - 멀티플렉스 공간의 재실자밀도 조사 -)

  • Jo, Nam-Hun;Seo, Dong-Goo;Hwang, Eun-Kyung;Hwang, Keum-Suk;Kwon, Young-Jin
    • Proceedings of the Korea Institute of Fire Science and Engineering Conference
    • /
    • 2008.11a
    • /
    • pp.210-215
    • /
    • 2008
  • As the rapid and various changing of social aspects, the structures are getting bigger, higher and more complex. The importance of evacuation is on the rise as increased using frequency of multiplex area and it's high population density. According to the result of a survey with 2 domestic multiplex population density, the maximum was 0.43(人/$m^2$) and 0.51(人/$m^2$). considering evacuation dangerousness, the maximum value will be suitable for computation of evacuation capacity and this will be submitted as a basic data for computation of evacuation capacity.

  • PDF

A Hybrid Method for Improvement of Evolutionary Computation (진화 연산의 성능 개선을 위한 하이브리드 방법)

  • Chung, Jin-Ki;Oh, Se-Young
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.4
    • /
    • pp.317-322
    • /
    • 2002
  • The major operations of Evolutionary Computation include crossover, mutation, competition and selection. Although selection does not create new individuals like crossover or mutation, a poor selection mechanism may lead to problems such as taking a long time to reach an optimal solution or even not finding it at all. In view of this, this paper proposes a hybrid Evolutionary Programming (EP) algorithm that exhibits a strong capability to move toward the global optimum even when stuck at a local minimum using a synergistic combination of the following three basic ideas. First, a "local selection" technique is used in conjunction with the normal tournament selection to help escape from a local minimum. Second, the mutation step has been improved with respect to the Fast Evolutionary Programming technique previously developed in our research group. Finally, the crossover and mutation operations of the Genetic Algorithm have been added as a parallel independent branch of the search operation of an EP to enhance search diversity.