• Title/Summary/Keyword: Square computing

Search Result 170, Processing Time 0.023 seconds

Fast Algorithm for Design of Spiral Inductor using Genetic Algorithm with Distributed Computing (유전 알고리듬과 분산처리기법을 이용한 스파이럴 인덕터의 고속설계 기법)

  • Sa, Ki-Dong;Ahn, Chang-Hoi
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.3
    • /
    • pp.446-452
    • /
    • 2008
  • To design a spiral inductor a genetic algorithm is applied with fast computing technique. For the inductance extraction of the given geometry the fast multipole method is used, also the distributed computing technique using 10 personal computers is introduced for the massive computation of the genetic algorithm. A few important design parameters are used as genes for the optimization in the genetic algorithm. The target function is chosen as mean square error of the inductance at several sampling frequency points. A large-scaled inductor is fabricated and compared with the simulated data.

Comparison of Error and Enhancement: Effect of Image Interpolation

  • Siddiqi, Muhammad Hameed;Fatima, Iram;Lee, Young-Koo;Lee, Sung-Young
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2011.06c
    • /
    • pp.188-190
    • /
    • 2011
  • Image interpolation is a technique that pervades many an application. Interpolation is almost never the goal in itself, yet it affects both the desired results and the ways to obtain them. In this paper, we proposed a technique that is capable to find out the error when the common two methods (bilinear and nearest neighbor interpolation) are applied on an image for rotation. The proposed technique also includes the comparison results of bilinear interpolation and nearest neighbor interpolation. Among them nearest neighbor interpolation gives us a better result regarding to the enhancement and due to least error. The error is found by using Mean Square Error (MSE).

POLYNOMIAL REPRESENTATIONS FOR n-TH ROOTS IN FINITE FIELDS

  • Chang, Seunghwan;Kim, Bihtnara;Lee, Hyang-Sook
    • Journal of the Korean Mathematical Society
    • /
    • v.52 no.1
    • /
    • pp.209-224
    • /
    • 2015
  • Computing square, cube and n-th roots in general, in finite fields, are important computational problems with significant applications to cryptography. One interesting approach to computational problems is by using polynomial representations. Agou, Del$\acute{e}$eglise and Nicolas proved results concerning the lower bounds for the length of polynomials representing square roots modulo a prime p. We generalize the results by considering n-th roots over finite fields for arbitrary n > 2.

Investigation on the Flowfield Around a Square Cylinder near a Wall (지면에 근접한 정사각주 주변의 유동장 연구)

  • Hwang, Jae-Ho;Park, Young-Whe;Kim, Tae-Yun;Lee, Dong-Ho
    • Proceedings of the KSME Conference
    • /
    • 2001.06e
    • /
    • pp.754-759
    • /
    • 2001
  • This paper presents unsteady computational investigations and wind tunnel tests on the flow field around a square cylinder with a gap between the body and the ground plane. Two-dimensional unsteady, incompressible Navier-Stokes codes are developed for the computation of the viscous turbulent flows. By computing the flow around a square cylinder without ground effect, three two-equation turbulence models are evaluated and the developed code is validated. The results show a good agreement with experimental values and other computational results. Critical gap height at which the formation of Karman vortex streets is interrupted, is demonstrated and another transition regime is pointed out

  • PDF

NUMERICAL SIMULATION OF FLOW PAST A SQUARE CYLINDER SUBMERGED UNDER THE FREE SURFACE (자유수면 아래 정방형 실린더 후류 유동에 관한 수치해석적 연구)

  • Ahn, Hyungsu;Yang, Kyung-Soo;Park, Doohyun
    • Journal of computational fluids engineering
    • /
    • v.20 no.4
    • /
    • pp.51-57
    • /
    • 2015
  • In the present study, two-dimensional numerical investigation of flow past a square cylinder beneath the free surface has been performed to identify the effects of presence of the free surface. An immersed boundary method was adopted for implementation of the cylinder cross-section in a Cartesian grid system. Also, a level-set method was used to capture the interface of two fluids. To prevent transition to three-dimensional flow, Reynolds number chosen for this simulation was 150. The cases for Froude number 0.2 and gap ratio(h/D) between 0.25 and 5.00 were examined. At the specific Reynolds number, we study the effects of gap ratio on flow characteristics around a square cylinder by computing flow fields, force coefficients and Strouhal number.

