• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.4
• /
• pp.53-61
• /
• 2014

In this paper, we proposed covariance weight matrix using SPT matrix in order to accurate target estimation. We have estimated a target using modified covariance matrix and beam steering error method. We have minimized beam steering error in order to estimation desired a target. This method obtain optimum covariance weight using modified SPT matrix. This paper of proposal method is showed good performance than general method. We updated a weight of covariance matrix using modified SPT matrix. We obtain optimum covariance matrix weight to application beam steering error method in order to beam steering toward desired target. Through simulation, we showed that compare proposal method with general method. It have improved resolution of estimation target to good performance more proposed method than general method.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.19 no.2
• /
• pp.171-188
• /
• 2015

In this paper, the efficient column-wise/row-wise lattice reduction (LR) updating and downdating methods are developed and their complexities are analyzed. The well-known LLL algorithm, developed by Lenstra, Lenstra, and Lov${\acute{a}}$sz, is considered as a LR method. When the column or the row is appended/deleted in the given lattice basis matrix H, the proposed updating and downdating methods modify the preconditioning matrix that is primarily computed for the LR with H and provide the initial parameters to reduce the updated lattice basis matrix efficiently. Since the modified preconditioning matrix keeps the information of the original reduced lattice bases, the redundant computational complexities can be eliminated when reducing the lattice by using the proposed methods. In addition, the rounding error analysis of the proposed methods is studied. The numerical results demonstrate that the proposed methods drastically reduce the computational load without any performance loss in terms of the condition number of the reduced lattice basis matrix.

• International Journal of Contents
• /
• v.14 no.1
• /
• pp.39-44
• /
• 2018

Today, cars have developed into intelligent automobiles that combine advanced control equipment and IT technology to provide driving assistance and convenience to users. These vehicles provide infotainment services to the driver, but this does not improve the safety of the driver. Accordingly, V2X communication, which forms a network between a vehicle and a vehicle, between a vehicle and an infrastructure, or between a vehicle and a human, is drawing attention. Therefore, various techniques for improving channel estimation performance without changing the IEEE 802.11p standard have been proposed, but they do not satisfy the packet error rate (PER) performance required by the C-ITS service. In this paper, we analyze existing channel estimation techniques and propose a new channel estimation scheme that achieves better performance than existing techniques. It does this by applying the updated matrix for the data pilot symbol to the construct data pilot (CDP) channel estimation scheme and by further performing the interpolation process in the frequency domain. Finally, through simulations based on the IEEE 802.11p standard, we confirmed the performance of the existing channel estimation schemes and the proposed channel estimation scheme by coded PER.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.9
• /
• pp.325-334
• /
• 2018

Requirement traceability should be continuously maintained in software development and evolution. However, it is usually updated in practice in the quality assurance phase. The gap between "is" and "should" exists due to the fact that developers must invest considerable effort to update requirement traceability while being able to obtain only marginal benefit from the updated traceability. To close this gap, we propose a spreadsheet application that enables developers to flexibly change mappings in a requirement traceability matrix. In this way, developers can reduce their effort in updating the requirement traceability matrix, but still obtain the common form of a requirement traceability matrix on a spreadsheet. The proposed application maintains the mappings between two artifacts on each sheet so that, whenever an artifact item changes, developers can instantly insert the relevant mapping changes. Then, when developers desire the common form of a requirement traceability matrix, the proposed application calculates the mappings among several artifacts and creates the matrix. The application also checks traceability errors and calculates the metrics so that developers can understand the completeness of the matrix. To understand the applicability of the proposed approach, we conducted a case study, which shows that the proposed application can be applied to the real project and easily incorporate the mapping changes.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.8
• /
• pp.766-770
• /
• 2010

