• 대한수학회보
• /
• 제45권4호
• /
• pp.717-728
• /
• 2008

Let H be a real Hilbert space and S = {T(s) : $0\;{\leq}\;s\;<\;{\infty}$} be a nonexpansive semigroup on H such that $F(S)\;{\neq}\;{\emptyset}$ For a contraction f with coefficient 0 < $\alpha$ < 1, a strongly positive bounded linear operator A with coefficient $\bar{\gamma}$ > 0. Let 0 < $\gamma$ < $\frac{\bar{\gamma}}{\alpha}$. It is proved that the sequences {$x_t$} and {$x_n$} generated by the iterative method $$x_t\;=\;t{\gamma}f(x_t)\;+\;(I\;-\;tA){\frac{1}{{\lambda}_t}}\;{\int_0}^{{\lambda}_t}\;T(s){x_t}ds,$$ and $$x_{n+1}\;=\;{\alpha}_n{\gamma}f(x_n)\;+\;(I\;-\;{\alpha}_nA)\frac{1}{t_n}\;{\int_0}^{t_n}\;T(s){x_n}ds,$$ where {t}, {${\alpha}_n$} $\subset$ (0, 1) and {${\lambda}_t$}, {$t_n$} are positive real divergent sequences, converges strongly to a common fixed point $\tilde{x}\;{\in}\;F(S)$ which solves the variational inequality $\langle({\gamma}f\;-\;A)\tilde{x},\;x\;-\;\tilde{x}{\rangle}\;{\leq}\;0$ for $x\;{\in}\;F(S)$.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1989년도 하계종합학술대회 논문집
• /
• pp.101-105
• /
• 1989

The iterative learning controller makes the system output follow the desired output over a finite time interval through iterating trials. In this paper, first we discuss that the design problem of learning controller is originally the design problem of the inverse model. Then we show that the tracking error which is the difference between the desired output and the system output is reduced monotonically by properly modeled inverse system if the magnitude of the learning operator being introduced is bounded within the unit circle in complex domain. Also it would be shown that the conventional learning control method is a kind of extremely simplified inverse model learning control method of the objective controlled system. Hence this control method can be considered as a generalization of the conventional learning control method. The more a designer model the objective controlled system precisely, the better the performance of the approximated inverse model learning controller would be. Finally we compare the performance of the conventional learning control method with that of the approximated inverse model learning control method by computer simulation.

• International Journal of Control, Automation, and Systems
• /
• 제6권1호
• /
• pp.24-34
• /
• 2008

A novel neural network model, termed the standard neural network model (SNNM), similar to the nominal model in linear robust control theory, is suggested to facilitate the synthesis of controllers for delayed (or non-delayed) nonlinear systems composed of neural networks. The model is composed of a linear dynamic system and a bounded static delayed (or non-delayed) nonlinear operator. Based on the global asymptotic stability analysis of SNNMs, Static state-feedback controller and dynamic output feedback controller are designed for the SNNMs to stabilize the closed-loop systems, respectively. The control design equations are shown to be a set of linear matrix inequalities (LMIs) which can be easily solved by various convex optimization algorithms to determine the control signals. Most neural-network-based nonlinear systems with time delays or without time delays can be transformed into the SNNMs for controller synthesis in a unified way. Two application examples are given where the SNNMs are employed to synthesize the feedback stabilizing controllers for an SISO nonlinear system modeled by the neural network, and for a chaotic neural network, respectively. Through these examples, it is demonstrated that the SNNM not only makes controller synthesis of neural-network-based systems much easier, but also provides a new approach to the synthesis of the controllers for the other type of nonlinear systems.

• ETRI Journal
• /
• 제43권3호
• /
• pp.483-510
• /
• 2021

In computational biology, desired patterns are searched in large text databases, and an exact match is preferable. Classical benchmark algorithms obtain competent solutions for pattern matching in O (N) time, whereas quantum algorithm design is based on Grover's method, which completes the search in $O(\sqrt{N})$ time. This paper briefly explains existing quantum algorithms and defines their processing limitations. Our initial work overcomes existing algorithmic constraints by proposing the quantum-based combined exact (QBCE) algorithm for the pattern-matching problem to process exact patterns. Next, quantum random access memory (QRAM) processing is discussed, and based on it, we propose the QRAM processing-based exact (QPBE) pattern-matching algorithm. We show that to find all t occurrences of a pattern, the best case time complexities of the QBCE and QPBE algorithms are $O(\sqrt{t})$ and $O(\sqrt{N})$, and the exceptional worst case is bounded by O (t) and O (N). Thus, the proposed quantum algorithms achieve computational speedup. Our work is proved mathematically and validated with simulation, and complexity analysis demonstrates that our quantum algorithms are better than existing pattern-matching methods.

