• 제목/요약/키워드: approximate

검색결과 4,330건 처리시간 0.032초

Analytical approximate solution for Initial post-buckling behavior of pipes in oil and gas wells

  • Yu, Yongping;Sun, Youhong;Han, Yucen
    • Coupled systems mechanics
    • /
    • 제1권2호
    • /
    • pp.155-163
    • /
    • 2012
  • This paper presents analytical approximate solutions for the initial post-buckling deformation of the pipes in oil and gas wells. The governing differential equation with sinusoidal nonlinearity can be reduced to form a third-order-polynomial nonlinear equation, by coupling of the well-known Maclaurin series expansion and orthogonal Chebyshev polynomials. Analytical approximations to the resulting boundary condition problem are established by combining the Newton's method with the method of harmonic balance. The linearization is performed prior to proceeding with harmonic balancing thus resulting in a set of linear algebraic equations instead of one of non-linear algebraic equations, unlike the classical method of harmonic balance. We are hence able to establish analytical approximate solutions. The approximate formulae for load along axis, and periodic solution are established for derivative of the helix angle at the end of the pipe. Illustrative examples are selected and compared to "reference" solution obtained by the shooting method to substantiate the accuracy and correctness of the approximate analytical approach.

APPROXIMATE SOLUTIONS TO ONE-DIMENSIONAL BACKWARD HEAT CONDUCTION PROBLEM USING LEAST SQUARES SUPPORT VECTOR MACHINES

  • Wu, Ziku;Li, Fule;Kwak, Do Young
    • 충청수학회지
    • /
    • 제29권4호
    • /
    • pp.631-642
    • /
    • 2016
  • This article deals with one-dimension backward heat conduction problem (BHCP). A new approach based on least squares support vector machines (LS-SVM) is proposed for obtaining their approximate solutions. The approximate solution is presented in closed form by means of LS-SVM, whose parameters are adjusted to minimize an appropriate error function. The approximate solution consists of two parts. The first part is a known function that satisfies initial and boundary conditions. The other is a product of two terms. One term is known function which has zero boundary and initial conditions, another term is unknown which is related to kernel functions. This method has been successfully tested on practical examples and has yielded higher accuracy and stable solutions.

근사함수방법을 이용한 실시간 다물체 차량 동역학 모델 (Approximate Function Method for Real Time Multibody Vehicle Dynamics Model)

  • 김성수;이창호;정완희;이선호
    • 한국자동차공학회논문집
    • /
    • 제14권6호
    • /
    • pp.57-65
    • /
    • 2006
  • An approximate function approach has been developed using the subsystem synthesis method for real-time multibody vehicle dynamics models. In this approach, instead of solving loop closure constraint equations of the suspension linkage, approximate functions are used. The approximate function represents the functional relationship between dependent coordinates and independent coordinates of the suspension subsystem. This kinematic relationship is also included in the suspension subsystem equations of motion. Different order of polynomial functions are tried to find out the best candidate functions. The proposed method is also compared with the conventional subsystem synthesis method to verify its efficiency and accuracy.

AN APPROXIMATE GREEDY ALGORITHM FOR TAGSNP SELECTION USING LINKAGE DISEQUILIBRIUM CRITERIA

  • Wang, Ying;Feng, Enmin;Wang, Ruisheng
    • Journal of applied mathematics & informatics
    • /
    • 제26권3_4호
    • /
    • pp.493-500
    • /
    • 2008
  • In this paper, we first construct a mathematical model for tagSNP selection based on LD measure $r^2$, then aiming at this kind of model, we develop an efficient algorithm, which is called approximate greedy algorithm. This algorithm is able to make up the disadvantage of the greedy algorithm for tagSNP selection. The key improvement of our approximate algorithm over greedy algorithm lies in that it adds local replacement(or local search) into the greedy search, tagSNP is replaced with the other SNP having greater similarity degree with it, and the local replacement is performed several times for a tagSNP so that it can improve the tagSNP set of the local precinct, thereby improve tagSNP set of whole precinct. The computational results prove that our approximate greedy algorithm can always find more efficient solutions than greedy algorithm, and improve the tagSNP set of whole precinct indeed.

  • PDF

중학교의 근사값 지도를 위한 교수-학습 자료 연구 (A Study on the Teaching-Learning Materials about Approximation in Math History for the Middle School Education)

  • 조성범
    • 한국학교수학회논문집
    • /
    • 제1권1호
    • /
    • pp.185-196
    • /
    • 1998
  • This study is undertaken to clarify the evolution of the mathematics regarding the $\pi$ ratio, square root, trigonometric ration which are dealing by approximate value according to the curriculum of Korean Middle School and its subsequent growth of methods for attaining the approximate value. Furthermore a brief survey has been thought for assessing the significance of the core of approximate value and its utility which will be given a guide line to many young learners. I'd better teach these historical background to the students and it makes clear the approximate value and the content about the approximate value. This research should help to improve the student's ability of solving a problem by making them think it mathematically through the life and the effort of the mathematician.

  • PDF

