• 경영과학
• /
• 제25권2호
• /
• pp.81-88
• /
• 2008

This paper presents a new algorithm for the K shortest paths problem in a network. After a shortest path is produced with Dijkstra algorithm. detouring paths through inward arcs to every vertex of the shortest path are generated. A length of a detouring path is the sum of both the length of the inward arc and the difference between the shortest distance from the origin to the head vertex and that to the tail vertex. K-1 shorter paths are selected among the detouring paths and put into the set of K paths. Then detouring paths through inward arcs to every vertex of the second shortest path are generated. If there is a shorter path than the current Kth path in the set. this path is placed in the set and the Kth path is removed from the set, and the paths in the set is rearranged in the ascending order of lengths. This procedure of generating the detouring paths and rearranging the set is repeated until the $K^{th}-1$ path of the set is obtained. The computational results for networks with about 1,000,000 nodes and 2,700,000 arcs show that this algorithm can be applied to a problem of generating the detouring paths in the metropolitan traffic networks.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• pp.60-66
• /
• 2006

This paper presents a new algorithm for the K shortest path problem in a directed network. After a shortest path is produced with Dijkstra algorithm, detouring paths through inward arcs to every vertex of the shortest path are generated. A length of a detouring path is the sum of both the length of the inward arc and the difference between the shortest distance from the origin to the head vertex and that to the tail vertex. K-1 shorter paths are selected among the detouring paths and put into the set of K paths. Then detouring paths through inward arcs to every vertex of the second shortest path are generated. If there is a shorter path than the current Kth path in the set, this path is placed in the set and the Kth path is removed from the set, and the paths in the set is rearranged in the ascending order of lengths. This procedure of generating the detouring paths and rearranging the set is repeated for the K-1 st path of the set. This algorithm can be applied to a problem of generating the detouring paths in the navigation system for ITS and also for vehicle routing problems.

• International Journal of Precision Engineering and Manufacturing
• /
• 제8권2호
• /
• pp.14-19
• /
• 2007

Angle sensors based on the principle of autocollimation, which are usually called autocollimators, can accurately measure small tilt angles of a light-reflecting flat surface. This paper describes a prototype micro-angle sensor that is based on the laser autocollimation technique. The new angle sensor is compact and consists of a laser diode as the light source and a quadrant photodiode as a position-sensing device. Because of its concise design, the microangle sensor facilitates dynamic measurements of the angular error motions of a precision stage without influencing the original dynamic properties of the stage. This is because the sensor only requires a small extra target mirror to be mounted on the stage. The sensitivity of the angle detection is independent of the focal length of the objective lens; therefore, an objective lens with a relatively short focal length is employed to reduce the size of the device. The micro-angle sensor uses a single lens for the both the laser collimation and focusing, which distinguishes it from the conventional laser autocollimation method that has separate collimate and objective lenses. The new micro-angle sensor has dimensions of $15.1\times22.0\times14.0mm$ and its resolution is better than 0.1 arc-second The optical design and performance of this micro-angle sensor were verified by experimental results.

• Journal of Computational Design and Engineering
• /
• 제2권4호
• /
• pp.206-217
• /
• 2015

This paper presents a complete S-shape feed rate scheduling approach (CSFA) with confined jerk, acceleration and command feed rate for parametric tool path. For a Non-Uniform Rational B-Spline (NURBS) tool path, the critical points of the tool path where the radius of curvature reaches extreme values are found firstly. Then, the NURBS curve is split into several NURBS sub-curves or blocks by the critical points. A bidirectional scanning strategy with the limitations of chord error, normal/tangential acceleration/jerk and command feed rate is employed to make the feed rate at the junctions between different NURBS blocks continuous. To improve the efficiency of the feed rate scheduling, the NURBS block is classified into three types: short block, medium block and long block. The feed rate profile corresponding to each NURBS block is generated according to the start/end feed rates and the arc length of the block and the limitations of tangential acceleration/jerk. In addition, two compensation strategies are proposed to make the feed rate more continuous and the arc increment more precise. Once the feed rate profile is determined, a second-order Taylor's expansion interpolation method is applied to generate the position commands. Finally, experiments with two free-form NURBS curves are conducted to verify the applicability and accuracy of the proposed method.

• Composites Research
• /
• 제13권1호
• /
• pp.69-77
• /
• 2000

본 논문에서는 크기가 일정한 비증분 하중과 크기가 커서 증분이론을 사용해야만 하는 증분하중이 동시에 가해지는 구조물의 비선형 해석을 위한 수정 호길이법을 제시한다. 수정된 호길이법에서는 비선형 계산을 수행할 때 증분하중에 의한 변위와 비증분 하중에 의한 변위를 구분하여 처리하게 된다. 제안된 방법의 타당성은 내압, 외압 및 압축하중을 받는 쉘 구조물의 비선형 거동에 대한 기존 결과와의 비교를 통해 검토하였다. 또한 비증분 하중과 증분하중이 함께 가해지는 대표적인 경우로서, 일정 횡압력과 축방향 증분 압축하중을 동시에 받는 쉘 구조물의 비선형 좌굴거동에 대한 인자연구를 수행하였다.

• 대한토목학회논문집
• /
• 제4권4호
• /
• pp.127-135
• /
• 1984

