• Title/Summary/Keyword: Curve number

Search Result 1,417, Processing Time 0.03 seconds

Offsetting Curves Using Trigonometric Splines for Contour Cutting (윤곽 가공을 위한 삼각 스플라인을 이용한 오프셋 곡선의 생성)

  • Gu, Jiu-long;Yun, Jae-Deuk;Jung, Yoong-Ho
    • Korean Journal of Computational Design and Engineering
    • /
    • v.15 no.4
    • /
    • pp.253-260
    • /
    • 2010
  • This paper presents algorithms for computing offsets of freeform curves. The approach first divides the original curve into several segments at the inflexion points. Based on the obtained new control polygon and its offsets, quadratic trigonometric splines are constructed to approximate the offset curves. Finally, the shape parameter value of trigonometric spline is determined to satisfy the required tolerance. The degree of the output curve is two, independent of the original curve's degree. Because of the great controllability, the proposed method can generate a completely overestimating offset curve by adjusting the value of the shape parameter, which guarantees no overcutting in NC machining. Furthermore, it also produces the lowest number of control points compared with other works.

Comparison of Rating Methods for the Floor Impact Noise (바닥충격음 평가방법 중 단일수치평가량과 dB(A) 비교)

  • Park, Cheol-Yong;Jang, Dong-Woon
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2006.11a
    • /
    • pp.612-615
    • /
    • 2006
  • In this study, we compared and analyzed the floor impact noise insulation performance produced by the rating methods. The rating methods are using reversed A-weighting curve, A-weighted sound pressure levels(dB(A)). The results of this study are(1)dB(A) by the specified frequency is 0.5dB(A) at light weight and 2.5dB(A) at heavy weight upper than all pass dB(A)(2)the rating using reversed A-weighting curve is 5dB lower than dB(A)(3)the number of rating using reversed A-weighting curve mainly depends on impact noise pressure level of 63Hz in heavy weight but dB(A) does not.

  • PDF

Comparison of Jump-Preserving Smoothing and Smoothing Based on Jump Detector

  • Park, Dong-Ryeon
    • Communications for Statistical Applications and Methods
    • /
    • v.16 no.3
    • /
    • pp.519-528
    • /
    • 2009
  • This paper deals with nonparametric estimation of discontinuous regression curve. Quite number of researches about this topic have been done. These researches are classified into two categories, the indirect approach and direct approach. The major goal of the indirect approach is to obtain good estimates of jump locations, whereas the major goal of the direct approach is to obtain overall good estimate of the regression curve. Thus it seems that two approaches are quite different in nature, so people say that the comparison of two approaches does not make much sense. Therefore, a thorough comparison of them is lacking. However, even though the main issue of the indirect approach is the estimation of jump locations, it is too obvious that we have an estimate of regression curve as the subsidiary result. The point is whether the subsidiary result of the indirect approach is as good as the main result of the direct approach. The performance of two approaches is compared through a simulation study and it turns out that the indirect approach is a very competitive tool for estimating discontinuous regression curve itself.

A collision-free path planning using linear parametric curve based on circular workspace geometry mapping (원형작업공간의 기하투영에 의한 일차 매개 곡선을 이용한 충돌회피 궤적 계획)

  • 남궁인
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.896-899
    • /
    • 1996
  • A new algorithm for planning a collision free path is developed based on linear parametric curve. A collision-free path is viewed as a connected space curve in which the path consists of two straight curve connecting start to target point. A single intermediate connection point is considered in this paper and is used to manipulate the shape of path by organizing the control point in polar coordinate (.theta.,.rho.). The algorithm checks interference with obstacles, defined as GM (Geometry Mapping), and maps obstacles in Euclidean Space into images in CPS (Connection Point Space). The GM for all obstacles produces overlapping images of obstacle in CPS. The clear area of CPS that is not occupied by obstacle images represents collision-free paths in Euclidean Space. Any points from the clear area of CPS is a candidate for a collision-free path. A simulation of GM for number of cases are carried out and results are presented including mapped images of GM and performances of algorithm.

  • PDF

Estimation of Generalized Soil-Water Characteristic Curves Using Liquid Limit State (액성한계상태를 이용한 흙-수분 특성곡선의 평가)

  • Sung, Sang-Gyu;Lee, In-Mo
    • Proceedings of the Korean Geotechical Society Conference
    • /
    • 2004.03b
    • /
    • pp.146-153
    • /
    • 2004
  • The goals of this study are to investigate the feasibility of the reference state approach in determining the generalized soil-water characteristic curve that is essential for characterization of unsaturated soil behavior. The soil-water characteristic curves are obtained from a number of specimens of fine-grained residual soils compacted with different void ratios. Based on the experimental test results, the feasibility of using the liquid limit state as the reference state for predicting the soil-water characteristic curve are verified. Finally, through the regression analysis of experimental data using the equation of Fredlund and Xing (1994), a reliable method is proposed to predict the generalized soil-water characteristic curve of fine-grained residual soils using the liquid limit state as the reference.

  • PDF

