• Journal of the Korean Mathematical Society
• /
• v.54 no.5
• /
• pp.1557-1571
• /
• 2017

The L-curve method is a parametric plot of interrelation between the residual norm of the least squares problem and the solution norm. However, the L-curve method may be hard to apply to the total least squares problem due to its no closed form solution of the regularized total least squares problems. Thus the sequence of the solution norm under the fixed regularization parameter and its corresponding residual need to be found with an efficient manner. In this paper, we suggest an efficient algorithm to find the sequence of the solutions and its residual in order to plot the L-curve for the total least squares problems. In the numerical experiments, we present that the proposed algorithm successfully and efficiently plots fairly 'L' like shape for some practical regularized total least squares problems.

• Proceedings of the KSME Conference
• /
• 2000.11a
• /
• pp.541-547
• /
• 2000

This paper presents the closed-form forward kinematics of the 6-6 Stewart platform of planar base and moving platform. Based on algebraic elimination method and with one extra linear sensor, it first derives an 8th-degree univariate equation and then finds tentative solution sets out of which the actual solution is to be selected. In order to provide more exact solution despite the error between measured sensor value and the theoretical one, a correction method is also used. The overall procedure requires so little computation time that it can be efficiently used for realtime applications. In addition, unlike the iterative schemes e.g. Newton-Raphson, the algorithm does not require initial estimates of solution and is free of the problems that it does not converge to actual solution within limited time. The presented method has been implemented in C language and a numerical example is given to confirm the effectiveness and accuracy of the developed algorithm.

• Journal of Communications and Networks
• /
• v.14 no.3
• /
• pp.237-242
• /
• 2012

One of the major problems for accurate channel estimation in power line communication systems is impulsive noise. Traditional channel estimation algorithms are based on the assumption of Gaussian noise, or the need to locate the positions of impulsive noise. The algorithms may lose optimality when impulsive noise exists in the channel, or if the location estimation of impulsive noise is inaccurate. In the present paper, an effective channel estimation algorithm based on a robust cost function is proposed to mitigate impulsive noise. The proposed method can provide a closed-form solution, and the application of robust estimation theory enables the proposed method to be free from localization of impulsive noise and thus can guarantee that the proposed method has better performance. Simulations verified the proposed algorithm.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.63-70
• /
• 2008

Narrow-band interference (NBI) from the coexisting narrow-band services affects the performance of ultra wideband (UWB) systems considerably due to the high power of these narrow-band signals with respect to the UWB signals. Specifically, IEEE 802.11a systems which operate around 5 GHz and overlap the band of UWB signals may interfere with UWB systems significantly. In this paper, we suggest a novel NBI suppression technique based on singular value decomposition (SVD) algorithm in time hopping UWB (TH-UWB) systems. SVD is used to approximate the interference which then is subtracted from the received signals. The algorithm precision and closed-form bit error rate (BER) expression are derived in the wireless multipath channel. Comparing with the conventional suppression methods such as a notch filter and a RAKE receiver, the proposed method is simple and robust and especially suitable for UWB systems.

• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.68-77
• /
• 2004

In the near future packet networks should support applications which can not predict their traffic requirements in advance, but still have tight quality of service requirements, e.g., guaranteed bandwidth, jitter, and packet loss. These dynamic characteristics mean that the sources can be made to modify their data transfer rates according to network conditions. Depending on the customer&; needs, network operator can differentiate incoming connections and handle those in the buffers and the interfaces in different ways. In this paper, dynamic QoS-aware scheduling algorithm is presented and investigated in the single node case. The purpose of the algorithm is in addition to fair resource sharing to different types of traffic classes with different priorities ?to maximize revenue of the service provider. It is derived from the linear type of revenue target function, and closed form globally optimal formula is presented. The method is computationally inexpensive, while still producing maximal revenue. Due to the simplicity of the algorithm, it can operate in the highly nonstationary environments. In addition, it is nonparametric and deterministic in the sense that it uses only the information about the number of users and their traffic classes, not about call density functions or duration distributions. Also, Call Admission Control (CAC) mechanism is used by hypothesis testing.

• Structural Engineering and Mechanics
• /
• v.18 no.6
• /
• pp.709-729
• /
• 2004

