• Title/Summary/Keyword: approximation algorithm

Search Result 983, Processing Time 0.027 seconds

Design of Distributed Modal Transducer by Optimizing Gain-weights of Interface Circuit (인터페이스 회로의 이득 최적화를 통한 분포형 모달 변환기의 설계)

  • 김지철;황준석;유정규;김승조
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 1998.04a
    • /
    • pp.444-449
    • /
    • 1998
  • A modal transducer in two-dimensional structure can be implemented by varying the distributed transducer's gain spatially. In this paper, a method based on finite element method is developed for optimizing spatial gain distribution of PVDF transducer to create the modal transducer for specific modes. Using this concept, one can design the modal transducer in two-dimensional structure having arbitrary geometry and boundary conditions. As a practical means for implementing this continuous gain distribution without repoling die PVDF film, the gain distribution is approximated by optimizing gain-weights of interface circuit. The whole spatial area of the PVDF film is divided into several electrode segments and the signals from each segment are properly weighted and summed by interface circuit. This corresponds to the approximation of a continuous function using discrete values. The electrode partition is optimized using the genetic algorithm. Gain-weights are optimized using the simplex search method. A modal sensor for first to fourth modes of aluminum plate is designed using PVDF film with gain-weighted interface circuit. Various lamination angles of PVDF film are taken into consideration to utilize the anisotropy of the PVDF film. Performance of the optimized' PVDF sensor is demonstrated by numerical simulations..

  • PDF

Wave Transformation Due to Energy Dissipation Region (에너지 감쇠영역으로 인한 파랑변형)

  • 윤종태
    • Journal of Korean Society of Coastal and Ocean Engineers
    • /
    • v.11 no.3
    • /
    • pp.135-140
    • /
    • 1999
  • To simulate the wave transformation by an energy dissipation region, a numerical model is suggested by discretizing the elliptic mild-slope equation. Generalized conjugate gradient method is used as solution algorithm to apply parabolic approximation to open boundary condition. To demonstrate the applicabil-ity of the numerical procedure suggested, the wave scattering by a circular damping region is examined. The feature of reflection in front of the damping region is captured clearly by the numerical solution. The effect of the size of dissipation coefficient is examined for a rectangular damping region. The recovery of wave height by diffraction occurs very slowly with distance behind the damping region.

  • PDF

A cognitive model for forecasting progress of multiple disorders with time relationship

  • Kim, Soung-Hie;Park, Wonseek;Chae, In-Ho
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1996.04a
    • /
    • pp.505-510
    • /
    • 1996
  • Many diseases cause other diseases with strength of influences and time intervals. Prognostic and therapeutic assessments are the important part of clinical medicine as well as diagnostic assessments. In cases where a patient already has manufestations of multiple disorders (complications), progress forecasting and therapy decision by physicians without support tools are very dificult: physicians often say that "Once complications set in, the patient may die". Treating complications are difficult tasks for physicians, because they have to consider all of the complexities, possibilities and interactions between the diseases. The prediction of multiple disorders has many bundles that arise from such time-dependent interrelationships between diseases and nonlinear progress. This paper proposes a model based on time-dependent influences, which appropriately describes the progress of mulitple disorders, and gives some modificaitons for applying this model to medical domains: time-dependent influence matrix manifestation vector, therapy efficacy matrix, S-shaped curve approximation, definitions of which are provided. This research proposes an algorithm for forecasting the state of each disease on the time horizon and for evaluation of therapy alternatives with not toy example, but real patient history of multiple disorders.disorders.

  • PDF

