• Journal of applied mathematics & informatics
• /
• 제4권1호
• /
• pp.63-82
• /
• 1997

In experimental situations where n two or three level fac-tors are involoved and n observations are taken then the D-optimal first order saturated design is an $n{\times}n$ matrix with elements $\pm$1 or 0, $\pm$1, with the maximum determinant. Cononical forms are useful for the specification of the non-isomorphic D-optimal designs. In this paper we study canonical forms such as the Smith normal form the first sec-ond and the jordan canonical form of D-optimal designs. Numerical algorithms for the computation of these forms are described and some numerical examples are also given.

• 전기전자학회논문지
• /
• 제13권3호
• /
• pp.24-31
• /
• 2009

The computation time of FEA(finite element analysis) for one model may range from a few seconds up to several hours according to the complexity of the simulated model. If these FEA is used to calculate the objective and the constraint functions during the optimal solution search, it causes very excessive execution time. To resolve this problem, the distributed computing technique using internet web service is proposed in this paper. And the dynamic load balancing mechanisms are established to advance the performance of distributed computing. To verify its validity, this method is applied to a traditional mathematical optimization problem. And the proposed FEA-based optimization using internet distributed computing is applied to the optimal design of the permanent magnet dc motor(PMDCM) for automotive application.

• 제어로봇시스템학회논문지
• /
• 제2권3호
• /
• pp.242-247
• /
• 1996

In this paper, an optimal coning compensation algorithm for strapdown system is proposed by minimizing the coning error. The proposed algorithm is derived as a generalized form in that it contains the class of the existing coning algorithms and allows the design of optimal algorithm for various combinations of gyro samples. It is shown the magnitude of resulting algorithm errors depends mainly on the total number of gyro samples including present and previous gyro samples. Based on the results, the proposed algorithm enables the algorithm designers to develop the effective coning compensation algorithm according to their attitude computation specifications with ease. In addition, the multirate method which can efficiently implement the algorithm is presented.

• 대한전자공학회논문지
• /
• 제27권9호
• /
• pp.1364-1371
• /
• 1990

We propose a time-optimal path planning scheme for the robot manipulator using Hopfield neural network. The time-optimal path planning, which can allow the robot system to perform the demanded tasks with a minimum execution time, may be of consequence to improve the productivity. But most of the methods proposed till now suffers from a significant computational burden and thus limits the on-line application. One way to avoid such a difficulty is to apply the neural networke technique, which can allow the parallel computation, to the minimum time problem. This paper proposes an approach for solving the time-optimal path planning by using Hopfield neural network. The effectiveness of the proposed method is demonstrarted using a PUMA 560 manipulator.

• 한국실내디자인학회논문집
• /
• 제16호
• /
• pp.75-81
• /
• 1998

With the rise of the economic level and the improvement of the standard of living the size of the interior work is becoming large and specialized, With the recent opening of the domestic interior decoration market the order of the large-scale interior decoration work is actively received and its efficient construction is vigorously made. Accordingly reliability is required in keeping with all the accuracy of computing interior construction expenses systematically is importantly emerging. The estimation sheet written in a kind of process mode and in an area made as the construction expense breakdown mode were statistically treated and analyzed as well as quantity computation breakdown data. In determing the major factors that expert an influence on the factors of changes in construction expenses as well as the compositional ratio of construction work that becomes basic material for developing the cost model of interior decoration work the following conclusion could be made: Improvement should be made to suit the present situation by synthesizing and arranging the data practically used in current interior construction expenses. Required construction expenses for the kind of work common to each construction field are showing a given proportion and the required construction expenses of rather small scale interior construction work tend to be irregular. It is necessary to compute optimal construction expenses by calculating the optimal period of work and working personnel in consideration of the influential factor in each work.

• 경영과학
• /
• 제18권1호
• /
• pp.41-54
• /
• 2001

In this paper, we proposed a method to determine optimal wave source for mobile telephone communication. The approach is based on wave propagation simulation. Given a wave source we can determine wave propagation effects on every surfaces of wave simulation environment. The effect is evaluated as a cost function while the source’s position x, y, z work as variables for a parameter optimization. Wave propagated 3 dimensional space generates reflected waves whenever it hits boundary surface, it receives multiple waves which are reflected from various boundary surfacers in space. Three algorithms being implemented in this paper are based on a raytracing theory. If we get 3 dimensional geometry input as well as wave sources, we can compute wave propagation effects all over the boundary surfaces. In this paper, we present a new approach to compute wave propagation. First approach is tracing wave from a source. Source is modeled as a sphere casting vectors into various directions. This approach has limit in computing necessary wave propagation effects on all terrain surfaces. The second approach proposed is tracing wave backwards : tracing from a wave receiver to a wave source. For this approach we need to allocate a wave receiver on every terrain surfaces modeled, which requires enormous amount of computing time. But the second approach is useful for indoor wave propagation simulation. The last approach proposed in this paper is tracing sound by geometric computation. We allow direct, 1-relfe tion, and 2-reflection propagation. This approach allow us to save in computation time while achieving reasonable results. but due to the reflection limitaion, this approach works best in outdoor environment.

