• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.17 no.1
• /
• pp.53-58
• /
• 2024

This study is about the technology convergence analysis of e-commerce related patents containing Artificial Intelligence applied for in Korea. The relationships between core technologies were analyzed and visualized using social network analysis. As a result of social network analysis, the core IPC codes that make up the mutual technology network in e-commerce related patents containing Artificial Intelligence were found to be G06Q, G06F, G06N, G16H, G10L, H04N, G06T, and A61B. In particular, it can be confirmed that there is an important convergence of data processing-related technologies such as [G06Q-G06F], [G06Q-G06N], and voice and image signals such as [G06Q-G10L], [G06Q-H04N], and [G06Q-G06T]. Using this research method, it is possible to identify future technology trends in e-commerce related patents and create new Business Models.

• Archives of Pharmacal Research
• /
• v.9 no.1
• /
• pp.15-18
• /
• 1986

Various naturally occuring methylated amino acid derivatives were resolved on high performance liquid chromatography (HPLC), using o-phthadialdehyde as a fluorogenic reagent. We separated .$\varepsilon$-N-monomethyllysine, $\varepsilon$-N- dimethyllysine, and $\varepsilon$-N-acetyllysine from lysine derivatives. $N^{G}$-Monomethylarginine and $N^{G}$-dimethylarginine were separated from arginine derivatives. However, $\varepsilon$-N-monomethyllsine and $\varepsilon$-N-trimethyllysine, $N^{G}$, $N^{G}$-dimethylarginine and $N^{G}$, $N^{G}$-dimethylarginine were not resolved under the conditions employed. S-Methylmethionine, S-methylcysteine, and 1-N-methylhistidine or 3-N-methylhistidine were clearly separated from their reference amino acids, even though 1-N-methyl-and 3-N-methylhistidine coul not be separated.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.217-227
• /
• 2005

Let G be a finite group and $\#$Cent(G) denote the number of centralizers of its elements. G is called n-centralizer if $\#$Cent(G) = n, and primitive n-centralizer if $\#$Cent(G) = $\#$Cent($\frac{G}{Z(G)}$) = n. In this paper we investigate the structure of finite groups with at most 21 element centralizers. We prove that such a group is solvable and if G is a finite group such that G/Z(G)$\simeq$$A_5$, then $\#$Cent(G) = 22 or 32. Moreover, we prove that As is the only finite simple group with 22 centralizers. Therefore we obtain a characterization of As in terms of the number of centralizers

• Journal of applied mathematics & informatics
• /
• v.34 no.5_6
• /
• pp.435-441
• /
• 2016

Let G be a graph, and let g, f be two nonnegative integer-valued functions defined on V (G) with g(x) ≤ f(x) for each x ∈ V (G). A graph G is called a fractional (g, f, n)-critical graph if after deleting any n vertices of G the remaining graph of G admits a fractional (g, f)-factor. In this paper, we obtain a binding number condition for a graph to be a fractional (g, f, n)-critical graph, which is an extension of Zhou and Shen's previous result (S. Zhou, Q. Shen, On fractional (f, n)-critical graphs, Inform. Process. Lett. 109(2009)811-815). Furthermore, it is shown that the lower bound on the binding number condition is sharp.

• Honam Mathematical Journal
• /
• v.30 no.4
• /
• pp.603-616
• /
• 2008

A generalized n-dimensional Riemannian manifold $X_n$ on which the differential geometric structure is imposed by the unified field tensor $^*g^{{\lambda}{\nu}}$, satisfying certain conditions, through the $^*g$-ME-connection which is both Einstein's equation and of the form(3.1) is called $^*g$-ME-manifold and we denote it by $^*g-MEX_n$. In this paper, we prove a necessary and sufficient condition for the existence of $^*g$-ME-connection and derive a surveyable tensorial representation of the $^*g$-ME-connection and the $^*g$-ME-vector in $^*g-MEX_n$.

• Asian-Australasian Journal of Animal Sciences
• /
• v.24 no.10
• /
• pp.1393-1398
• /
• 2011

Four 4-month old Charolais${\times}$Dorset male sheep (initial liveweight $25.0{\pm}1.1\;kg$), fitted with rumen and abomasal fistulas and nourished by total intragastric infusions, were used to study the relationships between methionine (Met) supply, nitrogen (N) retention and plasma insulin-like growth factor-I (IGF-I). Four graded levels of Met, i.e. 0 g/16 g N, 1.76 g/16 g N, 3.52 g/16 g N and 7.04 g/16 g N, were infused into abomasums as experimental treatments. The sheep and treatments were allocated in a $4{\times}3$ incomplete Latin square design (Yudon square design). The experiment lasted 3 periods and each period was 10 days. Quadratic correlations were found between Met level (x, g/16 g N) and N retention (y, g/d): y = $-0.03x^2$+0.41x+2.62, $r^2$ = 0.66, n = 12, p = 0.008, and between methionine level (x, g/16 g N) and plasma IGF-I concentration (y, ng/ml): y = $0.80x^2$-4.53x+190.24, $r^2$ = 0.51, n = 12, p = 0.009. No significant correlation was found between plasma IGF-I (x, ng/ml) and N retention (y, g/d) (p>0.05). It was concluded that Met level had a significant influence on N retention and plasma IGF-I concentration whereas IGF-I might not be an important mediator in the regulation of N metabolism by Met in growing sheep nourished by total intragastric infusions.

• Kyungpook Mathematical Journal
• /
• v.54 no.1
• /
• pp.95-101
• /
• 2014