• Kyungpook Mathematical Journal
• /
• 제63권2호
• /
• pp.235-250
• /
• 2023

Let 1 ≤ p, q < ∞ be fixed, and let R = [r_jk] be an infinite scalar matrix such that 1 ≤ r_jk < ∞ and sup_j,k r_jk < ∞. Let 𝓑(𝑙_p, 𝑙_q) be the set of all bounded linear operator from 𝑙_p into 𝑙_q. For a fixed Banach algebra 𝐁 with identity, we define a new vector space S^R_p,q(𝐁) of infinite matrices over 𝐁 and a paranorm G on S^R_p,q(𝐁) as follows: let $$S^R_{p,q}({\mathbf{B}})=\{A:A^{[R]}{\in}{\mathcal{B}}(l_p,l_q)\}$$ and $G(A)={\parallel}A^{[R]}{\parallel}^{\frac{1}{M}}_{p,q}$, where $A^{[R]}=[{\parallel}a_{jk}{\parallel}^{r_{jk}}]$ and M = max{1, sup_j,k r_jk}. The existance of S^R_p,q(𝐁) equipped with the paranorm G(·) including its completeness are studied. We also provide characterizations of β -dual of the paranormed space.

• 인터넷정보학회논문지
• /
• 제13권2호
• /
• pp.1-11
• /
• 2012

증가하는 모바일 데이터트래픽을 수익으로 연결시키기 위해서는 지금까지의 공급자 중심의 연구가 아닌 현재의 요금수준에 대한 소비자의 만족도를 포함한 소비자의 지불의사에 대한 연구 등 수요자 입장에서의 연구가 필요하다. 본 논문에서는 이중양분선택형질문법(DBDC)에 의한 조건부 가치측정법(CVM)을 이용하여 모바일 데이터서비스에 대한 지불의사금액을 추정하고 지속가능한 모바일 데이터서비스 제공을 위한 바람직한 전략을 제시하고자 한다. 연구결과 모바일 데이터서비스 지불의사금액에 영향을 미치는 요인은 모바일 데이터서비스의 인지수준 및 효용도로 나타났으며, 소비자들의 지불의사금액은 현재의 모바일 데이터서비스 요금수준보다 상당히 낮은 것으로 나타났다. 따라서 이동통신사업자들의 수익성을 제고할 수 있는 전략은 모바일 데이터서비스에 대한 적극적인 홍보와 함께 이용자들이 필요로 하는 콘텐츠의 강화를 통해 이용자가 느끼는 모바일 데이터서비스의 효용수준을 높임으로써 소비자들의 지불의사금액을 최대화하는 것이다. 이러한 분석결과는 이동통신사업자의 이동통신 사용요금을 증가시키기 위한 전략방안 마련에 활용될 수 있을 것으로 기대되며, 정부의 통신정책 방향에 대한 시사점을 제시하는데 활용될 수 있을 것이다.

• Journal of applied mathematics & informatics
• /
• 제28권1_2호
• /
• pp.13-30
• /
• 2010

Let C be a nonempty closed convex subset of a real Hilbert space H. Consider the following iterative algorithm given by $x_0\;{\in}\;C$ arbitrarily chosen, $x_{n+1}\;=\;{\alpha}_n{\gamma}f(W_nx_n)+{\beta}_nx_n+((1-{\beta}_n)I-{\alpha}_nA)W_nP_C(I-s_nB)x_n$, ${\forall}_n\;{\geq}\;0$, where $\gamma$ > 0, B : C $\rightarrow$ H is a $\beta$-inverse-strongly monotone mapping, f is a contraction of H into itself with a coefficient $\alpha$ (0 < $\alpha$ < 1), $P_C$ is a projection of H onto C, A is a strongly positive linear bounded operator on H and $W_n$ is the W-mapping generated by a finite family of nonexpansive mappings $T_1$, $T_2$, ${\ldots}$, $T_N$ and {$\lambda_{n,1}$}, {$\lambda_{n,2}$}, ${\ldots}$, {$\lambda_{n,N}$}. Nonexpansivity of each $T_i$ ensures the nonexpansivity of $W_n$. We prove that the sequence {$x_n$} generated by the above iterative algorithm converges strongly to a common fixed point $q\;{\in}\;F$ := $\bigcap^N_{i=1}F(T_i)\;\bigcap\;VI(C,\;B)$ which solves the variational inequality $\langle({\gamma}f\;-\;A)q,\;p\;-\;q{\rangle}\;{\leq}\;0$ for all $p\;{\in}\;F$. Using this result, we consider the problem of finding a common fixed point of a finite family of nonexpansive mappings and a strictly pseudocontractive mapping and the problem of finding a common element of the set of common fixed points of a finite family of nonexpansive mappings and the set of zeros of an inverse-strongly monotone mapping. The results obtained in this paper extend and improve the several recent results in this area.

