• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.366-370
• /
• 2003

This paper is on weighted model reduction using structurally balanced truncation. For a given weighted(single or double-sided) transfer function, a state space realization with the linear fractional transformation form is obtained. Then we prove that two block diagonal LMI(linear matrix inequality) solutions always exist, and it is possible to get a reduced order model with guaranteed stability and a priori error bound. Finally, two examples are used to show the validity of proposed weighted reduction method, and the method is compared with other existing methods.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.2
• /
• pp.87-101
• /
• 2008

This paper considers an order scheduling model to minimize the total weighted tardiness of orders. Each order requires different types of products. Each type of product is manufactured on its dedicated machine specified in advance. The completion time of each order is represented by the time when all the products belonging to the order are completed. The objective of this paper is to find the optimal production schedule minimizing the total weighted tardiness of a finite number of orders. In the problem analysis, we first derive a powerful solution property to determine the sequence of two consecutive orders. Moreover, two lower bounds of objective are derived and tested along with the derived property within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed property, branch-and-bound and heuristic algorithms are evaluated through various numerical experiments.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.12-12
• /
• 2000

This paper consider a new weighted model reduction using block diagonal solutions of Lyapunov inequalities. With the input and/or output weighting function, the stability of reduced order system is quaranteed and a priori error bound is proposed. to achieve this, after finding the solutions of two Lyapunov inequalities and balancing the full order system, we find the reduced order systems using the direct truncation and the singular perturbation approximation. The proposed method is compared with other existing methods using numerical example.

• Journal of applied mathematics & informatics
• /
• v.7 no.3
• /
• pp.1005-1015
• /
• 2000

In the unit disc, we find a sufficient condition to bound the Bergman norm by the weighted Poisson integral where the given weighted is $\mid$t$\mid$dt.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.1
• /
• pp.205-215
• /
• 2021

In [1], Beznosova proved that the bound on the norm of the dyadic paraproduct with b ∈ BMO in the weighted Lebesgue space L2(w) depends linearly on the Ad2 characteristic of the weight w and extrapolated the result to the Lp(w) case. In this paper, we provide the weighted norm estimates of the dyadic paraproduct πb with b ∈ VMO and reduce the dependence of the Ad2 characteristic to 1/2 by using the property that for b ∈ VMO its mean oscillations are vanishing in certain cases. Using this result we also reduce the quadratic bound for the commutators of the Calderón-Zygmund operator [b, T] to 3/2.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.859-863
• /
• 1987

In this paper, a relationship between difference triangular sets and sum triangular sets is developed to evaluate the weighted number of the third-order intermodulation products. In addition, a lower bound of the intermodulation products falling into the worst signal channel has been derived using the relationship between difference triangular sets and sum triangular sets. The formulas of the lower bound are useful for estimating the intermodulation impairment level in satellite communication systems.

• Communications of the Korean Mathematical Society
• /
• v.18 no.3
• /
• pp.449-457
• /
• 2003

On the setting of the upper half-space of the Euclidean space $R^{n}$, we show that to each weighted harmonic Bergman function $u\;\epsilon\;b^p_{\alpha}$, there corresponds a unique conjugate system ($upsilon$_1,…, $upsilon_{n-1}$) of u satisfying $upsilon_j{\epsilon}\;b^p_{\alpha}$ with an appropriate norm bound.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.6
• /
• pp.1791-1809
• /
• 2018

Let T be the singular integral operator with nonsmooth kernel which was introduced by Duong and McIntosh, and $T_q(q{\in}(1,{\infty}))$ be the vector-valued operator defined by $T_qf(x)=({\sum}_{k=1}^{\infty}{\mid}T\;f_k(x){\mid}^q)^{1/q}$. In this paper, by proving certain weak type endpoint estimate of L log L type for the grand maximal operator of T, the author establishes some quantitative weighted bounds for $T_q$ and the corresponding vector-valued maximal singular integral operator.

• ETRI Journal
• /
• v.33 no.1
• /
• pp.27-31
• /
• 2011

This paper addresses estimating the frequency of a cisoid in the presence of white Gaussian noise, which has numerous applications in communications, radar, sonar, and instrumentation and measurement. Due to the nonlinear nature of the frequency estimation problem, there is threshold effect, that is, large error estimates or outliers will occur at sufficiently low signal-to-noise ratio (SNR) conditions. Utilizing the ideas of averaging to increase SNR and weighted linear prediction, an optimal frequency estimator with smaller threshold SNR is developed. Computer simulations are included to compare its mean square error performance with that of the maximum likelihood (ML) estimator, improved weighted phase averager, generalized weighted linear predictor, and single weighted sample correlator as well as Cramer-Rao lower bound. In particular, with smaller computational requirement, the proposed estimator can achieve the same threshold and estimation performance of the ML method.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.2
• /
• pp.254-264
• /
• 2007

This paper considers a scheduling problem to minimize the total weighted completion time in the two-stage assembly-type flowshop. The system is composed of multiple fabrication machines in the first stage and a final-assembly machine in the second stage. Each job consists of multiple components, each component is machined on the fabrication machine specified in advance. The manufactured components of each job are subsequently assembled into a final product on the final-assembly machine. The objective of this paper is to find the optimal schedule minimizing the total weighted completion time of jobs. Three lower bounds are derived and tested in a branch-and-bound (B&B) Procedure. Also, three heuristic algorithms are developed based on the greedy strategies. Computational results show that the proposed B&B procedure is more efficient than the previous work which has considered the same problem as this paper.