• Journal of the Chungcheong Mathematical Society
• /
• v.29 no.3
• /
• pp.397-416
• /
• 2016

This paper is devoted to the study of various notions of almost openness and almost homeomorphisms and the characterization of some of them in terms of the relative interior operator. Generally, openness (or quasi-openness) for a continuous map f is well known. We define openness (or quasi-openness) at a point x using the relative interior operator and characterize that a continuous map f is almost open, almost quasi-open, almost embedding and almost homeomorphsims.

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.517-523
• /
• 1998

In this paper we prove that a normed almost linear space \hat{X} can be embedded in a normed linear space X when a normed almost linear space X has a basis and splits as X=V+W. Also we have a metric induced by a norm on a normed almost linear space as a corollary.

• Bulletin of the Korean Mathematical Society
• /
• v.39 no.2
• /
• pp.289-297
• /
• 2002

It was shown by L. Polterovich ([3]) that if L is a totally real submanifold of a symplectic manifold $(M,\omega)$ and L is parallelizable then L is normal. So we try to find an answer to the question of whether there is a compatible almost complex structure J on the symplectic vector bundle $TM$\mid$_{L}$ such that $TL{\cap}JTL=0$ assuming L is normal and parallelizable. Although we could not reach an answer, we observed that the claim holds at the vector space level. And related to the question, we showed that for a symplectic vector bundle $(M,\omega)$ of rank 2n and $E=E_1{\bigoplus}E_2$, where $E=E_1,E_2$are Lagrangian subbundles of E, there is an almost complex structure J on E compatible with ${\omega}$ and $JE_1=E_2$. And finally we provide a necessary and sufficient condition for a given embedding into a symplectic manifold to be normal.

• Communications of the Korean Mathematical Society
• /
• v.18 no.4
• /
• pp.695-701
• /
• 2003

In this paper, we have characterizations of almost P-spaces which are analogous characterizations of P-spaces and we will show that if X is an almost P-space such that it is $C^{*}-embedded$ in every almost P-space in which X is embedded, then $$\mid${\upsilon}X-X$\mid${\leq}1$ and that if $$\mid${\upsilon}X-X$\mid${\leq}1$ and ${\upsilon}X$ is Lindelof, then for any almost P-space Y in which X is dense embedded, then X is $C^{*}-embeded$ in Y.

• Journal of Broadcast Engineering
• /
• v.12 no.2
• /
• pp.112-119
• /
• 2007

Reversible data embedding theory has marked a new epoch for data hiding and information security. Being reversible, the original data and the embedded data as well should be completely restored. Difference expansion transform is a remarkable breakthrough in reversible data hiding scheme. The difference expansion method achieves high embedding capacity and keeps the distortion low. This paper shows that the difference expansion method with simplified location map, and new expandability and changeability can achieve more embedding capacity while keeping the distortion almost the same as the original expansion method.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.895-898
• /
• 1999

Recently, small signal modeling of CMOS device becomes more difficult because the design rule goes into deep submicron. De-embedding of substrate parameters is important in order to use CMOS devices at RF frequencies. In this paper, we suggest a new de-embedding model with refined physical meaning and accuracy. In GaAs IC’s, the substrate is almost an insulator but Si substrate has the semiconducting characteristics. It offers some troubles if it is treated like GaAs substrate. The conducting substrate is modeled with five resistances, which leads to very accurate modeling so long as the pad layout is symmetrical. Frequency range is up to 39㎓ and fitting accuracy is as small as 0.00037 on least square errors.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.1845-1865
• /
• 2019

