• Korean Journal of Computational Design and Engineering
• /
• v.13 no.2
• /
• pp.98-108
• /
• 2008

Plant, civil engineering and construction equipment data of overseas construction are obtained and then analyzed, classified and integrated by experts. With those refined data set, we built classification system and defined property information with reference to international standard (ISO 15926, IRDL). If class in ISO 15926 is predefined for equipment of interest, we used the class as is. If not, we created and defined new classes on the basis of ISO 15926 classes. If there is similar class for equipment of interest, extension or inheritance methods were used. As a result, classification system of five levels and 637 classes were built and construction equipment information were expressed in open structure of XML such as tree structure of classification system and detailed information with number equipments for each specific equipment. We also developed the electronic catalog system which is basically equipment information management system providing various product search functions.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.05a
• /
• pp.163-163
• /
• 2001

The primary research questions in this paper are why and how competing firms collaborate, not compete, in the virtual marketplace, e.g., B2B marketplace in the Internet environment. In order to answer the questions, we take on a system dynamics simulation approach: we consider two broad e-collaboration strategies: · Exclusive e-business strategy If the firm adopts this strategy, it allocates all of its resources (available for e-business development) to its own e-business capability building only. · Collaborative e-business strategy When the firm adopts a collaborative e-business strategy, it invests not only in its own, but also the industrys e-business capability building. From the system dynamics simulation results, we conclude that e-collaboration pays off in the long run: although it is hard to tell whether the collaborative strategy is better than the exclusive one during the initial period, it is unambiguous that the collaborative e-business strategy Performs much better in the long run. We infer that such collaboration could occur when the firms realize that they benefit from the expansion of the market demand due to their collaboration. That is, in order for such collaboration between competing firms to be sustainable, such collaboration should create more demand in the market so that each company could earn more profit even if it gets less in terms of market share.

• The Pure and Applied Mathematics
• /
• v.2 no.1
• /
• pp.53-59
• /
• 1995

Consider a solution y(t) of the nonlinear equation (E) y" ＋ f(t, y) = 0. A solution y(t) is said to be oscillatory if for every T ＞ 0 there exists $t_{0}$ ＞ T such that y($t_{0}$) = 0. Let F be the class of solutions of (E) which are indefinitely continuable to the right, i.e. y $\in$ F implies y(t) exists as a solution to (E) on some interval of the form [t$\sub$y/, $\infty$). Equation (E) is said to be oscillatory if each solution from F is oscillatory.(omitted)

• The Pure and Applied Mathematics
• /
• v.18 no.4
• /
• pp.361-368
• /
• 2011

In this paper, we construct a cover ($\mathcal{L}(X)$, $c_X$) of a space X such that for any cloz-cover (Y, f) of X, there is a covering map g : $Y{\longrightarrow}\mathcal{L}(X)$ with $c_X{\circ}g=f$. Using this, we show that every Tychonoff space X has a minimal cloz-cover ($E_{cc}(X)$, $z_X$) and that for a strongly zero-dimensional space X, ${\beta}E_{cc}(X)=E_{cc}({\beta}X)$ if and only if $E_{cc}(X)$ is $z^{\sharp}$-embedded in $E_{cc}({\beta}X)$.

• Journal of applied mathematics & informatics
• /
• v.41 no.2
• /
• pp.321-330
• /
• 2023

Let G = (V, E) be a graph. Consider the group S₃. Let g : V (G) → S₃ be a function. For each edge xy assign the label 1 if ${\lceil}{\frac{o(g(x))+o(g(y))}{2}}{\rceil}$ is odd or 0 otherwise. g is a group S₃ mean cordial labeling if |v_g(i) - v_g(j)| ≤ 1 and |e_g(0) - e_g(1)| ≤ 1, where vg(i) and e_g(y)denote the number of vertices labeled with an element i and number of edges labeled with y (y = 0, 1). The graph G with group S₃ mean cordial labeling is called group S₃ mean cordial graph. In this paper, we discuss group S3 mean cordial labeling for star related graphs.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.65-71
• /
• 2008

This paper proposes a structure of haptic collaboration system over high resolution tiled-display, and proposes a QoE (quality of experience) increase scheme in integrated system. Both haptic system and tiled-display system have requirements of computational power. A haptic device is unstable if haptic rendering rate is less than 1kHz, A requirement of tiled-display systeme is frame rate of display. It requires update of 30 frame fer sec. If we use these systems independently, we can satisfy each requirements. However, if we integrate two systems, performance of entire system significantly decreases because of lack of resources, and QoE of users also decrease. In this paper, therefore, we propose a QoE guaranty scheme which selectively allocates cpu resource between display update and haptic rendering. In order to increase QoE, we set a priority for visual and haptic in order to allocate more resource on visual or haptic. If a user sensitive about touch, then proposed scheme increases haptic rendering rate by allocating more resource. Otherwise a user more sensitive about visual than haptic, proposed scheme decreases haptic rendering rate and increases tiled-display update rate. Therefore, by selectively allocating limited cpu resource, proposed scheme guaranties QoE of both haptic and visual.

