• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.6190-6213
• /
• 2019

For small-scale vector data, restrictions on watermark scheme capacity and robustness limit the use of copyright protection. A watermarking scheme based on robust geometric features and capacity maximization strategy that simultaneously improves capacity and robustness is presented in this paper. The distance ratio and angle of adjacent vertices are chosen as the watermark domain due to their resistance to vertex and geometric attacks. Regarding watermark embedding and extraction, a capacity-improved strategy based on quantization index modulation, which divides more intervals to carry sufficient watermark bits, is proposed. By considering the error tolerance of the vector map and the numerical accuracy, the optimization of the capacity-improved strategy is studied to maximize the embedded watermark bits for each vertex. The experimental results demonstrated that the map distortion caused by watermarks is small and much lower than the map tolerance. Additionally, the proposed scheme can embed a copyright image of 1024 bits into vector data of 150 vertices, which reaches capacity at approximately 14 bits/vertex, and shows prominent robustness against vertex and geometric attacks for small-scale vector data.

• Archives of Pharmacal Research
• /
• v.27 no.6
• /
• pp.633-639
• /
• 2004

The expression of therapeutic transgenes in recombinant adenoviral vectors is a major cause of toxicity in dividing cancer cells as well as non dividing normal cells. To solve the problem of toxicity to normal cells, we have reported on a recombinant adenoviral vector system （AdLP-） in which the expression of the transgene is directed by the tumor-specific L-plastin promoter （LP） （Chung et al., 1999）. The object of this study was to generate a recombinant adenoviral vector system which would generate tumor cell specific expression of cytosine deaminase （CD） gene. We report the construction of a replication-incompetent adenoviral vector in which CD is driven by the L-plastin promoter （AdLPCD）. Infection of 293 cells by AdLPCD generated the functional CD protein as measured by HPLC analysis for the conversion of 5-Fluorocy-tosine （5-FC） to 5-Fluorouracil （5-FU）. HPLC analysis in conjunction with counting radioactivity for ［6-$^3$H］-5FC and ［6-$^3$H］-5FU demonstrated vector dose-dependent conversion of 5-FC to 5-FU in AdLPCD infected ovarian cancer cells. The results from present and previous studies（Peng et al., 2001； Akbulut et al., 2003） suggest that the use of the AdLPCD／5-FC system may be of value in the treatment of cancer including microscopic ovarian cancer in the peritoneal cavity.

• Journal of the Korean Mathematical Society
• /
• v.32 no.3
• /
• pp.509-518
• /
• 1995

Let $M^n$ be a hypersurface in the Euclidean space $R^{n+1}$ with position vector field x and unit normal vector field G.

• Honam Mathematical Journal
• /
• v.26 no.2
• /
• pp.219-236
• /
• 2004

In this paper, the problem of estimating a p-variate ($p{\geq}4$) normal mean vector is considered in a decision-theoretic setup. Using a simple property of the noncentral chi-square distribution, a sequence of smooth estimators dominating the Lindley type estimator has been produced and each improved estimator is better than previous one.

• Journal of the Korean Data and Information Science Society
• /
• v.13 no.2
• /
• pp.11-19
• /
• 2002

In this paper, the problem of estimating a p-variate $(p\geq4)$ normal mean vector in a decision-theoretic setup is considered. Using a technique of Guo and Pal (1992), a sequence of estimators dominating the Lindley type estimator is derived and each improved estimator is better than the previous one.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.983-986
• /
• 2002

Support Vector Machine (SVM) is one of the methods of pattern recognition that separate input data using hyperplane. This method has high capability of pattern recognition by using the technique, which says kernel trick, and the Radial basis function (RBF) kernel is usually used as a kernel function in kernel trick. In this paper we propose using the q-normal distribution to the kernel function, instead of conventional RBF, and compare two types of the kernel function.

• Communications for Statistical Applications and Methods
• /
• v.12 no.2
• /
• pp.463-472
• /
• 2005

In this paper, the problem of estimating a p-variate (p $\ge$4) normal mean vector is considered in decision-theoretic set up. Using a simple property of the noncentral chi-square distribution, a sequence of estimators dominating the Lindley type estimator with the cases of unknown covariance matrices has been produced and each improved estimator is better than previous one.

• Communications for Statistical Applications and Methods
• /
• v.19 no.4
• /
• pp.517-526
• /
• 2012

In this paper a support vector method is proposed for use when the sample observations are contaminated by a normally distributed measurement error. The performance of deconvolution density estimators based on the support vector method is explored and compared with kernel density estimators by means of a simulation study. An interesting result was that for the estimation of kurtotic density, the support vector deconvolution estimator with a Gaussian kernel showed a better performance than the classical deconvolution kernel estimator.

• Communications of the Korean Mathematical Society
• /
• v.31 no.2
• /
• pp.379-388
• /
• 2016

In this study, by using Laplace and normal Laplace operators, we give some characterizations for the Darboux instantaneous rotation vector field of the curves in the Euclidean 3-space $E^3$. Further, we give necessary and sufficient conditions for unit speed space curves to have 1-type Darboux vectors. Moreover, we obtain some characterizations of helices according to Darboux vector.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.6
• /
• pp.1225-1233
• /
• 2011

In this paper, without assumption of monotonicity, we study the compactness and the connectedness of the weakly efficient solutions set to vector equilibrium problems by using scalarization method in locally convex spaces. Our results improve the corresponding results in [X. H. Gong, Connectedness of the solution sets and scalarization for vector equilibrium problems, J. Optim. Theory Appl. 133 (2007), 151-161].