Current Internet is designed by lots of service providers with different objects and policies which make the direct deployment of radically new architecture and protocols on Internet nearly impossible without reaching a consensus among almost all of them. Network virtualization is proposed to fend off this ossification of Internet architecture and add diversity to the future Internet. As an important part of network virtualization, virtual network embedding (VNE) problem has received more and more attention. In order to solve the problems of large embedding cost, low acceptance ratio (AR) and environmental adaptability in VNE algorithms, cognitive method is introduced to improve the adaptability to the changing environment and a cognitive virtual network embedding algorithm based on weighted relative entropy (WRE-CVNE) is proposed in this paper. At first, the weighted relative entropy (WRE) method is proposed to select the suitable substrate nodes and paths in VNE. In WRE method, the ranking indicators and their weighting coefficients are selected to calculate the node importance and path importance. It is the basic of the WRE-CVNE. In virtual node embedding stage, the WRE method and breadth first search (BFS) algorithm are both used, and the node proximity is introduced into substrate node ranking to achieve the joint topology awareness. Finally, in virtual link embedding stage, the CPU resource balance degree, bandwidth resource balance degree and path hop counts are taken into account. The path importance is calculated based on the WRE method and the suitable substrate path is selected to reduce the resource fragmentation. Simulation results show that the proposed algorithm can significantly improve AR and the long-term average revenue to cost ratio (LTAR/CR) by adjusting the weighting coefficients in VNE stage according to the network environment. We also analyze the impact of weighting coefficient on the performance of the WRE-CVNE. In addition, the adaptability of the WRE-CVNE is researched in three different scenarios and the effectiveness and efficiency of the WRE-CVNE are demonstrated.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.55 no.4
• /
• pp.165-172
• /
• 2006

In this paper we present a technique for detecting cross-reference points that allows improving watermark detect-ability. In general, Harris detector is commonly used for finding salient points. Harris detector is a kind of combined corner and edge detector which is based on neighboring image data distribution, therefore it has some limitation to find accurate salient points after watermark embedding or any kinds of digital attacks. The new method proposed in this paper used not data distribution but geometrical structure of a normalized image in order to avoid pointing error caused by the distortion of image data. After normalization, we constructed pre-specified number of virtual lines from top to bottom and left to right, and several of cross points were selected by a random key. These selected points specify almost same positions with the accuracy more than that of Harris detector after digital attacks. These points were arranged by a random key, and blocks centered in these points were formed. A reference watermark is formed by a block and embedded in the next block. Because same alteration is applied to the watermark generated and embedded blocks. the detect-ability of watermark is improved even after digital attacks.

• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.55-60
• /
• 2014

In this paper, we will obtain Marcinkiewicz's type limit laws for fuzzy random sets as follows : Let {$X_n{\mid}n{\geq}1$} be a sequence of independent identically distributed fuzzy random sets and $E{\parallel}X_i{\parallel}^r_{{\rho_p}}$ < ${\infty}$ with $1{\leq}r{\leq}2$. Then the following are equivalent: $S_n/n^{\frac{1}{r}}{\rightarrow}{\tilde{0}}$ a.s. in the metric ${\rho}_p$ if and only if $S_n/n^{\frac{1}{r}}{\rightarrow}{\tilde{0}}$ in probability in the metric ${\rho}_p$ if and only if $S_n/n^{\frac{1}{r}}{\rightarrow}{\tilde{0}}$ in $L_1$ if and only if $S_n/n^{\frac{1}{r}}{\rightarrow}{\tilde{0}}$ in $L_r$ where $S_n={\Sigma}^n_{i=1}\;X_i$.

• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.5
• /
• pp.266-276
• /
• 2013

LSB-based steganography is a simple and well known information hiding technique. In most LSB based techniques, a secret message is embedded into a specific position of LSB in the cover pixels. On the other hand, the main threat of LSB-based steganography is steganalysis. This paper proposes an asynchronous-cellular-automata(ACA)-based steganographic method, where secret bits are embedded into the selected position inside the cover pixel by ACA rule 51 and a secret key. As a result, it is very difficult for malicious users to retrieve a secret message from a cover image without knowing the secret key, even if the extraction algorithm is known. In addition, another layer of security is provided by almost random (rule-based) selection of a cover pixel for embedding using ACA and a different secret key. Finally, the experimental results show that the proposed method can be secured against the well-known steganalysis RS-attack.