• 제어로봇시스템학회논문지
• /
• 제6권3호
• /
• pp.317-328
• /
• 2000

This paper presents an effective approach to collision-free motion planning of a robot in the work-space including time-varying obstacles. The free arc is defined as a set composed of the configuration points of the robot satisfying collision-free motion constraint at each sampling time. We represent this free arc with respect to the new coordinate frame centered at the goal configuration and there for the collision-free path satisfying motion constraint is obtained by connecting the configuration points of the free arc at each sampling mined from the sequence of free arcs the optimality is determined by the performance index. Therefore the complicated collision-free motion planning problem of a robot is transformed to a simplified SUB_Optimal Collision Avoidance Problem(SOCAP). We analyze the completeness of the proposed approach and show that it is partly guaranteed using the backward motion. Computational complexity of our approach is analyzed theoretically and practical computation time is compared with that of the other method. Simulation results for two cally and practical computation time is compared with that of the other method. Simulation results for two SCARA robot manipulators are presented to verify the efficacy of the proposed method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권8호
• /
• pp.3090-3102
• /
• 2015

The accuracy of an augmented reality (AR) application is highly dependent on the resolution of the object's image and the device's computational processing capability. Naturally, a mobile smart device equipped with a high-resolution camera becomes the best platform for portable AR services. AR applications require significant energy consumption and very fast response time, which are big burdens to the smart device. However, there are very few ways to overcome these burdens. Computation offloading via mobile cloud computing has the potential to provide energy savings and enhance the performance of applications executed on smart devices. Therefore, in this paper, adaptive mobile computation offloading of mobile AR applications is considered in order to determine optimal offloading points that satisfy the required quality of experience (QoE) while consuming minimum energy of the smart device. AR feature extraction based on SURF algorithm is partitioned into sub-stages in order to determine the optimal AR cloud computational offloading point based on conditions of the smart device, wireless and wired networks, and AR service cloud servers. Tradeoffs in energy savings and processing time are explored also taking network congestion and server load conditions into account.

• 전기학회논문지
• /
• 제65권3호
• /
• pp.463-468
• /
• 2016

The overall performance of multiuser systems significantly depends on how effectively and fairly manage resources shared by them. The efficient resource management strategies are even more important for multimedia users since multimedia data is delay-sensitive and massive. In this paper, we focus on resource allocation based on a game-theoretic approach, referred to as Nash bargaining solution (NBS), to provide a quality of service (QoS) guarantee for each user. While the NBS has been known as a fair and optimal resource management strategy, it is challenging to find the NBS efficiently due to the computationally-intensive task. In order to reduce the computation requirements for NBS, we propose an approach that requires significantly low complexity even when networks consist of a large number of users and a large amount of resources. The proposed approach linearizes utility functions of each user and formulates the problem of finding NBS as a convex optimization, leading to nearly-optimal solution with significantly reduced computation complexity. Simulation results confirm the effectiveness of the proposed approach.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권7호
• /
• pp.2339-2355
• /
• 2021

In this paper, a joint probabilistic data association algorithm based on loss function (LJPDA) is proposed so that the computation load and accuracy of the multi-target tracking algorithm can be guaranteed simultaneously. Firstly, data association is divided in to three cases based on the relationship among validation gates and the number of measurements in the overlapping area for validation gates. Also the contribution coefficient is employed for evaluating the contribution of a measurement to a target, and the loss function, which reflects the cost of the new proposed data association algorithm, is defined. Moreover, the equation set of optimal contribution coefficient is given by minimizing the loss function, and the optimal contribution coefficient can be attained by using the Newton-Raphson method. In this way, the weighted value of each target can be achieved, and the data association among measurements and tracks can be realized. Finally, we compare performances of LJPDA proposed and joint probabilistic data association (JPDA) algorithm via numerical simulations, and much attention is paid on real-time performance and estimation error. Theoretical analysis and experimental results reveal that the LJPDA algorithm proposed exhibits small estimation error and low computation complexity.