In this paper, we present an effective covariance tracking algorithm based on adaptive size changing of tracking window. Recent researches have advocated the use of a covariance matrix of object image features for tracking objects instead of the conventional histogram object models used in popular algorithms. But, according to the general covariance tracking algorithm, it can not deal with the scale changes of the moving objects. The scale of the moving object often changes in various tracking environment and the tracking window(or object kernel) has to be adapted accordingly. In addition, the covariance matrix of moving objects should be adaptively updated considering of the tracking window size. We provide a solution to this problem by segmenting the moving object from the background pixels of the tracking window. Therefore, we can improve the tracking performance of the covariance tracking method. Our several simulations prove the effectiveness of the proposed method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.7
• /
• pp.808-813
• /
• 1999

A fuzzy learning method to control an unstable and multivariable system is presented in this paper, Because the multivariable system has generally a coupling effect between the inputs and outputs, it is difficult to find its modeling equation or parameters. If the system is unstable, initial condition rules are needed to make it stable because learning is nearly impossible. Therefore, this learning method uses the initial rules and introduces a cost function composed of the actual error and error-rate of each output without the modeling equation. To minimize the cost function, we experimentally got the Jacobian matrix in the operating point of the system. From the Jacobian matrix, we can find the direction of the convergence in the learning, and the optimal control rules are finally acquired when the fuzzy rules are updated by changing the portion of the errors and error rates.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1990.10a
• /
• pp.28-33
• /
• 1990

This paper presents an efficient and accurate method for nonlinear analysis of frame structures by idealized structural unit method. The main idea behind the present method is to minimize the cost of the computational effort by reducing the number of unknowns. An explicit form of the tangential elastic stiffness matrix of the element is derived by using updated Lagrangian approach. An ultimate limit state of the element is judged on the basis of the formation of a plastic hinge mechanism. The elasto-plastic stiffness matrix and the post-ultimate stiffness matrix of the element are formulated by plastic node method. A comparison between the present method is very efficient and accurate because the computing time required is very small while giving the accurate solution.

• Journal of Power System Engineering
• /
• v.4 no.2
• /
• pp.71-76
• /
• 2000

It is well known that finite element analysis often has the inaccuracy when they are in conflict with test results. Model updating is concerned with the correction of analytical model by processing records of response from test results. This paper introduce a model updating technique using the frequency response function data. The measurement data is able to be used directly in the FRF sensitivity method because it is not necessary to identify. When a damping model is updated, it is necessary for the sensitivity matrix to be divided Into the complex part and real part. As an applying model, a cantilever and a rotor system are used. Specially the machined clearance($C_p$) of the journal bearing is updated.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3559-3571
• /
• 2015

This paper addresses the problem of signal acquisition with a sparse representation in a given orthonormal basis using fewer noisy measurements. The authors formulate the problem statement for randomly measuring with strong signal noise. The impact of white Gaussian signals noise on the recovery performance is analyzed to provide a theoretical basis for the reasonable design of the measurement matrix. With the idea that the measurement matrix can be adapted for noise suppression in the adaptive CS system, an adapted selective compressive sensing (ASCS) scheme is proposed whose measurement matrix can be updated according to the noise information fed back by the processing center. In terms of objective recovery quality, failure rate and mean-square error (MSE), a comparison is made with some nonadaptive methods and existing CS measurement approaches. Extensive numerical experiments show that the proposed scheme has better noise suppression performance and improves the support recovery of sparse signal. The proposed scheme should have a great potential and bright prospect of broadband signals such as biological signal measurement and radar signal detection.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.124-126
• /
• 1989

Inverse kinematic problem is a crucial point for robot manipulator control. In this paper, to implement the Jacobian control technique we used the Hopfield(Tank)'s neural network. The states of neurons represent joint veocities, and the connection weights are determined from the current value of the Jacobian matrix. The network energy function is constructed so that its minimum corresponds to the minimum least square error. At each sampling time, connection weights and neuron states are updated according to current joint position. Inverse kinematic solution to the planar redundant manipulator is solved by computer simulation.