• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5324-5337
• /
• 2017

In this paper, we investigate the feasibility of interference alignment(IA) in signal space in the scenario of multiple cell and multiple user cellular networks, as the feasibility issue is closely related to the solvability of a multivariate polynomial system, we give the mathematical analysis to support the constraint condition obtained from the polynomial equations with the tools of algebraic geometry, and a new distribute IA algorithm is also provided to verify the accessibility of the constraint condition for symmetric system in this paper. Simulation results illustrate that the accessibility of the constraint condition is hold if and only if the degree of freedom(DoF) of each user can be divided by both the transmit and receive antenna numbers.

• Publications of The Korean Astronomical Society
• /
• v.24 no.1
• /
• pp.43-51
• /
• 2009

We present a Monte-Carlo simulation code, which solves the problem of dust-scattering in interstellar dust clouds with arbitrary light source distribution and dust density structure, and calculate the surface brightness distribution. The method is very flexible and can be applied to radiative transfer problems occurring not only in a single dust cloud, but also in extragalactic dust environment. We compare, for performance test, the result of Monte-Carlo simulation with the well-known analytic approximation for a spherically symmetric homogeneous cloud. We find that the Code approximation gives a very accurate result.

• Kyungpook Mathematical Journal
• /
• v.60 no.3
• /
• pp.485-505
• /
• 2020

We present a complete description of all the extreme points of the unit ball of 𝓛_s(²𝑙³_∞) which leads to a complete formula for ║f║ for every f ∈ 𝓛_s(²𝑙³_∞)^∗. We also show that $extB_{{\mathcal{L}}_s(^2l^3_{\infty})}{\subset}extB_{{\mathcal{L}}_s(^2l^n_{\infty})}$ for every n ≥ 4. Using the formula for ║f║ for every f ∈ 𝓛_s(²𝑙³_∞)^∗, we show that every extreme point of the unit ball of 𝓛_s(²𝑙³_∞) is exposed. We also characterize all the smooth points of the unit ball of 𝓛_s(²𝑙³_∞).

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.17 no.4
• /
• pp.448-452
• /
• 2004

The micromachined variable optical attenuator(VOA) was presented in the paper. The VOA has two single mode fiber(SMF) aligned with free space and symmetric parallel plate actuator with microshutter, which can control a amount of light by driving the actuator. In the paper, analysis on driving performances of the VOA was performed and can be reduced threshold voltage through the decreasing displacement actuating range. This paper presents a VOA that is fabricated using bosch deep silicon etching process with silicon on insulator(SOD wafer. The VOA consists of driving electrode, ground electrode, actuating microshutter, and mechanical stopper. In this VOA, actuating shutter is driven by electrostatic force and the threshold voltage is close to 28V, 46V come along with the spring width of 5${\mu}{\textrm}{m}$, 7${\mu}{\textrm}{m}$ respectively. Attenuation range is measured from 2.4㏈ to 16.7㏈.

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.1
• /
• pp.78-89
• /
• 2003

Ordering is performed to reduce the amount of fill-ins of the Cholesky factor of a symmetric positive definite matrix. This paper proposes a new ordering algorithm that reduces the fill-ins of the Cholesky factor iteratively by elimination tree rotations and clique separators. Elimination tree rotations have been used mainly to reorder the rows of the permuted matrix for the efficiency of storage space management or parallel processing, etc. In the proposed algorithm, however, they are repeatedly performed to reduce the fill-ins of the Cholesky factor. In addition, we presents a simple method for finding a minimal node separator between arbitrary two nodes of a chordal graph. The proposed reordering procedure using clique separators enables us to obtain another order of rows of which the number of till-ins decreases strictly.

• Korean Journal of Mathematics
• /
• v.26 no.4
• /
• pp.709-727
• /
• 2018

Here we have studied the ideas of $g^*$-closed sets, $g{\bigwedge}_{{\tau}^-}$ sets and ${\lambda}^*$-closed sets and investigate some of their properties in the spaces of A. D. Alexandroff [1]. We have also studied some separation axioms like $T_{\frac{\omega}{4}}$, $T_{\frac{3\omega}{8}}$, $T_{\omega}$ in Alexandroff spaces and also have introduced a new separation axiom namely $T_{\frac{5\omega}{8}}$ axiom in this space.

• Journal of the Korean Mathematical Society
• /
• v.58 no.4
• /
• pp.1001-1017
• /
• 2021

In this paper, we first apply parabolic inequalities and a maximum principle to give a new proof for symmetry and monotonicity of solutions to fractional elliptic equations with gradient term by the method of moving planes. Under the condition of suitable initial value, by maximum principles for the fractional parabolic equations, we obtain symmetry and monotonicity of positive solutions for each finite time to nonlinear fractional parabolic equations in a bounded domain and the whole space. More generally, if bounded domain is a ball, then we show that the solution is radially symmetric and monotone decreasing about the origin for each finite time. We firmly believe that parabolic inequalities and a maximum principle introduced here can be conveniently applied to study a variety of nonlocal elliptic and parabolic problems with more general operators and more general nonlinearities.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.5
• /
• pp.971-983
• /
• 2021

In this paper, we prove common fixed point theorems for six weakly compatible mappings in G-fuzzy metric spaces introduced by Sun and Yang [16] which is actually generalization of G-metric spaces. G-metric spaces coined by Mustafa and Sims [13]. The paper concerns our sustained efforts for the materialization of G-fuzzy metric spaces and their properties. We also exercise the concept of symmetric G-fuzzy metric space, 𝜙-function and weakly compatible mappings. The results present in this paper generalize the well-known comparable results in the literature. We justify our results by suitable examples. Some applications are also given in support of our results.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.3
• /
• pp.671-683
• /
• 2022

The aim of this paper is to deal with the realization problem of a given Lagrangian submanifold of a symplectic manifold as the fixed point set of an anti-symplectic involution. To be more precise, let (X, ω, µ) be a toric Hamiltonian T-space, and let ∆ = µ(X) denote the moment polytope. Let τ be an anti-symplectic involution of X such that τ maps the fibers of µ to (possibly different) fibers of µ, and let p₀ be a point in the interior of ∆. If the toric fiber µ^-1(p₀) is real Lagrangian with respect to τ, then we show that p₀ should be the origin and, furthermore, ∆ should be centrally symmetric.

• ETRI Journal
• /
• v.45 no.3
• /
• pp.365-378
• /
• 2023

ARIA is a block cipher proposed by Kwon et al. at ICISC 2003 that is widely used as the national standard block cipher in the Republic of Korea. Herein, we identify some flaws in the quantum rebound attack on seven-round ARIA-DM proposed by Dou et al. and reveal that the limit of this attack is up to five rounds. Our revised attack applies to not only ARIA-DM but also ARIA-MMO and ARIA-MP among the PGV models, and it is valid for all ARIA key lengths. Furthermore, we present dedicated quantum rebound attacks on seven-round ARIA-Hirose and ARIA-MJH for the first time. These attacks are only valid for the 256-bit key length of ARIA because they are constructed using the degrees of freedom in the key schedule. All our attacks are faster than the generic quantum attack in the cost metric of the time-space tradeoff.