• Journal of the Korean Data and Information Science Society
• /
• 제11권1호
• /
• pp.37-45
• /
• 2000

Consider the problem of estimating a $p{\times}1$ mean vector ${\underline{\theta}}(p{\geq}4)$ under the quadratic loss, based on a sample ${\underline{x}_{1}},\;{\cdots}{\underline{x}_{n}}$. We find an optimal decision rule within the class of Lindley type decision rules which shrink the usual one toward the mean of observations when the underlying distribution is that of a variance mixture of normals and when the norm ${\parallel}\;{\underline{\theta}}\;-\;{\bar{\theta}}{\underline{1}}\;{\parallel}$ is known, where ${\bar{\theta}}=(1/p){\sum_{i=1}^p}{\theta}_i$ and $\underline{1}$ is the column vector of ones.

• 호남수학학술지
• /
• 제25권1호
• /
• pp.95-115
• /
• 2003

Consider the problem of estimating a $p{\times}1$ mean vector ${\theta}(p{\geq}4)$ under the quadratic loss, based on a sample $X_1,\;{\cdots}X_n$. We find an optimal decision rule within the class of Lindley type decision rules which shrink the usual one toward the mean of observations when the underlying distribution is that of a variance mixture of normals and when the norm $||{\theta}-{\bar{\theta}}1||$ is known, where ${\bar{\theta}}=(1/p)\sum_{i=1}^p{\theta}_i$ and 1 is the column vector of ones. When the norm is restricted to a known interval, typically no optimal Lindley type rule exists but we characterize a minimal complete class within the class of Lindley type decision rules. We also characterize the subclass of Lindley type decision rules that dominate the sample mean.

• Journal of the Korean Data and Information Science Society
• /
• 제16권4호
• /
• pp.1027-1039
• /
• 2005

Consider the problem of estimating a $p{\times}1$ mean vector $\theta(p\geq4)$ under the quadratic loss, based on a sample $X_1$, $X_2$, $\cdots$, $X_n$. We find a Lindley type decision rule which shrinks the usual one toward the mean of observations when the underlying distribution is that of a variance mixture of normals and when the norm $\parallel\;{\theta}-\bar{{\theta}}1\;{\parallel}$ is restricted to a known interval, where $bar{{\theta}}=\frac{1}{p}\;\sum\limits_{i=1}^{p}{\theta}_i$ and 1 is the column vector of ones. In this case, we characterize a minimal complete class within the class of Lindley type decision rules. We also characterize the subclass of Lindley type decision rules that dominate the sample mean.

• 전자공학회논문지B
• /
• 제33B권7호
• /
• pp.107-115
• /
• 1996

The average distortio of the vector quantizer is calcualted using a probability function F of the input source for a given codebook. But, since the input source is unknown in geneal, using the sample vectors that is realized from a random vector having probability function F, a time-average opeation is employed so as to obtain an approximation of the average distortion. In this case the size of the smple set should be large so that the sample vectors represent true F reliably. The theoretical inspection about the approximation, however, is not perfomed rigorously. Thus one might use the time-average distortion without any verification of the approximation. In this paper, the convergence characteristics of the time-average distortions are theoretically investigated when the size of sample vectors or the size of codebook gets large. It has been revealed that if codebook size is large enough, then small sample set is enough to obtain the average distortion by approximatio of the calculated tiem-averaged distortion. Experimental results on synthetic data, which are supporting the analysis, are also provided and discussed.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 G
• /
• pp.3150-3152
• /
• 1999

The efficient representation and encoding of signals with limited resources, e.g., finite storage capacity and restricted transmission bandwidth, is a fundamental problem in technical information processing systems. Typically under realistic circumstances, the encoding and communication of message has to deal with different sources of noise and disturbances. In this paper, I propose a unifying approach to data compression by robust vector quantization, which explicitly deals with channel noise, and random elimination of prototypes. The resulting algorithm is able to limit the detrimental effect of noise in a very general communication scenario. In this paper, based on the robust vector quantization I have an experiment about speech coding.