Secure Blocking + Secure Matching = Secure Record Linkage

  • Karakasidis, Alexandros;Verykios, Vassilios S.
    • Journal of Computing Science and Engineering
    • /
    • 제5권3호
    • /
    • pp.223-235
    • /
    • 2011
  • Performing approximate data matching has always been an intriguing problem for both industry and academia. This task becomes even more challenging when the requirement of data privacy rises. In this paper, we propose a novel technique to address the problem of efficient privacy-preserving approximate record linkage. The secure framework we propose consists of two basic components. First, we utilize a secure blocking component based on phonetic algorithms statistically enhanced to improve security. Second, we use a secure matching component where actual approximate matching is performed using a novel private approach of the Levenshtein Distance algorithm. Our goal is to combine the speed of private blocking with the increased accuracy of approximate secure matching.

샘플링시간에 대한 근사 샘플치 비선형 관측기 (On time-wise approximate nonlinear observer for sampled-data nonlinear systems)

  • 정선태
    • 전자공학회논문지B
    • /
    • 제33B권2호
    • /
    • pp.28-36
    • /
    • 1996
  • By utilizing the interinsic structure of the underlying continous-time nonlinear system, one can design an approximate sampled-data observer improved with respect ot the sampling-time for the systems. In this paper, we characterize the conditions for the solvability of the improved approximate sampled-data nonlinear observer design problem. In particular, it is shown that when the dimension of the state space is two, the nonlinear systems for which it is possible ot desing 3rd or higher order approximate sampled-data nonlinear observer are locally state-equivalent to an observable bilinear system. The practical implication is that seeking higher order approximate sampled-data nonlinear observer for nonlinear systems is very restricted.

  • PDF

The Impact of Network Coding Cluster Size on Approximate Decoding Performance

  • Kwon, Minhae;Park, Hyunggon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권3호
    • /
    • pp.1144-1158
    • /
    • 2016
  • In this paper, delay-constrained data transmission is considered over error-prone networks. Network coding is deployed for efficient information exchange, and an approximate decoding approach is deployed to overcome potential all-or-nothing problems. Our focus is on determining the cluster size and its impact on approximate decoding performance. Decoding performance is quantified, and we show that performance is determined only by the number of packets. Moreover, the fundamental tradeoff between approximate decoding performance and data transfer rate improvement is analyzed; as the cluster size increases, the data transfer rate improves and decoding performance is degraded. This tradeoff can lead to an optimal cluster size of network coding-based networks that achieves the target decoding performance of applications. A set of experiment results confirms the analysis.

Choosing between the Exact and the Approximate Confidence Intervals: For the Difference of Two Independent Binomial Proportions

  • Lee, Seung-Chun
    • Communications for Statistical Applications and Methods
    • /
    • 제16권2호
    • /
    • pp.363-372
    • /
    • 2009
  • The difference of two independent binomial proportions is frequently of interest in biomedical research. The interval estimation may be an important tool for the inferential problem. Many confidence intervals have been proposed. They can be classified into the class of exact confidence intervals or the class of approximate confidence intervals. Ore may prefer exact confidence interval s in that they guarantee the minimum coverage probability greater than the nominal confidence level. However, someone, for example Agresti and Coull (1998) claims that "approximation is better than exact." It seems that when sample size is large, the approximate interval is more preferable to the exact interval. However, the choice is not clear when sample, size is small. In this note, an exact confidence and an approximate confidence interval, which were recommended by Santner et al. (2007) and Lee (2006b), respectively, are compared in terms of the coverage probability and the expected length.

해상에서의 선속 손실량 산정을 위한 약산식 개발 연구 (A Research on the Approximate Formulae for the Speed Loss at Sea)

  • 권영중;김대영
    • 한국해양공학회지
    • /
    • 제19권2호
    • /
    • pp.90-93
    • /
    • 2005
  • An improved approximate formula is presented for Series 60 forms, modifying the approximate formula, developed by the Author in 1983. The weather formula is based on interpretations of detailed calculations of speed loss, due to wind(van Berlekom), motions(Maruo), and wave reflection resistance(Kwon). Comparison is made between the result of the approximate formula and the one of detailed calculation. The result of the formula is also compared with some published full-scale data for speed loss.