• Journal of the Korean Society for Precision Engineering
• /
• v.11 no.1
• /
• pp.166-176
• /
• 1994

The problem of reducing the vibration level of elastic plates driven by multiple random point forces is analyzed in this study. First, the analytical solution for the vibration level of finite thin plates with four simply supported edges under the action of multiple random point force is derived. By assuming the plates to be lightly damped, an approximate solution for the vibration level of the plate is obtained. A numerical study is carried out to determine an optimal spacing distance between the multiple point forces in order to produce a relative minimum in the plate's vibration level. The optimal spacing distance is shown to depend on the given excitation band. The effects of wave cancellation in the near field of the multiple point forces are discussed by using the equivalence of certain stationary random responses and deterministic pulse responese.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.15 no.1
• /
• pp.98-106
• /
• 1991

Future generation of robots will be considerably more autonomous than present robotic systems. The main objective of research on theoretical problems in robotics is to endow robotics system with basic capabilities they will need to operate in an intelligent and autonomous manner. This paper discusses the problem of collision free movement of robot manipulator. It is formulated in path planning with obstacle avoidance expressed in the term of the distance between convex shapes in the three dimensional space. The examples are given to illustrate the main feature of the method.

• Journal of applied mathematics & informatics
• /
• v.6 no.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
• /
• v.24 no.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.

• 전기의세계
• /
• v.18 no.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.

• Journal of KIISE
• /
• v.41 no.11
• /
• pp.943-957
• /
• 2014

Removing noise, called denoising, is an essential factor for the more intuitive and more accurate results in boundary image matching. This paper deals with a partial denoising problem that tries to allow a limited amount of partial noise embedded in boundary images. To solve this problem, we first define partial denoising time-series which can be generated from an original image time-series by removing a variety of partial noises and propose an efficient mechanism that quickly obtains those partial denoising time-series in the time-series domain rather than the image domain. We next present the partial denoising distance, which is the minimum distance from a query time-series to all possible partial denoising time-series generated from a data time-series, and we use this partial denoising distance as a similarity measure in boundary image matching. Using the partial denoising distance, however, incurs a severe computational overhead since there are a large number of partial denoising time-series to be considered. To solve this problem, we derive a tight lower bound for the partial denoising distance and formally prove its correctness. We also propose range and k-NN search algorithms exploiting the partial denoising distance in boundary image matching. Through extensive experiments, we finally show that our lower bound-based approach improves search performance by up to an order of magnitude in partial denoising-based boundary image matching.

• Computers and Concrete
• /
• v.25 no.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.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.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
• /
• v.8 no.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.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• 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$.