• 대한수학회보
• /
• 제53권4호
• /
• pp.1071-1085
• /
• 2016

For $b{\in}L^1_{loc}({\mathbb{R}}^n)$, let ${\mathcal{I}}_{\alpha}$ be the bilinear fractional integral operator, and $[b,{\mathcal{I}}_{\alpha}]_i$ be the commutator of ${\mathcal{I}}_{\alpha}$ with pointwise multiplication b (i = 1, 2). This paper shows that if the commutator $[b,{\mathcal{I}}_{\alpha}]_i$ for i = 1 or 2 is bounded from the product Morrey spaces $L^{p_1,{\lambda}_1}({\mathbb{R}}^n){\times}L^{p_2,{\lambda}_2}({\mathbb{R}}^n)$ to the Morrey space $L^{q,{\lambda}}({\mathbb{R}}^n)$ for some suitable indexes ${\lambda}$, ${\lambda}_1$, ${\lambda}_2$ and $p_1$, $p_2$, q, then $b{\in}BMO({\mathbb{R}}^n)$, as well as that the compactness of $[b,{\mathcal{I}}_{\alpha}]_i$ for i = 1 or 2 from $L^{p_1,{\lambda}_1}({\mathbb{R}}^n){\times}L^{p_2,{\lambda}_2}({\mathbb{R}}^n)$ to $L^{q,{\lambda}}({\mathbb{R}}^n)$ implies that $b{\in}CMO({\mathbb{R}}^n)$ (the closure in $BMO({\mathbb{R}}^n)$of the space of $C^{\infty}({\mathbb{R}}^n)$ functions with compact support). These results together with some previous ones give a new characterization of $BMO({\mathbb{R}}^n)$ functions or $CMO({\mathbb{R}}^n)$ functions in essential ways.

• 대한수학회지
• /
• 제57권3호
• /
• pp.747-775
• /
• 2020

In this work we investigate the nonlocal elliptic equation with critical Hardy-Sobolev exponents as follows, $$(P)\;\{(-{\Delta}_p)^su={\lambda}{\mid}u{\mid}^{q-2}u+{\frac{{\mid}u{\mid}^{p{^*_s}(t)-2}u}{{\mid}x{\mid}^t}}{\hspace{10}}in\;{\Omega},\\u=0{\hspace{217}}in\;{\mathbb{R}}^N{\backslash}{\Omega},$$ where Ω ⊂ ℝ^N is an open bounded domain with Lipschitz boundary, 0 < s < 1, λ > 0 is a parameter, 0 < t < sp < N, 1 < q < p < p^∗_s where $p^*_s={\frac{N_p}{N-sp}}$, $p^*_s(t)={\frac{p(N-t)}{N-sp}}$, are the fractional critical Sobolev and Hardy-Sobolev exponents respectively. The fractional p-laplacian (-∆_p)^su with s ∈ (0, 1) is the nonlinear nonlocal operator defined on smooth functions by $\displaystyle(-{\Delta}_p)^su(x)=2{\lim_{{\epsilon}{\searrow}0}}\int{_{{\mathbb{R}}^N{\backslash}{B_{\epsilon}}}}\;\frac{{\mid}u(x)-u(y){\mid}^{p-2}(u(x)-u(y))}{{\mid}x-y{\mid}^{N+ps}}dy$, x ∈ ℝ^N. The main goal of this work is to show how the usual variational methods and some analysis techniques can be extended to deal with nonlocal problems involving Sobolev and Hardy nonlinearities. We also prove that for some α ∈ (0, 1), the weak solution to the problem (P) is in C^1,α(${\bar{\Omega}}$).