• Title/Summary/Keyword: Continuous Approximation

Search Result 209, Processing Time 0.02 seconds

CONSTRUCTIVE APPROXIMATION BY NEURAL NETWORKS WITH POSITIVE INTEGER WEIGHTS

  • HONG, BUM IL;HAHM, NAHMWOO
    • Korean Journal of Mathematics
    • /
    • 제23권3호
    • /
    • pp.327-336
    • /
    • 2015
  • In this paper, we study a constructive approximation by neural networks with positive integer weights. Like neural networks with real weights, we show that neural networks with positive integer weights can even approximate arbitrarily well for any continuous functions on compact subsets of $\mathbb{R}$. We give a numerical result to justify our theoretical result.

STABILITY OF THE $\bar\partial$-ESTIMATES AND THE MERGELYAN PROPERTY FOR WEAKLY q-CONVEX MANIFOLDS

  • Seo, Yeon-Seok
    • East Asian mathematical journal
    • /
    • 제24권3호
    • /
    • pp.263-274
    • /
    • 2008
  • Let $r\;{\geq}\;q$. We get the stability of the estimates of the $\bar{\partial}$-Neumann problem for (p, r)-forms on a weakly q-convex complex submanifold. As a by-product of the stability of the $\bar{\partial}$-estimates, we get the Mergelyan approximation property for (p, r)-forms on a weakly q-convex complex submanifold which satisfies property (P).

  • PDF

가변 사구간을 갖는 적응 퍼지 제어기 (Adaptive Fuzzy Controller with Variable Deadzone)

  • 구근모
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 1998년도 춘계학술대회 학술발표 논문집
    • /
    • pp.39-42
    • /
    • 1998
  • This paper proposes an adaptive fuzzy control scheme for a class of continuous-time nonlinear dynamic systems for which an explicit linear parameterization of the uncertainty is either unknown or impossible. In order to improve robustness under approximation errors and disturbances the proposed scheme includes deadzone in adaptation laws which varies its size adaptively. The assumption of known bounds on the approximation errors and disturbances is not required since those are estimated using adaptation laws. The overall adaptive scheme is proven to guarantee uniform ultimate boundedness in the Lyapunov sense.

  • PDF

서비스 비용을 고려한 연속적 재고관리시스템 해결을 위한 근사법 (An Approximation Approach for Solving a Continuous Review Inventory System Considering Service Cost)

  • 이동주;이창용
    • 산업경영시스템학회지
    • /
    • 제38권2호
    • /
    • pp.40-46
    • /
    • 2015
  • The modular assembly system can make it possible for the variety of products to be assembled in a short lead time. In this system, necessary components are assembled to optional components tailor to customers' orders. Budget for inventory investments composed of inventory and purchasing costs are practically limited and the purchasing cost is often paid when an order is arrived. Service cost is assumed to be proportional to service level and it is included in budget constraint. We develop a heuristic procedure to find a good solution for a continuous review inventory system of the modular assembly system with a budget constraint. A regression analysis using a quadratic function based on the exponential function is applied to the cumulative density function of a normal distribution. With the regression result, an efficient heuristics is proposed by using an approximation for some complex functions that are composed of exponential functions only. A simple problem is introduced to illustrate the proposed heuristics.

예산의 계약이 있는 다품종 연속적 재고 관리 문제에서 추정을 통한 해법 (An Approximation Approach for A Multi-Product Continuous Review Inventory Problem with Budget Constraint)

  • 이동주;유재욱;이문수
    • 산업경영시스템학회지
    • /
    • 제31권4호
    • /
    • pp.134-139
    • /
    • 2008
  • Most approaches for continuous review inventory problem need tables for loss function and cumulative standard normal distribution. Furthermore, it is time-consuming to calculate order quantity (Q) and reorder point (r) iteratively until required values are converged. The purpose of this paper is to develop a direct method to get the solution without any tables. We used approximation approaches for loss function and cumulative standard normal distribution. The proposed method can get the solution directly without any iterative procedure for Q, r and without any tables. The performance of the proposed approach is tested by using numerical examples. The budget constraint of this paper assumes that purchasing costs are paid at the time an order is arrived. This constraint can be easily replaced by capacity constraint or budget constraint in which' purchasing costs are paid at the time an order is placed.

A Fast Scheme for Inverting Single-Hole Electromagnetic Data

  • Kim Hee Joon;Lee Jung-Mo;Lee Ki Ha
    • 대한자원환경지질학회:학술대회논문집
    • /
    • 대한자원환경지질학회 2002년도 춘계 공동학술발표회
    • /
    • pp.167-169
    • /
    • 2002
  • The extended Born, or localized nonlinear approximation of integral equation (IE) solution has been applied to inverting single-hole electromagnetic (EM) data using a cylindrically symmetric model. The extended Born approximation is less accurate than a full solution but much superior to the simple Born approximation. When applied to the cylindrically symmetric model with a vertical magnetic dipole source, however, the accuracy of the extended Born approximation is greatly improved because the electric field is scalar and continuous everywhere. One of the most important steps in the inversion is the selection of a proper regularization parameter for stability. Occam's inversion (Constable et al., 1987) is an excellent method for obtaining a stable inverse solution. It is extremely slow when combined with a differential equation method because many forward simulations are needed but suitable for the extended Born solution because the Green's functions, the most time consuming part in IE methods, are repeatedly re-usable throughout the inversion. In addition, the If formulation also readily contains a sensitivity matrix, which can be revised at each iteration at little expense. The inversion algorithm developed in this study is quite stable and fast even if the optimum regularization parameter Is sought at each iteration step. Tn this paper we show inversion results using synthetic data obtained from a finite-element method and field data as well.

  • PDF

