• Journal of Internet of Things and Convergence
• /
• v.9 no.2
• /
• pp.47-54
• /
• 2023

The MyData service makes anyone possible to apply the personal information for the personal credit management or the financial management by proactive managing his/her own information. The MyData means that the anyone is able to control or manage the its own information by changing from the company-oriented or the organization-oriented information to his/her own information. It is mandatory to develop the API G/W which transforms the different user format to the standard format to support the MyData service. This study is to design the API G/W for the MyData service and the designed API G/W supports the 4 major functions - Validation function, Throttling function, Authentication&Authorization function, Mediation function. The designed API G/W make it possible to support the safely and efficient MyData service by serving the various queries with the different formats.

• Proceedings of the Korean Society for Cognitive Science Conference
• /
• 2000.05a
• /
• pp.322-328
• /
• 2000

This study discusses cognition as a computable mapping in cognitive system and relates G del's Incompleteness Theorems to the computability of cognition from a metamathematical perspective. Understanding cognition as a from of computation requires not only Turing machine models but also neural network models. In previous studies of computation by cognitive systems, it is remarkable to note how little serious attention has been given to the issue of computation by neural networks with respect to G del's Incompleteness Theorems. To address this problem, first, we introduce a definition of cognition and cognitive science. Second, we deal with G del's view of computability, incompleteness and speed-up theorems, and then we interpret G del's disjunction on the mind and the machine. Third, we discuss cognition as a Turing computable function and its relation to G del's incompleteness. Finally, we investigate cognition as a neural computable function and its relation to G del's incompleteness. The results show that a second-order representing system can be implemented by a finite recurrent neural network. Hence one cannot prove the consistency of such neural networks in terms of first-order theories. Neural computability, theoretically, is beyond the computational incompleteness of Turing machines. If cognition is a neural computable function, then G del's incompleteness result does not limit the compytational capability of cognition in humans or in artifacts.

• Kyungpook Mathematical Journal
• /
• v.61 no.4
• /
• pp.745-763
• /
• 2021

For a value s ∈ ℂ∪ {∞}, two meromorphic functions f and g are said to share the value s, CM, (or IM), provided that f(z)-s and g(z)-s have the same set of zeros, counting multiplicities, (respectively, ignoring multiplicities). We say that a meromorphic function f shares s ∈ Ŝ partially with a meromorphic function g if E(s, f) ⊆ E(s, g). It is easy to see that "partially shared values CM" are more general than "shared values CM". With the help of partially shared values, in this paper, we prove some uniqueness results between a non-constant meromorphic function and its generalized differences or shifts. We exhibit some examples to show that the result of Charak et al. [8] is not true for k = 2 or k = 3. We find some gaps in proof of the result of Lin et al. [24]. We not only correct these resuts, but also generalize them in a more convenient way. We give a number of examples to validate certain claims of the main results of this paper and also to show that some of conditions are sharp. Finally, we pose some open questions for further investigation.

• Communications for Statistical Applications and Methods
• /
• v.4 no.1
• /
• pp.281-292
• /
• 1997

In this paper we are concered with the counting processes with intersity function $g_n(t)$, where $g_n(t)$ not only depends on t but n. It is shown that under certain conditions the number of events in [0, t] follows a generalizes Poisson distribution. A counting process is also provided such that $g_i(t)$$\neq$$g_i(t)$ for i$\neq$j and the number of events in [0, t] has a transformed geometric distribution.

• Journal of applied mathematics & informatics
• /
• v.33 no.3_4
• /
• pp.343-350
• /
• 2015

We consider an M^X/G/1 retrial queue, where the batch size and service time distributions have finite exponential moments. We show that the tail of the queue size distribution is asymptotically given by a geometric function multiplied by a power function. Our result generalizes the result of Kim et al. (2007) to the M^X/G/1 retrial queue.

• Bulletin of the Korean Mathematical Society
• /
• v.29 no.1
• /
• pp.9-13
• /
• 1992

In this paper, we consider the function related with almost hermitian structure on a copact complex manifold. More precisely, on a 2n-diminsional complex manifold M admitting 2-form .ohm. of rank 2n everywhere, assume that M admits a metric g such that g(JX, JY)=g(X,Y), that is, assume that g defines an hermitian structure on M admitting .ohm. as fundamental 2-form-the 'almost complex structure' J being determined by g and .ohm.:g(X,Y)=.ohm.(X,JY). We consider the function I(g):=.int.$_{M}$ $N^{2}$d $V_{g}$, where N is the norm of Nijenhuis tensor N defined by (J,g). by (J,g).

• KSBB Journal
• /
• v.13 no.6
• /
• pp.730-734
• /
• 1998

The mathematical model of specific growth rate of Saccharomyces cerevisiae ATCC 24858 is proposed as a function of sugar and ethanol concentrations by the combination of Andrew's equation and Aiba's equation. The maximum concentration of sugar Sm, which was the highest concentration of sugar not having any effect on the growth inhibition, was 150 g/L and the substrate inhibition was expressed as a function of (S-Sm). The maximum specific growth inhibition, was 150 g/L and the substrate inhibition was expressed as a function of (S-Sm). The maximum specific growth rate ${\mu}m$, Monod's constant Ks, and Andrew's inhibition constant KI were 0.49 hr-1, 19 g/L, and 139 g/L, respectively. The maximum ethanol concentration, Pm, which did not show any inhibition effect on the specific growth rate was found to be 2 g/L. Therefore, the ethanol inhibition was represented as a function of (P-Pm). The final mathematical model for the specific growth rate of the microorganism in this work is proposed as the following. And the average percent of errors between the calculated specific growth rate and the experimental values was 5.96%.

• Journal of applied mathematics & informatics
• /
• v.10 no.1_2
• /
• pp.297-308
• /
• 2002

• Journal of applied mathematics & informatics
• /
• v.38 no.3_4
• /
• pp.221-238
• /
• 2020

Let G = (V (G), E(G)) be a graph and let g : V (G) → S₃ be a function. For each edge xy assign the label r where r is the remainder when o(g(x)) is divided by o(g(y)) or o(g(y)) is divided by o(g(x)) according as o(g(x)) ≥ o(g(y)) or o(g(y)) ≥ o(g(x)). The function g is called a group S₃ cordial remainder labeling of G if |v_g(i)-v_g(j)| ≤ 1 and |e_g(1)-e_g(0)| ≤ 1, where v_g(j) denotes the number of vertices labeled with j and e_g(i) denotes the number of edges labeled with i (i = 0, 1). A graph G which admits a group S₃ cordial remainder labeling is called a group S₃ cordial remainder graph. In this paper, we prove that subdivision of graphs admit a group S₃ cordial remainder labeling.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.4
• /
• pp.779-789
• /
• 2011

In this paper we study the Banach space $L^1$(G) of real valued measurable functions which are integrable with respect to a vector measure G in the sense of D. R. Lewis. First, we investigate conditions for a scalarly integrable function f which guarantee $f{\in}L^1$(G). Next, we give a sufficient condition for a sequence to converge in $L^1$(G). Moreover, for two vector measures F and G with values in the same Banach space, when F can be written as the integral of a function $f{\in}L^1$(G), we show that certain properties of G are inherited to F; for instance, relative compactness or convexity of the range of vector measure. Finally, we give some examples of $L^1$(G) related to the approximation property.