SOME RESULTS RELATED TO DISTRIBUTION FUNCTIONS OF CHI-SQUARE TYPE RANDOM VARIABLES WITH RANDOM DEGREES OF FREEDOM

  • Hung, Tran Loc;Thanh, Tran Thien;Vu, Bui Quang
    • Bulletin of the Korean Mathematical Society
    • /
    • v.45 no.3
    • /
    • pp.509-522
    • /
    • 2008
  • The main aim of this paper is to present some results related to asymptotic behavior of distribution functions of random variables of chi-square type $X^2_N={\Sigma}^N_{i=1}\;X^2_i$ with degrees of freedom N, where N is a positive integer-valued random variable independent on all standard normally distributed random variables $X_i$. Two ways for computing the distribution functions of chi-square type random variables with random degrees of freedom are considered. Moreover, some tables concerning considered distribution functions are demonstrated in Appendix.

Magic Square : Resource lookup protocol considering computing power of node (Magic Square : 노드의 능력을 고려한 자원 탐색 프로토콜)

  • 박선미;정일동;손영성;김경석
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04d
    • /
    • pp.163-165
    • /
    • 2003
  • P2P 시스템의 주요 이슈는 자원 (resource) 을 효율적으로 저장하고 찾는 것이다. 자원 탐색 프로토콜은 초기의 Napster, Gnutella와 같은 형태에서 발전하여, 현재는 분산 해시 테이블 (Distributed Hash Table을 사용한 형태로 발전하고 있다. 본 논문에서는 분산 해시 테이블을 사용한 P2P 프로토콜인 Magic Square를 제안한다. Magic Square에 참여하는 칵 노드는 양방향 스킬리스트로 구성된 지역 라우팅 테이블과 임의의 노드로 구성된 전역 라우팅 테이블을 가진다. 지역 라우팅 테이블은 각 노드의 능력을 고려하여 구성된다. 스킵리스트를 사용하였기 때문에 탐색과 노드의 추가라 삭제 과정이 간단하며. P2P 네트워크가 자주 바뀌어도 큰 영향을 받지 않는다.

  • PDF

Hardware Implementation on the Weight Calculation of Iterative Algorithm for CT Image Reconstruction

  • Cao, Xixin;Ma, Kaisheng;Lian, Renchun;Zhang, Qihui
    • ETRI Journal
    • /
    • v.35 no.5
    • /
    • pp.931-934
    • /
    • 2013
  • The weight calculation in an iterative algorithm is the most computationally costly task in computed tomography image reconstruction. In this letter, a fast algorithm to speed up the weight calculation is proposed. The classic square pixel rotation approximate calculation method for computing the weights in the iterative algorithm is first analyzed and then improved by replacing the square pixel model with a circular pixel model and the square rotation approximation with a segmentation method of a circular area. Software simulation and hardware implementation results show that our proposed scheme can not only improve the definition of the reconstructed image but also accelerate the reconstruction.

Parameter Estimations in the Complementary Weibull Reliability Model

  • Sarhan Ammar M.;El-Gohary Awad
    • International Journal of Reliability and Applications
    • /
    • v.6 no.1
    • /
    • pp.41-51
    • /
    • 2005
  • The Bayes estimators of the parameters included in the complementary Weibull reliability model are obtained. In the process of deriving Bayes estimators, the scale and shape parameters of the complementary Weibull distribution are considered to be independent random variables having prior exponential distributions. The maximum likelihood estimators of the desired parameters are derived. Further, the least square estimators are obtained in closed forms. Simulation study is made using Monte Carlo method to make a comparison among the obtained estimators. The comparison is made by computing the root mean squared errors associated to each point estimation. Based on the numerical study, the Bayes procedure seems better than the maximum likelihood and least square procedures in the sense of having smaller root mean squared errors.

  • PDF

Damage level prediction of non-reshaped berm breakwater using ANN, SVM and ANFIS models

  • Mandal, Sukomal;Rao, Subba;N., Harish;Lokesha, Lokesha
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.4 no.2
    • /
    • pp.112-122
    • /
    • 2012
  • The damage analysis of coastal structure is very important as it involves many design parameters to be considered for the better and safe design of structure. In the present study experimental data for non-reshaped berm breakwater are collected from Marine Structures Laboratory, Department of Applied Mechanics and Hydraulics, NITK, Surathkal, India. Soft computing techniques like Artificial Neural Network (ANN), Support Vector Machine (SVM) and Adaptive Neuro Fuzzy Inference system (ANFIS) models are constructed using experimental data sets to predict the damage level of non-reshaped berm breakwater. The experimental data are used to train ANN, SVM and ANFIS models and results are determined in terms of statistical measures like mean square error, root mean square error, correla-tion coefficient and scatter index. The result shows that soft computing techniques i.e., ANN, SVM and ANFIS can be efficient tools in predicting damage levels of non reshaped berm breakwater.