This paper presents numerical and experimental investigations on damage detection of mono-coupled multistory buildings using natural frequency as only diagnostic parameter. Frequency equation of a mono-coupled multistory building is first derived using the transfer matrix method. Closed-form sensitivity equation is established to relate the relative change in the stiffness of each story to the relative changes in the natural frequencies of the building. Damage detection is then performed using the sensitivity equation with its special features and minimizing the norm of an objective function with an inequality constraint. Numerical and experimental investigations are finally conducted on a mono-coupled 3-story building model as an application of the proposed algorithm, in which the influence of modeling error on the degree of accuracy of damage detection is discussed. A mono-coupled 10-story building is further used to examine the capability of the proposed algorithm against measurement noise and incomplete measured natural frequencies. The results obtained demonstrate that changes in story stiffness can be satisfactorily detected, located, and quantified if all sensitive natural frequencies to damaged stories are available. The proposed damage detection algorithm is not sensitive to measurement noise and modeling error.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.3
• /
• pp.210-217
• /
• 2003

We introduced a scheme for finding an optimal data association matrix that represents the relationships between the measurements and tracks in multi-target tracking (MIT). We considered the relationships between targets and measurements as Markov Random Field and assumed a priori of the associations as a Gibbs distribution. Based on these assumptions, it was possible to reduce the MAP estimate of the association matrix to the energy minimization problem. After then, we defined an energy function over the measurement space that may incorporate most of the important natural constraints. To find the minimizer of the energy function, we derived a new equation in closed form. By introducing Lagrange multiplier, we derived a compact equation for parameters updating. In this manner, a pair of equations that consist of tracking and parameters updating can track the targets adaptively in a very variable environments. For measurements and targets, this algorithm needs only multiplications for each radar scan. Through the experiments, we analyzed and compared this algorithm with other representative algorithm. The result shows that the proposed method is stable, robust, fast enough for real time computation, as well as more accurate than other method.

• ETRI Journal
• /
• v.44 no.5
• /
• pp.746-758
• /
• 2022

This paper focuses on a mobile edge-computing-enabled heterogeneous network. A battery level-aware task-scheduling framework is proposed to improve the energy efficiency and prolong the operating hours of battery-powered mobile devices. The formulated optimization problem is a typical mixed-integer nonlinear programming problem. To solve this nondeterministic polynomial (NP)-hard problem, a decomposition-based task-scheduling algorithm is proposed. Using an alternating optimization technology, the original problem is divided into three subproblems. In the outer loop, task offloading decisions are yielded using a pruning search algorithm for the task offloading subproblem. In the inner loop, closed-form solutions for computational resource allocation subproblems are derived using the Lagrangian multiplier method. Then, it is proven that the transmitted power-allocation subproblem is a unimodal problem; this subproblem is solved using a gradient-based bisection search algorithm. The simulation results demonstrate that the proposed framework achieves better energy efficiency than other frameworks. Additionally, the impact of the battery level-aware scheme on the operating hours of battery-powered mobile devices is also investigated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.10
• /
• pp.865-875
• /
• 2012

In this paper, we optimize antenna locations for a distributed antenna system (DAS) with distributed antenna (DA) ports equipped with multiple antennas under per-DA port power constraint. Maximum ratio transmission and scaled zero-forcing beamforming are employed for single-user and multi-user DAS, respectively. Instead of maximizing the cell average ergodic sum rate, we focus on a lower bound of the expected signal-to-noise ratio (SNR) for the single-cell scenario and the expected signal-to-leakage ratio (SLR) for the two-cell scenario to determine antenna locations. For the single-cell case, optimization of the SNR criterion generates a closed form solution in comparison to conventional iterative algorithms. Also, a gradient ascent algorithm is proposed to solve the SLR criterion for the two-cell scenario. Simulation results show that DAS with antenna locations obtained from the proposed algorithms achieve capacity gains over traditional centralized antenna systems.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.12
• /
• pp.399-408
• /
• 2015

In the direct Gun Fire Control System(GFCS), it is essential to analyze the impact of the specific error components on the hit probability to optimize the system design. For this purpose the sensitivity equations of these error components are conveniently used, but it is too difficult to get those equations for the complex system with too many system elements. Normally sensitivity analysis is performed using numerical and statistical methods for the ground combat system. This method requires much computation, and makes us difficult to estimate the sensitivity change of specific error component intuitionally for the changing operating conditions. In this paper we propose a set of sensitivity equations deriving from closed form solution of the ballistic differential equation for the bullet. They are handy equations with very little computations, easy to understand the physical meaning of the related system variables. Some simulation results are shown to demonstrate usefulness of our algorithm for the 30mm projectile.