함수근사와 규칙추출을 위한 클러스터링을 이용한 강화학습 (Reinforcement Learning with Clustering for Function Approximation and Rule Extraction)

  • 이영아;홍석미;정태충
    • 한국정보과학회논문지:소프트웨어및응용
    • /
    • 제30권11호
    • /
    • pp.1054-1061
    • /
    • 2003
  • 강화학습의 대표적인 알고리즘인 Q-Learning은 상태공간의 모든 상태-행동 쌍(state-action pairs)의 평가값이 수렴할 때까지 반복해서 경험하여 최적의 전략(policy)을 얻는다. 상태공간을 구성하는 요소(feature)들이 많거나 요소의 데이타 형태가 연속형(continuous)인 경우, 상태공간은 지수적으로 증가하게 되어, 모든 상태들을 반복해서 경험해야 하고 모든 상태-행동 쌍의 Q값을 저장하는 것은 시간과 메모리에 있어서 어려운 문제이다. 본 논문에서는 온라인으로 학습을 진행하면서 비슷한 상황의 상태들을 클러스터링(clustering)하고 새로운 경험에 적응해서 클러스터(cluster)의 수정(update)을 반복하여, 분류된 최적의 전략(policy)을 얻는 새로운 함수근사(function approximation)방법인 Q-Map을 소개한다. 클러스터링으로 인해 정교한 제어가 필요한 상태(state)는 규칙(rule)으로 추출하여 보완하였다. 미로환경과 마운틴 카 문제를 제안한 Q-Map으로 실험한 결과 분류된 지식을 얻을 수 있었으며 가시화된(explicit) 지식의 형태인 규칙(rule)으로도 쉽게 변환할 수 있었다.

보험 상품 파산 확률 근사 방법의 개선 연구 (An Improvement of the Approximation of the Ruin Probability in a Risk Process)

  • 이혜선;최승경;이의용
    • 응용통계연구
    • /
    • 제22권5호
    • /
    • pp.937-942
    • /
    • 2009
  • 본 논문에서는 보험 상품의 잉여금(surplus)을 확률적으로 모형화한 후, 잉여금의 파산 확률과 이의 근사 공식들을 소개한다. 잉여금은 일정한 율(rate)로 들어오는 프리미엄(premium)에 의해 증가한다. 보험금 청구(claim)는 포아송 과정(Poisson process)을 따라 발생하고 보험금 청구가 있을 때마다 잉여금은 임의의 양(random amount) 만큼 줄어든다. 잉여금이 0이하로 떨어지면 파산(ruin)이 발생한다고 한다. 이와 같은 리스크(risk) 모형에서 파산 확률의 이론적 공식은 잘 알려져 있으나, 공식에 n차 공률(convolution)과 무한 합(infinite sum)이 포함되어 있어 실질적인 계산은 불가능하다. 본 논문에서는 잘 알려진 De Vylder의 근사 공식과 지수적인 근사 공식(exponential approximation)을 소개하고, 이들을 일반화한 새로운 근사 공식을 제안한다. 기존 근사 공식과의 수치적 비교를 통해 새로 제안된 근사 공식의 우월성을 보인다.

STRONG CONVERGENCE THEOREMS BY VISCOSITY APPROXIMATION METHODS FOR ACCRETIVE MAPPINGS AND NONEXPANSIVE MAPPINGS

  • Chang, Shih-Sen;Lee, H.W. Joseph;Chan, Chi Kin
    • Journal of applied mathematics & informatics
    • /
    • 제27권1_2호
    • /
    • pp.59-68
    • /
    • 2009
  • In this paper we present an iterative scheme for finding a common element of the set of zero points of accretive mappings and the set of fixed points of nonexpansive mappings in Banach spaces. By using viscosity approximation methods and under suitable conditions, some strong convergence theorems for approximating to this common elements are proved. The results presented in the paper improve and extend the corresponding results of Kim and Xu [Nonlinear Anal. TMA 61 (2005), 51-60], Xu [J. Math. Anal. Appl., 314 (2006), 631-643] and some others.

  • PDF

Full-Range Analytic Drain Current Model for Depletion-Mode Long-Channel Surrounding-Gate Nanowire Field-Effect Transistor

  • Yu, Yun Seop
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • 제13권4호
    • /
    • pp.361-366
    • /
    • 2013
  • A full-range analytic drain current model for depletion-mode long-channel surrounding-gate nanowire field-effect transistor (SGNWFET) is proposed. The model is derived from the solution of the 1-D cylindrical Poisson equation which includes dopant and mobile charges, by using the Pao-Sah gradual channel approximation and the full-depletion approximation. The proposed model captures the phenomenon of the bulk conduction mechanism in all regions of device operation (subthreshold, linear, and saturation regions). It has been shown that the continuous model is in complete agreement with the numerical simulations.