• Journal of the Korean Mathematical Society
• /
• v.47 no.4
• /
• pp.831-843
• /
• 2010

Let $\cal{H}$ and $\cal{K}$ be Hilbert spaces and let T, $\tilde{T}$ = T + ${\delta}T$ be bounded operators from $\cal{H}$ into $\cal{K}$. In this article, two facts related to the perturbation bounds are studied. The first one is to find the upper bound of $\parallel\tilde{T}^+\;-\;T^+\parallel$ which extends the results obtained by the second author and enriches the perturbation theory for the Moore-Penrose inverse. The other one is to develop explicit representations of projectors $\parallel\tilde{T}\tilde{T}^+\;-\;TT^+\parallel$ and $\parallel\tilde{T}^+\tilde{T}\;-\;T^+T\parallel$. In addition, some spectral cases related to these results are analyzed.

• Structural Engineering and Mechanics
• /
• v.33 no.1
• /
• pp.109-112
• /
• 2009

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.5
• /
• pp.572-578
• /
• 2018

This paper considers Group Testing as one of combinatorial problems. The group testing first began to inspect soldier's syphilis infection during World War II and have long established an academic basis. Recently, there has been much interest in related areas because of the rediscovery of the value of the group testing. The group testing is the same as finding a few defect samples out of a large number of samples, which is similar to the inverse problem of Compressed Sensing. In this paper, we introduce the definition of the group testing, and specify the classes of the group testing and the bounds on performance of the group testing. In addition, we show a lower bound for the number of tests required to find defective samples using the theoretical theorem which is mainly used for relationship between conditional entropy and the probability of error in the information theory. We see how our result can be different from other related results.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• pp.1817-1822
• /
• 1991

A method of reducing overhead caused by the processor synchronization process and common memory accesses in finely grained tasks is described. We propose a scheduler which considers the preparation time during searching to minimize the redundant accesses to shared memory. Since the suggested hardware (synchronizer) determines the access order of processors and bus arbitration simultaneously by including the synchronization process into the bus arbitration process, the synchronization time vanishes. Therefore this synchronizer has no overhead caused by the processor synchronization[l]. The proposed scheduler algorithm is processed in parallel. The processes share the upper bound derived by each searching and the lower bound function is built considering the preparation time in order to eliminate as many searches as possible. An application of the proposed method to a multi-DSP system to calculate inverse dynamics for robot arms, showed that the sampling time can be twice shorter than that of the conventional one.

• Journal of Korean Society for Quality Management
• /
• v.32 no.4
• /
• pp.208-219
• /
• 2004

This paper considers a nonparametric estimation of lifetime distribution for ramp stress tests with stress bound under intermittent inspection. The test items are inspected only at specified time points an⊂1 so the collected observations are grouped data. Under the cumulative exposure model, two nonparametric estimation methods of estimating the lifetime distribution at use condition stress are proposed for the situation which the time transformation function relating stress to lifetime is a type of the inverse power law. Each of items is initially put on test under ramp stress and then survivors are put on test under constant stress, where all failures in the Inspection interval are assumed to occur at the midi)oint or the endpoint of that interval. Two proposed estimators of quantile from grouped data consisting of the number of items failed in each inspection interval are numerically compared with the maximum likelihood estimator(MLE) based on Weibull distribution.

• Journal of Korean Society for Atmospheric Environment
• /
• v.21 no.E1
• /
• pp.13-21
• /
• 2005

Atmospheric concentrations of PCBs were monitored in Ansung-city, Kyonggi province during the 2001/2002 to characterize the concentration distribution and seasonal variation of particle polychlorinated biphenyls (PCBs). Average concentration of particle bound PCB showed maximum value for penta-CBs and minimum value for octa-CBs. Seasonal contributions $(%\)$ of total particle PCBs showed the highest value in winter months and lowest value in summer month, This result indicated that concentration of total particle PCBs increased with decreasing temperature in the atmosphere. Therefore, particle PCBs were easily formed by the condensation of gas phase PCBs in winter months. The total particle PCBs exhibited an inverse correlation with temperature (p<0.01) which suggested that particle PCBs were easily formed by condensation of gaseous PCBs in winter months.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.5
• /
• pp.1211-1219
• /
• 1995

An upper bound elemental technique (UBET) program has been developed to analyze forging load, die-cavity filling and effective strain distribution for flash and flashless forgings. The simulation for flash and flashless forgings are applied axisy mmetric and plane-strain closed-die forging with rib-web type cavity. Inverse triangular and inverse trapezoidal elements are used to analyze flashless forging. The analysis is described for merit of flashless precision forging. Experiments have been carried out with pure plasticine billets at room temperature. Theoretical predictions of the forging load and the flow pattern are in good agreement with experimental results.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.04a
• /
• pp.837-841
• /
• 1997

An upper bound elemental technique(UBET) program has been developed to analyze forging load, die-cavity filling and optimum kinematically admissible velocity fields for flashless forging. The simulation for flashless forgings are applied plane and axisymmetric closed-die forging with rib-web type cavity. The kinematically admissible velocity fields for inverse triangular and inverse trapezoidal elements, are used to analyze flashless forging. Experiments have been carried out with pure plasticine billets at room temperature. Theoretical predictions of the forging load in plane-strain and axisymmetric forging are in good agreement with experimental results.

• Journal of Advanced Marine Engineering and Technology
• /
• v.23 no.3
• /
• pp.379-388
• /
• 1999

Au upper bound elemental technique(UBET) program has been developed to analyze forging load die-cavity filling and optimum kinematically admissible velocity fields for flashless forging. The simulation for flashless forgings are applied plane-strain and axisymmetric closed-die forging with rib-web type cavity. The kinematically admissible velocity fields for inverse triangular and inverse trapezoidal elements are used to analyze flashless forging,. Experiments have been carried out with pure plasticine billets at room temperature. Theoretical predictions of the forging load in plane-strain and axisymmetric forging are in good agreement with experimental results.

• ETRI Journal
• /
• v.41 no.3
• /
• pp.298-307
• /
• 2019

This paper investigates the use of the inverse-free sparse Bayesian learning (SBL) approach for peak-to-average power ratio (PAPR) reduction in orthogonal frequency-division multiplexing (OFDM)-based multiuser massive multiple-input multiple-output (MIMO) systems. The Bayesian inference method employs a truncated Gaussian mixture prior for the sought-after low-PAPR signal. To learn the prior signal, associated hyperparameters and underlying statistical parameters, we use the variational expectation-maximization (EM) iterative algorithm. The matrix inversion involved in the expectation step (E-step) is averted by invoking a relaxed evidence lower bound (relaxed-ELBO). The resulting inverse-free SBL algorithm has a much lower complexity than the standard SBL algorithm. Numerical experiments confirm the substantial improvement over existing methods in terms of PAPR reduction for different MIMO configurations.