FINITE-DIFFERENCE BISECTION ALGORITHMS FOR FREE BOUNDARIES OF AMERICAN OPTIONS

  • Kang, Sunbu;Kim, Taekkeun;Kwon, Yonghoon
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.19 no.1
    • /
    • pp.1-21
    • /
    • 2015
  • This paper presents two algorithms based on the Jamshidian equation which is from the Black-Scholes partial differential equation. The first algorithm is for American call options and the second one is for American put options. They compute numerically free boundary and then option price, iteratively, because the free boundary and the option price are coupled implicitly. By the upwind finite-difference scheme, we discretize the Jamshidian equation with respect to asset variable s and set up a linear system whose solution is an approximation to the option value. Using the property that the coefficient matrix of this linear system is an M-matrix, we prove several theorems in order to formulate a bisection method, which generates a sequence of intervals converging to the fixed interval containing the free boundary value with error bound h. These algorithms have the accuracy of O(k + h), where k and h are step sizes of variables t and s, respectively. We prove that they are unconditionally stable. We applied our algorithms for a series of numerical experiments and compared them with other algorithms. Our algorithms are efficient and applicable to options with such constraints as r > d, $r{\leq}d$, long-time or short-time maturity T.

Downlink Performance of Distributed Antenna Systems in MIMO Composite Fading Channel

  • Xu, Weiye;Wang, Qingyun;Wang, Ying;Wu, Binbin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.10
    • /
    • pp.3342-3360
    • /
    • 2014
  • In this paper, the capacity and BER performance of downlink distributed antenna systems (DAS) with transmit antenna selection and multiple receive antennas are investigated in MIMO composite channel, where path loss, Rayleigh fading and lognormal shadowing are all considered. Based on the performance analysis, using the probability density function (PDF) of the effective SNR and numerical integrations, tightly-approximate closed-form expressions of ergodic capacity and average BER of DAS are derived, respectively. These expressions have more accuracy than the existing expressions, and can match the simulation well. Besides, the outage capacity of DAS is also analyzed, and a tightly-approximate closed-form expression of outage capacity probability is derived. Moreover, a practical iterative algorithm based on Newton's method for finding the outage capacity is proposed. To avoid iterative calculation, another approximate closed-form outage capacity is also derived by utilizing the Gaussian distribution approximation. With these theoretical expressions, the downlink capacity and BER performance of DAS can be effectively evaluated. Simulation results show that the theoretical analysis is valid, and consistent with the corresponding simulation.

The Method to Process Approximate k-Nearest Neighbor Queries in Spatial Database Systems (공간 데이터베이스 시스템에서 근사 k-최대근접질의의 처리방법)

  • 선휘준;김홍기
    • Journal of the Korea Computer Industry Society
    • /
    • v.4 no.4
    • /
    • pp.443-448
    • /
    • 2003
  • Approximate k-nearest neighbor queries are frequently occurred for finding the k nearest neighbors to a given query point in spatial database systems. The number of searched nodes in an index must be minimized in order to increase the performance of approximate k nearest neighbor queries. In this paper. we suggest the technique of approximate k nearest neighbor queries on R-tree family by improving the existing algorithm and evaluate the performance of the proposed method in dynamic spatial database environments. The simulation results show that a proposed method always has a low number of disk access irrespective of object distribution, size of nearest neighbor queries and approximation rates as compared with an existing method.

  • PDF

Switching Element-Disjoint Multicast Scheduling for Avoiding Crosstalk in Photonic Banyan-Type Switching Networks (Part II):Scheduling Lengths and Nonblocking Property (광 베니언-유형 교환 망에서의 누화를 회피하기 위한 교환소자를 달리하는 멀티캐스트 스케줄링(제2부):스케줄링 길이 및 넌블럭킹 특성)

  • Tscha, Yeong-Hwan
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.4
    • /
    • pp.657-664
    • /
    • 2001
  • In our predecessor paper(Part I)[13], we introduced a graph that represents the crosstalk relationship among multicast connections in the photonic Banyan-type switching network, and found the upper bound on the degree of it. In this paper(Part II), we consider the number of routing rounds(i.e., scheduling length) required for SE(switching element)-disjoint multicasting in photonic Banyan-type switching networks. Unfortunately, the problem to find an optimal scheduling length is NP-complete thus, we propose an approximation algorithm that gives its scheduling length is always within double of the upper bound on the optimal length. We also study the scheduling length on the Iink-disjoint(i.e., nonblocking) multicasting. Various nonblocking Banyan-type multicasting networks are found under the scheduling lengths.

  • PDF

