• Title/Summary/Keyword: approximate

Search Result 4,330, Processing Time 0.029 seconds

Bit Error Probability Analysis for MPSK Modulation in the Suzuki Fading Channel (Suzuki 페이딩 채널에서 MPSK 변조 방식의 비트 오류 확률 분석)

  • 박태준;하구용
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.6
    • /
    • pp.1075-1084
    • /
    • 1994
  • In this paper we derive a closed-form approximate expression for the bit error probability of the MPSK modulation with diversity reception in the Suzuki fading channel which is a mixture of short term and long term fading. We showed that the proposed approximate expression was capable of efficient computation compared to the existing integral-form expression, and gives an quantitative insight how much the channel parameters degrade the system performance. Further more it is shown that an appropriate transmission power control is beneficial to the system through consideration of the approximate expression.

  • PDF

An Error-Bounded B-spline Fitting Technique to Approximate Unorganized Data (무작위 데이터 근사화를 위한 유계오차 B-스플라인 근사법)

  • Park, Sang-Kun
    • Korean Journal of Computational Design and Engineering
    • /
    • v.17 no.4
    • /
    • pp.282-293
    • /
    • 2012
  • This paper presents an error-bounded B-spline fitting technique to approximate unorganized data within a prescribed error tolerance. The proposed approach includes two main steps: leastsquares minimization and error-bounded approximation. A B-spline hypervolume is first described as a data representation model, which includes its mathematical definition and the data structure for implementation. Then we present the least-squares minimization technique for the generation of an approximate B-spline model from the given data set, which provides a unique solution to the problem: overdetermined, underdetermined, or ill-conditioned problem. We also explain an algorithm for the error-bounded approximation which recursively refines the initial base model obtained from the least-squares minimization until the Euclidean distance between the model and the given data is within the given error tolerance. The proposed approach is demonstrated with some examples to show its usefulness and a good possibility for various applications.

An Approximate Calculation Model for Electromagnetic Devices Based on a User-Defined Interpolating Function

  • Ye, Xuerong;Deng, Jie;Wang, Yingqi;Zhai, Guofu
    • Journal of Magnetics
    • /
    • v.19 no.4
    • /
    • pp.378-384
    • /
    • 2014
  • Optimization design and robust design are significant measures for improving the performance and reliability of electromagnetic devices (EMDs, specifically refer to relays, contactors in this paper). However, the implementation of the above-mentioned design requires substantial calculation; consequently, on the premise of guaranteeing precision, how to improve the calculation speed is a problem that needs to be solved. This paper proposes a new method for establishing an approximate model for the EMD. It builds a relationship between the input and output of the EMD with different coil voltages and air gaps, by using a user-defined interpolating function. The coefficient of the fitting function is determined based on a quantum particle swarm optimization (QPSO) method. The effectiveness of the method proposed in this paper is verified by the electromagnetic force calculation results of an electromagnetic relay with permanent magnet.

Reliability Estimation for the Exponential Distribution under Multiply Type-II Censoring

  • Kang, Suk-Bok;Lee, Sang-Ki;Choi, Hui-Taeg
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2005.10a
    • /
    • pp.13-26
    • /
    • 2005
  • In this paper, we derive the approximate maximum likelihood estimators of the scale parameter and location parameter of the exponential distribution based on multiply Type-II censored samples. We compare the proposed estimators in the sense of the mean squared error for various censored samples. We also obtain the approximate maximum likelihood estimator (AMLE) of the reliability function by using the proposed estimators. And then we compare the proposed estimators in the sense of the mean squared error.

  • PDF

