• Title/Summary/Keyword: Approximate Technique

Search Result 421, Processing Time 0.022 seconds

A Sequential Approximate Optimization Technique Using the Previous Response Values (응답량 재사용을 통한 순차 근사최적설계)

  • Hwang Tae-Kyung;Choi Eun-Ho;Lim O-Kaung
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.29 no.1 s.232
    • /
    • pp.45-52
    • /
    • 2005
  • A general approximate optimization technique by sequential design domain(SDD) did not save response values for getting an approximate function in each step. It has a disadvantage at aspect of an expense. In this paper, previous response values are recycled for constructing an approximate function. For this reason, approximation function is more accurate. Accordingly, even if we did not determine move limit, a system is converged to the optimal design. Size and shape optimization using approximate optimization technique is carried out with SDD. Algorithm executing Pro/Engineer and ANSYS are automatically adopted in the approximate optimization program by SDD. Convergence criterion is defined such that optimal point must be located within SDD during the three steps. The PLBA(Pshenichny-Lim-Belegundu-Arora) algorithm is used to solve approximate optimization problems. This algorithm uses the second-order information in the direction finding problem and uses the active set strategy.

A NOTE ON APPROXIMATE SIMILARITY

  • Hadwin, Don
    • Journal of the Korean Mathematical Society
    • /
    • v.38 no.6
    • /
    • pp.1157-1166
    • /
    • 2001
  • This paper answers some old questions about approximate similarity and raises new ones. We provide positive evidence and a technique for finding negative evidence on the question of whether approximate similarity is the equivalence relation generated by approximate equivalence and similarity.

  • PDF

Optimization of Steel Box Girder Bridges using Approximate Reanalysis Technique (재해석 기법을 이용한 강상자형교의 최적설계)

  • Min, Dae-Hong;Yoon, Woo-Hyun;Chung, Jee-Seung;Yang, Sung-Don
    • Journal of the Korean Society of Safety
    • /
    • v.26 no.4
    • /
    • pp.80-86
    • /
    • 2011
  • Structural optimization algorithm of steel box girder bridges using improved higher-order approximate reanalysis technique is proposed in this paper. The proposed approximation method is a generalization of the convex approximation method. The order of the approximate reanalysis for each function is analytically adjusted in the optimization process. This self-adjusted capability makes the approximate structural analysis values conservative enough to maintain the optimum design point of the approximate problem. The efficiency of proposed optimazation algorithm, compared with conventional algorithm, is successfully demonstrated in the steel box girder bridges. The efficiency and robustness of proposed algorithm is also demonstrated in practical steel box girder bridges.

Energy-Efficient Approximate Speech Signal Processing for Wearable Devices

  • Park, Taejoon;Shin, Kyoosik;Kim, Nam Sung
    • ETRI Journal
    • /
    • v.39 no.2
    • /
    • pp.145-150
    • /
    • 2017
  • As wearable devices are powered by batteries, they need to consume as little energy as possible. To address this challenge, in this article, we propose a synergistic technique for energy-efficient approximate speech signal processing (ASSP) for wearable devices. More specifically, to enable the efficient trade-off between energy consumption and sound quality, we synergistically integrate an approximate multiplier and a successive approximate register analog-to-digital converter using our enhanced conversion algorithm. The proposed ASSP technique provides ~40% lower energy consumption with ~5% higher sound quality than a traditional one that optimizes only the bit width of SSP.

Study on Continuous Nearest Neighbor Query on Trajectory of Moving Objects (이동객체의 궤적에 대한 연속 최근접 질의에 관한 연구)

  • Chung, Ji-Moon
    • Journal of Digital Convergence
    • /
    • v.3 no.1
    • /
    • pp.149-163
    • /
    • 2005
  • Researches for NN(nearest neighbor) query which is often used in LBS system, have been worked. However. Conventional NN query processing techniques are usually meaningless in moving object management system for LBS since their results may be invalidated as soon as the query and data objects move. To solve these problems, in this paper we propose a new nearest neighbor query processing technique, called CTNN, which is possible to meet continuous trajectory nearest neighbor query processing. The proposed technique consists of Approximate CTNN technique which has quick response time, and Exact CTNN technique which makes it possible to search accurately nearest neighbor objects. Experimental results using GSTD datasets shows that the Exact CTNN technique has high accuracy, but has a little low performance for response time. They also shows that the Approximate CTNN technique has low accuracy comparing with the Exact CTNN, but has high response time.

  • PDF

