• 대한기계학회논문집
• /
• 제15권1호
• /
• pp.98-106
• /
• 1991

본 연구에서는 로봇이용의 자동화를 위하여 가장 필수적인 과정인 로봇의 운 동경로 계획에 관하여 연구하고 작업영역 내에 장애물이 있는 경우에 로봇과 장애물과 의 충돌 회피를 위한 정량적인 양으로 두물체간의 최소거리 및 충돌깊이를 효율적으로 계산할 수 있는 방법을 제안하며 이를 이용하여 로봇이 장애물과 충돌하지 않고 주어 진 작업을 수행할 수 있는 로봇의 경로를 자동으로 생성함으로써 로봇을 보다 상위레 벨에서 운용하기 위한 기초를 마련한다.

• Journal of applied mathematics & informatics
• /
• 제6권2호
• /
• pp.669-684
• /
• 1999

We are interested in the problem of fitting a curve to a set of points in the plane in such a way that the sum of the squares of the orthogonal distances to given data points ins minimized. In[1] the prob-lem of fitting circles and ellipses was considered and numerically solved with general purpose methods. Especially in [2] H. Spath proposed a special purpose algorithm (Spath's ODF) for parabolas y-b=$c($\chi$-a)^2$ and for rotated ones. In this paper we present another parabola fitting algorithm which is slightly different from Spath's ODF. Our algorithm is mainly based on the steepest descent provedure with the view of en-suring the convergence of the corresponding quadratic function Q(u) to a local minimum. Numerical examples are given.

• Communications for Statistical Applications and Methods
• /
• 제24권2호
• /
• pp.129-142
• /
• 2017

In this paper we consider the problem of the model selection/discrimination among three different positively skewed lifetime distributions. Lindley, Weibull, and gamma distributions have been used to effectively analyze positively skewed lifetime data. This paper assesses how much closer the Lindley distribution gets to Weibull and gamma distributions. We consider three techniques that involve the likelihood ratio test, asymptotic likelihood ratio test, and minimum Kolmogorov distance as optimality criteria to diagnose the appropriate fitting model among the three distributions for a given data set. Monte Carlo simulation study is performed for computing the probability of correct selection based on the considered optimality criteria among these families of distributions for various choices of sample sizes and shape parameters. It is observed that overall, the Lindley distribution is closer to Weibull distribution in the sense of likelihood ratio and Kolmogorov criteria. A real data set is presented and analyzed for illustrative purposes.

• 전기의세계
• /
• 제18권6호
• /
• pp.9-22
• /
• 1969

This thesis has suggested a method of applying the Maximum Principle of Pontryagin to the optimal control of distributive electrical networks. In general, electrical networks consist of branches, nodes, sources and loads. The effective values of steady state currents and voltages are independent of time but only expressed as the functions of position. Moreover, most of the node voltages and branch currents are not predetermined, that is, initially unknown, and their inherent loop characteristics satisfy only Kirchhoff's current and voltage laws. The Maximum Principle, however, needs the initial fixed values of all state variables for its standand way of application. In spite of this inconsistency this thesis has undertaken to suggest a new approach to the successful solution of the above mentioned networks by introducing scaling factors and a state variable change technique which transform the boundary-value unknown problem into the boundary-value partially fixed and partially free problem. For the examples of applying the method suggested, the control problems for minimizing copper quantity in a distribution line have been solved with voltage drop constraint imposed on. In the case of uniform load distribution it has been shown that the optimal wire diameter of the distribution line is reciprocally proportional to the root of distance. For the same load pattern as above the wire diameter giving the minimum copper loss in the distribution line has been shown to be reciprocally proportional to distance.

• 정보과학회 논문지
• /
• 제41권11호
• /
• pp.943-957
• /
• 2014

윤곽선 이미지 매칭에서 이미지의 노이즈를 제거하는 것은 직관적이고 정확한 매칭을 위해 매우 중요한 요소이다. 본 논문에서는 윤곽선 이미지 매칭에서 부분 노이즈를 허용하는 문제를 시계열 도메인에서 다룬다. 이를 위해, 먼저 부분 노이즈 제거 시계열(partial denoising time-series)을 정의하여 이미지 도메인이 아닌 시계열 도메인에서 매칭 문제를 신속하게 해결하는 방법을 제안한다. 다음으로, 두 윤곽선 이미지, 즉 질의 시계열과 데이터 시계열에서 구성된 부분 노이즈 제거 시계열들 간에 가질 수 있는 최소거리인 부분 노이즈 제거 거리(partial denoising distance)를 제시한다. 본 논문에서는 이를 두 윤곽선 이미지 간의 유사성 척도로 사용하여 윤곽선 이미지 매칭을 수행한다. 그러나, 부분 노이즈 제거 거리를 측정하기 위해서는 매우 많은 계산이 빈번하게 발생하므로, 본 논문에서는 부분 노이즈 제거 거리의 하한을 구하는 방법을 제안한다. 마지막으로, 부분 노이즈 제거 윤곽선 이미지 매칭의 질의 방식에 따라 범위 질의 매칭과 k-NN 질의 매칭을 각각 제안한다. 실험 결과, 제안한 부분 노이즈 제거 윤곽선 이미지 매칭은 성능을 수 배에서 수십 배까지 향상시킨 것으로 나타났다.

• Computers and Concrete
• /
• 제25권6호
• /
• pp.551-563
• /
• 2020

This paper investigates the artificial neural network (ANN) to predict the dimensionless parameters for the maximum contact pressures and contact areas of a contact problem. Firstly, the problem is formulated and solved theoretically by using Theory of Elasticity and Integral Transform Technique. Secondly, the contact problem has been extended based on the ANN. The multilayer perceptron (MLP) with three-layer was used to calculate the contact distances. External load, distance between the two quarter planes, layer heights and material properties were created by giving examples of different values were used at the training and test stages of ANN. Program code was rewritten in C++. Different types of network structures were used in the training process. The accuracy of the trained neural networks for the case was tested using 173 new data which were generated via theoretical solutions so as to determine the best network model. As a result, minimum deviation value (difference between theoretical and C++ ANN results) of was obtained for the network model. Theoretical results were compared with artificial neural network results and well agreements between them were achieved.

• 전자공학회논문지A
• /
• 제32A권4호
• /
• pp.93-102
• /
• 1995

This paper introduces a general purpose Associative Processor(AP) which is very efficient for search-oriented applications. The proposed architecture consists of three main functional blocks: Content-Addressable Memory(CAM) arry, row logic, and control section. The proposed AP is a Single-Instruction, Multiple-Data(SIMD) device based on a CAM core and an array of high speed processors. As an application for the proposed hardware, we present a parallel algorithm to solve a global routing problem in the layout process utilizing the processing capabilities of a rudimentary logic and the selective matching and writing capability of CAMs, along with basic algorithms such a minimum(maximum) search, less(greater) than search and parallel arithmetic. We have focused on the simultaneous minimization of the desity of the channels and the wire length by sedking a less crowded channel with shorter wire distance. We present an efficient mapping technique of the problem into the CAM structure. Experimental results on difficult examples, on randomly generated data, and on benchmark problems from MCNC are included.

• Journal of applied mathematics & informatics
• /
• 제8권3호
• /
• pp.773-793
• /
• 2001

The explicit expressions for the 2n+1 primitive idempotents in R/sub pⁿ/ = F[x]/< x/sup pⁿ/ -1>, where F is the field of prime power order q and the multiplicative order of q modulo pⁿ is ø(pⁿ)/2(n≥1 and p is an odd prime), are obtained. An algorithm for computing the generating polynomials of the minimal QR cyclic codes of length pⁿ, generated by these primitive idempotents, is given and hence some bounds on the minimum distance of some QR codes of prime length over GF(q)(q=2, 3, ...) are obtained.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
• /
• pp.8-14
• /
• 2002

This article presents a new algorithm for the K Shortest Paths Problem which develops initial K shortest paths, and repeal to expose hidden shortest paths with dual approach and to replace the longest path in the present K paths. The initial solution which comprises K shortest paths among shortest paths to traverse each arc is made from bidirectional Dijkstra algorithm. When a crossing node that have two or more inward arcs is found at least three time by turns in this K shortest paths, one inward arc of this crossing node, which has minimum detouring distance, is chosen, and a new path is exposed with joining a detouring subpath from source to this inward arc and a spur of a feasible path from this crossing node to sink. This algorithm, requires worst case time complexity of $O(Kn^2),\;and\;O(n^2)$ in the case $K{\leq}3$.

• 자원환경지질
• /
• 제14권3호
• /
• pp.111-122
• /
• 1981

This study is a model analysis for an effective application of the geophysical prospecting to the investigation of geological structures or useful resources, and the purpose of it is to research a property of the electrical resistivity prospecting, especially by using a Three-Point electrode array method. In using the Three-Point electrode array method, it is theoretically assumed to choose the infinite for a distance between the two current electrodes, however it is impossible in applying to the practical field prospecting. Therefore this study was conducted for determination and presentation of a minimum appropriate distance between the two current electrodes by making a study on prospecting effect in the variation of distance between both the electrodes. In case that the ratios of the distance between the two current electrodes to that between the two potential electrodes are respectively chosen for 40, 400, 5,000, the experimental data of this study showed that the minimum appropriate distance between the two current electrodes is forty times as much as that between two potential electrodes. In order to make clear a problem about prospecting depth which is essential to the data processing, it had been chosen equally to the distance between two potential electrodes. As a result of it, it was shown that the anomaly is appeared along the position of an assumed ore body. Consequently it was found out that the prospecting depth of the Three-Point electrode array method is the same as the distance between the two potential electrodes. From the model experiment on the sheeting ore body(or linear structure) of horizontal, dipping of $30^{\circ}$, $60^{\circ}$ and vertical on the basis of above experimental condition, it was found out that the position and dip of assumed ore body could be inferred from the aspects of the equiresistivity curve. In consequence of performing out the simultaneous Normal and Reversal electrode movement, it was shown that the electrode movement of the Reversal forms the anomaly more clearly than that of Normal when the sheeting ore body is situated obliquely, therefore it could be ascertained that the electrode movement have to be performed simultaneously in the manner of Normal and Reversal. It was also exhibited that the aspect of the equiresistivity curve forms symmetrically when an assumed ore body (or linear structure) is situated horizontally or vertically, that is, symmetrically, and moreover that the aspect of the equiresistivity curve forms unsymmetrically when an assumed ore body (or linear structure) is situated obliquely. On the basis of these experimental analysis it is thought that it can be inferred from the aspect of equiresistivity curve whether an assumed ore body is obliquely situated or not.