• 한국정밀공학회지
• /
• 제18권6호
• /
• pp.43-49
• /
• 2001

A reduced machining time and increased accuracy for the sculptured surface are very important when producing complicated parts. The step-size and tool-path interval are essential components in high speed and high resolution machining. If they are small, the machining time will increase, whereas if they are large, rough surfaces will be caused. In particular, the machining time, which is key in high speed machining, is affected by the tool-path interval more than the step-size. The conventional method for calculating the tool=path interval is to select a small parametric increment of a small increment based on the curvature of the surface. However, this approach also has limitations. The first is that the tool-path interval can not be calculated precisely. The second is that a separate tool-path interval needs to be calculated in each of the three cases. The third is that the conversion from Cartesian domain to parametric domain or vice versa must be necessary. Accordingly, the current study proposes a new tool-path interval algorithm that do not involve a curvature and that is not necessary for any conversion and a variable step-size algorithm for NURBS.

• 한국정보과학회논문지:시스템및이론
• /
• 제34권10호
• /
• pp.539-554
• /
• 2007

이 논문에서는 진구간 그래프(proper interval graph)가 각각 일대일, 일대다. 다대다 k-서로소인 경로 커버를 가질 조건을 고찰한다. 진구간 그래프는 $k{\geq}2$인 경우, k-연결되어 있는 경우에만 일대일 k-서로소인 경로 커버를 가지며, k+1-연결되어 있는 경우에만 일대다 k-서로소인 경로 커버를 가짐을 증명하였다. 그리고 $k{\geq}3$일 때 진구간 그래프는 2k-1-연결되어 있는 경우에만 (쌍형) 다대다 k-서로소인 경로 커버를 가진다.

• 융합신호처리학회논문지
• /
• 제15권1호
• /
• pp.9-14
• /
• 2014

이동 통신망의 기지국과 이동국 사이의 거리 차로 인하여 발생하는 경로 손실 데이터를 분석하였다. 본 논문에서는, 측정된 수신 신호세기(RSSI)로부터 송수신기 거리 차이에 따른 경로 손실을 계산하여 이를 그래프로 표시하고, 평균한 데이터를 이용하여 기존의 경로 손실 모델들(자유공간 모델, 지면반사파 모델, 하타 모델, ${\ldots}$)과 그래프를 동시에 그려서 비교하였다. 2 Km, 1 Km, 0.5 Km 간격으로 평균한 경로 손실 데이터에 대한 표준 편차를 구해 보니, 각각 2.29 dB, 3.39 dB, 4.75 dB가 되었다. 본 논문에서는 거리별로 계산된 경로 손실 평균값들의 미분 값을 구하여, 앞에서 구한 경로 손실 표준 편차의 1 또는 2배수를 초과하여 변동하는 위치를 찾아내는 방법을 제안 하였다. 이렇게 제안한 방법을 적용하여 분석한 결과, 송수신기 사이에서 손실이 급격하게 발생하는 지점이, 2 Km 간격으로 경로 손실을 평균한 경우에는 5 지점, 1 Km 간격으로 평균한 경우에는 7 지점, 0.5 Km 간격으로 평균한 경우에는 19 지점이 됨을 알 수 있었고, 구체적인 위치를 파악하는 성과를 얻었다.

• 산업경영시스템학회지
• /
• 제34권3호
• /
• pp.90-96
• /
• 2011

Finding the critical path (or the longest path) on acyclic directed graphs, which is well-known as PERT/CPM, the ambiguity of each acr's length can be modeled as a range or an interval, in which the actual length of arc may realize. In this case, the min-max regret criterion, which is widely used in the decision making under uncertainty, can be applied to find the critical path minimizing the maximum regret in the worst case. Since the min-max regret critical path problem with the interval arc's lengths is known as NP-hard, this paper proposes a heuristic algorithm to diminish the maximum regret. Then the computational experiments shows the proposed algorithm contributes to the improvement of solution compared with the existing heuristic algorithms.

• 융합신호처리학회논문지
• /
• 제14권2호
• /
• pp.105-109
• /
• 2013