Curvature and Deflection of Reinforced Concrete Member Due to Shrinkage (건조수축에 의한 철근콘크리트 부재의 곡률과 처짐)

  • 김진근;이상순;김민수;신병천
    • Proceedings of the Korea Concrete Institute Conference
    • /
    • 1998.04a
    • /
    • pp.333-338
    • /
    • 1998
  • Deflections due to warping are frequently ignored in design calculation. For thin member, shrinkage deflection results in important and objectionable additions to the dead load deflection. Thus it may be desirable to consider warping effects due to shrinkage for thin member. Some methods for computing shrinkage curvature have been proposed by many researchers. The approximate methods widely used in the recent years are the equivalent tensile force method. Miller's method and Branson's method (an empirical method based on Miller's approach extended to include doubly reinforced beams). These method were somewhat oversimplified and could be too conservative in the case of well cured concrete structure. In this paper, the approximate method for computing shrinkage curvature are reviewed and new approximate method based on the Age-Adjusted Effective Modulus method is proposed.

  • PDF

APPROXIMATE ANALYSIS OF AN N-DESIGN CALL CENTER WITH TWO TYPES OF AGENTS

  • Park, Chul-Geun;Han, Dong-Hwan;Baik, Kwang-Hyun
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.5_6
    • /
    • pp.1021-1035
    • /
    • 2008
  • In this paper, we analyze an N-design call center with skill-based routing, in which one pool of agents handles two types of calls and another pool of agents handles only one type of calls. The approximate analysis is motivated by a computational complexity that has been observed in the direct stochastic approach and numerical method for finding performance measures. The workforce staffing policy is very important to the successful management of call centers. So the allocation scheduling of the agents can be considered as the optimization problem of the corresponding queueing system to the call center. We use a decomposition algorithm which divides the state space of the queueing system into the subspaces for the approximate analysis of the N-design call center with two different types of agents. We also represent some numerical examples and show the impact of the system parameters on the performance measures.

  • PDF

An Approximate Minimum Deficiency Ordering using Cliques (클릭을 이용한 근사최소 부족수 순서화)

  • Do Seungyong;Park Chan-Kyoo;Lee Sangwook;Park Soondal
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.05a
    • /
    • pp.386-393
    • /
    • 2003
  • For fast Cholesky factorization, it is most important to reduce the number of non-zero elements by ordering methods. Minimum deficiency ordering produces less non-zero elements. However, since it is very slow. the minimum degree algorithm is widely used. To improve the computation time, Rothberg's AMF uses an approximate deficiency instead of computing the deficiency. In this paper we present simple efficient methods to obtain a good approximate deficiency using information related to cliques. Experimental results show that our proposed method produces better ordering quality than that of AMF.

  • PDF

Study of the Efficient Aerodynamic Shape Design Optimization Using the Approximate Reliability Method (근사신뢰도기법을 이용한 효율적인 공력 형상 설계에 관한 연구)

  • Kim Suwhan.;Kwon Jang-Hyuk
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2004.10a
    • /
    • pp.187-191
    • /
    • 2004
  • The conventional reliability based design optimization(RBDO) methods require high computational cost compared with the deterministic design optimization(DO) methods. To overcome the computational inefficiency of RBDO, single loop methods have been proposed. These need less function calls than that of RBDO but much more than that of DO. In this study, the approximate reliability method is proposed that the computational requirement is nearly the same as DO and the reliability accuracy is good compared with that of RBDO. Using this method, the 3-D viscous aerodynamic shape design optimization with uncertainty is performed very efficiently.

  • PDF

A Domain-Partition Algorithm for the Large-Scale TSP (Large-Scale TSP 근사해법에 관한 연구)

  • Yoo, Hyeong-Seon;Kim, Hyun-Sng
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.9 no.3
    • /
    • pp.122-131
    • /
    • 1992
  • In this paper an approximate solution method for the large-scale Traveling Salesman Problem (TSP) is presented. The method starts with the subdivision of the problem domain into a number of cluster by considering their geometric characteristic. Each cluster has a limited number of nodes so as to get a local solution. They are linked go give the least pathe which covers the whole domain and become TSPs solution with start-and end-node. The approximate local solution in each cluster are obtained based on geometrical properties of the cluster, and combined to give an overall approximate solution for the larte-scale TSP.

  • PDF

Approximate Coordinate Transformations for Simulation of Turbulent Flows with Wall Deformation

  • Kang, Sangmo
    • Journal of Mechanical Science and Technology
    • /
    • v.16 no.5
    • /
    • pp.703-709
    • /
    • 2002
  • In the present paper, approximate coordinate transformations for simulation of turbulent flows with wall deformation, significantly reducing computational cost with little degradation in numerical accuracy, are presented. The Wavier-Stokes equations are coordinate-transformed with an approximation of Tailor-series truncation. The performance is evaluated by performing numerical simulations of a channel flow at Re$\sub$$\tau$/ = 140 with active wall motions of η$\sub$m/$\^$+/ $\leq$5. The approximate transformations provide flow structures as well as turbulence statistics in good agreement with those from a complete transformation [Phys. Fluids 12, 3301 (2000) ] and allow 25-30% savings in the CPU time as compared to the complete one.