• Journal of Wetlands Research
• /
• v.19 no.4
• /
• pp.443-450
• /
• 2017

The objective of this study was to isolate algae growth inhibiting microorganism to biologically control Microcystis aeruginosa, which is a harmful cyanobacterium. Various bacterial strains were isolated in this study, and four bacterial strains of M1~M4 exhibited remarkable growth inhibiting activity against M. aeruginosa. Based on the 16S rRNA analysis, the isolated M1~M4 strains were identified, and isolated four strains were rod-type and gram-negative. In particular, as well as respective single strain, co-culture of the isolated M1~M4 strains showed obvious algicidal activity against M. aeruginosa. When mixed four strains were inoculated, about 50% of the chlorophyll a was reduced after two days, about 70% after four days, and about 80% after seven days. From these results mentioned above, the four bacterial strains may contribute to the control of harmful M. aeruginosa.

• Communications of the Korean Mathematical Society
• /
• v.38 no.1
• /
• pp.39-46
• /
• 2023

Let R be a commutative ring, M be a Noetherian R-module, and N a 2-absorbing submodule of M such that r(N :_R M) = 𝖕 is a prime ideal of R. The main result of the paper states that if N = Q₁ ∩ ⋯ ∩ Q_n with r(Q_i :_R M) = 𝖕_i, for i = 1, . . . , n, is a minimal primary decomposition of N, then the following statements are true. (i) 𝖕 = 𝖕_k for some 1 ≤ k ≤ n. (ii) For each j = 1, . . . , n there exists m_j ∈ M such that 𝖕_j = (N :_R m_j). (iii) For each i, j = 1, . . . , n either 𝖕_i ⊆ 𝖕_j or 𝖕_j ⊆ 𝖕_i. Let Γ_E(M) denote the zero-divisor graph of equivalence classes of zero divisors of M. It is shown that {Q₁∩ ⋯ ∩Q_n-1, Q₁∩ ⋯ ∩Q_n-2, . . . , Q₁} is an independent subset of V (Γ_E(M)), whenever the zero submodule of M is a 2-absorbing submodule and Q₁ ∩ ⋯ ∩ Q_n = 0 is its minimal primary decomposition. Furthermore, it is proved that Γ_E(M)[(0 :_R M)], the induced subgraph of Γ_E(M) by (0 :_R M), is complete.

• Kyungpook Mathematical Journal
• /
• v.46 no.3
• /
• pp.449-461
• /
• 2006

Generalizing twist moves of classical knots, we introduce $t(a_1,{\cdots},a_m)$-moves of virtual knots for an $m$-tuple ($a_1,{\cdots},a_m$) of nonzero integers. In [4], M. Goussarov, M. Polyak and O. Viro introduced finite type invariants of virtual knots and Gauss diagram formulae giving combinatorial presentations of finite type invariants. By using the Gauss diagram formulae for the finite type invariants of degree 2, we give a necessary condition for a virtual long knot K to be transformed to a virtual long knot K' by a finite sequence of $t(a_1,{\cdots},a_m)$-moves for an $m$-tuple ($a_1,{\cdots},a_m$) of nonzero integers with the same sign.

• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.2
• /
• pp.223-229
• /
• 2010

We introduce the notion of weak M-semicontinuity which is a generalization of M-semicontinuity defined between spaces with minimal structures. We also investigate some properties and characterizations for such a notion.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.1
• /
• pp.83-102
• /
• 2019

For $M{\in}R-Mod$, $N{\subseteq}M$ and $L{\in}{\sigma}[M]$ we consider the product $N_ML={\sum}_{f{\in}Hom_R(M,L)}\;f(N)$. A module $N{\in}{\sigma}[M]$ is called an M-multiplication module if for every submodule L of N, there exists a submodule I of M such that $L=I_MN$. We extend some important results given for multiplication modules to M-multiplication modules. As applications we obtain some new results when M is a semiprime Goldie module. In particular we prove that M is a semiprime Goldie module with an essential socle and $N{\in}{\sigma}[M]$ is an M-multiplication module, then N is cyclic, distributive and semisimple module. To prove these results we have had to develop new methods.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.273-287
• /
• 2016