• IMMUNE NETWORK
• /
• 제21권1호
• /
• pp.6.1-6.11
• /
• 2021

Adenovirus was originally used as a vector for gene therapy. In recent years, with the development of the next-generation vectors with increased safety and high immunogenicity to transgene products, its utility as a vaccine vector has continued to increase. Adenovirus-based vaccines are currently being tested not only to prevent various infectious diseases but also to be applied as cancer vaccines. In this review, I discuss the innate and adaptive aspects of the immunological characteristics of adenovirus vectors and further examine the current status of advanced adenovirus-based vaccine development. Various methods that can overcome the limitations of currently used adenoviruses as vaccine vehicles are also discussed. Through this study, I hope that vaccine development using adenovirus vectors will be expedited and more successful.

• 대한수학회지
• /
• 제37권4호
• /
• pp.565-577
• /
• 2000

We consider regularity questions arising in the degenerate elliptic vector valued variational inequalities -div(｜▽u｜p-2∇u)$\geq$b(x, u, ∇u) with p$\in$(1, $\infty$). It is a generalization of the scalar valued inequalities, i.e., the obstacle problem. We obtain the C1,$\alpha$loc regularity for the solution u under a controllable growth condition of b(x, u, ∇u).

• Journal of the Korean Statistical Society
• /
• 제24권1호
• /
• pp.149-160
• /
• 1995

We consider the problem of optimal adaptive estiamtion of the euclidean parameter vector $\theta$ of the univariate non-linerar autogressive time series model ${X_t}$ which is defined by the following system of stochastic difference equations ; $X_t = \sum^p_{i=1} \theta_i \cdot T_i(X_{t-1})+e_t, t=1, \cdots, n$, where $\theta$ is the unknown parameter vector which descrives the deterministic dynamics of the stochastic process ${X_t}$ and ${e_t}$ is the sequence of white noises with unknown density $f(\cdot)$. Under some general growth conditions on $T_i(\cdot)$ which guarantee ergodicity of the process, we construct a sequence of adaptive estimatros which is locally asymptotic minimax (LAM) efficient and also attains the least possible covariance matrix among all regular estimators for arbitrary symmetric density.

• 한국군사과학기술학회지
• /
• 제9권3호
• /
• pp.48-55
• /
• 2006

This paper describes the antenna based GPS anti-jamming technology called CRPA(Controlled Reception Pattern Antenna), which used $2{\times}2$ array elements. In this system, the main functions are the antenna complex weight control and the GPS digital I/Q VM(Vector Modulator). To update the VM's I/Q complex weights, the PC based DAC(Digital to Analog Converter) module was also used and the two analog output voltages were applied to the $2{\times}2$ array elements to synthesize the null pattern. In the study, we also simulated the $2{\times}2$ GPS array null patterns to compare the null depth with experimental results. The VM was also modified at the frequency of 1.575GHz for the GPS L1 and controlled by the PC based VM software.

• 한국멀티미디어학회논문지
• /
• 제18권2호
• /
• pp.233-243
• /
• 2015

A hotspot is a spatial pattern that properties or events of spaces are densely revealed in a particular area. Whereas location information is easily captured with increasing use of mobile devices, so is not our emotion unless asking directly through a survey. Tweet provides a good way of analyzing such spatial sentiment, but relevant research is hard to find. Therefore, we analyzed hotspots of emotion in the twitter using spatial autocorrelation. 10,142 tweets and related GPS data were extracted. Sentiment of tweets was classified into good or bad with a support vector machine algorithm. We used Moran's I and Getis-Ord $G_i^*$ for global and local spatial autocorrelation. Some hotspots were found significant and drawn on Seoul metropolitan area map. These results were found very similar to an earlier conducted official survey of happiness index.