• Journal of the Korean Mathematical Society
• /
• v.36 no.6
• /
• pp.1133-1143
• /
• 1999

Chaterji strengthened version of a theorem for martin-gales which is a generalization of a theorem of Marcinkiewicz proving that if $X_n$ is a sequence of independent, identically distributed random variables with $E{\mid}X_n{\mid}^p\;<\;{\infty}$, 0 < P < 2 and $EX_1\;=\;1{\leq}\;p\;<\;2$ then $n^{-1/p}{\sum^n}_{i=1}X_i\;\rightarrow\;0$ a,s, and in $L^p$. In this paper, we probe a version of law of large numbers for double arrays. If ${X_{ij}}$ is a double sequence of random variables with $E{\mid}X_{11}\mid^log^+\mid X_{11}\mid^p\;<\infty$, 0 < P <2, then $lim_{m{\vee}n{\rightarrow}\infty}\frac{{\sum^m}_{i=1}{\sum^n}_{j=1}(X_{ij-a_{ij}}}{(mn)^\frac{1}{p}}\;=0$ a.s. and in $L^p$, where $a_{ij}$ = 0 if 0 < p < 1, and $a_{ij}\;=\;E[X_{ij}\midF_[ij}]$ if $1{\leq}p{\leq}2$, which is a generalization of Etemadi's marcinkiewicz-type SLLN for double arrays. this also generalize earlier results of Smythe, and Gut for double arrays of i.i.d. r.v's.

• Honam Mathematical Journal
• /
• v.31 no.2
• /
• pp.259-265
• /
• 2009

Let $\mathcal{L}$ be a subspace lattice on a Hilbert space $\mathcal{H}$. Let x and y be vectors in $\mathcal{H}$ and let $P_x$ be the projection onto sp(x). If $P_xE$ = $EP_x$ for each E ${\in}\;\mathcal{L}$, then the following are equivalent. (1) There exists an operator A in Alg$\mathcal{L}$ such that Ax = y, Af = 0 for all f in $sp(x)^{\perp}$ and A ${\geq}$ 0. (2) sup ${\frac{{\parallel}E^{\perp}y{\parallel}}{{\parallel}E^{\perp}x{\parallel}}:E{\in}\mathcal{L}}$ < ${\infty}$ < x, y > ${\geq}$ 0. Let X and Y be operators in $\mathcal{B}(\mathcal{H})$. Let P be the projection onto $\overline{rangeX}$. If PE = EP for each E ${\in}\;\mathcal{L}$, then the following are equivalent: (1) sup ${\frac{{\parallel}E^{\perp}Yf{\parallel}}{{\parallel}E^{\perp}Xf{\parallel}}:f{\in}\mathcal{H},E{\in}\mathcal{L}}$ < ${\infty}$ and < Xf, Yf > ${\geq}$ 0 for all f in H. (2) There exists a positive operator A in Alg$\mathcal{L}$ such that AX = Y.

• Journal of the Chungcheong Mathematical Society
• /
• v.19 no.4
• /
• pp.375-381
• /
• 2006

This paper presents characterizations based on the identical distribution and the finite moments of the exponential distribution by record values. We prove that $X{\in}EXP({\sigma})$, ${\sigma}$>0, if and only if $X_{U(n+k)}-X_{U(n)}$ and $X_{U(n)}-X_{U(n-k)}$ for n > 1 and $k{\geq}1$ are identically distributed. Also, we show that $X{\in}EXP({\sigma})$, ${\sigma}$>0, if and only if $E(X_{U(n+k)}-X_{U(n)})=E(X_{U(n)}-X_{U(n-k)})$ for n>1 and $k{\geq}1$.

• Communications of the Korean Mathematical Society
• /
• v.26 no.2
• /
• pp.297-304
• /
• 2011

In this paper, we introduce closure operators [${\cdot}$]c and [${\cdot}$]a on a space and study some relations among [${\cdot}$]c, [${\cdot}$]a and countable tightness. We introduce the concepts of a strongly sequentially closed set and a strongly sequentially open set and show that a space X has countable tightness if and only if every strongly sequentially closed set is closed if and only if every strongly sequentially open set is open. Finally we find a generalization of the weak Fr$\'{e}$chet-Urysohn property which is equivalent to countable tightness.