An n-tuple ($a_1,a_2,{\ldots},a_n$) is symmetric, if $a_k$ = $a_{n-k+1}$, $1{\leq}k{\leq}n$. Let $H_n$ = {$(a_1,a_2,{\ldots},a_n)$ ; $a_k$ ${\in}$ {+,-}, $a_k$ = $a_{n-k+1}$, $1{\leq}k{\leq}n$} be the set of all symmetric n-tuples. A symmetric n-sigraph (symmetric n-marked graph) is an ordered pair $S_n$ = (G,${\sigma}$) ($S_n$ = (G,${\mu}$)), where G = (V,E) is a graph called the underlying graph of $S_n$ and ${\sigma}$:E ${\rightarrow}H_n({\mu}:V{\rightarrow}H_n)$ is a function. The restricted super line graph of index r of a graph G, denoted by $\mathcal{R}\mathcal{L}_r$(G). The vertices of $\mathcal{R}\mathcal{L}_r$(G) are the r-subsets of E(G) and two vertices P = ${p_1,p_2,{\ldots},p_r}$ and Q = ${q_1,q_2,{\ldots},q_r}$ are adjacent if there exists exactly one pair of edges, say $p_i$ and $q_j$, where $1{\leq}i$, $j{\leq}r$, that are adjacent edges in G. Analogously, one can define the restricted super line symmetric n-sigraph of index r of a symmetric n-sigraph $S_n$ = (G,${\sigma}$) as a symmetric n-sigraph $\mathcal{R}\mathcal{L}_r$($S_n$) = ($\mathcal{R}\mathcal{L}_r(G)$, ${\sigma}$'), where $\mathcal{R}\mathcal{L}_r(G)$ is the underlying graph of $\mathcal{R}\mathcal{L}_r(S_n)$, where for any edge PQ in $\mathcal{R}\mathcal{L}_r(S_n)$, ${\sigma}^{\prime}(PQ)$=${\sigma}(P){\sigma}(Q)$. It is shown that for any symmetric n-sigraph $S_n$, its $\mathcal{R}\mathcal{L}_r(S_n)$ is i-balanced and we offer a structural characterization of super line symmetric n-sigraphs of index r. Further, we characterize symmetric n-sigraphs $S_n$ for which $\mathcal{R}\mathcal{L}_r(S_n)$~$\mathcal{L}_r(S_n)$ and $$\mathcal{R}\mathcal{L}_r(S_n){\sim_=}\mathcal{L}_r(S_n)$$, where ~ and $$\sim_=$$ denotes switching equivalence and isomorphism and $\mathcal{R}\mathcal{L}_r(S_n)$ and $\mathcal{L}_r(S_n)$ are denotes the restricted super line symmetric n-sigraph of index r and super line symmetric n-sigraph of index r of $S_n$ respectively.

• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.3
• /
• pp.495-510
• /
• 2010

An Einstein's connection which takes the form (2.23) is called a $^*g$-ME-connection and the corresponding vector is called a $^*g$-ME-vector. The $^*g$-ME-manifold is a generalized n-dimensional Riemannian manifold $X_n$ on which the differential geometric structure is imposed by the unified field tensor $^*g^{{\lambda}{\nu}}$, satisfying certain conditions, through the $^*g$-ME-connection and we denote it by $^*g-MEX_n$. The purpose of this paper is to derive a general representation and a special representation of the $^*g$-ME-vector in $^*g-MEX_n$.

• Communications of the Korean Mathematical Society
• /
• v.34 no.1
• /
• pp.279-286
• /
• 2019

Complex Grassmann manifolds $G_{n,k}$ are a generalization of complex projective spaces and have many important features some of which are captured by the $Pl{\ddot{u}}cker$ embedding $f:G_{n,k}{\rightarrow}{\mathbb{C}}P^{N-1}$ where $N=\(^n_k\)$. The problem of existence of cross sections of fibrations can be studied using the Gottlieb group. In a more generalized context one can use the relative evaluation subgroup of a map to describe the cohomology of smooth fiber bundles with fiber the (complex) Grassmann manifold $G_{n,k}$. Our interest lies in making use of techniques of rational homotopy theory to address problems and questions involving applications of Gottlieb groups in general. In this paper, we construct the Sullivan minimal model of the (complex) Grassmann manifold $G_{n,k}$ for $2{\leq}k<n$, and we compute the rational evaluation subgroup of the embedding $f:G_{n,k}{\rightarrow}{\mathbb{C}}P^{N-1}$. We show that, for the Sullivan model ${\phi}:A{\rightarrow}B$, where A and B are the Sullivan minimal models of ${\mathbb{C}}P^{N-1}$ and $G_{n,k}$ respectively, the evaluation subgroup $G_n(A,B;{\phi})$ of ${\phi}$ is generated by a single element and the relative evaluation subgroup $G^{rel}_n(A,B;{\phi})$ is zero. The triviality of the relative evaluation subgroup has its application in studying fibrations with fibre the (complex) Grassmann manifold.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.261-271
• /
• 2007

The symbol C($m_1^{n_1}m_2^{n_2}{\cdots}m_s^{n_s}$) denotes a 2-regular graph consisting of $n_i$ cycles of length $m_i,\;i=1,\;2,\;{\cdots},\;s$. In this paper, we give some construction methods of cyclic($K_v$, G)-designs, and prove that there exists a cyclic($K_v$, G)-design when $G=C((4m_1)^{n_1}(4m_2)^{n_2}{\cdots}(4m_s)^{n_s}\;and\;v{\equiv}1(mod\;2|G|)$.