Performance evaluation of approximate frequent pattern mining based on probabilistic technique (확률 기법에 기반한 근접 빈발 패턴 마이닝 기법의 성능평가)

  • Pyun, Gwangbum;Yun, Unil
    • Journal of Internet Computing and Services
    • /
    • v.14 no.1
    • /
    • pp.63-69
    • /
    • 2013
  • Approximate Frequent pattern mining is to find approximate patterns, not exact frequent patterns with tolerable variations for more efficiency. As the size of database increases, much faster mining techniques are needed to deal with huge databases. Moreover, it is more difficult to discover exact results of mining patterns due to inherent noise or data diversity. In these cases, by mining approximate frequent patterns, more efficient mining can be performed in terms of runtime, memory usage and scalability. In this paper, we study the characteristics of an approximate mining algorithm based on probabilistic technique and run performance evaluation of the efficient approximate frequent pattern mining algorithm. Finally, we analyze the test results for more improvement.

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.

Sequential Approximate Optimization Based on a Pure Quadratic Response Surface Method with Noise Filtering (노이즈 필터링을 적용한 반응표면 기반 순차적 근사 최적화)

  • Lee Yongbin;Lee Ho-Jun;Kim Min-Soo;Choi Dong-Hoon
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.29 no.6 s.237
    • /
    • pp.842-851
    • /
    • 2005
  • In this paper, a new method for constrained optimization of noisy functions is proposed. In approximate optimization using response surface methods, if constraints have severe noise, the approximate feasible region defined by approximate constraints is apt to include some of the infeasible region defined by actual constraints. This can cause the approximate optimum to converge into the infeasible region. In the proposed method, the approximate optimization is performed with the approximate constraints shifted by their deviations, which are calculated using a diagonal quadratic response surface method. This can prevent the approximate optimum from converging into the infeasible region. To fit the objective and constraints into diagonal quadratic models, we select the center and 4 additional points along each axis of design variables as experimental points. The deviation of each function is calculated using the differences between the real and approximate function values at the experimental points. A sequential approximate optimization technique based on the trust region algorithm is adopted to manage approximate models. The proposed approach is validated by solving some design problems. The results of the problems show the effectiveness of the proposed method.

Analysis of Rock Slope Stability Based on Fuzzy Approximate Reasoning (퍼지근사추론법에 의한 암반사면의 안정해석)

  • 기완서;김삼석;주승완
    • The Journal of Engineering Geology
    • /
    • v.11 no.2
    • /
    • pp.153-161
    • /
    • 2001
  • The quantitative evaluation of the stereo graphic projection, the limit equilibrium analysis, the finite difference analysis, the distinct element methocI is a analytical evaluation using many variables. Through the reliability analysis by the point estimation technique, uncertainty of other variables that have an effect on the stability of the rock slo~ was considered. The organized evaluation method of the approximate reasoning concept and using a fuzzy language was developed to confer and analysis the failure factors in planning and constructing the rock slope. Considering the result of the an- alysis, it was demonstrated that stability of entire sections can be evaluated through reliability analysis of point estimation technique. The results of stability evaluation by Fuzzy Approximate Reasoning is generally identical with the results of other existirw; analyses. As mentioned above, general and organized evaluation of special qualities of rock slope is possible using RMR Classification, Stereo Graphic Projection, Limit Equilibriwn Analysis, Finite Difference Analysis, Distinct Element Method, Point Estimation Technique, and Fuzzy Approximate Reasoning.

  • PDF

Study on Continuous Nearest Neighbor Query on Trajectory of Moving Objects (이동객체의 궤적에 대한 연속 최근접 질의에 관한 연구)

  • Jeong, Ji-Mun
    • 한국디지털정책학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.517-530
    • /
    • 2005
  • Researches for NN(nearest neighbor) query which is often used in LBS system, have been worked. However, Conventional NN query processing techniques are usually meaningless in moving object management system for LBS since their results may be invalidated as soon as the query and data objects move. To solve these problems, in this paper we propose a new nearest neighbor query processing technique, called CTNN, which is possible to meet continuous trajectory nearest neighbor query processing. The proposed technique consists of Approximate CTNN technique which has quick response time, and Exact CTNN technique which makes it possible to search accurately nearest neighbor objects. Experimental results using GSTD datasets showed that the Exact CTNN technique has high accuracy, but has a little low performance for response time. They also showed that the Approximate CTNN technique has low accuracy comparing with the Exact CTNN, but has high response time.

  • PDF