There are the free space model, the direct-path and ground reflected model, Egli model, Okumura-Hata model in the representative propagational models. The measured results at the area of PNG area were used as the experimental data in this paper. The new proposed partial interval analysis method is applied on the measured propagation data in the cellular band. The interval for the analysis is divided from the entire 30 Km distance to 5 Km, and next to 1 Km. The best-fit propagation models are chosen on all partial intervals. The means and standard deviations are calculated for the differences between the measured data and all partial interval models. By using the 5 Km- or 1 Km- partial interval analysis, the standard deviation between the measured data and the partial propagation models was improved more than 1.7 dB.

• Management Science and Financial Engineering
• /
• 제4권2호
• /
• pp.1-13
• /
• 1998

The Shortest Path Problem in Time-dependent Networks, where the travel time of each link depends on the time interval, is not realistic since the model and its solution violate the Non-passing Property (NPP:often referred to as FIFO) of real phenomena. Furthermore, solving the problem needs much more computational and memory complexity than the general shortest path problem. A new model for Time-dependent Networks where the flow speeds of each link depend on time interval, is suggested. The model is more realistic since its solution maintains the NPP. Solving the problem needs just a little more computational complexity, and the same memory complexity, as the general shortest path problem. A solution algorithm modified from Dijkstra's label setting algorithm is presented. We extend this model to the problem of Minimum Expected Time Path in Time-dependent Stochastic Networks where flow speeds of each link change statistically on each time interval. A solution method using the Kth-shortest Path algorithm is presented.

• International Journal of CAD/CAM
• /
• 제7권1호
• /
• pp.21-30
• /
• 2007

The inverse offset method (IOM) is widely used for generating cutter paths from the point-based surface where the surface is characterised by a set of surface points rather than parametric polynomial surface equations. In the IOM, cutter path planning is carried out by specifying the grid sizes, called the step-forward and step-interval distances respectively in the forward and transverse cutting directions. The step-forward distance causes the chordal deviation and the step-forward distance produces the cusp. The chordal deviation and cusp are also functions of local surface slopes and curvatures. As the slopes and curvatures vary over the surface, different step-forward and step-interval distances are appropriate in different areas for obtaining the machined surface accurately and efficiently. In this paper, the chordal deviation and cusp height are calculated in consideration with the surface slopes and curvatures, and their combined effect is used to estimate the machined surface error. An adaptive grid generation algorithm is proposed, which enables the IOM to generate cutter paths adaptively using different step-forward and step-interval distances in different regions rather than constant step-forward and step-interval distances for entire surface.

• Management Science and Financial Engineering
• /
• 제10권1호
• /
• pp.53-75
• /
• 2004

Most existing studies on time-dependent networks have been focused on finding a minimum delay path given a departure time at the origin. There, however, frequently happens a situation where users can select any departure time in a certain time interval and want to spend as little time as possible on traveling the networks. In that case. the delay spent on traveling networks depends on not only paths but also the actual departure time at the origin. In this paper, we propose a new problem in time-dependent networks whose objective is to find an optimal departure time given possible departure time interval at the origin. From the optimal departure time, we can obtain a path with minimum delay among all paths for possible departure times at the origin. In addition, we present an algorithm for finding an optimal departure time by enumerating trees which remain shortest path tree for a certain time interval.

• Journal of Mechanical Science and Technology
• /
• 제18권5호
• /
• pp.753-761
• /
• 2004

In this paper, an efficient method for generating 5-axis cutting data for a turbine blade is presented. The interference elimination of 5-axis cutting currently is very complicated, and it takes up a lot of time. The proposed method can generate an interference-free tool path, within an allowance range. Generating the cutting data just point to the cutting process and using it to obtain NC data by calculating the feed rate, allows us to maintain the proper feed rate of the 5-axis machine. This paper includes the algorithms for: (1) CL data generation by detecting an interference-free heel angle, (2) finding the optimal tool path interval considering the cusp-height, (3) finding the adaptive feed rate values for each cutter path, and (4) the inverse kinematics depending on the structure of the 5-axis machine, for generating the NC data.

• Korean Journal of Mathematics
• /
• 제31권3호
• /
• pp.323-337
• /
• 2023

In this paper, we have defined bicomplex valued functions of bounded variations and rectifiable hyperbolic path. We have studied the integration of product-type bicomplex valued functions on rectifiable hyperbolic path. Also we have established bicomplex analogue of the Fundamental Theorem of Calculus for hyperbolic line integral.