Efficiency and Robustness of Fully Adaptive Simulated Maximum Likelihood Method

  • Oh, Man-Suk;Kim, Dai-Gyoung
    • Communications for Statistical Applications and Methods
    • /
    • v.16 no.3
    • /
    • pp.479-485
    • /
    • 2009
  • When a part of data is unobserved the marginal likelihood of parameters given the observed data often involves analytically intractable high dimensional integral and hence it is hard to find the maximum likelihood estimate of the parameters. Simulated maximum likelihood(SML) method which estimates the marginal likelihood via Monte Carlo importance sampling and optimize the estimated marginal likelihood has been used in many applications. A key issue in SML is to find a good proposal density from which Monte Carlo samples are generated. The optimal proposal density is the conditional density of the unobserved data given the parameters and the observed data, and attempts have been given to find a good approximation to the optimal proposal density. Algorithms which adaptively improve the proposal density have been widely used due to its simplicity and efficiency. In this paper, we describe a fully adaptive algorithm which has been used by some practitioners but has not been well recognized in statistical literature, and evaluate its estimation performance and robustness via a simulation study. The simulation study shows a great improvement in the order of magnitudes in the mean squared error, compared to non-adaptive or partially adaptive SML methods. Also, it is shown that the fully adaptive SML is robust in a sense that it is insensitive to the starting points in the optimization routine.

A Parametric Study on the Springback Considering the Stress Variability in Explicit Finite Element Analysis (외연적 유한요소해석에서의 응력 변동성을 고려한 스프링백 영향 인자 연구)

  • Lee K. D.;Kwon J. W.;Jun B. H.;Kim S. J.;Kim H. J.
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 2000.10a
    • /
    • pp.136-140
    • /
    • 2000
  • It is desirable to predict springback quantitatively and accurately for the tool and process design in sheet stamping operations, however, it is blown very difficult. The result of springback analysis by the finite element method is sensitively influenced by numerical factors such as blank element size, number of integration point, punch velocity, contact algorithm etc. In the present work, a parametric study by Taguchi method is performed in order to evaluate the influence of numerical factors on springback Quantitatively and to obtain the combination of numerical factors which yields the best approximation to experimental data. Since springback is determined by the residual stress after forming process, it is important to evaluate stress distribution accurately. The oscillation in the time history curve of stress obtained by explicit FEM says that the stress solution at termination time is in very unstable state. Therefore, a variability study is also carried out in this study in order to assess the stability of implicit springback analysis starting from the stress solution by explicit forming simulation. The 2D draw bending process, one of the NUMISHEET '93 benchmark problems, is adopted as an application model.

  • PDF

Decomposition-based Process Planning far Layered Manufacturing of Functionally Gradient Materials (기능성 경사복합재의 적층조형을 위한 분해기반 공정계획)

  • Shin K.H.;Kim S.H.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.11 no.3
    • /
    • pp.223-233
    • /
    • 2006
  • Layered manufacturing(LM) is emerging as a new technology that enables the fabrication of three dimensional heterogeneous objects such as Multi-materials and Functionally Gradient Materials (FGMs). Among various types of heterogeneous objects, more attention has recently paid on the fabrication of FGMs because of their potentials in engineering applications. The necessary steps for LM fabrication of FGMs include representation and process planning of material information inside an FGM. This paper introduces a new process planning algorithm that takes into account the processing of material information. The detailed tasks are discretization (i.e., decomposition-based approximation of volume fraction), orientation (build direction selection), and adaptive slicing of heterogeneous objects. In particular, this paper focuses on the discretization process that converts all of the material information inside an FGM into material features like geometric features. It is thus possible to choose an optimal build direction among various pre-selected ones by approximately estimating build time. This is because total build time depends on the complexity of features. This discretization process also allows adaptive slicing of heterogeneous objects to minimize surface finish and material composition error. In addition, tool path planning can be simplified into fill pattern generation. Specific examples are shown to illustrate the overall procedure.