본 연구는 실제 하중을 받는 강재 아치구조의 최적형상을 다루었다. 목적함수로는 아치의 중량을 취했으며, 제약조건으로는 단면력, 체적, 아치리브의 길이, 아치부채 단연적의 조합으로 구성된 웅력제약초건을 고려하였다. 형상최적화문제는 아치부재의 단면척이 설계변수의 항으로 형성되었으며, 첫단계로 구조해석의 정밀도가 최적 설계의 목적함수값에 미치는 영향을 분석하였다. 형상최적화 알고리즘은 Two-space System 으로 형성되었고, Space 1 에서는 Modified Newton-Raphson Method에 의한 단면최적화, Space 2 에서는 Powell Method 에 의한 형상최적화를 시도하여 형상최적화 알고리즘을 도출하였다. 본 연구에서 도출된 최적화 알고리즘을 이용하여 아치의 단면최적화와 최적 아치형상에 관한 연구가 수행되었다. 이 알고리즘에 의해 실제 조건하에서 아치의 최적 Span-Rise 비를 구할 수 있다.

• Smart Structures and Systems
• /
• 제15권5호
• /
• pp.1233-1252
• /
• 2015

This study investigates the problem of crack detection in post-buckled beam-type structures. The beam under the axial compressive force has a crack, assumed to be open and through the width. The crack, which is modeled by a massless rotational spring, divides the beam into two segments. The crack detection is considered as an optimization problem, and the weighted sum of the squared errors between the measured and computed natural frequencies is minimized by the bees algorithm. To find the natural frequencies, the governing nonlinear equations of motion for the post-buckled state are first derived. The solution of the nonlinear differential equations of the two segments consists of static and dynamic parts. The differential quadrature method along with an arc length strategy is used to solve the static part, while the same method is utilized for the solution of the linearized dynamic part and the extraction of the natural frequencies of the cracked beam. The investigation includes several numerical as well as experimental case studies on the post-buckled simply supported and clamped-clamped beams having open cracks. The results show that several parameters such as the amount of applied compressive force and boundary conditions influences the outcome of the crack detection scheme. The identification results also show that the crack position and depth can be predicted well by the presented method.

• 전산구조공학
• /
• 제7권2호
• /
• pp.139-146
• /
• 1994

볼트 접합부의 정확한 해석을 위하여 접합 요소와 볼트 요소 및 쉘 요소를 사용한 방법을 개발하였다. 접합면을 단순하게 이상화시키는 접합 요소와 장력을 갖는 볼트 요소를 도입하였고, 전체적인 계산과정은 2단계, 즉 제안된 방법에 의한 초기 강성의 결정과 뉴턴-랩슨법에 근거하는 호장법을 이용한 비선형 거동의 추적으로 구분하여 행함으로써 계산의 효율성을 증대시켰다. 앵글을 사용한 반강접 접합부와 모멘트 판을 사용한 접합부를 해석하여 기존 실험 및 해석과 비교함으로써 제안한 방법의 정확성과 적용성을 입증하였다. 또한 볼트 접합부의 정확한 해석을 위해서는 접합면에서 발생하는 미끄럼짐의 고려가 반드시 필요하며 접합부를 구성하는 판재의 3차원적인 변형의 해석도 무시할 수 없는 역할을 하는 사실을 보여주었다.

• Journal of Information Processing Systems
• /
• 제16권3호
• /
• pp.663-676
• /
• 2020

Plant leaf classification is a significant application of image processing techniques in modern agriculture. In this paper, a multi-granular angle description method is proposed for plant leaf classification and retrieval. The proposed method can describe leaf information from coarse to fine using multi-granular angle features. In the proposed method, each leaf contour is partitioned first with equal arc length under different granularities. And then three kinds of angle features are derived under each granular partition of leaf contour: angle value, angle histogram, and angular ternary pattern. These multi-granular angle features can capture both local and globe information of the leaf contour, and make a comprehensive description. In leaf matching stage, the simple city block metric is used to compute the dissimilarity of each pair of leaf under different granularities. And the matching scores at different granularities are fused based on quotient space theory to obtain the final leaf similarity measurement. Plant leaf classification and retrieval experiments are conducted on two challenging leaf image databases: Swedish leaf database and Flavia leaf database. The experimental results and the comparison with state-of-the-art methods indicate that proposed method has promising classification and retrieval performance.

• Structural Engineering and Mechanics
• /
• 제71권6호
• /
• pp.603-625
• /
• 2019

Main cable configurations under final dead load and in the unloaded state and critical construction parameters (e.g. unstrained cable length, unstrained hanger lengths, and pre-offsets for tower saddles and splay saddles) are the core considerations in the design and construction control of a suspension bridge. For the purpose of accurate calculations, it is necessary to take into account the effects of cable strands over the anchor spans, arc-shaped saddle top, and tower top pre-uplift. In this paper, a method for calculating the cable configuration under final dead load over a main span, two side spans, and two anchor spans, coordinates of tangent points, and unstrained cable length are firstly developed using conditions for mechanical equilibrium and geometric relationships. Hanger tensile forces and unstrained hanger lengths are calculated by iteratively solving the equations governing hanger tensile forces and the cable configuration, which gives careful consideration to the effect of hanger weight. Next, equations for calculating the cable configuration in the unloaded state and pre-offsets of saddles are derived from the cable configuration under final dead load and the conditions for unstrained cable length to be conserved. The equations for the main span, two side spans and two anchor spans are then solved simultaneously. In the proposed methods, coupled nonlinear equations are solved by turning them into an unconstrained optimization problem, making the procedure simplified. The feasibility and validity of the proposed methods are demonstrated through a numerical example.