White-box cryptography presented by Chow et al. is an obfuscation technique for protecting secret keys in software implementations even if an adversary has full access to the implementation of the encryption algorithm and full control over its execution platforms. Despite its practical importance, progress has not been substantial. In fact, it is repeated that as a proposal for a white-box implementation is reported, an attack of lower complexity is soon announced. This is mainly because most cryptanalytic methods target specific implementations, and there is no general attack tool for white-box cryptography. In this paper, we present an analytic toolbox on white-box implementations of the Chow et al.'s style using lookup tables. According to our toolbox, for a substitution-linear transformation cipher on n bits with S-boxes on m bits, the complexity for recovering the $$O\((3n/max(m_Q,m))2^{3max(m_Q,m)}+2min\{(n/m)L^{m+3}2^{2m},\;(n/m)L^32^{3m}+n{\log}L{\cdot}2^{L/2}\}\)$$, where $m_Q$ is the input size of nonlinear encodings,$m_A$ is the minimized block size of linear encodings, and $L=lcm(m_A,m_Q)$. As a result, a white-box implementation in the Chow et al.'s framework has complexity at most $O\(min\{(2^{2m}/m)n^{m+4},\;n{\log}n{\cdot}2^{n/2}\}\)$ which is much less than $2^n$. To overcome this, we introduce an idea that obfuscates two advanced encryption standard (AES)-128 ciphers at once with input/output encoding on 256 bits. To reduce storage, we use a sparse unsplit input encoding. As a result, our white-box AES implementation has up to 110-bit security against our toolbox, close to that of the original cipher. More generally, we may consider a white-box implementation of the t parallel encryption of AES to increase security.

• Korean Journal of Mathematics
• /
• v.16 no.4
• /
• pp.481-494
• /
• 2008

Iteration functions $K_m(z)$ and $U_m(z)$, $m{\geq}2$are defined recursively using the determinant of a matrix. We show that the fixed-iterations of $K_m(z)$ and $U_m(z)$ converge to a simple zero with order of convergence m and give closed form expansions of $K_m(z)$ and $U_m(z)$: To show the convergence, we derive a recursion formula for $L_m$ and then apply the idea of Ford or Pomentale. We also find a Toeplitz matrix whose determinant is $L_m(z)/(f^{\prime})^m$, and then we adapt the well-known results of Gerlach and Kalantari et.al. to give closed form expansions.

• Bulletin of the Korean Mathematical Society
• /
• v.35 no.4
• /
• pp.809-817
• /
• 1998

We investigate when the product of two smooth manifolds admits a weakly Lagrangian embedding. Prove that, if $M^m$ and $N^n$ are smooth manifolds such that M admits a weakly Lagrangian embedding into ${\mathbb}C^m$ whose normal bundle has a nowhere vanishing section and N admits a weakly Lagrangian immersion into ${\mathbb}C^n$, then $M \times N$ admits a weakly Lagrangian embedding into ${\mathbb}C^{m+n}$. As a corollary, we obtain that $S^m {\times} S^n$ admits a weakly Lagrangian embedding into ${\mathbb}C^{m+n}$ if n=1,3. We investigate the problem of whether $S^m{\times}S^n$ in general admits a weakly Lagrangian embedding into ${\mathbb} C^{m+n}$.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.3
• /
• pp.151-157
• /
• 2019

In this paper, we present a prototype system for controlling IoT home appliances via voice-based commands. A voice command has been widely deployed as one of unobtrusive user interfaces for applications in a variety of IoT domains. However, interoperability between diverse IoT systems is limited by several dominant companies providing voice assistants like Amazon Alexa or Google Now due to their proprietary systems. A global IoT standard, oneM2M has been proposed to mitigate the lack of interoperability between IoT systems. In this paper, we deployed oneM2M-based platforms for a voice record device like a wrist band and LED control device like a home appliance. We developed all the components for recording voices and controlling IoT devices, and demonstrate the feasibility of our proposed method based on oneM2M platforms and Google STT (Speech-to-Text) API for controlling home appliances by showing a user scenario for turning the LED device on and off via voice commands.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.2
• /
• pp.480-497
• /
• 2012

As a new business concept, machine-to-machine (M2M) communications are born from original telemetry technology with the intrinsic features of automatic data transmissions and measurement from remote sources typically by cable or radio. M2M includes a number of technologies that need to be combined in a compatible manner to enable its deployment over a broad market of consumer electronics. In order to provide better understanding for this emerging concept, the correlations among M2M, wireless sensor networks, cyber-physical systems (CPS), and internet of things are first analyzed in this paper. Then, the basic M2M architecture is introduced and the key elements of the architecture are presented. Furthermore, the progress of global M2M standardization is reviewed, and some representative applications (i.e., smart home, smart grid and health care) are given to show that the M2M technologies are gradually utilized to benefit people's life. Finally, a novel M2M system integrating intelligent road with unmanned vehicle is proposed in the form of CPS, and an example of cyber-transportation systems for improving road safety and efficiency are introduced.