• 사물인터넷융복합논문지
• /
• 제9권2호
• /
• pp.47-54
• /
• 2023

마이데이터 서비스를 이용하여 정보 주체인 개인이 본인의 정보를 적극적으로 관리 및 통제하여 이를 신용관리, 자산 관리 등에 능동적으로 활용할 수 있다. 마이데이터는 기업과 기관 중심의 개인 데이터 생태계를 데이터의 주인인 개인에게 자신의 데이터를 통제하고 관리하여 활용할 수 있는 권한을 부여하는 것이다. 마이데이터 서비스를 성공적으로 제공하기 위해서는 다양한 기관에서 제공되는 서로 다른 형식의 데이터를 표준 규격 형태로 변환하기 위한 API G/W의 개발이 필수적인 요소이다. 본 논문에서는 마이데이타 서비스의 API G/W 개발을 위해 검증(Validation) 기능, 관리(Throttling) 기능, 인증 및 권한(Authentication & Authorization) 기능, 중재(Mediation) 기능으로 주요 기능들을 도출하고 각 세부 기능별로 해당 서비스를 설계하였다. 설계된 API G/W의 기능들을 통해 다양한 형식의 요구들을 서비스할 수 있는 마이데이터 서비스를 안전하고 효율적으로 지원할 수 있었다.

• 한국인지과학회:학술대회논문집
• /
• 한국인지과학회 2000년도 춘계 학술대회
• /
• 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
• /
• 제61권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
• /
• 제4권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
• /
• 제33권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.

• 대한수학회보
• /
• 제29권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
• /
• 제13권6호
• /
• pp.730-734
• /
• 1998

An이ew식과 Aiba삭을 조합하여 에탄올 생산단주인 Saccharomyces cerevisiae ATCC 24858의 비성장속도를 당농도와 에탄올 농도의 함수로 표현하였다. 기침의 저해영향을 받지 않는 최대 당농도 $S_m$은 150 g/L이며 기질의 저해영향은 기질농도 S와 $S-S_{max}$항의 함수로 표현되었다. 최대 비성장 속도 ${\mu}max 는 0.49 hr^{-1}, Monod상수 K_s$는 19 g/L, Andrew식의 기질저해상수 $K_1$는 139 g/L이였다. 또한 비성장속도에 영향을 마치지 앓는 최대알콜농도 Pm이 존재하였으며 그 값은 2 g/L 이였다. 따라서 Aiba식에서 비성장속도에 영향을 미치는 에탄올 농도항은 P-Pm으보 표현되었다. 본 연구의 알코올생산균주에 대한 비성장속도의 완성된 수식은 디음과 같으며 이 수식에 위한 계산값은 평균오차 6% 내외의 범위에서 실험값과 일치하였다.

• Journal of applied mathematics & informatics
• /
• 제10권1_2호
• /
• pp.297-308
• /
• 2002

• Journal of applied mathematics & informatics
• /
• 제38권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.

• 대한수학회보
• /
• 제48권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.