The Storage Method of a Leaf Tobacco Warehouse in Leaf Tobacco Factory (원료공장 잎담배 창고의 저장방법)

  • Han-Joo Chung;Byong-Kwon Jeh;Yong-Ok Kim
    • Journal of the Korean Society of Tobacco Science
    • /
    • v.25 no.1
    • /
    • pp.53-58
    • /
    • 2003
  • This study deals with the leaf tobacco assignment problem of a leaf tobacco warehouse with multiple input points and single output point. Also, the number of storage frequences is not necessary the same as that of retrieval for each leaf tobacco. A mathematical model is developed with the objective of minimizing the total travel distance associated with storage and retrieval operations. We also develop several heuristics based on the retrieval order frequency, retrieval/storage frequency ratio of leaf tobacco, and ABC curve. It is observed that the ABC curve based heuristic gives the best solution which is near optimal. Based on the test results from real world data, the ABC curve based heuristic is found to give a best performance. Comparing to current assignment method, the ABC curve based heuristic reduced total travel distance about 17.2%.

Segmentation of Digital Curves by Structural Analysis (구조해석에 의한 디지털 곡선의 분리)

  • 류승필;권오석;김태균
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.12
    • /
    • pp.1984-1994
    • /
    • 1989
  • Techniques for approximating digitalcurves by polygonal lines are a valuable tool for image analysis and data compression. S. Shilien proposed a method for segmenting a digital curve into digital straight line segments digital straight line segments which are not satisfied with the structural properties, and have more than one break point by Shilien's method. Here, the structural representation of digital straight lines and digital staight line segments is described. And a method for segmenting a digital curve into digital straight line segments which are not satisfied with the structural properties, and have more than one break point by Shilien's method. Here, the structural representation of digital straight lines and digital staight line segments is described. And a method for segmenting a digital curve into digital straight line segments which may be not satisfied with the structural properties is proposed. The number of break points extracted by this method is less than that by S. Shilien's method from the digital curve which includes the digital straight line segments not satisfied with the structural properties.

  • PDF

Determining a novel softening function for modeling the fracture of concrete

  • Hossein, Karimpour;Moosa, Mazloom
    • Advances in materials Research
    • /
    • v.11 no.4
    • /
    • pp.351-374
    • /
    • 2022
  • Softening function is the primary input for modeling the fracture of concrete when the cohesive crack approach is used. In this paper, based on the laboratory data on notched beams, an inverse algorithm is proposed that can accurately find the softening curve of the concrete. This algorithm uses non-linear finite element analysis and the damage-plasticity model. It is based on the kinematics of the beam at the late stages of loading. The softening curve, obtained from the corresponding algorithm, has been compared to other softening curves in the literature. It was observed that in determining the behavior of concrete, the usage of the presented curve made accurate results in predicting the peak loads and the load-deflection curves of the beams with different concrete mixtures. In fact, the proposed algorithm leads to softening curves that can be used for modeling the tensile cracking of concrete precisely. Moreover, the advantage of this algorithm is the low number of iterations for converging to an appropriate answer.

Study of the Real Number Field Extension Operand of Elliptic Curve Cryptography (타원곡선 암호의 실수체 확장 연산항에 관한 연구)

  • Woo, Chan-Il;Goo, Eun-Hee
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.9
    • /
    • pp.5790-5795
    • /
    • 2014
  • Elliptic curve cryptography (ECC) is an extremely important part of information protection systems because it has outstanding safety among public key encryption algorithms. On the other hand, as ECC cannot obtain accurate values using a real number field because of the slow calculation and errors from rounding off, studies of ECC have focused on a finite field. If ECC can be extended to the real number field, more diverse keys can be selected compared to ECC only based on a finite field. Accordingly, in this paper, a method for constructing a cryptographic system with a high degree of safety is proposed through the diversification of keys selected by the user based on the operant extension method instead of extracting keys only using integer values.

A Variables Repetitive Group Sampling Plan for Minimizing Average Sample Number (평균 샘플 수 최소화를 통한 계량형 반복 샘플링 검사의 설계)

  • Park, Heekon;Moon, Young-gun;Jun, Chi-Hyuck;Balamurali, S.;Lee, Jaewook
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.30 no.3
    • /
    • pp.205-212
    • /
    • 2004
  • This paper proposes the variables repetitive group sampling plan where the quality characteristic following normal distribution has upper or lower specification limit. The problem is formulated as a non-linear programming problem where the objective function to minimize is the average sample number and the constraints are related to lot acceptance probabilities at acceptable quality level (AQL) and limiting quality level (LQL) under the operating characteristic curve. Sampling plan tables are constructed for the selection of parameters indexed by AQL and LQL in the cases of known standard deviation and unknown standard deviation. It is shown that the proposed sampling plan significantly reduces the average sample number as compared with the single or the double sampling plan.